Accelerating parser combinators with macros
Eric Béguet, Manohar Jonnalagedda · 2014
Parser combinators provide an elegant way of writing parsers: parser implementations closely follow the structure of the underlying grammar, while accommodating interleaved host language code for data processing. However, the host language features used for composition introduce substantial overhead, which leads to poor performance.