Run-Time Extensible (Semi-)Top-Down Parser

  • Michal Žemlička
  • Jaroslav Král
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1692)


When reading a text or listening to a speech the words are processed by humans in the order they come. Intuitively there are some mental actions just after morfologic analysis of any newly recognized word. This mental action helps understanding of the given word (or positioning the word within the frame of the — still not complete — sentence). Within parsing of formal languages the closest to this idea is the top-down parsing that is usually used only together with LL gram- mars. Top-down parsing of programming languages has the advantage that it is possible to implement it by recursive descent parser — i.e. by a system of procedures that may recursively call each other. Such a system may be “tuned” by hand made changes. The usage of LL grammars is not always possible, because of the grammars of programming languages may have left recursive symbols. Programming language grammars are intuitively “close” to LL grammars. A good model for such grammars are kind grammars studied in this contribution. Kind grammars preserve all the important features of LL grammars advantageous for parsing.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullmann: Compilers Principles, Techniques, and Tools, Addison Wesley, 1986Google Scholar
  2. 2.
    Januš Drózd: Syntaktická analýza téměř shora dolů. (in Czech: Semi-Top-Down Parsing.) [Master Theses], Praha, MFF UK 1985.Google Scholar
  3. 3.
    Januš Dróozd: Syntaktická analýza rekurzivním sestupem pro LR(k) gramatiky. (in Czech: Recursive Descent Parsing for LR(k) Grammars.) [PhD Theses], Praha, MFF UK 1990.Google Scholar
  4. 4.
    Jaroslav Král: Syntaktická analýza a syntaxí řízený překlad. (In Czech: Parsing and Syntax Directed Translation. [Tech. report ÚVT ČVUT], Praha, ÚVT ČVUT, 1982.Google Scholar
  5. 5.
    Martin Plátek: Syntactic Error Recovery with Formal Guarantees I. [Tech. report MFF UK], Praha, MFF UK, April 1992Google Scholar
  6. 6.
    Nicolaas Sikkel: Parsing Schemata. Proefschrift Enschede, 1993, ISBN 90-9006688-8Google Scholar
  7. 7.
    Masaru Tomita, Se-Kiong Ng: The generalized LR Parsing Algorithm. (In Masaru Tomita (ed.): Generalized LR Parsing), Kluwer Academic Publishers, 1991, ISBN 0-7923-9201-9.Google Scholar
  8. 8.
    Michal Žemlička: Překladač rozšiřitelného jazyka. (In Czech: Extensible Language Compiler.) [Master Theses], Praha, MFF UK, 1994.Google Scholar
  9. 9.
    Michal Žemlička: Extensible LL(1) parser. [Poster], SOFSEM’95, Milovy, 1995Google Scholar
  10. 10.
    Michal Žemlička: Syntaktická analýza rozšiřitelných jazyů. (In Czech: Extensible Language Parsing.) [Tech. report MFF UK], Praha, MFF UK, December 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Michal Žemlička
    • 1
  • Jaroslav Král
    • 1
  1. 1.Department of Software Engineering, Faculty of Mathematics and PhysicsCharles UniversityPragueCzech Republic

Personalised recommendations