The Shunting-Yard Algorithm
Posted 11 December 2011 - 07:57 PM
Posted 11 December 2011 - 11:48 PM
For example, parsing token sequence A * B + C * D [end]
A A* A* B (A*B)+ <- A* and B have higher level than + (A*B)+ C (A*B)+ C* (A*B)+ C* D ((A*B)+(C*D))= <- (A*B)+, C* and D have higher level than [end]
If someone decides to use my version instead of original I can give additional details.
Posted 12 December 2011 - 10:39 AM
Posted 12 December 2011 - 11:15 AM
Posted 12 December 2011 - 12:40 PM
However I still just "Use the Forth Luke"
You can write a Forth interpreter in very little code
Posted 12 December 2011 - 02:35 PM
Currently working on: the 3D engine for Tomb Raider.
1 user(s) are reading this topic
0 members, 1 guests, 0 anonymous users