Principles of Compiler DesignAddison-Wesley Publishing Company, 1977 - 604 ページ Introduction 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. |
目次
Introduction to Compilers | 1 |
Programming Languages | 26 |
Chapter 3 Finite Automata and Lexical Analysis | 74 |
著作権 | |
他の 15 セクションは表示されていません
多く使われている語句
activation record ALGOL algorithm allocated array assignment assume B₁ basic block Boolean 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 initial node 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 output parse tree parsing table path PL/I pointer postfix production programming language quadruple recursive reduce regular expression replace right side routine rules 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₁ temporary terminal three-address code three-address statements tion token translation scheme ud-chaining viable prefix