Obtaining practical variants of ll(k) and lr(k) for k|? 1 by splitting the atomic k-tuple

....................................................................................................................................xi CHAPTER

[1]  Franklin L. DeRemer,et al.  Simple LR(k) grammars , 1971, Commun. ACM.

[2]  Donald E. Knuth,et al.  On the Translation of Languages from Left to Right , 1965, Inf. Control..

[3]  Henry G. Dietz,et al.  PCCTS reference manual: version 1.00 , 1992, SIGP.

[4]  Eljas Soisalon-Soininen,et al.  On the Complexity of LL(k) Testing , 1983, J. Comput. Syst. Sci..

[5]  Richard Bornat,et al.  Top-down Syntax Analysis , 1979 .

[6]  Bent Bruun Kristensen,et al.  Methods for Computing LALR(k) Lookahead , 1981, TOPL.

[7]  George H. Roberts.  From recursive ascent to recursive descent: via compiler optimizations , 1990, SIGP.

[8]  Daniel J. Rosenkrantz,et al.  Properties of deterministic top down grammars , 1969, STOC.

[9]  Thomas J. Pennello,et al.  Very fast LR parsing , 1986, SIGPLAN '86.

[10]  Wilf R. LaLonde,et al.  On directly constructing LR(k) parsers without chain reductions , 1976, POPL.

[11]  Charles N. Fischer,et al.  Crafting a Compiler , 1988 .

[12]  Eljas Soisalon-Soininen,et al.  On LL(k) Parsing , 1982, Inf. Control..

[13]  Sheila A. Greibach,et al.  A New Normal-Form Theorem for Context-Free Phrase Structure Grammars , 1965, JACM.

[14]  Heinz Dobler,et al.  Coco-2: a new compiler compiler , 1990, SIGP.

[15]  Massimo Ancona,et al.  Efficient construction of LR(k) states and tables , 1991, TOPL.

[16]  Fred Ives.  Unifying view of recent LALR(1) lookahead set algorithms , 1986, SIGPLAN '86.

[17]  Murray Hill,et al.  Yacc: Yet Another Compiler-Compiler , 1978 .

[18]  Heinz Dobler.  Top-down parsing in Coco-2 , 1991, SIGP.

[19]  Harry B. Hunt,et al.  On the complexity of LR(k) testing , 1975, CACM.

[20]  Alfred V. Aho,et al.  The Theory of Parsing, Translation, and Compiling , 1972 .

[21]  Alfred V. Aho,et al.  A technique for speeding up LR(k) parsers , 1972, SIAM J. Comput..

[22]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[23]  Alan J. Demers,et al.  Elimination of Single Productions and Merging Nonterminal Symbols of LR(1) Grammars , 1975, Comput. Lang..

[24]  F. L. Deremer,et al.  Practical translators for LR(k) languages , 1969 .

[25]  Esko Ukkonen,et al.  Lower Bounds on the Size of Deterministic Parsers , 1983, J. Comput. Syst. Sci..

[26]  Harry B. Hunt,et al.  Lower Bounds and Reductions Between Grammar Problems , 1978, JACM.

[27]  Karl M. Schimpf,et al.  Practical Arbitrary Lookahead LR Parsing , 1990, J. Comput. Syst. Sci..

[28]  Alfred V. Aho,et al.  A Technique for Speeding up LR(k) Parsers , 1973, SIAM J. Comput..

[29]  Richard Edwin Stearns,et al.  Syntax-Directed Transduction , 1966, JACM.

[30]  Benjamin M. Brosgol.  Deterministic Translation Grammars , 1973, Outstanding Dissertations in the Computer Sciences.

[31]  Karel Culik,et al.  LR-Regular Grammars - an Extension of LR(k) Grammars , 1973, J. Comput. Syst. Sci..

[32]  Karl M. Schimpf,et al.  A practical arbitrary look-ahead LR parsing technique , 1986, SIGPLAN '86.