Select a tag to browse associated projects and drill deeper into the tag cloud.
Irony — .NET Language Implementation Kit
I
Analyzed 38 minutes ago
Irony is a development kit for implementing languages on .NET platform. Unlike most existing yacc/lex-style solutions Irony does not employ any scanner or parser code generation from grammar specifications written in a specialized meta-language. In Irony the target language grammar is coded directly
BNFC
Analyzed about 10 hours ago
The BNF Converter is a compiler construction tool generating a compiler front-end from a Labelled BNF grammar. It is currently able to generate C, C++, C#, F#, Haskell, Java, and OCaml, as well as XML representations.
Given a Labelled BNF grammar the tool produces:
* an abstract syntax
Licenses:
BSD-3-Clause
racc
R
Analyzed about 4 hours ago
Racc (Ruby yACC) is a LALR(1) parser generator.
It is written in Ruby itself, and generates Ruby programs.
Ruby 1.8.x comes with Racc runtime module. You can run your parsers generated by racc 1.4.x out of the box.
ayacc
A
Analyzed about 3 hours ago
Ayacc provides Ada programmers with a convenient tool for the automatic construction of parsers from a high level description of a context free grammar.
Licenses:
No declared licenses
Sweet Parser
Analyzed about 6 hours ago
Sweet Parser is a C++ parser library.
Given a BNF grammar the library generates an LALR(1) parser that recognizes the language described by that grammar. The parser can be generated at runtime without the need for an offline generation step. If generation is required there is a stand alone
Licenses:
zlib_libpng
hammer-parsing
H
Analyzed about 13 hours ago
Hammer is a parsing library. Like many modern parsing libraries, it provides a parser combinator interface for writing grammars as inline domain-specific languages, but Hammer also provides a variety of parsing backends. It's also bit-oriented rather than character-oriented, making it ideal for
lalr-scm
L
Analyzed 1 day ago
DescriptionLalr-scm is yet another LALR(1) parser generator written in Scheme. In contrast to other such parser generators, this one implements an efficient algorithm for computing the lookahead sets. The algorithm is the same as used in Bison (GNU yacc) and is described in the following paper:
fucc-lisp
F
No analysis available
Parser generator for Common Lisp.
Mostly written in language not available
Licenses:
mit