I have been looking through the fixity parsing utilities and couldn't figure out the analog of Parsec's buildExpressionParser table term. Given that I have a set of operators whose fixities and precedences I know, how do I build a parser that given another parser p, parses combinations of p with these operators?
Any help would be appreciated!
I have been looking through the fixity parsing utilities and couldn't figure out the analog of Parsec's
buildExpressionParser table term. Given that I have a set of operators whose fixities and precedences I know, how do I build a parser that given another parserp, parses combinations ofpwith these operators?Any help would be appreciated!