parser

(redirected from Parsers)
Also found in: Dictionary, Thesaurus.
Related to Parsers: parsed

parser

[′pär·sər]
(computer science)
The portion of a computer program that carries out parsing operations.

parser

(language)
An algorithm or program to determine the syntactic structure of a sentence or string of symbols in some language. A parser normally takes as input a sequence of tokens output by a lexical analyser. It may produce some kind of abstract syntax tree as output. One of the best known parser generators is yacc.

parser

A routine that analyzes a continuous flow of text-based input and breaks it into its constituent parts. See parse.
References in periodicals archive ?
Tabula has added Verific Design Automation's SystemVerilog parser as front-end support to variant 2.
Imbedded CSS parser helps to analyze style attribute or corresponding CSS styles for certain HTML tag, class, id (see C# VB.
O Quadro 1 apresenta sinoticamente nas duas primeiras colunas os formalismos gramaticais mais importantes do NLTK e os principais tipos de parsers disponibilizados (8).
The accuracies of the plain MSTP and Malt parsers represent the baseline results.
Once I had a functional parser and pieces of code to send the files to it, I was able to begin developing an XSL file in order to display my data.
Application developers can write their own parsers, but they don't need to; several are available-for free, on the Internet-which they can include in their applications.
This means schemas defined with DTD files express numeric data as strings, preventing XML parsers from verifying that the correct type of data is present in data records, forcing the application to perform the last step in parsing the data.
We advocate a fresh approach to creating LR parser generators which ensures understandability and correctness at every step, and leads to extremely efficient parsers:
Besides illustrating the diversity of statistical parsers, transformation tagging has several nice properties that have not been duplicated in the conventional version.
The Verific product portfolio includes Verilog, SystemVerilog and VHDL parsers, analyzers and elaborators, as well as a netlist-oriented database.
The new release expands the file parsers to add the option of direct Microsoft PST support, without having to go through MAPI.
While most of the dependency parsers can parse only projective structures, the need for non-projective relations is recognised in nearly all dependency treebank annotation schemes.