4 ms·
In recursive descent you simply do not have any shift/reduce conflicts.
by sklogic 11y ago
In recursive descent you simply do not have any shift/reduce conflicts.
- MichaelMoser123 11y agoyou can have left recursion, or implicit left recursion in your recursive descent grammar, if you have then the parser gets stuck while parsing a clause that contains left recursion.
- sklogic 11y agoFirstly, this have nothing to do with shift/reduce. Secondly, you can safely handle left-recursive grammars in Packrat (which, in turn, can be implemented with combinators).
- MichaelMoser123 11y agoI didn't say that left recursion has anything to do with shift reduce conflicts. Please read again.
- sklogic 11y agoI see, yes, you mentioned loops earlier. Anyway, it is not a problem for combinator-based parsing, just use Packrat with a left-recursive extension [1] [1] http://www.vpri.org/pdf/tr2007002_packrat.pdf http://www.vpri.org/pdf/tr2007002_packrat.pdf