Relational parsing: a clean, fast parsing strategy for all context-free languages

Grzegorz Herman

We present a novel parsing algorithm for all context-free languages, based on computing the relation between configurations and reaching transitions in a recursive transition netwo…