Linear time parsers for classes of non context free languages

DOI10.1016/0304-3975(95)00231-6zbMath0872.68102OpenAlexW2146417340MaRDI QIDQ671525

Priti Shankar, Sulekha R. Kulkarni

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00231-6

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20)

Cites Work

• Unnamed Item
• Upper bounds on recognition of a hierarchy of non-context-free languages
• A geometric hierarchy beyond context-free languages
• Tree adjunct grammars
• The equivalence of four extensions of context-free grammars

This page was built for publication: Linear time parsers for classes of non context free languages