💡 Words with a Similar Meaning to "Lr parser"
Found via reverse dictionary — words that share a conceptual meaning.
| Word | Definition |
|---|---|
| ll parser | In computer science, an (Left-to-right, leftmost derivation) a top-down parser for a restricted context-free language. |
| operator-precedence parser | In computer science, an operator-precedence parser is a bottom-up parser that interprets an operator-precedence grammar. |
| lalr parser | In computer science, an (look-ahead, left-to-right, rightmost derivation parser) part of the compiling process where human readable text is converted into a structured representation to be read by computers. |
| shift-reduce parser | A shift-reduce parser is a class of efficient, table-driven bottom-up parsing methods for computer languages and other notations formally defined by a grammar. |
| bottom-up parsing | In computer science, parsing reveals the grammatical structure of linear input text, as a first step in working out its meaning. |
| linear bounded automaton | In computer science, a linear bounded automaton (plural linear bounded automata, abbreviated LBA) is a restricted form of Turing machine. |
| parsing expression grammar | In computer science, a parsing expression grammar is a type of analytic formal grammar, i.e. it describes a formal language in terms of a set of rules for recognizing strings in the language. |
| control flow analysis | — |
| recursive descent parser | In computer science, a recursive descent parser is a kind of top-down parser built from a set of mutually recursive procedures (or a non-recursive equivalent) where each such procedure implements one of the nonterminals of the grammar. |
| canonical lr parser | A canonical LR parser (also called a LR(1) parser) is a type of bottom-up parsing algorithm used in computer science to analyze and process programming languages. |
| conflict-driven clause learning | In computer science, conflict-driven clause learning is an algorithm for solving the Boolean satisfiability problem. |
| linear-feedback shift register | In computing, a linear-feedback shift register is a shift register whose input bit is a linear function of its previous state. |
| ontology language | In computer science and artificial intelligence, ontology languages are formal languages used to construct ontologies. |
| compiler-compiler | In computer science, a compiler-compiler or compiler generator is a programming tool that creates a parser, interpreter, or compiler from some form of formal description of a programming language and machine. |
| interpreter pattern | In computer programming, the interpreter pattern is a design pattern that specifies how to evaluate sentences in a language. |
| analysis of algorithms | In computer science, the analysis of algorithms is the process of finding the computational complexity of algorithms—the amount of time, storage, or other resources needed to execute them. |
| top-down parsing | 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. |
| deterministic parsing | — |
| syntax-directed translation | Syntax-directed translation refers to a method of compiler implementation where the source language translation is completely driven by the parser. |
| contraction hierarchies | In computer science, the method of contraction hierarchies is a speed-up technique for finding the shortest-path in a graph. |
Translate “Lr parser” into Another Language
Pick a language — the word will be pre-filled in the translator.