Olifante *'s Library tagged parser →  View Popular

Grammatica is a C# and Java parser generator (compiler compiler). It improves upon simlar tools (like yacc and ANTLR) by creating well-commented and readable source code, by having automatic error recovery and detailed error messages, and by support for testing and debugging grammars without generating source code.

grammatica.percederberg.net - Preview

grammatica antlr parser generator grammar

"Create parsers, lexers and tree parsers in a highly integrated development environment"

placidsystems.com/antlrstudio.aspx - Preview

antlr IDE debugger lexer parser diagrams

"The DLR contains a general-purpose system of expression trees ... Once you construct a DLR expression tree ... it handles all the work of rendering your code to IL and just-in-time compiling it.... once you build an abstract syntax tree, you're done."

listeningtoreason.blogspot.com/...kes-building-new-language.html - Preview

compiler parser parsing dlr CLR .net ironpython parsec bytecode lexing ast

www.antlr.org/...CS652+Home - Preview

antlr class compilers course computer-science lexing parser parsing compiler

"I have taught an undergraduate compilers course for over a decade. In the last several years, I have used my own textbook "Basics of Compiler Design". I have now decided to make this available online."

www.diku.dk/...Basics - Preview

compilers textbook basics introduction ebook course computer_science cs parser parsing grammar

"Happy is a parser generator system for Haskell, similar to the tool `yacc' for C. Like `yacc', it takes a file containing an annotated BNF specification of a grammar and produces a Haskell module containing a parser for the grammar."

www.haskell.org/happy - Preview

happy yacc parser parser_generator haskell BNF programming parsing library grammar

"WWW::Mechanize and Hpricot on Steroids [...]: scRUBYt! is a simple to learn and use, yet powerful web scraping toolkit written in Ruby. The idea behind making scRUBYt! was to show a few simple concepts of Web extraction"

scrubyt.org - Preview

ruby scRUBYt scraping web2.0 parser extraction feeds rss library patterns

"The approach [...] is to have QuickCheck randomly generate an instance of the Abstract Syntax Tree I’ve developed. I’ll develop a pretty printer that can convert this to a String. Parsing the String should then result in the originally generated AST.

lstephen.wordpress.com/...parser-testing-with-quickcheck - Preview

parsec parser testing QuickCheck smalltalk haskell programming

"The point of all this is to show just how much power and convenience Haskell and Parsec give you for free. What once was a tedious job requiring careful derivation and refactoring is now easy"

blog.moertel.com/...arsing-with-haskell-and-parsec - Preview

haskell parsec parser arithmetic expressions programming grammar BNF

"In most languages I’m familiar with, this would have granted the author instant Yacc-demigod status. With Erlang… it was less than 40 LOC. Hardly something you’d wear at a party."

hyperstruct.net/...-erlang-with-parse_transform-2 - Preview

erlang xml parser inline inline_xml parse_transform_2

"In the Haskell world, a close approximation to ANTLR is available in the form of Parsec, a library for building parsers using combinators."

www.serpentine.com/...-parsec-for-parsing-in-haskell - Preview

haskell antlr lex yacc parser parsec

"Construct is a python module for defining arbitrary data structures. Once a data structure (aka, 'construct') is defined, it can be used to both parse raw data into an object and build an object into raw data. Unlike most parsers, it works at the bit-lev

pyconstruct.sourceforge.net/ - Preview

python construct struct data_structures binary parser