In computer science, an operator precedence parser is a bottom-up parser that interprets an operator-precedence grammar. For example, most calculators use operator precedence parsers to convert from the human-readable infix notation relying on order of operations to a format that is optimized for evaluation such as Reverse Polish notation (RPN). https://en.wikipedia.org/wiki/Operator-precedence_parser
If you want to learn more, so you can check the commits one by one:
- https://github.com/BaseMax/PrattParsingC/commit/f416596b83084bad8329785caeba946aadc0a333
- https://github.com/BaseMax/PrattParsingC/commit/8a0cc4bf463786b65a26246cbb2988242f8d8e92
- https://github.com/BaseMax/PrattParsingC/commit/fa841a498f536610fa2507db532a00af3a05462b
- https://github.com/BaseMax/PrattParsingC/commit/fc14a4b77c4e3ff4437efa1543d81ff7258f4e16
- https://github.com/BaseMax/PrattParsingC/commit/7b49971d84a84d3ec28d08972d399213bada9678
- https://github.com/BaseMax/PrattParsingC/commit/182367671e4d2e1ef50035596679709cd8b44f7a
- https://github.com/BaseMax/PrattParsingC/commit/d199314463601f2696e0af6ecebd00f0b563bfcd
Thank you so much for Mikey, he showed something special and perfect to me. It's why I said I dont know nothing and I'm learning new things everyday.
© Copyright Michael Brown, Max Base; 2021