Weekly Edition
Return to the Development page
| |||||||||||||
|
| |||||||||||||
Building Recursive Descent Parsers with Python (O'ReillyNet)
O'ReillyNet looks
at the Python class library, Pyparsing. "Pyparsing provides a
basic framework for creating recursive-descent parsers, taking care of the
overhead functions of scanning the input string, handling expression
mismatches, selecting the longest of matching alternatives, invoking
callback functions, and returning the parsed results. This leaves
developers free to focus on their grammar design and the design and
implementation of corresponding token processing. Pyparsing's nature as a
combinator allows developers to scale their applications from simple
tokenizers up to complex grammar processors. It is a great way to get
started with your next parsing project!"
(Log in to post comments)
|
|
||||||||||||