Bottom-up tree acceptors

DOI10.1016/0167-6423(89)90015-4zbMath0687.68044DBLPjournals/scp/HemerikK89OpenAlexW2140319468WikidataQ57802276 ScholiaQ57802276MaRDI QIDQ1263293

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

zbMATH Keywords

code generationregister machinetree grammarscode-generator generatorsinstruction selection

Mathematics Subject Classification ID

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

Related Items (4)

Left-to-right tree pattern matching ⋮ On regular tree languages and deterministic pushdown automata ⋮ Pattern-matching algorithms based on term rewrite systems ⋮ TWO RELATED ALGORITHMS FOR ROOT-TO-FRONTIER TREE PATTERN MATCHING

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