How to write Regular Expression parser ?

Peter_APIIT · #1 02-Nov-2008, 01:31

Hello to all expect C++ programmer, i wonder how we can write this kind of parser.

I student and need to learn recursion and non-recursion method in process string as syntax parser.

Quote:

. = Match any characters except new line
^ = Match start of a line
$ = Match end of a line
() = Match sub expressions
{n} = Match these characters n times
{n, } = Match these characters at least n times
{n, m} = Match these characters at least n times and at most m times
*= Match 0 or more times
+ = Match 1 or more times
? = Match 1 or 0 times

I hope someone can give some guideline.

Thanks for your help.

n00pster · #2 04-Nov-2008, 06:04

Quote:

Originally Posted by Peter_APIIT

I student and need to learn recursion and non-recursion method in process string as syntax parser.
I hope someone can give some guideline.
Thanks for your help.

Could you please post your non-working, semi working code?
There might be many ways to do it, but basically you will have to set up a state machine.

Thread Tools	Search this Thread
Show Printable Version Email this Page	Search this Thread: Advanced Search
Rate This Thread
Rate This Thread:

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Airport Log program using 3D linked List : problem reading from file	batrsau	C Programming Language	11	29-Feb-2008 07:44
Regular expression to DFA conversion c code	sandipmw	C Programming Language	1	23-Apr-2007 12:47
Need urgent help with regular expression matching	Xilon	C Programming Language	7	15-Oct-2006 03:04
Yet another CD burner problem: Lite-On LSC-24082K	Erwin	Computer Hardware Forum	1	22-May-2004 11:28
preg_replace + regular expression	EasyExpat	MySQL / PHP Forum	4	10-Jul-2003 04:36

How to write Regular Expression parser ?

Re: How to write Regular Expression parser ?