2016/11/17 by John Maraist, Maraist, John
Computer Science · #Algorithms and Data Compression #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Machine Learning and Algorithms #Natural Language Processing Techniques
paper · pdf · doi:10.48550/arxiv.1611.05831
openalex publication_date 2016/11/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We adapt Tomita's Generalized LR algorithm to languages generated by context-free grammars enriched with a shuffle operator. The change involves extensions to the underlying handle-finding finite automaton, construction of parser tables, and the necessary optimizations in constructing a deterministic parser. Our system is motivated by an application from artificial intelligence plan recognition. We argue for the correctness of the system, and discuss future extensions of this work.