A module to help release the tagged dev version of PEG.js on NPM
-
Updated
Sep 18, 2018 - 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.
A module to help release the tagged dev version of PEG.js on NPM
a simple, easy to use library for building recursive descent parsers by hand
🔠 Parsing Expression Grammars for JS
Small LL(1) Lexer/Parser tool
Parsing Expression Grammar Parsing Expression Generator (PEGPEG)
Context-free-grammar parser to generate random items and text
A collection of math expression parsers that were developed in my tutorial series: https://inspirnathan.com/posts/149-math-expression-parser-in-javascript/
Backend for checking Lexical and Sintaxis of yalex and yapar files, also making automathons.
test of jacob lexer+parser with a simple calculator
using jacob lexer+parser to create my own scripting language
P(arser)C(ombinator) - a minimal zero-dependency parser combinator framework enabling intuitive and modular parser development
Easier testing of nearleyjs parsers
A simple parser generator for JavaScript that uses a human-readable alternative to EBNF for defining the input grammar.
LL(1) LR(1) SLR(1) LALR(1) Visualization
[unmaintained] Fohm is a PEG parser generator for F# (currently targeting only Fable)
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.
find a template of many similar html files
A simple and just for fun LALR parser
⚪ Pearley is a *shiny* new implementation of the Earley parsing algorithm in Javascript.