Search Results for "tree grammar"
Sort By:
Showing 22 open source projects for "tree grammar"
View related business solutions-
Add Two Lines of Code. Get Full APM.Works out of the box for Rails, Django, Express, Phoenix, and more. Monitoring exceptions and performance in no time.
-
$300 in Free Credit Towards Top Cloud ServicesStart your project in minutes. After credits run out, 20+ products include free monthly usage. Only pay when you're ready to scale.
-
1
ANTLR
Parser generator to read, process, or translate structured text
ANTLR (ANother Tool for Language Recognition) is a powerful parser generator for reading, processing, executing, or translating structured text or binary files. It's widely used to build languages, tools, and frameworks. From a grammar, ANTLR generates a parser that can build and walk parse trees. It’s widely used in academia and industry to build all sorts of languages, tools, and frameworks. Twitter search uses ANTLR for query parsing, with over 2 billion queries a day. The languages for... -
2
ARTCOMParser
Parser library that uses an EBNF like grammar to generate a parse tree
Parser library that uses an EBNF like grammar to generate a parse tree You can use it to create a quick parser It uses backtracking so it may be slow for some grammar rules -
3
Ox: Attribute Grammar Compiling System
Ox is an attribute-grammar evaluator generator.
Ox is an attribute grammar compiling system that augments Lex and Yacc specifications with definitions of synthesized and inherited attributes written in a combination of Ox and C/C++ syntax. From these augmented specifications, Ox generates ordinary Lex and Yacc specifications that build and decorate attributed parse trees. The user can specify parse-tree traversals for easy ordering of side effects such as code generation. -
4
Linguistic Tree Constructor
Syntax tree editor for rapid annotation of existing text
Linguistic Tree Constructor (LTC) is a tool for drawing lingusitic syntax trees of already-existing text. It is a syntax editor, not a text editor, so the text has to exist already. It is best suited for large-scale, rapid creation of hand-annotated treebanks. The user can define their own node categories, and can label each node with labels, also definable by the user. LTC supports "generic", X-Bar and RRG trees. Supports interlinear texts in SIL SFM format. -
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
5
Omi
Front end cross-frameworks framework
...CLI helps you configure everything and provides various templates for different project types. Pass data through the component tree without having to pass props down manually at every level by store, auto update the view on demand. Cross frameworks(react, preact, vue, angular), components of omi are pure custom elements. Excellent compatibility(IE8+) with omio and enhanced CSS, rpx unit support base on 750 screen width. -
6
LR Parser and Lexer Generators: Fortran
LR parser generator and lexer generator for use in Fortran
The generator for LR parsers uses Pager's method, augmented with Tom Pennello's Forward Move Algorithm for error recovery. The grammar specifies identifiers for nodes in the abstract syntax tree, and the identifiers for tokens. It generates Fortran declarations for tree node identifiers and named constants that represent the PDA. The lexer generator accepts regular expressions and generates a DFA. It generates Fortran declarations for character classes, recognized objects, named constants that represent the DFA. ... -
7
Semantic
Parsing, analyzing, and comparing source code across many languages
semantic is a Haskell library and command line tool for parsing, analyzing, and comparing source code. Run semantic --help for complete list of up-to-date options. Semantic uses tree-sitter to generate parse trees, but layers in a more generalized notion of syntax terms across all supported programming languages. We'll see why this is important when we get to diffs and program analysis, but for now let's just inspect some output. It helps to have a simple program to parse. Symbols are named... -
8
UniCC LALR(1) Parser Generator
Parser generator, targetting C, C++, Python, JavaScript, JSON and XML
UniCC (UNIversal Compiler-Compiler) compiles an augmented grammar definition into a program source code that parses the described grammar. Because UniCC is intended to be target-language independent, it can be configured via template definition files to emit parsers in almost any programming language. UniCC comes with out of the box support for the programming languages C, C++, Python (both 2.x and 3.x) and JavaScript. Parsers can also be generated into JSON and XML. -
9
CodeConics
CodeConics is a C# lexer/parser/syntax tree generatior
CodeConics is simple, intuitive, easy to use and debug code-manipulation solution, that is grammar independent and recursion based, as opposed to other DFA(Deterministic Finite-state Automata) based solutions. -
Go From AI Idea to AI App FastAccess Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
-
10
AnyParser
Problemless Grammar and Parser in Java
Grammar based parsing in Java 8 to a tree structure. Create with no overhead a grammar in java and parse it into a tree structure. Will probably work right away with your grammar. -
11
OOPSGen
Object Oriented Parser Generator
The goal of this project is to create a simple and easy to use parser generator that will accept a textual grammar file as an input and output modularized classes representing a limited parser interface. Long term goals include a robust grammar file syntax, output suitable for multiple programming languages, and tools for better integrating compiler functionality, parse tree manipulation, and FSM based scanner generation. -
12
PHParser
A Lexer and a Parser to PHP scripts
PHParser 1.2 generates a pure Java parser for PHP programs. Invoking this parser yields an explicit parse tree (AST) and a tree walker suitable for further analysis. This tool package is based upon: - ANTLR 3.2 or higher (www.antlr.org). - JDK 1.6 or higher (java.sun.com). - Grammar specifications of PHP 5.3. -
13
Styx is a scanner and parser generator designed to address some shortcomings of the traditional lex/yacc combination. It has unique features like automatic derivation of depth grammar, production of the derivation tree including it's C interface which provides access to the abstract syntax tree, preservation of full source information and pretty printing to facilitate source-source translation, persistence to aid rapid interpreter writing. For application in contemporary computing environments, it supports unicode, reentrancy and offers thread-safeness.
-
14
PTFS - is a file system allowing to navigate through parse tree. It uses parsing expressions grammar to construct file system structure (parse tree) for the given text.
-
15
Dapar
Parsing for everybody.
Dapar is a universal parsing library written in C. It will interpret any grammar you give it in a BNF-like format, and constructs a matching expression tree for any given input. This makes developing a new parser for any language simple and reliable. Includes an ABNF parser, EBNF parser, XML parser and algebraic math parser. -
16
loon is a GLR parser generator that takes EBNF grammars as specifications. Tokens are specified in the grammar file, and it generates a parse tree instead of executing actions. A single grammar can output a parser in any supported language.
-
17
Extension of the CUP parser generator for working with abstract syntax trees (ast). Implements support for class hierarchy generation and automatic tree building from CUP grammar specification files. Version 10k of CUP is used.
-
18
A Java library for parsing files and building Abstract Syntax Tree based on context free (CF) grammar. Easy to use and provides fast prototyping. With grammar provided the library provides the AST of input. Command line interface is provided.
-
19
The EBNF Library scans strings with respect to a given EBNF grammar and returns a tree structure for the matches. It is an easy-to-use tool for scanning complex input.
-
20
The fast, flexible parsing engine. Parse anything in 4 steps: (1) define a grammar, (2) load the grammar into ClearParse, (3) call the engine to parse the source, and (4) traverse the parsing tree. You can even change your grammar at run time.
-
21
ebnf2yacc is a tool to help write yacc parsers/compilers. It takes as input a grammar written in bnf (ebnf support is planned), and outputs a c++ abstract syntax tree that supports the visitor pattern, along with a yacc parser that builds the tree.
-
22
The main goal of this project is to create a programming editor, which allows editing the tree structure of the code instead of editing the linearization. This should be implemented using XML and XML Schemas, see homepage for details.
- Previous
- You're on page 1
- Next
