Derivational complexity of context-free grammars

DOI10.1016/S0019-9958(82)91111-1zbMath0536.68064MaRDI QIDQ3321486

Seppo Sippu

Publication date: 1982

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

context-free grammarsderivational time and space complexityminimal grammar dependent boundsminimal linear boundsnumber of derivation steps

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (1)

A scheme for LR(k) parsing with error recovery part II: error recovery

This page was built for publication: Derivational complexity of context-free grammars