Unary operators and the Shunting Yard algorithm

I use the Shunting Yard algorithm to handle precedence when parsing expressions in my assembler . It's great because not only is it simple to implement, but it simplifies the code in a hand-written recursive descent parser . The BNF is effectively: ; BNF per RFC-5234 expr = factor *(op factor) op = '*' ; just the basic ops for now / '/' ; adding more is just adding / '+' ; them to this definition…