How to produce all sentences from a two-level grammar

DOI10.1016/0020-0190(84)90081-4zbMATH Open0549.68077OpenAlexW2075544523MaRDI QIDQ800100FDOQ800100

Authors: Dick Grune 

Publication date: 1984

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(84)90081-4

Recommendations

• On two-level grammars
• Towards a programming language based on the notion of two-level grammar
• On the generation of sentences with their parses by propagating regular-controlled grammars
• scientific article; zbMATH DE number 21368
• Grammars with two-sided contexts
• scientific article; zbMATH DE number 1361496
• Two-level Grammar as a Functional Programming Language
• Construction of a formula from a syntactic graph of a sentence
• scientific article; zbMATH DE number 2213328
• On an Effective Construction of a Grammar Generating a Given Language

zbMATH Keywords

programming languagesinterpreterssentence generatorTwo-level grammarsVW-grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• An efficient context-free parsing algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• On two-level grammars
• Towards a programming language based on the notion of two-level grammar

This page was built for publication: How to produce all sentences from a two-level grammar

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