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


v. parsed, pars·ing, pars·es
a. To break (a sentence) down into its component parts of speech with an explanation of the form, function, and syntactical relationship of each part.
b. To describe (a word) by stating its part of speech, form, and syntactical relationships in a sentence.
c. To process (linguistic data such as speech or written language) in real time as it is being spoken or read, in order to determine its linguistic structure and meaning.
a. To examine closely or subject to detailed analysis, especially by breaking up into components: "What are we missing by parsing the behavior of chimpanzees into the conventional categories recognized largely from our own behavior?" (Stephen Jay Gould).
b. To make sense of; comprehend: I simply couldn't parse what you just said.
3. Computers To analyze or separate (input, for example) into more easily processed components.
To admit of being parsed: sentences that do not parse easily.

[Probably from Middle English pars, part of speech, from Latin pars (ōrātiōnis), part (of speech); see perə- in Indo-European roots.]

pars′er n.


[ˈpɑːzɪŋ] Nanálisis m inv sintáctico or gramatical


n (Gram) → Syntaxanalyse f; (Comput) → Parsing nt
References in periodicals archive ?
Also, several LR parser generators are readily available, most notably Yacc [Johnson 1975] which creates LALR parsers.
We advocate a fresh approach to creating LR parser generators which ensures understandability and correctness at every step, and leads to extremely efficient parsers:
The same technique can automatically generate efficient standalone parser generators.
Compared to real-world parser generators, the performance of the generated parsers is competitive.
Clearly there is no need for an Eli user to supply encodings; a tool can generate them and add them to the specifications for the scanner and parser generators.
Two of the most popular are LEX [11], a scanner generator that accepts regular expressions and produces a table-driven recognizer, and Yacc [8], an LALR(1) parser generator.
If the parser generator were being used independently, the compiler designer would need to insert calls on tree-building functions into the context-free grammar of Figure 1.
finally, the modified version of Figure 1 is supplied as input to the parser generator.
Many parser generators accept ambiguous grammars in combination with additional specifications (e.
Most parser generators already provide this information in "verbose mode".
15) However, if an LALR or SLR parser generator identifies reductions guaranteed never to be erroneous, reduction validation can be employed on a case-by-case basis.