Two-type bracketed grammars
- 1 October 1968
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 315-326
- https://doi.org/10.1109/swat.1968.40
Abstract
A new type of grammar for generating formal languages, the two-type bracketed grammar, is presented. A two-type bracketed grammar is an extension of a context free grammar. It is shown that this type of grammar generates a class of languages which is exactly the class of one way nondeterministic stack languages. Thus, a new approach to the study of stack languages is opened.Keywords
This publication has 3 references indexed in Scilit:
- One-way stack automataJournal of the ACM, 1967
- Two results on one-way stack automataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1967
- Stack automata and compilingJournal of the ACM, 1967