💡 Words with a Similar Meaning to "Parser combinator"
Found via reverse dictionary — words that share a conceptual meaning.
| Word | Definition |
|---|---|
| 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. |
| preprocessornoun | (computing) program that processes its input data to produce output that is used as input to another program |
| 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. |
| operator-precedence parser | In computer science, an operator-precedence parser is a bottom-up parser that interprets an operator-precedence grammar. |
| 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. |
| functional programmingnoun | (programming) Programming in a style that, in lieu of assignment, uses procedure calls to bind variables to values, so that referential transparency is preserved. |
| nested function | In computer programming, a nested function (or nested procedure or subroutine) is a named function that is defined within another, enclosing, block and is lexically scoped within the enclosing block meaning it is only callable by name within the body of the enclosing block and can use identifiers declared in outer blocks, including outer functions. |
| list comprehension | A list comprehension is a syntactic construct available in some programming languages for creating a list based on existing lists. |
| function composition | In mathematics, the composition operator takes two functions, and , and returns a new function . |
| compilernoun | (software) A computer program that transforms source code into object code. |
| monadnoun | One thing, one being, one item. |
| composite data type | In computer science, a composite data type or compound data type is a data type that consists of programming language scalar data types and other composite types that may be heterogeneous and hierarchical in nature. |
| function objectnoun | (object-oriented programming) An object that encapsulates a function pointer (or equivalent). |
| template processor | A template processor (also known as a template engine or template parser) is software designed to combine templates with data (defined by a data model) to produce resulting documents or programs. |
| recursive data type | In computer programming languages, a recursive data type (also known as a recursively-defined, inductively-defined or inductive data type) is a data type for values that may contain other values of the same type. |
| 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. |
| history of compiler construction | In computing, a compiler is a computer program that transforms source code written in a programming language or computer language (the source language), into another computer language (the target language, often having a binary form known as object code or machine code). |
| ll parser | In computer science, an (Left-to-right, leftmost derivation) a top-down parser for a restricted context-free language. |
| higher-order abstract syntax | In computer science, higher-order abstract syntax (abbreviated HOAS) is a technique for the representation of abstract syntax trees for languages with variable binders. |
| operatornoun | A person or organisation that operates a device, system, service, etc. |
Translate “Parser combinator” into Another Language
Pick a language — the word will be pre-filled in the translator.