Parsing local internal contextual languages with context-free choice
We extend the result from [8] by giving also a concrete polynomial parsing algorithm for a class of languages generated by a variant of contextual grammars, namely local internal contextual grammars with context-free choice.
parsing contextual grammar polynomial complexity