Downloads files to an on-disk cache.
A PEG parser generator with packrat parsing written in JavaScript for JavaScript
Packrat parser combinator implementation.
Instant typescript npm packages.
Defines and generates parsers from composable grammar definitions. Includes advanced features like lexer-free parsing, selective packrat memoization and static analysis.
realtime bin-packing layout library
Auto-learning codebook compression for AI agent memory. Makes context files 2-10x smaller while staying LLM-readable.
A simple `component` packer
An object-oriented language for parsing and pattern matching
Stream logs over mqtt
the easy way to mock a neo4j-driver session
Automatic conversion between two different programming languages through two grammar files that define the same grammar structure and grammar name
TypeScript parser generator
Parser for Apple's password rules format: https://developer.apple.com/password-rules/
replaces keys dynamically within the values for a raw, flat object
code generator based on geenee metadata
A parser combinator library
[//]: # ( ns__file unit: standard, comp: README.md )
[//]: # ( ns__file unit: standard, comp: README.md )
interface to config files for templates
run a sequence of bash commands as specified by a json
JSON grammar-based parser
install a list of packages
simple interactive menus
A simple terminal UI for updating your package.json dependencies
High-performance PEG parser library with packrat memoization and arena allocation
Extension of nom to apply Packrat Parsing
A Wireshark-style terminal packet analyzer, reverse engineering, and security research tool with live capture, IDS, port scanner, packet crafter, and PCAP replay
Helper crate of nom-packrat
One-rule TDPL/PEG parsing language with a static-codegen backend (FastParse) that beats pest, peg, nom, winnow, and chumsky on equal-work benchmarks.
Derive parsers from MPL's one-rule grammar files. Includes the FastParse static-codegen backend (cascade detection, first-byte dispatch, Squirrel left recursion).
Memoization support for packrat parsing in sipha
Incremental PEG parser Rust library
Tokay is a programming language designed for ad-hoc parsing.
PEG parser, syntax trees, and code generation
A library to declaratively implement parsers that are based on Packrat Parsing
Packrat is a gem for merging all css rules to inline for html emails and files.
Packrat is a Sinantra extension based around the idea of mixing and matching. With Packrat we can combine multiple Sinatra applications into one instance, where they can share configuration data, filters, css and other static assets. Creating a new site out of existing pieces should be as simple as cloning a series of pieces, and for each one, adding one line to a config file.
Helper method to simplify Rails caching, based on PackRat
Packrat parser combinator library for Ruby
This is a parsing library and language specifier. It uses packrat parsing, as opposed to LL(k) or LR(k) parsing. Packrat parsing uses memoization in a recursive decent parser. By storing the production results from each significant point it speeds up the parse. PEG is a formalized grammar specification optimized for packrat parsing. Peggy also allows user to specfy their grammar in pure Ruby as methods or using a Builder. And the default Peggy grammar is a varitaion on PEG, with support for full regular expressions and for simplifed grammars which automatically ignore a set of productions.
Simple language recognition tool for Ruby based on packrat parsing
Babel Bridge is an object oriented parser generator for parsing expression grammars (PEG). Generate memoizing packrat parsers 100% in Ruby code with a simple embedded DSL.
Walrat is a Parsing Expression Grammar (PEG) parser generator that creates integrated lexers, "packrat" parsers, and Abstract Syntax Tree (AST) builders.
Ghost Wheel is a packrat parser generator handling scanning and parsing of context-free grammars. Parsers can be built using an PEG-like syntax or a with a Ruby DSL.
Pegarus is, broadly, an implementation of LPEG on Rubinius. LPEG implements a Parsing Expression Grammar using a parsing machine rather than the Packrat algorithm. (See "A Text Pattern-Matching Tool based on Parsing Expression Grammars" by Roberto Ierusalimschy.) Pegarus actually implements an abstract syntax tree (AST) for the PEG. There are various options to execute the AST against a subject string. One option is a simple AST-walking evaluator. A second option is an implementation of the LPEG parsing machine. A third option is a compiler that targets Rubinius bytecode.
No description provided.
No description provided.
No description provided.