Issue with left recursion elimination

[michael-kamel]

The left recursion elimination output for a grammar like the following

S -> S a | S b

is currently

S' -> a S' | b S' | ϵ

While the operation itself is correct, it is not possible to eliminate left recursion from this grammar.

Handling cases like this by pointing out the problem with the grammar could be useful for bigger grammars.

[anshumankmr]

AFAIK, LR(0) automatons don't need the elimination of left recursion.

[CyberZHG]

The tool is used for double-checking manual calculations and not meant for production. 😿

[anshumankmr]

My bad.. sorry

[Apisteftos]

It's not working, there are several problems with the productions and the printing is not clear.

[mahadevhatti]

hii

[mahadevhatti]

you guys are crazy,lol