On the relationship between indexed grammars and logic programs

DOI10.1016/0743-1066(94)90042-6zbMath0803.68065OpenAlexW2016298758MaRDI QIDQ4289933

E. Bertsch

Publication date: 28 April 1994

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

Full work available at URL: https://doi.org/10.1016/0743-1066(94)90042-6

zbMATH Keywords

parsingindexed grammarslogic programs with unary predicates

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Automata and formal grammars in connection with logical questions (03D05) Grammars and rewriting systems (68Q42) Logic programming (68N17)

Related Items (1)

The accepting power of unary string logic programs

This page was built for publication: On the relationship between indexed grammars and logic programs