Timeline for Does the language of Regular Expressions need a push down automata to parse it?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 16, 2020 at 10:30 | history | edited | CommunityBot |
Commonmark migration
|
|
| Apr 13, 2017 at 12:32 | history | edited | CommunityBot |
replaced http://cstheory.stackexchange.com/ with https://cstheory.stackexchange.com/
|
|
| May 22, 2012 at 7:41 | history | edited | Vor | CC BY-SA 3.0 |
added 395 characters in body
|
| May 21, 2012 at 22:21 | comment | added | Gilles 'SO- stop being evil' | You (and Jukka) aren't parsing regexps, only recognizing them. “Yup, that's a (compressed) regexp.” | |
| May 20, 2012 at 21:46 | comment | added | Raphael | Jukka essentially removes the requirement that parentheses are balanced. I know of no instance where this is actually done, but it is worth remarking that by changing semantics, you can "simplify" syntax. | |
| May 20, 2012 at 21:45 | history | edited | Raphael | CC BY-SA 3.0 |
added 19 characters in body
|
| May 20, 2012 at 17:32 | history | answered | Vor | CC BY-SA 3.0 |