3 ms·
Eliminating memory allocations made tcc extremely fast, They use a value stack rather than an AST. I just think an AST is a bit easier to follow because it mean
by andrewchambers 11y ago
Eliminating memory allocations made tcc extremely fast, They use a value stack rather than an AST. I just think an AST is a bit easier to follow because it means the parser has less code generation logic embedded in it.
- rswier 11y agoNo malloc/free necessary. Just pile up nodes on a stack, then "deallocate" to any saved position.