The use of grammatical inference for designing programming languages
From MaRDI portal
Publication:5661159
DOI10.1145/361952.361958zbMath0248.68037OpenAlexW2015692375MaRDI QIDQ5661159
No author found.
Publication date: 1973
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/361952.361958
Related Items (11)
First-Order Logic Definability of Free Languages ⋮ Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization ⋮ Beyond operator-precedence grammars and languages ⋮ Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages ⋮ Learning tree languages from text ⋮ Generalizing input-driven languages: theoretical and practical benefits ⋮ Unnamed Item ⋮ Learning context-free grammars from structural data in polynomial time ⋮ SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY ⋮ Operator precedence and the visibly pushdown property ⋮ Toward a theory of input-driven locally parsable languages
This page was built for publication: The use of grammatical inference for designing programming languages
