Counting with range concatenation grammars

DOI10.1016/S0304-3975(01)00353-XzbMath1025.68044MaRDI QIDQ1870577

Pierre Boullier

Publication date: 14 May 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

formal powergrammar formalismscontext-sensitive parsinggrammar modularityparse time complexityshared forests

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (5)

TuLiPA -- parsing extensions of TAG with range concatenation grammars ⋮ On the Relation between Multicomponent Tree Adjoining Grammars with Tree Tuples (TT-MCTAG) and Range Concatenation Grammars (RCG) ⋮ From Contextual Grammars to Range Concatenation Grammars ⋮ Global index grammars and descriptive power ⋮ Counting with range concatenation grammars

Cites Work

• Unnamed Item
• On derivation trees of indexed grammars - an extension of the uvwxy- theorem
• Counting with range concatenation grammars
• Indexed Grammars—An Extension of Context-Free Grammars

This page was built for publication: Counting with range concatenation grammars