/usr/share/common-lisp/source/esrap/tests.lisp is in cl-esrap 20140826-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | ;;;; Copyright (c) 2007-2013 Nikodemus Siivola <nikodemus@random-state.net>
;;;; Copyright (c) 2012-2014 Jan Moringen <jmoringe@techfak.uni-bielefeld.de>
;;;;
;;;; 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 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.
(in-package :cl-user)
(defpackage :esrap-tests
(:use :alexandria :cl :esrap :fiveam)
(:shadowing-import-from :esrap "!")
(:export #:run-tests))
(in-package :esrap-tests)
(def-suite esrap)
(in-suite esrap)
(test defrule.check-expression
"Test expression checking in DEFRULE."
(macrolet ((is-invalid-expr (&body body)
`(signals invalid-expression-error ,@body)))
(is-invalid-expr (defrule foo '(~ 1)))
(is-invalid-expr (defrule foo '(string)))
(is-invalid-expr (defrule foo '(character-ranges 1)))
(is-invalid-expr (defrule foo '(character-ranges (#\a))))
(is-invalid-expr (defrule foo '(character-ranges (#\a #\b #\c))))
(is-invalid-expr (defrule foo '(and (string))))
(is-invalid-expr (defrule foo '(not)))
(is-invalid-expr (defrule foo '(foo)))
(is-invalid-expr (defrule foo '(function)))
(is-invalid-expr (defrule foo '(function foo bar)))
(is-invalid-expr (defrule foo '(function 1)))
(is-invalid-expr (defrule foo '(function (lambda (x) x))))))
(test defrule.ignore-declarations
"Test ignore declarations generated by DEFRULE."
(macrolet ((does-not-warn (condition-class &body body)
`(finishes
(handler-case (compile nil '(lambda () ,@body))
(,condition-class (condition)
(fail "Signaled an unexpected warning: ~A." condition))))))
(does-not-warn style-warning
(defrule foo (and)
(:function second)
(:lambda (x) (declare (ignore x)))))))
;;;; A few semantic predicates
(defun not-doublequote (char)
(not (eql #\" char)))
(defun not-digit (char)
(when (find-if-not #'digit-char-p char)
t))
(defun not-newline (char)
(not (eql #\newline char)))
(defun not-space (char)
(not (eql #\space char)))
;;;; Utility rules
(defrule whitespace (+ (or #\space #\tab #\newline))
(:text t))
(defrule empty-line #\newline
(:constant ""))
(defrule non-empty-line (and (+ (not-newline character)) (? #\newline))
(:destructure (text newline)
(declare (ignore newline))
(text text)))
(defrule line (or empty-line non-empty-line)
(:identity t))
(defrule trimmed-line line
(:lambda (line)
(string-trim '(#\space #\tab) line)))
(defrule trimmed-lines (* trimmed-line)
(:identity t))
(defrule digits (+ (digit-char-p character))
(:text t))
(defrule integer (and (? whitespace)
digits
(and (? whitespace) (or (& #\,) (! character))))
(:destructure (whitespace digits tail)
(declare (ignore whitespace tail))
(parse-integer digits)))
(defrule list-of-integers (+ (or (and integer #\, list-of-integers)
integer))
(:destructure (match)
(if (integerp match)
(list match)
(destructuring-bind (int comma list) match
(declare (ignore comma))
(cons int list)))))
(test smoke
(is (equal '(("1," "2," "" "3," "4.") nil t)
(multiple-value-list
(parse 'trimmed-lines "1,
2,
3,
4."))))
(is (equal '(123 nil t)
(multiple-value-list (parse 'integer " 123"))))
(is (equal '(123 nil t)
(multiple-value-list (parse 'integer " 123 "))))
(is (equal '(123 nil t)
(multiple-value-list (parse 'integer "123 "))))
(is (equal '((123 45 6789 0) nil t)
(multiple-value-list
(parse 'list-of-integers "123, 45 , 6789, 0"))))
(is (equal '((123 45 6789 0) nil t)
(multiple-value-list
(parse 'list-of-integers " 123 ,45,6789, 0 "))))
;; Ensure that parsing with :junk-allowed returns the correct
;; position.
(is (equal '(nil 1)
(multiple-value-list (parse 'list-of-integers " a"
:start 1 :junk-allowed t))))
;; Test successful parse that does not consume input. This case can
;; only be detected by examining the third return value.
(is (equal '(nil 1 t)
(multiple-value-list
(parse '(? list-of-integers) " a"
:start 1 :junk-allowed t)))))
(defrule single-token/bounds.1 (+ (not-space character))
(:lambda (result &bounds start end)
(format nil "~A[~S-~S]" (text result) start end)))
(defrule single-token/bounds.2 (and (not-space character) (* (not-space character)))
(:destructure (first &rest rest &bounds start end)
(format nil "~C~A(~S-~S)" first (text rest) start end)))
(defrule tokens/bounds.1 (and (? whitespace)
(or (and single-token/bounds.1 whitespace tokens/bounds.1)
single-token/bounds.1))
(:destructure (whitespace match)
(declare (ignore whitespace))
(if (stringp match)
(list match)
(destructuring-bind (token whitespace list) match
(declare (ignore whitespace))
(cons token list)))))
(defrule tokens/bounds.2 (and (? whitespace)
(or (and single-token/bounds.2 whitespace tokens/bounds.2)
single-token/bounds.2))
(:destructure (whitespace match)
(declare (ignore whitespace))
(if (stringp match)
(list match)
(destructuring-bind (token whitespace list) match
(declare (ignore whitespace))
(cons token list)))))
(test bounds.1
(is (equal '("foo[0-3]")
(parse 'tokens/bounds.1 "foo")))
(is (equal '("foo[0-3]" "bar[4-7]" "quux[11-15]")
(parse 'tokens/bounds.1 "foo bar quux"))))
(test bounds.2
(is (equal '("foo(0-3)")
(parse 'tokens/bounds.2 "foo")))
(is (equal '("foo(0-3)" "bar(4-7)" "quux(11-15)")
(parse 'tokens/bounds.2 "foo bar quux"))))
;;; Function terminals
(defun parse-integer1 (text position end)
(parse-integer text :start position :end end :junk-allowed t))
(defrule function-terminals.integer #'parse-integer1)
(test function-terminals.parse-integer
"Test using the function PARSE-INTEGER1 as a terminal."
(macrolet ((test-case (input expected
&optional
(expression ''function-terminals.integer))
`(is (equal ,expected (parse ,expression ,input)))))
(test-case "1" 1)
(test-case " 1" 1)
(test-case "-1" -1)
(test-case "-1" '(-1 nil)
'(and (? function-terminals.integer) (* character)))
(test-case "a" '(nil (#\a))
'(and (? function-terminals.integer) (* character)))))
(defun parse-5-as (text position end)
(let ((chars '())
(amount 0))
(dotimes (i 5)
(let ((char (when (< (+ position i) end)
(aref text (+ position i)))))
(unless (eql char #\a)
(return-from parse-5-as
(values nil (+ position i) "Expected \"a\".")))
(push char chars)
(incf amount)))
(values (nreverse chars) (+ position amount))))
(defrule function-terminals.parse-5-as #'parse-5-as)
(test function-terminals.parse-5-as.smoke
"Test using PARSE-A as a terminal."
(macrolet ((test-case (input expected
&optional (expression ''function-terminals.parse-5-as))
`(is (equal ,expected (parse ,expression ,input)))))
(test-case "aaaaa" '(#\a #\a #\a #\a #\a))
(test-case "b" '(nil "b") '(and (? function-terminals.parse-5-as) #\b))
(test-case "aaaaab" '((#\a #\a #\a #\a #\a) "b")
'(and (? function-terminals.parse-5-as) #\b))))
(test function-terminals.parse-5-as.condition
"Test using PARSE-A as a terminal."
(handler-case
(parse 'function-terminals.parse-5-as "aaaab")
(esrap-error (condition)
(is (eql 4 (esrap-error-position condition)))
(is (search "Expected \"a\"." (princ-to-string condition))))))
(defun function-terminals.nested-parse (text position end)
(parse '(and #\d function-terminals.nested-parse)
text :start position :end end :junk-allowed t))
(defrule function-terminals.nested-parse
(or (and #'function-terminals.nested-parse #\a)
(and #\b #'function-terminals.nested-parse)
#\c))
(test function-terminals.nested-parse
"Test a function terminal which itself calls PARSE."
(parse 'function-terminals.nested-parse "bddca"))
(test function-terminals.nested-parse.condition
"Test propagation of failure information through function terminals."
(signals esrap-error (parse 'function-terminals.nested-parse "bddxa")))
(defun function-terminals.without-consuming (text position end)
(declare (ignore end))
(if (char= (aref text position) #\a)
(values :ok position t)
(values nil position "\"a\" expected")))
(test function-terminals.without-consuming
"Test that function terminals can succeed without consuming input."
(is (equal '((:ok "a") nil t)
(multiple-value-list
(parse '(and #'function-terminals.without-consuming #\a) "a"))))
(is (equal '(((:ok "a" :ok) (:ok "a" :ok)) 2 t)
(multiple-value-list
(parse '(+ (and #'function-terminals.without-consuming #\a
#'function-terminals.without-consuming))
"aaab" :junk-allowed t)))))
;;; Left recursion tests
(defun make-input-and-expected-result (size)
(labels ((make-expected (size)
(if (plusp size)
(list (make-expected (1- size)) "l")
"r")))
(let ((expected (make-expected size)))
(values (apply #'concatenate 'string (flatten expected)) expected))))
(defrule left-recursion.direct
(or (and left-recursion.direct #\l) #\r))
(test left-recursion.direct.success
"Test parsing with one left recursive rule for different inputs."
(dotimes (i 20)
(multiple-value-bind (input expected)
(make-input-and-expected-result i)
(is (equal expected (parse 'left-recursion.direct input))))))
(test left-recursion.direct.condition
"Test signaling of `left-recursion' condition if requested."
(let ((*on-left-recursion* :error))
(signals (left-recursion)
(parse 'left-recursion.direct "l"))
(handler-case (parse 'left-recursion.direct "l")
(left-recursion (condition)
(is (string= (esrap-error-text condition) "l"))
(is (= (esrap-error-position condition) 0))
(is (eq (left-recursion-nonterminal condition)
'left-recursion.direct))
(is (equal (left-recursion-path condition)
'(left-recursion.direct
left-recursion.direct)))))))
(defrule left-recursion.indirect.1 left-recursion.indirect.2)
(defrule left-recursion.indirect.2 (or (and left-recursion.indirect.1 "l") "r"))
(test left-recursion.indirect.success
"Test parsing with mutually left recursive rules for different
inputs."
(dotimes (i 20)
(multiple-value-bind (input expected)
(make-input-and-expected-result i)
(is (equal expected (parse 'left-recursion.indirect.1 input)))
(is (equal expected (parse 'left-recursion.indirect.2 input))))))
(test left-recursion.indirect.condition
"Test signaling of `left-recursion' condition if requested."
(let ((*on-left-recursion* :error))
(signals (left-recursion)
(parse 'left-recursion.indirect.1 "l"))
(handler-case (parse 'left-recursion.indirect.1 "l")
(left-recursion (condition)
(is (string= (esrap-error-text condition) "l"))
(is (= (esrap-error-position condition) 0))
(is (eq (left-recursion-nonterminal condition)
'left-recursion.indirect.1))
(is (equal (left-recursion-path condition)
'(left-recursion.indirect.1
left-recursion.indirect.2
left-recursion.indirect.1)))))))
;;; Test conditions
(declaim (special *active*))
(defvar *active* nil)
(defrule maybe-active "foo"
(:when *active*))
(test condition.1
"Test signaling of `esrap-simple-parse-error' conditions for failed
parses."
(macrolet
((signals-esrap-error ((input position &optional messages) &body body)
(once-only (position)
`(flet ((do-it () ,@body))
(signals (esrap-error)
(do-it))
(handler-case (do-it)
(esrap-error (condition)
(is (string= (esrap-error-text condition) ,input))
(when ,position
(is (= (esrap-error-position condition) ,position)))
,@(when messages
`((let ((report (princ-to-string condition)))
(mapcar (lambda (message)
(is (search message report)))
(list ,@(ensure-list messages))))))))))))
;; Rule does not allow empty string.
(signals-esrap-error ("" 0 ("Could not parse subexpression"
"Encountered at"))
(parse 'integer ""))
;; Junk at end of input.
(signals-esrap-error ("123foo" 3 ("Could not parse subexpression"
"Encountered at"))
(parse 'integer "123foo"))
;; Whitespace not allowed.
(signals-esrap-error ("1, " 1 ("Incomplete parse."
"Encountered at"))
(parse 'list-of-integers "1, "))
;; Rule not active at toplevel.
(signals-esrap-error ("foo" nil ("Rule" "not active"))
(parse 'maybe-active "foo"))
;; Rule not active at subexpression-level.
(signals-esrap-error ("ffoo" 1 ("Could not parse subexpression"
"(not active)"
"Encountered at"))
(parse '(and "f" maybe-active) "ffoo"))
;; Failing function terminal.
(signals-esrap-error ("(1 2" 0 ("FUNCTION-TERMINALS.INTEGER"
"Encountered at"))
(parse 'function-terminals.integer "(1 2"))))
(test parse.string
"Test parsing an arbitrary string of a given length."
(is (equal "" (parse '(string 0) "")))
(is (equal "aa" (parse '(string 2) "aa")))
(signals esrap-error (parse '(string 0) "a"))
(signals esrap-error (parse '(string 2) "a"))
(signals esrap-error (parse '(string 2) "aaa")))
(test parse.case-insensitive
"Test parsing an arbitrary string of a given length."
(dolist (input '("aabb" "AABB" "aAbB" "aaBB" "AAbb"))
(unless (every #'lower-case-p input)
(signals esrap-error (parse '(* (or #\a #\b)) input)))
(is (equal "aabb" (text (parse '(* (or (~ #\a) (~ #\b))) input))))
(is (equal "AABB" (text (parse '(* (or (~ #\A) (~ #\B))) input))))
(is (equal "aaBB" (text (parse '(* (or (~ #\a) (~ #\B))) input))))))
(test parse.negation
"Test negation in rules."
(let* ((text "FooBazBar")
(t1c (text (parse '(+ (not "Baz")) text :junk-allowed t)))
(t1e (text (parse (identity '(+ (not "Baz"))) text :junk-allowed t)))
(t2c (text (parse '(+ (not "Bar")) text :junk-allowed t)))
(t2e (text (parse (identity '(+ (not "Bar"))) text :junk-allowed t)))
(t3c (text (parse '(+ (not (or "Bar" "Baz"))) text :junk-allowed t)))
(t3e (text (parse (identity '(+ (not (or "Bar" "Baz")))) text :junk-allowed t))))
(is (equal "Foo" t1c))
(is (equal "Foo" t1e))
(is (equal "FooBaz" t2c))
(is (equal "FooBaz" t2e))
(is (equal "Foo" t3c))
(is (equal "Foo" t3e))))
;;; Test around
(declaim (special *depth*))
(defvar *depth* nil)
(defrule around/inner
(+ (alpha-char-p character))
(:text t))
(defrule around.1
(or around/inner
(and #\{ around.1 #\}))
(:lambda (thing)
(if (stringp thing)
(cons *depth* thing)
(second thing)))
(:around ()
(let ((*depth* (if *depth*
(cons (1+ (first *depth*)) *depth*)
(list 0))))
(call-transform))))
(defrule around.2
(or around/inner
(and #\{ around.2 #\}))
(:lambda (thing)
(if (stringp thing)
(cons *depth* thing)
(second thing)))
(:around (&bounds start end)
(let ((*depth* (if *depth*
(cons (cons (1+ (car (first *depth*))) (cons start end))
*depth*)
(list (cons 0 (cons start end))))))
(call-transform))))
(test around.1
"Test executing code around the transform of a rule."
(macrolet ((test-case (input expected)
`(is (equal (parse 'around.1 ,input) ,expected))))
(test-case "foo" '((0) . "foo"))
(test-case "{bar}" '((1 0) . "bar"))
(test-case "{{baz}}" '((2 1 0) . "baz"))))
(test around.2
"Test executing code around the transform of a rule."
(macrolet ((test-case (input expected)
`(is (equal (parse 'around.2 ,input) ,expected))))
(test-case "foo" '(((0 . (0 . 3)))
. "foo"))
(test-case "{bar}" '(((1 . (1 . 4))
(0 . (0 . 5)))
. "bar"))
(test-case "{{baz}}" '(((2 . (2 . 5))
(1 . (1 . 6))
(0 . (0 . 7)))
. "baz"))))
;;; Test character ranges
(defrule character-range (character-ranges (#\a #\b) #\-))
(test character-range
(is (equal '(#\a #\b) (parse '(* (character-ranges (#\a #\z) #\-)) "ab" :junk-allowed t)))
(is (equal '(#\a #\b) (parse '(* (character-ranges (#\a #\z) #\-)) "ab1" :junk-allowed t)))
(is (equal '(#\a #\b #\-) (parse '(* (character-ranges (#\a #\z) #\-)) "ab-" :junk-allowed t)))
(is (not (parse '(* (character-ranges (#\a #\z) #\-)) "AB-" :junk-allowed t)))
(is (not (parse '(* (character-ranges (#\a #\z) #\-)) "ZY-" :junk-allowed t)))
(is (equal '(#\a #\b #\-) (parse '(* character-range) "ab-cd" :junk-allowed t))))
;;; Test multiple transforms
(defrule multiple-transforms.1
(and #\a #\1 #\c)
(:function second)
(:text t)
(:function parse-integer))
(test multiple-transforms.1
"Apply composed transforms to parse result."
(is (eql (parse 'multiple-transforms.1 "a1c") 1)))
(test multiple-transforms.invalid
"Test DEFRULE's behavior for invalid transforms."
(dolist (form '((defrule multiple-transforms.2 #\1
(:text t)
(:lambda (x &bounds start end)
(parse-integer x)))
(defrule multiple-transforms.3 #\1
(:text t)
(:lambda (x &bounds start)
(parse-integer x)))))
(signals simple-error (macroexpand-1 form))))
;; Test README examples
(test examples-from-readme.foo
"README examples related to \"foo+\" rule."
(is (equal '("foo" nil t)
(multiple-value-list (parse '(or "foo" "bar") "foo"))))
(is (eq 'foo+ (add-rule 'foo+
(make-instance 'rule :expression '(+ "foo")))))
(is (equal '(("foo" "foo" "foo") nil t)
(multiple-value-list (parse 'foo+ "foofoofoo")))))
(test examples-from-readme.decimal
"README examples related to \"decimal\" rule."
(is (eq 'decimal
(add-rule
'decimal
(make-instance
'rule
:expression `(+ (or "0" "1" "2" "3" "4" "5" "6" "7" "8" "9"))
:transform (lambda (list start end)
(declare (ignore start end))
(parse-integer (format nil "~{~A~}" list)))))))
(is (eql 123 (parse '(oddp decimal) "123")))
(is (equal '(nil 0) (multiple-value-list
(parse '(evenp decimal) "123" :junk-allowed t)))))
;;; Examples in separate files
(test example-left-recursion.left-associative
"Left associate grammar from example-left-recursion.lisp."
;; This grammar should work without left recursion.
(let ((*on-left-recursion* :error))
(is (equal (parse 'left-recursive-grammars:la-expr "1*2+3*4+5")
'(+ (* 1 2) (+ (* 3 4) 5))))))
(test example-left-recursion.right-associative
"Right associate grammar from example-left-recursion.lisp."
;; This grammar combination of grammar and input would require left
;; recursion.
(let ((*on-left-recursion* :error))
(signals left-recursion
(parse 'left-recursive-grammars:ra-expr "1*2+3*4+5")))
(is (equal (parse 'left-recursive-grammars:ra-expr "1*2+3*4+5")
'(+ (+ (* 1 2) (* 3 4)) 5))))
(test example-left-recursion.warth
"Warth's Java expression example from example-left-recursion.lisp."
(mapc
(curry #'apply
(lambda (input expected)
(is (equal expected
(parse 'left-recursive-grammars:primary input)))))
'(("this" "this")
("this.x" (:field-access "this" "x"))
("this.x.y" (:field-access (:field-access "this" "x") "y"))
("this.x.m()" (:method-invocation (:field-access "this" "x") "m"))
("x[i][j].y" (:field-access (:array-access (:array-access "x" "i") "j") "y")))))
(test example-function-terminals.indented-block
"Context-sensitive parsing via function terminals."
(is (equal '("foo" "bar" "quux"
(if "foo"
("bla"
(if "baz"
("bli" "blo")
("whoop"))))
"blu")
(parse 'esrap-example.function-terminals:indented-block
" foo
bar
quux
if foo:
bla
if baz:
bli
blo
else:
whoop
blu
"))))
(test example-function-terminals.read.smoke
"Using CL:READ as a terminal."
(macrolet ((test-case (input expected)
`(is (equal ,expected
(with-standard-io-syntax
(parse 'esrap-example.function-terminals:common-lisp
,input))))))
(test-case "(1 2 3)" '(1 2 3))
(test-case "foo" 'cl-user::foo)
(test-case "#C(1 3/4)" #C(1 3/4))))
(test example-function-terminals.read.condition
"Test error reporting in the CL:READ-based rule"
(handler-case
(with-standard-io-syntax
(parse 'esrap-example.function-terminals:common-lisp
"(list 'i :::love 'lisp"))
(esrap-error (condition)
;; Different readers may report this differently.
(is (<= 9 (esrap-error-position condition) 16))
;; Not sure how other lists report this.
#+sbcl (is (search "too many colons"
(princ-to-string condition))))))
;;; Test runner
(defun run-tests ()
(run! 'esrap))
|