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.
