Performance. I'm looking to try implementing a regexp-like engine via a runtime parser generator built using parser combinators and _hoping_ to get performance near what optimized regex engines get.
Seems like an interesting way to get nice, performant template parsing without having the performance overhead that higher level languages typically bring.
This is all speculative, though - I haven't actually done it yet, so maybe I'll find its incredibly slow and a bad idea :)
Seems like an interesting way to get nice, performant template parsing without having the performance overhead that higher level languages typically bring.
This is all speculative, though - I haven't actually done it yet, so maybe I'll find its incredibly slow and a bad idea :)