The Equivalence Problem for LL- and LR-Regular Grammars


Questions whether or not two grammars belonging to a family of grammars generate the same language have extensively been studied in the literature. These problems are called equivalence problems and if there exists an algorithm which for each pair of grammars of this family gives an answer to this question then the equivalence problem for this family of… (More)
DOI: 10.1007/3-540-10854-8_32


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics