parsing

(redirected from Parser generators)
Also found in: Dictionary.

parsing

[′pärs·iŋ]
(computer science)
A process whereby phrases in a string of characters in a computer language are associated with the component names of the grammar that generated the string.

parsing

References in periodicals archive ?
Many popular parser generators such as Yacc [Johnson 1975] restrict themselves to S-attributed grammars where all attributes can be evaluated "on-the-fly" during parsing.
Among the many phrase-level recovery techniques, few have actually been used in production LR parser generators.
With both the direct-style and the continuation-based implementation models, the generated LR parsers compare favorably with those generated by traditionally built parser generators such as Bison [Donnelly and Stallman 1995] as well as those produced by the partial evaluation of a stack-based implementation presented by Mossin [1993].
However, his approach is rather adhoc, and the generation of the parser generators is not automatic but done by hand.
We have used such a program-generator generator [Thiemann 1996a] to generate our parser generators.
Second, while our parser generators can check whether the grammar satisfies the LR(k) (or SLR (k)) condition, the parser combinators loop when used for a grammar which is not LL(1).
There is no need to cater to specific optimizations used in parser generators, or to [Kappa] = 1.
Consequently, partial evaluation is a realistic approach to implementing production-quality parser generators.
Many parser generator tools, such as bison, permit some forms of ambiguity in conjunction with mechanisms for eliminating the resulting nondeterminism in the parse table.
Note that changes to the grammar are necessary: the parser generator cannot intuit the associativity properties of sequences, since it must treat the grammar as a declarative specification of the form of the parse tree.
Although the techniques of earlier sections always produce correct incremental parsers for any grammar accepted by the parser generator, the choice among grammars accepting the same language matters greatly for the sake of incremental performance.
To use this approach, in conjunction with incremental parsing, the productions to which priority constraints apply must be indicated in a manner analogous to the itemization of conflict-causing productions in an LR parser generator.