Struct Lex 

pub struct Lex { /* private fields */ }

The lexer, plus the token buffer the rule machine peeks into.

Tokens are lexed lazily: Lex::peek produces only as many as the alt being tried needs, under the rule that is trying it. A token already in the buffer is NOT re-lexed when a later rule looks at it — that caching is what makes a comment right after { a node (read under declbody) while a comment between a property and its : is not (read under decl).

Implementations

impl Lex

pub fn new(src: &str, lowercase_properties: bool) -> Lex

A lexer over src.

pub fn peek(&mut self, n: usize, rule: &str) -> Result<&[Token], Error>

Ensure the buffer holds n tokens, lexing any shortfall under rule, and return them.

pub fn consume(&mut self, n: usize)

Drop the first n buffered tokens. Anything left stays cached.

pub fn point(&self) -> Point

The current scan position, for error reporting.