-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathmath-led.el
More file actions
66 lines (58 loc) · 2.35 KB
/
math-led.el
File metadata and controls
66 lines (58 loc) · 2.35 KB
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
(require 'math-util)
;; `led' parse methods.
;;
;; A symbol's `led' parse methhod is applied for all symbols read by
;; parse expression except the first symbol. This should only occur
;; when symbol is the second or later symbol in a production for
;; expression.
;;
;; The `led' method is passed the left expression and the current
;; token and returns an expressions.
;; Parse `expr1 operator expr2' --> (operator expr1 expr2)
;; token: operator (left associative)
(defun math-parse-led-left (l-expr token)
(let* ((name (math-token-led-name token))
(head (if name name (math-token-source token)))
(r-expr (math-p--parse-expression (math-token-led-bp token))))
`(,head
,l-expr
,r-expr)))
;; Parse `expr1 operator expr2' --> (operator expr1 expr2)
;; token: operator (right associative)
(defun math-parse-led-right (l-expr token)
(let* ((name (math-token-led-name token))
(head (if name name (math-token-source token)))
(r-expr (math-p--parse-expression (- (math-token-led-bp token) 1))))
`(,head
,l-expr
,r-expr)))
;; Parse `name[expr1,expr2,...]' --> (name expr1 expr2 ...).
;; token: `['
;; requirement: left expression should be a name.
(defun math-parse-led-sequence (l-expr token)
(let ((sequence `(,l-expr)))
(while (math-p--continue-until "]")
(math-append-to-list sequence (math-p--parse-expression 0))
(math-append-to-list sequence (math-p--separators-or-closers "," "]")))
(math-append-to-list sequence (math-p--closers "]"))))
;; Parse `expr1 operator expr2 ...' --> (operator expr1 expr2 ...)
;; token: operator
;;
;; This is used to parse flat operators, i.e. operators that have a
;; variable number of expressions.
;; (defun math-parse-led-flat (l-expr token)
;; (let ((r-expr (math-p--parse-expression (math-token-led-bp token))))
;; (let ((expressions `(,(math-token-led-name token) ,l-expr ,r-expr)))
;; (while (equal (math-token-id math-p--tok) (math-token-id token))
;; (math-p--advance-token)
;; (math-append-to-list expressions (math-p--parse-expression (math-token-led-bp token))))
;; expressions)))
;; Parse `expr1 operator' --> (operator expr1)
;; token: operator
;;
;; This is used to parse a postfix operator.
(defun math-parse-led-postfix (l-expr token)
(let* ((name (math-token-led-name token))
(head (if name name (math-token-source token))))
`(,head ,l-expr)))
(provide 'math-led)