213614af33
Instead of going left and right, finding operators chars and replacing them with nulls, we parse expressions in a more orderly manner, one chunk at a time. I think it qualifies as "recursive descent", but I'm not sure. This allows us to preserve the string we parse and should also make the implementation of parens much easier. |
||
|---|---|---|
| .. | ||
| allinstrs.asm | ||
| allinstrs.asm.expected | ||
| errtests.sh | ||
| geninstrs.py | ||
| runtests.sh | ||
| test1.asm | ||
| test1.asm.expected | ||
| test2.asm | ||
| test2.asm.expected | ||
| test3.asm | ||
| test3.asm.expected | ||
| test4.asm | ||
| test4.asm.expected | ||
| test5.asm | ||
| test5.asm.expected | ||
| test6.asm | ||
| test6.asm.expected | ||
| test7.asm | ||
| test7.asm.expected | ||
| test8.asm | ||
| test8.asm.expected | ||
| test9.asm | ||
| test9.asm.expected | ||
| test10.asm | ||
| test10.asm.expected | ||