parsing - What kind of parser is a pratt parser? -
i'm implementing pratt's top down operator precedence parser , i'd know in formal category falls - lr(1)?
pratt parser not lr parsers. , they're not ll parsers either. in fact, pratt parsers hand-coded in general purpose programming language; technique not based on abstraction push-down finite state automata. makes more difficult prove assertions given pratt parser, such recognizes particular formal language.
in general, pratt parsers can designed recognize language if grammar operator precedence grammar, can considered dual of operator precedence parsing, though operator precedence parsing bottom-up , pratt parsers nominally top-down. tracing pratt parser , transitions of operator precedence parser same language show similarity.
so suppose might possible come formalism pratt parsers, far know, none exists.
Comments
Post a Comment