Parsing regular grammars with finite lookahead

DOI10.1007/BF00261256zbMATH Open0452.68089OpenAlexW2026527658MaRDI QIDQ1148699FDOQ1148699

Authors: Thomas J. Ostrand, Elaine J. Weyuker, Marvin C. Paull 

Publication date: 1981

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00261256

zbMATH Keywords

lookaheadunambiguous regular grammar

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Cited In (1)

• On the complexity of regular-grammars with integer attributes

This page was built for publication: Parsing regular grammars with finite lookahead

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1148699)