Index

Symbols

% &, [1], [2], [3] **, [1], [2] + ... .config /, [1] // >, [1], [2] >=, [1] >>, [1]

@function_matcher @function_matcher_factory @sequence_matcher @sequence_matcher_factory @trampoline_matcher @trampoline_matcher_factory [], [1], [2], [3] ^, [1], [2] |, [1] ~, [1], [2], [3], [4]

A

ABC abstract syntax tree, [1] Add() add_monitor() add_rewriter() add_stream_kargs() alphabet() ambiguity, [1] ambiguous grammars

And(), [1], [2] Any() AnyBut() applications Apply(), [1] args(), [1] AST, [1] auto_memoize(), [1]

B

backtracking, [1], [2] BaseMatcher binding

BLine() Block(), [1] breadth-first

C

cache_level() clear() columns Columns() common errors compile_to_dfa() compile_to_nfa()

compile_to_re() compose_transforms() configuration, [1] Configuration() context_memoize() ContinuedLineFactory() contributions

D

debug debugging default() Delayed(), [1], [2] depth-first DfaRegexp()

Difference() Digit() direct_eval(), [1] DISCONTINUED Drop(), [1], [2], [3] DroppedSpace()

E

efficiency Email() (in module lepl.apps.rfc3696) Empty() Eof() EOL Eos()

Error(), [1] errors, [1] example examples execution trace Extend()

F

failure First(), [1] flatten() flattening Float(), [1] format_exc

Frost full_first_match() function_matcher function_matcher_factory futile despair

G

generator generators, [1] GeneratorWrapper

get_parse() graph Guy Cousineau

H

Hafiz

HttpUrl() (in module lepl.apps.rfc3696)

I

Identity() implementation, [1]

import Integer(), [1], [2]

J

JSON

L

left-recursion, [1], [2] left_memoize() lepl.apps.rfc3696 (module) Letter() lexer Lexer rewriter used but no tokens found lexer() lexer_rewriter() LGPL licence Limit() Line(), [1] LineEnd() lines(), [1]

LineStart() list List(), [1], [2], [3] lists Literal(), [1] LMemo() LocationStream() log logging, [1] longest match Lookahead() low_memory(), [1] Lower()

M

MailToUrl() (in module lepl.apps.rfc3696) make_dict() make_error() Map() match() Matcher

matchers, [1] memoisation, [1] memoize() Michel Mauny MPL

N

Name() nested lists Newline() NfaRegexp() No handlers could be found for logger no_compile_to_regexp() no_compose_transforms() no_direct_eval(), [1] no_flatten()

no_full_first_match(), [1] no_memoize() no_optimize_or() no_set_arguments() Node(), [1] node_throw() nodes Norvig

O

offside rule, [1] OneOrMore() OperatorMatcher operators, [1] optimisation

optimize_or() Optional() Or(), [1] Override()

P

parse() parse_all() parser combinators parsing Pattern Matching in Python patterns Paul McGuire

Plus() precedence print_longest() Printable() Punctuation() PyParsing Python version

R

Real(), [1] recursion, [1], [2] recursive descent Regexp(), [1] regular expressions remove_all_monitors() remove_all_rewriters() remove_all_stream_kargs() remove_rewriter()

Repeat() repetition, [1] resources results rewriting RFC 3696 right_memoize() RMemo()

S

s-expressions Sam Wilmott search Separator(), [1], [2] sequence_matcher sequence_matcher_factory set_alphabet_arg() set_arguments() set_block_policy_arg() sexpr_throw() SignedEFloat() SignedFloat() SignedInteger() SimpleStream() SmartSeparator1()

SmartSeparator2() SOL Space(), [1] stack stack traces Star(), [1] stream_factory() StreamFactory() streams String(). Substitute() syntax tree SyntaxError SyntaxError()

T

tables tabular data Tim Peters Token(), [1] tokens, [1] Trace(), [1] trace_stack()

TraceVariable trampoline_matcher trampoline_matcher_factory trampolining, [1] tree tutorial

U

UnsignedFloat() UnsignedInteger()

unsupported operand type Upper()

V

variable traces

W

whitespace sensitive parsing, [1] Whitespace()

Word(), [1], [2]

Z

ZeroOrMore()