2000 character limit reached
Ordered Context-Free Grammars Revisited (2309.08717v1)
Published 15 Sep 2023 in cs.FL
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(n4), where n is the length of the input string being parsed.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.