On syntactical analysis and properties of formal programming languages

MaRDI QIDQ3162040zbMATH OpenFDO

Authors K. V. Safonov

Publication date 18 October 2010

zbMATH Keywords

context-free grammarformal power seriesterminal set

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Recommendations

• scientific article; zbMATH DE number 3876633
• Analytic approach to context-free languages in the Greibach normal form
• scientific article; zbMATH DE number 3253169
• scientific article; zbMATH DE number 3919851
• On a classification of sequential context-free languages and grammars

Cited in

(9)

• Implications between generative properties and analytical properties of formal languages
• Language-oriented formal analysis: a case study on protocols and distributed systems
• Toward complete programming language descriptions that are both formal and understandable
• scientific article; zbMATH DE number 3874650 (Why is no real title available?)
• scientific article; zbMATH DE number 3876633 (Why is no real title available?)
• scientific article; zbMATH DE number 4037252 (Why is no real title available?)
• scientific article; zbMATH DE number 569780 (Why is no real title available?)
• Semantics-to-Syntax Analyses of Algorithms
• Methoden der Syntaktischen Analyse bei Formalen Sprachen

This page was built for publication: On syntactical analysis and properties of formal programming languages

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