132 Views
A simple query syntax for finite deterministic automata with an application to typed string parsing.
0 comments
Join in on a hand-picked round up of the best .NET articles every day.
Curated by our Moderators and Voted up by our Community. Free.
A simple query syntax for finite deterministic automata with an application to typed string parsing.