Definition, Meaning, Synonyms & Anagrams | English word PARSE

---

Definitions of PARSE

1. (linguistics, ambitransitive) To resolve (a sentence, etc.) into its elements, pointing out the several parts of speech, and their relation to each other by agreement or government; to analyze and describe grammatically. [from mid 16th c.]
2. (transitive) To examine closely; to scrutinize.
3. (computing, ambitransitive) To split (a file or other input) into pieces of data that can be easily manipulated or stored.
4. (computing, transitive) To resolve (a string of code or text) into its elements to determine if it conforms to a particular grammar.
5. (computing, linguistics, intransitive) Of a string of code or text, sentence, etc.: to conform to rules of grammar, to be syntactically valid.
6. (computing, linguistics) An act of parsing; a parsing.
7. (computing, linguistics) The result of such an act; a parsing.

---

---

---

---

---

---

---

---

---

---

---

Examples of Using PARSE in a Sentence

• An LALR parser is a software tool to process (parse) text into a very specific internal representation that other programs, such as compilers, can work with.
• An LL(finite) parser can parse an arbitrary LL(k) grammar optimally in the amount of lookahead and lookahead comparisons.
• In computer science, a Simple LR or SLR parser is a type of LR parser with small parse tables and a relatively simple parser generator algorithm.
• Parse trees are typically built by a parser during the source code translation and compiling process.
• Codd's relational algebra (especially concerning composability), but SQL was easier to parse and less intimidating for those without a formal background in mathematics.
• Earley parsers in particular have been used in compiler-compilers where their ability to parse using arbitrary Context-free grammars eases the task of writing the grammar for a particular language.
• A parse tree or parsing tree (also known as a derivation tree or concrete syntax tree) is an ordered, rooted tree that represents the syntactic structure of a string according to some context-free grammar.
• Other examples are regression, which assigns a real-valued output to each input; sequence labeling, which assigns a class to each member of a sequence of values (for example, part of speech tagging, which assigns a part of speech to each word in an input sentence); and parsing, which assigns a parse tree to an input sentence, describing the syntactic structure of the sentence.
• There are several applications, most of which are open-source software, which natively parse and interpret X3D files, including the 3D graphics and animation editor Blender and the Sun Microsystems virtual world client Project Wonderland.
• Some parsing algorithms generate a parse forest or list of parse trees from a string that is syntactically ambiguous.
• The intent is to find a way to generate a small diff without needing to parse assembly code (as in Google's Courgette).
• If a default argument value contains side-effects, it is significant when those side effects are evaluated – once for the entire program (at parse time, compile time, or load time), or once per function call, at call time.
• Top-down parsing in computer science is a parsing strategy where one first looks at the highest level of the parse tree and works down the parse tree by using the rewriting rules of a formal grammar.
• A garden-path sentence is a grammatically correct sentence that starts in such a way that a reader's most likely interpretation will be incorrect; the reader is lured into a parse that turns out to be a dead end or yields a clearly unintended meaning.
• For instance, in order for an email sent using Microsoft Outlook to be read by someone using Yahoo! Mail, the email must be sent using the SMTP so that the recipient's software can understand and correctly parse and display the email.
• The commercial program attempted to parse text inputs, identifying significant nouns and verbs, which it would then regurgitate to create "conversations", plugging the input from the user into phrase templates which it then combined, along with modules that conjugated English verbs.
• Recently, in span-based neural constituency parsing lexical items begin as wordpiece tokens or BPE tiktokens before they are transformed into several other representations: word vectors (word encoder), terminal nodes (span vectors, fenceposts), non-terminal nodes (span classifier), parse tree (neural CKY).
• In computer science, an ambiguous grammar is a context-free grammar for which there exists a string that can have more than one leftmost derivation or parse tree.
• The bottom-up name comes from the concept of a parse tree, in which the most detailed parts are at the bottom of the upside-down tree, and larger structures composed from them are in successively higher layers, until at the top or "root" of the tree a single unit describes the entire input stream.
• SPKI/SDSI uses S-expression encoding, but specifies a binary form that is extremely easy to parse - an LR(0) grammar - called Canonical S-expressions.

Page preparation took: 132.45 ms.