Tags : Browse Projects

Select a tag to browse associated projects and drill deeper into the tag cloud.

Irony — .NET Language Implementation Kit

Compare

  Analyzed 6 months 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 ... [More] in c# using operator overloading to express grammar constructs. Irony's scanner and parser modules use the grammar encoded as c# class to control the parsing process. See the expression grammar sample for an example of grammar definition in c# class, and using it in a working parser. [Less]

31.2K lines of code

0 current contributors

over 3 years since last commit

4 users on Open Hub

Activity Not Available
5.0
 
I Use This

csharpcc

Compare

  Analyzed over 2 years ago

A LALR C# parser generator written in Java language. The aim of the project is to provide developers with a useful tool for the generation of parsers for given EBNF-like syntaxes, which can be consumed by .NET/Mono applications. Some of the features of the resulted parsers are: Standalone: the ... [More] applications won't be forced to reference external libraries to make the parsers generated to work Speed: Small footprint: A typical use of CSharpCC is the generation of an SQL-92 parser (such as the one in DeveelDB). NOTE: this project has been discontinued. If you're interested in continuing supporting it, please contact db at deveel dot com. CShapCC is a modified version of JavaCC 3.2 [Less]

38.1K lines of code

0 current contributors

over 6 years since last commit

1 users on Open Hub

Activity Not Available
4.0
   
I Use This

Sweet Parser

Compare

  Analyzed about 2 months 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 ... [More] executable that provides Lua scriptable code generation from the parser state machine. Parsers generated this way have no dependencies on anything other than the standard libary. [Less]

7.83K lines of code

1 current contributors

4 months since last commit

1 users on Open Hub

Activity Not Available
0.0
 
I Use This

racc

Compare

  Analyzed 10 months 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.

65.2K lines of code

8 current contributors

11 months since last commit

1 users on Open Hub

Activity Not Available
4.0
   
I Use This

BNFC

Compare

  Analyzed 17 days 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 ... [More] implementation * a case skeleton for the abstract syntax in the same language * an Alex, JLex, or Flex lexer generator file * a Happy, CUP, or Bison parser generator file * a pretty-printer as a Haskell/Java/C++/C module * a Latex file containing a readable specification of the language [Less]

77.7K lines of code

4 current contributors

4 months since last commit

1 users on Open Hub

Low Activity
0.0
 
I Use This

hammer-parsing

Compare

  Analyzed 5 months 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 ... [More] parsing binary data such as images, network packets, audio, and executables. [Less]

114K lines of code

9 current contributors

7 months since last commit

1 users on Open Hub

Activity Not Available
0.0
 
I Use This

ayacc

Compare

  Analyzed 5 months 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.

9.92K lines of code

0 current contributors

about 2 years since last commit

1 users on Open Hub

Activity Not Available
0.0
 
I Use This
Licenses: No declared licenses

frown

Compare

  No analysis available

Frown is an LALR(k) parser generator for Haskell 98 written in Haskell 98. Its main features: * Time and space efficient * The parsers are purely functional, table-free parsers, with states encoded via mutually recursive functions

0 lines of code

0 current contributors

0 since last commit

0 users on Open Hub

Activity Not Available
0.0
 
I Use This
Mostly written in language not available
Licenses: No declared licenses

patoja

Compare

  Analyzed over 2 years ago

Parsing tools for Java. Syntax and lexicon analysis. Connector with SableCC langage format definition.

23.6K lines of code

0 current contributors

over 6 years since last commit

0 users on Open Hub

Activity Not Available
0.0
 
I Use This

cookcc

Compare

  Analyzed 11 months ago

CookCC is a lexer and parser (LALR (1)) generator project, combined. It is written in Java, but the target languages can vary. CookCC comes with two unique features, which were the original motivations for this work. CookCC uses a unique approach of storing and loading DFA tables in Java that ... [More] significantly reduces the starting up time. Many efforts have been made to maximize the generated Java lexer and parser performances, painstakingly line-by-line, case-by-case fine turning the lexer and parser code. I believe that CookCC is the fastest lexer for Java (see the performance test). CookCC allows lexer/parser patterns and rules to be specified using Java annotation. This feature greatly simplifies and eases the writing of lexer and parser for Java. Additionally, CookCC can produce highly compressed DFA tables. CookCC requires JRE 1.5+ to run, but the generated Java code can be compiled and run with earlier versions of Java. The current release is 0.3.3. I am currently working on the island grammar on interfaces feature of 0.4, which is taking much longer than I anticipated. Note: the BSD license only applies to CookCC itself. The code generated belongs to you. Road Map for 0.5add re2c-like direct code generation option for Lexer rather than only using table lookup (as of now). Possible mixed mode of execution to reduce table size (and code size), by reducing the number of states to be stored and possibly fewer equivalent classes. Performance gain for Java is questionable but I have thought out the way doing it. C and C++ code generation. More of the long term because right now I do not have need to do so. The performance of flex for C is extremely difficult to beat anyways. What's New0.4 (Upcoming Release)added -extend option to set the parent class of the generated class updated debugLexer, debugLexerBackup, debugParser signature so that it is actually meaningful overload these debugging functions.  Issue 20 : allowed the start symbol to be specified in Java annotation input (by default it was the LHS of the first @Rule). Issue 19: allowed grammar on Java interfaces.  Issue 18 : added -generics option to generate Java code that use generics.  Issue 17 : added optional / optional list / list grammar shortcuts. Possible tree generator (grammar on Java annotations only) 0.3.3allowed the internal buffer to be automatically increased for long matches.  Issue 14 : added yyPushInput, yyPopInput, yyInputStackSize, yyWrap functions (and yywrap option).  Issue 13 : turn on backup lex state warning only when requested.  Issue 12 : added setBOL function to set the next token to be at BOL.  Issue 11 : yacc output does not have %start.  Issue 10 : yacc output fails on empty TokensDoc. 0.3.2added yacc grammar input and output. added yyPushLexerState and yyPopLexerState functions. added line number information for the error messages for Java input. added "parserprolog" section for the generated Java code.  Issue 9 : unable to handle '\'' terminals in the grammar.  Issue 8 : incorrect lalr item lookahead calculation. Now tested against bison using several major language grammars.  Issue 7 : disable APT compile for the CookCC Ant task to prevent class files from generated.  Issue 6 : erroneous warning of unreachable pattern when a lex pattern is shared among multiple lex states.  Issue 5 : tag state attribute did not work. 0.3.1added single quoted literal string as lex patterns. 0.3added input using Java annotation.  Issue 2 : multiple incomplete state can cause internal lex error due to reassignment of the internal pattern case values.  Issue 1 : incorrectly generated parser if start non-terminal is not specified 0.2added parser generator. 0.1initial release. Only includes lexer generator. [Less]

18.2K lines of code

1 current contributors

almost 2 years since last commit

0 users on Open Hub

Activity Not Available
0.0
 
I Use This