On parsing two-level grammars

DOI10.1007/BF00288543zbMath0442.68086OpenAlexW2081953040MaRDI QIDQ1143815

Lutz Michael Wegner

Publication date: 1980

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

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

zbMATH Keywords

context-free grammarparsing algorithmleft-most derivationtwo-level grammar

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Related Items (3)

A yo-yo parsing algorithm for a large class of van Wijngaarden grammars ⋮ Towards a programming language based on the notion of two-level grammar ⋮ Practical LL(1)-based parsing of van Wijngaarden grammars

Uses Software

• ALGOL 68

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The parsing problem for affix grammars
• A decidability criterion for van Wijngaarden grammars
• Analytic approximation of continuous ovals of constant width
• A context-free syntax of ALGOL 68
• Optimization of LR(k) parsers
• Some restrictions onW-grammars
• Grammars with structured vocabulary: A model for the algol-68 definition

This page was built for publication: On parsing two-level grammars