scientific article; zbMATH DE number 3856438

MaRDI QIDQ3325071zbMATH OpenFDO

Authors Seppo Sippu, Eljas Soisalon-Soininen

Publication date 1982

zbMATH Keywords

LL(k) parsing of context free grammarsviable suffixes

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Recommendations

• scientific article; zbMATH DE number 194074
• On the complexity of LL(k) testing
• scientific article; zbMATH DE number 3860423
• On parsing LL-languages
• Properties of deterministic top down grammars

Cited in

(18)

• An incremental LL(1) parsing algorithm
• Dynamic \(\text{LL} (k)\) parsing
• scientific article; zbMATH DE number 3843162 (Why is no real title available?)
• scientific article; zbMATH DE number 3860423 (Why is no real title available?)
• scientific article; zbMATH DE number 3930368 (Why is no real title available?)
• LL(1) grammars and Sub-LL(1) grammars
• scientific article; zbMATH DE number 4033121 (Why is no real title available?)
• scientific article; zbMATH DE number 4094847 (Why is no real title available?)
• scientific article; zbMATH DE number 4100631 (Why is no real title available?)
• scientific article; zbMATH DE number 194074 (Why is no real title available?)
• scientific article; zbMATH DE number 1452980 (Why is no real title available?)
• Properties of deterministic top down grammars
• On parsing LL-languages
• On the transformation of LL(k)-linear to LL(1)-linear grammars
• Reversible Top-Down Syntax Analysis
• On the complexity of LL(k) testing
• Reversible top-down syntax analysis
• The hardest \(\operatorname{LL}(k)\) language

This page was built for publication:

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