File size: 2,422 Bytes
3dcad1f |
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 |
;;; test-glr-associativity.scm
;;
;;With the GLR parser both the terminal precedence and the non-terminal
;;associativity are not respected; rather they generate two child
;;processes.
;;
(load "common-test.scm")
(define parser
(lalr-parser
(driver: glr)
(expect: 0)
(N LPAREN RPAREN
(left: + -)
(right: * /)
(nonassoc: uminus))
(output (expr) : $1)
(expr (expr + expr) : (list $1 '+ $3)
(expr - expr) : (list $1 '- $3)
(expr * expr) : (list $1 '* $3)
(expr / expr) : (list $1 '/ $3)
(- expr (prec: uminus)) : (list '- $2)
(N) : $1
(LPAREN expr RPAREN) : $2)))
(define (doit . tokens)
(parser (make-lexer tokens) error-handler))
;;; --------------------------------------------------------------------
;;Remember that the result of the GLR driver is a list of parses, not a
;;single parse.
(check
(doit (make-lexical-token 'N #f 1))
=> '(1))
(check
(doit (make-lexical-token 'N #f 1)
(make-lexical-token '+ #f '+)
(make-lexical-token 'N #f 2))
=> '((1 + 2)))
(check
(doit (make-lexical-token 'N #f 1)
(make-lexical-token '* #f '*)
(make-lexical-token 'N #f 2))
=> '((1 * 2)))
(check
(doit (make-lexical-token '- #f '-)
(make-lexical-token 'N #f 1))
=> '((- 1)))
(check
(doit (make-lexical-token '- #f '-)
(make-lexical-token '- #f '-)
(make-lexical-token 'N #f 1))
=> '((- (- 1))))
(check
(doit (make-lexical-token 'N #f 1)
(make-lexical-token '+ #f '+)
(make-lexical-token '- #f '-)
(make-lexical-token 'N #f 2))
=> '((1 + (- 2))))
;;; --------------------------------------------------------------------
(check
;;left-associativity
(doit (make-lexical-token 'N #f 1)
(make-lexical-token '+ #f '+)
(make-lexical-token 'N #f 2)
(make-lexical-token '+ #f '+)
(make-lexical-token 'N #f 3))
=> '(((1 + 2) + 3)))
(check
;;right-associativity
(doit (make-lexical-token 'N #f 1)
(make-lexical-token '* #f '*)
(make-lexical-token 'N #f 2)
(make-lexical-token '* #f '*)
(make-lexical-token 'N #f 3))
=> '(((1 * 2) * 3)
(1 * (2 * 3))))
(check
;;precedence
(doit (make-lexical-token 'N #f 1)
(make-lexical-token '+ #f '+)
(make-lexical-token 'N #f 2)
(make-lexical-token '* #f '*)
(make-lexical-token 'N #f 3))
=> '(((1 + 2) * 3)
(1 + (2 * 3))))
;;; end of file
|