Left-to-right tree pattern matching

DOI10.1007/3-540-53904-2_107zbMath1503.68173OpenAlexW1868982956MaRDI QIDQ5055771

Albert Gräf

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-53904-2_107

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (6)

A set automaton to locate all pattern matches in a term ⋮ Associative-commutative discrimination nets ⋮ Tree pattern matching from regular tree expressions ⋮ Unnamed Item ⋮ Adaptive pattern matching ⋮ More efficient left-to-right matching for overlapping pattern

Cites Work

• Refined compilation of pattern-matching for functional languages
• Fast Knuth-Bendix completion with a term rewriting system compiler
• Rewriting techniques and applications. 3rd international conference, RTA-89, Chapel Hill, NC, USA, April 3--5, 1989. Proceedings
• Bottom-up tree acceptors
• Pattern Matching in Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Left-to-right tree pattern matching