My favorites | Sign in
Google
Projects on Google Code Results 1 - 10 of 32
CookCC is a lexer and parser (LALR (1)) generator project, combined. It is written in Java, but the [TargetLanguages 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 DF...
This project implements a simple script interpreter in Java. Its purpose is to provide a simple code base that is easy to understand and be used for learning basic techniques in writing an interpreter. The project contains the following: * Hand written Lexer * Parser that process tokens fro...
lexer interpreter parser compiler
Dies ist die Projektseite unseres Teams für das Labor "Systemnahes Programmieren" an der HS Karlsruhe im WS 2009/2010. = WICHTIG: Dies ist nicht die offizielle Seite des Labors! Zur offiziellen Seite kommt ihr wenn ihr euch die Links anschaut = Es gibt mehrere Aufgabenblätter. == Aufgabenbl...
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...
Plex is a library building lexical analysers. Plex is a Python module for constructing lexical analysers, or scanners. Plex scanners have almost all the capabilities of the scanners generated by GNU Flex, and are specified in a very similar way. Tokens are defined by regular expressions, and ea...
A simple lexer/tokenizer for MIPS, written in C, for UW's CS 241. Intended as a higher quality substitute for the original MIPS C lexer. ---- *Highlighted*: [http://code.google.com/p/cmipslexer/source/browse/trunk/asm.c] *Plain Text*: [http://cmipslexer.googlecode.com/svn/trunk/asm.c] ...
The traditional approach to converting structured text files to XML is to write a parser using lex/yacc. However, in context-rich grammars this is highly inconvenient and tedious, and often requires huge amount of duplication between the lexer and the parser, at the same time leading to poor perform...
cl-lex is a set of Common Lisp macros for generating lexical analyzers automatically. Registers (including named registers) can be accessed by number or name in token generation code. The [http://weitz.de/cl-ppcre/ cl-ppcre regex library] is used for implementing regular expressions. Lexers gener...
=News= * *09 Sep 2008*: New source tarball and Windows pre-compiled executables. Checked with valgrind for memory leak. Tests are still to be fixed! * *25 Aug 2008*: Back to the NFA approach! Also, now every modifier is greedy. The expressions like "`.+z`" or "`\d+3`" will never succeed as t...
1 2 3 4 Next