blob: 4c35b822b40306e1db066d0e64d082ff14dad34d (
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
|
;;; test-lr-associativity-01.scm --
;;
;;Show how to use left and right associativity. Notice that the
;;terminal M is declared as non-associative; this influences the binding
;;of values to the $n symbols in the semantic clauses. The semantic
;;clause in the rule:
;;
;; (E M E M E) : (list $1 $2 (list $3 $4 $5))
;;
;;looks like it is right-associated, and it is because we have declared
;;M as "right:".
;;
(load "common-test.scm")
(define (doit . tokens)
(let ((parser (lalr-parser
(expect: 0)
(N (nonassoc: A)
(nonassoc: M))
(E (N) : $1
(E A E) : (list $1 $2 $3)
(E A E A E) : (list (list $1 $2 $3) $4 $5)
(E M E) : (list $1 $2 $3)
(E M E M E) : (list $1 $2 (list $3 $4 $5))))))
(parser (make-lexer tokens) error-handler)))
;;; --------------------------------------------------------------------
;;; Single operator.
(check
(doit (make-lexical-token 'N #f 1))
=> 1)
(check
(doit (make-lexical-token 'N #f 1)
(make-lexical-token 'A #f '+)
(make-lexical-token 'N #f 2))
=> '(1 + 2))
(check
(doit (make-lexical-token 'N #f 1)
(make-lexical-token 'M #f '*)
(make-lexical-token 'N #f 2))
=> '(1 * 2))
;;; --------------------------------------------------------------------
;;; Precedence.
(check
(doit (make-lexical-token 'N #f 1)
(make-lexical-token 'A #f '+)
(make-lexical-token 'N #f 2)
(make-lexical-token 'M #f '*)
(make-lexical-token 'N #f 3))
=> '(1 + (2 * 3)))
(check
(doit (make-lexical-token 'N #f 1)
(make-lexical-token 'M #f '*)
(make-lexical-token 'N #f 2)
(make-lexical-token 'A #f '+)
(make-lexical-token 'N #f 3))
=> '((1 * 2) + 3))
;;; --------------------------------------------------------------------
;;; Associativity.
(check
(doit (make-lexical-token 'N #f 1)
(make-lexical-token 'A #f '+)
(make-lexical-token 'N #f 2)
(make-lexical-token 'A #f '+)
(make-lexical-token 'N #f 3))
=> '((1 + 2) + 3))
(check
(doit (make-lexical-token 'N #f 1)
(make-lexical-token 'M #f '*)
(make-lexical-token 'N #f 2)
(make-lexical-token 'M #f '*)
(make-lexical-token 'N #f 3))
=> '(1 * (2 * 3)))
;;; end of file
|