A hierarchy of uniquely parsable grammar classes and deterministic acceptors

Acta Informatica

Volumn 34, Issue 5, 1997, Pages 389-410

  Morita, Kenichi ^a   Nishihara, Noritaka ^b   Yamamoto, Yasunori ^c   Zhang, Zhiguo ^d  

^a HIROSHIMA UNIVERSITY   (Japan)

^b YAMAGATA UNIVERSITY   (Japan)

^c NATIONAL MUSEUM OF ETHNOLOGY   (Japan)

^d SUN YAT SEN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CONTEXT FREE LANGUAGES; EQUIVALENCE CLASSES; FINITE AUTOMATA; FORMAL LANGUAGES;

BACKTRACKING; DETERMINISTIC FINITE AUTOMATA; DETERMINISTIC LINEAR BOUNDED AUTOMATA; DETERMINISTIC PUSHDOWN AUTOMATA; UNIQUELY PARSABLE GRAMMAR;

CONTEXT FREE GRAMMARS;

EID: 0031295116     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050091     Document Type: Article

References (10)

1. Book, R.V.: Confluent and other types of Thue systems. J.ACM 29, 171-182 (1982)
2. Chomsky, N.: On certain formal properties of grammars. Inf. Control 2, 137-167 (1959)
3. Ginsburg, S, Greibach, S.: Deterministic context free languages. Inf. Control 9, 620-648 (1966)
4. Harrison, M.A., Havel, I.: Strict deterministic grammars. J. Comput. Syst. Sci. 7, 237-277 (1973)
5. Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages, and computation. Reading: Addison-Wesley 1979
6. Jantzen, M.: Confluent string rewriting. Berlin: Springer 1988
7. Knuth, D.E.: On the translation of languages from left to right. Inf. Control 8, 607-639 (1965)
8. McNaughton, R., Narendran, P., Otto, F.: Church-Rosser Thue systems and formal languages. J. ACM 35, 324-344 (1988)
9. Rosenkrantz, D.J., Stearns, R.E.: Properties of deterministic top-down grammars, Inf. Control 17, 226-256 (1970)
10. Sippu, S., Soisalon-Soininen, E.: Parsing theory Vol.II: LR(k) and LL(k) parsing. Berlin: Springer 1990