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
CLI tool for creating and testing tree-sitter parsers
An elegant USFM parser.
⛹ Write Grammars for the Nearley Parser!
Loads a ANTLR4 grammar file and compiles it to JavaScript
The magical sticky regex-based parser generator 🧙
General-purpose recursive descent parser and evaluator
JS parser generator. As fast as yacc, but accepts any grammar!
LL(1) LR(1) SLR(1) LALR(1) Visualization
⚪ Pearley is a *shiny* new implementation of the Earley parsing algorithm in Javascript.
JavaScript practical parser generator library using combinators
Easier testing of nearleyjs parsers
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 simple parser generator for JavaScript that uses a human-readable alternative to EBNF for defining the input grammar.
A module to help release the tagged dev version of PEG.js on NPM
A collection of math expression parsers that were developed in my tutorial series: https://inspirnathan.com/posts/149-math-expression-parser-in-javascript/
Small language that compiles to Python37 bytecode
a simple, easy to use library for building recursive descent parsers by hand
[unmaintained] Fohm is a PEG parser generator for F# (currently targeting only Fable)
find a template of many similar html files