Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Parser generation and grammar manipulation using prolog's infinite trees

From MaRDI portal
Publication:3694728
Jump to:navigation, search

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)


zbMATH Keywords

infinite treescontext-free grammar rulesPROLOG parser


Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3694728&oldid=17180660"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 5 February 2024, at 08:30.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki