PEG.js: Parser generator for JavaScript
-
Updated
Nov 8, 2021 - JavaScript
A grammar describes the syntax of a programming language, and might be defined in Backus-Naur form (BNF). A lexer performs lexical analysis, turning text into tokens. A parser takes tokens and builds a data structure like an abstract syntax tree (AST). The parser is concerned with context: does the sequence of tokens fit the grammar? A compiler is a combined lexer and parser, built for a specific grammar.
PEG.js: Parser generator for JavaScript
The magical sticky regex-based parser generator 🧙
JavaScript practical parser generator library using combinators
⛹ Write Grammars for the Nearley Parser!
CLI tool for creating and testing tree-sitter parsers
An elegant USFM parser.
👌 Generating Human-Friendly Functional Parsers for JavaScript
JS parser generator. As fast as yacc, but accepts any grammar!
Small language that compiles to Python37 bytecode
Loads a ANTLR4 grammar file and compiles it to JavaScript
General-purpose recursive descent parser and evaluator
find a template of many similar html files
⚪ Pearley is a *shiny* new implementation of the Earley parsing algorithm in Javascript.
A simple and just for fun LALR parser
Parser generator that can be used to quickly and succinctly define a parser definition, and to deploy an automatically-generated implementations thereof in multiple languages and on multiple platforms.
A highly portable parser generator for JavaScript whose best feature is documentation.
[unmaintained] Fohm is a PEG parser generator for F# (currently targeting only Fable)
LL(1) LR(1) SLR(1) LALR(1) Visualization
FortranPEG is an online parser generator that uses a PEG grammar and generates a Fortran module with a recursive descent parser.
Easier testing of nearleyjs parsers