Abstract
In this paper it is shown that it is possible to transform any LL-regular grammar G into an LL(1) grammar G' in such a way that parsing G' is as good as parsing G. That is, a parse of a sentence of grammar G can be obtained with a simple string homomorphism from the parse of a corresponding sentence of G'. Since any LL(k) grammar is an LL-regular grammar the results that are obtained are valid for LL(k) grammars as well. The relation between LL-regular grammars is expressed by means of a generalized version of the well-known cover relation between two grammars.
| Original language | English |
|---|---|
| Pages (from-to) | 387-406 |
| Number of pages | 20 |
| Journal | RAIRO Informatique Théorique |
| Volume | 16 |
| Publication status | Published - 1982 |
Keywords
- IR-66955
- EWI-9293