[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[elpa] externals/parser-generator c886537 311/434: Using references for
|
From: |
ELPA Syncer |
|
Subject: |
[elpa] externals/parser-generator c886537 311/434: Using references for distinct goto-tables to optimize memory usage |
|
Date: |
Mon, 29 Nov 2021 16:00:04 -0500 (EST) |
branch: externals/parser-generator
commit c8865371a5134d18076ed6fed51fc80260935a17
Author: Christian Johansson <christian@cvj.se>
Commit: Christian Johansson <christian@cvj.se>
Using references for distinct goto-tables to optimize memory usage
---
parser-generator-lr.el | 585 +++++++++++++++++++++------------------
test/parser-generator-lr-test.el | 29 +-
2 files changed, 328 insertions(+), 286 deletions(-)
diff --git a/parser-generator-lr.el b/parser-generator-lr.el
index 3cb22fe..cbf2115 100644
--- a/parser-generator-lr.el
+++ b/parser-generator-lr.el
@@ -22,14 +22,19 @@
"Action-tables for grammar.")
(defvar
- parser-generator-lr--goto-tables
+ parser-generator-lr--distinct-action-tables
nil
- "Goto-tables for grammar.")
+ "Distinct action-tables for grammar.")
+
+(defvar
+ parser-generator-lr--distinct-goto-tables
+ nil
+ "Distinct goto-tables.")
(defvar
- parser-generator-lr--table-lr-items-for-symbol
+ parser-generator-lr--goto-tables
nil
- "LR-items cache for symbol.")
+ "Goto-tables for grammar.")
;; Main Algorithms
@@ -37,9 +42,6 @@
(defun parser-generator-lr-generate-parser-tables ()
"Generate parsing tables for grammar."
(message "\nStarting generation of parser-tables..\n")
- (setq
- parser-generator-lr--table-lr-items-for-symbol
- (make-hash-table :test 'equal))
(let ((table-lr-items
(parser-generator-lr--generate-goto-tables)))
(parser-generator-lr--generate-action-tables
@@ -47,16 +49,35 @@
(message "\nCompleted generation of parser-tables.\n")
table-lr-items))
+(defun parser-generator-lr--get-expanded-goto-tables ()
+ "Get expanded GOTO-tables."
+ (let ((distinct-indexes
+ (parser-generator--hash-to-list
+ parser-generator-lr--goto-tables))
+ (goto-tables))
+ (dolist (goto-row distinct-indexes)
+ (let ((goto-index (car goto-row))
+ (distinct-index (car (cdr goto-row))))
+ (push
+ `(,goto-index . (,(gethash
+ distinct-index
+ parser-generator-lr--distinct-goto-tables)))
+ goto-tables)))
+ (reverse goto-tables)))
+
;; Algorithm 5.11, p. 393
(defun parser-generator-lr--generate-action-tables (table-lr-items)
"Generate action-tables for lr-grammar based on TABLE-LR-ITEMS."
(message "\nStarting generation of action-tables..\n")
(let ((action-tables)
- (states '(shift reduce error))
- (added-actions (make-hash-table :test 'equal))
+ (states
+ '(shift reduce error))
+ (added-actions
+ (make-hash-table :test 'equal))
(goto-tables
(parser-generator--hash-to-list
- parser-generator-lr--goto-tables))
+ parser-generator-lr--goto-tables
+ t))
(found-accept))
(dolist (goto-table goto-tables)
(let ((goto-index (car goto-table))
@@ -76,7 +97,9 @@
(while (and
(< lr-item-index lr-items-length)
continue-loop)
- (setq lr-item (nth lr-item-index lr-items))
+ (setq
+ lr-item
+ (nth lr-item-index lr-items))
(cond
((eq state 'shift)
@@ -155,8 +178,12 @@
`(,parser-generator--eof-identifier)))
;; An extra column for '$'
(end of input) is added to the action table that contains acc for every item
set that contains an item of the form S → w • eof.
(progn
- (push (list eff-item
'accept) action-table)
- (setq found-accept t))
+ (push
+ (list eff-item 'accept)
+ action-table)
+ (setq
+ found-accept
+ t))
(push
(list
eff-item
@@ -172,7 +199,9 @@
eff-item)))
(setq eff-index (1+ eff-index))))
(parser-generator--debug
- (message "E-FREE-FIRST is empty for %s"
Cv)))))))))
+ (message
+ "E-FREE-FIRST is empty for %s"
+ Cv)))))))))
((eq state 'reduce)
;; (b) f(u) = reduce i if [A -> B ., u] is in a and A -> B
is production i in P, i > 1
@@ -502,13 +531,46 @@
(setq
parser-generator-lr--goto-tables
(make-hash-table :test 'equal))
+ (setq
+ parser-generator-lr--distinct-goto-tables
+ (make-hash-table :test 'equal))
(let ((table-length (length goto-table))
- (table-index 0))
+ (table-index 0)
+ (distinct-goto-table-index 0)
+ (table-goto-table-to-index (make-hash-table :test 'equal)))
(while (< table-index table-length)
- (puthash
- table-index
- (car (cdr (nth table-index goto-table)))
- parser-generator-lr--goto-tables)
+ (let
+ ((goto-table
+ (car (cdr (nth table-index goto-table)))))
+ (let
+ ((goto-table-hash-key
+ (format
+ "%S"
+ goto-table)))
+ (unless
+ (gethash
+ goto-table-hash-key
+ table-goto-table-to-index)
+ (puthash
+ goto-table-hash-key
+ distinct-goto-table-index
+ table-goto-table-to-index)
+ (puthash
+ distinct-goto-table-index
+ goto-table
+ parser-generator-lr--distinct-goto-tables)
+ (setq
+ distinct-goto-table-index
+ (1+ distinct-goto-table-index)))
+ (let
+ ((goto-table-index
+ (gethash
+ goto-table-hash-key
+ table-goto-table-to-index)))
+ (puthash
+ table-index
+ goto-table-index
+ parser-generator-lr--goto-tables))))
(setq table-index (1+ table-index))))
;; (parser-generator-lr--items-valid-p
@@ -819,205 +881,185 @@
(defun parser-generator-lr--items-for-goto (previous-lr-item x)
"Calculate LR-items for GOTO(PREVIOUS-LR-ITEM, X)."
- (let ((lr-items-cache-key
- (format
- "%S-%S"
- previous-lr-item
- x)))
- (unless
- parser-generator-lr--table-lr-items-for-symbol
+ (let ((lr-new-item)
+ (lr-item-exists
+ (make-hash-table :test 'equal))
+ (eof-list
+ (parser-generator--generate-list-of-symbol
+ parser-generator--look-ahead-number
+ parser-generator--eof-identifier)))
+ (parser-generator--debug
+ (message "x: %s" x))
+
+ ;; TODO Use caches to optimize this loop
+ (dolist (lr-item previous-lr-item)
+ (let ((lr-item-lhs (nth 0 lr-item))
+ (lr-item-prefix (nth 1 lr-item))
+ (lr-item-suffix (nth 2 lr-item))
+ (lr-item-look-ahead (nth 3 lr-item))
+ (lr-item-suffix-first)
+ (lr-item-suffix-rest))
(setq
- parser-generator-lr--table-lr-items-for-symbol
- (make-hash-table :test 'equal)))
- (if (gethash
- lr-items-cache-key
- parser-generator-lr--table-lr-items-for-symbol)
- (message "Cache-hit")
- (let ((lr-new-item)
- (lr-item-exists
- (make-hash-table :test 'equal))
- (eof-list
- (parser-generator--generate-list-of-symbol
- parser-generator--look-ahead-number
- parser-generator--eof-identifier)))
+ lr-item-suffix-first
+ (car lr-item-suffix))
+ (setq
+ lr-item-suffix-rest
+ (cdr lr-item-suffix))
+
(parser-generator--debug
- (message "x: %s" x))
-
- ;; TODO Use caches to optimize this loop
- (dolist (lr-item previous-lr-item)
- (let ((lr-item-lhs (nth 0 lr-item))
- (lr-item-prefix (nth 1 lr-item))
- (lr-item-suffix (nth 2 lr-item))
- (lr-item-look-ahead (nth 3 lr-item))
- (lr-item-suffix-first)
- (lr-item-suffix-rest))
- (setq
+ (message "lr-item: %s" lr-item)
+ (message "lr-item-prefix: %s" lr-item-prefix)
+ (message "lr-item-suffix: %s" lr-item-suffix)
+ (message "lr-item-suffix-first: %s" lr-item-suffix-first)
+ (message "lr-item-suffix-rest: %s" lr-item-suffix-rest)
+ (message "lr-item-look-ahead: %s" lr-item-look-ahead))
+
+ ;; (a) If [A -> a . XiB, u] is in V(X1,...,Xi-1)
+ (when
+ (equal
lr-item-suffix-first
- (car lr-item-suffix))
- (setq
- lr-item-suffix-rest
- (cdr lr-item-suffix))
-
- (parser-generator--debug
- (message "lr-item: %s" lr-item)
- (message "lr-item-prefix: %s" lr-item-prefix)
- (message "lr-item-suffix: %s" lr-item-suffix)
- (message "lr-item-suffix-first: %s" lr-item-suffix-first)
- (message "lr-item-suffix-rest: %s" lr-item-suffix-rest)
- (message "lr-item-look-ahead: %s" lr-item-look-ahead))
-
- ;; (a) If [A -> a . XiB, u] is in V(X1,...,Xi-1)
- (when
- (equal
- lr-item-suffix-first
- x)
-
- ;; Add [A -> aXi . B, u] to V(X1,...,Xi)
- (let ((combined-prefix
- (append
- lr-item-prefix
- (list x))))
- (let ((lr-new-item-1))
- (if
- (=
- parser-generator--look-ahead-number
- 0)
- ;; Only k >= 1 needs dot look-ahead
- (progn
- (setq
- lr-new-item-1
- `(,lr-item-lhs
- ,combined-prefix
- ,lr-item-suffix-rest)))
+ x)
+
+ ;; Add [A -> aXi . B, u] to V(X1,...,Xi)
+ (let ((combined-prefix
+ (append
+ lr-item-prefix
+ (list x))))
+ (let ((lr-new-item-1))
+ (if
+ (=
+ parser-generator--look-ahead-number
+ 0)
+ ;; Only k >= 1 needs dot look-ahead
+ (progn
(setq
lr-new-item-1
`(,lr-item-lhs
,combined-prefix
- ,lr-item-suffix-rest
- ,lr-item-look-ahead)))
- (parser-generator--debug
- (message
- "lr-new-item-1: %s"
- lr-new-item-1))
- (push
- lr-new-item-1
- lr-new-item))))))
-
- ;; (c) Repeat step (2b) until no more new items can be added to
V(X1,...,Xi)
- (when lr-new-item
- (let ((added-new t))
- (while added-new
- (setq added-new nil)
-
- ;; TODO Use caches to optimize this loop
- (dolist (lr-item lr-new-item)
- (let ((lr-item-suffix (nth 2 lr-item)))
- (let ((lr-item-suffix-first
- (car lr-item-suffix))
- (lr-item-suffix-rest
- (append
- (cdr lr-item-suffix)
- (nth 3 lr-item))))
+ ,lr-item-suffix-rest)))
+ (setq
+ lr-new-item-1
+ `(,lr-item-lhs
+ ,combined-prefix
+ ,lr-item-suffix-rest
+ ,lr-item-look-ahead)))
+ (parser-generator--debug
+ (message
+ "lr-new-item-1: %s"
+ lr-new-item-1))
+ (push
+ lr-new-item-1
+ lr-new-item))))))
+
+ ;; (c) Repeat step (2b) until no more new items can be added to
V(X1,...,Xi)
+ (when lr-new-item
+ (let ((added-new t))
+ (while added-new
+ (setq added-new nil)
+
+ ;; TODO Use caches to optimize this loop
+ (dolist (lr-item lr-new-item)
+ (let ((lr-item-suffix (nth 2 lr-item)))
+ (let ((lr-item-suffix-first
+ (car lr-item-suffix))
+ (lr-item-suffix-rest
+ (append
+ (cdr lr-item-suffix)
+ (nth 3 lr-item))))
+ (parser-generator--debug
+ (message
+ "lr-item-suffix-rest: %s from %s + %s"
+ lr-item-suffix-rest
+ (cdr lr-item-suffix)
+ (nth 3 lr-item)))
+
+ ;; (b) If [A -> a . Bb, u] has been placed in V(X1,...,Xi)
+ ;; and B -> D is in P
+ (when
+ (parser-generator--valid-non-terminal-p
+ lr-item-suffix-first)
+
+ (let ((lr-item-suffix-rest-first
+ (parser-generator--first
+ lr-item-suffix-rest
+ nil
+ t
+ t)))
(parser-generator--debug
(message
- "lr-item-suffix-rest: %s from %s + %s"
- lr-item-suffix-rest
- (cdr lr-item-suffix)
- (nth 3 lr-item)))
+ "lr-item-suffix-rest-first (before): %s"
+ lr-item-suffix-rest-first))
- ;; (b) If [A -> a . Bb, u] has been placed in V(X1,...,Xi)
- ;; and B -> D is in P
- (when
- (parser-generator--valid-non-terminal-p
- lr-item-suffix-first)
-
- (let ((lr-item-suffix-rest-first
- (parser-generator--first
- lr-item-suffix-rest
- nil
- t
- t)))
- (parser-generator--debug
- (message
- "lr-item-suffix-rest-first (before): %s"
- lr-item-suffix-rest-first))
-
- ;; EOF-markers are always a possible look-ahead
- (unless lr-item-suffix-rest-first
- (setq
- lr-item-suffix-rest-first
- (list eof-list)))
+ ;; EOF-markers are always a possible look-ahead
+ (unless lr-item-suffix-rest-first
+ (setq
+ lr-item-suffix-rest-first
+ (list eof-list)))
- (parser-generator--debug
- (message
- "lr-item-suffix-rest-first (after): %s"
- lr-item-suffix-rest-first))
- (let ((sub-production
- (parser-generator--get-grammar-rhs
- lr-item-suffix-first)))
-
- ;; For each production with B as LHS
- (dolist (sub-rhs sub-production)
-
- ;; Transform e-productions into nil
- (when (and
- (= (length sub-rhs) 1)
- (parser-generator--valid-e-p
- (car sub-rhs)))
- (setq sub-rhs nil))
-
- ;; For each x in FIRST(αu)
- (dolist (f lr-item-suffix-rest-first)
-
- ;; then add [B -> . D, x] to V(X1,...,Xi) for
each x in FIRST(bu)
- ;; provided it is not already there
- (let ((lr-item-to-add
- `(,(list lr-item-suffix-first) nil
,sub-rhs ,f)))
- ;; Only k >= 1 needs dot a look-ahead
- (when
- (=
- parser-generator--look-ahead-number
- 0)
- (setq
- lr-item-to-add
- `(,(list lr-item-suffix-first) nil
,sub-rhs)))
- (let ((temp-hash-key
- (format
- "%S"
- lr-item-to-add)))
- (unless
- (gethash
- temp-hash-key
- lr-item-exists)
- (setq
- added-new
- t)
- (parser-generator--debug
- (message
- "lr-item-to-add: %s"
- lr-item-to-add))
- (puthash
- temp-hash-key
- t
- lr-item-exists)
- (push
- lr-item-to-add
- lr-new-item))))))))))))))
+ (parser-generator--debug
+ (message
+ "lr-item-suffix-rest-first (after): %s"
+ lr-item-suffix-rest-first))
+ (let ((sub-production
+ (parser-generator--get-grammar-rhs
+ lr-item-suffix-first)))
+
+ ;; For each production with B as LHS
+ (dolist (sub-rhs sub-production)
+
+ ;; Transform e-productions into nil
+ (when (and
+ (= (length sub-rhs) 1)
+ (parser-generator--valid-e-p
+ (car sub-rhs)))
+ (setq sub-rhs nil))
+
+ ;; For each x in FIRST(αu)
+ (dolist (f lr-item-suffix-rest-first)
+
+ ;; then add [B -> . D, x] to V(X1,...,Xi) for each x
in FIRST(bu)
+ ;; provided it is not already there
+ (let ((lr-item-to-add
+ `(,(list lr-item-suffix-first) nil ,sub-rhs
,f)))
+ ;; Only k >= 1 needs dot a look-ahead
+ (when
+ (=
+ parser-generator--look-ahead-number
+ 0)
+ (setq
+ lr-item-to-add
+ `(,(list lr-item-suffix-first) nil ,sub-rhs)))
+ (let ((temp-hash-key
+ (format
+ "%S"
+ lr-item-to-add)))
+ (unless
+ (gethash
+ temp-hash-key
+ lr-item-exists)
+ (setq
+ added-new
+ t)
+ (parser-generator--debug
+ (message
+ "lr-item-to-add: %s"
+ lr-item-to-add))
+ (puthash
+ temp-hash-key
+ t
+ lr-item-exists)
+ (push
+ lr-item-to-add
+ lr-new-item))))))))))))))
- ;; Sort result for a more deterministic result
- (setq
- lr-new-item
- (sort
- lr-new-item
- 'parser-generator--sort-list))) ;; TODO Optimize this?
+ ;; Sort result for a more deterministic result
+ (setq
+ lr-new-item
+ (sort
+ lr-new-item
+ 'parser-generator--sort-list)))
- (puthash
- lr-items-cache-key
- lr-new-item
- parser-generator-lr--table-lr-items-for-symbol)))
- (gethash
- lr-items-cache-key
- parser-generator-lr--table-lr-items-for-symbol)))
+ lr-new-item))
(defun parser-generator-lr-parse
(&optional
@@ -1229,50 +1271,55 @@
(parser-generator--debug
(message "shift a: %s" a)
(message "shift a-full: %s" a-full))
- (let ((goto-table
+ (let ((goto-table-distinct-index
(gethash
table-index
parser-generator-lr--goto-tables)))
- (let ((goto-table-length (length goto-table))
- (goto-index 0)
- (searching-match t)
- (next-index)
- (possible-look-aheads))
-
- (while (and
- searching-match
- (< goto-index goto-table-length))
- (let ((goto-item (nth goto-index goto-table)))
- (let ((goto-item-symbol (list (car goto-item)))
- (goto-item-next-index (car (cdr goto-item))))
- (push goto-item-symbol possible-look-aheads)
+ (let ((goto-table
+ (gethash
+ goto-table-distinct-index
+ parser-generator-lr--distinct-goto-tables)))
+ (let ((goto-table-length
+ (length goto-table))
+ (goto-index 0)
+ (searching-match t)
+ (next-index)
+ (possible-look-aheads))
+
+ (while (and
+ searching-match
+ (< goto-index goto-table-length))
+ (let ((goto-item (nth goto-index goto-table)))
+ (let ((goto-item-symbol (list (car goto-item)))
+ (goto-item-next-index (car (cdr
goto-item))))
+ (push goto-item-symbol possible-look-aheads)
- (parser-generator--debug
- (message "shift goto-item: %s" goto-item)
- (message "shift goto-item-symbol: %s"
goto-item-symbol))
+ (parser-generator--debug
+ (message "shift goto-item: %s" goto-item)
+ (message "shift goto-item-symbol: %s"
goto-item-symbol))
- (when (equal
- goto-item-symbol
- a)
- (setq next-index goto-item-next-index)
- (setq searching-match nil))))
+ (when (equal
+ goto-item-symbol
+ a)
+ (setq next-index goto-item-next-index)
+ (setq searching-match nil))))
- (setq goto-index (1+ goto-index)))
+ (setq goto-index (1+ goto-index)))
- (parser-generator--debug
- (message "shift next-index: %s" next-index))
+ (parser-generator--debug
+ (message "shift next-index: %s" next-index))
- (unless next-index
- (error
- "In shift, found no GOTO-item for %s at %s,
expected one of %s"
- a
- parser-generator-lex-analyzer--index
- possible-look-aheads))
+ (unless next-index
+ (error
+ "In shift, found no GOTO-item for %s at %s,
expected one of %s"
+ a
+ parser-generator-lex-analyzer--index
+ possible-look-aheads))
- ;; Maybe push both tokens here?
- (push (car a-full) pushdown-list)
- (push next-index pushdown-list)
- (parser-generator-lex-analyzer--pop-token)))))
+ ;; Maybe push both tokens here?
+ (push (car a-full) pushdown-list)
+ (push next-index pushdown-list)
+ (parser-generator-lex-analyzer--pop-token))))))
((equal (car action-match) 'reduce)
;; (b) If f(u) = reduce i and production i is A -> a,
@@ -1403,40 +1450,44 @@
partial-translation)))))
(let ((new-table-index (car pushdown-list)))
- (let ((goto-table
+ (let ((goto-table-distinct-index
(gethash
new-table-index
parser-generator-lr--goto-tables)))
- (let ((goto-table-length
- (length goto-table))
- (goto-index 0)
- (searching-match t)
- (next-index))
-
- (while (and
- searching-match
- (< goto-index goto-table-length))
- (let ((goto-item (nth goto-index goto-table)))
- (let ((goto-item-symbol (list (car
goto-item)))
- (goto-item-next-index (car (cdr
goto-item))))
- (parser-generator--debug
- (message "reduce goto-item: %s" goto-item)
- (message "reduce goto-item-symbol: %s"
goto-item-symbol))
+ (let ((goto-table
+ (gethash
+ goto-table-distinct-index
+
parser-generator-lr--distinct-goto-tables)))
+ (let ((goto-table-length
+ (length goto-table))
+ (goto-index 0)
+ (searching-match t)
+ (next-index))
+
+ (while (and
+ searching-match
+ (< goto-index goto-table-length))
+ (let ((goto-item (nth goto-index
goto-table)))
+ (let ((goto-item-symbol (list (car
goto-item)))
+ (goto-item-next-index (car (cdr
goto-item))))
+ (parser-generator--debug
+ (message "reduce goto-item: %s"
goto-item)
+ (message "reduce goto-item-symbol: %s"
goto-item-symbol))
- (when (equal
- goto-item-symbol
- production-lhs)
- (setq next-index goto-item-next-index)
- (setq searching-match nil))))
+ (when (equal
+ goto-item-symbol
+ production-lhs)
+ (setq next-index goto-item-next-index)
+ (setq searching-match nil))))
- (setq goto-index (1+ goto-index)))
+ (setq goto-index (1+ goto-index)))
- (parser-generator--debug
- (message "reduce next-index: %s" next-index))
+ (parser-generator--debug
+ (message "reduce next-index: %s" next-index))
- (when next-index
- (push production-lhs pushdown-list)
- (push next-index pushdown-list)))))))))
+ (when next-index
+ (push production-lhs pushdown-list)
+ (push next-index pushdown-list))))))))))
((equal action-match '(accept))
;; (d) If f(u) = accept, we halt and declare the string
diff --git a/test/parser-generator-lr-test.el b/test/parser-generator-lr-test.el
index beab25b..765f74c 100644
--- a/test/parser-generator-lr-test.el
+++ b/test/parser-generator-lr-test.el
@@ -97,7 +97,7 @@
;; (message "cyclical lr-items: %s" table-lr-items)
(parser-generator-lr--generate-action-tables
table-lr-items)
- ;; (message "cyclical goto-tables: %s" parser-generator-lr--goto-tables)
+ ;; (message "cyclical goto-tables: %s"
(parser-generator-lr--get-expanded-goto-tables))
;; (message "cyclical action-tables: %s"
parser-generator-lr--action-tables)
)
(message "Passed cyclical grammar")
@@ -119,8 +119,7 @@
(parser-generator--debug
(message
"GOTO-table: %s"
- (parser-generator--hash-to-list
- parser-generator-lr--goto-tables)))
+ (parser-generator-lr--get-expanded-goto-tables)))
(should
(equal
'((0 ((S 1)))
@@ -131,8 +130,7 @@
(5 nil)
(6 ((a 4) (b 7)))
(7 nil))
- (parser-generator--hash-to-list
- parser-generator-lr--goto-tables)))
+ (parser-generator-lr--get-expanded-goto-tables)))
(message "Passed GOTO-tables")
(parser-generator--debug
@@ -165,7 +163,7 @@
(let ((table-lr-items
(parser-generator-lr--generate-goto-tables)))
- ;; (message "GOTO-table: %s" (parser-generator--hash-to-list
parser-generator-lr--goto-tables))
+ ;; (message "GOTO-table: %s"
(parser-generator-lr--get-expanded-goto-tables))
;; (message "LR-items: %s" (parser-generator--hash-to-list
parser-generator-lr--items))
(should
@@ -178,8 +176,7 @@
(5 nil)
(6 (("a" 4) ("b" 7)))
(7 nil))
- (parser-generator--hash-to-list
- parser-generator-lr--goto-tables)))
+ (parser-generator-lr--get-expanded-goto-tables)))
(message "Passed GOTO-tables with tokens as strings")
(should
@@ -368,7 +365,7 @@
(message "lr-items: %s" (parser-generator--hash-values-to-list lr-items
t)))
)
(parser-generator--debug
- (message "goto-tables: %s" (parser-generator--hash-values-to-list
parser-generator-lr--goto-tables t))
+ (message "goto-tables: %s" (parser-generator-lr--get-expanded-goto-tables))
(message "action-tables: %s" (parser-generator--hash-values-to-list
parser-generator-lr--action-tables t)))
(setq
parser-generator-lex-analyzer--function
@@ -564,9 +561,7 @@
(parser-generator--debug
(message "GOTO-tables k = 2: %s"
- (parser-generator--hash-to-list
- parser-generator-lr--goto-tables
- t)))
+ (parser-generator-lr--get-expanded-goto-tables)))
;; state | a | b | c | $ | S | R | T
;; -------+-----+-----+-----+-----+-----+-----+-----
@@ -602,8 +597,7 @@
(7 nil)
(8 nil)
(9 nil))
- (parser-generator--hash-to-list
- parser-generator-lr--goto-tables)))
+ (parser-generator-lr--get-expanded-goto-tables)))
(message "Passed GOTO-tables k = 2")
;; state | aa | ab | ac | a$ | ba | bb | bc | b$ | ca | cb | cc | c$ | $$
@@ -847,9 +841,7 @@
(parser-generator--debug
(message
"GOTO-tables k = 0: %s"
- (parser-generator--hash-to-list
- parser-generator-lr--goto-tables
- t)))
+ (parser-generator-lr--get-expanded-goto-tables)))
;; * + 0 1 E B
;; 0 1 2 3 4
@@ -873,8 +865,7 @@
(6 (("0" 1) ("1" 2) (B 7))) ;; 7-8
(7 nil)
(8 nil))
- (parser-generator--hash-to-list
- parser-generator-lr--goto-tables)))
+ (parser-generator-lr--get-expanded-goto-tables)))
(message "Passed GOTO-tables k = 2")
;; * + 0 1 $
- [elpa] externals/parser-generator cecf8fd 287/434: More TODO items, (continued)
- [elpa] externals/parser-generator cecf8fd 287/434: More TODO items, ELPA Syncer, 2021/11/29
- [elpa] externals/parser-generator 688e685 291/434: Lex-analyzer index is now buffer-local variable, ELPA Syncer, 2021/11/29
- [elpa] externals/parser-generator 0702765 293/434: Added incremental unit test for exported parser/translator, ELPA Syncer, 2021/11/29
- [elpa] externals/parser-generator 552c0c5 304/434: Using better hash-key for goto-tables generation, ELPA Syncer, 2021/11/29
- [elpa] externals/parser-generator d0d3201 299/434: FIRST calculation now handles cyclic productions, ELPA Syncer, 2021/11/29
- [elpa] externals/parser-generator 5145cda 306/434: Improved hash-key integrity for LRk Parser, ELPA Syncer, 2021/11/29
- [elpa] externals/parser-generator 2227cae 313/434: Moved validation of valid lr-item set to generation of goto-tables, ELPA Syncer, 2021/11/29
- [elpa] externals/parser-generator a86c658 305/434: Improved output, ELPA Syncer, 2021/11/29
- [elpa] externals/parser-generator dcbbdee 315/434: Started on support for symbol attributes, ELPA Syncer, 2021/11/29
- [elpa] externals/parser-generator 0c1b8b6 316/434: Passing tests for symbol attributes, ELPA Syncer, 2021/11/29
- [elpa] externals/parser-generator c886537 311/434: Using references for distinct goto-tables to optimize memory usage,
ELPA Syncer <=
- [elpa] externals/parser-generator 06bff4b 321/434: Improved validation of conflict-resolution using attributes, ELPA Syncer, 2021/11/29
- [elpa] externals/parser-generator ea898ce 317/434: Fixed code-styling, ELPA Syncer, 2021/11/29
- [elpa] externals/parser-generator ae51103 323/434: Passing test for resolving conflict using precedence attributes, ELPA Syncer, 2021/11/29
- [elpa] externals/parser-generator 35d6be3 327/434: Added TODO-items, ELPA Syncer, 2021/11/29
- [elpa] externals/parser-generator 4d60ed4 328/434: Added validation to context-sensitive attributes, ELPA Syncer, 2021/11/29
- [elpa] externals/parser-generator ce9ae69 329/434: Improved comment, ELPA Syncer, 2021/11/29
- [elpa] externals/parser-generator b8a81c5 330/434: Added failing test, ELPA Syncer, 2021/11/29
- [elpa] externals/parser-generator 06d23f5 340/434: More debugging, ELPA Syncer, 2021/11/29
- [elpa] externals/parser-generator f213255 348/434: Passed all old unit tests again after translation refactor, ELPA Syncer, 2021/11/29
- [elpa] externals/parser-generator 886af5c 349/434: Uncommented export tests until refactor is ok, ELPA Syncer, 2021/11/29