Compact non-left-recursive grammars using the selective left-corner transform and factoring
Mark Johnson, Brian Roark
Abstract
The left-corner transform removes left-recursion from (probabilistic) context-free grammars and unification grammars, permitting simple top-down parsing techniques to be used. Unfortunately the grammars produced by the standard left-corner transform are usually much larger than the original. The selective left-corner transform described in this paper produces a transformed grammar which simulates left-corner recognition of a user-specified set of the original productions, and top-down recognition of the others. Combined with two factorizations, it produces non-left-recursive grammars that are not much larger than the original.
Create a lesson
Related papers
COMPREHEND: Ultra-Fine-Grained Benchmark Understanding by Entailment Hierarchy
Sivaraaman Balakrishnan, Prakriti Shetty, Jeremiah Hong et al.
Constructing a Regional Slang Lexicon for Electricity Demands via Soft-Label Bidirectional Anchoring and Active Learning
Rong Chang, Lijing Shi, Zhaoxiang Zang
Shared Context Candidate Scoring with Jointly Adapted Readout Networks
Jingyang Du, Yiben Fu, Yang Shen
Tokenizer Myths and Where To Find Them
Rylan Schaeffer, Sanmi Koyejo
Length Is Cheap, Competition Is Not: Attention Predicts Context Rot in Retrieval
Yinuo Liu
PACT: Certifying What Is Written in Parallel Decoding of Diffusion Language Models
Yanchao Li, Yusu Zhang, Jiaqing Xie et al.