scanner.cpp 7.99 KB
Newer Older
beder's avatar
beder committed
1
2
#include "scanner.h"
#include "token.h"
beder's avatar
beder committed
3
#include "exceptions.h"
4
#include "exp.h"
beder's avatar
beder committed
5
#include <iostream>
beder's avatar
beder committed
6
7
8
9

namespace YAML
{
	Scanner::Scanner(std::istream& in)
beder's avatar
beder committed
10
11
		: INPUT(in), m_startedStream(false), m_endedStream(false), m_simpleKeyAllowed(false), m_flowLevel(0),
		m_line(0), m_column(0)
beder's avatar
beder committed
12
13
14
15
16
	{
	}

	Scanner::~Scanner()
	{
beder's avatar
beder committed
17
18
19
20
21
22
23
24
		while(!m_tokens.empty()) {
			delete m_tokens.front();
			m_tokens.pop();
		}

		// delete limbo tokens (they're here for RAII)
		for(std::set <Token *>::const_iterator it=m_limboTokens.begin();it!=m_limboTokens.end();++it)
			delete *it;
beder's avatar
beder committed
25
26
27
28
29
30
31
32
33
	}

	///////////////////////////////////////////////////////////////////////
	// Misc. helpers

	// GetChar
	// . Extracts a character from the stream and updates our position
	char Scanner::GetChar()
	{
34
		char ch = INPUT.get();
beder's avatar
beder committed
35
		m_column++;
beder's avatar
beder committed
36
		if(ch == '\n') {
37
			m_column = 0;
beder's avatar
beder committed
38
39
			m_line++;
		}
40
		return ch;
beder's avatar
beder committed
41
42
	}

beder's avatar
beder committed
43
44
45
46
47
48
49
50
51
52
	// GetChar
	// . Extracts 'n' characters from the stream and updates our position
	std::string Scanner::GetChar(int n)
	{
		std::string ret;
		for(int i=0;i<n;i++)
			ret += GetChar();
		return ret;
	}

beder's avatar
beder committed
53
54
55
	// Eat
	// . Eats 'n' characters and updates our position.
	void Scanner::Eat(int n)
beder's avatar
beder committed
56
	{
beder's avatar
beder committed
57
58
		for(int i=0;i<n;i++)
			GetChar();
beder's avatar
beder committed
59
60
	}

beder's avatar
beder committed
61
	// GetLineBreak
beder's avatar
beder committed
62
	// . Eats with no checking
beder's avatar
beder committed
63
	void Scanner::EatLineBreak()
beder's avatar
beder committed
64
	{
beder's avatar
beder committed
65
66
		Eat(1);
		m_column = 0;
beder's avatar
beder committed
67
68
69
70
71
72
73
74
75
	}

	// IsWhitespaceToBeEaten
	// . We can eat whitespace if:
	//   1. It's a space
	//   2. It's a tab, and we're either:
	//      a. In the flow context
	//      b. In the block context but not where a simple key could be allowed
	//         (i.e., not at the beginning of a line, or following '-', '?', or ':')
beder's avatar
beder committed
76
	bool Scanner::IsWhitespaceToBeEaten(char ch)
beder's avatar
beder committed
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
	{
		if(ch == ' ')
			return true;

		if(ch == '\t' && (m_flowLevel >= 0 || !m_simpleKeyAllowed))
			return true;

		return false;
	}

	// IsDocumentStart
	bool Scanner::IsDocumentStart()
	{
		// needs to be at the start of a new line
		if(m_column != 0)
			return false;

94
		return Exp::DocStart.Matches(INPUT);
beder's avatar
beder committed
95
96
97
98
99
100
101
102
103
	}

	// IsDocumentEnd
	bool Scanner::IsDocumentEnd()
	{
		// needs to be at the start of a new line
		if(m_column != 0)
			return false;

104
		return Exp::DocEnd.Matches(INPUT);
beder's avatar
beder committed
105
106
	}

beder's avatar
beder committed
107
108
109
	// IsBlockEntry
	bool Scanner::IsBlockEntry()
	{
110
		return Exp::BlockEntry.Matches(INPUT);
beder's avatar
beder committed
111
112
113
114
115
	}

	// IsKey
	bool Scanner::IsKey()
	{
116
		if(m_flowLevel > 0)
117
118
			return Exp::KeyInFlow.Matches(INPUT);
		return Exp::Key.Matches(INPUT);
beder's avatar
beder committed
119
120
121
122
123
	}

	// IsValue
	bool Scanner::IsValue()
	{
124
		if(m_flowLevel > 0)
125
126
			return Exp::ValueInFlow.Matches(INPUT);
		return Exp::Value.Matches(INPUT);
beder's avatar
beder committed
127
128
129
130
131
	}

	// IsPlainScalar
	bool Scanner::IsPlainScalar()
	{
132
		if(m_flowLevel > 0)
133
134
			return Exp::PlainScalarInFlow.Matches(INPUT);
		return Exp::PlainScalar.Matches(INPUT);
beder's avatar
beder committed
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
	}

	// ScanAndEnqueue
	// . Scans the token, then pushes it in the queue.
	// . Note: we also use a set of "limbo tokens", i.e., tokens
	//   that haven't yet been pushed. This way, if ScanToken()
	//   throws an exception, we'll be keeping track of 'pToken'
	//   somewhere, and it will be automatically cleaned up when
	//   the Scanner destructs.
	template <typename T> void Scanner::ScanAndEnqueue(T *pToken)
	{
		m_limboTokens.insert(pToken);
		m_tokens.push(ScanToken(pToken));
		m_limboTokens.erase(pToken);
	}

beder's avatar
beder committed
151
152
153
	///////////////////////////////////////////////////////////////////////
	// The main scanning function

beder's avatar
beder committed
154
	void Scanner::ScanNextToken()
beder's avatar
beder committed
155
	{
156
157
158
		if(m_endedStream)
			return;

beder's avatar
beder committed
159
		if(!m_startedStream)
beder's avatar
beder committed
160
			return ScanAndEnqueue(new StreamStartToken);
beder's avatar
beder committed
161
162

		ScanToNextToken();
163
		ValidateSimpleKey();
beder's avatar
beder committed
164
		PopIndentTo(m_column);
beder's avatar
beder committed
165
166

		if(INPUT.peek() == EOF)
beder's avatar
beder committed
167
			return ScanAndEnqueue(new StreamEndToken);
beder's avatar
beder committed
168

beder's avatar
beder committed
169
		// are we at a document token?
beder's avatar
beder committed
170
		if(IsDocumentStart())
beder's avatar
beder committed
171
			return ScanAndEnqueue(new DocumentStartToken);
beder's avatar
beder committed
172
173

		if(IsDocumentEnd())
beder's avatar
beder committed
174
			return ScanAndEnqueue(new DocumentEndToken);
beder's avatar
beder committed
175

beder's avatar
beder committed
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
		// are we at a flow start/end/entry?
		if(INPUT.peek() == Keys::FlowSeqStart)
			return ScanAndEnqueue(new FlowSeqStartToken);

		if(INPUT.peek() == Keys::FlowSeqEnd)
			return ScanAndEnqueue(new FlowSeqEndToken);
		
		if(INPUT.peek() == Keys::FlowMapStart)
			return ScanAndEnqueue(new FlowMapStartToken);
		
		if(INPUT.peek() == Keys::FlowMapEnd)
			return ScanAndEnqueue(new FlowMapEndToken);

		if(INPUT.peek() == Keys::FlowEntry)
			return ScanAndEnqueue(new FlowEntryToken);

		// block/map stuff?
		if(IsBlockEntry())
			return ScanAndEnqueue(new BlockEntryToken);

		if(IsKey())
			return ScanAndEnqueue(new KeyToken);

		if(IsValue())
			return ScanAndEnqueue(new ValueToken);

		// TODO: alias/anchor/tag

beder's avatar
beder committed
204
205
206
		// special scalars
		if(m_flowLevel == 0 && (INPUT.peek() == Keys::LiteralScalar || INPUT.peek() == Keys::FoldedScalar))
			return ScanAndEnqueue(new BlockScalarToken);
beder's avatar
beder committed
207

beder's avatar
beder committed
208
209
		if(INPUT.peek() == '\'' || INPUT.peek() == '\"')
			return ScanAndEnqueue(new QuotedScalarToken);
beder's avatar
beder committed
210
211
212
213
214
215
216

		// plain scalars
		if(IsPlainScalar())
			return ScanAndEnqueue(new PlainScalarToken);

		// don't know what it is!
		throw UnknownToken();
beder's avatar
beder committed
217
218
219
220
221
222
223
224
	}

	// ScanToNextToken
	// . Eats input until we reach the next token-like thing.
	void Scanner::ScanToNextToken()
	{
		while(1) {
			// first eat whitespace
beder's avatar
beder committed
225
226
			while(IsWhitespaceToBeEaten(INPUT.peek()))
				Eat(1);
beder's avatar
beder committed
227
228

			// then eat a comment
beder's avatar
beder committed
229
			if(Exp::Comment.Matches(INPUT)) {
beder's avatar
beder committed
230
				// eat until line break
beder's avatar
beder committed
231
				while(INPUT && !Exp::Break.Matches(INPUT))
beder's avatar
beder committed
232
					Eat(1);
beder's avatar
beder committed
233
234
235
			}

			// if it's NOT a line break, then we're done!
beder's avatar
beder committed
236
			if(!Exp::Break.Matches(INPUT))
beder's avatar
beder committed
237
238
239
240
241
				break;

			// otherwise, let's eat the line break and keep going
			EatLineBreak();

beder's avatar
beder committed
242
243
244
			// oh yeah, and let's get rid of that simple key
			ValidateSimpleKey();

beder's avatar
beder committed
245
246
247
248
249
250
			// new line - we may be able to accept a simple key now
			if(m_flowLevel == 0)
				m_simpleKeyAllowed = true;
        }
	}

beder's avatar
beder committed
251
252
253
	// PushIndentTo
	// . Pushes an indentation onto the stack, and enqueues the
	//   proper token (sequence start or mapping start).
beder's avatar
beder committed
254
255
	// . Returns the token it generates (if any).
	Token *Scanner::PushIndentTo(int column, bool sequence)
beder's avatar
beder committed
256
257
258
	{
		// are we in flow?
		if(m_flowLevel > 0)
beder's avatar
beder committed
259
			return 0;
beder's avatar
beder committed
260
261
262

		// is this actually an indentation?
		if(column <= m_indents.top())
beder's avatar
beder committed
263
			return 0;
beder's avatar
beder committed
264
265
266
267
268
269
270

		// now push
		m_indents.push(column);
		if(sequence)
			m_tokens.push(new BlockSeqStartToken);
		else
			m_tokens.push(new BlockMapStartToken);
beder's avatar
beder committed
271
272

		return m_tokens.front();
beder's avatar
beder committed
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
	}

	// PopIndentTo
	// . Pops indentations off the stack until we reach 'column' indentation,
	//   and enqueues the proper token each time.
	void Scanner::PopIndentTo(int column)
	{
		// are we in flow?
		if(m_flowLevel > 0)
			return;

		// now pop away
		while(!m_indents.empty() && m_indents.top() > column) {
			m_indents.pop();
			m_tokens.push(new BlockEndToken);
		}
	}

beder's avatar
beder committed
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
	// IncreaseFlowLevel
	void Scanner::IncreaseFlowLevel()
	{
		// TODO: Push simple key
		m_flowLevel++;
	}

	// DecreaseFlowLevel
	void Scanner::DecreaseFlowLevel()
	{
		if(m_flowLevel > 0) {
			m_flowLevel--;
			// TODO: Pop simple key
		}
	}

307
308
309
	// GetNextToken
	// . Returns the next token on the queue, and scans if only we need to.
	Token *Scanner::GetNextToken()
beder's avatar
beder committed
310
	{
311
		while(1) {
312
			Token *pToken = 0;
beder's avatar
beder committed
313

314
315
316
			// is there a token in the queue?
			if(!m_tokens.empty())
				pToken = m_tokens.front();
beder's avatar
beder committed
317

318
319
320
			// ... that's possible
			// (here's where we clean up the impossible tokens)
			if(pToken && !pToken->isPossible) {
beder's avatar
beder committed
321
322
				m_tokens.pop();
				delete pToken;
323
				continue;
beder's avatar
beder committed
324
			}
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356

			// and valid
			if(pToken && !pToken->isValid)
				pToken = 0;

			// then that's what we want
			if(pToken) {
				m_tokens.pop();
				return pToken;
			}

			// no token? maybe we've actually finished
			if(m_endedStream)
				break;

			// no? then scan...
			ScanNextToken();
		}

		return 0;
	}

	// temporary function for testing
	void Scanner::Scan()
	{
		while(1) {
			Token *pToken = GetNextToken();
			if(!pToken)
				break;

			std::cout << typeid(*pToken).name() << ": " << *pToken << std::endl;
			delete pToken;
beder's avatar
beder committed
357
		}
beder's avatar
beder committed
358
359
	}
}