LR parsing for LCFRS

DOI10.3390/a9030058zbMath1461.68099OpenAlexW2509896569MaRDI QIDQ1736827

Laura Kallmeyer, Wolfgang Maier

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a9030058

zbMATH Keywords

automataparsingLCFRS

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (1)

LR parsing for LCFRS

Uses Software

• Penn Treebank
• GF

Cites Work

• Unnamed Item
• Unnamed Item
• TuLiPA -- parsing extensions of TAG with range concatenation grammars
• On multiple context-free grammars
• LR parsing for LCFRS
• Generalized LR parsing algorithm for grammars with one-sided contexts
• Parsing Beyond Context-Free Grammars
• Characterizing Discontinuity in Constituent Treebanks
• LR(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata
• On the Relation between Multicomponent Tree Adjoining Grammars with Tree Tuples (TT-MCTAG) and Range Concatenation Grammars (RCG)
• FUNCTIONAL PEARL Functional chart parsing of context-free grammars
• GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS
• On the translation of languages from left to right

This page was built for publication: LR parsing for LCFRS