An expression tree data struct
Stateful expression tree for set algebra
React Expression Tree View Component
mdast extension to parse and serialize MDX (or MDX.js) expressions
A TeX math parser that can evaluate TeX math and convert it into a MathJS expression tree.
React Logical Expression Tree View Component
Extensible and dependency free SQL builder that provides an expression tree and supports multiple database dialects.
A parser that builds an expression tree from LaTeX
Javascript expression tree visitor, on top of esprima parser
Data structure for constructing math expressions
Create expression trees
Helper function to optimise call expression
Helper which skips types and parentheses
Ensure that reserved words are quoted in property accesses
Helper function to replace certain member expressions with function calls
Rename destructuring parameter to workaround https://bugs.webkit.org/show_bug.cgi?id=220517
Vega expression parser and code generator.
A Binary Expression Tree implementation which can evaluate infix mathematical expressions
Efficient path tracking and pattern matching for XML/JSON parsers
Remove JSX empty expression
micromark extension to support MDX or MDX JS expressions
A regular expression to match all Emoji-only symbols as per the Unicode Standard.
Custom functions for the Vega expression language.
micromark factory to parse MDX expressions (found in JSX attributes, flow, text)
Expression tree, automatic gradients, neural networks, layers and perceptrons.
Expression tree logging
Consensus-free distributed resource-sharing mesh for edge fleets, pairing discrete exterior calculus with hierarchical active inference.
Exact rational and computable real arithmetic in Rust
Load and rewrite Kicad s-expression files into a tree structure for scripting
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]]]]]
Loads logical or mathematical expression (in string) into Abstract Syntax Tree for later evaluation
Parses simple mathematical expressions, creates a fully object-oriented expression tree. Evaluation can have injected variables.
This gem provides ui components for Rails Applicaitons based on Cells, that can be used to edit the criteria_operator expression trees.
Benedictus is a Rails developer's CLI for inspecting the execution plan of any ActiveRecord relation, scope, or query object. It boots the host Rails app, evaluates the expression you pass in, runs EXPLAIN (or EXPLAIN ANALYZE inside a rolled-back transaction), parses the JSON plan, and renders it as a colored, annotated tree with inline performance warnings.
Walrat is a Parsing Expression Grammar (PEG) parser generator that creates integrated lexers, "packrat" parsers, and Abstract Syntax Tree (AST) builders.
Installs 5 commands that process a git directory tree. Directories containing a file called .ignore are ignored. The git-commitAll command commits all changes to each repository in the tree. The git-evars command writes a script that defines environment variables pointing to git repos. The git-exec command executes a bash expression on children of a directory, or a list of directories. The git-replicate command writes a script that clones the repos in the tree, and adds any defined remotes. The git-update command updates each repository in the tree.
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.
Less2Sass is an easy to use converter between Less and Sass, respectively SCSS, dynamic stylesheet formats. It is based on abstract syntax tree transformation instead of the common string replacement methods using regular expressions. It does not support a lot of language features, yet. However, when finished, it will offer the developers an easy way to convert between these formats without the following manual conversion as it is today.
This gem takes English words, converts them to their IPA equivalent, and then uses a tree data structure to query a database and identify other English words that have a similar phonetic makeup. It uses RubyTree which has the following license: "RubyTree is licensed under the BSD license. Copyright (c) 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015 Anupam Sengupta (anupamsg@gmail.com). All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. Neither the name of the organization nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE." It also uses string_to_ipa which includes the following license from Carnegie Mellon University: "The Carnegie Mellon University Pronouncing Dictionary was used in the creation of this gem. Their copyright notice follows: Copyright (C) 1993-2015 Carnegie Mellon University. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. The contents of this file are deemed to be source code 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. This work was supported in part by funding from the Defense Advanced Research Projects Agency, the Office of Naval Research and the National Science Foundation of the United States of America, and by member companies of the Carnegie Mellon Sphinx Speech Consortium. We acknowledge the contributions of many volunteers to the expansion and improvement of this dictionary. THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY 'AS IS' AND ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE."
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.