On the relationship between indexed grammars and logic programs

DOI10.1016/0743-1066(94)90042-6MaRDI QIDQ4289933zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A descriptive characterisation of indexed grammars
• Relating logic programs and attribute grammars
• Indexed counter languages
• scientific article; zbMATH DE number 177436

Cited in

(6)

• A class of functions computable by index grammars
• scientific article; zbMATH DE number 559034 (Why is no real title available?)
• Abstract interpretation of indexed grammars
• Indexed grammars and unification grammars
• The accepting power of unary string logic programs
• A descriptive characterisation of indexed grammars

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

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