Package lepl :: Package lexer :: Module rewriters
[hide private]
[frames] | no frames]

Module rewriters

source code

Rewrite a matcher graph to include lexing.
Classes [hide private]
  AddLexer
This is required when using Tokens.
Functions [hide private]
 
find_tokens(matcher)
Returns a set of Tokens.
source code
 
assert_not_token(node, visited)
Assert that neither this nor any child node is a Token.
source code
Function Details [hide private]

find_tokens(matcher)

source code 

Returns a set of Tokens. Also asserts that children of tokens are not themselves Tokens.

Should we also check that a Token occurs somewhere on every path to a leaf node?