DocumentCode
2199791
Title
Two-type bracketed grammars
Author
Schkolnick, Mario
fYear
1968
fDate
15-18 Oct. 1968
Firstpage
315
Lastpage
326
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
Automata; Formal languages; Laboratories; Production;
fLanguage
English
Publisher
ieee
Conference_Titel
Switching and Automata Theory, 1968., IEEE Conference Record of 9th Annual Symposium on
Conference_Location
Schenedtady, NY, USA
ISSN
0272-4847
Type
conf
DOI
10.1109/SWAT.1968.40
Filename
4569579
Link To Document