Abstract
Several results pertaining to LL-regular grammars are presented. The decidability of whether or not a grammar is LL-regular for a particular regular partition, which was first stated by Nijholt, and the undecidability of whether or not a regular partition exists for which a grammar is LL-regular are proved. An algorithm for converting an LL-regular grammar into a strong LL-regular grammar that generates the same language is presented, and the construction of a two pass parser is described.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call