Parsing linear context-free rewriting systems
2005pp. 11–17
Citations Over TimeTop 13% of 2005 papers
Abstract
We describe four different parsing algorithms for Linear Context-Free Rewriting Systems (Vijay-Shanker et al., 1987). The algorithms are described as deduction systems, and possible optimizations are discussed.
Related Papers
- → Development closed critical pairs(1996)18 cited
- → Checking Overlaps of Nominal Rewriting Rules(2016)9 cited
- → Nominal Confluence Tool(2016)5 cited
- → Proving and disproving confluence of context-sensitive rewriting(2022)3 cited
- → Completion of Globally Finite Term Rewriting Systems for Inductive Proofs(1986)6 cited