A simple CF formalism and free word order

zbMATH Open1147.68544MaRDI QIDQ3536459FDOQ3536459

Authors: Filip Graliński 

Publication date: 21 November 2008

Recommendations

• On the complexity of free word orders
• IDL-PMCFG, a grammar formalism for describing free word order languages
• Mechanizing Mathematical Reasoning
• Word ordering as a graph rewriting process
• scientific article; zbMATH DE number 1665452

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (8)

• Parsing of free-word-order languages
• An extension of Świdzińki's grammar of Polish
• Reinterpreting DCG for free word order languages
• Word ordering as a graph rewriting process
• Title not available (Why is that?)
• On the complexity of free word orders
• Mechanizing Mathematical Reasoning
• IDL-PMCFG, a grammar formalism for describing free word order languages

This page was built for publication: A simple CF formalism and free word order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3536459)