## A General Model for Fixed Look-ahead LR ParsersUniversity of California, Santa Cruz, Computer Research Laboratory, 1987 - Parsing (Computer grammar) - 32 pages |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Common terms and phrases

algorithm amount of look-ahead applicable moves backtracking CFG G class of LALR(k class of NQLALR(k,m Closure Closure operation computing conflicting symbol construction method contains the class context-free grammars corresponding LR(0 defined as follows Definition denoted DeRemer and Pennello deterministic empty string finite set Finite-state Automata G is NQLALR(k,m grammar class Hence inconsistent state q input instantaneous descriptions LALR LALRk moves LALRkReadst LALRkReduces left context Lemma look-ahead automaton LAA look-ahead items Look-ahead LR Parsers look-ahead sets look-ahead strings look-ahead-scan move LR(k non-final look-ahead Not-Quite NQLALR NQLALR(l NQLALR™Readst NQSLR NQSLR(k,m parser is shown parser LALRk parser's stack partial function Pennello 9 production Proof is analogous Proof of theorem Readst reduce moves reduce-move reduced and acyclic ReducesA_ relations sentential form sequence of LALRk set of look-ahead shift-move simulation SLR(k SLRk SLRkReads SLRkReduces stack suffix StarteK successor technique terminal symbol theorem 3.1 truncm type of parser University of Florida