Index

Symbols | A | B | C | D | E | F | G | H | I | L | M | N | O | P | Q | R | S | T | U | V | W | Z | Symbols

Symbols

&, [1]
**, [1]
*args
...
/
>, [1]
>=
>>
[], [1], [2]
^, [1]

A

A Token was specified with a matcher but
ABC
abstract syntax tree
Add()
ambiguity, [1]
ambiguous grammars
And(), [1]
Any()
AnyBut()
Apply(), [1]
ApplyArgs
args()
AST, [1]
auto_memoize(), [1], [2]

B

backtracking, [1], [2]
BaseMatcher, [1]
binding
BLine()
Block()
block_policy
block_start
breadth-first

C

Cannot add ... to collection
Cannot test for ... in collection
columns
Columns()
Commit(), [1]
compose_transforms(), [1]
configuration, [1]
Configuration(), [1]
context_memoize(), [1]
ContinuedBLineFactory()
ContinuedLineFactory()
contributions
cut

D

debug
debugging
default configuration
Delayed(), [1], [2]
depth-first
DfaRegexp()
Digit()
Drop(), [1], [2], [3]

E

efficiency, [1]
Empty()
Eof()
EOL()
Eol()
Eos()
Error(), [1]
errors, [1]
example
examples
execution trace

F

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

G

generator
generators, [1]
GeneratorWrapper
graph
graphs
Guy Cousineau

H

Hafiz
hash

I

Identity()
implementation, [1]
import
Indent()
Integer(), [1]
iterators

L

left-recursion, [1], [2]
Letter()
lexer
Lexer rewriter used but no tokens found
lexer_rewriter(), [1]
LGPL
licence
LineAwareConfiguration()
list
Literal(), [1]
LMemo()
LocationStream()
log
logging, [1]
longest match
Lookahead()
Lower()

M

make_dict()
make_error()
Map()
match()
Matcher
matchers, [1]
memoisation, [1]
memoize(), [1]
Michel Mauny

N

Name()
nested lists
Newline()
NfaRegexp()
No handlers could be found for logger
node attributes
Node(), [1], [2], [3]
nodes
Norvig

O

offside rule
OneOrMore()
operators, [1]
optimisation
optimize_or()
Optional()
Or(), [1]

P

parse tree
parse_string()
parser combinators
parsing
Pattern Matching in Python
patterns
Paul McGuire
Plus()
precedence
print_longest()
Printable()
prolog
Punctuation()
PyParsing
Python
Python version

Q

queue_len, [1]

R

recursion, [1], [2]
recursive descent
Regexp(), [1]
regexp_rewriter()
regular expressions
Repeat()
repetition, [1]
resources, [1]
results
rewriting, [1]
rightmost
RMemo()

S

s-expressions
Sam Wilmott
search
Separator(), [1], [2]
SignedEFloat()
SignedFloat(), [1]
SignedInteger()
SimpleStream()
SmartSeparator1()
SmartSeparator2()
SOL()
Space(), [1]
stack
stack traces
Star(), [1]
StreamFactory()
streams
String().
Substitute()
SyntaxError
SyntaxError()

T

tables
tabular data
throw()
Tim Peters
timing
Token(), [1]
tokens, [1]
Trace(), [1]
trampolining, [1]
trees
tutorial

U

UnsignedFloat()
UnsignedInteger()
unsupported operand type
Upper()

V

visitors

W

whitespace sensitive parsing
Whitespace()
Word(), [1]

Z

ZeroOrMore()

Symbols

|
~, [1], [2], [3]