lua-users home
lua-l archive

[Date Prev][Date Next][Thread Prev][Thread Next] [Date Index] [Thread Index]

I was wondering if anyone using LPEG for grammars with left recursion
had tried to implement the ideas in Alessandro Warth's PhD thesis
"Experimenting With Programming Languages":

Seems like a really interesting extension to PEGs.  I came across it
via .  I'm not a PEG expert, but I
haven been using them to model languages and have found it really
quite cumbersome to handle left recursion because it has ugly
consequences for what the parser outputs in terms of captures.

Anyway, food for thought.