Linden Lab is sharing code with you
Bitbucket is a code hosting site. Unlimited public and private repositories. Free for small teams.
Don't show this again- Branch
- default
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 | # file: llidl.py
#
# $LicenseInfo:firstyear=2009&license=mit$
#
# Copyright (c) 2009, Linden Research, Inc.
#
# Permission is hereby granted, free of charge, to any person obtaining a copy
# of this software and associated documentation files (the "Software"), to deal
# in the Software without restriction, including without limitation the rights
# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
# copies of the Software, and to permit persons to whom the Software is
# furnished to do so, subject to the following conditions:
#
# The above copyright notice and this permission notice shall be included in
# all copies or substantial portions of the Software.
#
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
# THE SOFTWARE.
# $/LicenseInfo$
"""
LLIDL parser and value checker.
LLIDL is an interface description language for REST like protocols based on
the LLSD type system.
"""
import datetime
import re
from types import *
import uuid
import llsd
import lluuid
class _Result(object):
"""
The result of a llsd/llidl spciciation comparison
When comparing a particular llsd value to an llidl specification, there
are several possible outcomes:
MATCHED: the structure is as expected, the values all the right type
CONVERTED: the structure is as expected, but some values were of
convertable values, structure may have gone through a system with
more a restrictive type system
DEFAULTED: parts of the structure were missing, or set to undef
these will be read as the default value, this may indicate that
the structure comes from a system with an older definition
ADDITIONAL: parts of the structure do not correspond with the spec,
they will be ignored
MIXED: some were defaulted , some were newer
INCOMPATIBLE: there were values that just didn't match and can't
be converted
"""
def __init__(self, value, name):
self._value = value
self._name = name
def __repr__(self):
return "llidl." + self._name
def __str__(self):
return self._name
def __cmp__(self, other):
return cmp(self._value, other._value)
def __and__(self, other):
sv = int(self._value)
ov = int(other._value)
if sv < ov: return self
if ov < sv: return other
if self._value != other._value:
return MIXED
return self
def __or__(self, other):
if self._value >= other._value:
return self
return other
MATCHED = _Result(4, "MATCHED")
CONVERTED = _Result(3, "CONVERTED")
DEFAULTED = _Result(2.2, "DEFAULTED")
ADDITIONAL = _Result(2.1, "ADDITIONAL")
MIXED = _Result(1, "MIXED")
INCOMPATIBLE = _Result(0, "INCOMPATIBLE")
class MatchError(Exception):
"""A mis-match between an LLSD and a LLIDL value description"""
pass
class Value(object):
"""
A single value specification from a LLIDL suite
Tests:
* match(actual) -- True if the value matches structurally and all
conversions are valid (non-defaulted)
* valid(actual) -- True if the value matches structurally though
defaulted or additional data is acceptable,
all conversions must still be valid (non-defaulted)
The above two tests take an optional keyword argument 'raises'
which determines the exception behavior: If it is None (the default),
then the test result is simply returned. Otherwise a exception is
raised if the test fails. Which exception is determined by the value
of raises
* True -- raises a MatchError
* a class -- raises a new instance of the class
* an instance -- raises that instance
* a callable -- raises the result of calling it
In the case of both a class or a callable, the error string is supplied
as the only argument to constructing or calling.
* has_additional(actual) -- True if the value has additional data
* has_defaulted(actual) -- True if the value has defaulted data
* incompatible(actual) -- True if the value is incompatible
The above three tests are primarily for unit testing and do not support
the raises feature.
"""
def _set_suite(self, suite):
pass
def _variants_referenced(self):
return set() # faster than frozenset, really!
def _compare(self, actual):
"""Compare an LLSD value to the value spec.; return a Result"""
return INCOMPATIBLE
def _failure(self, raises, message):
if raises is not None:
if raises is True:
raises = MatchError
if callable(raises):
raises = raises(message)
raise raises
return False
def match(self, actual, raises=None):
"""Return True if the value matches exactly"""
return (self._compare(actual) >= CONVERTED
or self._failure(raises, "did not match"))
def valid(self, actual, raises=None):
"""Return True if the value matches, or has additional data"""
return (self._compare(actual) >= MIXED
or self._failure(raises, "did not match"))
def has_additional(self, actual):
"""Return True if the value has additional data"""
r = self._compare(actual)
return r == ADDITIONAL or r == MIXED
def has_defaulted(self, actual):
"""Return True if the value has defaulted (missing) data"""
r = self._compare(actual)
return r == DEFAULTED or r == MIXED
def incompatible(self, actual):
"""Return True if the value is incompatible"""
return self._compare(actual) == INCOMPATIBLE
class _UndefMatcher(Value):
def _compare(self, actual):
return MATCHED # every value matches undef
class _BoolMatcher(Value):
def _compare(self, actual):
t = type(actual)
if t == NoneType:
return DEFAULTED
if t == bool:
return MATCHED
if t == int:
if actual == 0 or actual == 1:
return CONVERTED
else:
return INCOMPATIBLE
if t == float:
if actual == 0.0 or actual == 1.0:
return CONVERTED
else:
return INCOMPATIBLE
if t == str:
if actual == "" or actual == "true":
return CONVERTED
else:
return INCOMPATIBLE
return INCOMPATIBLE
class _TrueMatcher(Value):
def _compare(self, actual):
t = type(actual)
if t == NoneType:
return INCOMPATIBLE
if t == bool:
if actual:
return MATCHED
return INCOMPATIBLE
if t == int:
if actual == 1:
return CONVERTED
return INCOMPATIBLE
if t == float:
if actual == 1.0:
return CONVERTED
return INCOMPATIBLE
if t == str:
if actual == "true":
return CONVERTED
return INCOMPATIBLE
return INCOMPATIBLE
class _FalseMatcher(Value):
def _compare(self, actual):
t = type(actual)
if t == NoneType:
return DEFAULTED
if t == bool:
if not actual:
return MATCHED
return INCOMPATIBLE
if t == int:
if actual == 0:
return CONVERTED
return INCOMPATIBLE
if t == float:
if actual == 0.0:
return CONVERTED
return INCOMPATIBLE
if t == str:
if actual == "":
return CONVERTED
return INCOMPATIBLE
return INCOMPATIBLE
class _IntMatcher(Value):
def _compare(self, actual):
t = type(actual)
if t == NoneType:
return DEFAULTED
if t == bool:
return CONVERTED
if t == int:
return MATCHED
if t == float:
i = int(actual)
if actual == i and type(i) == int:
return CONVERTED
else:
return INCOMPATIBLE
if t == str:
try:
f = float(actual)
i = int(f)
if f == i and type(i) == int:
return CONVERTED
else:
return INCOMPATIBLE
except:
pass
if actual == "":
return DEFAULTED
return INCOMPATIBLE
return INCOMPATIBLE
class _NumberMatcher(Value):
def __init__(self, number):
self._number = int(number)
def _compare(self, actual):
n = 0
r = CONVERTED
t = type(actual)
if t == NoneType:
n = 0
r = DEFAULTED
elif t == bool:
n = actual and 1 or 0
r = CONVERTED
elif t == int:
n = actual
r = MATCHED
elif t == float:
n = int(actual)
r = CONVERTED
elif t == str:
try:
n = int(float(actual))
r = CONVERTED
except:
if actual == "":
n = 0
r = DEFAULTED
else:
return INCOMPATIBLE
else:
return INCOMPATIBLE
if n == self._number:
return r
return INCOMPATIBLE
class _RealMatcher(Value):
def _compare(self, actual):
t = type(actual)
if t == NoneType:
return DEFAULTED
if t == bool:
return CONVERTED
if t == int:
return CONVERTED
if t == float:
return MATCHED
if t == str:
try:
f = float(actual)
return CONVERTED
except:
pass
if actual == "":
return DEFAULTED
return INCOMPATIBLE
return INCOMPATIBLE
class _StringMatcher(Value):
def _compare(self, actual):
t = type(actual)
if t == NoneType:
return DEFAULTED
if t == str:
return MATCHED
if t == llsd.binary:
return INCOMPATIBLE
return CONVERTED
class _NameMatcher(Value):
def __init__(self, name):
self._name = str(name)
def _compare(self, actual):
t = type(actual)
if t == NoneType:
if self._name == "":
return DEFAULTED
return INCOMPATIBLE
if t == str:
if self._name == actual:
return MATCHED
return INCOMPATIBLE
return INCOMPATIBLE
class _DateMatcher(Value):
_dateRE = re.compile(r'\d\d\d\d-\d\d-\d\dT\d\d:\d\d:\d\d(.\d+)?Z');
def _compare(self, actual):
t = type(actual)
if t == NoneType:
return DEFAULTED
if t == str:
if self._dateRE.match(actual):
return CONVERTED
if actual == "":
return DEFAULTED
return INCOMPATIBLE
if t == datetime.datetime or t == datetime.date:
return MATCHED
return INCOMPATIBLE
class _UUIDMatcher(Value):
_uuidRE = re.compile(r'[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[0-9a-fA-F]{4}-[0-9a-fA-F]{4}-[0-9a-fA-F]{12}');
def _compare(self, actual):
t = type(actual)
if t == NoneType:
return DEFAULTED
if t == str:
if self._uuidRE.match(actual):
return CONVERTED
if actual == "":
return DEFAULTED
return INCOMPATIBLE
if t == uuid.UUID:
return MATCHED
return INCOMPATIBLE
class _URIMatcher(Value):
def _compare(self, actual):
t = type(actual)
if t == NoneType:
return DEFAULTED
if t == str:
if actual == "":
return DEFAULTED
return CONVERTED
if t == llsd.uri:
return MATCHED
return INCOMPATIBLE
class _BinaryMatcher(Value):
def _compare(self, actual):
t = type(actual)
if t == NoneType:
return DEFAULTED
if t == llsd.binary:
return MATCHED
return INCOMPATIBLE
def _roundup(value, multiple):
return value - 1 + (multiple - (value - 1) % multiple)
class _ArrayMatcher(Value):
def __init__(self, values, repeating):
self._values = values
self._repeating = repeating
def _set_suite(self, suite):
for v in self._values:
v._set_suite(suite)
def _variants_referenced(self):
s = set()
for v in self._values:
s |= v._variants_referenced()
return s
def _compare(self, actual):
if actual is None:
actual = []
if type(actual) != list:
return INCOMPATIBLE
r = MATCHED
vlen = len(self._values)
alen = len(actual)
tlen = vlen
if self._repeating:
tlen = _roundup(alen, vlen)
elif alen > vlen:
r &= ADDITIONAL
for i in xrange(0,tlen):
v = None
if i < alen:
v = actual[i]
r &= self._values[i%vlen]._compare(v)
return r
class _MapMatcher(Value):
def __init__(self, members):
self._members = members
def _set_suite(self, suite):
for v in self._members.itervalues():
v._set_suite(suite)
def _variants_referenced(self):
s = set()
for v in self._members.itervalues():
s |= v._variants_referenced()
return s
def _compare(self, actual):
if actual is None:
actual = {}
if type(actual) != dict:
return INCOMPATIBLE
r = MATCHED
for (name, value) in self._members.iteritems():
v = None
if name in actual:
v = actual[name]
r &= value._compare(v)
for name in actual.iterkeys():
if name not in self._members:
r &= ADDITIONAL
break
return r
class _DictMatcher(Value):
def __init__(self, value):
self._value = value
def _set_suite(self, suite):
self._value._set_suite(suite)
def _variants_referenced(self):
return self._value._variants_referenced()
def _compare(self, actual):
if actual is None:
actual = {}
if type(actual) != dict:
return INCOMPATIBLE
r = MATCHED
for v in actual.itervalues():
r &= self._value._compare(v)
return r
class _VariantMatcher(Value):
def __init__(self, name):
self._name = name
self._suite = None
def _set_suite(self, suite):
self._suite = suite
def _variants_referenced(self):
return set([self._name])
def _compare(self, actual):
if self._suite is None:
return INCOMPATIBLE
r = INCOMPATIBLE
for option in self._suite._get_variant_options(self._name):
r |= option._compare(actual)
return r
class Suite(object):
"""
A full suite of LLIDL resource descriptions
See Value.match() and Value.valid() for meanings of match and valid
tests, and the operation of the optional raises keyword argument.
"""
def __init__(self):
self._requests = { }
self._responses = { }
self._variants = { }
def _add_resource(self, name, request, response):
request._set_suite(self)
response._set_suite(self)
self._requests[name] = request
self._responses[name] = response
def _has_resource(self, name):
return name in self._requests
def _get_request(self, name):
try:
return self._requests[name]
except KeyError:
raise MatchError("Resource name '%s' not found in suite." % name)
def _get_response(self, name):
try:
return self._responses[name]
except KeyError:
raise MatchError("Resource name '%s' not found in suite." % name)
def _add_variant(self, name, value):
value._set_suite(self)
self._variants.setdefault(name, []).append(value)
def _get_variant_options(self, name):
return self._variants.get(name, [])
def _missing_variants(self):
refs = set()
for v in self._requests.itervalues():
refs |= v._variants_referenced()
for w in self._responses.itervalues():
refs |= w._variants_referenced()
return refs - set(self._variants.iterkeys())
def match_request(self, name, value, raises=None):
"""Compare an LLSD value to a resource's request description"""
return self._get_request(name).match(value, raises=raises)
def match_response(self, name, value, raises=None):
"""Compare an LLSD value to a resource's response description"""
return self._get_response(name).match(value, raises=raises)
def valid_request(self, name, value, raises=None):
"""Compare an LLSD value to a resource's request description"""
return self._get_request(name).valid(value, raises=raises)
def valid_response(self, name, value, raises=None):
"""Compare an LLSD value to a resource's response description"""
return self._get_response(name).valid(value, raises=raises)
class ParseError(Exception):
"""
An error encountered when parsing an LLIDL text.
Properties
* line - the line the error occurred on
* char - the character number on the line
"""
def __init__(self, msg, line, char):
Exception.__init__(self, line, msg)
self.line = line
self.char = char
def __str__(self):
return "line %d, char %d: %s" % (self.line, self.char,
Exception.__str__(self))
class _Parser(object):
def __init__(self, input):
if hasattr(input, "read"):
self._string = input.read()
input.close()
else:
self._string = input
self._offset = 0
self._line = 0
self._lineoffset = self._offset
def error(self, msg):
raise ParseError(msg, self._line + 1, self._offset - self._lineoffset + 1)
def required(self, r, message):
if r is not None:
return r;
self.error(message)
def parse_eof(self):
if self._offset == len(self._string):
return True
return None
def parse_literal(self, lit):
n = len(lit)
o = self._offset
if self._string[o:o+n] == lit:
self._offset = o + n
return lit
return None
def parse_re(self, re):
m = re.match(self._string, self._offset)
if m:
self._offset = m.end()
return m.group()
return None
_ws_re = re.compile(r'(\t| |;[^\n\r]*)*')
_nl_re = re.compile(r'\n|\r\n?')
def parse_s(self):
while True:
self.parse_re(self._ws_re)
if self.parse_re(self._nl_re):
self._line += 1
self._lineoffset = self._offset
else:
break
_number_re = re.compile(r'\d+')
def parseNumber(self):
return self.parse_re(self._number_re)
_name_re = re.compile(r'[a-zA-Z_](?:[a-zA-Z0-9_/]|-(?!>))*')
# Hyphen's are not legal inside names, but by including them here
# a very common error is caught and attributed to the name, rather than
# the next token. Note that "foo->" must be preserved as a legal parse.
def parseName(self):
n = self.parse_re(self._name_re)
if n and '-' in n:
self.error("malformed name: hyphen (-) not allowed")
return n
_typemap = {
'undef': _UndefMatcher(),
'bool': _BoolMatcher(),
'int': _IntMatcher(),
'real': _RealMatcher(),
'string': _StringMatcher(),
'date': _DateMatcher(),
'uuid': _UUIDMatcher(),
'uri': _URIMatcher(),
'binary': _BinaryMatcher(),
'true': _TrueMatcher(),
'false': _FalseMatcher()
}
_undefMatcher = _typemap['undef']
def _parse_rest_of_array(self):
self.parse_s()
values = []
repeating = False
while True:
v = self.parse_value()
if not v:
break
values.append(v)
self.parse_s()
if self.parse_literal(','):
self.parse_s()
else:
break
if self.parse_literal('...'):
repeating = True
self.parse_s()
self.required(self.parse_literal(']'), 'expected close bracket')
if not values:
self.error('empty array')
return _ArrayMatcher(values, repeating)
def _parse_rest_of_map(self):
self.parse_s()
if self.parse_literal('$'):
self.parse_s()
self.required(self.parse_literal(':'), 'expected colon')
self.parse_s()
value = self.required(self.parse_value(), 'expected value')
self.parse_s()
self.required(self.parse_literal('}'), 'expected close bracket')
return _DictMatcher(value)
members = { }
while True:
k = self.parseName()
if not k:
break
if k in members:
self.error('duplicate key in map')
self.parse_s()
self.required(self.parse_literal(':'), 'expected colon')
self.parse_s()
v = self.required(self.parse_value(), 'expected value')
members[k] = v
self.parse_s()
if self.parse_literal(','):
self.parse_s()
else:
break
self.required(self.parse_literal('}'), 'expected close bracket')
if not members:
self.error('empty map')
return _MapMatcher(members)
def parse_value(self):
if self.parse_literal('"'):
name = self.required(self.parseName(), 'expected name in quotes')
self.required(self.parse_literal('"'), 'expected close quote')
return _NameMatcher(name)
if self.parse_literal('['):
return self._parse_rest_of_array()
if self.parse_literal('{'):
return self._parse_rest_of_map()
if self.parse_literal('&'):
name = self.required(self.parseName(), 'expected variant name')
return _VariantMatcher(name)
number = self.parseNumber()
if number is not None:
return _NumberMatcher(number)
type_or_selector = self.parseName()
if type_or_selector is not None:
if type_or_selector in self._typemap:
return self._typemap[type_or_selector]
self.error('unknown type')
return None
def _parse_rest_of_post_resource(self):
self.parse_s()
req = self.required(self.parse_value(), 'expected request value')
self.parse_s()
self.required(self.parse_literal('<-'), 'expected result arrow')
self.parse_s()
res = self.required(self.parse_value(), 'expected result value')
return (req, res)
def _parse_rest_of_body_resource(self):
self.parse_s()
return self.required(self.parse_value(), 'expected body value')
def _parse_rest_of_get_resource(self):
body = self._parse_rest_of_body_resource()
return (self._undefMatcher, body)
def _parse_rest_of_put_resource(self):
body = self._parse_rest_of_body_resource()
return (body, self._undefMatcher)
def _parse_rest_of_getput_resource(self):
body = self._parse_rest_of_body_resource()
return (body, body)
def _parse_rest_of_getputdel_resource(self):
body = self._parse_rest_of_body_resource()
return (body, body)
def _parse_rest_of_resource(self, suite):
self.parse_s()
name = self.required(self.parseName(), 'expected resource name')
if suite._has_resource(name):
self.error('duplicate resource name')
self.parse_s()
if self.parse_literal('->'):
(req, res) = self._parse_rest_of_post_resource()
elif self.parse_literal('<<'):
(req, res) = self._parse_rest_of_get_resource()
elif self.parse_literal('>>'):
(req, res) = self._parse_rest_of_put_resource()
elif self.parse_literal('<>'):
(req, res) = self._parse_rest_of_getput_resource()
elif self.parse_literal('<x>'):
(req, res) = self._parse_rest_of_getputdel_resource()
else:
self.error('unknown resource type, expected ->, <<, >>, <> or <*>')
suite._add_resource(name, req, res)
def _parse_rest_of_variant(self, suite):
name = self.required(self.parseName(), 'expected variant name')
self.parse_s()
self.required(self.parse_literal('='), 'expected equals sign')
self.parse_s()
val = self.required(self.parse_value(), 'expected variant value')
suite._add_variant(name, val)
def parse_suite(self):
suite = Suite()
while True:
self.parse_s()
if self.parse_literal('%%'):
self._parse_rest_of_resource(suite)
elif self.parse_literal('&'):
self._parse_rest_of_variant(suite)
else:
break
missing = suite._missing_variants()
if missing:
self.error('missing definitions of variants: ' + ', '.join(missing))
return suite
def parse_value(spec):
"""Parse the LLIDL specification of a single value, return a Value"""
p = _Parser(spec)
r = p.required(p.parse_value(), 'expected value')
p.required(p.parse_eof(), 'expected end of input')
return r
def parse_suite(spec):
"""Parse a whole LLIDL suite, return a Suite"""
p = _Parser(spec)
s = p.required(p.parse_suite(), 'expected suite')
p.required(p.parse_eof(), 'expected end of input')
return s
|