Abstract
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.
Supported by Grant Agency of Czech Republic, Grant-No. 201/99/0236.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullmann: Compilers Principles, Techniques, and Tools, Addison Wesley, 1986
Januš Drózd: Syntaktická analýza téměř shora dolů. (in Czech: Semi-Top-Down Parsing.) [Master Theses], Praha, MFF UK 1985.
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.
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.
Martin Plátek: Syntactic Error Recovery with Formal Guarantees I. [Tech. report MFF UK], Praha, MFF UK, April 1992
Nicolaas Sikkel: Parsing Schemata. Proefschrift Enschede, 1993, ISBN 90-9006688-8
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.
Michal Žemlička: Překladač rozšiřitelného jazyka. (In Czech: Extensible Language Compiler.) [Master Theses], Praha, MFF UK, 1994.
Michal Žemlička: Extensible LL(1) parser. [Poster], SOFSEM’95, Milovy, 1995
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Žemlička, M., Král, J. (1999). Run-Time Extensible (Semi-)Top-Down Parser. In: Matousek, V., Mautner, P., Ocelíková, J., Sojka, P. (eds) Text, Speech and Dialogue. TSD 1999. Lecture Notes in Computer Science(), vol 1692. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48239-3_22
Download citation
DOI: https://doi.org/10.1007/3-540-48239-3_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66494-9
Online ISBN: 978-3-540-48239-0
eBook Packages: Springer Book Archive