Open Source Windows Parser Generators - Page 4
Sort By:
Parser Generators for Windows
View 1739 business solutions-
Red Hat Enterprise Linux (RHEL) on Microsoft Azure provides a secure, reliable, and flexible foundation for your cloud infrastructure. Red Hat Enterprise Linux on Microsoft Azure is ideal for enterprises seeking to enhance their cloud environment with seamless integration, consistent performance, and comprehensive support.
-
When it comes to cybersecurity, what your clients don’t know can really hurt them. And believe it or not, keep them safe starts with asking questions. With ConnectWise Identify Assessment, get access to risk assessment backed by the NIST Cybersecurity Framework to uncover risks across your client’s entire business, not just their networks. With a clearly defined, easy-to-read risk report in hand, you can start having meaningful security conversations that can get you on the path of keeping your clients protected from every angle. Choose from two assessment levels to cover every client’s need, from the Essentials to cover the basics to our Comprehensive Assessment to dive deeper to uncover additional risks. Our intuitive heat map shows you your client’s overall risk level and priority to address risks based on probability and financial impact. Each report includes remediation recommendations to help you create a revenue-generating action plan.
-
1
Turn.Message is .NET parser / generator of the TURN (Traversal Using Relay NAT) messages written in C#. Compatible with [MS-TURN] extension and clients based on Microsoft UCCAPI SDK.
-
2
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. -
3
upgen is a scanner and parser generator, which can generate parser programs in C++, Object Pascal, ...
-
4
The VISL Constraint Grammar Compiler is a natural language parser generator. It is an implementation of Pasi Tapanainen's CG-2 constraint grammar formalism.
-
Simplify every aspect of buying for your business in Order.co. From sourcing products to scaling purchasing across locations to automating your AP and approvals workstreams, Order.co is the platform of choice for growing businesses.
-
5
The VISL Phrase Structure Grammar Compiler is an implementation of a parser generator for ambiguous context-free grammars, ambiguous input, and ambiguous output.
-
6
Waxeye is a parser generator based on parsing expression grammars (PEGs). It supports C, Java, Javascript, Python, Ruby and Scheme.
-
7
A generic XML parser generator. With a DTD input for any ML language, the C parser for that language is generated. The users can embed their C code with a minimal knowledge of lex/yacc.
-
8
XMLpg - XML parser generator. Generates an XML parser in C++ from a DTD. The generated code will provide validation as well as conversion of the input XML.
-
9
This project is a parser generator, like the lex and yacc, but is based on the JavaCC grammar. It was writing in c++, run on linux and dos, and don't use another library. The grammar parser is specified through a simple file, and the parser generated
-
With the world of work changed forever, it’s essential to manage your workplace and assets together to effectively create a high-performing environment. The Eptura experience combines the power of workplace management software with asset management, enabling you to effectively operate your building and facilitate hybrid work.
-
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.
-
11
The Chilon Library is a C++0x utility library. The most advanced parts are a command-line argument parser and a parser generator library based on parsing expression grammars with built in AST generation abilities.
-
12
a higher order parser combinator library written in Java. It enables writing parser in the native Java language without resorting to any parser generator tool.
-
13
json_library
Another C++ based JSON Library (/w Parser/Generator/Navigator)
Native C++ implementation of a JSON library. Contains a Parser, a Generator and and easy-to-use Navigator in one single class. To build you will need at least a C++11 capable compiler such as MSVC 10 (express edition). There is no other 3rd party library required to compile or run it. -
14
Not C Sharp. Four goals: 1. Create a CSharp compiler written in C# and CUP Parser Generator. 2. Learn how to write a compiler. 3. Encourage compiler experimentation by anyone who is interested.
-
15
Nyu is a PEG based parser generator in which an appropriate AST type and a parser which populates this AST can be created from a single grammar description.
-
16
Pgj is a parser generator written in Java. It generates a paser code for some programming language according to a template.
-
17
QPG is a lexer and parser generator tailored for modern C++. The syntax of its grammer is designed to be more flexible and easily read than those of traditional tools like flex and bison. It's build on Qt4 but can produce output independent of it.
-
18
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'. This file is compiled with your code to produce an executable. When the executable is run, it analyses its input to verify that its correspond to the grammar.
-
19
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. All of Tree-sitter’s parsing functionality is exposed through C APIs. Applications written in higher-level languages can use Tree-sitter via binding libraries like node-tree-sitter or the tree-sitter rust crate, which have their own documentation. To build the library on a POSIX system, just run make in the Tree-sitter directory. This will create a static library called libtree-sitter.a as well as dynamic libraries.