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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
//! Tokens.
/// What we expected to get, but did not get.
#[derive(Debug, PartialEq, Eq)]
pub enum Expect {
/// ` ` or `]` or `,`
Value,
/// `[` or `{`
ValueOrEnd,
/// `[1` or `[1 2`
CommaOrEnd,
/// `{0: 1}`
String,
/// `{"a" 1}`
Colon,
/// `true false` (when parsing exactly one value)
Eof,
}
impl core::fmt::Display for Expect {
fn fmt(&self, f: &mut core::fmt::Formatter) -> core::fmt::Result {
use Expect::*;
match self {
Value => "value".fmt(f),
ValueOrEnd => "value or end of sequence".fmt(f),
CommaOrEnd => "comma or end of sequence".fmt(f),
String => "string".fmt(f),
Colon => "colon".fmt(f),
Eof => "end of file".fmt(f),
}
}
}
/// JSON lexer token.
#[derive(Debug, PartialEq, Eq)]
pub enum Token {
/// `,`
Comma,
/// `:`
Colon,
/// `[`
LSquare,
/// `]`
RSquare,
/// `{`
LCurly,
/// `}`
RCurly,
/// `"`
Quote,
/// anything else
Other(u8),
}
impl core::fmt::Display for Token {
fn fmt(&self, f: &mut core::fmt::Formatter) -> core::fmt::Result {
use Token::*;
match self {
Comma => ',',
Colon => ':',
LSquare => '[',
RSquare => ']',
LCurly => '{',
RCurly => '}',
Quote => '"',
Other(b) => char::from(*b),
}
.fmt(f)
}
}
impl Token {
/// Return `Ok(())` if `self` equals `token`, else return `Err(err)`.
pub fn equals_or<E>(&self, token: Token, err: E) -> Result<(), E> {
if *self == token {
Ok(())
} else {
Err(err)
}
}
}
/// Lexing that does not require allocation.
pub trait Lex: crate::Read {
/// Skip input until the earliest non-whitespace character.
fn eat_whitespace(&mut self) {
self.skip_until(|c| !matches!(c, b' ' | b'\t' | b'\r' | b'\n'))
}
/// Skip potential whitespace and return the following token if there is some.
fn ws_token(&mut self) -> Option<Token> {
self.eat_whitespace();
self.peek_next().map(|next| self.token(next))
}
/// Parse a JSON token starting with a letter.
fn null_or_bool(&mut self) -> Option<Option<bool>> {
// we are calling this function without having advanced before
Some(match self.take_next() {
Some(b'n') if self.strip_prefix(b"ull") => None,
Some(b't') if self.strip_prefix(b"rue") => Some(true),
Some(b'f') if self.strip_prefix(b"alse") => Some(false),
_ => return None,
})
}
/// Convert a character to a token, such as '`:`' to [`Token::Colon`].
///
/// Only when the token consists of a single character that can be
/// reconstructed losslessly from the token, such as `[` or `:`,
/// then the current character is consumed.
/// All other non-token characters are preserved, i.e. input is not advanced.
fn token(&mut self, c: u8) -> Token {
let token = match c {
b'"' => Token::Quote,
b'[' => Token::LSquare,
b']' => Token::RSquare,
b'{' => Token::LCurly,
b'}' => Token::RCurly,
b',' => Token::Comma,
b':' => Token::Colon,
// it is important to `return` here in order not to take the next byte,
// like we do for the regular, single-character tokens
_ => return Token::Other(c),
};
self.take_next();
token
}
/// Take next token, discard it, and return mutable handle to lexer.
///
/// This is useful in particular when parsing negative numbers,
/// where you want to discard `-` and immediately continue.
fn discarded(&mut self) -> &mut Self {
self.take_next();
self
}
/// Parse a string with given function, followed by a colon.
fn str_colon<T, E: From<Expect>, TF, F>(&mut self, token: Token, tf: TF, f: F) -> Result<T, E>
where
TF: FnOnce(&mut Self) -> Option<Token>,
F: FnOnce(&mut Self) -> Result<T, E>,
{
token.equals_or(Token::Quote, Expect::String)?;
let key = f(self)?;
let colon = tf(self).filter(|t| *t == Token::Colon);
colon.ok_or(Expect::Colon)?;
Ok(key)
}
/// Execute `f` for every item in the comma-separated sequence until `end`.
fn seq<E: From<Expect>, TF, F>(&mut self, end: Token, mut tf: TF, mut f: F) -> Result<(), E>
where
TF: FnMut(&mut Self) -> Option<Token>,
F: FnMut(Token, &mut Self) -> Result<(), E>,
{
let mut token = tf(self).ok_or(Expect::ValueOrEnd)?;
if token == end {
return Ok(());
};
loop {
f(token, self)?;
token = tf(self).ok_or(Expect::CommaOrEnd)?;
if token == end {
return Ok(());
} else if token == Token::Comma {
token = tf(self).ok_or(Expect::Value)?;
} else {
return Err(Expect::CommaOrEnd)?;
}
}
}
/// Parse once using given function and assure that the function has consumed all tokens.
fn exactly_one<T, E: From<Expect>, TF, F>(&mut self, mut tf: TF, f: F) -> Result<T, E>
where
TF: FnMut(&mut Self) -> Option<Token>,
F: FnOnce(Token, &mut Self) -> Result<T, E>,
{
let token = tf(self).ok_or(Expect::Value)?;
let v = f(token, self)?;
self.eat_whitespace();
match self.peek_next() {
None => Ok(v),
Some(_) => Err(Expect::Eof)?,
}
}
}
impl<T> Lex for T where T: crate::Read {}