Search Results for "tree grammar"
Sort By:
Showing 26 open source projects for "tree grammar"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
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.
-
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
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. -
3
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. -
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. -
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.
-
5
...Contains the DFA lexer generator, 80% faster than flex lexers. Works with Visual Studio C++. Contains 27 grammars. Parsers build a symbol table. Parsers construct an abstract-syntax tree (AST). Parser are very fast and small. Reads ANTLR and YACC grammars, after making some changes. Accepts advanced EBNF grammar notation. Includes 4 sample projects. Source code compiles on Windows and Linux. Support is available. Contact me at: paul@paulbmann.com .
-
6
mdast
Markdown Abstract Syntax Tree format
mdast is a specification for representing markdown in a syntax tree. It implements unist. It can represent several flavours of markdown, such as CommonMark and GitHub Flavored Markdown. This document defines a format for representing markdown as an abstract syntax tree. Development of mdast started in July 2014, in remark, before unist existed. This specification is written in a Web IDL-like grammar. -
7
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. ... -
8
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... -
9
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. -
$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.
-
10
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. -
11
...The output of PAVT has been structured to maximize the learning outcomes and contains important constructs like FIRST and FOLLOW sets, item sets, parsing table, parse tree and leftmost or rightmost derivation depending on the algorithm being visualized. For instructions to use, see readme.txt.
-
12
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. -
13
LexGupthor
Lexer+parser for Gupta Team Developer source code
LexGupthor is a C# framework for lexing and parsing Gupta source code -- more precisely, Gupta Technologies (ex-Unify, ex-ex-Centura, ex-ex-ex-Gupta) Team Developer (ex-SQLWindows) source code. In short, you feed Gupta source code to LexGupthor, and it gives you an STD. STD (here) = syntax tree description, not a very accurate concept, sits between an AST (abstract syntax tree) and a CST (concrete) because of the particularly restrictive and ambiguous grammar of this language. Basically it will get the job done without a University diploma. The Gupta STD that our project helps you get can be easily used on its own, or as the backbone of our related Gupta source code analysis+improvements tool called OgleGupta. -
14
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. -
15
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.
-
16
SweetOnionCCG2PTBConverter
A tool that converts CCGBank to PTB
Conversion between different grammar frameworks is of great importance to comparative performance analysis of the parsers developed on them. This tool can convert CCG derivations to PTB trees by using Max Entropy models as well as visualizing the tree graphs. The main technical innovation presented here is the effective conversion method which achieves a F score over 95%. -
17
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. -
18
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.
-
19
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.
-
20
Syntactic parser of English sentences is simple parser with enhanced Chomsky's grammar that generates tree structure based on input sentence.
-
21
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.
-
22
BPLEX is a new algorithm for tree compression and, in particular, for constructing succinct representations of XML document structures. The algorithm is described in "Grammar-Based Tree Compression", Technical Report IC/2004/80, EPFL, Lausanne
-
23
A flexible Japanese to English language translation engine that allows multiple results be displayed according to all possible grammar ratings, i.e. a list of results will be displayed instead of only one. Please browse the CVS tree for actual project.
-
24
This aim of this project is to provide an efficient LTAG Parser (Lexicalized Tree Adjoining Grammar) and some linguistic resources to the NALP community and other interested people. Please feel free to submit bug reports, feature requests, or any other co
-
25
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.
