summaryrefslogtreecommitdiff
path: root/src/core/common/VariantReader.cpp
blob: 234e8f24b39e1f1cd46d6ba1a54574dbb8d28133 (plain)
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
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
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
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
/*
    Ousía
    Copyright (C) 2014, 2015  Benjamin Paaßen, Andreas Stöckel

    This program is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>.
*/

#include <cmath>
#include <limits>
#include <sstream>

#include <utf8.h>

#include "Number.hpp"
#include "VariantReader.hpp"
#include "Utils.hpp"

namespace ousia {

/* Error Messages */

// TODO: Invent common system for error messages which allows localization
// TODO: Possibly adapt the clang error logging system

static const char *ERR_UNEXPECTED_CHAR = "Unexpected character";
static const char *ERR_UNEXPECTED_END = "Unexpected end of literal";
static const char *ERR_UNTERMINATED = "Unterminated literal";
static const char *ERR_INVALID_ESCAPE = "Invalid escape sequence";
static const char *ERR_INVALID_INTEGER = "Invalid integer value";

template <class T>
static std::pair<bool, T> error(CharReader &reader, Logger &logger,
                                const std::string &err, T res)
{
	logger.error(err, reader);
	return std::make_pair(false, std::move(res));
}

static std::string unexpectedMsg(const char *expected, const char got)
{
	std::stringstream ss;
	ss << ERR_UNEXPECTED_CHAR << ": Expected " << expected << " but got \'"
	   << got << "\'";
	return ss.str();
}

static std::string invalidMsg(const char *invalidType,
                              const std::string &invalidValue)
{
	std::stringstream ss;
	ss << "Invalid " << invalidType << " \"" << invalidValue << "\"";
	return ss.str();
}

template <class T>
static std::pair<bool, T> unexpected(CharReader &reader, Logger &logger,
                                     const char *expected, const char got,
                                     T res)
{
	return error(reader, logger, unexpectedMsg(expected, got), res);
}

/* State machine states */

static const int STATE_INIT = 0;
static const int STATE_IN_STRING = 1;
static const int STATE_IN_COMPLEX = 2;
static const int STATE_ESCAPE = 4;
static const int STATE_WHITESPACE = 5;
static const int STATE_RESYNC = 6;
static const int STATE_EXPECT_COMMA = 7;
static const int STATE_HAS_KEY = 8;

/* Helper function for parsing arrays or objects */

// TODO: Refactor this to own class

enum class ComplexMode { ARRAY, OBJECT, BOTH };

static std::string idxKey(size_t idx)
{
	return std::string{"#"} + std::to_string(idx);
}

static Variant parseComplexResult(Variant::mapType &objectResult,
                                  Variant::arrayType &arrayResult, bool isArray,
                                  ComplexMode mode)
{
	// If the result is an array, simply return an array variant
	if (isArray && mode != ComplexMode::OBJECT) {
		return Variant{arrayResult};
	}

	// Otherwise add missing array keys to the resulting map
	for (size_t i = 0; i < arrayResult.size(); i++) {
		objectResult.insert(std::make_pair(idxKey(i), arrayResult[i]));
	}
	return Variant{objectResult};
}

static std::pair<bool, Variant> parseComplex(CharReader &reader, Logger &logger,
                                             char delim, ComplexMode mode)
{
	// Result for either objects or arrays
	Variant::mapType objectResult;
	Variant::arrayType arrayResult;

	// Auxiliary state variables
	bool hadError = false;
	bool isArray = true;

	// Determine the start state and set the actual delimiter
	int state = delim ? STATE_IN_COMPLEX : STATE_INIT;
	delim = delim ? delim : ']';

	// Current array element index
	size_t idx = 0;

	// Current key value
	Variant key;

	// Consume all whitespace
	reader.consumePeek();
	reader.consumeWhitespace();

	// Iterate over the characters, use the parseGeneric function to read the
	// pairs
	char c;
	while (reader.peek(c)) {
		// Generically handle the end of the array
		if (state != STATE_INIT && c == delim) {
			reader.consumePeek();

			// Add final keys to the result
			if (state == STATE_HAS_KEY) {
				if (isArray) {
					arrayResult.push_back(key);
				} else {
					objectResult.insert(std::make_pair(idxKey(idx), key));
				}
				key = nullptr;
			}

			return std::make_pair(
			    !hadError,
			    parseComplexResult(objectResult, arrayResult, isArray, mode));
		} else if (Utils::isWhitespace(c)) {
			reader.consumePeek();
			continue;
		}

		switch (state) {
			case STATE_INIT:
				if (c != '[') {
					return error(reader, logger, ERR_UNEXPECTED_CHAR,
					             parseComplexResult(objectResult, arrayResult,
					                                isArray, mode));
				}
				state = STATE_IN_COMPLEX;
				reader.consumePeek();
				break;
			case STATE_IN_COMPLEX: {
				// Try to read an element using the parseGeneric function
				reader.resetPeek();
				auto elem = VariantReader::parseGenericToken(
				    reader, logger, {',', '=', delim}, true);

				// If the reader had no error, expect an comma, otherwise skip
				// to the next comma in the stream
				if (elem.first) {
					key = elem.second;
					state = STATE_HAS_KEY;
				} else {
					state = STATE_RESYNC;
					hadError = true;
				}
				break;
			}
			case STATE_HAS_KEY: {
				// When finding an equals sign, read the value corresponding to
				// the key
				if (c == '=') {
					// Abort if only arrays are allowed
					if (mode == ComplexMode::ARRAY) {
						logger.error(unexpectedMsg("\",\"", c), reader);
						hadError = true;
						state = STATE_RESYNC;
						break;
					}

					// Make sure the key is a valid identifier, if not, issue
					// an error
					std::string keyString = key.toString();
					if (!Utils::isIdentifier(keyString)) {
						logger.error(invalidMsg("identifier", keyString),
						             reader);
						hadError = true;
					}

					// This no longer is an array
					isArray = false;

					// Consume the equals sign and parse the value
					reader.consumePeek();
					auto elem = VariantReader::parseGenericToken(
					    reader, logger, {',', delim}, true);
					if (elem.first) {
						objectResult.insert(
						    std::make_pair(keyString, elem.second));
						idx++;
					} else {
						state = STATE_RESYNC;
						hadError = true;
						key = nullptr;
						break;
					}
					state = STATE_EXPECT_COMMA;
				} else if (c == ',') {
					// Simply add the previously read value to the result
					// array or the result object
					if (isArray) {
						arrayResult.push_back(key);
					} else {
						objectResult.insert(std::make_pair(idxKey(idx), key));
					}
					idx++;
					state = STATE_IN_COMPLEX;
					reader.consumePeek();
				} else {
					if (mode == ComplexMode::ARRAY) {
						logger.error(unexpectedMsg("\",\"", c), reader);
					} else {
						logger.error(unexpectedMsg("\",\" or \"=\"", c),
						             reader);
					}
					state = STATE_RESYNC;
					hadError = true;
				}
				key = nullptr;
				break;
			}
			case STATE_EXPECT_COMMA:
				if (c == ',') {
					state = STATE_IN_COMPLEX;
				} else {
					logger.error(unexpectedMsg("\",\"", c), reader);
					state = STATE_RESYNC;
					hadError = true;
				}
				reader.consumePeek();
				break;
			case STATE_RESYNC:
				// Just wait for another comma to arrive
				if (c == ',') {
					state = STATE_IN_COMPLEX;
				}
				reader.consumePeek();
				break;
		}
	}
	return error(reader, logger, ERR_UNEXPECTED_END,
	             parseComplexResult(objectResult, arrayResult, isArray, mode));
}

/* Class Reader */

static bool encodeUtf8(std::stringstream &res, CharReader &reader,
                       Logger &logger, int64_t v, bool latin1)
{
	// Encode the unicode codepoint as UTF-8
	uint32_t cp = static_cast<uint32_t>(v);
	if (latin1 && cp > 0xFF) {
		logger.error("Not a valid ISO-8859-1 (Latin-1) character, skipping",
		             reader);
		return false;
	}

	// Append the code point to the output stream
	try {
		utf8::append(cp, std::ostream_iterator<uint8_t>{res});
		return true;
	}
	catch (utf8::invalid_code_point ex) {
		logger.error("Invalid Unicode codepoint, skipping", reader);
	}
	return false;
}

std::pair<bool, std::string> VariantReader::parseString(
    CharReader &reader, Logger &logger, const std::unordered_set<char> *delims)
{
	// Initialize the internal state
	bool hadError = false;
	int state = STATE_INIT;
	char quote = 0;
	std::stringstream res;

	// Consume all whitespace
	reader.consumePeek();
	reader.consumeWhitespace();

	// Statemachine whic iterates over each character in the stream
	// TODO: Combination of peeking and consumePeek is stupid as consumePeek is
	// the default (read and putBack would obviously be better, yet the latter
	// is not trivial to implement in the current CharReader).
	char c;
	while (reader.peek(c)) {
		switch (state) {
			case STATE_INIT:
				if (c == '"' || c == '\'') {
					quote = c;
					state = STATE_IN_STRING;
					break;
				} else if (delims && delims->count(c)) {
					return error(reader, logger, ERR_UNEXPECTED_END, res.str());
				}
				return unexpected(reader, logger, "\" or \'", c, res.str());
			case STATE_IN_STRING:
				if (c == quote) {
					reader.consumePeek();
					return std::make_pair(!hadError, res.str());
				} else if (c == '\\') {
					state = STATE_ESCAPE;
					reader.consumePeek();
					break;
				} else if (c == '\n') {
					return error(reader, logger, ERR_UNTERMINATED, res.str());
				}
				res << c;
				reader.consumePeek();
				break;
			case STATE_ESCAPE:
				// Handle all possible special escape characters
				switch (c) {
					case 'b':
						res << '\b';
						break;
					case 'f':
						res << '\f';
						break;
					case 'n':
						res << '\n';
						break;
					case 'r':
						res << '\r';
						break;
					case 't':
						res << '\t';
						break;
					case 'v':
						res << '\v';
						break;
					case '\'':
						res << '\'';
						break;
					case '"':
						res << '"';
						break;
					case '\\':
						res << '\\';
						break;
					case '\n':
						break;
					case 'x': {
						// Parse Latin-1 sequence \xXX
						Number n;
						hadError = !(n.parseFixedLengthInteger(reader, 2, 16,
						                                       logger) &&
						             encodeUtf8(res, reader, logger,
						                        n.intValue(), true)) ||
						           hadError;
						break;
					}
					case 'u': {
						// Parse Unicode sequence \uXXXX
						Number n;
						hadError = !(n.parseFixedLengthInteger(reader, 4, 16,
						                                       logger) &&
						             encodeUtf8(res, reader, logger,
						                        n.intValue(), false)) ||
						           hadError;
						break;
					}
					default:
						if (Utils::isNumeric(c)) {
							// Parse Latin-1 sequence \000
							reader.resetPeek();
							Number n;
							hadError = !(n.parseFixedLengthInteger(reader, 3, 8,
							                                       logger) &&
							             encodeUtf8(res, reader, logger,
							                        n.intValue(), true)) ||
							           hadError;
						} else {
							logger.error(ERR_INVALID_ESCAPE, reader);
							hadError = true;
						}
						break;
				}

				// Switch back to the "normal" state
				state = STATE_IN_STRING;
				reader.consumePeek();
				break;
		}
	}
	return error(reader, logger, ERR_UNEXPECTED_END, res.str());
}

std::pair<bool, std::string> VariantReader::parseToken(
    CharReader &reader, Logger &logger, const std::unordered_set<char> &delims)
{
	std::stringstream res;
	char c;

	// Consume all whitespace
	reader.consumePeek();
	reader.consumeWhitespace();

	// Copy all characters, skip whitespace at the end
	int state = STATE_WHITESPACE;
	while (reader.peek(c)) {
		bool whitespace = Utils::isWhitespace(c);
		if (delims.count(c) || (state == STATE_IN_STRING && whitespace)) {
			reader.resetPeek();
			return std::make_pair(state == STATE_IN_STRING, res.str());
		} else if (!whitespace) {
			state = STATE_IN_STRING;
			res << c;
		}
		reader.consumePeek();
	}
	return std::make_pair(state == STATE_IN_STRING, res.str());
}

std::pair<bool, std::string> VariantReader::parseUnescapedString(
    CharReader &reader, Logger &logger, const std::unordered_set<char> &delims)
{
	std::stringstream res;
	std::stringstream buf;
	char c;

	// Consume all whitespace
	reader.consumePeek();
	reader.consumeWhitespace();

	// Copy all characters, skip whitespace at the end
	int state = STATE_IN_STRING;
	while (reader.peek(c)) {
		if (delims.count(c)) {
			reader.resetPeek();
			return std::make_pair(true, res.str());
		} else if (Utils::isWhitespace(c)) {
			// Do not add trailing whitespaces to the output buffer. We have
			// a temporary store (buf) here which we only append to the output
			// buffer (res) if another character follows.
			state = STATE_WHITESPACE;
			buf << c;
		} else {
			// If we just had a sequence of whitespace, append it to the output
			// buffer and continue
			if (state == STATE_WHITESPACE) {
				res << buf.str();
				buf.str(std::string{});
				buf.clear();
				state = STATE_IN_STRING;
			}
			res << c;
		}
		reader.consumePeek();
	}
	return std::make_pair(true, res.str());
}

std::pair<bool, Variant::boolType> VariantReader::parseBool(CharReader &reader,
                                                            Logger &logger)
{
	// first we consume all whitespaces.
	reader.consumePeek();
	reader.consumeWhitespace();
	// then we try to find the words "true" or "false".

	bool val = false;
	CharReaderFork readerFork = reader.fork();
	LoggerFork loggerFork = logger.fork();
	auto res = parseToken(readerFork, loggerFork, std::unordered_set<char>{});
	if (res.first) {
		bool valid = false;
		if (res.second == "true") {
			val = true;
			valid = true;
		} else if (res.second == "false") {
			val = false;
			valid = true;
		}
		if (valid) {
			readerFork.commit();
			loggerFork.commit();
			return std::make_pair(true, val);
		}
	}
	return std::make_pair(false, val);
}

std::pair<bool, int64_t> VariantReader::parseInteger(
    CharReader &reader, Logger &logger, const std::unordered_set<char> &delims)
{
	Number n;
	if (n.parse(reader, logger, delims)) {
		// Only succeed if the parsed number is an integer, otherwise this is an
		// error
		if (n.isInt()) {
			return std::make_pair(true, n.intValue());
		} else {
			return error(reader, logger, ERR_INVALID_INTEGER, n.intValue());
		}
	}
	return std::make_pair(false, n.intValue());
}

std::pair<bool, double> VariantReader::parseDouble(
    CharReader &reader, Logger &logger, const std::unordered_set<char> &delims)
{
	Number n;
	bool res = n.parse(reader, logger, delims);
	return std::make_pair(res, n.doubleValue());
}

std::pair<bool, Variant::arrayType> VariantReader::parseArray(
    CharReader &reader, Logger &logger, char delim)
{
	auto res = parseComplex(reader, logger, delim, ComplexMode::ARRAY);
	return std::make_pair(res.first, res.second.asArray());
}

std::pair<bool, Variant::mapType> VariantReader::parseObject(CharReader &reader,
                                                             Logger &logger,
                                                             char delim)
{
	auto res = parseComplex(reader, logger, delim, ComplexMode::OBJECT);
	return std::make_pair(res.first, res.second.asMap());
}

static const std::unordered_set<char> cardDelims{' ', ',', '}', '-'};

std::pair<bool, Variant::cardinalityType> VariantReader::parseCardinality(
    CharReader &reader, Logger &logger)
{
	// first we consume all whitespaces.
	reader.consumePeek();
	reader.consumeWhitespace();
	// then we expect curly braces.
	char c;
	if (!reader.read(c) || c != '{') {
		return unexpected(reader, logger, "{", c, Variant::cardinalityType{});
	}

	Variant::cardinalityType card{};

	reader.consumePeek();
	reader.consumeWhitespace();

	// which should in turn be followed by ranges.
	while (reader.peek(c)) {
		if (Utils::isNumeric(c)) {
			// in case of a numeric character we want to read an integer.
			reader.resetPeek();
			Number n;
			if (!n.parse(reader, logger, cardDelims) || !n.isInt() ||
			    n.intValue() < 0) {
				return error(reader, logger, "Invalid number for cardinality!",
				             Variant::cardinalityType{});
			}
			unsigned int start = (unsigned int)n.intValue();
			// if we have that we might either find a } or , making this a
			// range or a - leading us to expect another integer.
			reader.consumePeek();
			reader.consumeWhitespace();
			if (!reader.peek(c)) {
				error(reader, logger, ERR_UNEXPECTED_END,
				      Variant::cardinalityType{});
			}
			switch (c) {
				case '}':
				case ',':
					card.merge({start});
					reader.resetPeek();
					break;
				case '-': {
					// get another integer.
					reader.consumePeek();
					reader.consumeWhitespace();
					if (!reader.peek(c)) {
						error(reader, logger, ERR_UNEXPECTED_END,
						      Variant::cardinalityType{});
					}
					reader.resetPeek();
					Number n2;
					if (!n2.parse(reader, logger, cardDelims) || !n2.isInt() ||
					    n2.intValue() < 0) {
						return error(reader, logger,
						             "Invalid number for cardinality!",
						             Variant::cardinalityType{});
					}
					unsigned int end = (unsigned int)n2.intValue();
					if (end <= start) {
						return error(reader, logger,
						             std::string("The start of the range (") +
						                 std::to_string(start) +
						                 ") was bigger (or equal) to the end "
						                 "of the range (" +
						                 std::to_string(end) + ")!",
						             Variant::cardinalityType{});
					}
					card.merge({start, end});
					break;
				}
				default:
					return unexpected(reader, logger, "}, , or -", c,
					                  Variant::cardinalityType{});
			}
		} else {
			switch (c) {
				case '*':
					// in case of a Kleene star we can construct the
					// cardinality right away.
					card.merge(Variant::rangeType::typeRangeFrom(0));
					break;
				case '<':
				case '>': {
					// in case of an open range we expect a number.
					reader.consumePeek();
					reader.consumeWhitespace();
					Number n;
					if (!n.parse(reader, logger, cardDelims)) {
						return error(reader, logger,
						             "Expected number in an open range "
						             "specifier!",
						             Variant::cardinalityType{});
					}
					if (!n.isInt() || n.intValue() < 0) {
						return error(reader, logger,
						             "Invalid number for cardinality!",
						             Variant::cardinalityType{});
					}
					if (c == '<') {
						card.merge(Variant::rangeType{
						    0, (unsigned int)n.intValue() - 1});
					} else {
						card.merge(Variant::rangeType::typeRangeFrom(
						    (unsigned int)n.intValue() + 1));
					}
					break;
				}
				default:
					return unexpected(reader, logger,
					                  "Unsigned integer, *, < or >", c,
					                  Variant::cardinalityType{});
			}
		}
		// after we have parsed a range, read all whitespaces.
		reader.consumePeek();
		reader.consumeWhitespace();
		// ... and check if we are at the end.
		if (!reader.read(c)) {
			error(reader, logger, ERR_UNEXPECTED_END,
			      Variant::cardinalityType{});
		}
		switch (c) {
			case '}':
				return std::make_pair(true, card);
			case ',':
				reader.consumePeek();
				reader.consumeWhitespace();
				break;

			default:
				return unexpected(reader, logger, "} or ,", c,
				                  Variant::cardinalityType{});
		}
	}

	return error(reader, logger, ERR_UNEXPECTED_END,
	             Variant::cardinalityType{});
}

std::pair<bool, Variant> VariantReader::parseGeneric(
    CharReader &reader, Logger &logger, const std::unordered_set<char> &delims)
{
	Variant::arrayType arr;
	char c;
	bool hadError = false;

	// Skip all peeked characters
	reader.consumePeek();

	// Read the start offset
	const SourceOffset start = reader.getOffset();

	// Parse generic tokens until the end of the stream or the delimiter is
	// reached
	while (reader.peek(c) && !delims.count(c)) {
		reader.resetPeek();
		auto res = parseGenericToken(reader, logger, delims);
		hadError = hadError || !res.first;
		arr.push_back(res.second);
	}
	reader.resetPeek();

	// The resulting array should not be empty
	if (arr.empty()) {
		return error(reader, logger, ERR_UNEXPECTED_END, nullptr);
	}

	// If there only one element was extracted, return this element instead of
	// an array
	if (arr.size() == 1) {
		return std::make_pair(!hadError, arr[0]);
	} else {
		Variant res{arr};
		res.setLocation({reader.getSourceId(), start, reader.getOffset()});
		return std::make_pair(!hadError, res);
	}
}

std::pair<bool, Variant> VariantReader::parseGenericToken(
    CharReader &reader, Logger &logger, const std::unordered_set<char> &delims,
    bool extractUnescapedStrings)
{
	char c;

	// Skip all whitespace characters, read a character and abort if at the end
	reader.consumePeek();
	reader.consumeWhitespace();
	if (!reader.fetch(c) || delims.count(c)) {
		return error(reader, logger, ERR_UNEXPECTED_END, nullptr);
	}

	// Fetch the start offset
	const SourceOffset start = reader.getOffset();

	// Parse a string if a quote is reached
	if (c == '"' || c == '\'') {
		auto res = parseString(reader, logger);
		Variant v = Variant::fromString(res.second);
		v.setLocation({reader.getSourceId(), start, reader.getOffset()});
		return std::make_pair(res.first, v);
	}

	// Try to parse everything that looks like a number as number
	if (Utils::isNumeric(c) || c == '-') {
		// Try to parse the number
		Number n;
		CharReaderFork readerFork = reader.fork();
		LoggerFork loggerFork = logger.fork();
		if (n.parse(readerFork, loggerFork, delims)) {
			Variant v;
			if (n.isInt()) {
				if (n.intValue() <
				        std::numeric_limits<Variant::intType>::min() ||
				    n.intValue() >
				        std::numeric_limits<Variant::intType>::max()) {
					logger.error("Number exceeds type limits.", reader);
					return std::make_pair(false, v);
				}
				v = Variant{static_cast<Variant::intType>(n.intValue())};
			} else {
				v = Variant{n.doubleValue()};
			}
			readerFork.commit();
			loggerFork.commit();
			v.setLocation({reader.getSourceId(), start, reader.getOffset()});
			return std::make_pair(true, v);
		}
	}

	// Try to parse a cardinality
	if (c == '{') {
		CharReaderFork readerFork = reader.fork();
		LoggerFork loggerFork = logger.fork();
		auto res = parseCardinality(readerFork, loggerFork);
		if (res.first) {
			readerFork.commit();
			loggerFork.commit();
			Variant v{res.second};
			v.setLocation({reader.getSourceId(), start, reader.getOffset()});
			return std::make_pair(true, v);
		}
	}

	// Try to parse an object
	if (c == '[') {
		auto res = parseComplex(reader, logger, 0, ComplexMode::BOTH);
		res.second.setLocation(
		    {reader.getSourceId(), start, reader.getOffset()});
		return res;
	}

	// Otherwise parse a single token
	std::pair<bool, std::string> res;
	if (extractUnescapedStrings) {
		res = parseUnescapedString(reader, logger, delims);
	} else {
		res = parseToken(reader, logger, delims);
	}

	// Handling for special primitive values
	bool isSpecial = false;
	Variant v;
	if (res.first) {
		if (res.second == "true") {
			v = Variant{true};
			isSpecial = true;
		} else if (res.second == "false") {
			v = Variant{false};
			isSpecial = true;
		} else if (res.second == "null") {
			v = Variant{nullptr};
			isSpecial = true;
		}
	}

	// Check whether the parsed string is a valid identifier -- if yes, flag it
	// as "magic" string
	if (!isSpecial) {
		if (Utils::isIdentifier(res.second)) {
			v.setMagic(res.second.c_str());
		} else {
			v = Variant::fromString(res.second);
		}
	}
	v.setLocation({reader.getSourceId(), start, reader.getOffset()});
	return std::make_pair(res.first, v);
}

std::pair<bool, Variant> VariantReader::parseGenericString(
    const std::string &str, Logger &logger, SourceId sourceId, size_t offs)
{
	// If the given string is empty, just return it as a string (there is no
	// other type for which something empty would be valid)
	// TODO: How to integrate this into parseGenericToken?
	if (!str.empty()) {
		CharReader reader{str, sourceId, offs};
		LoggerFork loggerFork = logger.fork();

		// Try to parse a single token
		std::pair<bool, Variant> res = parseGenericToken(
		    reader, loggerFork, std::unordered_set<char>{}, true);

		// If the string was actually consisted of a single token, return that
		// token
		if (reader.atEnd()) {
			loggerFork.commit();
			return res;
		}
	}

	// Otherwise return the given string as a string, set the location of the
	// string correctly
	Variant v = Variant::fromString(str);
	v.setLocation({sourceId, offs, offs + str.size()});
	return std::make_pair(true, v);
}

std::pair<bool, Variant> VariantReader::parseTyped(
    VariantType type, CharReader &reader, Logger &logger,
    const std::unordered_set<char> &delims)
{
	switch (type) {
		case VariantType::BOOL: {
			auto res = parseBool(reader, logger);
			return std::make_pair(res.first, Variant{res.second});
		}
		case VariantType::INT: {
			auto res = parseInteger(reader, logger, delims);
			if (res.second < std::numeric_limits<Variant::intType>::min() ||
			    res.second > std::numeric_limits<Variant::intType>::max()) {
				logger.error("Number exceeds type limits.", reader);
				return std::make_pair(false, Variant{});
			}
			return std::make_pair(
			    res.first, Variant{static_cast<Variant::intType>(res.second)});
		}
		case VariantType::DOUBLE: {
			auto res = parseDouble(reader, logger, delims);
			return std::make_pair(res.first, Variant{res.second});
		}
		case VariantType::STRING: {
			auto res = parseString(reader, logger, delims);
			return std::make_pair(res.first, Variant::fromString(res.second));
		}
		case VariantType::ARRAY: {
			char delim = 0;
			if (delims.size() == 1) {
				delim = *delims.begin();
			}
			auto res = parseArray(reader, logger, delim);
			return std::make_pair(res.first, Variant{res.second});
		}

		case VariantType::MAP:
		case VariantType::OBJECT: {
			char delim = 0;
			if (delims.size() == 1) {
				delim = *delims.begin();
			}
			auto res = parseObject(reader, logger, delim);
			return std::make_pair(res.first, Variant{res.second});
		}
		case VariantType::CARDINALITY: {
			auto res = parseCardinality(reader, logger);
			return std::make_pair(res.first, Variant{res.second});
		}
		default:
			break;
	}

	return std::make_pair(false, Variant{});
}

std::pair<bool, Variant> VariantReader::parseTyped(VariantType type,
                                                   const std::string &str,
                                                   Logger &logger,
                                                   SourceId sourceId,
                                                   size_t offs)
{
	// create a char reader and forward the method.
	CharReader reader{str, sourceId, offs};
	LoggerFork loggerFork = logger.fork();
	std::pair<bool, Variant> res =
	    parseTyped(type, reader, loggerFork, std::unordered_set<char>{});

	// If all content could be parsed, commit the result.
	if (reader.atEnd()) {
		loggerFork.commit();
		return res;
	}

	// otherwise do not.
	logger.error("Not all input could be processed",
	             {sourceId, offs, offs + str.size()});
	return std::make_pair(false, Variant{});
}
}