How would I optimize this parser?

bearophile bearophileHUGS at
Sun Oct 31 21:06:01 PDT 2010

Converting the nodes to tagged structs, and allocating the nodes with a memory pool data structure (that allocates large chunks from the C heap), seems to reduce the total running time to about 0.15 seconds. I don't know a good language to write this kind of code.


More information about the Digitalmars-d-learn mailing list