Search Results for "syntax"
Sort By:
Showing 30 open source projects for "syntax"
View related business solutions-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
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.
-
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. Dependency-free so that the runtime library (which is written in pure C) can be embedded in any application. ... -
2
League CommonMark
Highly-extensible PHP Markdown parser
CommonMark is a PHP library that implements the CommonMark Markdown specification, allowing developers to convert Markdown into HTML. It provides a robust and extensible parser with support for additional syntax and extensions. The library is designed to be efficient and standards-compliant, making it ideal for applications that require consistent and reliable Markdown processing. -
3
Meriyah
A 100% compliant, self-hosted javascript parser
Meriyah is a high-performance, fully compliant JavaScript parser that generates ESTree-compatible Abstract Syntax Trees (ASTs). Designed for speed and stability, it serves as an alternative to parsers like Acorn and Esprima. -
4
Rust-Peg
Parsing Expression Grammar (PEG) parser generator for Rust
rust-peg is a Parsing Expression Grammar (PEG) parser generator for Rust. It allows developers to define grammars in a concise syntax and generates efficient parsers, facilitating the creation of domain-specific languages and interpreters. -
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.
-
5
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. ... -
6
Logos
Create ridiculously fast Lexers
Logos is a lexer generator for Rust, designed to create fast and efficient lexers with minimal code. It leverages Rust's procedural macros to define token patterns, streamlining the process of lexical analysis. -
7
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... -
8
GJSON
Get JSON values quickly, JSON parser for Go
...It supports parsing JSON lines (newline-delimited JSON) as an array for large stream processing. GJSON also provides modifiers (such as @reverse, @flatten, @keys) which allow transformation or inspection directly via the path syntax. Because it works on raw bytes or strings, it's suited for high-performance JSON parsing without needing to define Go struct types. -
9
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. -
Error to trace to log to deploy. One click. No SSH.AppSignal links every error to the trace, the trace to the log, the log to the deploy that shipped it.
-
10
CSON
CoffeeScript-Object-Notation. Same as JSON but for CoffeeScript
cson (CoffeeScript‑Object‑Notation) is a human-friendly data serialization format similar to JSON but using CoffeeScript syntax, with a library (and CLI) to parse and serialize between CSON, JSON, and JavaScript objects. Executing the method with a callback still executes the method synchronously. Requires or parses a file path of the desired format into an Object If the format option is not specified, we use the filename to detect what it should be; otherwise, we default to parsing CSON. -
11
Instaparse
Instaparse aims to be the simplest way to build parsers in Clojure
Instaparse is a simple yet powerful parser generator for Clojure and ClojureScript that turns grammars written in EBNF or ABNF into executable parsers, with support for left recursion, ambiguous grammars, PEG-like lookahead, and various output formats. Instaparse supports most of the common notations for context-free grammars. For example, a popular alternative to * is to surround the term with curly braces {}, and a popular alternative to ? is to surround the term with square brackets [].... -
12
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. ... -
13
Seafox
A blazing fast 100% spec compliant, self-hosted javascript parser
Seafox is a high-performance ECMAScript parser written in JavaScript. It aims to be a fast and compliant parser for JavaScript, suitable for various tooling and analysis purposes. -
14
rjsx-mode
A JSX major mode for Emacs
rjsx-mode is an Emacs major mode derived from js2-mode, tailored for editing JSX files. It extends the parser to support full JSX syntax, providing features like syntax highlighting, indentation, and error checking for React development. -
15
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. -
16
This project has moved to GitHub ! The version here at SourceForge will remain for historic purpose. Koopa is a parser generator, made for COBOL. It can handle source files in isolation (no preprocessing required) and doesn't mind the presence of CICS/SQL fragments. The grammar is easily extensible in a way which minimizes the impact on the overall code.
-
17
PEG.js
PEG.js is a parser generator for JavaScript
PEG.js is a simple parser generator for JavaScript that produces fast parsers with excellent error reporting. You can use it to process complex data or computer languages and build transformers, interpreters, compilers and other tools easily. PEG.js is still very much work in progress. There are no compatibility guarantees until version 1.0. Based on parsing expression grammar formalism, more powerful than traditional LL(k) and LR(k) parsers. Usable from your browser, from the command line,... -
18
This is an implementation continuously under development of Dynamic Syntax, a word-by-word incremental semantic grammar, especially suited to dialogue. The implementation contains the following: (1) depth-first and breadth-first parsers and generators, based on hand-crafted domain-specific lexicons but cover a broad range of structures, including relatives and tense; (2) a prototype incremental dialogue system, DyLan, based on Jindigo (Skantze & Hjalmarsson, 2010), but using the Dynamic Syntax (Kempson et. al. 2001, Cann et. al. 2005) parser/generator; (3) a grammar induction module which learns DS incremental grammars from data (Eshghi et. al. 2013). ...
-
19
C#Prolog
C#Prolog -- A Prolog interpreter written in managed C#
C#Prolog -- A Prolog interpreter written in C#. Can easily be integrated in C# programs. Characteristics: reliable and fairly fast interpreter, command line interface, Windows-interface, builtin DCG, XML- and JSON-predicates, SQL-predicates, extendible. -
20
IronMeta is an implementation of Alessandro Warth's OMeta metaprogramming system in C#. It provides a packrat parser generator that generates parsers for Parsing Expression Grammars that operate on arbitrary streams of objects.
-
21
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. -
22
...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.
-
23
UML 2 Statemachine for C++
UML 2 Statemachine for C++ is a development framework with DSL support
UML 2 Statemachine Code Generator is a developer framework for an easy implementation of statemachine based applications. Here, with this framework only one Domain-specific language (DSL) specification is necessary to create executable codes for Linux, Mac OS X, and Microsoft Windows. With this framework you save a lot of time and effort during implementation; also you have an always valid - based on a well-defined C++ standard - generated code with high quality. -
24
A simple way to create a syntax highlighting editor for a custom language/grammar and/or create custom grammar parsers. This is a .NET project written in C#. See details here: http://acct001.com/wordpress/?p=190
-
25
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.
