Search Results for "tree grammar"
Sort By:
Showing 33 open source projects for "tree grammar"
View related business solutions-
Try Google Cloud Risk-Free With $300 in CreditUse your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
-
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
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. -
8 Monitoring Tools in One APM. Install in 5 Minutes.AppSignal works out of the box for Ruby, Elixir, Node.js, Python, and more. 30-day free trial, no credit card required.
-
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
nlg
Natural language generator.
Takes a grammar tree as a specification and generates an English language phrase or sentence with correct tense, person, etc. -
7
...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 .
-
8
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. -
9
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. ... -
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.
-
10
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... -
11
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. -
12
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. -
13
...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.
-
14
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. -
15
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. -
16
DataGenerationLanguage
Generates random data for software/hardware testing
DGL (DataGenerationLanguage) is a declarative language based on probabilistic context free grammars. The aim is to enable the generation of test data for software and hardware systems. One provides a context-free grammar describing the data to be generated. These specifications are transformed into C/C++ code which is then compiled to create the data generator. The context-free productions are enhanced in many different user-selectable ways to go beyond what is normally definable using... -
17
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. -
18
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. -
19
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.
-
20
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.
-
21
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%. -
22
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. -
23
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.
-
24
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.
-
25
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.
