Search results
16 packages found
A lean, zero dependency library to provide a useful base for your project.
A greedy, streaming lexer written in vanilla Javascript
Takes a context-free grammar and converts it into a decision-making graph. Can produce interactive Guides which generate valid sentences from the grammar.
- graph
- state machine
- automaton
- non-deterministic finite state machine
- grammar graph
- generator
- language generator
- digraph
- directed graph
- decision-making graph
- decision graph
- decision tree
- grammar
- context-free grammar
- View more
A library for finite automata and regular expressions in the context of JS RegExp
Streaming+Async lexer and parser
Automata utility package for FSMs, PDAs, TMs in JS/TS.
A lexical analysis / regular expression engine written in TypeScript
DFA based regex engine in typescript from scratch (not for production).
A library to test any finite automaton with arbitrary alphabets
- dfa
- nfa
- nfa-to-dfa-conversion
- finite-automata
- automaton-testing
- epsilon-nfa
- epsilon-nfa-to-nfa
- regex
- automaton
Tool to create and minimize DFA/NFA.
A generic api for creating and running state machines.
Library for creation and manipulation of finite automata
BinPacking algorithms are developed on JavaScript:Next Fit Algorithm, First Fit Algorithm, Worst Fit Algorithm, Best Fit Algorithm
Regular Expression Lexer, Parser, and Minimizer