The Theory of Parsing, Translation, and Compiling: Compiling |
Other editions - View all
The Theory of Parsing, Translation, and Compiling: Compiling Alfred V. Aho,Jeffrey D. Ullman No preview available - 1972 |
Common terms and phrases
a₁ a₂ Algorithm 10.3 assembly language assume B₁ B₂ block canonical set compiler compute configuration construct context-free grammar defined definition derivation direct descendants DPDA E₂ equivalent Example Exercise expression F₁ flow graph FORTRAN G₁ goto grammar G hash table header identifier implement index cell input string input symbol instructions integer interior node intersection list J. D. ULLMAN label Lemma lexical analyzer LL(k LOAD lookahead loop n₁ n₂ nonterminal optimal output P₁ P₂ parse tree parser parsing algorithm pointer precedence grammar precedence matrix precedence relations Proof property grammar pushdown list pushdown transducer reduce S₁ SDTS sequence set of items set of LR(k set of tables shift shift matrix Show shown in Fig simple precedence simple precedence grammar statement step Suppose symbol table syntax tree T₁ T₂ tables for G Theorem transformations variable weak precedence X₁