A simple CF formalism and free word order

MaRDI QIDQ3536459zbMATH OpenFDO

Authors Filip Graliński

Publication date 21 November 2008

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

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

Cited in

(9)

• IDL-PMCFG, a grammar formalism for describing free word order languages
• Word ordering as a graph rewriting process
• An extension of Świdzińki's grammar of Polish
• Reinterpreting DCG for free word order languages
• scientific article; zbMATH DE number 569756 (Why is no real title available?)
• scientific article; zbMATH DE number 1560217 (Why is no real title available?)
• On the complexity of free word orders
• Mechanizing Mathematical Reasoning
• Parsing of 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)