Parser generation and grammar manipulation using prolog's infinite trees

DOI10.1016/0743-1066(84)90013-XMaRDI QIDQ3694728zbMATH OpenWikidataFDO

Authors Francis Giannesini, Jacques Cohen

Publication date 1984

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0743-1066(84)90013-X

zbMATH Keywords

context-free grammar rulesinfinite treesPROLOG parser

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Recommendations

• scientific article; zbMATH DE number 3980517
• scientific article; zbMATH DE number 1696871
• Uniquely parsable unification grammars and their parser implemented in Prolog
• Narrowing grammar: theory, implementation, and applications
• Parsing expression grammars: a recognition-based syntactic foundation

Cited in

(8)

• scientific article; zbMATH DE number 1696871 (Why is no real title available?)
• Tabling, rational terms, and coinduction finally together!
• scientific article; zbMATH DE number 6613239 (Why is no real title available?)
• scientific article; zbMATH DE number 3980517 (Why is no real title available?)
• Prolog infinite trees and automata
• scientific article; zbMATH DE number 1406240 (Why is no real title available?)
• Putting the `K' into Bird's derivation of Knuth-Morris-Pratt string matching
• Finite-tree analysis for constraint logic-based languages

This page was built for publication: Parser generation and grammar manipulation using prolog's infinite trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3694728)