Timeline for What is meant by "Now you have two problems"?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 24, 2014 at 22:25 | history | post merged (destination) | |||
| Apr 8, 2013 at 12:24 | history | edited | gnat | CC BY-SA 3.0 | typo corrected |
| Dec 6, 2011 at 15:56 | comment | added | Donal Fellows | You can use REs just fine for the lexer (well, for most languages) but assembling the token stream into a parse tree (i.e., parsing) is formally beyond them. | |
| Aug 7, 2011 at 11:28 | comment | added | Guffa | @Thorbjørn Ravn Andersen: That's more of a limitation than a problem. It's only a problem if you try to use regular expressions for that, and then it's not a problem with the regular expressions, it's a problem with your choise of method. | |
| Aug 7, 2011 at 9:21 | comment | added | user1249 | The real problem is that regexps cannot implement e.g. a parser since they cannot count how deeply nested they currently are. | |
| Oct 11, 2010 at 13:33 | history | answered | Guffa | CC BY-SA 2.5 |