Run-time extensible deterministic top-down parsing

DOI10.1023/A:1009914518458MaRDI QIDQ1592934zbMATH OpenFDO

Authors Michal Žemlička, Jaroslav Král

Publication date 16 January 2001

Published in Grammars (Search for Journal in Brave)

zbMATH Keywords

LL grammarsparsing of formal languages

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42)

Recommendations

• Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems
• Properties of deterministic top down grammars
• scientific article; zbMATH DE number 2050923
• scientific article; zbMATH DE number 3253169
• Top-down parsing of conjunctive languages

Cited in

(5)

• ASF+SDF parsing tools applied to ELAN
• scientific article; zbMATH DE number 3978431 (Why is no real title available?)
• scientific article; zbMATH DE number 6851912 (Why is no real title available?)
• Deterministic parsing for augmented context-free grammars
• Reversible Top-Down Syntax Analysis

This page was built for publication: Run-time extensible deterministic top-down parsing

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