A Term Pattern-Match Compiler Inspired by Finite Automata Theory

by MikaelPettersson

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


-- 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.


Revision: r1.1 - 09 May 2001 - 21:19 - Main.visser
Transform > aTermPatternMatchCompilerInspiredByFiniteAutomataTheory
Copyright © 1999-2020 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback