A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Compiling regular patterns to sequential machines
2005
Proceedings of the 2005 ACM symposium on Applied computing - SAC '05
Pattern matching combined with regular expressions has many applications including semistructured data matching and lexical analysis in compilers. Variables in patterns allow one to refer to parts of the matching input. But some regular patterns suffer from inherent ambiguity, yielding more than one valid result. A match policy like shortest or longest match can disambiguate such patterns. In this paper, we show that regular pattern matching corresponds to sequential transduction. We derive
doi:10.1145/1066677.1066992
dblp:conf/sac/Emir05
fatcat:btj52ok3bnef7ch6btaywqizau