Compiling regular patterns to sequential machines

Emir, Burak

doi:10.1145/1066677.1066992

Cited by 4 publications

(2 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There has already been some work done in this area assuming a uniform representation of regular expression values [9,10,22,7]. It will be interesting to see what techniques can be applied to our setting where values have a structured representation.…”

Section: Resultsmentioning

confidence: 99%

A Type-Safe Embedding of XDuce into ML

Sulzmann

2006

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

We consider the problem of integrating XDuce into ML. This is difficult because of incompatible type and value representations. Our solution is a type-driven translation scheme from XDuce to ML based on a structured representation of XDuce values. XDuce type inference guides the insertion of appropriate coercion functions to translate regular expression pattern matching and uses of semantic subtyping. We can extend our translation scheme to include ML function calls and patterns into XDuce. Thus, we can embed XDuce into ML. Our results allow to enrich the ML language with support for dealing with semi-structured data.

show abstract

Section: Resultsmentioning

confidence: 99%

A Type-Safe Embedding of XDuce into ML

Sulzmann

2006

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…There have been several attempts to extend automata with recording capabilities, but many are not able to deal with recordings under iteration [30,14]. In [22], Frisch and Cardelli show how to perform greedily disambiguated pattern matching on a string, ω, using a regular expression, R, via an automata-based approach while retaining structure (i.e., parsing) in O(|ω||R|) time and with O(|ω||R|) memory usage.…”

Section: Regular Expression Parsingmentioning

confidence: 99%

Typed and unambiguous pattern matching on strings using regular expressions

Brabrand

Thomsen

2010

Proceedings of the 12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming

View full text Add to dashboard Cite

We show how to achieve typed and unambiguous declarative pattern matching on strings using regular expressions extended with a simple recording operator.We give a characterization of ambiguity of regular expressions that leads to a sound and complete static analysis. The analysis is capable of pinpointing all ambiguities in terms of the structure of the regular expression and report shortest ambiguous strings. We also show how pattern matching can be integrated into statically typed programming languages for deconstructing strings and reproducing typed and structured values.We validate our approach by giving a full implementation of the approach presented in this paper. The resulting tool, reg-exp-rec, adds typed and unambiguous pattern matching to Java in a stand-alone and non-intrusive manner. We evaluate the approach using several realistic examples.

show abstract

Hedge Pattern Partial Derivative

Suzuki

Okui

2009

Implementation and Application of Automata

View full text Add to dashboard Cite

Compiling regular patterns to sequential machines

Cited by 4 publications

References 16 publications

A Type-Safe Embedding of XDuce into ML

A Type-Safe Embedding of XDuce into ML

Typed and unambiguous pattern matching on strings using regular expressions

Hedge Pattern Partial Derivative

Contact Info

Product

Resources

About