| Projects on Google Code | Results 1 - 10 of 103 |
The objective of the OSDT project is to develop novel methods for incremental statistical dependency parsing that improve the state-of-the-art, and to implement the methods in an open-source toolkit written in Java. The proposed system will be the first parsing system that uses error-guided repair ...
=Roger Alsing's code repository.=
----
==Contains the following projects:==
http://www.puzzleframework.com/GoogleCode/SyntaxBox/syntaxboxlogo.jpg
==SyntaxBox==
Powerful Syntax Highlight Windows Forms Control for the Microsoft.NET Platform.
Written in 100% managed C#.
Supports syntax highl...
The goal of the C++ Ripper project is to create a simple and reusable parsing framework specialized for C and C++ code. The C++ Ripper parser is a recursive descent parser, which uses operator overloading to allow the expression of grammars using a notation similar to PEGs.
I am developing C++ Ri...
parsing,
parser,
C,
C,
cpp,
csharp,
recursivedescentparser,
rdparser,
PEG,
grammar,
parsingexpressiongrammar
C# Parsing Library 是一个LL解析器产生框架，可以在C#中模拟ENBF文法定义。它的设计思路来自于Boost.Spirit，一个C++解析器框架。
Assignment #2 for CS160
This is a library of Prolog files for parsing Multiple Context-Free Grammars.
*Note 1*: This is a programming library! Good knowledge of Prolog, *and* of Multiple Context-Free Grammars, is required to be able to use it.
*Note 2*: The library only works for Sicstus Prolog 3. Someday I might por...
An extremely simple (70 lines of Python code) tool, to produce summary
of killed monsters and gained loot. Primary intended to help with Tibia Wiki monsters loot statistics
*Current features:*
* it's proven to be easy
*Planed features:*
* loot statistics (working) with extended statisti...
This is a library of Haskell files associated with my licenciate thesis from 2002. The library consists of the following:
* implementations of different parser combinators (chapters 3–4 and 8)
* implementations of different context-free parsing algorithms (chapters 5–7)
*Note 1*: This is...
The goal of this project is to develop an intelligent algorithm for splitting full names into the following parts:
* Salutation
* First Name
* Initials
* Last Name
* Suffix
This project also attempts to fix some common formatting issues like capitalization.
Initial information abou...
Current version: *0.3.4*, 2009-10-06
== Description ==
_Parser combinators_ are just higher-order functions that take parsers as their arguments and return them as result values. Parser combinators are:
* First-class values
* Extremely composable
* Tend to make the code quite compac...