Module

lexers.stan_sm

Hand-written Stan lexer using state machine approach.

O(n) guaranteed, zero regex, thread-safe. Stan is a probabilistic programming language.

1Class

Classes

StanStateMachineLexer 1 ▼
Stan lexer.

Stan lexer.

Methods

tokenize 4 Iterator[Token] ▼
def tokenize(self, code: str, config: LexerConfig | None = None, *, start: int = 0, end: int | None = None) -> Iterator[Token]
Parameters
Name Type Description
code —
config — Default:None
start — Default:0
end — Default:None
Returns
Iterator[Token]