Bottom-up tree acceptors

DOI10.1016/0167-6423(89)90015-4zbMATH Open0687.68044DBLPjournals/scp/HemerikK89OpenAlexW2140319468WikidataQ57802276 ScholiaQ57802276MaRDI QIDQ1263293FDOQ1263293

Authors: C. Hemerik, Joost-Pieter Katoen 

Publication date: 1989

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(89)90015-4

Recommendations

• Acceptance trees
• scientific article; zbMATH DE number 3911718
• Trees at an interface
• scientific article; zbMATH DE number 3967934
• Parsimonious trees
• Self-adjusting top trees
• scientific article; zbMATH DE number 3978405
• scientific article; zbMATH DE number 512952
• scientific article; zbMATH DE number 795222

zbMATH Keywords

register machinetree grammarscode generationcode-generator generatorsinstruction selection

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20) Theory of software (68N99)

Cited In (6)

• On regular tree languages and deterministic pushdown automata
• Computational Science and Its Applications – ICCSA 2004
• Left-to-right tree pattern matching
• TWO RELATED ALGORITHMS FOR ROOT-TO-FRONTIER TREE PATTERN MATCHING
• Generating tables for bottom-up matching
• Pattern-matching algorithms based on term rewrite systems

This page was built for publication: Bottom-up tree acceptors

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