Showing 6 open source projects for "bnf"

View related business solutions
  • $300 Free Credits to Build on Google Cloud Icon
    $300 Free Credits to Build on Google Cloud

    New customers can spin up VMs, build with AI, and query data at no cost.

    Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
    Start Free
  • Ship Agents Faster Icon
    Ship Agents Faster

    Transform your applications and workflows into powerful agentic systems at global scale.

    Gemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
    Get Started Free
  • 1
    XBNF Neurotranslator compiler

    XBNF Neurotranslator compiler

    (X)BNF simple and clever translation grammar compiler

    XBNF Neurotranslator is a powerfull extended BNF grammar language to handle translations easily and many features to handle different kind of situations. This project is for common arch binaries, C++ sources, tests & support tickets. No installation, juste get binary for your architecture : > See [Files] > binary.{version} Library of smart samples of grammars> https://sourceforge.net/projects/xbnf/ Docker image which embeds the Linux/64bits binary and the library. ...
    Downloads: 3 This Week
    Last Update:
    See Project
  • 2
    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3

    Kayacc

    A Compiler Development Toolkit

    ...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, and translating between Unicode and byte oriented encodings. Tombo is an alternative for lex, yacc and Bison tools. Source can be browsed in git/code repository or src directory. ...
    Downloads: 2 This Week
    Last Update:
    See Project
  • 4
    The LALR parser generator (LPG) is a tool for developing scanners and parsers written in Java, C++ or C. Input is specified by BNF rules. LPG supports backtracking (to resolve ambiguity), automatic AST generation and grammar inheritance.
    Downloads: 1 This Week
    Last Update:
    See Project
  • Save Up to 91% on Cloud Compute With Spot VMs Icon
    Save Up to 91% on Cloud Compute With Spot VMs

    Automatic sustained-use discounts. One free VM per month. No negotiation needed.

    Run batch jobs at 60-91% off with Spot VMs. Long-running workloads get automatic discounts with sustained use.
    Try Free
  • 5
    Generate parsers with ease, using a graphical user interface, or console. Design your parsers graphically or by using standard regular expressions and BNF syntax similar to lex/yacc. Generated parsers can be in C or C++.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 6

    SimpleCompiler

    Tools for creating code generators.

    SimpleCompiler is a suite of tools for generating compilers and code generators. 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. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next