Overview
Part of the book series: Monographs in Theoretical Computer Science. An EATCS Series (EATCS, volume 15)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
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.
Similar content being viewed by others
Keywords
Table of contents (5 chapters)
-
Front Matter
-
Back Matter
Authors and Affiliations
Bibliographic Information
Book Title: Parsing Theory
Book Subtitle: Volume I Languages and Parsing
Authors: Seppo Sippu, Eljas Soisalon-Soininen
Series Title: Monographs in Theoretical Computer Science. An EATCS Series
DOI: https://doi.org/10.1007/978-3-642-61345-6
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1988
Hardcover ISBN: 978-3-540-13720-7Published: 01 July 1988
Softcover ISBN: 978-3-642-64801-4Published: 23 August 2014
eBook ISBN: 978-3-642-61345-6Published: 06 December 2012
Series ISSN: 1431-2654
Series E-ISSN: 2193-2069
Edition Number: 1
Number of Pages: VIII, 228
Number of Illustrations: 1 b/w illustrations
Topics: Programming Techniques, Theory of Computation, Algorithm Analysis and Problem Complexity, Mathematical Logic and Formal Languages