2nd ed. 2013, XII, 399 p. 171 illus., 1 illus. in color.
Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.
You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.
After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.
Supplies supplementary teaching tools at an associated website
Now presents a novel conceptual approach to parsing algorithms that applies to extended BNF grammars, together with a parallelparsing algorithm
This fully revised and expanded new edition elucidates the elegance and simplicity of the fundamental theory underlying Formal Languages and Compilation.
Retaining the reader-friendly, minimalist style of the first edition, this uniquely versatile textbook describes the essential principles and methods used for defining the syntax of artificial languages, and for designing efficient parsing algorithms and syntax-directed translators with semantic attributes. A comprehensive selection of topics is presented within a rigorous, unified framework, illustrated by numerous practical examples.
Features and topics:
Presents a novel conceptual approach to parsing algorithms that applies to extended BNF grammars, together with a parallelparsing algorithm (NEW)
Supplies supplementary teaching tools, including course slides and exercises with solutions, at an associated website
Unifies the concepts and notations used in different approaches, enabling an extended coverage of methods with a reduced number of definitions
Systematically discusses ambiguous forms, allowing readers to avoid pitfalls when designing grammars
Describes all algorithms in pseudocode, so that detailed knowledge of a specific programming language is not necessary
Makes extensive usage of theoretical models of automata, transducers and formal grammars
Includes concise coverage of algorithms for processing regular expressions and finite automata
Introduces static program analysis based on flow equations
This clearly-written, classroom-tested textbook is an ideal guide to the fundamentals of this field for advanced undergraduate and graduate students in computer science and computer engineering. Some background in programming is required, and readers should also be familiar with basic set theory, algebra and logic.