*A Term Pattern-Match Compiler Inspired by Finite Automata Theory*

by MikaelPettersson 

In _International Workshop on Compiler Construction (CC'92)_ LNCS 641, SpringerVerlag, 1992.




----

*Summary*

-- EelcoVisser

The paper presents an improvement of the 'standard' algorithms of Augustsson and PhilipWadler. The algorithm creates a finite automaton with constructors as state transitions. The states are represented by matrices of term pattern. A state transition via a constructor and a column reduces the matrix to the submatrix that is compatible with the constructor.
----
CategoryReview