Timeline for Does the language of Regular Expressions need a push down automata to parse it?

11 events

when toggle format	what		by	license	comment
May 21, 2012 at 15:35	comment	added	Bruce Ediger		For a practical answer, you could look at the Plan 9 Grep source for grep.y.
May 20, 2012 at 17:32	answer	added	Vor		timeline score: 3
May 20, 2012 at 12:32	history	edited	Raphael		edited tags
May 20, 2012 at 11:16	history	tweeted			twitter.com/#!/StackCompSci/status/204168666797965312
May 20, 2012 at 10:49	vote	accept	Phil Wright
May 20, 2012 at 10:49
May 20, 2012 at 10:49	vote	accept	Phil Wright
May 20, 2012 at 10:49
May 20, 2012 at 9:25	answer	added	Raphael		timeline score: 10
May 20, 2012 at 7:54	history	edited	Dave Clarke	CC BY-SA 3.0	edited title
May 20, 2012 at 4:12	comment	added	Kaveh		What do you mean exactly by "parsing"? Do you mean checking if the input is really a regular expression or do you have a more complicated thing in mind, e.g. a machine outputting a description of the corresponding NFA? (if you are not sure if the input is really a regular expression and you need to check it then you need to be able to check that parenthesis are correct and that normally means using a stack.)
May 20, 2012 at 4:06	history	edited	Kaveh		edited tags
May 20, 2012 at 3:26	history	asked	Phil Wright	CC BY-SA 3.0