• Corpus ID: 60775129

The Theory of Parsing, Translation, and Compiling

  title={The Theory of Parsing, Translation, and Compiling},
  author={Alfred V. Aho and Jeffrey D. Ullman},
From volume 1 Preface (See Front Matter for full Preface) This book is intended for a one or two semester course in compiling theory at the senior or graduate level. It is a theoretically oriented treatment of a practical subject. Our motivation for making it so is threefold. (1) In an area as rapidly changing as Computer Science, sound pedagogy demands that courses emphasize ideas, rather than implementation details. It is our hope that the algorithms and concepts presented in this book… 
Experimental comparison of some parsing methods
This paper will describe a set of experiments performed to compare several techniques which can be used for the various phases of a compiler, and the methods chosen were: recursive descent, SLR and operator precedence.
It is shown that the parsing algorithm can accept context-dependent "advice" in such a way as to facilitate the writing of "intelligent" grammars, and the role of syntax in contributing to efficient parsing is discussed.
Parsing Transformative LR(1) Languages
This work develops a test which examines the grammar as it changes, stopping the parse if the grammar changes in a way that would invalidate earlier assumptions made by the parser, and develops a parsing algorithm which should prove a useful foundation for a new kind of programming language.
Towards a Unifying Theory of Context-free Parsing
An approach to context-free parsing which builds up a meta-theory from scratch which convinces the reader that practically all known parsing algorithms stem from a single source.
Algebraic Languages: A Bridge between Combinatorics and Computer Science
  • M. Delest
  • Computer Science
    Formal Power Series and Algebraic Combinatorics
  • 1994
The classical Schützenberger methodology and two extensions are described: grammars with operators and q-grammars, which introduce operators in order to construct more intricate languages starting from a given language.
Practical Packrat Parsing
Rats!, a parser generator for Java that supports easily modifiable grammars and avoids the complexities associated with altering LR or LL grammarmars, and supports simpler grammar specifications and more convenient error reporting through aggressive optimizations.
Dynamic programming as frame for efficient parsing
  • M. FerroMiguel A. AlonsoD. Souto
  • Computer Science
    Proceedings SCCC'98. 18th International Conference of the Chilean Society of Computer Science (Cat. No.98EX212)
  • 1998
This work justifies the consideration of dynamic programming, both in definite clause and context free grammar parsing, highlighting the parallelism between the conclusions reached in both cases and focuses on the computational properties.
Fundamentals of Programming Languages
  • E. Horowitz
  • Computer Science
    Springer Berlin Heidelberg
  • 1984
Though at the time of writing this it is unclear how popular or influential Ada will become, I have decided to select many examples from Ada as the authors make their way through this book, with a list of the high level programming languages Advances in the '70s.
On speculating across opaque barriers
  • A. Lockman
  • Philosophy
    Behavioral and Brain Sciences
  • 1983
sented in the machine and controlling the computation; yet since it is being run in interpreted form it counts as data for the interpreter. The point of the example is to show how unclear the
An Abstract Machine for Unification Grammars
This work describes the design and implementation of an abstract machine, Amalia, for the linguistic formalism ALE, which is based on typed feature structures, and is the first system that employs a direct compilation scheme for unification grammars that are based on typing feature structures.