|
Re: further thoughts on adaptive parse algorithms: msg#00034parsers.spirit.devel
Frank Birbacher wrote: Hi! So what? It's just a matter of scale. With e.g. 100 repetitions we are talking about ~80 iterator copies vs. ~4 failed parses (rough averages)... Is this worth the trouble? It pretty much comes down to whether there are cases where we expect kleene to match often enough. Let's see. Do I understand you correctly. Are you saying that a loop with two copy ops is better than a loop with one copy op plus sorta-duffing?
...where especially complex parsers usually fail much quicker than they succeed. But right - it doesn't make much sense, here. To me the unrolling approach doesn't look promising. Did I miss something? Once there is enough infrastructure it's pretty easy to implement a hard-wired version, say a comment skipper, and find out what it brings. Note that it was not intended to be used globally - the user would have to enable it. Another thought on the self-calibrating Kleene: The average number of repetitive matches might also be interesting for std::vector::reserve-kind-of operations when gathering data from the input... Regards, Tobias ------------------------------------------------------- Using Tomcat but need to do more? Need to support web services, security? Get stuff done quickly with pre-integrated technology to make your job easier Download IBM WebSphere Application Server v.1.0.1 based on Apache Geronimo http://sel.as-us.falkag.net/sel?cmd=lnk&kid=120709&bid=263057&dat=121642 |
|
| <Prev in Thread] | Current Thread | [Next in Thread> |
|---|---|---|
| Previous by Date: | Re: Fusion-ifying proto parse trees: 00034, Joel de Guzman |
|---|---|
| Next by Date: | Re: Fusion-ifying proto parse trees: 00034, Joel de Guzman |
| Previous by Thread: | Re: further thoughts on adaptive parse algorithmsi: 00034, Frank Birbacher |
| Next by Thread: | segmented fusion - a-ha!: 00034, Eric Niebler |
| Indexes: | [Date] [Thread] [Top] [All Lists] |
| News | FAQ | advertise |