A decidability criterion for van Wijngaarden grammars

From MaRDI portal

Revision as of 07:18, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1226383

Jump to:navigation, search

DOI10.1007/BF00264566zbMath0327.68022OpenAlexW2032371599MaRDI QIDQ1226383

Publication date: 1975

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00264566

Mathematics Subject Classification ID

Formal languages and automata (68Q45) General topics in the theory of software (68N01)

Related Items (9)

Polymorphic syntax definition ⋮ Programming language ALGOL 68 ⋮ On parsing two-level grammars ⋮ A yo-yo parsing algorithm for a large class of van Wijngaarden grammars ⋮ On two-level grammars ⋮ Van Wijngaarden grammars and space complexity class EXSPACE ⋮ Infinite linear systems and one counter languages ⋮ Towards a programming language based on the notion of two-level grammar ⋮ Practical LL(1)-based parsing of van Wijngaarden grammars

This page was built for publication: A decidability criterion for van Wijngaarden grammars

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1226383&oldid=13302679"