The Hardest LL(k) Language › SPbU Researchers Portal

Original language	English
Pages (from-to)	289-319
Number of pages	31
Journal	International Journal of Foundations of Computer Science
Volume	34
Issue number	2&3
DOIs	https://doi.org/10.1142/s012905412344001x
State	Published - Apr 2023

Context-free grammars, LL grammars, finite transducers, hardest languages, homomorphisms, parsing, simple grammars

ID: 108695739