I believe the “better“ expression parsing technique is a Pratt parser. I used one in my compiler, but I found it quite hard to get my head around, like @cmuratori said.
-
-
Yep. Shunting yard seems like it could be fastest though? no recursion, just a tight loop, and once it’s written it’s written. It’s also not rocket science!
-
you have a queue and a stack though which could be expensive depending on your implementation
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.