Abstract
This paper generalizes the notion of a strong LL(k) context-free grammar for the case of conjunctive grammars and develops a top-down parsing algorithm for the resulting language family. A top-down parser of a conjunctive language attempts to construct a derivation of the input string, at each step using a finite lookahead to determine which grammar rule to apply. Fragments of formulae that form the derivation are stored in a tree-structured pushdown. Two ways to implement top-down parsers are suggested: a table-driven parser with a tree-structured pushdown and a recursive descent parser. Both techniques naturally extend their context-free counterparts.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aho, A.V. and J.D. Ullman. The Theory of Parsing, Translation and Compiling, Vol. I: Parsing, Prentice-Hall, Englewood Cliffs, NJ, 1972.
Harrison, M. A. Introduction to Formal Language Theory, Addison-Wesley, Reading, MA., 1978.
Latta, M. and R. Wall. Intersective context-free languages, Lenguajes Naturales y Lenguajes Formales IX, Barcelona, 1993, 15–43.
Lewis, P. M. and R. E. Stearns. Syntax-directed transduction, Journal of the ACM 15(3): 465–488, 1968.
Liu, L. Y. and P. Weiner. An infinite hierarchy of intersections of context-free languages, Mathematical Systems Theory 7: 187–192, 1973.
Okhotin, A. Conjunctive grammars. In Pre-proceedings of DCAGRS 2000, Dept. of Computer Science, University of Western Ontario, London, Ontario, Canada. Report No. 555 (2000).
Okhotin, A. Conjunctive grammars, full version of [6], Journal of Automata, Languages and Combinatorics, 6(4), 2001.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Okhotin, A. Top-Down Parsing of Conjunctive Languages. Grammars 5, 21–40 (2002). https://doi.org/10.1023/A:1014219530875
Issue Date:
DOI: https://doi.org/10.1023/A:1014219530875