Search Results for "lnk-parse"

...It reuses libraries used by the Go language tools alongside LLVM to provide an alternative way to compile programs written in the Go programming language. While TinyGo embeds the Clang compiler to parse import "C" blocks, many features of Cgo are still unsupported.

Binaryen is a compiler and toolchain infrastructure library for WebAssembly, written in C++. It aims to make compiling to WebAssembly easy, fast, and effective. Binaryen has a simple C API in a single header, and can also be used from JavaScript. It accepts input in WebAssembly-like form but also accepts a general control flow graph for compilers that prefer that. Binaryen's internal IR uses compact data structures and is designed for completely parallel codegen and optimization, using all...

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.

GnuCOBOL (formerly OpenCOBOL) is a free, modern COBOL compiler. GnuCOBOL implements a substantial part of the COBOL 85, X/Open COBOL and newer ISO COBOL standards (2002, 2014, 2023), as well as many extensions included in other COBOL compilers (IBM COBOL, MicroFocus COBOL, ACUCOBOL-GT and others). GnuCOBOL translates COBOL into C and internally compiles the translated code using a native C compiler. Build COBOL programs on various platforms, including GNU/Linux, Unix, Mac OS X, and...

...It allows developers to handle OpenAPI documents in a strongly typed, language-neutral, and extensible way by generating structured data models that can be used across different programming languages supported by protobuf. Using these protobuf models, developers can safely parse, validate, and manipulate OpenAPI specifications, resolve dependencies, and export results as JSON, YAML, or binary files. Gnostic also provides a plugin interface similar to protoc, enabling integration with external API tooling and the generation of additional artifacts, such as annotated protobuf APIs, Go clients, and vocabulary summaries. ...

Convert C++ software programs into synthesisable Verilog using the Clang compiler frontend to parse and SystemC for intermediates.

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/

...As a guide to what PAS2PHP can achieve... my web site is written in Pascal, and then converted to PHP. (The code is in the source package). PAS2PHP uses the Pascal Parse Tree Classes (PasTree) which comes with FreePascal, and therefore the parsing limits are defined by this library.

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.

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 :-). ...

Hogan.js is a 2.5k JS templating engine developed at Twitter. Use it as a part of your asset packager to compile templates ahead of time or include it in your browser to handle dynamic templates. If you're developing with Node.js, just use NPM to add the Hogan package. Hogan.js was developed against the mustache test suite, so everything that holds true for templates is also the case for hogan.js. That means you get variables, sections, lambdas, partials, filters, and everything else you've...

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.

CTokenizer accepts C++ syntax as input and outputs a vector of CToken objects, which contain a token string and a(n enumerated) token type, which can then be used to parse the input.

JAC (Java Asn1 Compiler) is a tool for you if you want to (1)parse your asn1 file (2)create .java classes and (3)encode/decode instances of your classes. Just forget all asn1 byte streams, and take the advantage of OOP! BER, CER and DER are all supported

Xomp is a src-to-src translator for most of 3.0. A simple platform for experimentation and optimization of OpenMP implementations and extensions. Has been tested with C programs but does not parse C. Should be easily adaptable for other languages.

BNF for Java is a BNF Compiler-Compiler, or Parser-Generator. It implements ISO Standard Backus-Naur Format, using Java. BNF allows you to create a syntax, or a complete language, to parse your data source. Your custom Java extensions generate output.

Xml Data Objects: A framework to declaratively parse XML

Chaperon is a LALR(1) parser, which parse structured text documents and generate XML documents as output. It includes a parser generator like yacc and a regex scaner like lex. As input use Chaperon a grammar written in XML.

The fast, flexible parsing engine. Parse anything in 4 steps: (1) define a grammar, (2) load the grammar into ClearParse, (3) call the engine to parse the source, and (4) traverse the parsing tree. You can even change your grammar at run time.

...A simple BNF style language is used to describe scanner and parser in a UTF-8 source file. The output is described with a template language that is used to add formatting to the parse tree. Code is generated that automatically traverses the parse tree and calls a method on a transformer object to modify the parse tree. Each node is visited in document order, and a method is called at the beginning and end of each node visit. This transformer class is subclassed for customization. SimpleCompiler has many built-in feature for supporting a variety of text based language.

Decafcc is a simple just-in-time (JIT) compiler for small programming or data modeling language. The current Decaf project demonstrates how to parse simple C, and how to generate MIPS assemble code.