6 research outputs found
Strict deterministic grammars
A grammatical definition of a family of deterministic context free languages is presented. It is very easy to decide if a context free grammar is strict deterministic. A characterization theorem involving pushdown automata is proved, and it follows that the strict deterministic languages are coextensive with the family of prefix free deterministic languages. It is possible to obtain an infinite hierarchy of strict deterministic languages as defined by their degree