Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

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.


No malloc/free necessary. Just pile up nodes on a stack, then "deallocate" to any saved position.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: