Tags : Browse Projects

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

Boo Programming Language

Compare

  No analysis available

A wrist-friendly language targeting the Common Language Runtime (.NET / Mono) with an extensible compiler pipeline, a syntax reminiscent of Python, and many other features (like type inference, syntactic macros, etc.)

0 lines of code

0 current contributors

0 since last commit

50 users on Open Hub

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

Sweble

Compare

  Analyzed over 1 year ago

The Sweble Wikitext Parser is a parser for the wiki markup (called Wikitext) used by the MediaWiki wiki engine. Of course, the MediaWiki software provides its own parser for wikitext, however, the parser only produces HTML output. The Sweble Wikitext Parser on the other hand generates a ... [More] machine-readable representation (AST - abstract syntax tree) of an article, thus unlocking the structured data within a wiki running the MediaWiki software. The parser is developed by the Open Source Research Group at the University Erlangen-Nürnberg. It was open-sourced on the 1st of May 2011. [Less]

120K lines of code

4 current contributors

about 2 years since last commit

5 users on Open Hub

Activity Not Available
5.0
 
I Use This
Licenses: Apache-2.0, AGPL 3.0+

JCCD

Compare

  Analyzed 4 months ago

The Java Code Clone Detection API (JCCD) allows to implement individual code clone detectors. These code clone detectors can be easily integrated into other Java applications. JCCD is based on a pipeline architecture which allows to replace whole parts of the detection process without changing ... [More] the overall pipeline. This enables to re-implement state-of-the-art techniques as well as to realize new ideas and concepts. [Less]

25.4K lines of code

0 current contributors

over 6 years since last commit

2 users on Open Hub

Activity Not Available
5.0
 
I Use This

differentia-javaica

Compare

  Analyzed about 1 year ago

The aim of this project is to compare two java source codes and check if they are equal. It is not a simple diff. It uses ANTLR to construct two Abstract Source Trees for java types and eventually compare these trees. As a consequence white spaces and comments will not affect comparison. Reordering ... [More] of elements in source code will be treated as difference though. This kind of comparison is especially helpful when writing unit tests for java source code generators. When we have expected source code it is possible to check if it equals to generated source code. [Less]

21K lines of code

0 current contributors

almost 8 years since last commit

1 users on Open Hub

Activity Not Available
0.0
 
I Use This

phc

Compare

  Analyzed about 1 year ago

A framework for static analysis of PHP scripts, PHP source to source transformations, and ultimately compiling PHP scripts down to native machine code.

209K lines of code

0 current contributors

almost 4 years since last commit

1 users on Open Hub

Activity Not Available
0.0
 
I Use This

nobjectiveast

Compare

  Analyzed about 1 year ago

AST builder for Objective-C++ language. Features: High-performance hand-crafted lexer About 5 times faster than NRefactory's C# lexer Easy to use parser Able to parse complex constructs like int (*(int*foo())() )() Able to parse Objective-C classes Easy to use AST tree Able to produce source from ... [More] AST Open Source, Free Software NOTE: Source files must be previously preprocessed Useful and bugfixing patches are welcomed! Sources currently resides in NObjective so you should checkout it from: svn checkout http://objcmapper.googlecode.com/svn/trunk/NObjectiveAST/ NObjectiveASTUsage// use lexer to produce lexems // than use parser to produce AST var translationUnit = new Parser( new Lexer( File.ReadAllText( "..\\..\\test.cpp" ) ) ).TranslationUnit; [Less]

12.3K lines of code

0 current contributors

over 7 years since last commit

1 users on Open Hub

Activity Not Available
0.0
 
I Use This

javaparser

Compare

  Analyzed about 1 year ago

A Java 1.5 Parser with AST generation and visitor support. The AST records the source code structure, javadoc and comments. It is also possible to change the AST nodes or create new ones to modify the source code. Main features light weight good performance easy to use AST can be modified AST ... [More] can be created from scratch This parser was created using javacc (the java compiler compiler). All the nodes of the AST, visitors and other features was coded manually using the Eclipse IDE. Help this project, Donate. Thanks. [Less]

22.4K lines of code

0 current contributors

about 3 years since last commit

1 users on Open Hub

Activity Not Available
0.0
 
I Use This

XL Programming Language

Compare

  Analyzed 11 months ago

XL (eXtensible Language) is a general purpose compiled programming language. XL doesn't force you to use a limited set of concepts (such as "objects"). Instead, it can be extended (through libraries) to use the concepts that are natural to your a

104K lines of code

0 current contributors

almost 2 years since last commit

1 users on Open Hub

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

tinyap

Compare

  Analyzed about 1 year ago

This is not yet another parser. Tinyap takes some text and an a grammar describing AST as inputs, and outputs another AST that describes the text contents, according to the provided grammar. Basically, tinyap is a recursive descent parser with backup. Thus, it's able to recognize any LL(k) ... [More] language. When a parse is successful, tinyap outputs an Abstract Syntax Tree (AST) that represents the input text in a structured manner. Unlike most parsers, its code isn't factory-calibrated for a particular grammar. Instead, the grammar is data. Tinyap uses an AST that represents a grammar to parse its input text. This grammar AST is structured according to tinyap's grammar description language. This parser is meant to allow quick and easy development of new languages and the corresponding interpreters or compilers, by defining a single tool and library to parse the source grammar as well as the source text according to the source grammar and walk the resulting ASTs. The factory default for the grammar AST is the grammar description language itself. So one can parse a grammar description and directly use the parse output to parse some other text written in the described language. Tinyap also features a plugin mechanism for grammars, which allows for dynamic modular grammars. The ASTs tinyap produces can be serialized to and deserialized from buffers and files. Finally, tinyap provides an interface to walk down the ASTs and makes it easy to write external plugins to visit the nodes, e.g. a compiler, an interpreter, a static evaluator, a renderer... You can have a look at an extensive use of tinyap at http://code.google.com/p/tinyaml where tinyap is used to parse compile and extend a base meta-language. A tutorial is available here : http://beublo23.free.fr/doxygen/tinyap/Tutorial.html Until further request, C++ and Java API are more or less discontinued. Contact me at damien dot leroux at gmail dot com for feedback, suggestions, requests or to help improving the code. [Less]

42.3K lines of code

0 current contributors

about 6 years since last commit

1 users on Open Hub

Activity Not Available
0.0
 
I Use This

yardparser

Compare

  Analyzed about 1 year ago

Welcome to Yet Another Recursive Descent (YARD) parsing framework for C++. YARD is inspired by Boost.Spirit. YARD allows the specification of parsing expression grammars (PEG) using types and templates directly, instead of through operator overloading. The result is a very compact and efficient ... [More] parser generating library. YARD parsers automatically perform tokenization and construction of abstract syntax trees. [Less]

0 lines of code

0 current contributors

almost 10 years since last commit

1 users on Open Hub

Activity Not Available
5.0
 
I Use This
Mostly written in language not available
Licenses: MIT