Search Results for "cli-parser" - Page 2
Sort By:
Showing 112 open source projects for "cli-parser"
View related business solutions-
Earn up to 16% annual interest with Nexo.Put idle assets to work with competitive interest rates, borrow without selling, and trade with precision. All in one platform. Geographic restrictions, eligibility, and terms apply.
-
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.
-
1
Py-backwards
Python to python compiler that allows you to use Python 3.6 features
py-backwards is a transpiler that takes modern Python code (with newer syntax) and converts it to older Python versions so you can run it in legacy environments. For example, if you want to use f-strings, type annotations, or other Python 3.x niceties but have to deploy on a machine that only has an older interpreter, py-backwards rewrites your code to an equivalent, earlier syntax. It does this by parsing the source into an abstract syntax tree (AST), applying transformation rules, and... -
2
Hyacc is an efficient and practical Yacc/Bison-compatible full LR(1)/LALR(1)/LR(0) and partial LR(k) parser generator in ANSI C based on Knuth and Pager's LR(1) algorithms. Generated parser can be used in open-source or commercial software.
-
3
Parse C++ header files using ply.lex to generate navigable class tree representing the class structure. CppHeaderParser.py has the advantage of being a pure python C++ header parser. Grap a copy of ply at http://www.dabeaz.com/ply/
-
4
Front provides a compiler front end generator that can generate a parser, pretty printer, symbol table handling, and Abstract Syntax Tree data structures and traversals. It also provides a C preprocessor library, and an AST rewriter generator.
-
Go from Code to Production URL in SecondsSkip the Kubernetes configs. Cloud Run handles HTTPS, scaling, and infrastructure automatically. Two million requests free per month.
-
5
Closure Compiler JS
Package for the JS version of closure-compiler for use via NPM
closure-compiler-js packages Google’s Closure Compiler so it runs under JavaScript (e.g., Node.js) instead of a JVM, making advanced JS optimization accessible in more build pipelines. You get the same aggressive whole-program optimizations—dead-code elimination, property renaming, inlining, and cross-module motion—delivered via a JS API and CLI. Because it’s the compiler you know, it also honors Closure type annotations and JSDoc, enabling type-aware rewrites that shrink bundles without breaking semantics. The distribution is geared for tool authors: plug it into bundlers, custom scripts, or CI without dragging in a Java runtime. It’s particularly handy in constrained environments (serverless, sandboxed workers) where spawning a JVM is undesirable. ... -
6
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. -
7
NaiveLanguageTools
C# lexer and parser
NLT is free, open-source C# lexer and GLR parser suite -- which translates to ability to parse ambiguous grammars. Grammar can be defined directly in code or (preferably) in separate file (lex/yacc-like) for included generator. If you understand/guess the meaning of grammar in C#: // scanning lexer.AddStringRule(")", match => SymbolEnum.RPAREN); // parsing prod_builder.AddProduction(SymbolEnum.exp, SymbolEnum.LPAREN, SymbolEnum.exp, SymbolEnum.RPAREN, (_1, e, _3) => (AstNode)e); or grammar in NLT format: // scanning /[A-Za-z_][A-Za-z_0-9]*/ -> IDENTIFIER, IdentifierSymbol.Create($text); // parsing program -> list:namespace_list { new Program(currCoords(), (Namespaces)list) }; you should be able to use it :-). ... -
8
...While the SDF parser is not as advanced as the ANTLR-based parser, it provides much more capabilities, including a term rewriting system for creating a Fortran AST (Abstract Syntax Tree) using Stratego/XT (see http://strategoxt.org) and other custom program transformations. The OFP ANTLR-based parser is no longer under active development.
-
9
ZILF
This repository is deprecated. Use Heptapod instead.
THIS REPOSITORY IS DEPRECATED. Please use the Heptapod repository instead: https://foss.heptapod.net/zilf/zilf ZILF is a set of tools for working with the ZIL interactive fiction language, including a compiler, assembler, disassembler, and game library. -
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.
-
10
JS/CC LALR(1) Parser Generator
A LALR(1) Parser Generator for JavaScript written in JavaScript
JS/CC is a parser generator for JavaScript/ECMAScript, which is entirely written in ECMAScript itself. It produces LALR(1) parsers with integrated lexical analyzers. JS/CC can run as a website or be invoked from a console, and runs on several platforms. -
11
Coco/S Parser Generator
Parser Generator based on Coco/R
Coco/S is a compiler generator that takes plain EBNF grammar files and features a SAX style call back API. It is written in Java and produces a Java Scanner (Lexer) and Parser for the language described by the input grammar. Coco/S is a branch of the 2010/11 release of Coco/R for Java. While Coco/R takes an attributed grammar file, Coco/S has a callback API. This has the advantage of a clean separation between grammar (EBNF) and Compiler/Interpreter. -
12
AustenX
A PEG based parser generator, with advanced features
A parser generator for PEG grammars, built using Java, currently producing code for Java. -
13
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.
-
14
qtBisonC++ is a general-purpose parser generator that converts a grammar description for an LALR(1) context-free grammar into a QT C++ program to parse that grammar. qtBisonC++ reads the given input files for a description of a scanner to generate. The description is in the form of grammar in Backus-Naur Form (BNF), called rules. qtBisonC++ generates as output a C++ source and include file, `lexyy.cpp` and `lexyy.h`, which defines a class `lexyy'.
-
15
CoffeeScriptRedux
Rewrite of the CoffeeScript compiler with proper compiler design
CoffeeScriptRedux is a rewritten version of the CoffeeScript compiler with emphasis on compiler design principles, robustness, and extensibility—designed to be "complete enough to use for nearly every project." Before transitioning from Jeremy's compiler, see the intentional deviations from jashkenas/coffee-script wiki page. Complete enough to use for nearly every project. Proper compiler design principles and a focus on robustness and extensibility. -
16
Kayacc
A Compiler Development Toolkit
Kayacc is an alternate name for the TOMBO project. I am in the process of updating the Tombo project page with version 2.1.0. Please download Tombo2.1.0.tar.gz from the Files tab. Tombo is a compiler generation toolkit for constructing compilers and interpreters. It includes a BNF compiler that generates parsers for context free grammars, and a class library to support compiler development. The class library supports symbol tables, Unicode text manipulation, reserved word mappings,... -
17
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.
-
18
MCP -- Managed C++ for GCC
Managed C++ for GCC
MCP aims to provide not just a garbage collected C++ but one that is very similar to Microsoft's C++/CLI. It uses Boehm GC as its garbage collector. While BoehmGC can be easily employed in any C++ projects to enable automatic garbage collection, it can only run in conservative mode. MCP uses BoehmGC in precise mode. -
19
Common Text Transformation Library of C++ classes and functions to parse and modify STL strings. CTTL substring classes may be compared, inserted, replaced, and parsed with EBNF grammars. Compiled program implements recursive descent LL(INF) parser.
-
20
JCompiler
Mini Python Compiler written in Java
Open source mini Python compiler written in Java using Sablecc as parser generator. -
21
OpenBlocks C++ Library
A C++ Implementation of the MIT OpenBlocks Java Code
Please see more details under: http://education.mit.edu/openblocks. I have rewritten the parser and an OpenGL 2D/3D renderer of computer programs written in OpenBlocks. I provide here the full source code and a Microsoft Visual C++ 2005 Solution File. The code includes the C++ Library and a demo driver application that constructs a computer program using OpenBlocks and displays it using OpenGL. -
22
Waxeye is a parser generator based on parsing expression grammars (PEGs). It supports C, Java, Javascript, Python, Ruby and Scheme.
-
23
Lemonade 0.01 An Lalr Parser Generator for "D" (www.digitalmars.com) Based on Lemon 1.0 Ref: http://www.hwaci.com/sw/lemon/
-
24
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. -
25
Ultimately, intends to cross-compile a number of languages. Initial target languages: C and C++. Current development targets: C and C++ standalone preprocessor; parser frontend for C and C++ compiler.
