- Applied mathematics
- >
- Algorithms
- >
- Algorithms on strings
- >
- Parsing algorithms

- Combinatorics on words
- >
- Formal languages
- >
- Algorithms on strings
- >
- Parsing algorithms

- Data types
- >
- String (computer science)
- >
- Algorithms on strings
- >
- Parsing algorithms

- Formalism (deductive)
- >
- Formal languages
- >
- Algorithms on strings
- >
- Parsing algorithms

- Mathematical logic
- >
- Algorithms
- >
- Algorithms on strings
- >
- Parsing algorithms

- Mathematical logic
- >
- Formal languages
- >
- Algorithms on strings
- >
- Parsing algorithms

- Metalogic
- >
- Formal languages
- >
- Algorithms on strings
- >
- Parsing algorithms

- Sequences and series
- >
- String (computer science)
- >
- Algorithms on strings
- >
- Parsing algorithms

- Theoretical computer science
- >
- Algorithms
- >
- Algorithms on strings
- >
- Parsing algorithms

- Theoretical computer science
- >
- Formal languages
- >
- Algorithms on strings
- >
- Parsing algorithms

PQCC

The Production Quality Compiler-Compiler Project (or PQCC) was a long-term project led by William Wulf at Carnegie Mellon University to produce an industrial-strength compiler-compiler. PQCC would pro

Inside–outside algorithm

For parsing algorithms in computer science, the inside–outside algorithm is a way of re-estimating production probabilities in a probabilistic context-free grammar. It was introduced by James K. Baker

Left corner parser

In computer science, a left corner parser is a type of chart parser used for parsing context-free grammars. It combines the top-down and bottom-up approaches of parsing. The name derives from the use

Simple precedence parser

In computer science, a simple precedence parser is a type of bottom-up parser for context-free grammars that can be used only by simple precedence grammars. The implementation of the parser is quite s

Canonical LR parser

In computer science, a canonical LR parser or LR(1) parser is an LR(k) parser for k=1, i.e. with a single lookahead terminal. The special attribute of this parser is that any LR(k) grammar with k>1 ca

GLR parser

A GLR parser (GLR standing for "Generalized LR", where L stands for "left-to-right" and R stands for "rightmost (derivation)") is an extension of an LR parser algorithm to handle non-deterministic and

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

Simple LR parser

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. As with other types of LR(1) parser, an SLR parser is

Scannerless parsing

In computer science, scannerless parsing (also called lexerless parsing) performs tokenization (breaking a stream of characters into words) and parsing (arranging the words into phrases) in a single s

Packrat parser

No description available.

Tail recursive parser

In computer science, tail recursive parsers are a derivation from the more common recursive descent parsers. Tail recursive parsers are commonly used to parse left recursive grammars. They use a small

Shunting yard algorithm

In computer science, the shunting yard algorithm is a method for parsing arithmetical or logical expressions, or a combination of both, specified in infix notation. It can produce either a postfix not

Comparison of parser generators

This is a list of notable lexer generators and parser generators for various language classes.

Operator-precedence parser

In computer science, an operator precedence parser is a bottom-up parser that interprets an operator-precedence grammar. For example, most calculators use operator precedence parsers to convert from t

LL parser

In computer science, an LL parser (Left-to-right, leftmost derivation) is a top-down parser for a restricted context-free language. It parses the input from Left to right, performing Leftmost derivati

Earley parser

In computer science, the Earley parser is an algorithm for parsing strings that belong to a given context-free language, though (depending on the variant) it may suffer problems with certain nullable

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.

Chart parser

In computer science, a chart parser is a type of parser suitable for ambiguous grammars (including grammars of natural languages). It uses the dynamic programming approach—partial hypothesized results

Recursive ascent parser

In computer science, recursive ascent parsing is a technique for implementing an LALR parser which uses mutually-recursive functions rather than tables. Thus, the parser is directly encoded in the hos

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. The parsing methods most commonly used f

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 lang

LALR parser

In computer science, an LALR parser or Look-Ahead LR parser is a simplified version of a canonical LR parser, to parse a text according to a set of production rules specified by a formal grammar for a

Bottom-up parsing

In computer science, parsing reveals the grammatical structure of linear input text, as a first step in working out its meaning. Bottom-up parsing recognizes the text's lowest-level small details firs

LR parser

In computer science, LR parsers are a type of bottom-up parser that analyse deterministic context-free languages in linear time. There are several variants of LR parsers: SLR parsers, LALR parsers, Ca

CYK algorithm

In computer science, the Cocke–Younger–Kasami algorithm (alternatively called CYK, or CKY) is a parsing algorithm for context-free grammars published by Itiroo Sakai in 1961. The algorithm is named af

© 2023 Useful Links.