Nobody agrees on what solving text parsing would mean. Consequently, it is unsolved.
-
-
-
Regardless, regular expressions are not the solution
Kraj razgovora
Novi razgovor -
-
-
I see anyone who's serious about text parsing using PEG parsers these days instead of regexes.
-
Totally. But for casual parsing there still isn't a good solution. I'm picking up where SNOBOL left off 50 years ago.
- Još 1 odgovor
Novi razgovor -
-
-
I've a lot of experience in this domain; if you want to discuss. Parsing theory != Parsing engineering. There are a few forever interesting/hard trade-offs in meta language design, syntax and semantics. a recent sweet spot is "top-down, data dependent and context free general"
-
Thanks. I should have made clear that I'm looking at "casual parsing", like what a data scientist needs to clean up string data. Regex is the standard solution. But then you have two problems...
- Još 1 odgovor
Novi razgovor -
-
-
Recursive descent isn't hard. It isn't a problem that needs to be solved in the PL case, as long as your language doesn't have crazy syntax. Whenever I hear about advanced parsing techniques, I'm just glad I don't need them.
-
But it could be easier
- Još 1 odgovor
Novi razgovor -
-
-
I agree, regexps are an abomination.
-
For my code editor i'm considering something 'on top' of the tokenizer, because often you write regexps to poorly parse language constructs.
- Još 2 druga odgovora
Novi razgovor -
Čini se da učitavanje traje već neko vrijeme.
Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.