User loginNavigation |
Statically typed Pratt parsersI recently completed an extensible Pratt parser in C#. I've only managed to find a single mention of a statically typed Pratt parser, pointing to this Ada library. Most implementations I've found are for dynamic languages, ie. Python, JavaScript, Scheme, and of course, Pratt's original implementation was in Lisp. Is Pratt parsing, aka "top-down operator precedence parsing", really so little used? Or is its use behind the scenes, perhaps in a parser generator or as part of a post-processing phase to resolve operator precedence when using a parser combinator library? Are there any problems to using a typed Pratt parser as compared to parser combinators? By naasking at 2009-11-16 19:49 | LtU Forum | previous forum topic | next forum topic | other blogs | 14856 reads
|
Browse archives
Active forum topics
|
Recent comments
15 weeks 1 day ago
19 weeks 3 days ago
21 weeks 21 hours ago
21 weeks 21 hours ago
23 weeks 5 days ago
28 weeks 3 days ago
28 weeks 3 days ago
28 weeks 6 days ago
28 weeks 6 days ago
31 weeks 4 days ago