4 releases
0.5.0 | Mar 30, 2020 |
---|---|
0.4.2 | Mar 30, 2020 |
0.3.0 |
|
0.2.0 |
|
0.1.3 |
|
#2572 in Rust patterns
11KB
148 lines
generic-lexer
A generic lexer in Rust using a simple match function or closure
use generic_lexer::{Lexer, BufferedInput, MatchError};
#[derive(Debug)]
enum TokenKind {
Int, Float,
Name,
Plus, Minus, Star, Slash, Semicolon, Equals,
}
fn lex_int(input: &mut BufferedInput) -> TokenKind {
input.accept_while(char::is_ascii_digit);
if let Some(_) = input.accept_if(|c| *c == '.') {
return lex_float(input);
}
TokenKind::Int
}
fn lex_float(input: &mut BufferedInput) -> TokenKind {
input.accept_while(char::is_ascii_digit);
TokenKind::Float
}
fn lex_name(input: &mut BufferedInput) -> TokenKind {
input.accept_while(|c| *c == '_' || c.is_ascii_alphabetic());
TokenKind::Name
}
fn lex(first_char: char, input: &mut BufferedInput) -> Result<TokenKind, MatchError> {
let kind = match first_char {
'+' => TokenKind::Plus,
'-' => TokenKind::Minus,
'*' => TokenKind::Star,
'/' => TokenKind::Slash,
';' => TokenKind::Semicolon,
'=' => TokenKind::Equals,
c if c.is_ascii_digit() => lex_int(input),
c if c.is_ascii_alphabetic() => lex_name(input),
c => return Err(MatchError::Unexpected(c))
};
Ok(kind)
}
fn main() -> Result<(), Box<dyn std::error::Error>> {
let input = "a = 420 + 69 * 3.14;";
let lexer = Lexer::new(&input, &lex, true);
let tokens = lexer.collect::<Result<Vec<_>, _>>()?;
println!("{:#?}", tokens);
Ok(())
}
[
Token {
kind: Name,
text: "a",
},
Token {
kind: Equals,
text: "=",
},
Token {
kind: Int,
text: "420",
},
Token {
kind: Plus,
text: "+",
},
Token {
kind: Int,
text: "69",
},
Token {
kind: Star,
text: "*",
},
Token {
kind: Float,
text: "3.14",
},
Token {
kind: Semicolon,
text: ";",
},
]