mirror of
https://github.com/hsoft/collapseos.git
synced 2024-11-08 22:48:06 +11:00
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. |
||
---|---|---|
.. | ||
common.asm | ||
runtests.sh | ||
test_basic_parse.asm | ||
test_core.asm | ||
test_ed_util.asm | ||
test_expr.asm | ||
test_lib_ari.asm | ||
test_lib_fmt.asm | ||
test_parse_z.asm | ||
test_parse.asm | ||
test_symbol.asm | ||
test_util_z.asm | ||
test_z_instr.asm |