Faster access than browser!
10 relations: Algebraic data type, Assembly language, Compiler-compiler, Computer science, Finite-state machine, GNU bison, LALR parser, LR parser, Recursive descent parser, Scala (programming language).
Algebraic data type
In computer programming, especially functional programming and type theory, an algebraic data type is a kind of composite type, i.e., a type formed by combining other types.
New!!: Recursive ascent parser and Algebraic data type · See more »
Assembly language
An assembly (or assembler) language, often abbreviated asm, is a low-level programming language, in which there is a very strong (but often not one-to-one) correspondence between the assembly program statements and the architecture's machine code instructions.
New!!: Recursive ascent parser and Assembly language · See more »
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 language and machine.
New!!: Recursive ascent parser and Compiler-compiler · See more »
Computer science
Computer science deals with the theoretical foundations of information and computation, together with practical techniques for the implementation and application of these foundations.
New!!: Recursive ascent parser and Computer science · See more »
Finite-state machine
A finite-state machine (FSM) or finite-state automaton (FSA, plural: automata), finite automaton, or simply a state machine, is a mathematical model of computation.
New!!: Recursive ascent parser and Finite-state machine · See more »
GNU bison
GNU bison, commonly known as Bison, is a parser generator that is part of the GNU Project.
New!!: Recursive ascent parser and GNU bison · See more »
LALR parser
In computer science, an LALR parser or Look-Ahead LR parser is a simplified version of a canonical LR parser, to parse (separate and analyze) a text according to a set of production rules specified by a formal grammar for a computer language.
New!!: Recursive ascent parser and LALR parser · See more »
LR parser
In computer science, LR parsers are a type of bottom-up parser that efficiently read deterministic context-free languages, in guaranteed linear time.
New!!: Recursive ascent parser and LR parser · See more »
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 usually implements one of the productions of the grammar.
New!!: Recursive ascent parser and Recursive descent parser · See more »
Scala (programming language)
Scala is a general-purpose programming language providing support for functional programming and a strong static type system.
New!!: Recursive ascent parser and Scala (programming language) · See more »
