1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
use super::InternalTokenRewriterResult;
use crate::Token;
#[derive(Debug, PartialEq, Eq, Clone)]
#[repr(C)]
pub enum RewriteAction {
Drop,
Keep,
}
impl RewriteAction {
pub(crate) fn is_drop(&self) -> bool {
matches!(self, Self::Drop)
}
pub(crate) fn is_keep(&self) -> bool {
matches!(self, Self::Keep)
}
}
#[derive(Debug, PartialEq, Eq, Clone)]
#[repr(C)]
pub enum LexStateAction {
Set(i32),
Keep,
}
impl LexStateAction {
pub(crate) fn is_set(&self) -> bool {
matches!(self, Self::Set(_))
}
pub(crate) fn is_keep(&self) -> bool {
matches!(self, Self::Keep)
}
pub(crate) fn next_state(&self) -> i32 {
match self {
Self::Set(state) => *state,
Self::Keep => panic!("Wrong variant of LexStateAction"),
}
}
}
#[derive(Debug, PartialEq, Eq, Clone)]
#[repr(C)]
pub struct TokenRewriterResult {
pub rewritten_token: Box<Token>,
pub token_action: RewriteAction,
pub lex_state_action: LexStateAction,
}
impl TokenRewriterResult {
pub(crate) fn into_internal(self) -> InternalTokenRewriterResult {
let Self {
rewritten_token,
token_action,
lex_state_action,
} = self;
InternalTokenRewriterResult {
rewritten_token,
token_action,
lex_state_action,
}
}
}
pub type TokenRewriterFn = dyn Fn(Box<Token>, &[u8]) -> TokenRewriterResult;
pub struct TokenRewriter {
f: Box<TokenRewriterFn>,
}
impl TokenRewriter {
pub fn new(f: Box<TokenRewriterFn>) -> Self {
Self { f }
}
pub(crate) fn call(&mut self, token: Box<Token>, input: &[u8]) -> TokenRewriterResult {
let f = &*self.f;
f(token, input)
}
}