On the complexities of linear LL(1) and LR(1) grammars
Several notions of deterministic linear languages are considered and compared with respect to their complexities and to the families of formal languages they generate. We exhibit close relationships between simple linear languages and the deterministic linear languages both according to Nasu and Honda and to Ibarra, Jiang, and Ravikumar. Deterministic linear languages turn out to be special cases of languages generated by linear grammars restricted to LL(1) conditions, which have a membership problem solvable in NC1. In contrast to that, deterministic linear languages defined via automata models turn out to have a DSPACE(logn)-complete membership problem. Moreover, they coincide with languages generated by linear grammars subject to LR(1) conditions.
KeywordsTuring Machine Regular Language Membership Problem Pushdown Automaton Input Head
Unable to display preview. Download preview PDF.
- J. L. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I, volume 11 of EATCS Monographs on Theoretical Computer Science. Springer, 1988.Google Scholar
- S. R. Buss. The boolean formula value problem is in ALOGTIME. In Proc. 19th Ann. ACM Symp. on Theory of Computing, pages 123–131, 1987.Google Scholar
- S. Ginsburg and E. H. Spanier. Finite-turn pushdown automata. SIAM Journal on Computing, 4(3):429–453, 1966.Google Scholar
- S. A. Greibach. An infinite hierarchy of context-free languages. Journal of the Association for Computing Machinery, 16:91–106, 1969.Google Scholar
- M. A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, 1978.Google Scholar
- J. E. Hopcroft and J. D. Ullman. Formal Languages and Their Relation to Automata. Addison-Wesley, 1968.Google Scholar
- A. Korenjak and J. Hopcroft. Simple deterministic languages. In IEEE Conference Record 7th Annual Symposium Switching Automata Theory, pages 36–46, 1966.Google Scholar
- R. Kurki-Suonio. Notes on top-down languages. Bit, 9:225–238, 1969.Google Scholar
- P. Lewis and R. Stearns. Syntax-directed transduction. Journal of the Association for Computing Machinery, 15:465–488, 1968.Google Scholar
- I. H. Sudborough. A note on tape-bounded complexity classes and linear context-free languages. Journal of the Association for Computing Machinery, 22(4):499–500, October 1975.Google Scholar
- I. H. Sudborough. On the tape complexity of deterministic context-free languages. Journal of the Association for Computing Machinery, 25:405–414, 1978.Google Scholar
- K. Wagner and G. Wechsung. Computational Complexity. Mathematics and its applications (East Europeans series). VEB Deutscher Verlag der Wissenschaften, Berlin, 1986.Google Scholar