Search Results for "syntax tree"
Sort By:
Showing 10 open source projects for "syntax tree"
View related business solutions-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
1
tree-sitter
An incremental parsing system for programming tools
Tree-sitter is a parser generator tool and an incremental parsing library. It can build a concrete syntax tree for a source file and efficiently update the syntax tree as the source file is edited. General enough to parse any programming language. Fast enough to parse on every keystroke in a text editor. Robust enough to provide useful results even in the presence of syntax errors. -
2
Parser for Rust source code
Parser for Rust source code
Parser for Rust source code is a major Rust crate for parsing Rust source code (token streams) into a syntax tree (AST) that procedural macros can inspect or transform. The primary target is macro authors: you can parse TokenStreams into syn::File, syn::Item, syn::Expr, syn::Type, etc. It offers rich data structures, fine-grained parsing, span tracking (for error reporting), traversal and mutation APIs (visit, fold, visit_mut), printing back to tokens, and strong feature-gating so you only compile what you need. ... -
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. Ox handles the tedious and error-prone details of writing code for parse-tree management, so its use eases problems of security and maintainability associated with that aspect of translator development. -
4
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... -
PRTG Catches Network Issues Before They Cause DowntimeReactive troubleshooting usually means hearing about a problem from frustrated users, not your monitoring tool. PRTG sets threshold-based alerts across devices, servers and applications, notifying your team by email, SMS or push the moment a metric crosses a set limit. That means catching a failing disk or overloaded server before it becomes an outage and getting time back from firefighting. Start a free trial and set your first alerts today.
-
5
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. A third program generates declarations that connect the parser and lexer. ... -
6
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. -
7
Optimize JS
Optimize a JS file for faster parsing
Optimize JS is an experimental JavaScript transformation tool created to reduce initial parsing and execution time in older browser engines. It parses JavaScript into a syntax tree and identifies functions that are immediately invoked or likely to execute eagerly. Those functions are wrapped in parentheses so engines such as older V8 versions can avoid unnecessary lazy preparsing. The tool can operate from the command line or through a JavaScript API and can optionally generate source maps. Plugins were also created for Grunt, Gulp, and webpack workflows. ... -
8
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. -
9
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.
-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
10
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.
- Previous
- You're on page 1
- Next
