Implementation of ll(k) to ll(1) convertor !

Question

is there any implementation of ll(k) to ll(1) convertor ?

Answer 1

IIRC; in general, no because some languages have ll(k) grammars but no ll(1) grammars. So unless I'm mistaken, not all ll(k) can be converted ll(1). However, that says nothing about the possibility of such a tool that will work the cases where it can be done.

---

the rule for left factoring is:

A := A B |
     A C |
     D |
     E ;

turns into:

A := (D | E) (B | C)*

or if you don't allow () groups and *:

A := D A'
     E A'

A' := B A' |
      C A' |
      nul ;

The trick becomes how to handle the translation of the action rules; if your language supports it, lambdas can be kinda handy there.