DFKI-LT - Regular Approximation of CFLs: A Grammatical View
Regular Approximation of CFLs: A Grammatical View
1 Advances in Probabilistic and other Parsing Technologies,
We show that for each context-free grammar a new grammar can be constructed that generates a regular language. This construction differs from some existing methods of approximation in that use of a pushdown automaton is avoided. This allows better insight into how the generated language is affected.
Files: BibTeX, Nederhof:2000:RACa.pdf