Talk:Recursive descent parser generator: Difference between revisions
Content added Content deleted
(Created page with "== Input specification == The main thing that needs to be fixed before adding any examples is the input specification. I want to make it detailed enough to be at least slightl...") |
No edit summary |
||
Line 13: | Line 13: | ||
Is there any way to simplify this? |
Is there any way to simplify this? |
||
⚫ | |||
The example I want to use is to take an arithmetic expression and turn it in to a series of single operations in the right order. So: |
|||
<pre> |
|||
(one + two) * three + four * five |
|||
</pre> |
|||
Becomes something like: |
|||
<pre> |
|||
_a = one + two |
|||
_b = _a * three |
|||
_c = four * five |
|||
_d = _b + _c |
|||
</pre> |
|||
⚫ |