June 2008 - Posts

Writing a Regular Expression parser in Haskell: Part 4
21 June 08 04:18 PM | MattManela | 1 Comments   

With the previous two modules in place we are now set up to use a DFA to match against a string. In my implementation I support either a greedy match or an short match. In a full featured regular expression engine this ability to choose greedy or not Read More...

Filed under: Haskell, Programming

Attachment(s): SimpleRegex.zip

Writing a Regular Expression parser in Haskell: Part 3
09 June 08 11:08 PM | MattManela | 1 Comments   

The third module in the simple regular expression parser is called: NFAtoDFA. Which as you might have guessed, takes the NFA that resulted from the first module and converts it into a DFA. The structure that the DFA uses is the same that the NFA uses Read More...

Filed under: Haskell, Programming

Attachment(s): NFAtoDFA.hs

Writing a Regular Expression parser in Haskell: Part 2
02 June 08 11:54 PM | MattManela | 1 Comments   

The first module in my simple regular expression parse is called RegexToNFA. This module exposes the types that make up a finite state machine and also the functions to convert a regular expression string into a finite state machine. My structure for Read More...

Attachment(s): RegexToNFA.hs

Writing a Regular Expression parser in Haskell: Part 1
01 June 08 01:28 PM | MattManela | 0 Comments   

A few weeks ago I read this article about writing a simple regular expression parser. That article does a really good job of explaining the theory behind regular expression. It then goes step by step into how to write a program (he uses C++) to parse Read More...

Filed under: Haskell, pro