Parsing the JavaScript's RegExp in JavaScript.
Scanner and parser for JSON with comments.
Constituency TreeBanks ============
The package allows to parse plain javascript object into an array of { path, value } tuples, i.e. ``` import { parseTree } from 'object-to-path-values'
It is a core package of Richmd.
Interact with parsed JavaScript code trees using familiar selector patterns
Temporary gonzales-pe fork for sass-lint
Pre-built ANTL4 lexers and parsers for SQL: PostgreSQL, MySQL, SQL Server and Oracle (PL/SQL)
Scanner and parser for JSON with comments.
A set of tools for managing HelloAO's Free Bible API
No description provided.
Markdown Driven Development
JS toolkit for parsing text using ABNF grammars
Embrace and extend GNU sed, the stream editor for filtering and transforming text.
A Java parser library for JavaScript/TypeScript
ReScript PPX validates the tailwindcss class names
Parser for JSON schemas generated from CosmWasm, useful for creating automated contract tooling.
Node.js git server for cloud-native applications
Parse ASCII tree structures and render as HTML tables with semantic class names
Antlr 4 OData Typescript parser
Scanner and parser for JSON5.
A simple lexer and bottom-up parser for creating domain specific languages
Gonzales Preprocessor Edition (fast CSS parser)
A very small css parser
General LL(1) Parser
The syntax parser based on BNF rules.
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).
Panfix parsing: linear time parsing of multifix operators.
ParseTree is a C extension (using RubyInline) that extracts the parse tree for an entire class or a specific method and returns it as a s-expression (aka sexp) using ruby's arrays, strings, symbols, and integers. As an example: def conditional1(arg1) if arg1 == 0 then return 1 end return 0 end becomes: [:defn, :conditional1, [:scope, [:block, [:args, :arg1], [:if, [:call, [:lvar, :arg1], :==, [:array, [:lit, 0]]], [:return, [:lit, 1]], nil], [:return, [:lit, 0]]]]]
ParseTreeReloaded is a reimplementation of ParseTree using RubyInlineAcceleration. The goal is to provide full compatibility to ParseTree while making it easier to build and extend.
sexp_processor branches from ParseTree bringing all the generic sexp processing tools with it. Sexp, SexpProcessor, Environment, etc... all for your language processing pleasure.
This version respects text after block comment =end
sexp_processor branches from ParseTree bringing all the generic sexp processing tools with it. Sexp, SexpProcessor, Environment, etc... all for your language processing pleasure.
rb-parsetree is the C extension part of ParseTree for Ruby 1.9. A patched version of Ruby 1.9.2 is required.
has just one dependency which points to the actual gem. this gem gets refered by ParseTree-3.0.0
A CommonLisp CLOS-like ParseTree in Ruby... read (and write) it and weep.
ruby_parser (RP) is a ruby parser written in pure ruby (utilizing racc--which does by default use a C extension). RP's output is the same as ParseTree's output: s-expressions using ruby's arrays and base types.
RubyMacros is a lisp-like macro pre-processor for Ruby. More than just a purely textual substitution scheme, RubyMacros can manipulate and morph Ruby parse trees (in the form of RedParse Nodes) at parse time in just about any way you see fit. Macros are programmed in ruby itself. And since parse trees are represented in RedParse format, they're easier to use (programatically) and more object- oriented than other available ruby parsetree formats. (RedParse Node format is actually designed to be straightforward to use and to represent the structure of ruby source code very closely.)
ruby_parser (RP) is a ruby parser written in pure ruby (utilizing racc--which does by default use a C extension). RP's output is the same as ParseTree's output: s-expressions using ruby's arrays and base types. As an example: def conditional1(arg1) if arg1 == 0 then return 1 end return 0 end becomes: s(:defn, :conditional1, s(:args, :arg1), s(:scope, s(:block, s(:if, s(:call, s(:lvar, :arg1), :==, s(:arglist, s(:lit, 0))), s(:return, s(:lit, 1)), nil), s(:return, s(:lit, 0)))))
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.