mirror of
https://git.savannah.gnu.org/git/guile.git
synced 2025-04-29 19:30:36 +02:00
1b10152215
Taken from r51 of <http://lalr-scm.googlecode.com/svn/trunk>. * module/Makefile.am (SYSTEM_BASE_SOURCES): Add `system/base/lalr.scm'. (NOCOMP_SOURCES): Add `system/base/lalr.upstream.scm'. * module/system/base/lalr.scm, module/system/base/lalr.upstream.scm: New files. * test-suite/Makefile.am (LALR_TESTS, LALR_EXTRA, TESTS, TESTS_ENVIRONMENT): New variables. (EXTRA_DIST): Add $(LALR_EXTRA). * test-suite/lalr/common-test.scm, test-suite/lalr/glr-test.scm, test-suite/lalr/test-glr-associativity.scm, test-suite/lalr/test-glr-basics-01.scm, test-suite/lalr/test-glr-basics-02.scm, test-suite/lalr/test-glr-basics-03.scm, test-suite/lalr/test-glr-basics-04.scm, test-suite/lalr/test-glr-basics-05.scm, test-suite/lalr/test-glr-script-expression.scm, test-suite/lalr/test-glr-single-expressions.scm, test-suite/lalr/test-lr-associativity-01.scm, test-suite/lalr/test-lr-associativity-02.scm, test-suite/lalr/test-lr-associativity-03.scm, test-suite/lalr/test-lr-associativity-04.scm, test-suite/lalr/test-lr-basics-01.scm, test-suite/lalr/test-lr-basics-02.scm, test-suite/lalr/test-lr-basics-03.scm, test-suite/lalr/test-lr-basics-04.scm, test-suite/lalr/test-lr-basics-05.scm, test-suite/lalr/test-lr-error-recovery-01.scm, test-suite/lalr/test-lr-error-recovery-02.scm, test-suite/lalr/test-lr-no-clause.scm, test-suite/lalr/test-lr-script-expression.scm, test-suite/lalr/test-lr-single-expressions.scm: New files.
91 lines
2.3 KiB
Scheme
91 lines
2.3 KiB
Scheme
;;; test-lr-associativity-01.scm --
|
|
;;
|
|
;;Show how to use left and right associativity. Notice that the
|
|
;;terminal M is declared as right 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 (left: A)
|
|
(right: M)
|
|
(nonassoc: U))
|
|
(E (N) : $1
|
|
(E A E) : (list $1 $2 $3)
|
|
(E M E) : (list $1 $2 $3)
|
|
(E M E M E) : (list $1 $2 (list $3 $4 $5))
|
|
(A E (prec: U)) : (list '- $2)))))
|
|
(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))
|
|
|
|
(check
|
|
(doit (make-lexical-token 'A #f '-)
|
|
(make-lexical-token 'N #f 1))
|
|
=> '(- 1))
|
|
|
|
;;; --------------------------------------------------------------------
|
|
;;; 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
|