parser combinators
mgood7123 opened this issue · comments
how would i design the and of a parser combinator so that i do not need to create an infinite number of functions for it
https://rosettacode.org/wiki/Parsing/RPN_calculator_algorithm can this be applied to a parser combinator? For example, (A && B) || C would become A B && C || and then parsed using the RPN Calculator Algorithm ?
as i am having trouble figuring out how to correctly implement parenthesis parsing so i can then parse combinational logic such as A and B or C instead of only A and B and C or A or B or C