User loginNavigation 
Eliminating left recursionDoes anyone have a reference to a correct algorithm which eliminates left recursion from a grammar? The one in Wikipedia is incorrect. Lots of youtube videos and lecture notes Google finds are also incorrect. All make the same mistake, they forget that a production A = N A X is left recursive if N is nullable. Requiring the grammar to be null free would be absurd since the algorithm itself inserts epsilon productions. I also wish to extend the requirement to an attribute grammar of the form usually used in practice, with an extra symbol kind for AST construction, etc, which cannot be eliminated and yet recognises the empty string. BTW: I'm looking for the basic algorithm. Lost my copy of the Dragon Book ;( By skaller at 20161202 17:31  LtU Forum  previous forum topic  next forum topic  other blogs  5561 reads

Browse archivesActive forum topics 
Recent comments
2 min 18 sec ago
54 min 48 sec ago
1 hour 41 min ago
2 hours 9 min ago
2 hours 31 min ago
2 hours 49 min ago
3 hours 32 min ago
3 hours 53 min ago
4 hours 9 min ago
5 hours 55 min ago