摘要 |
<p>Modular forest automata (MFA) provide a unified description of partially-ordered regular tree patterns. MFAs provide simple methods for determinization, sub-typing, intersection, and complementation of these patterns. MFAs support high-performance pattern analysis and matching. Modular forest transducers, in conjunction with modular forest automata, enable compilers to place semantic actions on any state transition while supporting efficient transformation of labeled, directed graphs.</p> |