rust-bakery/nom

[Feature Request] Pratt Parsing combinators

stefnotch opened this issue · 2 comments

Implementing pratt parsing (or precedence climbing, which is supposedly the same algorithm) could be useful. I quite like it for parsing mathematical expressions with lots of different operators, since I no longer has to bend my parsing rules to fit, and can instead specify the binding power and associativity.

There are other libraries that have implemented this, for example

Duplicate of #1625

Thanks, then I'll close this one