Information flow in tabular interpretations for generalized push-down automata

DOI10.1016/S0304-3975(97)00272-7MaRDI QIDQ1129130zbMATH OpenFDO

Authors Eric Villemonte de la Clergerie, François Barthélemy

Publication date 13 August 1998

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

parsinginformation flowlogic programmingtabulationpush-down automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Tabular parsing and algebraic transformations
• scientific article; zbMATH DE number 2085263
• Tabulation of automata for tree-adjoining languages
• Bottom-up tree acceptors

Cites work

• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 3982556 (Why is no real title available?)
• scientific article; zbMATH DE number 3731318 (Why is no real title available?)
• scientific article; zbMATH DE number 3470007 (Why is no real title available?)
• scientific article; zbMATH DE number 941397 (Why is no real title available?)
• An efficient context-free parsing algorithm
• The equivalence of four extensions of context-free grammars

Cited in

(3)

• Tabular parsing and algebraic transformations
• On the correctness of pull-tabbing
• scientific article; zbMATH DE number 2085263 (Why is no real title available?)

Describes a project that uses

Uses Software

• XSB

This page was built for publication: Information flow in tabular interpretations for generalized push-down automata

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