On the complexity of LL(k) testing

DOI10.1016/0022-0000(83)90015-6zbMATH Open0541.68055OpenAlexW1985572667MaRDI QIDQ794445FDOQ794445

Authors: Seppo Sippu, Eljas Soisalon-Soininen 

Publication date: 1983

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(83)90015-6

Recommendations

• scientific article; zbMATH DE number 3856438
• Properties of deterministic top down grammars
• scientific article; zbMATH DE number 194074
• Dynamic \(\text{LL} (k)\) parsing
• Lower bounds on the size of deterministic parsers

zbMATH Keywords

LL(k) grammarsLL(k) testing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of compilers and interpreters (68N20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Syntax-Directed Transduction
• Top-down syntax nalysis
• Properties of deterministic top-down grammars
• On the translation of languages from left to right
• On the complexity of LR(k) testing
• Title not available (Why is that?)
• The Complexity of LALR (k) Testing
• Operations on sparse relations
• Title not available (Why is that?)

Cited In (6)

• Properties of deterministic top down grammars
• Analysis of the upper bound on the complexity of LLL algorithm
• Title not available (Why is that?)
• Testing for grammatical coverings
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: On the complexity of LL(k) testing

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