Ordered Context-Free Grammars Revisited
arXiv:2309.08717 · doi:10.4204/EPTCS.388.13
Abstract
We continue our study of ordered context-free grammars, a grammar formalism that places an order on the parse trees produced by the corresponding context-free grammar. In particular, we simplify our previous definition of a derivation of a string for a given ordered context-free grammar, and present a parsing algorithm, using shared packed parse forests, with time complexity O(n^4), where n is the length of the input string being parsed.
In Proceedings NCMA 2023, arXiv:2309.07333