stargaming's Bookmarks About "parsing"

Home / people / stargaming / links / "parsing"

stargaming, member since Aug 13, 2006

5376 Visible Links (5376 total), 1 Public Groups, 20+ Top Tags

Search Everyone: "parsing",

Top "parsing" experts: jprieto, otis, leonidas, sebastien, ahy1, ddelmoli,

Show 50 · 100 · all

1 - 10 of 39 next »

Watch stargaming

LEPL - A Parser Library for Python 3 (and 2.6) — LEPL v3.3b1 documentation

LEPL combines the simplicity and ease–of–use of a recursive descent parser with scalability (through memoisation) and advanced (but optional) features like lexing, AST generation, offside–rule, robustness to ambiguous and left–recursive grammars, etc.

by stargaming 2009-09-20 16:36 python · parsing

http://www.acooke.org/lepl/ - cached - mail it - history

Fernando Meyer Writing a domain specific language DSL with python

With python we can easily create a piece of software that expresses some basic desired behavior, like rspec does, but much more pythonic.

by stargaming 2009-09-08 12:28 python · parsing

http://blog.fmeyer.org/entry/writing_a_domain_specific_language_dsl_with_python - cached - mail it - history

construct » home

Construct is a python library for parsing and building of data structures (binary or textual). It is based on the concept of defining data structures in a declarative manner, rather than procedural code: more complex constructs are composed of a hierarchy of simpler ones. It's the first library that makes parsing fun, instead of the usual headache it is today.

by stargaming 2009-08-07 10:10 python · parsing

http://construct.wikispaces.com/ - cached - mail it - history

Perl Cannot Be Parsed: A Formal Proof

In the man page for PPI, Adam Kennedy conjectures that perl is unparseable, and suggests how to prove it. Below I carry out a rigorous version of the proof, which should put the matter beyond doubt.

by stargaming 2009-06-13 18:09 perl · parsing

http://www.perlmonks.org/?node_id=663393 - cached - mail it - history

On the sad state of markdown processors, and getting thousandfold speed-ups.

I took the first Markdown implementation that came to mind, Bluecloth (written in Ruby) and ran it against a few documents. I was most underwhelmed by its speed. It was so slow it'd need over one or two seconds to process some of the entries I've written since.

by stargaming 2009-04-11 03:32 parsing

http://eigenclass.org/R2/writings/fast-extensible-simplified-markdown-in-ocaml - cached - mail it - history

LL vs. LR vs. GLR

There are traditionally two ways to interpret grammars: LL and LR. In both cases the first “L” means that the grammars read left-to-right. The second character indicates how the grammar is interpreted: “L” for left-to-right and “R” for right-to-left.

by stargaming 2009-03-21 08:43 parsing

http://panopticoncentral.net/archive/2009/03/13/24813.aspx - cached - mail it - history

Sexy Lexing with Python | Evan Fosmark

In the re module there is a class called Scanner that can do lexical sanning. It is completely undocumented other than for a small example code block found on the Python-Dev mailing list, but well worth mentioning.

by stargaming 2009-02-26 00:33 python · idiom · parsing

http://www.evanfosmark.com/2009/02/sexy-lexing-with-python/ - cached - mail it - history

Eli Bendersky’s website » Blog Archive » Abstract vs. Concrete Syntax Trees

Concrete Syntax Trees Abstract Syntax Trees are two terms that come up a lot in compiler & parser nomenclature. However, it is not always understood what is the difference between the two, because they are closely related. In this article I attempt to explain the difference, at least for myself.

by stargaming 2009-02-17 14:14 parsing · compiler

http://eli.thegreenplace.net/2009/02/16/abstract-vs-concrete-syntax-trees/ - cached - mail it - history

OMeta: an Object-Oriented Language for Pattern Matching

OMeta is a new object-oriented language for pattern matching. It is based on a variant of Parsing Expression Grammars (PEGs) which we have extended to handle arbitrary data types. OMeta's general-purpose pattern matching facilities provide a natural and convenient way for programmers to implement tokenizers, parsers, visitors, and tree transformers, all of which can be extended in interesting ways using familiar object-oriented mechanisms.

by stargaming 2008-10-22 07:47 languages · parsing

http://www.cs.ucla.edu/~awarth/ometa/ - cached - mail it - history

Eli Bendersky’s website » Blog Archive » On parsing the C standard library headers

To parse C code, one inevitably has to deal with the runtime C library (libc). Each compiler comes with one, configured for its own special needs. The problem is, when you’re just writing a general parser for the language, which library to use ?

by stargaming 2008-10-10 13:47 c · parsing

http://eli.thegreenplace.net/2008/10/10/on-parsing-the-c-standard-library-headers/ - cached - mail it - history

1 - 10 of 39 next »

Related Tags

- exclude ~ optional + require

-- ~ + 39 parsing

-- ~ + 22 python

-- ~ + 2 compiler

-- ~ + 2 html

-- ~ + 1 .net

-- ~ + 1 ai

-- ~ + 1 books

-- ~ + 1 database

-- ~ + 1 idiom

-- ~ + 1 javascript

-- ~ + 1 languages

-- ~ + 1 linguistics

-- ~ + 1 perl

-- ~ + 1 py3k

-- ~ + 1 ruby

-- ~ + 1 text

Add Dates

Sep 30, 2009

Sep 28, 2009

Sep 25, 2009

Sep 24, 2009

Sep 22, 2009

Sep 20, 2009

Sep 17, 2009