This is a list of notable lexer generators and parser generators for various language classes. Regular languages are a category of languages (sometimes...

In computer science, an LALR parser (look-ahead, left-to-right, rightmost derivation parser) is part of the compiling process where human readable text...

In computing, Tree-sitter is a parser generator and incremental parsing library. It is used to parse source code into concrete syntax trees usable in...

Regular expression Top-down parsing language Comparison of parser generators Parser combinator Ford, Bryan (January 2004). "Parsing Expression Grammars: A...

parser, LR parser, GLR parser, LL parser and GLL parser generators. What differentiates one from another is the type of CFG which they are capable of...

yacc parser generator and is the standard lexical analyzer generator on many Unix and Unix-like systems. An equivalent tool is specified as part of the...

generators, including: creator or company, license, and price. The output formats the generators can write. Code readability Documentation generator Literate...

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...

A GLR parser (generalized left-to-right rightmost derivation parser) is an extension of an LR parser algorithm to handle non-deterministic and ambiguous...

:= ( number '\n' )*; Free and open-source software portal Comparison of parser generators Executable UML Finite-state machine Regular expression Thompson's...

library. Regular expression § Implementations and running times Comparison of parser generators "Getting Started – Hyperscan 5.4.0 documentation". "Regex -...

an active parser. Some LR parser generators create separate tailored program code for each state, rather than a parse table. These parsers can run several...

is about the formal properties of LL grammars; for parsing, see LL parser or recursive descent parser. Given a natural number k ≥ 0 {\displaystyle k\geq...

language a generated parser parses but parser generators do not handle such directly, instead just focusing on generating a parser from a given description...

defines the interfaces of the two C++ generated classes. Free and open-source software portal Comparison of parser generators Lex yacc GNU Bison Berkeley...

which are not formally supported by BNF. Adaptive grammar Comparison of parser generators Metapragmatics Metasemantics Metavariable (logic) Sellink,...

grammar of programming languages, as the inputs to parser generators, and in other fields such as defining communication protocols. A parser generator generates...

Ragel Lex Comparison of parser generators Bumbulis, Peter; Donald D., Cowan (March–December 1993). "RE2C: a more versatile scanner generator". ACM Letters...

analyzers Comparison of parser generators Comparison of photogrammetry software Comparison of platform virtualization software Comparison of power management...

code directly in a WYSIWYG fashion. Comparison of document markup languages Comparison of documentation generators Lightweight markup language Wiki markup...

version 3.0 for its documentation. Comparison of document markup languages Comparison of documentation generators Comparison of note-taking software "Project:...

code generators often embed syntactic and semantic information in addition to the code necessary for execution. Automatic programming Comparison of code...

markdown parser and compiler, written in JavaScript. Built for speed. node-gfm: GitHub flavored markdown to HTML converter Parsedown: Markdown parser written...

Julia". GitHub. 2018-12-03. "GitHub - gitfoxi/Parsimonious.jl: A PEG parser generator for Julia". GitHub. 2017-08-03. Lazy https://github.com/MikeInnes/Lazy...

perfectly legal. And, in fact, they are, as far as the parser is concerned. Pascal does not allow the mixing of arithmetic and Boolean variables, and things like...

allows for special formatting to be given to parsers that support it. Comparison of documentation generators Wall, Larry; Christiansen, Tom; & Orwant, Jon...

grammar that can be parsed by a simple LALR parser. Parsing C++ is more complicated. For example, Foo<1>(3); is a sequence of comparisons if Foo is a variable...

Effort indicate[s] that the vanilla parser requires three times more development effort compared to the OMeta parser". Like JavaScript, OMeta/JS supports...

definitions of source language and the target. PQCC tried to extend the term compiler-compiler beyond the traditional meaning as a parser generator (e.g.,...

This is a comparison of notable web frameworks, software used to build and deploy web applications. This article focuses on frameworks used for building...