Principles of Compiler DesignIntroduction to compilers; Programming languages; Finite automata and lexical analysis; The syntatic specification of programming languages; Basic parsing techniques; Automatic construction of efficient parsers; Syntax-directed translation; More about translation; Sumbol tables; Run-time storage administration; Error detection and recovery; Introduction to code optimization; More about loop optimization; More about data-flow analysis; Code generation. |
Contents
Introduction to Compilers | 1 |
Programming Languages | 26 |
Finite Automata and Lexical Analysis | 74 |
Copyright | |
16 other sections not shown
Common terms and phrases
activation record ALGOL algorithm allocated array assignment B₁ B₂ basic block begin Chapter compiler compute consider construct context-free grammars data-flow analysis declared defined definition denote derivation digit discussed edges error evaluate example flow graph FORTRAN goto handle identifier implementation IN[n induction variable input symbol integer intermediate code jump keyword labeled left-recursion leftmost lexical analyzer lookahead loop LR parser machine method n₁ nonterminal object code offset operands operator operator-precedence operator-precedence parser optimization OUT[n output parse tree parsing table path PL/I pointer postfix precedence production programming language quadruple r-value recursive reduce regular expression replace right side routine Section semantic actions sequence sets of items shown in Fig source program stack storage string symbol table symbol-table entry syntactic syntax syntax-directed translation T₁ T₂ temporary terminal three-address code three-address statements tion token translation scheme ud-chaining viable prefix
References to this book
Handbook of Formal Languages: Volume 1. Word, Language, Grammar Grzegorz Rozenberg Limited preview - 1997 |
Classical and Quantum Computation Alexei Yu. Kitaev,Alexander Shen,Mikhail N. Vyalyi No preview available - 2002 |