Parser generation and grammar manipulation using prolog's infinite trees
From MaRDI portal
Publication:3694728
DOI10.1016/0743-1066(84)90013-XzbMath0575.68087WikidataQ56092425 ScholiaQ56092425MaRDI QIDQ3694728
Francis Giannesini, Jacques Cohen
Publication date: 1984
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Related Items (3)
Prolog infinite trees and automata ⋮ Tabling, Rational Terms, and Coinduction Finally Together! ⋮ Finite-tree analysis for constraint logic-based languages
This page was built for publication: Parser generation and grammar manipulation using prolog's infinite trees