On Monday, July 4, 2016 at 12:40:14 PM UTC+12, BartC wrote: > The structure of such a parser doesn't need to exactly match the grammar > with a dedicated block of code for each operator precedence. It can be > table-driven so that an operator precedence value is just an attribute.
Of course. But that’s not a recursive-descent parser any more. -- https://mail.python.org/mailman/listinfo/python-list
