Parsing strategies: A concise survey

Preliminary report
  • Anton Nijholt
Invited Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 118)


Left Corner Precedence Relation Operator Precedence Nonterminal Symbol Context Grammar 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aho, A.V. and J.D. Ullman. The Theory of Parsing, Translation and Compiling, Vols. 1 and 2. Prentice Hall, Englewoods Cliffs, N.J., 1972 and 1973.Google Scholar
  2. 2.
    Aho, A.V. and J.D. Ullman. Principles of Compiler Design. Addison Wesley, Reading, Mass., 1977.Google Scholar
  3. 3.
    Beatty, J.C. On the relationship between the LL(1) and LR(1) grammars. CS-79-36, University of Waterloo, Waterloo, 1979.Google Scholar
  4. 4.
    Brosgol, B.M. Deterministic translation grammars. TR3-74, Harvard University, Cambridge, Mass., 1974.Google Scholar
  5. 5.
    Brosgol, B.M. Deterministic translation grammars. Proc. Eight Princeton Conf. on Information Sciences and Systems 1974, 300–306.Google Scholar
  6. 6.
    Conway, M. Design of a separable transition diagram compiler. Comm. ACM 6 (1963), 396–408.Google Scholar
  7. 7.
    Demers, A.J. Generalized left corner parsing. Conf. Record of the Fourth ACM Symp. on Principles of Programming Languages 1977, 170–182.Google Scholar
  8. 8.
    DeRemer, F.L. Simple LR(k) grammars. Comm. ACM 14 (1971), 453–460.Google Scholar
  9. 9.
    Deussen, P. One abstract parsing algorithm for all kinds of parsers. In: Automata, Languages and Programming, H.A. Maurer (ed.), Lect. Notes in Comp. Sci. 71 (Springer, Berlin, 1979), 203–217.Google Scholar
  10. 10.
    Fisher, G.A. and M. Weber. LALR(1) parsing for languages without reserved words. SIGPLAN Notices 14, November 1979, 26–30.Google Scholar
  11. 11.
    Friede, D. Transition diagrams and strict deterministic grammars. In: 4th GI Conf. on Theoretical Computer Science, K. Weihrauch (ed.), Lect. Notes in Comp. Sci. 14 (Springer, Berlin, 1979), 113–123.Google Scholar
  12. 12.
    Geller, M.M., M.A. Harrison and I.M. Havel. Normal forms of deterministic grammars. Discrete Mathematics 16 (1976), 313–321.Google Scholar
  13. 13.
    Geller, M.M., S.L. Graham and M.A. Harrison. Production prefix parsing. In: Automata, Languages and Programming, J. Loeckx (ed.), Lect. Notes in Comp. Sci. 14 (Springer, Berlin, 1974), 232–241.Google Scholar
  14. 14.
    Ghezzi, C. LL(1) grammars supporting an efficient error handling. Information Processing Letters 3 (1975), 174–176.Google Scholar
  15. 15.
    Graham, S.L. Precedence languages and bounded right context languages. Ph. D. Thesis, Dept. of Computer Science, Stanford University, California, 1971.Google Scholar
  16. 16.
    Graham, S.L. On bounded right context languages and grammars. SIAM J. of Comput. 3 (1974), 224–254.Google Scholar
  17. 17.
    Gray, J.N. and M.A. Harrison. Canonical precedence schemes. J. Assoc. Comput. Mach. 20 (1973), 214–234.Google Scholar
  18. 18.
    Gray, J.N. and M.A. Harrison. On the covering and reduction problems for context-free grammars. J. Assoc. Comput. Mach. 19 (1972), 675–698.Google Scholar
  19. 19.
    Hammer, M.A. A new grammatical transformation into deterministic top-down form. Mac TR-119, Ph. D. Thesis, Massachusetts Institute of Technology, 1974.Google Scholar
  20. 20.
    Harrison, M.A. Introduction to Formal Language Theory. Addison Wesley, Reading, Mass. 1978.Google Scholar
  21. 21.
    Harrison, M.A. On covers and precedence analysis. In: GI-3. Jahrestagung, W. Brauer (ed.), Lect. Notes in Comp. Sci. 1 (Springer, Berlin, 1973), 2–17.Google Scholar
  22. 22.
    Harrison, M.A. and I.M. Havel. Strict deterministic grammars. J. Comput. System Sci. 7 (1973), 237–277.Google Scholar
  23. 23.
    Harrison, M.A. and I.M. Havel. On the parsing of deterministic languages. J. Assoc. Comput. Mach. 21 (1974), 525–548.Google Scholar
  24. 24.
    Harrison, M.A. and I.M. Havel. Real-time strict deterministic languages. SIAM J. of Comput. 1 (1972), 333–349.Google Scholar
  25. 25.
    Harrison, M.A. and A. Yehudai. A hierarchy of determinstic languages. J. Comput. System Sci. 19 (1979), 63–78.Google Scholar
  26. 26.
    Hunt III, H.B. and D.J. Rosenkrantz. Complexity of grammatical similarity relations. Proc. of the Conf. on Theoretical Computer Science, Waterloo, 1977, 139–145.Google Scholar
  27. 27.
    Johnson, S.C. YACC — yet another compiler-compiler. CSTR 32, Bell Laboratories, Murray Hill, New Jersey.Google Scholar
  28. 28.
    Knuth, D.E. On the translation of languages from left to right. Information and Control 8 (1965), 607–639.Google Scholar
  29. 29.
    Kral, J. and J. Demner. Semi-top-down syntax analysis. Research report UVT 6/73, Tecnnical University of Prague, 1973.Google Scholar
  30. 30.
    Kral, J. and J. Demner. A note on the number of states of DeRemer's recognizer. Information Processing Letters 2 (1973), 22–23.Google Scholar
  31. 31.
    Kretinsky, M. Semi-top-down syntax analysis of precedence grammars. Scripta Fac. Sci. Natur. UJEP Brunensis Math. 8 (1978), 1–11.Google Scholar
  32. 32.
    Lomet, D.B. Automatic generation of multiple exit parsing strategies. In: Automata, Languages and Programming, J. Loeckx (ed.), Lect. Notes in Comp. Sci. 14 (Springer, Berlin, 1974), 214–231.Google Scholar
  33. 33.
    Lomet, D.B. A formalization of transition diagram systems. J. Assoc. Comput. Mach. 20 (1973), 235–257.Google Scholar
  34. 34.
    Mayer, O. A framework for producing deterministic canonical bottom-up parsers. In: Mathematical Foundations of Computer Science, Lect. Notes in Comput. Sci. 64 (Springer, Berlin, 1978), 355–363.Google Scholar
  35. 35.
    McAfee, J. and L. Presser. An algorithm for the design of simple precedence grammars. J. Assoc. Comput. Mach. 19 (1972), 385–395.Google Scholar
  36. 36.
    Mickunas, M.D. On the complete covering problem for LR(k) grammars. J. Assoc. Comput. Mach. 23 (1976), 17–30.Google Scholar
  37. 37.
    Milton, D.R., L.W. Kirchhoff and B.R. Rowland. An ALL(1) compiler generator. SIGPLAN Notices 14, August 1979, 152–157.Google Scholar
  38. 38.
    Moll, K.R. Left context precedence grammars. Acta Informatica 14 (1980), 317–336.Google Scholar
  39. 39.
    Moura, A. Syntactic equivalence of grammar classes. Ph. D. Thesis, 1980, Berkeley.Google Scholar
  40. 40.
    Nijholt, A. Context-Free Grammars: Covers, Normal Forms, and Parsing. Lect. Notes in Comp. Sci. 93 (Springer, Berlin, 1980).Google Scholar
  41. 41.
    Nijholt, A. and J. Pittl. A framework for classes of grammars between the LL(k) and LR(k) grammars. In preparation (see also CSTR-80-25, McMaster University).Google Scholar
  42. 42.
    Nijholt, A, and E. Soisalon-Soininen. Ch(k) grammars: A characterization of LL(k) languages. In: Mathematical Foundations of Computer Science. J. Becvár (ed.), Lect. Notes in Comp. Sci. 74 (Springer, Berlin, 1979), 390–397.Google Scholar
  43. 43.
    Nijholt, A. Strict deterministic grammars and Greibach normal form. Elektr. Informationsverarbeitung und Kybernetik (EIK) 15 (1979), 395–401.Google Scholar
  44. 44.
    Nijholt, A. The equivalence problem for LL-and LR-regular grammars. In: Fundamentals of Computation Theory. Proceedings of the 3rd Conference, 1981.Google Scholar
  45. 45.
    Nijholt, A. On the equivalence problem for extended left corner grammars, manuscript, 1981.Google Scholar
  46. 46.
    Nijholt, A. On the relationship between the LL(k) and LR(k) grammars. submitted for publication.Google Scholar
  47. 47.
    Nijholt, A. Precedence relations: A bibliography. manuscript, 1981.Google Scholar
  48. 48.
    Persch, G., G. Winterstein, S. Drossopoulou and M. Dausmann. An LALR(l) grammar for (Revised) Ada. SIGPLAN Notices 16, No. 3, March 1981, 85–98.Google Scholar
  49. 49.
    Pittl, J. On LLP(k) grammars and languages. Theoret. Comput. Sci. 16 (1981).Google Scholar
  50. 50.
    Räihä, K.-J. and E. Ukkonen. Balancing syntactic and semantic power in compiler specification. In: Information Processing 80, North Holland, 1980, 65–70.Google Scholar
  51. 51.
    Schlichtiger, P. Kettengrammatiken: Ein Konzept zur Definition handhabbarer Grammatikklassen mit effizientem Analyseverhalten. Ph. D. Thesis, Kaiserslautern, 1979.Google Scholar
  52. 52.
    Schlichtiger, P. Partitioned chain grammars. In: Automata, Languages and Programming, J.W. de Bakker and J. v. Leeuwen (eds.), Lect. Notes in Comp. Sci. 85 (Springer, Berlin, 1980), 555–568.Google Scholar
  53. 53.
    Shyamasundar, R.K. Precedence regular grammars. Int. J. Comput. Math. 7 (1979), 173–186.Google Scholar
  54. 54.
    Soisalon-Soininen, E. Characterization of LL(k) languages by restricted LR(k) grammars. Ph. D. Thesis, Report A-1977-3, University of Helsinki.Google Scholar
  55. 55.
    Soisalon-Soininen, E. and E. Ukkonen. A method for transforming grammars into LL(k) form. Acta Informatica 12 (1979), 339–369.Google Scholar
  56. 56.
    Soisalon-Soininen, E. and D. Wood. On a covering relation for context-free grammars. CSTR 80-CS-21, McMaster University, Hamilton.Google Scholar
  57. 57.
    Sudborough, I.H. A note on weak operator precedence grammars. IPL7 (1978) 213–218.Google Scholar
  58. 58.
    Ukkonen, E. A modification of the LR(k) method for constructing compact bottom-up parsers. Automata, Languages and Programming, LNCS 71, 1979, 646–658.Google Scholar
  59. 59.
    Yehudai, A. A hierarchy of real-time deterministic languages and their equivalence. manuscript, 1980.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Anton Nijholt
    • 1
  1. 1.AmsterdamThe Netherlands

Personalised recommendations