Parsing Theory: Volume I Languages and Parsing (Monographs in Theoretical Computer Science. An EATCS Series, 15)

Sippu, Seppo; Soisalon-Soininen, Eljas

ISBN 10: 3540137203 / ISBN 13: 9783540137207

Published by Springer, 1988

Brand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address. Seller Inventory # SHAK238836

Synopsis:

The theory of parsing is an important application area of the theory of formal languages and automata. The evolution of modem high-level programming languages created a need for a general and theoretically dean methodology for writing compilers for these languages. It was perceived that the compilation process had to be "syntax-directed", that is, the functioning of a programming language compiler had to be defined completely by the underlying formal syntax of the language. A program text to be compiled is "parsed" according to the syntax of the language, and the object code for the program is generated according to the semantics attached to the parsed syntactic entities. Context-free grammars were soon found to be the most convenient formalism for describing the syntax of programming languages, and accordingly methods for parsing context-free languages were devel­ oped. Practical considerations led to the definition of various kinds of restricted context-free grammars that are parsable by means of efficient deterministic linear-time algorithms.

Product Description: The theory of parsing is an important application area of the theory of formal languages and automata. The evolution of modem high-level programming languages created a need for a general and theoretically dean methodology for writing compilers for these languages. It was perceived that the compilation process had to be "syntax-directed", that is, the functioning of a programming language compiler had to be defined completely by the underlying formal syntax of the language. A program text to be compiled is "parsed" according to the syntax of the language, and the object code for the program is generated according to the semantics attached to the parsed syntactic entities. Context-free grammars were soon found to be the most convenient formalism for describing the syntax of programming languages, and accordingly methods for parsing context-free languages were devel­ oped. Practical considerations led to the definition of various kinds of restricted context-free grammars that are parsable by means of efficient deterministic linear-time algorithms.

Bibliographic Details

Title: Parsing Theory: Volume I Languages and ...
Publisher: Springer
Publication Date: 1988
Binding: Hardcover
Condition: New