Search Results for "html parser c"

...In addition, MLton provides a feature rich Standard ML programming environment, with full support for SML97 as given in The Definition of Standard ML (Revised), a number of useful language extensions, a complete implementation of the Standard ML Basis Library, various useful libraries, a simple and fast C foreign function interface, the ML Basis system for programming with source libraries, and tools such as a lexer generator, a parser generator, and a profiler.

The Ring is a practical general-purpose multi-paradigm language. The supported programming paradigms are imperative, procedural, object-oriented, declarative using nested structures, functional, meta programming and natural programming. The language is portable (MS-DOS, Windows, Linux, macOS, Android, WebAssembly, Microcontrollers, etc.) and can be used to create Console, GUI, Web, Games and Mobile applications. The language is designed to be simple, small and flexible. Ring is...

A general purpose, object-oriented script language that compiles into code for a register based virtual machine. The language is quite similar to object-oriented high-level languages like Java and C#. The library is entirely self-sufficient and ANSI C compliant. It's main purpose is to be embedded in any application to allow automation of that application through scripting. An integrated C++ binding code generator allows you to create bindings for your application's classes in seconds. The integrated HTML documentation generator allows you to create documentation for your native bindings in seconds. ...

The goal of the project is to create specifications and provide reference parser in Java and C# for Extensible Term Language.

The Open Fortran Project (OFP) provides a Fortran 2008 compliant parser and associated tools. These tools provide a Java and C API for actions called when parser rules are completed. It also provides Fortran interfaces to the OpenCL runtime (new). IMPORTANT NOTICE: The Open Fortran Project has switched to using a parser based on SDF (Syntax Definition Formalism). Please consider using our new work at https://github.com/OpenFortranProject/ofp-sdf.

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.

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,...

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.

Waxeye is a parser generator based on parsing expression grammars (PEGs). It supports C, Java, Javascript, Python, Ruby and Scheme.

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.

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

A parser generator based on parsing expression grammar rules. It generates code and accepts actions in LLVM Assembly rather than C like its predecessor, PEG, did.

Verto is a compiler that uses a top-down recursive descent parser implemented in Java for educational purposes. It translates Verto language (a subset of the C language) into Caesar machine language. Verto is the Latin word for interpret.

Generate a parser at runtime from a collection of C++ objects. Concisely state a parser specification in ordinary C++ code. Learn from a parser generator with an object-oriented design.

CSP Canonical LR(1) Parser Generator. Includes lexer and parser generator. Supports all OS. Produces code as standard ANSI C++ w/ minimal STL and usable in commercial or non-commercial purposes.

Covra is a project to help design compilers. C3 is a tool specialized on the easy design and construction of ASTs, it is independent of the compiler compilers or parser generator that is used. It generates Java and C# code. Require JRE 1.6.0.

JetPAG is a recursive-descent parser and lexical analyzer generator focused on high efficiency, usability and readability of generated code. JetPAG generates fast recognizers and aids developers with useful tools for simplifying input interpretation.

Kncc is a New C++ Compiler. Kncc bases on ParaLR parser generator.

Generic Lexer which along with a language definition (.slx) file, constitutes Yacc/Bison compatible, custom lexical parser. It is ~1/3 the size of an equivalent Flex Lexer, resulting in a smaller compiler, and simpler yet more powerful lexical definition.

C++ parser engine based on the tables generated by Gold Parser Builder. The project has moved to GITHUB, please go there to download the latest version: www.github.com/manast/cpp-gpengine

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.

A simple, nice and instructive nonrecursive predictive syntactical analyser for LL(1) grammars, just to play with it for fun.

YooParse stands for Yet-another Object-Oriented Parser code generator. It is the complement of YooLex, a lexer code generator. The purpose of YooParse is to generate a parser that integrates tightly with the scanner generated by YooLex.

This is a project to create a compiler that converts grammars written in SRGS standard (http://www.w3.org/TR/speech-grammar/) to a graph understandable by HMM based ASR engines. Check srgs-parser.sf.net