On the complexity of LL(k) testing

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

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

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

• 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
• The Complexity of LALR (k) Testing
• Operations on sparse relations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Analysis of the upper bound on the complexity of LLL algorithm
• 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)