[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[elpa] externals/ada-mode 74978b1a90 3/6: Update to current devel versio
|
From: |
Stephen Leake |
|
Subject: |
[elpa] externals/ada-mode 74978b1a90 3/6: Update to current devel version, for beta test |
|
Date: |
Sun, 10 Jul 2022 12:58:52 -0400 (EDT) |
branch: externals/ada-mode
commit 74978b1a904a6955c940b8d827902e6f884f6474
Author: Stephen Leake <stephen_leake@stephe-leake.org>
Commit: Stephen Leake <stephen_leake@stephe-leake.org>
Update to current devel version, for beta test
---
Makefile | 4 +-
Makefile.conf | 2 +
NEWS | 70 +-
README | 2 +-
ada-build.el | 6 +-
ada-compiler-gnat.el | 103 +-
ada-core.el | 234 +-
ada-gnat-xref.el | 10 +-
ada-indent-user-options.el | 22 +-
ada-mode.el | 295 +-
ada-mode.texi | 145 +-
ada-skel.el | 54 +-
ada.wy | 2652 ---
ada-process.el => ada_annex_p-process.el | 785 +-
ada_annex_p.wy | 2761 +++
ada_annex_p_process_actions.adb | 15703 ++++++++++++
ada_annex_p_process_actions.ads | 3729 +++
ada_annex_p_process_lalr_main.adb | 32902 ++++++++++++++++++++++++++
ada_annex_p_process_lalr_main.ads | 31 +
ada_annex_p_process_lr1_main.adb | 1803 ++
ada_annex_p_process_lr1_main.ads | 32 +
ada_re2c.c => ada_annex_p_re2c.c | 13566 +++++++----
ada_re2c_c.ads => ada_annex_p_re2c_c.ads | 41 +-
ada_lr1_parse_table.txt.gz | Bin 5209667 -> 0 bytes
ada_mode_wisi_lalr_parse.ads | 15 +-
ada_mode_wisi_lr1_parse.ads | 19 +-
ada_mode_wisi_parse.gpr.gp | 56 +-
ada_process_actions.adb | 5237 ----
ada_process_actions.ads | 2108 --
ada_process_lalr_main.adb | 16487 -------------
ada_process_lalr_main.ads | 32 -
ada_process_lr1_main.adb | 483 -
ada_process_lr1_main.ads | 33 -
benchmark-xref.el | 41 +
build.sh | 11 +-
config.pragmas | 6 -
dir | 22 -
gnat-core.el | 449 -
gpr-mode.el | 2 +
gpr-mode.info | 737 -
gpr-process.el | 7 +-
gpr-query.el | 375 +-
gpr-skel.el | 7 +-
gpr.wy | 53 +-
gpr_mode_wisi_parse.ads | 13 +-
gpr_process_actions.adb | 325 +-
gpr_process_actions.ads | 205 +-
gpr_process_main.adb | 4090 ++--
gpr_process_main.ads | 19 +-
gpr_query.adb | 81 +-
gpr_re2c.c | 4441 ++--
gpr_re2c_c.ads | 27 +-
run_ada_lalr_parse.ads | 14 +-
run_ada_lr1_parse.ads | 16 +-
run_gpr_parse.ads | 10 +-
wisi-ada-format_parameter_list.adb | 125 +-
wisi-ada.adb | 1197 +-
wisi-ada.ads | 183 +-
wisi-gpr.adb | 54 +-
wisi-gpr.ads | 36 +-
wisitoken-parse-lr-mckenzie_recover-ada.adb | 1362 +-
wisitoken-parse-lr-mckenzie_recover-ada.ads | 21 +-
62 files changed, 74726 insertions(+), 38625 deletions(-)
diff --git a/Makefile b/Makefile
index 657aba1526..107deaa71c 100644
--- a/Makefile
+++ b/Makefile
@@ -1,6 +1,6 @@
# For compiling ada-mode Ada code in elpa worktree
-export Standard_Common_Build := Debug
+#export Standard_Common_Build := Debug
.PHONY : all force
@@ -21,7 +21,7 @@ ada_mode_wisi_parse.gpr : ada_mode_wisi_parse.gpr.gp
../wisi/wisi.gpr
gnatprep -DELPA="yes" -DHAVE_GNAT_UTIL=$(HAVE_GNAT_UTIL)
-DHAVE_LIBADALANG=$(HAVE_LIBADALANG) $< $@
%.re2c : %.wy ../wisi/wisitoken-bnf-generate
- ../wisi/wisitoken-bnf-generate --time $(<F)
+ ../wisi/wisitoken-bnf-generate $(<F)
dos2unix -q $(*F)-process.el $(*F)_process* $(*F).re2c $(*F)_re2c_c.ads
%_re2c.c : %.re2c
diff --git a/Makefile.conf b/Makefile.conf
index abe5ad2a5d..a0bb14ddaf 100644
--- a/Makefile.conf
+++ b/Makefile.conf
@@ -1,2 +1,4 @@
HAVE_LIBADALANG := "no"
HAVE_GNAT_UTIL := "no"
+HAVE_LIBADALANG := "yes"
+HAVE_GNAT_UTIL := "no"
diff --git a/NEWS b/NEWS
index e46c3e3650..f6c3b4251b 100644
--- a/NEWS
+++ b/NEWS
@@ -6,6 +6,74 @@ Please send ada-mode bug reports to bug-gnu-emacs@gnu.org, with
'ada-mode' in the subject. If possible, use M-x report-emacs-bug.
+* Ada Mode ?
+9 Jul 2022 beta testing
+
+** Support incremental parse. Set wisi-incremental-parse-enable t to
+ experiment with this; default is nil, because the parser often gets
+ confused.
+
+ When the parser gets confused (which is fairly often), use M-x
+ wisi-reset-parser to recover.
+
+ When using incremental parse, it is best to keep the number of
+ errors in the file small; the parse time is proportial to the
+ number of errors, and error recover is often noticeably slow .
+
+** The Ada grammar is updated to the proposed Ada 2022 standard, and
+ is now in the file ada_annex_p.wy.
+
+** ada-end-name-optional now defaults to 't', to match the
+ expectations of new Ada users. Experienced users that follow a
+ style guide requiring matching end names should set this to 'nil',
+ since that gives better error correction.
+
+** New indent option add ada-indent-subprogram-is; indentation of 'is'
+ in expression functions and similar subprogram declarations.
+ Previously, this was ada-indent-broken; now you can set it
+ separately (ie to 0).
+
+** Indentation of 'is' and 'with' in null and abstract subprogram
+ specification is now consistent with non-abstract subprogram
+ specification and expression function.
+
+** Indentation of comment in subprogram body after param_list before
+ 'is' matches subprogram spec;
+
+ procedure Foo
+ (A : in Integer)
+ -- Computes stuff
+ is ...
+
+** ada-make-subprogram-body now inserts "null;"; this eliminates a
+ syntax error, improving incremental parse. Similarly, the skeleton
+ commands insert dummy names where needed to avoid syntax errors.
+
+** New key binding prefix C-c r for the various ada-refactor commands.
+
+** New command ada-parse-require-process starts the external parser,
+ without waiting for it to respond.
+
+** build.sh now runs wisitoken-bnf-generate to create the Ada LR1
+ parse table file; it is too big to keep in ELPA. This can take a
+ couple of minutes.
+
+** New custom variable gpr-query-no-symbols allows disabling reading
+ the symbol completion table from the gpr_query process. When nil,
+ symbols are read in the background, but there can enough
+ interference with foreground processing to be annoying. When
+ non-nil, symbols are not read, and completing symbols in xref is
+ disabled. Default is nil.
+
+** New custom variable gpr-query-exec-opts allows specifying options
+ for gpr_query.
+
+** Declare indent option ada-indent-hanging-rel-exp obsolete; it was
+ never well defined, and now has no effect.
+
+** parser Ada language protocol version 4; delete
+ ada-indent-hanging-rel-exp, add ada-indent-subprogram-is
+
* Ada Mode 7.2.1
** More fixes for xref-file-location syntax, required by Emacs 28.
@@ -51,7 +119,7 @@ Please send ada-mode bug reports to bug-gnu-emacs@gnu.org,
with
* Ada Mode 7.1.4
07 Aug 2020
-** Set auto-mode-alist for ada-mode.
+** Set auto-mode-alist for ada-mode.
* Ada Mode 7.1.3
04 Jun 2020
diff --git a/README b/README
index 2ef27e3595..9035ccef7a 100644
--- a/README
+++ b/README
@@ -1,4 +1,4 @@
-Emacs Ada mode version 7.2.1
+Emacs Ada mode version 7.1.3
Ada mode provides auto-casing, fontification, navigation, and
indentation for Ada source code files.
diff --git a/ada-build.el b/ada-build.el
index 7706896df6..058d7a97f5 100644
--- a/ada-build.el
+++ b/ada-build.el
@@ -232,9 +232,9 @@ main.
search-prompt - Search for a project file in the current
directory with the same name as the main file. If not found,
-prompt for a project file; throw an error if user aborts.
+prompt for a project file; thow error if user aborts
-prompt - Prompt for a project file; throw an error if user aborts.
+prompt - Prompt for a project file; thow error if user aborts.
error - Throw an error (no prompt, no default project).
@@ -314,7 +314,7 @@ If CONFIRM is non-nil, prompt for user confirmation of the
command."
;;;###autoload
(defun ada-build-set-make (&optional confirm)
- "Set the main project variable to the current file, then run the make_cmd
project variable.
+ "Set the main project variable to the current file, then run make_cmd.
By default, this compiles and links the new main program.
If CONFIRM is non-nil, prompt for user confirmation of the command."
(interactive "P")
diff --git a/ada-compiler-gnat.el b/ada-compiler-gnat.el
index a19fcdac8b..2dc3baa875 100644
--- a/ada-compiler-gnat.el
+++ b/ada-compiler-gnat.el
@@ -2,7 +2,7 @@
;;;
;; GNAT is provided by AdaCore; see http://libre.adacore.com/
;;
-;;; Copyright (C) 2012 - 2020 Free Software Foundation, Inc.
+;;; Copyright (C) 2012 - 2022 Free Software Foundation, Inc.
;;
;; Author: Stephen Leake <stephen_leake@member.fsf.org>
;; Maintainer: Stephen Leake <stephen_leake@member.fsf.org>
@@ -163,13 +163,18 @@ For `compilation-filter-hook'."
"regexp to extract quoted punctuation in error messages")
(defun ada-gnat-misspelling ()
- "Return correct spelling from current compiler error, if there are
corrections offered.
+ "Return correct spelling from current compiler error.
Prompt user if more than one."
;; wisi-output.adb:115:41: no selector "Productions" for type "RHS_Type"
defined at wisi.ads:77
;; wisi-output.adb:115:41: invalid expression in loop iterator
;; wisi-output.adb:115:42: possible misspelling of "Production"
;; wisi-output.adb:115:42: possible misspelling of "Production"
;;
+ ;; GNAT Community 2021 adds "error: " to the above (a misspelling is never a
warning):
+ ;; wisi-output.adb:115:41: error: invalid expression in loop iterator
+ ;; wisi-output.adb:115:42: error: possible misspelling of "Production"
+ ;; wisi-output.adb:115:42: error: possible misspelling of "Production"
+ ;;
;; column number can vary, so only check the line number
(save-excursion
(let* ((start-msg (get-text-property (line-beginning-position)
'compilation-message))
@@ -184,6 +189,8 @@ Prompt user if more than one."
(progn
(skip-syntax-forward "^-")
(forward-char 1)
+ (when (looking-at "error: ")
+ (goto-char (match-end 0)))
(looking-at (concat "possible misspelling of "
ada-gnat-quoted-name-regexp))))
(push (match-string 1) choices)))
@@ -204,17 +211,23 @@ Prompt user if more than one."
(save-excursion
(forward-line 1)
(skip-syntax-forward "^ ")
- (looking-at " use fully qualified name starting with \\([[:alnum:]_]+\\)
to make")
- (match-string 1)
+ (when (looking-at " use fully qualified name starting with
\\([[:alnum:]_]+\\) to make")
+ (match-string 1))
))
(cl-defmethod wisi-compiler-fix-error ((_compiler gnat-compiler) source-buffer)
(let ((start-pos (point))
message-column
result)
- ;; Move to start of error message text
- (skip-syntax-forward "^-")
+ ;; Move to start of error message text. GNAT Community 2021 puts
+ ;; warning: | error: after the file:line:column; earlier compilers
+ ;; only put "warning: ".
+ ;;
+ ;; test_incremental.adb:657:20: error: "Checks" not declared in "WisiToken"
+ (skip-syntax-forward "^-") ;; file:line:column
(forward-char 1)
+ (when (looking-at "warning: \\|error: ")
+ (goto-char (match-end 0)))
(setq message-column (current-column))
;; recognize it, handle it
@@ -253,16 +266,19 @@ Prompt user if more than one."
;; defined; if present, it will have been marked by
;; ada-gnat-compilation-filter:
;;
- ;; gnatquery.adb:255:13: "Has_Element" is not visible
- ;; gnatquery.adb:255:13: non-visible declaration at
a-convec.ads:68, instance at gnatcoll-arg_lists.ads:157
- ;; gnatquery.adb:255:13: non-visible declaration at
a-coorse.ads:62, instance at gnatcoll-xref.ads:912
- ;; gnatquery.adb:255:13: non-visible declaration at
a-coorse.ads:62, instance at gnatcoll-xref.ads:799
- ;; gnatquery.adb:255:13: non-visible declaration at
gnatcoll-xref.ads:314
+ ;; gnatquery.adb:255:13: error: "Has_Element" is not visible
+ ;; gnatquery.adb:255:13: error: non-visible declaration at
a-convec.ads:68, instance at gnatcoll-arg_lists.ads:157
+ ;; gnatquery.adb:255:13: error: non-visible declaration at
a-coorse.ads:62, instance at gnatcoll-xref.ads:912
+ ;; gnatquery.adb:255:13: error: non-visible declaration at
a-coorse.ads:62, instance at gnatcoll-xref.ads:799
+ ;; gnatquery.adb:255:13: error: non-visible declaration at
gnatcoll-xref.ads:314
;;
;; or the next line may contain "multiple use clauses cause hiding"
;;
;; the lines after that may contain alternate matches;
;; collect all, let user choose.
+ ;;
+ ;; However, a line that contains 'ada-secondary-error may be from
the next error message:
+ ;; parser_no_recover.adb:297:60: no selector "Tree" for type
"Parser_State" defined at lists.ads:96
(forward-line 1)
(when (looking-at ".* multiple use clauses cause hiding")
(forward-line 1))
@@ -271,9 +287,9 @@ Prompt user if more than one."
;; 1- because next compilation error is at next line beginning
(setq done (not
(and
- (equal file-line-struct err-msg)
+ (equal file-line-struct err-msg) ;; same error
message?
(setq pos (next-single-property-change (point)
'ada-secondary-error nil limit))
- (< pos limit))))
+ (<= pos limit))))
(when (not done)
(let* ((item (get-text-property pos 'ada-secondary-error))
(unit-file (nth 0 item))
@@ -282,7 +298,9 @@ Prompt user if more than one."
(unless (member choice choices) (push choice choices))
(goto-char (1+ pos))
(goto-char (1+ (next-single-property-change (point)
'ada-secondary-error nil limit)))
- (when (eolp) (forward-line 1))
+ (when (eolp)
+ (forward-line 1)
+ (setq file-line-struct (get-text-property (point)
'compilation-message)))
))
))
@@ -335,6 +353,7 @@ Prompt user if more than one."
((looking-at (concat ada-gnat-quoted-name-regexp " not declared in "
ada-gnat-quoted-name-regexp))
(save-excursion
(let ((child-name (match-string 1))
+ (partial-parent-name (match-string 2))
(correct-spelling (ada-gnat-misspelling))
(qualified (ada-gnat-qualified)))
(cond
@@ -352,7 +371,7 @@ Prompt user if more than one."
(t
;; else guess that "child" is a child package, and extend the
with_clause
(pop-to-buffer source-buffer)
- (ada-fix-extend-with-clause child-name))))
+ (ada-fix-extend-with-clause partial-parent-name child-name))))
t))
((looking-at (concat ada-gnat-quoted-punctuation-regexp
@@ -367,6 +386,12 @@ Prompt user if more than one."
t)
;;;; strings
+ ((looking-at (concat "aspect \"" ada-name-regexp "\" requires
'Class"))
+ (pop-to-buffer source-buffer)
+ (forward-word 1)
+ (insert "'Class")
+ t)
+
((looking-at (concat "\"end " ada-name-regexp ";\" expected"))
(let ((expected-name (match-string 1)))
(pop-to-buffer source-buffer)
@@ -414,7 +439,7 @@ Prompt user if more than one."
(pop-to-buffer source-buffer)
(if (looking-at "'Access")
(kill-word 1)
- (forward-word 1)
+ (forward-symbol 1)
(insert ".all"))
t)
((looking-at "found type .*_Access_Type")
@@ -441,8 +466,8 @@ Prompt user if more than one."
(let ((package-name (match-string-no-properties 1)))
(pop-to-buffer source-buffer)
;; Could check if prefix is already with'd, extend
- ;; it. But no one has reported that case yet; this
- ;; message only occurs for predefined Ada packages.
+ ;; it. But that's not easy. This message only occurs for
+ ;; compiler-provided Ada and GNAT packages.
(ada-fix-add-with-clause package-name))
t)
@@ -483,10 +508,17 @@ Prompt user if more than one."
(replace-match correct-spelling)
t))))
- ((looking-at (concat "operator for \\(private \\)?type "
ada-gnat-quoted-name-regexp
- "\\( defined at " ada-gnat-file-name-regexp
"\\)?"))
- (let ((type (match-string 2))
- (package-file (match-string 4))
+ ((looking-at (concat "operator for \\(?:private \\)?type "
ada-gnat-quoted-name-regexp
+ "\\(?: defined at " ada-gnat-file-name-regexp
"\\)?"))
+ (let ((type (match-string 1))
+ (package-file (match-string 2))
+ ;; IMPROVEME: we'd like to handle ", instance at
+ ;; <file:line:column>", but gnatcoll.xref does not
+ ;; support looking up an entity by location alone; it
+ ;; requires the name, and this error message does not
+ ;; give the name of the instance. When we implement
+ ;; adalang xref, or if the error message improves,
+ ;; try again.
(prj (project-current)))
(when package-file
(setq type (concat
@@ -516,14 +548,14 @@ Prompt user if more than one."
t)
;;;; warnings
- ((looking-at (concat "warning: " ada-gnat-quoted-name-regexp " is
already use-visible"))
+ ((looking-at (concat ada-gnat-quoted-name-regexp " is already
use-visible"))
;; just delete the 'use'; assume it's on a line by itself.
(pop-to-buffer source-buffer)
(beginning-of-line)
(delete-region (point) (progn (forward-line 1) (point)))
t)
- ((looking-at (concat "warning: " ada-gnat-quoted-name-regexp " is not
modified, could be declared constant"))
+ ((looking-at (concat ada-gnat-quoted-name-regexp " is not modified,
could be declared constant"))
(pop-to-buffer source-buffer)
(search-forward ":")
(forward-comment (- (point-max) (point)))
@@ -534,7 +566,7 @@ Prompt user if more than one."
(insert "constant ")
t)
- ((looking-at (concat "warning: constant " ada-gnat-quoted-name-regexp
" is not referenced"))
+ ((looking-at (concat "constant " ada-gnat-quoted-name-regexp " is not
referenced"))
(let ((constant (match-string 1)))
(pop-to-buffer source-buffer)
(end-of-line)
@@ -542,7 +574,7 @@ Prompt user if more than one."
(insert "pragma Unreferenced (" constant ");"))
t)
- ((looking-at (concat "warning: formal parameter "
ada-gnat-quoted-name-regexp " is not referenced"))
+ ((looking-at (concat "formal parameter " ada-gnat-quoted-name-regexp
" is not referenced"))
(let ((param (match-string 1))
cache)
(pop-to-buffer source-buffer)
@@ -559,7 +591,7 @@ Prompt user if more than one."
(insert "pragma Unreferenced (" param ");"))
t)
- ((looking-at (concat "warning: formal parameter "
ada-gnat-quoted-name-regexp " is not modified"))
+ ((looking-at (concat "formal parameter " ada-gnat-quoted-name-regexp
" is not modified"))
(let ((mode-regexp "\"\\([in out]+\\)\"")
new-mode
old-mode)
@@ -575,7 +607,7 @@ Prompt user if more than one."
)
t)
- ((looking-at (concat "warning: variable " ada-gnat-quoted-name-regexp
" is not referenced"))
+ ((looking-at (concat "variable " ada-gnat-quoted-name-regexp " is not
referenced"))
(let ((param (match-string 1)))
(pop-to-buffer source-buffer)
(forward-sexp);; end of declaration
@@ -585,16 +617,17 @@ Prompt user if more than one."
t)
((or
- (looking-at (concat "warning: no entities of "
ada-gnat-quoted-name-regexp " are referenced"))
- (looking-at (concat "warning: unit " ada-gnat-quoted-name-regexp "
is never instantiated"))
- (looking-at "warning: redundant with clause"))
- ;; just delete the 'with'; assume it's on a line by itself.
+ (looking-at (concat "no entities of " ada-gnat-quoted-name-regexp "
are referenced"))
+ (looking-at (concat "unit " ada-gnat-quoted-name-regexp " is never
instantiated"))
+ (looking-at (concat "renamed constant " ada-gnat-quoted-name-regexp
" is not referenced"))
+ (looking-at "redundant with clause"))
+ ;; just delete the declaration; assume it's on a line by itself.
(pop-to-buffer source-buffer)
(beginning-of-line)
(delete-region (point) (progn (forward-line 1) (point)))
t)
- ((looking-at (concat "warning: variable " ada-gnat-quoted-name-regexp
" is assigned but never read"))
+ ((looking-at (concat "variable " ada-gnat-quoted-name-regexp " is
assigned but never read"))
(let ((param (match-string 1)))
(pop-to-buffer source-buffer)
(wisi-goto-statement-end) ;; leaves point before semicolon
@@ -603,14 +636,14 @@ Prompt user if more than one."
(insert "pragma Unreferenced (" param ");"))
t)
- ((looking-at (concat "warning: unit " ada-gnat-quoted-name-regexp "
is not referenced"))
+ ((looking-at (concat "unit " ada-gnat-quoted-name-regexp " is not
referenced"))
;; just delete the 'with'; assume it's on a line by itself.
(pop-to-buffer source-buffer)
(beginning-of-line)
(delete-region (point) (progn (forward-line 1) (point)))
t)
- ((looking-at (concat "warning: use clause for
\\(package\\|type\\|private type\\) " ada-gnat-quoted-name-regexp " \\(defined
at\\|from instance at\\|has no effect\\)"))
+ ((looking-at (concat "use clause for \\(package\\|type\\|private
type\\) " ada-gnat-quoted-name-regexp " \\(defined at\\|from instance at\\|has
no effect\\)"))
;; delete the 'use'; assume it's on a line by itself.
(pop-to-buffer source-buffer)
(beginning-of-line)
diff --git a/ada-core.el b/ada-core.el
index 074ab2c251..2f82bc5807 100644
--- a/ada-core.el
+++ b/ada-core.el
@@ -1,6 +1,6 @@
;;; ada-core.el --- core facilities for ada-mode -*- lexical-binding:t -*-
-;; Copyright (C) 1994, 1995, 1997 - 2017, 2019 - 2021 Free Software
Foundation, Inc.
+;; Copyright (C) 1994, 1995, 1997 - 2017, 2019 - 2022 Free Software
Foundation, Inc.
;;
;; Author: Stephen Leake <stephen_leake@member.fsf.org>
;; Maintainer: Stephen Leake <stephen_leake@member.fsf.org>
@@ -53,24 +53,40 @@ Values defined by compiler packages.")
Called by `syntax-propertize', which is called by font-lock in
`after-change-functions'.")
-(defun ada-declarative-region-start-p (cache)
- "Return t if cache is a keyword starting a declarative region."
- (memq (wisi-cache-token cache) '(DECLARE IS PRIVATE))
- ;; IS has a cache only if start of declarative region
- )
+(defun ada-validate-enclosing-declaration (error-on-fail parse-action)
+ "Call `wisi-validate-cache' on at least the declaration enclosing point."
+ ;; Not in wisi because it's not clear other languages have useful
+ ;; declarations, or they use other terms for them.
+ (cond
+ (wisi-incremental-parse-enable
+ (let (query-result
+ (pos (point)))
+ (while (not (and query-result
+ ;; package specs have no declarative_item
+ (memq (wisi-tree-node-id query-result)
'(declarative_item wisitoken_accept))))
+ (setq query-result (wisi-parse-tree-query wisi-parser-shared
'containing-statement pos))
+ (setq pos (car (wisi-tree-node-char-region query-result))))
+
+ (wisi-validate-cache (car (wisi-tree-node-char-region query-result))
+ (cdr (wisi-tree-node-char-region query-result))
+ error-on-fail
+ parse-action)))
+
+ (t
+ (wisi-validate-cache (point-min) (point-max) error-on-fail parse-action))))
+
(defun ada-goto-declarative-region-start ()
- "Goto start of declarative region containing point."
+ "Goto start of declarative region containing point.
+If in a statement, goto declarative region of the containing
+declaration. If already in a declaration at or before a
+declarative region start, goto containing region start."
(interactive)
- (wisi-validate-cache (point-min) (point-max) t 'navigate)
+ (ada-validate-enclosing-declaration t 'navigate)
(push-mark)
- (when (looking-back "declare" (line-beginning-position))
- ;; We just did ada-goto-declarative-region-start to get here; we
- ;; want the next one up.
- (backward-word 1))
+
(let ((done nil)
(start-pos (point))
- (outermost nil)
(cache (or (wisi-get-cache (point))
(wisi-backward-cache))))
@@ -81,32 +97,40 @@ Called by `syntax-propertize', which is called by font-lock
in
;; The typical use case for calling this fuction is to add a
;; use_clause for an identifier/operator at start-pos.
- (when cache ;; nil at bob
- (while (not done)
- (unless (wisi-cache-containing cache)
- (setq outermost t))
-
- (if (ada-declarative-region-start-p cache)
- (if (< (point) start-pos)
- ;; found it.
- (progn
- (forward-word);; past 'is' or 'declare'.
- (setq done t))
-
- ;; test/ada_mode-nominal.adb function F2
- ;;
- ;; start-point is in a subprogram_declarator,
- ;; formal_part, aspect_clause, etc; code that contains a
- ;; declarative part. We want the next level up.
- (if outermost
- ;; there is no next level up; add the use_clause in the
context_clause.
- (progn
- (setq cache (wisi-goto-containing cache))
- (setq done t))
-
- (setq cache (wisi-goto-containing cache))
- (setq cache (wisi-goto-containing cache))))
-
+ (while (not done)
+ (if (not cache) ;; nil at bob
+ (setq done t)
+
+ (if (memq (wisi-cache-token cache) '(DECLARE IS PRIVATE))
+ ;; IS has a cache only if start of declarative region
+ (progn
+ (forward-word);; past 'is' or 'declare'.
+ (if (< (point) start-pos)
+ ;; found it.
+ (setq done t)
+
+ ;; else goto containing declarative-region-start
+ ;;
+ ;; test/ada_mode-nominal.adb function F2
+ ;;
+ ;; start-point is in a subprogram_declarator,
+ ;; formal_part, aspect_clause, etc; code that contains a
+ ;; declarative part. We want the next level up.
+ (if (wisi-cache-containing cache)
+ (cl-ecase (wisi-cache-token cache)
+ (DECLARE
+ (setq cache (wisi-goto-containing cache)))
+
+ ((IS PRIVATE)
+ (setq cache (wisi-goto-containing cache)) ;; start of
current declaration
+ (setq cache (wisi-goto-containing cache)))
+ )
+
+ ;; else there is no next level up; stop here
+ ;; (probably in a context_clause).
+ (setq done t))))
+
+ ;; else keep searching.
(cl-case (wisi-cache-class cache)
(motion
(setq cache (wisi-goto-containing cache)));; statement-start
@@ -129,21 +153,38 @@ Called by `syntax-propertize', which is called by
font-lock in
(cl-case (wisi-cache-nonterm cache)
(generic_package_declaration
(setq cache (wisi-next-statement-cache cache)) ;; 'package'
- (setq cache (wisi-next-statement-cache cache))) ;; 'is'
+ (setq cache (wisi-next-statement-cache cache)) ;; 'is'
+
+ (when (< start-pos (point))
+ (wisi-goto-start cache)
+ (setq cache (wisi-backward-cache))))
(package_declaration
- (setq cache (wisi-next-statement-cache cache))) ;; 'is'
+ (setq cache (wisi-next-statement-cache cache)) ;; 'is'
+
+ (when (< start-pos (point))
+ (wisi-goto-start cache)
+ (setq cache (wisi-backward-cache))))
((entry_body package_body protected_body subprogram_body
task_body)
(while (not (eq 'IS (wisi-cache-token cache)))
- (setq cache (wisi-next-statement-cache cache))))
+ (setq cache (wisi-next-statement-cache cache)))
+
+ (when (< start-pos (point))
+ (wisi-goto-start cache)
+ (ada-validate-enclosing-declaration t 'navigate)
+ (setq cache (wisi-backward-cache))))
((protected_type_declaration single_protected_declaration
single_task_declaration task_type_declaration)
(while (not (eq 'IS (wisi-cache-token cache)))
(setq cache (wisi-next-statement-cache cache)))
(when (looking-at "\<new\>")
(while (not (eq 'WITH (wisi-cache-token cache)))
- (setq cache (wisi-next-statement-cache cache)))))
+ (setq cache (wisi-next-statement-cache cache))))
+
+ (when (< start-pos (point))
+ (wisi-goto-start cache)
+ (setq cache (wisi-backward-cache))))
(t
(setq cache (wisi-goto-containing cache t)))
@@ -180,35 +221,20 @@ is the package spec.")
;;;; refactor
-;; Refactor actions; must match wisi-ada.adb Refactor
-(defconst ada-refactor-method-object-to-object-method 1)
-(defconst ada-refactor-object-method-to-method-object 2)
+;; Refactor actions; must match wisi-ada.adb Refactor_Label
+(defconst ada-refactor-method-object-to-object-method 0)
+(defconst ada-refactor-object-method-to-method-object 1)
-(defconst ada-refactor-element-object-to-object-index 3)
-(defconst ada-refactor-object-index-to-element-object 4)
+(defconst ada-refactor-element-object-to-object-index 2)
+(defconst ada-refactor-object-index-to-element-object 3)
-(defconst ada-refactor-format-paramlist 5)
+(defconst ada-refactor-format-paramlist 4)
(defun ada-refactor (action)
- "Perform refactor action ACTION on symbol at point."
- (wisi-validate-cache (line-end-position -7) (line-end-position 7) t
'navigate)
- (save-excursion
- ;; We include punctuation and quote for operators.
- (skip-syntax-backward "w_.\"")
-
- ;; Skip leading punctuation, for "-Foo.Bar".
- (skip-syntax-forward ".")
-
- (let* ((edit-begin (point))
- (cache (wisi-goto-statement-start))
- (parse-begin (point))
- (parse-end (wisi-cache-end cache)))
- (if parse-end
- (setq parse-end (+ parse-end (wisi-cache-last (wisi-get-cache
(wisi-cache-end cache)))))
- ;; else there is a syntax error; missing end of statement
- (setq parse-end (point-max)))
- (wisi-refactor wisi--parser action parse-begin parse-end edit-begin)
- )))
+ "Perform refactor action ACTION at point."
+ (unless wisi-incremental-parse-enable
+ (wisi-validate-cache (line-end-position -7) (line-end-position 7) t
'navigate))
+ (wisi-refactor wisi-parser-shared action (point)))
(defun ada-refactor-1 ()
"Refactor Method (Object) => Object.Method.
@@ -285,32 +311,58 @@ current construct."
"Return t if point is inside the parameter-list of a subprogram declaration.
PARSE-RESULT must be the result of `syntax-ppss'."
;; (info "(elisp)Parser State" "*syntax-ppss*")
- (let (cache)
- (when (> (nth 0 parse-result) 0)
- ;; In parens. Request parse of region containing parens; that
+ (when (> (nth 0 parse-result) 0)
+ ;; In parens.
+ (cond
+ (wisi-incremental-parse-enable
+ (let ((node (wisi-parse-tree-query wisi-parser-shared 'node (nth 1
parse-result))))
+ (eq 'formal_part
+ (wisi-tree-node-id
+ (wisi-parse-tree-query wisi-parser-shared 'parent
(wisi-tree-node-address node) 1)))))
+
+ (t ;; not incremental parse
+
+ ;; Request parse of region containing parens; that
;; will be expanded to include the subprogram declaration, if
;; any,
(let* ((forward-sexp-function nil) ;; forward-sexp just does parens
(start (nth 1 parse-result))
(end (save-excursion (goto-char (nth 1 parse-result))
(forward-sexp) (point))))
(wisi-validate-cache start end nil 'navigate)
- (setq cache (wisi-get-cache start))
- ;; cache is nil if the parse failed
- (when cache
- (eq 'formal_part (wisi-cache-nonterm cache)))
- ))))
+ (let ((cache (wisi-get-cache start)))
+ ;; cache is nil if the parse failed
+ (when cache
+ (eq 'formal_part (wisi-cache-nonterm cache)))
+ )))
+ )))
(defun ada-format-paramlist ()
"Reformat the parameter list point is in."
(interactive)
- (condition-case nil
+ (condition-case-unless-debug nil
+ ;; FIXME: this aborts if missing close paren, but incremental parse can
handle that
(wisi-goto-open-paren)
(error
(user-error "Not in parameter list")))
- (funcall indent-line-function); so new list is indented properly
(when (not (looking-back "^[ \t]*" (line-beginning-position)))
+ ;; Left paren after code; ensure nominal spacing. See
+ ;; test/ada_mode-parens.adb If_Statement.
(delete-horizontal-space)
(insert " "))
+ (funcall indent-line-function); so reformatted list is indented properly
+ (when (not wisi-incremental-parse-enable)
+ ;; Force parse of current statement after indent
+ (let* ((paren (point))
+ (cache (wisi-goto-statement-start))
+ (parse-begin (point))
+ (parse-end (wisi-cache-end cache)))
+ (if parse-end
+ (setq parse-end (+ parse-end (wisi-cache-last (wisi-get-cache
(wisi-cache-end cache)))))
+ ;; else there is a syntax error; missing end of statement
+ (setq parse-end (point-max)))
+ (wisi-invalidate-cache 'navigate parse-begin)
+ (wisi-validate-cache parse-begin parse-end t 'navigate)
+ (goto-char paren)))
(ada-refactor ada-refactor-format-paramlist))
;;;; fix compiler errors
@@ -328,8 +380,8 @@ excluding leading pragmas."
(setq cache (wisi-forward-cache))
(cl-case (wisi-cache-nonterm cache)
(pragma_g (wisi-goto-end-1 cache))
- (use_clause (wisi-goto-end-1 cache))
- (with_clause
+ (use_package_clause (wisi-goto-end-1 cache))
+ ((limited_with_clause | nonlimited_with_clause)
(when (not begin)
(setq begin (line-beginning-position)))
(wisi-goto-end-1 cache))
@@ -411,14 +463,17 @@ sort-lines."
(ada-fix-sort-context-clause (car context-clause) (point)))
))
-(defun ada-fix-extend-with-clause (child-name)
+(defun ada-fix-extend-with-clause (partial-parent-name child-name)
"Assuming point is in a selected name, just before CHILD-NAME, add or
-extend a with_clause to include CHILD-NAME . "
+extend a with_clause to include CHILD-NAME."
+ ;; In GNAT Community 2020, point is before partial-parent-name; in
+ ;; earlier gnat, it is after.
+ (search-forward partial-parent-name (line-end-position) t)
(let ((parent-name-end (point)))
;; Find the full parent name; skip back to whitespace, then match
;; the name forward.
(skip-syntax-backward "w_.")
- (search-forward-regexp ada-name-regexp parent-name-end)
+ (search-forward-regexp ada-name-regexp parent-name-end t)
(let ((parent-name (match-string 0))
(context-clause (ada-fix-context-clause)))
(goto-char (car context-clause))
@@ -451,7 +506,7 @@ extend a with_clause to include CHILD-NAME . "
(delete-char 1)))
(defun ada-fix-add-use-type (type)
- "Insert `use type' clause for TYPE at start of declarative part for current
construct."
+ "Insert `use type' clause for TYPE."
(ada-goto-declarative-region-start); leaves point after 'is'
(newline-and-indent)
(cl-ecase ada-language-version
@@ -470,7 +525,7 @@ extend a with_clause to include CHILD-NAME . "
))
(defun ada-fix-add-use (package)
- "Insert `use' clause for PACKAGE at start of declarative part for current
construct."
+ "Insert `use' clause for PACKAGE."
(ada-goto-declarative-region-start); leaves point after 'is'
(newline-and-indent)
(insert "use " package ";"))
@@ -488,20 +543,17 @@ extend a with_clause to include CHILD-NAME . "
(interactive)
(wisi-goto-statement-start)
;; point is at start of subprogram specification;
- ;; wisi-parse-expand-region will find the terminal semicolon.
- (wisi-validate-cache (point-min) (point-max) t 'navigate)
(let* ((begin (point))
(end (wisi-cache-end (wisi-get-cache (point))))
(name (wisi-next-name)))
(goto-char end)
- (newline)
- (insert " is begin\n\nend ");; legal syntax; parse does not fail
+ (insert "\nis begin\nnull;\nend ")
(insert name)
(forward-char 1)
;; newline after body to separate from next body
- (newline-and-indent)
+ (newline)
(indent-region begin (point))
(forward-line -2)
(back-to-indentation)
@@ -743,7 +795,7 @@ Deselects the current project first."
((wisi-in-string-p)
;; In an operator, or a string literal
(let (start)
- (skip-chars-backward "+*/&<>=-")
+ (skip-chars-backward "+*/&<>=-andxorme") ;; Ada operator string content
(see ada-operator-re).
(setq start (point))
(cond
((and (= (char-before) ?\")
diff --git a/ada-gnat-xref.el b/ada-gnat-xref.el
index 6ddb49de95..e357d285fb 100644
--- a/ada-gnat-xref.el
+++ b/ada-gnat-xref.el
@@ -5,7 +5,7 @@
;;
;; GNAT is provided by AdaCore; see http://libre.adacore.com/
;;
-;;; Copyright (C) 2012 - 2022 Free Software Foundation, Inc.
+;;; Copyright (C) 2012 - 2021 Free Software Foundation, Inc.
;;
;; Author: Stephen Leake <stephen_leake@member.fsf.org>
;; Maintainer: Stephen Leake <stephen_leake@member.fsf.org>
@@ -140,7 +140,8 @@ elements of the result may be nil."
(or (ada-gnat-xref-adj-col identifier col) ""))))
(defun ada-gnat-xref-refs (project item all)
- ;; WORKAROUND: xref 1.3.2 xref-location changed from defclass to cl-defstruct
+ ;; WORKAROUND: xref 1.3.2 xref-location changed from defclass to
+ ;; cl-defstruct. If drop emacs 26, use 'with-suppressed-warnings'.
(with-no-warnings ;; "unknown slot"
(let ((summary (if (functionp 'xref-item-summary) (xref-item-summary item)
(oref item summary)))
(location (if (functionp 'xref-item-location) (xref-item-location
item) (oref item location))))
@@ -160,7 +161,10 @@ elements of the result may be nil."
(gnat-run project (ada-gnat-xref-common-cmd project) args)
(goto-char (point-min))
- (when ada-gnat-debug-run (forward-line 2)); skip ADA_PROJECT_PATH,
'gnat find'
+ (when ada-gnat-debug-run (forward-line 2)); skip ADA_PROJECT_PATH,
command
+ (if (looking-at "WARNING: gnatfind is obsolete.*")
+ ;; Added in gnat pro 23
+ (forward-line 2))
(while (not (eobp))
(cond
diff --git a/ada-indent-user-options.el b/ada-indent-user-options.el
index 479b4b2bff..1f735b4014 100644
--- a/ada-indent-user-options.el
+++ b/ada-indent-user-options.el
@@ -1,6 +1,6 @@
;; user options shared by Ada mode indentation engines -*- lexical-binding:t
-*-
;;
-;; Copyright (C) 2012, 2013, 2015, 2017 - 2020 Free Software Foundation, Inc.
+;; Copyright (C) 2012, 2013, 2015, 2017 - 2021 Free Software Foundation, Inc.
;;
;; Author: Stephen Leake <stephen_leake@member.fsf.org>
;; Contributors: Simon Wright <simon.j.wright@mac.com>
@@ -175,7 +175,7 @@ Otherwise, indent by `ada-indent-broken' relative to the
start of
the expression."
:type 'boolean
:safe #'booleanp)
-(make-variable-buffer-local 'ada-indent-hanging-rel-exp)
+(make-obsolete-variable 'ada-indent-hanging-rel-exp "" "ada-mode 4.0.0")
(defcustom ada-indent-after-trailing-comment t
"If t, align comment lines imediately following a comment on the
@@ -185,14 +185,26 @@ the expression."
:safe #'booleanp)
(make-variable-buffer-local 'ada-indent-after-trailing-comment)
-(defcustom ada-end-name-optional nil
+(defcustom ada-indent-subprogram-is ada-indent-broken
+ "Indentation for `is' relative to `function' or `procedure' when
+the subprogram body is a short form; \"is null\", expression
+function, etc.
+
+An example is:
+ function A return Integer
+ >>is (B);"
+ :type 'integer
+ :safe #'integerp)
+(make-variable-buffer-local 'ada-indent-subprogram-is)
+
+(defcustom ada-end-name-optional t
"If t, names at ends of blocks/subprograms are optional (as in
standard Ada). If nil, they are required; this helps in error
recovery, and matches the gnat style option -gnatye.
-Default is nil because it significantly improves error recovery."
+Default is t for new Ada users."
:type 'boolean
:safe #'booleanp)
-(make-variable-buffer-local 'ada-indent-hanging-rel-exp)
+(make-variable-buffer-local 'ada-end-name-optional)
(provide 'ada-indent-user-options)
diff --git a/ada-mode.el b/ada-mode.el
index 5b655e5fca..3069a81e64 100644
--- a/ada-mode.el
+++ b/ada-mode.el
@@ -7,7 +7,7 @@
;; Keywords: languages
;; ada
;; Version: 7.2.1
-;; package-requires: ((uniquify-files "1.0.1") (wisi "3.1.8") (emacs "25.3"))
+;; package-requires: ((uniquify-files "1.0.1") (wisi "3.1.5") (emacs "25.3"))
;; url: http://www.nongnu.org/ada-mode/
;;
;; This file is part of GNU Emacs.
@@ -106,7 +106,7 @@
(require 'ada-core)
(require 'ada-indent-user-options)
-(require 'ada-process)
+(require 'ada_annex_p-process)
(require 'ada-skel)
(require 'align)
(require 'cl-lib)
@@ -117,7 +117,7 @@
(defun ada-mode-version ()
"Return Ada mode version."
(interactive)
- (let ((version-string "7.1.8"))
+ (let ((version-string "7.2.1.0 beta"))
(if (called-interactively-p 'interactive)
(message version-string)
version-string)))
@@ -212,6 +212,10 @@ nil, only the file name."
(define-key map "\C-c\C-\M-y" 'wisi-case-create-partial-exception)
(define-key map [C-down-mouse-3] 'ada-popup-menu)
+ (define-key map "\C-cr1" 'ada-refactor-1)
+ (define-key map "\C-cr2" 'ada-refactor-2)
+ (define-key map "\C-cr3" 'ada-refactor-3)
+ (define-key map "\C-cr4" 'ada-refactor-4)
(wisi-case-activate-keys map)
map
@@ -435,8 +439,8 @@ button was clicked."
(modify-syntax-entry ?& "." table)
(modify-syntax-entry ?* "." table)
(modify-syntax-entry ?+ "." table)
- (modify-syntax-entry ?- ". 124" table); operator, double hyphen as comment
- (modify-syntax-entry ?. "." table)
+ (modify-syntax-entry ?- ". 12" table); double hyphen as comment start
+ (modify-syntax-entry ?. "." table)
(modify-syntax-entry ?/ "." table)
(modify-syntax-entry ?: "." table)
(modify-syntax-entry ?< "." table)
@@ -446,7 +450,7 @@ button was clicked."
(modify-syntax-entry ?\' "." table); attribute; see ada-syntax-propertize
for character literal
(modify-syntax-entry ?\; "." table)
(modify-syntax-entry ?\\ "." table); default is escape; not correct for
Ada strings
- (modify-syntax-entry ?\| "." table)
+ (modify-syntax-entry ?\| "." table)
;; \f and \n end a comment.
(modify-syntax-entry ?\f ">" table)
@@ -523,15 +527,19 @@ See `ff-other-file-alist'.")
(defconst ada-declaration-nonterms
'(
abstract_subprogram_declaration
+ attribute_definition_clause
entry_body
entry_declaration
expression_function_declaration
+ exception_declaration
full_type_declaration
generic_instantiation
generic_package_declaration
generic_subprogram_declaration
null_procedure_declaration
+ number_declaration
object_declaration
+ object_renaming_declaration
package_body
package_declaration
pragma_g
@@ -539,15 +547,18 @@ See `ff-other-file-alist'.")
private_type_declaration
protected_body
protected_type_declaration
+ renaming_declaration
single_protected_declaration
single_task_declaration
subprogram_body
+ subprogram_body_stub
subprogram_declaration
subprogram_renaming_declaration
subtype_declaration
task_body
task_type_declaration
use_clause
+ use_type_clause
)
"wisi-cache nonterminal symbols that are Ada declarations.")
@@ -616,76 +627,84 @@ See `ff-other-file-alist'.")
(defun ada-which-function (&optional include-type)
"Return name of subprogram/task/package containing point.
Also sets ff-function-name for ff-pre-load-hook."
- (interactive) ;; because which-function-mode does not provide which-function
to call intermittently!
+ (interactive)
+ ;; which-function-mode does not provide which-function to call
+ ;; interactively!
+
;; Fail gracefully and silently, since this could be called from
;; which-function-mode.
- (let ((parse-begin (max (point-min) (- (point) (/ ada-which-func-parse-size
2))))
- (parse-end (min (point-max) (+ (point) (/ ada-which-func-parse-size
2)))))
- (save-excursion
- (condition-case nil
- (progn
- (wisi-validate-cache parse-begin parse-end nil 'navigate)
- (when (wisi-cache-covers-region parse-begin parse-end 'navigate)
- (let ((result nil)
- (cache (ada-goto-declaration-start-1 include-type)))
- (if (null cache)
- ;; bob or failed parse
- (setq result "")
-
- (when (memq (wisi-cache-nonterm cache)
- '(generic_package_declaration
generic_subprogram_declaration))
- ;; name is after next statement keyword
- (setq cache (wisi-next-statement-cache cache)))
-
- ;; add or delete 'body' as needed
- (cl-ecase (wisi-cache-nonterm cache)
- ((entry_body entry_declaration)
- (setq result (ada-which-function-1 "entry" nil)))
-
- ((full_type_declaration private_type_declaration)
- (setq result (ada-which-function-1 "type" nil)))
-
- (package_body
- (setq result (ada-which-function-1 "package" nil)))
-
- ((package_declaration
- package_specification) ;; after 'generic'
- (setq result (ada-which-function-1 "package" t)))
-
- (protected_body
- (setq result (ada-which-function-1 "protected" nil)))
-
- ((protected_type_declaration single_protected_declaration)
- (setq result (ada-which-function-1 "protected" t)))
-
- ((abstract_subprogram_declaration
- expression_function_declaration
- subprogram_declaration
- subprogram_renaming_declaration
- generic_subprogram_declaration ;; after 'generic'
- null_procedure_declaration)
- (setq result (ada-which-function-1
- (progn (search-forward-regexp
"function\\|procedure")(match-string 0))
- nil))) ;; no 'body' keyword in subprogram
bodies
-
- (subprogram_body
- (setq result (ada-which-function-1
- (progn (search-forward-regexp
"function\\|procedure")(match-string 0))
- nil)))
-
- ((single_task_declaration task_type_declaration)
- (setq result (ada-which-function-1 "task" t)))
-
+ (cond
+ (wisi-incremental-parse-enable
+ (ada-validate-enclosing-declaration nil 'navigate))
- (task_body
- (setq result (ada-which-function-1 "task" nil)))
- ))
- (when (called-interactively-p 'interactive)
- (message result))
- result)))
- (error "")))
+ (t
+ (wisi-validate-cache (max (point-min) (- (point) (/
ada-which-func-parse-size 2)))
+ (min (point-max) (+ (point) (/
ada-which-func-parse-size 2)))
+ nil
+ 'navigate)
))
+ (save-excursion
+ (condition-case nil
+ (let ((result nil)
+ (cache (ada-goto-declaration-start-1 include-type)))
+ (if (null cache)
+ ;; bob or failed parse
+ (setq result "")
+
+ (when (memq (wisi-cache-nonterm cache)
+ '(generic_package_declaration
generic_subprogram_declaration))
+ ;; name is after next statement keyword
+ (setq cache (wisi-next-statement-cache cache)))
+
+ ;; add or delete 'body' as needed
+ (cl-ecase (wisi-cache-nonterm cache)
+ ((entry_body entry_declaration)
+ (setq result (ada-which-function-1 "entry" nil)))
+
+ ((full_type_declaration private_type_declaration)
+ (setq result (ada-which-function-1 "type" nil)))
+
+ (package_body
+ (setq result (ada-which-function-1 "package" nil)))
+
+ ((package_declaration
+ package_specification) ;; after 'generic'
+ (setq result (ada-which-function-1 "package" t)))
+
+ (protected_body
+ (setq result (ada-which-function-1 "protected" nil)))
+
+ ((protected_type_declaration single_protected_declaration)
+ (setq result (ada-which-function-1 "protected" t)))
+
+ ((abstract_subprogram_declaration
+ expression_function_declaration
+ subprogram_declaration
+ subprogram_renaming_declaration
+ generic_subprogram_declaration ;; after 'generic'
+ null_procedure_declaration)
+ (setq result (ada-which-function-1
+ (progn (search-forward-regexp
"function\\|procedure")(match-string 0))
+ nil))) ;; no 'body' keyword in subprogram bodies
+
+ ((subprogram_body subunit)
+ (setq result (ada-which-function-1
+ (progn (search-forward-regexp
"function\\|procedure")(match-string 0))
+ nil)))
+
+ ((single_task_declaration task_type_declaration)
+ (setq result (ada-which-function-1 "task" t)))
+
+
+ (task_body
+ (setq result (ada-which-function-1 "task" nil)))
+ ))
+ (when (called-interactively-p 'interactive)
+ (message result))
+ result)
+ (error ""))))
+
(defun ada-add-log-current-function ()
"For `add-log-current-defun-function'."
;; add-log-current-defun is typically called with point at the start
@@ -750,7 +769,6 @@ previously set by a file navigation command."
(setq done t)))
(when found
(goto-char found)
- ;; different parsers find different points on the line; normalize here
(back-to-indentation))
(setq ff-function-name nil))))
@@ -852,6 +870,8 @@ compiler-specific compilation filters."
;; doesn't change, at least on Windows.
(let ((start-buffer (current-buffer))
pos item file)
+ (when (eq major-mode 'compilation-mode)
+ (setq compilation-last-buffer (current-buffer)))
;; We use `pop-to-buffer', not `set-buffer', so point is correct
;; for the current window showing compilation-last-buffer, and
;; moving point in that window works. But that might eat an
@@ -915,10 +935,11 @@ compiler-specific compilation filters."
((abstract_subprogram_declaration
expression_function_declaration
+ null_procedure_declaration
subprogram_body
subprogram_declaration
subprogram_renaming_declaration
- null_procedure_declaration)
+ subunit)
(memq (wisi-cache-token cache) '(NOT OVERRIDING FUNCTION
PROCEDURE)))
((single_task_declaration task_body task_type_declaration)
@@ -939,7 +960,8 @@ compiler-specific compilation filters."
subprogram, or task declaration point is currently in or just
after. For `beginning-of-defun-function'."
(interactive)
- (wisi-validate-cache (point-min) (point-max) t 'navigate)
+ (push-mark)
+ (ada-validate-enclosing-declaration t 'navigate)
(ada-goto-declaration-start-1 include-type))
(defun ada-goto-declaration-end ()
@@ -1069,7 +1091,8 @@ The ident for the paragraph is taken from the first line."
"List of Ada keywords for current `ada-language-version'.")
(defun ada-font-lock-keywords ()
- "Return Ada mode value for `font-lock-keywords', depending on
`ada-language-version'."
+ "Return Ada mode value for `font-lock-keywords',
+Depends on `ada-language-version'."
;; Grammar actions set `font-lock-face' property for all
;; non-keyword tokens that need it.
(list
@@ -1131,7 +1154,7 @@ Otherwise, allow UPPERCASE for identifiers."
;;;; wisi integration
-(defconst ada-wisi-language-protocol-version "3"
+(defconst ada-wisi-language-protocol-version "4"
"Defines language-specific parser parameters.
Must match wisi-ada.ads Language_Protocol_Version.")
@@ -1140,6 +1163,7 @@ Must match wisi-ada.ads Language_Protocol_Version.")
)
(cl-defmethod wisi-parse-format-language-options ((_parser ada-wisi-parser))
+ ;; Must match code in wisi-ada.adb Initialize
(format "%d %d %d %d %d %d %d %d %d %d %d %d %d"
ada-indent
ada-indent-broken
@@ -1152,15 +1176,30 @@ Must match wisi-ada.ads Language_Protocol_Version.")
ada-indent-use
ada-indent-when
ada-indent-with
- (if ada-indent-hanging-rel-exp 1 0)
+ ada-indent-subprogram-is
(if ada-end-name-optional 1 0)
))
(defconst ada-wisi-named-begin-regexp
- "\\_<function\\_>\\|\\_<package\\_>\\|\\_<procedure\\_>\\|\\_<task\\_>"
+ "\\(?:\\_<overriding\\_>
+\\)?\\(?:\\_<function\\_>\\|\\_<package\\_>\\|\\_<procedure\\_>\\|\\_<task\\_>\\)"
)
(defconst ada-wisi-partial-begin-regexp
+ ;; We have to include 'begin' here; consider:
+ ;;
+ ;;
+ ;; end Copy_Node;
+ ;; begin
+ ;; Destination.Leading_Non_Grammar;
+ ;;
+ ;; indenting 'Destination'. If we don't include 'begin', then
+ ;; 'Destination' is indented ada-indent relative to 'end
+ ;; Copy_Node', and there is no error to allow us to correct it.
+ ;;
+ ;; We'd like to include 'return' for extended return statement, but
+ ;; that gets confused with 'return' in a function declaration or
+ ;; non-extended return.
+
(concat "\\_<begin\\_>\\|\\_<declare\\_>\\|"
ada-wisi-named-begin-regexp
"\\|\\_<end;\\|\\_<end " ada-name-regexp ";"))
@@ -1193,11 +1232,8 @@ Must match wisi-ada.ads Language_Protocol_Version.")
;;
;; This is handled by the set of keywords in
;; ada-wisi-partial-begin-regexp.
- (cond
- ((looking-at "[ \t]*\\_<begin\\_>")
- ;; indenting 'begin'; best option is to assume it is indented properly
- (point))
+ (cond
((wisi-search-backward-skip
ada-wisi-partial-begin-regexp
(lambda () (or (wisi-in-string-or-comment-p)
@@ -1262,7 +1298,7 @@ Point must have been set by `ada-wisi-find-begin'."
;; Point is at bol
(back-to-indentation)
(when (looking-at ada-wisi-named-begin-regexp)
- (skip-syntax-forward "ws")
+ (goto-char (match-end 0))
(skip-syntax-forward " ")
(when (looking-at "body\\|type")
(goto-char (match-end 0))
@@ -1308,13 +1344,49 @@ Point must have been set by `ada-wisi-find-begin'."
(cl-defmethod wisi-parse-adjust-indent ((_parser ada-wisi-parser) indent
repair)
(cond
- ((or (wisi-list-memq (wisi--parse-error-repair-inserted repair) '(BEGIN IF
LOOP))
- (wisi-list-memq (wisi--parse-error-repair-deleted repair) '(END)))
- ;; Error token terminates the block containing the start token
+ ((wisi-list-memq (wisi--parse-error-repair-inserted repair) '(BEGIN IF
LOOP))
+ ;; case 1:
+ ;; ...
+ ;; end;
+ ;; else
+ ;; declare
+ ;;
+ ;; Indenting 'declare'; parse begin after 'end;', recover inserted
+ ;; 'if then' before 'else', so result is ada-indent relative to
+ ;; 'end;', but we want 0 relative to end
(- indent ada-indent))
- ((equal '(CASE IS) (wisi--parse-error-repair-inserted repair))
- (- indent (+ ada-indent ada-indent-when)))
+ ((wisi-list-memq (wisi--parse-error-repair-deleted repair) '(END))
+ ;; test/ada_mode-partial_parse.adb
+ ;;
+ ;; B;
+ ;;
+ ;; end
+ ;;
+ (cond
+ ((= (point) (wisi--parse-error-repair-pos repair))
+ ;; Indenting the 'end' that was deleted.
+ (- indent ada-indent))
+
+ ((< (point) (wisi--parse-error-repair-pos repair))
+ ;; indenting something else after "B;"
+ (- indent (* 2 ada-indent)))
+
+ (t ;; indenting something after 'end';
test/ada_mode-recover-partial_10.adb
+ (- indent ada-indent))))
+
+ ((equal '(CASE IDENTIFIER IS) (wisi--parse-error-repair-inserted repair))
+ ;; test/ada_mode-partial_parse.adb
+ ;; end loop;
+ ;; ...
+ ;; when Face =>
+ ;;
+ ;; indenting 'when', or the new blank line after 'when'. CASE
+ ;; IDENTIFIER IS was inserted by error recover, immediately before
+ ;; 'when'.
+ (if (looking-at "when")
+ (- indent ada-indent-when)
+ (- indent (+ ada-indent ada-indent-when))))
((equal '(END CASE SEMICOLON) (wisi--parse-error-repair-inserted repair))
(+ indent (+ ada-indent ada-indent-when)))
@@ -1446,16 +1518,9 @@ For `wisi-indent-calculate-functions'.
))
)))
-(defun ada-wisi-post-parse-fail ()
- "For `wisi-post-parse-fail-hook'."
- ;; Parse indent succeeded, so we assume parse navigate will as well
- (wisi-validate-cache (point-min) (line-end-position) nil 'navigate)
- (save-excursion
- (let ((start-cache (wisi-goto-start (or (wisi-get-cache (point))
(wisi-backward-cache)))))
- (when start-cache
- ;; nil when in a comment at point-min
- (indent-region (point) (wisi-cache-end start-cache)))
- ))
+(defun ada-wisi-post-indent-fail ()
+ "For `wisi-post-indent-fail-hook'."
+ (wisi-indent-statement)
(back-to-indentation))
(defun ada-find-file ()
@@ -1523,6 +1588,23 @@ Prompts with completion, defaults to filename at point."
(defvar which-func-functions) ;; which-func.el
(defvar which-func-non-auto-modes) ;; ""
+;;;###autoload
+(cl-defun ada-parse-require-process (&key wait)
+ "Start the Ada parser in an external process, if not already started.
+Unless WAIT, does not wait for parser to respond. Returns the parser object."
+ (interactive)
+ (let ((parser (wisi-process-parse-get
+ (make-ada-wisi-parser
+ :label "Ada"
+ :language-protocol-version ada-wisi-language-protocol-version
+ :exec-file ada-process-parse-exec
+ :exec-opts ada-process-parse-exec-opts
+ :face-table ada_annex_p-process-face-table
+ :token-table ada_annex_p-process-token-table
+ :repair-image ada_annex_p-process-repair-image))))
+ (wisi-parse-require-process parser :nowait (not wait))
+ parser))
+
;;;###autoload
(define-derived-mode ada-mode prog-mode "Ada"
"The major mode for editing Ada code."
@@ -1533,7 +1615,7 @@ Prompts with completion, defaults to filename at point."
(set (make-local-variable 'parse-sexp-ignore-comments) t)
(set (make-local-variable 'parse-sexp-lookup-properties) t)
- (set 'case-fold-search t); Ada is case insensitive; the syntax parsing
requires this setting
+ (set 'case-fold-search t); Ada is case insensitive
(set 'completion-ignore-case t)
(set (make-local-variable 'comment-start) "--")
(set (make-local-variable 'comment-end) "")
@@ -1553,7 +1635,7 @@ Prompts with completion, defaults to filename at point."
(setq font-lock-defaults
'(ada-font-lock-keywords ;; keywords
- nil ;; keywords only; comment, string faces not set by wisi parser
+ nil ;; keywords-only; font-lock set comment, string faces
t ;; case-fold
((?\_ . "w")))); treat underscore as a word component
@@ -1604,17 +1686,8 @@ Prompts with completion, defaults to filename at point."
(wisi-setup
:indent-calculate '(ada-wisi-comment)
- :post-indent-fail 'ada-wisi-post-parse-fail
- :parser
- (wisi-process-parse-get
- (make-ada-wisi-parser
- :label "Ada"
- :language-protocol-version ada-wisi-language-protocol-version
- :exec-file ada-process-parse-exec
- :exec-opts ada-process-parse-exec-opts
- :face-table ada-process-face-table
- :token-table ada-process-token-table
- :repair-image ada-process-repair-image)))
+ :post-indent-fail 'ada-wisi-post-indent-fail
+ :parser (ada-parse-require-process))
(setq wisi-prj-parse-undefined-function #'ada-prj-parse-undefined)
(setq wisi-xref-full-path ada-xref-full-path)
diff --git a/ada-mode.texi b/ada-mode.texi
index 3612878443..21bece042f 100644
--- a/ada-mode.texi
+++ b/ada-mode.texi
@@ -25,7 +25,7 @@ developing GNU and promoting software freedom.''
@titlepage
@sp 10
-@title Ada Mode Version 7.2.1
+@title Ada Mode Version 7.1.3
@page
@vskip 0pt plus 1filll
@insertcopying
@@ -37,7 +37,7 @@ developing GNU and promoting software freedom.''
@node Top, Overview, (dir), (dir)
@top Top
-Ada Mode Version 7.2.1
+Ada Mode Version 7.1.3
@end ifnottex
@menu
@@ -80,7 +80,6 @@ Customizing Ada mode
* Non-standard file names::
* Other compiler::
* Other cross-reference::
-* Other customization::
Compiling Executing
@@ -102,6 +101,10 @@ Project files
* Project file overview::
* Project file variables::
+Indentation
+
+* Ada-specific indent functions::
+
Developer overview
* Directory structure::
@@ -133,7 +136,7 @@ naming convention or compiler; @xref{Non-standard file
names},
@xref{Other compiler}.
In addition, you may want to customize the indentation,
-capitalization, and other things; @xref{Other customization}.
+capitalization, and other things; @xref{Customization}.
Finally, for large Ada projects, you will want to set up an Emacs Ada
mode project file for each project; @xref{Project files}. Note that
@@ -261,19 +264,32 @@ changes, to force a complete rebuild.
@node Building GNATCOLL
@subsection Building GNATCOLL
-Download gnatcoll-db from
+The GNAT Community and GNAT pro binary installs have some of the
+GNATCOLL packages we need, but we need to install others from source.
+
+Debian 11 provides binary packages for the GNATCOLL packages we need;
+@table @samp
+@item libgnatcoll-db-bin
+@item libgnatcoll-iconv20-dev
+@item libgnatcoll-sql4-dev
+@item libgnatcoll-sqlite20-dev
+@item libgnatcoll-xref21-dev
+@end table
+
+Debian does not provide a binary for gnatstub.
+
+If you are using GNAT Community, download gnatcoll-db from
@url{https://github.com/AdaCore/gnatcoll-db}; select the latest
release branch (or the one that matches your compiler), click on the
``clone or download'' button, select ``Download ZIP''.
-@c branch nn-sustained?
+If you are using GNAT Pro, download @file{gnatcoll-db.tar.gz} from the
+GNAT Studio sources in GNAT Tracker.
-Similarly, download gnatcoll-bindings from
-@url{https://github.com/AdaCore/gnatcoll-bindings/tree/20.2} (for
-gnatcoll-iconv; not needed for GNAT Community 2020 on Windows).
+Similarly, if needed for your OS, download gnatcoll-bindings from the
+GNAT Community sources. This is for gnatcoll-iconv; not needed on
+Windows.
-@c FIXME: gnatcoll-bindings is in community download Sources
-@c FIXME: table of os/gnat version that need/don't need iconv;
@c debian/comm-2020 requires gnatcoll-iconv
@c debian/pro-21.1 requires gnatcoll-iconv
@@ -281,17 +297,20 @@ Then unpack, build, and install the required components.
If you are
unsure whether you need to install iconv, skip that step; a later step
will complain if it is needed.
-@c FIXME: ada-mode uses -gnat2020, which makes one expression in
-@c gnatcoll-sql ambiguous. Change that, and specify -gnat2020 in .gpr
+If @code{./setup.py} complains it can't find @code{python}, try
+@code{python3 setup.py ...}.
+
+For github gnatcoll-db version 21.2, apply gnatcoll-2021-sql.diff.
+
@example
-unzip ~/Downloads/gnatcoll-bindings-20.2.zip
-cd gnatcoll-bindings-20.2
+unzip ~/Downloads/gnatcoll-bindings-22.2.zip
+cd gnatcoll-bindings-22.2
cd iconv
./setup.py build
./setup.py install
-unzip ~/Downloads/gnatcoll-db-20.2.zip
-cd gnatcoll-db-20.2
+unzip ~/Downloads/gnatcoll-db-22.2.zip
+cd gnatcoll-db-22.2
make -C sql
make -C sql install
make -C sqlite
@@ -339,7 +358,7 @@ found in @code{PATH}.
Here we list GNAT compiler versions that are known to work or not work
with ada-mode.
-There are various ways to get the compiler:
+There are various ways to get the GNAT compiler:
@table @samp
@item Community
Downloaded from @url{https://www.adacore.com/download}. The version
@@ -370,6 +389,9 @@ in the area of access types. So some compiler versions may
require
minor edits of the code; there is a ``WORKAROUND'' comment in the code
describing the edit required.
+Sometimes there is a bug in the gnatcoll source; we provide a patch
+file.
+
Compiler versions that work:
@table @samp
@item Community 2019
@@ -377,10 +399,23 @@ Reports an error about a dangling reference; see
WORKAROUND comment in
@file{~/.emacs.d/elpa/wisi-i.j.k/sal-gen_unbounded_definite_red_black_trees.adb}
@item Community 2020
-no edits required
+No edits required.
+
+@item Community 2021
+Requires ada-mode version 7.1.6 or later.
+
+gnatcoll requires a patch; @xref{Building GNATCOLL}.
@item Pro 20.2
-no edits required
+Requires ada-mode version 7.1.6 or later.
+
+No edits required.
+
+@item Pro 21.2
+No edits required.
+
+@item Pro 22.2
+No edits required.
@item FSF 11.1.0
@end table
@@ -507,20 +542,31 @@ first.
* Non-standard file names::
* Other compiler::
* Other cross-reference::
-* Other customization::
@end menu
@node Slow response
@section Slow response
-In large files, parsing takes a noticable amount of time, so it gets
-in the way of interactive typing due to immediate fontification
-triggering a parse.
+The external process that runs the Ada parser can be slow to start,
+due to loading the very large LR1 parse table. The impact of this can
+be minimized by starting the process before it is actually needed, by
+executing @code{ada-parse-require-process} as part of Emacs startup.
-There are three ways to deal with this:
+In addition, in large files, parsing takes a noticable amount of time,
+so it gets in the way of interactive typing due to immediate
+fontification triggering a parse.
+
+There are several ways to deal with this:
@enumerate
-@item Set @code{wisi-partial-parse-threshold}
+@item Set @code{wisi-incremental-parse-enabled t}
+This enables incremental parsing. In this mode, the entire file is
+parsed once when it is opened, and then changes to the text are parsed
+incrementally, which is both fast and accurate.
+
+@item Lower @code{wisi-partial-parse-threshold}
+This assumes @code{wisi-incremental-parse-enabled} is @code{nil}.
+
In your @file{~./emacs}:
@example
@@ -625,7 +671,7 @@ the indirection variables.
See @file{ada-compiler-gnat.el} for an example.
-@node Other cross-reference, Other customization, Other compiler, Customization
+@node Other cross-reference
@section Other cross-reference
The wisi project variable @code{xref_tool} (default elisp variable
@code{ada-xref-tool}) controls dispatching in
@@ -642,9 +688,6 @@ Emacs lisp code that provides the interface to the tool,
and set
See @file{ada-gnat-xref.el} and @file{gpr-query.el} for examples.
-@node Other customization, , Other cross-reference, Customization
-@section Other customization
-
@node Compiling Executing, Project files, Customization, Top
@chapter Compiling Executing
@@ -1335,8 +1378,8 @@ The fix is to use a different function in
@code{project-find-functions}; @code{wisi-prj-current-cached}. This
uses a global variable to indicate what the current project is. wisi
provides four different functions for
-@code{project-find-functions}. @xref{Selecting projects, Selecting
-projects, Selecting projects, wisi}.
+@code{project-find-functions}. @xref{Selecting projects,,, wisi, Wisi
+User Guide}.
To change @code{project-find-functions}, execute:
@@ -1432,8 +1475,8 @@ references are accessed via @kbd{C-c `}.
@node Project files, Moving Through Ada Code, Compiling Executing, Top
@chapter Project files
-Ada mode uses
-wisi project files; @ref{Project files, Project files, Project files, wisi}.
+Ada mode uses wisi project files; @ref{Project files,,, wisi, Wisi
+User Guide}.
A wisi project file specifies what directories hold sources for your
project, and allows you to customize the compilation commands and
@@ -1466,7 +1509,7 @@ The current project file is shown by the menu command
To set the project file, use the menu command @key{Ada | Project Files | Find
and
select Project ...}, or one of the elisp functions described in
-@ref{Selecting Projects, Selecting Projects, Selecting Projects, wisi}.
+@ref{Selecting Projects,,, wisi, Wisi User Guide}.
The project file may also be a GNAT project file (with file extension
is @code{.gpr}).
@@ -1500,8 +1543,8 @@ xref tool, so it must occur before any compiler-specific
project
variable.
@item @code{casing}
-List of files containing casing exceptions. @xref{Automatic casing,
-Automatic casing, wisi.info}.
+List of files containing casing exceptions.
+@xref{Automatic casing,,, wisi, Wisi User Guide}.
@item @code{gnat-stub-args}
List of strings passed to @code{gnat stub} when it is run.
@@ -1849,6 +1892,29 @@ In rare cases, the parser gets confused; it can be reset
by invoking
menu @key{Ada | Misc | Restart parser}. Please report such cases as a
bug.
+@menu
+* Ada-specific indent functions::
+@end menu
+
+@node Ada-specific indent functions
+@section Ada-specific indent functions
+The following indent functions are defined by the ada-mode grammar
+backend (@xref{Indent functions,,, wisi, Wisi User Guide}).
+
+@table @code
+@item ada-indent-aggregate
+Insures that aggregates are indented consistently; see the code for
+more details. Only used once in the grammar; for @code{aggregate} in
+@code{primary}.
+
+@c FIXME: doc these!
+@item ada-indent-aspect
+@item ada-indent-renames
+@item ada-indent-return
+@item ada-indent-record
+@item ada-indent-record*
+@end table
+
@node Statement skeletons, Aligning code, Indentation, Top
@chapter Statement skeletons
@@ -1976,8 +2042,8 @@ all uppercase identifiers without defining a casing
exception.
@end table
You can define exceptions to these rules, in files specified by the
-@code{casing} project variable; @ref{Casing exception files, Casing
-exception files, Casing exception files, wisi}.
+@code{casing} project variable; @ref{Casing exception files,,, wisi,
+Wisi User Guide}.
There are two ways to add new items to a casing exception file: you
can simply edit it as you would edit any text file, or you can
@@ -2272,6 +2338,7 @@ ssh read/write git access to savannah ada-mode:
git clone stephen_leake@@git.sv.gnu.org:/srv/git/ada-mode.git \
-b org.emacs.ada-mode org.emacs.ada-mode
cd ada-mode
+git worktree add -b org.emacs.wisi ../org.emacs.wisi origin/org.emacs.wisi
git worktree add -b org.wisitoken ../org.wisitoken origin/org.wisitoken
git worktree add -b org.stephe_leake.sal ../org.stephe_leake.sal
origin/org.stephe_leake.sal
git worktree add -b org.stephe_leake.aunit_ext ../org.stephe_leake.aunit_ext
origin/org.stephe_leake.aunit_ext
diff --git a/ada-skel.el b/ada-skel.el
index 537a159c0a..21d1f377a0 100644
--- a/ada-skel.el
+++ b/ada-skel.el
@@ -1,6 +1,6 @@
;;; ada-skel.el --- Extension to Ada mode for inserting statement skeletons
-*- lexical-binding:t -*-
-;; Copyright (C) 1987, 1993, 1994, 1996-2020 Free Software Foundation, Inc.
+;; Copyright (C) 1987, 1993, 1994, 1996-2021 Free Software Foundation, Inc.
;; Authors: Stephen Leake <stephen_leake@stephe-leake.org>
@@ -129,13 +129,15 @@ This could end in a token recognized by
`ada-skel-expand'."
"Insert accept statement with name from `str'."
()
"accept " str " do\n"
+ "null;\n"
"end " str ";\n")
(define-skeleton ada-skel-case
"Insert case statement."
()
"case " str " is\n"
- "when " _ "=>\n"
+ "when A" _ " =>\n"
+ "null;\n"
"end case;\n")
(define-skeleton ada-skel-declare
@@ -145,40 +147,45 @@ This could end in a token recognized by
`ada-skel-expand'."
"declare\n"
_
"begin\n"
+ "null;\n"
"exception\n"
+ "when others =>\n"
+ "null;\n"
"end " str | -1 ";\n")
(define-skeleton ada-skel-entry
"Insert entry statement with name from `str'."
()
- "entry " str " when " _ "\n"
+ "entry " str " when A" _ "\n"
"is\n"
"begin\n"
+ "null;\n"
"end " str ";\n")
(define-skeleton ada-skel-for
"Insert a for loop statement with an optional name (from `str')."
()
str & " :\n"
- "for " _ " loop\n"
+ "for A in A" _ " loop\n"
+ "null;\n"
"end loop " str | -1 ";\n")
(define-skeleton ada-skel-function-body
"Insert a function body with name from `str'."
()
- "function " str " return \n"
+ "function " str " return A\n"
"is\n"
"begin\n"
- _
+ "null;\n" _
"end " str ";\n")
(define-skeleton ada-skel-function-spec
"Insert a function type specification with name from `str'."
()
- "function " str " return ;\n")
+ "function " str " return A;\n")
(define-skeleton ada-skel-header
- "Insert a file header comment, with automatic copyright year and prompt for
copyright owner/license.
+ "Insert a file header comment, prompt for copyright owner/license.
Each user will probably want to override this."
()
"-- Abstract :\n"
@@ -191,9 +198,12 @@ Each user will probably want to override this."
(define-skeleton ada-skel-if
"Insert an if statement."
()
- "if " _ " then\n"
- "elsif then\n"
+ "if A" _ " then\n"
+ "null;\n"
+ "elsif A then\n"
+ "null;\n"
"else\n"
+ "null;\n"
"end if;\n")
(define-skeleton ada-skel-loop
@@ -201,7 +211,7 @@ Each user will probably want to override this."
()
str & " :\n"
"loop\n"
- "exit " str | -1 " when " _ ";\n"
+ "exit " str | -1 " when A" _ ";\n"
"end loop " str | -1 ";\n")
(define-skeleton ada-skel-package-body
@@ -210,6 +220,7 @@ Each user will probably want to override this."
"package body " str " is\n"
_
"begin\n"
+ "null;\n"
"end " str ";\n")
(define-skeleton ada-skel-package-spec
@@ -227,7 +238,7 @@ See `ada-find-other-file' to create library level package
body from spec."
"procedure " str "\n"
"is\n"
"begin\n"
- _
+ "null;\n" _
"end " str ";\n")
(define-skeleton ada-skel-procedure-spec
@@ -254,21 +265,23 @@ See `ada-find-other-file' to create library level package
body from spec."
"Insert a record type declaration with a type name from `str'."
()
"type " str " is record\n"
- _
+ "null;\n"_
"end record;\n")
(define-skeleton ada-skel-return
"Insert an extended return statement."
()
- "return " _ " do\n"
+ "return A : A" _ " do\n"
+ "null;\n"
"end return;\n")
(define-skeleton ada-skel-select
"Insert a select statement."
()
"select\n"
- _
+ "accept A;\n"_
"else\n"
+ "null;\n"
"end select;\n")
(define-skeleton ada-skel-separate
@@ -281,23 +294,24 @@ See `ada-find-other-file' to create library level package
body from spec."
"Insert a task body with name from `str'."
()
"task body " str "\n"
- "is\n"
- _
+ "is\n" _
"begin\n"
+ "null;\n"
"end " str ";\n")
(define-skeleton ada-skel-task-spec
"Insert a task specification with name from `str'."
()
"task type " str " is\n"
- _
+ "entry A;\n" _
"end " str ";\n")
(define-skeleton ada-skel-while
"Insert a while loop statement with an optional name (from `str')."
()
str & ":\n"
- "while " _ " loop\n"
+ "while A" _ " loop\n"
+ "null;\n"
"end loop " str | -1 ";\n")
(define-skeleton ada-skel-with-use
@@ -352,7 +366,7 @@ See `ada-find-other-file' to create library level package
body from spec."
(defun ada-skel-setup ()
"Setup a buffer for ada-skel."
(setq wisi-skel-token-alist ada-skel-token-alist)
- (add-hook 'skeleton-end-hook 'wisi-indent-statement nil t)
+ (add-hook 'skeleton-end-hook #'wisi-indent-statement -90 t)
(when (and ada-skel-initial-string
(= (buffer-size) 0))
(insert ada-skel-initial-string))
diff --git a/ada.wy b/ada.wy
deleted file mode 100644
index dce4b694cc..0000000000
--- a/ada.wy
+++ /dev/null
@@ -1,2652 +0,0 @@
-;;; WisiToken grammar for Ada
-;;
-;; Author: Stephen Leake <stephe-leake@stephe-leake.org>
-;; Maintainer: Stephen Leake <stephe-leake@stephe-leake.org>
-;; Created: Sept 2012
-;; Keywords: syntax
-;;
-;; Copied from Ada Language Reference Manual Annex P:
-;;
-;; (info "(aarm2012)Annex P" "*info Annex P*")
-;;
file:///C:/Projects/arm_info/org.adaic.arm_form/build/html/aarm2012/AA-P.html
-;; https://www.adaic.org/ada-resources/standards/ Ada 2012 annex P
-;;
-;; but listed in alphabetical order. Repeating and optional constructs
-;; are implemented with extra productions. Most names are simplified
-;; to just "name", many productions are modified to reduce conflicts.
-;;
-;; The EBNF in LRM Annex P is not LALR(1), so we use a generalized
-;; LR parser.
-;;
-;; Annex P overloads several keywords as grammar elements; 'body',
-;; 'pragma', some others. That matters in the generated Ada code. We
-;; resolve this by appending _g to the grammar element name.
-;;
-;; To tolerate some invalid syntax during editing, we relax the
-;; grammar, mainly by allowing many items to be empty.
-
-%code copyright_license %{
-;; Copyright (C) 2013 - 2020 Free Software Foundation, Inc.
-
-;; This program is free software; you can redistribute it and/or
-;; modify it under the terms of the GNU General Public License as
-;; published by the Free Software Foundation; either version 3, or (at
-;; your option) any later version.
-;;
-;; This software is distributed in the hope that it will be useful,
-;; but WITHOUT ANY WARRANTY; without even the implied warranty of
-;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
-;; General Public License for more details.
-;;
-;; You should have received a copy of the GNU General Public License
-;; along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>.
-}%
-
-%code actions spec post %{
- Partial_Parse_Active : Boolean := False;
- Partial_Parse_Byte_Goal : WisiToken.Buffer_Pos := WisiToken.Buffer_Pos'Last;
-}%
-
-%generate LALR Ada_Emacs re2c Process
-%generate LR1 Ada_Emacs text_rep re2c Process
-
-%case_insensitive
-%start compilation
-
-%keyword ABS "abs"
-%keyword ACCEPT "accept"
-%keyword ABORT "abort"
-%keyword ABSTRACT "abstract"
-%keyword ACCESS "access"
-%keyword ALIASED "aliased"
-%keyword ALL "all"
-%keyword AND "and"
-%keyword ARRAY "array"
-%keyword AT "at"
-%keyword BEGIN "begin"
-%keyword BODY "body"
-%keyword CASE "case"
-%keyword CONSTANT "constant"
-%keyword DECLARE "declare"
-%keyword DELAY "delay"
-%keyword DELTA "delta"
-%keyword DIGITS "digits"
-%keyword DO "do"
-%keyword ELSE "else"
-%keyword ELSIF "elsif"
-%keyword END "end"
-%keyword ENTRY "entry"
-%keyword EXCEPTION "exception"
-%keyword EXIT "exit"
-%keyword FOR "for"
-%keyword FUNCTION "function"
-%keyword GENERIC "generic"
-%keyword GOTO "goto"
-%keyword IF "if"
-%keyword IN "in"
-%keyword INTERFACE "interface"
-%keyword IS "is"
-%keyword LIMITED "limited"
-%keyword LOOP "loop"
-%keyword MOD "mod"
-%keyword NEW "new"
-%keyword NOT "not"
-%keyword NULL "null"
-%keyword OF "of"
-%keyword OR "or"
-%keyword OTHERS "others"
-%keyword OUT "out"
-%keyword OVERRIDING "overriding"
-%keyword PACKAGE "package"
-%keyword PRAGMA "pragma"
-%keyword PRIVATE "private"
-%keyword PROCEDURE "procedure"
-%keyword PROTECTED "protected"
-%keyword RAISE "raise"
-%keyword RANGE "range"
-%keyword RECORD "record"
-%keyword REM "rem"
-%keyword RENAMES "renames"
-%keyword REQUEUE "requeue"
-%keyword RETURN "return"
-%keyword REVERSE "reverse"
-%keyword SEPARATE "separate"
-%keyword SELECT "select"
-%keyword SOME "some"
-%keyword SUBTYPE "subtype"
-%keyword SYNCHRONIZED "synchronized"
-%keyword TAGGED "tagged"
-%keyword TASK "task"
-%keyword TERMINATE "terminate"
-%keyword THEN "then"
-%keyword TYPE "type"
-%keyword UNTIL "until"
-%keyword USE "use"
-%keyword WHEN "when"
-%keyword WHILE "while"
-%keyword WITH "with"
-%keyword XOR "xor"
-
-%token <left-paren> LEFT_PAREN "("
-%token <right-paren> RIGHT_PAREN ")"
-%token <left-paren> LEFT_SQUARE_BRACKET "["
-%token <right-paren> RIGHT_SQUARE_BRACKET "]"
-
-%token <punctuation> AMPERSAND "&"
-%token <punctuation> AT_SIGN "@"
-%token <punctuation> BAR "|"
-%token <punctuation> BOX "<>"
-%token <punctuation> COLON ":"
-%token <punctuation> COLON_EQUAL ":="
-%token <punctuation> COMMA ","
-%token <punctuation> DOT "."
-%token <punctuation> DOT_DOT ".."
-%token <punctuation> EQUAL "="
-%token <punctuation> EQUAL_GREATER "=>"
-%token <punctuation> GREATER ">"
-%token <punctuation> GREATER_EQUAL ">="
-%token <punctuation> GREATER_GREATER ">>"
-%token <punctuation> LESS "<"
-%token <punctuation> LESS_EQUAL "<="
-%token <punctuation> LESS_LESS "<<"
-%token <punctuation> MINUS "-"
-%token <punctuation> PLUS "+"
-%token <punctuation> SEMICOLON ";"
-%token <punctuation> SLASH "/"
-%token <punctuation> SLASH_EQUAL "/="
-%token <punctuation> STAR "*"
-%token <punctuation> STAR_STAR "**"
-
-;; Support GNAT character coding in names and character and string
-;; literals (see test/non_ascii.ads)
-%re2c_regexp GNAT_Char_Coding %[ ("[\""[0-9A-Fa-f]+"\"]") ]%
-
-;; re2c lookahead regular expression; this is not a character literal.
-;; re2c does not allow combining | with /, so we need three tokens for
-;; this (sigh).
-%token <punctuation> TICK_1 "'"
-
-%token <regexp> TICK_2
- %[ "'" / "('"([\x20-\U0010FFFF]|GNAT_Char_Coding)"'" ]%
- "'"
-
-;; This regexp allows a lot of things that are not Ada numeric
-;; literals, but it's faster than a strictly conforming regexp. For
-;; non-based literals, force a trailing integer so (1..Length) is
-;; parsed correctly.
-%token <regexp> NUMERIC_LITERAL
- %[ ([0-9])|([0-9][0-9eE._-]*[0-9])|([0-9]+"#"[0-9a-fA-F._-]+"#") ]%
- "1234567890"
-
-;; non_grammar are not seen by the elisp lexer, but are needed by the re2c
lexer
-%non_grammar <non-reporting> WHITESPACE %[ [ \t]+ ]%
-
-;; handle DOS or Unix newline
-%non_grammar <new-line> NEW_LINE %[ [\x0a]|[\x0d][\x0a] ]%
-
-;; Treat Ada comments, gnatprep preprocessor lines, and skeleton
-;; placeholders as comments. Also terminate placeholder on newline,
-;; EOF, to handle missing }. x04 is EOF.
-%non_grammar <comment> COMMENT %[
(("--"|"#if"|"#elsif"|"#else"|"#end")[^\n\x04]*)|("{"[^}\n\x04]*) ]%
-
-;; '$' for gnatprep symbols.
-%token <symbol> IDENTIFIER
- %[
([$a-zA-Z\x80-\U0010FFFF]|GNAT_Char_Coding)([0-9a-zA-Z_\x80-\U0010FFFF]|GNAT_Char_Coding)*
]%
- "A_Bogus_Identifier"
-
-%token <string-double> STRING_LITERAL
- %[ (["]([\x20-\x21\x23-\U0010FFFF]|GNAT_Char_Coding)*["])+ ]%
- '""'
-
-%token <string-single> CHARACTER_LITERAL
- %[ "'"([\x20-\U0010FFFF]|GNAT_Char_Coding)"'" ]%
- "' '"
-
-%elisp_face font-lock-constant-face
-%elisp_face font-lock-function-name-face
-%elisp_face font-lock-type-face
-%elisp_face nil
-
-%elisp_indent ada-indent-aggregate Ada_Indent_Aggregate
-%elisp_indent ada-indent-renames Ada_Indent_Renames_0
-%elisp_indent ada-indent-return Ada_Indent_Return_0
-%elisp_indent ada-indent-record Ada_Indent_Record_0
-%elisp_indent "ada-indent-record*" Ada_Indent_Record_1
-
-;; Set McKenzie error recovery costs.
-;;
-;; We assume the user is typing new code more often than deleting or
-;; changing old. Minimal_Complete reduces cost for insert, so the
-;; default cost for insert, delete is the same. Often insert requires
-;; push_back first, to get the parser in the right state, so push_back
-;; is cheaper.
-;;
-;; We need a balance between Minimal_Complete and other solutions; if
-;; Minimal_Complete is too cheap, it will complete the entire
-;; compilation_Unit before the error point, when doing something else
-;; at some point is better (see test/ada_mode-recover_29.adb, _15,
-;; _24). On the other hand, doing lots of Minimal_Complete is very
-;; common when writing new code (see test/ada_mode-recover_10.adb,
-;; _error_during_resume_01). So we reduce the cost of inserting 'end
-;; ;'.
-;;
-;; test/ada_mode-recover_change_name.adb needs 'ignore check fail' cost 2
-;;
-;; Default cost for insert, delete, push back/undo_reduce, ignore check fail.
-%mckenzie_cost_default 4 4 2 2
-%mckenzie_minimal_complete_cost_delta -3
-
-;; END is cheaper, because it always requires at least one other
-;; keyword to follow.
-%mckenzie_cost_insert END 3
-
-;; This cost is applied once, independent of token count.
-%mckenzie_cost_matching_begin 3
-
-;; Prefer doing more work at the current error point over moving
-;; forward to a new one; there is normally only one real error point.
-;; But not too much; test/ada_mode-recover_partial_02_lr1.adb requires
-;; cost 2.
-%mckenzie_cost_fast_forward 2
-
-;; Handle converting 'if' to 'case' (and vice-versa), since that is a
-;; common operation. See test/ada_mode-recover_29.adb. This also makes
-;; inserting 'end if;' free; that's used a lot. But this defeats
-;; Forbid_Minimal_Complete; see
-;; test/ada_mode-recover_constant_as_statement_1.adb.
-%mckenzie_cost_insert CASE 2
-%mckenzie_cost_insert IF 2
-
-;; Prefer undo_reduce over push_back; consider the code:
-;;
-;; loop
-;; if then
-;; statement;
-;; -- missing 'end if;'
-;; end loop;
-;; -- ^ error here
-;;
-;; Error recovery will insert 'end if;', after push_back or
-;; undo_reduce of the handled_sequence_of_statements including
-;; 'statement'. If it uses push_back, then 'end if;' is before
-;; 'statement'; if undo_reduce, after, which is the desired result.
-%mckenzie_cost_undo_reduce handled_sequence_of_statements 0
-%mckenzie_cost_undo_reduce sequence_of_statements 0
-%mckenzie_cost_undo_reduce sequence_of_statements_opt 0
-%mckenzie_cost_undo_reduce declarative_part_opt 0
-
-;; Missing or extra closing paren are common; missing handled by
-;; Minimal_Complete.
-%mckenzie_cost_delete RIGHT_PAREN 1
-
-;; test/ada_mode-recover_partial_02_lr1.adb requires 45_000; wisitoken got 30%
faster
-%mckenzie_enqueue_limit 58_000
-
-;; 4 required for test/ada_mode-recover_match_names.adb.
-%mckenzie_check_limit 4
-
-;; After finding 1 solution, only check 100 more before giving up.
-;; Reduces solution time on complex errors.
-%mckenzie_check_delta_limit 100
-
-%end_names_optional_option End_Names_Optional
-
-;; known conflicts that are resolved by generalized LALR parser
-%conflict REDUCE/REDUCE in state abstract_limited_opt,
abstract_limited_synchronized_opt on token NEW
-%conflict REDUCE/REDUCE in state actual_parameter_part, actual_parameter_part
on token RIGHT_PAREN
-%conflict REDUCE/REDUCE in state aggregate, aggregate on token RIGHT_PAREN
-%conflict REDUCE/REDUCE in state association_opt, expression_opt on token
RIGHT_PAREN
-%conflict REDUCE/REDUCE in state derived_type_definition,
derived_type_definition on token WITH
-%conflict REDUCE/REDUCE in state discrete_choice, discrete_subtype_definition
on token EQUAL_GREATER
-%conflict REDUCE/REDUCE in state discrete_choice, subtype_indication on token
EQUAL_GREATER
-%conflict REDUCE/REDUCE in state full_type_declaration, full_type_declaration
on token NEW
-%conflict REDUCE/REDUCE in state identifier_list, name on token COMMA
-%conflict REDUCE/REDUCE in state name, direct_name on token USE
-%conflict REDUCE/REDUCE in state primary, subtype_indication on token COMMA
-%conflict REDUCE/REDUCE in state primary, subtype_indication on token
EQUAL_GREATER
-%conflict REDUCE/REDUCE in state primary, subtype_indication on token
RIGHT_PAREN
-%conflict REDUCE/REDUCE in state range_list, discrete_subtype_definition on
token COMMA
-%conflict REDUCE/REDUCE in state range_list, discrete_subtype_definition on
token RIGHT_PAREN
-%conflict SHIFT/REDUCE in state abstract_subprogram_declaration,
abstract_subprogram_declaration on token IS
-%conflict SHIFT/REDUCE in state accept_statement, accept_statement on token
LEFT_PAREN
-%conflict SHIFT/REDUCE in state aggregate, expression_opt on token WITH
-%conflict SHIFT/REDUCE in state aspect_clause, name on token USE
-%conflict SHIFT/REDUCE in state association_opt, name on token EQUAL_GREATER
-%conflict SHIFT/REDUCE in state attribute_designator, attribute_designator on
token LEFT_PAREN
-%conflict SHIFT/REDUCE in state block_label, identifier_list on token COLON
-%conflict SHIFT/REDUCE in state compilation, compilation on token FOR
-%conflict SHIFT/REDUCE in state declaration, declaration on token CONSTANT
-%conflict SHIFT/REDUCE in state expression_function_declaration,
subprogram_specification on token IS
-%conflict SHIFT/REDUCE in state formal_derived_type_definition,
formal_derived_type_definition on token WITH
-%conflict SHIFT/REDUCE in state generic_instantiation, generic_instantiation
on token IS
-%conflict SHIFT/REDUCE in state generic_renaming_declaration,
generic_formal_part on token FUNCTION
-%conflict SHIFT/REDUCE in state generic_renaming_declaration,
generic_formal_part on token PACKAGE
-%conflict SHIFT/REDUCE in state generic_renaming_declaration,
generic_formal_part on token PROCEDURE
-%conflict SHIFT/REDUCE in state membership_choice_list, relation on token BAR
-%conflict SHIFT/REDUCE in state null_procedure_declaration,
subprogram_specification on token IS
-%conflict SHIFT/REDUCE in state object_renaming_declaration, identifier_list
on token COLON
-%conflict SHIFT/REDUCE in state package_body, package_body on token IS
-%conflict SHIFT/REDUCE in state parameter_specification,
parameter_specification on token NOT
-%conflict SHIFT/REDUCE in state protected_body, protected_body on token IS
-%conflict SHIFT/REDUCE in state raise_expression, raise_expression on token
WITH
-%conflict SHIFT/REDUCE in state relation_and_list, expression on token AND
-%conflict SHIFT/REDUCE in state relation_and_then_list, expression on token
AND
-%conflict SHIFT/REDUCE in state relation_or_else_list, expression on token OR
-%conflict SHIFT/REDUCE in state relation_or_list, expression on token OR
-%conflict SHIFT/REDUCE in state relation_xor_list, expression on token XOR
-%conflict SHIFT/REDUCE in state task_body, task_body on token IS
-%conflict SHIFT/REDUCE in state wisitoken_accept, wisitoken_accept on token
FOR
-
-;;; grammar rules
-
-abstract_limited_synchronized_opt
- : ABSTRACT LIMITED
- | ABSTRACT SYNCHRONIZED
- | ABSTRACT
- | LIMITED
- | SYNCHRONIZED
- | ;; empty
- ;
-
-abstract_limited_opt
- : ABSTRACT LIMITED
- | LIMITED
- | ABSTRACT
- | ;; empty
- ;
-
-abstract_tagged_limited_opt
- : ABSTRACT TAGGED LIMITED
- | ABSTRACT TAGGED
- | TAGGED LIMITED
- | TAGGED
- | LIMITED
- | ;; empty
- ;
-
-abstract_subprogram_declaration
- : overriding_indicator_opt subprogram_specification IS ABSTRACT
aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 2 statement-override 6
statement-end])
- (wisi-indent-action [nil nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken]))%
- ;
-
-accept_statement
- : ACCEPT IDENTIFIER actual_parameter_part_opt parameter_profile_opt DO
handled_sequence_of_statements END
- identifier_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 5 motion 9 statement-end])
- (wisi-motion-action [1 5 [6 WHEN] 9])
- (wisi-face-apply-action [2 nil font-lock-function-name-face 8 nil
font-lock-function-name-face])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken [nil ada-indent]
- [ada-indent ada-indent] nil ada-indent-broken
ada-indent-broken]))%
- %((wisi-match-names 2 8))%
-
- | ACCEPT IDENTIFIER actual_parameter_part_opt parameter_profile_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 5 statement-end])
- (wisi-face-apply-action [2 nil font-lock-function-name-face])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken]))%
- ;
-
-;; same as access_type_definition for our purposes
-access_definition
- : null_exclusion_opt ACCESS protected_opt PROCEDURE parameter_profile_opt
- ;; test/ada_mode-nomina.ads
- ;; type Procedure_Access_Type_8 is access
- ;; protected procedure
- ;; (A_Param : out Integer);
- %((wisi-indent-action [nil nil nil nil (wisi-anchored%- 4
ada-indent-broken)]))%
-
- | null_exclusion_opt ACCESS protected_opt FUNCTION
parameter_and_result_profile
- ;; test/ada_mode-nominal.ads
- ;; type Function_Access_Type_10 is access
- ;; protected function
- ;; (A_Param : in Float)
- ;; return Standard.Float;
- %((wisi-indent-action [nil nil nil nil (wisi-anchored%- 4
ada-indent-broken)]))%
-
- | null_exclusion_opt ACCESS general_access_modifier_opt name
- %((wisi-face-apply-action [4 font-lock-function-name-face
font-lock-type-face]))%
- ;
-
-actual_parameter_part
- : LEFT_PAREN association_list RIGHT_PAREN
- ;; see note in test/ada_mode-parens.adb Local_10 about right paren indent.
- %((wisi-indent-action [nil [(wisi-anchored 1 1) (wisi-anchored 1 1)]
(wisi-anchored 1 0)]))%
- ;; ARM 4.5.7(7), ARM 4.5.8(4) allow ( conditional|quantified_expression )
instead of (( ... ))
- | LEFT_PAREN conditional_quantified_expression RIGHT_PAREN
- %((wisi-indent-action [nil [(wisi-anchored 1 1) (wisi-anchored 1 1)]
(wisi-anchored 1 0)]))%
- ;
-
-actual_parameter_part_opt
- : actual_parameter_part
- | ;; empty
- ;
-
-;; All LEFT_PAREN in aggregate are indented 0 here. Special cases for
-;; -1 are handled in 'primary'.
-aggregate
- : LEFT_PAREN association_list RIGHT_PAREN ;; record_aggregate,
named_array_aggregate, positional_array_aggregate
- %((wisi-indent-action [nil [(wisi-anchored 1 1) (wisi-anchored 1 1)]
(wisi-anchored 1 0)]))%
- | LEFT_PAREN NULL RECORD RIGHT_PAREN ;; record_aggregate
-
- | LEFT_PAREN expression_opt WITH NULL RECORD RIGHT_PAREN ;;
extension_aggregate with null record
- %((wisi-indent-action [nil (wisi-anchored 1 1) (wisi-anchored 1 1) nil nil
(wisi-anchored 1 0)]))%
- | LEFT_PAREN expression_opt WITH association_list RIGHT_PAREN ;;
extension_aggregate
- %((wisi-indent-action [nil (wisi-anchored 1 1) (wisi-anchored 1 1)
[(wisi-anchored 1 1) (wisi-anchored 1 1)]
- (wisi-anchored 1 0)]))%
-
- | LEFT_PAREN expression WITH DELTA association_list RIGHT_PAREN ;;
record_delta_aggregate, array_delta_aggregate
- %((wisi-indent-action [nil (wisi-anchored 1 1) (wisi-anchored 1 1)
(wisi-anchored 1 1)
- [(wisi-anchored 1 1) (wisi-anchored 1 1)]
- (wisi-anchored 1 0)]))%
-
- | LEFT_SQUARE_BRACKET expression WITH DELTA association_list
RIGHT_SQUARE_BRACKET ;; array_delta_aggregate
- %((wisi-indent-action [nil (wisi-anchored 1 1) (wisi-anchored 1 1)
(wisi-anchored 1 1)
- [(wisi-anchored 1 1) (wisi-anchored 1 1)]
- (wisi-anchored 1 0)]))%
-
- ;; ARM 4.5.7(7), ARM 4.5.8(4) allow ( conditional|quantified_expression )
instead of (( ... ))
- | LEFT_PAREN conditional_quantified_expression RIGHT_PAREN
- %((wisi-indent-action [nil [(wisi-anchored 1 1) (wisi-anchored 1 1)]
(wisi-anchored 1 0)]))%
- ;
-
-aliased_opt
- : ALIASED
- | ;; empty
- ;
-
-and_interface_list_opt
- : AND interface_list
- | ;; empty
- ;
-
-array_type_definition
- : ARRAY LEFT_PAREN index_subtype_definition_list RIGHT_PAREN OF
component_definition
- ;; unconstrained_array_definition
- %((wisi-indent-action [nil nil (wisi-anchored 2 1) (wisi-anchored 2 0) nil
nil]))%
-
- | ARRAY LEFT_PAREN discrete_subtype_definition_list RIGHT_PAREN OF
component_definition
- ;; constrained_array_definition
- %((wisi-indent-action [nil nil (wisi-anchored 2 1) (wisi-anchored 2 0) nil
nil]))%
- ;
-
-aspect_clause
- : FOR attribute_reference USE expression_opt SEMICOLON ;;
attribute_definition_clause
- %((wisi-statement-action [1 statement-start 5 statement-end])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken]))%
- | enumeration_representation_clause
- | record_representation_clause
- | at_clause
- ;
-
-;; aspect_mark ::= aspect_identifier[Class]
-
-;; aspect_specification ::=
-;; with aspect_mark [=> aspect_definition] {,
-;; aspect_mark [=> aspect_definition] }
-aspect_specification_opt
- : WITH association_list ;; overkill, but simpler.
- %((wisi-indent-action [nil ada-indent-broken]))%
- | ;; empty
- ;
-
-assignment_statement
- : name COLON_EQUAL expression_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 4 statement-end])
- (wisi-indent-action [nil
- ada-indent-broken
- (wisi-hanging
- (wisi-anchored% 2 ada-indent-broken)
- (wisi-anchored% 3 ada-indent-broken))
- ada-indent-broken]))%
- ;
-
-association_opt
- : CHARACTER_LITERAL EQUAL_GREATER expression_opt ;; part of selector_name
that does not overlap name
- %((wisi-indent-action [nil
- ada-indent-broken
- [(wisi-hanging%- (wisi-anchored% 2
ada-indent-broken)
- (wisi-anchored% 2 (* 2
ada-indent-broken)))
- (wisi-hanging%- (wisi-anchored% 2
ada-indent-broken)
- (wisi-anchored% 2 (* 2
ada-indent-broken)))]]))%
- | CHARACTER_LITERAL EQUAL_GREATER BOX ;; from formal_package_association_list
- | discrete_choice_list EQUAL_GREATER expression_opt
- ;; We need wisi-hanging on expression_opt to recognize aspect_specification
for a special case.
- ;; test/aspects.ads
- ;; with Pre => X > 10 and
- ;; X < 50 and
- ;; F (X),
- ;; Post =>
- ;; Y >= X and
- ;; Some_Very_Verbose_Predicate (X, Y);
- ;;
- ;; test/indent.ads
- ;; 1 => -- Used to be aligned on "CSCL_Type'"
- ;; -- aligned with previous comment.
- ;; IO_CPU_Control_State_S_Pkg.CPU2_Fault_Status_Type'
- ;; (Unused2 => 10, -- Used to be aligned on "1 =>"
- ;; requires '-' on wisi-hanging%-
- %((wisi-indent-action [(wisi-hanging nil ada-indent-broken)
- ada-indent-broken
- [(wisi-hanging%- (wisi-anchored% 2
ada-indent-broken)
- (wisi-anchored% 2 (* 2
ada-indent-broken)))
- (wisi-hanging%- (wisi-anchored% 2
ada-indent-broken)
- (wisi-anchored% 2 (* 2
ada-indent-broken)))]]))%
- | discrete_choice_list EQUAL_GREATER BOX
- %((wisi-indent-action [(wisi-hanging nil ada-indent-broken)
ada-indent-broken nil]))%
- | expression
- ;; test/ada_mode-parens.adb Hello
- %((wisi-indent-action [[(wisi-hanging nil ada-indent-broken) (wisi-hanging
nil ada-indent-broken)]]))%
- | ;; empty
-
- | FOR IDENTIFIER IN discrete_choice_list EQUAL_GREATER expression ;;
iterated_component_association
- %((wisi-indent-action [nil nil nil (wisi-hanging nil ada-indent-broken)
ada-indent-broken
- [(wisi-hanging nil ada-indent-broken)
(wisi-hanging nil ada-indent-broken)]]))%
- | FOR iterator_specification EQUAL_GREATER expression ;;
iterated_component_association
- %((wisi-indent-action [nil (wisi-hanging nil ada-indent-broken)
ada-indent-broken
- [(wisi-hanging nil ada-indent-broken)
(wisi-hanging nil ada-indent-broken)]]))%
- ;
-
-association_list
- : association_list COMMA association_opt
- | association_opt
- ;
-
-asynchronous_select
- : SELECT triggering_alternative THEN ABORT sequence_of_statements_opt END
SELECT SEMICOLON
- %((wisi-statement-action [1 statement-start 3 motion 8 statement-end])
- (wisi-motion-action [1 3 8])
- (wisi-indent-action [nil [ada-indent ada-indent] [nil
ada-indent-broken] ada-indent-broken
- [ada-indent ada-indent] nil ada-indent-broken
ada-indent-broken]))%
- ;
-
-at_clause
- : FOR direct_name USE AT expression_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 6 statement-end]))%
- ;
-
-attribute_reference : name tick attribute_designator ;
-
-attribute_designator
- : IDENTIFIER LEFT_PAREN expression RIGHT_PAREN
- | IDENTIFIER
- | ACCESS
- | DELTA
- | DIGITS
- | MOD
- ;
-
-;; basic_declarative_item merged into declaration
-;; basic_declaration merged into declaration
-
-binary_adding_operator : PLUS | MINUS | AMPERSAND ; ;; + | - | &
-
-block_label
- : IDENTIFIER COLON
- %((wisi-indent-action [ada-indent-label nil]))%
- %((wisi-propagate-name 1))%
- ;
-
-block_label_opt
- : block_label
- %()%
- %((wisi-propagate-name 1))%
- | ;; empty
- ;
-
-block_statement
- : block_label_opt DECLARE declarative_part_opt BEGIN
handled_sequence_of_statements END identifier_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 2 motion 4 motion 8
statement-end])
- (wisi-motion-action [2 4 [5 WHEN] 8])
- (wisi-indent-action [nil nil [ada-indent ada-indent] nil [ada-indent
ada-indent] nil ada-indent-broken
- ada-indent-broken]))%
- %((wisi-match-names 1 7))%
- | block_label_opt BEGIN handled_sequence_of_statements END identifier_opt
SEMICOLON
- %((wisi-statement-action [1 statement-start 2 motion 6 statement-end])
- (wisi-motion-action [2 [3 WHEN] 6])
- (wisi-indent-action [nil nil [ada-indent ada-indent] nil
ada-indent-broken ada-indent-broken]))%
- %((wisi-match-names 1 5))%
- ;
-
-body_g : proper_body | body_stub ;
-
-body_stub
- : subprogram_body_stub | package_body_stub | task_body_stub |
protected_body_stub ;
-
-case_expression
- : CASE expression_opt IS case_expression_alternative_list
- %((wisi-statement-action [1 motion])
- (wisi-motion-action [1 4])
- (wisi-indent-action [nil ada-indent-broken nil ada-indent-when]))%
- ;
-
-case_expression_alternative
- : WHEN discrete_choice_list EQUAL_GREATER expression_opt
- ;; test/ada_mode-conditional_expressions.adb
- ;; when A =>
- ;; J = 4
- ;; or else M, -- test case from Piotr Trojanek
- %((wisi-statement-action [1 motion])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
- (wisi-hanging (wisi-anchored% 1 ada-indent)
- (wisi-anchored% 1 (+ ada-indent
ada-indent-broken)))]))%
- ;
-
-case_expression_alternative_list
- : case_expression_alternative_list COMMA case_expression_alternative
- %((wisi-motion-action [1 3]))%
- | case_expression_alternative
- ;
-
-case_statement
- : CASE expression_opt IS case_statement_alternative_list END CASE SEMICOLON
- %((wisi-statement-action [1 statement-start 7 statement-end])
- (wisi-motion-action [1 4 7])
- (wisi-indent-action [nil ada-indent-broken nil [ada-indent-when
ada-indent-when] nil ada-indent-broken ada-indent-broken]))%
- ;
-
-case_statement_alternative
- : WHEN discrete_choice_list EQUAL_GREATER sequence_of_statements_opt
- %((wisi-statement-action [1 motion])
- ;; ada-indent-when added in case_statement
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken [ada-indent
ada-indent]]))%
- ;
-
-;; We don't allow an empty list here; that leads to parallel parser
-;; explosion in nested case statements. Note that ada-skel-case
-;; inserts an empty when =>
-case_statement_alternative_list
- : case_statement_alternative_list case_statement_alternative
- %((wisi-motion-action [1 2]))%
- | case_statement_alternative
- ;
-
-;; choice_expression use 'expression' to avoid conflicts
-
-;; choice_relation* - use 'relation*', to avoid conflicts
-
-;; Since we allow multiple compilation units in one parse, and don't
-;; require a library_item in order to be user friendly, we don't need
-;; a context_clause, since a list of context_items is just a
-;; compilation. Since context_item includes pragma, this
-;; also allows a pragma following a compilation_unit.
-;;
-;; We allow additional items here for partial syntax in mako-ada
-;; templates and grammar actions, and for partial parsing in large files.
-compilation_unit
- : with_clause
- | subunit
- | PRIVATE declaration
- %((wisi-indent-action [0 0]))%
- | declaration
- | statement
- ;
-
-;; Compute indent for trailing comments.
-compilation
- : compilation compilation_unit
- %((wisi-indent-action [0 [0 0]]))%
- | compilation_unit
- %((wisi-indent-action [[0 0]]))%
- %((wisi-terminate-partial-parse))%
- ;
-
-component_clause
- : IDENTIFIER AT simple_expression RANGE simple_expression DOT_DOT
simple_expression SEMICOLON
- %((wisi-statement-action [1 statement-start 8 statement-end])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken
- ada-indent-broken ada-indent-broken
ada-indent-broken]))%
- ;
-
-component_clause_list
- : component_clause_list component_clause
- | component_clause
- ;
-
-component_declaration
- : identifier_list COLON component_definition COLON_EQUAL expression_opt
aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 7 statement-end])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken
- (wisi-anchored% 4 ada-indent-broken)
- ada-indent-broken ada-indent-broken]))%
- | identifier_list COLON component_definition aspect_specification_opt
SEMICOLON
- %((wisi-statement-action [1 statement-start 5 statement-end])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken]))%
- ;
-
-component_definition
- : ALIASED subtype_indication
- | subtype_indication
- | ALIASED access_definition
- | access_definition
- ;
-
-component_item
- : component_declaration
- | aspect_clause
- ;
-
-component_list
- : component_list component_item
- | component_list variant_part
- | component_item
- | variant_part
- | NULL SEMICOLON
- %((wisi-statement-action [1 statement-start 2 statement-end]))%
- ;
-
-component_list_opt
- : component_list
- | ;; empty
- ;
-
-compound_statement
- : if_statement
- | case_statement
- | loop_statement
- | block_statement
- | extended_return_statement
- | accept_statement
- | select_statement
- ;
-
-conditional_entry_call
- : SELECT entry_call_alternative ELSE sequence_of_statements_opt END SELECT
SEMICOLON
- %((wisi-statement-action [1 statement-start 3 motion 7 statement-end])
- (wisi-motion-action [1 3 7])
- (wisi-indent-action [nil [ada-indent ada-indent] nil [ada-indent
ada-indent] nil ada-indent-broken
- ada-indent-broken]))%
- ;
-
-conditional_quantified_expression
- : if_expression
- | case_expression
- | quantified_expression
- ;
-
-constant_opt
- : CONSTANT
- | ;; empty
- ;
-
-constraint
- : RANGE range_g ;; range_constraint
- ;; FIXME: | digits_constraint
- ;; FIXME: | delta_constraint
- | index_constraint
- ;; | discriminant_constraint same as aspect_specification
- ;
-
-constraint_opt
- : constraint
- | ;; empty
- ;
-
-;; context_item not needed; see compilation_unit
-
-declaration
- : abstract_subprogram_declaration
- | aspect_clause
- | body_g
- | entry_declaration
- | exception_declaration
- | expression_function_declaration
- | generic_declaration
- | generic_instantiation
- | null_procedure_declaration
- | identifier_list COLON CONSTANT COLON_EQUAL expression_opt SEMICOLON ;;
number_declaration
- %((wisi-statement-action [1 statement-start 6 statement-end])
- (wisi-indent-action [(wisi-hanging nil ada-indent-broken)
ada-indent-broken ada-indent-broken ada-indent-broken
- (wisi-anchored% 4 ada-indent-broken)
ada-indent-broken]))%
- | object_declaration
- | package_declaration
- | renaming_declaration
- | subprogram_declaration
- | subtype_declaration
- | type_declaration
- | use_clause
- ;
-
-;; pragma_g is not a 'declaration' in ARM, but it must be in the
-;; grammar. We don't include it in 'declaration', to avoid conflicts
-;; with 'pragma_g' in statements via compilation_unit.
-declarations
- : declarations declaration
- | declarations pragma_g
- | declaration
- | pragma_g
- ;
-
-declarative_part_opt
- : declarations
- | ;; empty
- ;
-
-;; declarative_item merged into declaration
-
-delay_alternative
- : delay_statement sequence_of_statements_opt
- ;
-
-delay_statement
- : DELAY UNTIL expression_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 4 statement-end])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken]))%
- | DELAY expression_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 3 statement-end])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken]))%
- ;
-
-derived_type_definition
- : abstract_limited_opt NEW name and_interface_list_opt WITH record_definition
- %((wisi-face-apply-action [3 font-lock-function-name-face
font-lock-type-face])
- ;; comment after 'with' same as 'record'
- (wisi-indent-action [nil nil nil nil [nil (ada-indent-record* 'TYPE 6
0)] nil]))%
- | abstract_limited_opt NEW name constraint_opt
- %((wisi-face-apply-action [3 font-lock-function-name-face
font-lock-type-face]))%
- ;
-
-direct_name
- : IDENTIFIER
- | STRING_LITERAL ;; operator_symbol
- ;
-
-direct_name_opt
- : direct_name
- | ;; empty
- ;
-
-discrete_choice
- : expression ;; includes 'name'
- | NOT NULL name ;; from subytpe_indication, excluding constructs covered by
'name'
- | range_g
- | OTHERS
- ;
-
-discrete_choice_list
- : discrete_choice_list BAR discrete_choice
- | discrete_choice
- | ;; empty for skeleton indentation
- ;
-
- ;; discrete_range is the same as discrete_subtype_definition
-
- ;; discrete_range_list is the same as discrete_subtype_definition_list
-
-discrete_subtype_definition : subtype_indication | range_g ;
-
-discrete_subtype_definition_list
- : discrete_subtype_definition_list COMMA discrete_subtype_definition
- | discrete_subtype_definition
- ;
-
-discriminant_part_opt
- : LEFT_PAREN BOX RIGHT_PAREN ;; (<>) unknown_discriminant_part
- | LEFT_PAREN discriminant_specification_list RIGHT_PAREN;;
known_discriminant_part
- %((wisi-indent-action [nil (wisi-anchored 1 1) (wisi-anchored 1 0)]))%
- | ;; empty
- ;
-
-discriminant_specification_opt
- : identifier_list COLON null_exclusion_opt_name_type COLON_EQUAL
expression_opt
- | identifier_list COLON access_definition COLON_EQUAL expression_opt
- | identifier_list COLON null_exclusion_opt_name_type
- | identifier_list COLON access_definition
- | ;; empty
- ;
-
-discriminant_specification_list
- : discriminant_specification_list SEMICOLON discriminant_specification_opt
- | discriminant_specification_opt
- ;
-
-elsif_expression_item
- : ELSIF expression_opt THEN expression_opt
- %((wisi-statement-action [1 motion 3 motion])
- (wisi-motion-action [1 3])
- (wisi-indent-action [nil [ada-indent-broken ada-indent-broken] nil
ada-indent]))%
- ;
-
-elsif_expression_list
- : elsif_expression_list elsif_expression_item
- %((wisi-motion-action [1 2]))%
- | elsif_expression_item
- ;
-
-elsif_statement_item
- : ELSIF expression_opt THEN sequence_of_statements_opt
- %((wisi-statement-action [1 motion 3 motion])
- (wisi-motion-action [1 3])
- (wisi-indent-action [nil [ada-indent-broken ada-indent-broken] nil
[ada-indent ada-indent]]))%
- ;
-
-elsif_statement_list
- : elsif_statement_list elsif_statement_item
- %((wisi-motion-action [1 2]))%
- | elsif_statement_item
- ;
-
-entry_body
- : ENTRY IDENTIFIER entry_body_formal_part WHEN expression_opt
- IS declarative_part_opt BEGIN handled_sequence_of_statements END
identifier_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 4 motion 6 motion 8 motion 12
statement-end])
- (wisi-name-action 2)
- (wisi-motion-action [1 4 6 8 [9 WHEN] 12])
- (wisi-face-apply-action [2 nil font-lock-function-name-face 11 nil
font-lock-function-name-face])
-
- ;; test/ada_mode-nominal.adb
- ;; entry E2
- ;; (X : Integer)
- ;; when Local_1 = 0 and not
- ;; (Local_2 = 1)
- ;;
- ;; entry E3
- ;; (X : Integer) when Local_1 = 0 and not
- ;; (Local_2 = 1)
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken
- (wisi-anchored% 4 ada-indent-broken)
- nil [ada-indent ada-indent] nil [ada-indent
ada-indent] nil ada-indent-broken
- ada-indent-broken]))%
- %((wisi-match-names 2 11))%
- ;
-
-entry_body_formal_part
- : LEFT_PAREN FOR IDENTIFIER IN discrete_subtype_definition RIGHT_PAREN
parameter_profile_opt
- %((wisi-indent-action [nil (wisi-anchored 1 1) (wisi-anchored 1 1)
(wisi-anchored 1 1) (wisi-anchored 1 1)
- (wisi-anchored 1 0) ada-indent-broken]))%
- | parameter_profile_opt
- ;
-
-entry_call_alternative
- : procedure_call_statement sequence_of_statements_opt
- | name sequence_of_statements_opt ;; entry_call_statement
- ;
-
-entry_declaration
- : overriding_indicator_opt ENTRY IDENTIFIER LEFT_PAREN
discrete_subtype_definition RIGHT_PAREN
- parameter_profile_opt aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 2 statement-override 8
statement-end])
- (wisi-name-action 3)
- (wisi-face-apply-action [3 nil font-lock-function-name-face])
- (wisi-indent-action [nil nil ada-indent-broken ada-indent-broken
(wisi-anchored 4 1) (wisi-anchored 4 0)
- ada-indent-broken ada-indent-broken
ada-indent-broken]))%
- | overriding_indicator_opt ENTRY IDENTIFIER parameter_profile_opt
aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 2 statement-override 6
statement-end])
- (wisi-name-action 3)
- (wisi-face-apply-action [3 nil font-lock-function-name-face])
- (wisi-indent-action [nil nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken]))%
- ;
-
-enumeration_literal ;; enumeration_literal_specification
- : IDENTIFIER
- | CHARACTER_LITERAL
- ;
-
-enumeration_literal_list
- : enumeration_literal_list COMMA enumeration_literal
- | enumeration_literal
- ;
-
-enumeration_representation_clause
- : FOR name USE aggregate SEMICOLON
- %((wisi-statement-action [1 statement-start 5 statement-end])
- (wisi-face-apply-action [2 font-lock-function-name-face
font-lock-type-face])
- (wisi-indent-action [nil
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken ada-indent-broken
ada-indent-broken]))%
- ;
-
-enumeration_type_definition
- : LEFT_PAREN enumeration_literal_list RIGHT_PAREN
- %((wisi-indent-action [nil (wisi-anchored 1 1) (wisi-anchored 1 0)]))%
- ;
-
-exception_choice : name | OTHERS ;
-
-exception_choice_list
- : exception_choice_list BAR exception_choice
- | exception_choice
- ;
-
-;; FIXME: leaving out [renaming] [aspect_specification]
-exception_declaration
- : identifier_list COLON EXCEPTION SEMICOLON
- %((wisi-statement-action [1 statement-start 4 statement-end]))%
- ;
-
-exception_handler
- : WHEN IDENTIFIER COLON exception_choice_list EQUAL_GREATER
- sequence_of_statements_opt
- %((wisi-statement-action [1 motion])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken
- [ada-indent ada-indent]]))%
- | WHEN exception_choice_list EQUAL_GREATER sequence_of_statements_opt
- %((wisi-statement-action [1 motion])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken [ada-indent
ada-indent]]))%
- ;
-
-exception_handler_list
- : exception_handler_list exception_handler
- %((wisi-motion-action [1 2]))%
- | exception_handler
- | pragma_g
- ;
-
-exception_handler_list_opt
- : exception_handler_list
- | ;; empty for user friendly
- ;
-
-exit_statement
- : EXIT identifier_opt WHEN expression_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 5 statement-end])
- (wisi-indent-action [nil nil nil ada-indent-broken ada-indent-broken]))%
- | EXIT identifier_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 3 statement-end]))%
- ;
-
-expression
- : relation
- | relation_and_list
- | relation_and_then_list
- | relation_or_list
- | relation_or_else_list
- | relation_xor_list
- ;
-
-expression_opt
- : expression
- | ;; empty for user friendly
- ;
-
-expression_function_declaration
- : overriding_indicator_opt function_specification IS paren_expression
aspect_specification_opt SEMICOLON
- ;; IS does not start a block, so it is not "motion".
- ;;
- %((wisi-statement-action [1 statement-start 2 statement-override 6
statement-end])
- (wisi-indent-action [nil nil nil ada-indent-broken ada-indent-broken
ada-indent-broken]))%
- ;
-
-extended_return_object_declaration
- : IDENTIFIER COLON aliased_opt constant_opt return_subtype_indication
COLON_EQUAL expression_opt
- %((wisi-indent-action [nil nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken
- (wisi-anchored% 6 ada-indent-broken)]))%
- | IDENTIFIER COLON aliased_opt constant_opt return_subtype_indication
- %((wisi-indent-action [nil nil ada-indent-broken ada-indent-broken
ada-indent-broken]))%
- ;
-
-extended_return_object_declaration_opt
- : extended_return_object_declaration
- | ;; empty
- ;
-
-extended_return_statement
- : RETURN extended_return_object_declaration_opt DO
handled_sequence_of_statements END RETURN SEMICOLON
- %((wisi-statement-action [1 statement-start 3 motion 7 statement-end])
- (wisi-motion-action [1 3 [4 WHEN] 7])
- (wisi-indent-action [[nil ada-indent] ada-indent-broken nil [ada-indent
ada-indent] nil ada-indent-broken
- ada-indent-broken]))%
- | RETURN extended_return_object_declaration SEMICOLON
- %((wisi-statement-action [1 statement-start 3 statement-end]))%
- ;; indent the same as a simple return statment
- ;; test/ada_mode-nominal.adb
- ;; return B : Integer :=
- ;; (Local_Function);
- ;; (wisi-indent-action [nil nil nil]))
- ;
-
-;; designator is merged with name
-
-factor
- : primary STAR_STAR primary
- | primary
- | ABS primary
- | NOT primary
- ;
-
-formal_object_declaration
- : identifier_list COLON mode_opt null_exclusion_opt name COLON_EQUAL
- expression_opt aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 9 statement-end])
- (wisi-face-apply-action [5 font-lock-function-name-face
font-lock-type-face])
- (wisi-indent-action [nil
- ada-indent-broken ada-indent-broken
ada-indent-broken
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken
- (wisi-anchored% 6 ada-indent-broken)
ada-indent-broken ada-indent-broken]))%
- | identifier_list COLON mode_opt access_definition COLON_EQUAL
- expression_opt aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 8 statement-end])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken
- (wisi-anchored% 5 ada-indent-broken)
ada-indent-broken ada-indent-broken]))%
- | identifier_list COLON mode_opt null_exclusion_opt name
aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 7 statement-end])
- (wisi-face-apply-action [5 font-lock-function-name-face
font-lock-type-face])
- (wisi-indent-action [nil
- ada-indent-broken ada-indent-broken
ada-indent-broken
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken ada-indent-broken]))%
- | identifier_list COLON mode_opt access_definition aspect_specification_opt
SEMICOLON
- %((wisi-statement-action [1 statement-start 6 statement-end])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken
- ada-indent-broken]))%
- ;
-
-formal_part
- : LEFT_PAREN parameter_specification_list RIGHT_PAREN
- %((wisi-statement-action [1 misc]) ;; for ada-wisi-in-paramlist-p,
ada-goto-declarative-region-start
- (wisi-indent-action [nil (wisi-anchored 1 1) (wisi-anchored 1 0)]))%
- ;
-
-formal_subprogram_declaration
- : WITH subprogram_specification IS ABSTRACT subprogram_default
aspect_specification_opt SEMICOLON
- ;; formal_abstract_subprogram_declaration
- %((wisi-statement-action [1 statement-start 7 statement-end])
- (wisi-indent-action [nil nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken ada-indent-broken]))%
- | WITH subprogram_specification IS subprogram_default
aspect_specification_opt SEMICOLON
- ;; formal_concrete_subprogram_declaration
- %((wisi-statement-action [1 statement-start 6 statement-end])
- (wisi-indent-action [nil nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken]))%
- | WITH subprogram_specification IS ABSTRACT aspect_specification_opt
SEMICOLON
- ;; formal_abstract_subprogram_declaration
- %((wisi-statement-action [1 statement-start 6 statement-end])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken ada-indent-broken]))%
- | WITH subprogram_specification aspect_specification_opt SEMICOLON ;;
formal_concrete_subprogram_declaration
- %((wisi-statement-action [1 statement-start 4 statement-end])
- (wisi-indent-action [nil nil ada-indent-broken ada-indent-broken]))%
- ;
-
-formal_type_declaration
- : TYPE IDENTIFIER discriminant_part_opt IS formal_type_definition
aspect_specification_opt SEMICOLON
- ;; formal_complete_type_declaration
- %((wisi-statement-action [1 statement-start 7 statement-end])
- (wisi-face-apply-action [2 nil font-lock-type-face])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken
- ada-indent-broken ada-indent-broken
ada-indent-broken]))%
- | TYPE IDENTIFIER discriminant_part_opt IS TAGGED aspect_specification_opt
SEMICOLON
- ;; formal_incomplete_type_declaration
- %((wisi-statement-action [1 statement-start 7 statement-end])
- (wisi-face-apply-action [2 nil font-lock-type-face])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken
- ada-indent-broken ada-indent-broken]))%
- | TYPE IDENTIFIER discriminant_part_opt aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 5 statement-end])
- (wisi-face-apply-action [2 nil font-lock-type-face])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken]))%
- ;
-
-formal_type_definition
- : abstract_tagged_limited_opt PRIVATE ;; formal_private_type_definition
- | formal_derived_type_definition
- | LEFT_PAREN BOX RIGHT_PAREN ;; formal_discrete_type_definition
- | RANGE BOX ;; formal_signed_integer_type_definition
- | MOD BOX ;; formal_modular_type_definition
- | DIGITS BOX ;; formal_floating_point_definition
- | DELTA BOX DIGITS BOX ;; formal_decimal_fixed_point_definition
- | DELTA BOX ;; formal_ordinary_fixed_point_definition
- | array_type_definition ;; formal_array_type_definition
- | access_definition ;; access_type_definition, formal_access_type_definition
- | interface_type_definition ;; formal_interface_type_definition
- ;
-
-;; formal_derived_type_definition ::=
-;; [abstract] [limited | synchronized] new subtype_mark [[and
interface_list]with private]
-formal_derived_type_definition
- : abstract_limited_synchronized_opt NEW name and_interface_list_opt WITH
PRIVATE
- %((wisi-face-apply-action [3 font-lock-function-name-face
font-lock-type-face]))%
- | abstract_limited_synchronized_opt NEW name and_interface_list_opt
- %((wisi-face-apply-action [3 font-lock-function-name-face
font-lock-type-face]))%
- ;
-
-formal_package_declaration
- : WITH PACKAGE name IS NEW name formal_package_actual_part
aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 9 statement-end])
- (wisi-face-apply-action [3 font-lock-function-name-face
font-lock-function-name-face
- 6 font-lock-function-name-face
font-lock-function-name-face])
- (wisi-indent-action [nil
- ada-indent-broken
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken ada-indent-broken
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken
- ada-indent-broken ada-indent-broken]))%
- ;
-
-formal_package_actual_part
- : LEFT_PAREN BOX RIGHT_PAREN ;; (<>)
- | ;; empty generic actual part
-
- ;; | LEFT_PAREN association_list RIGHT_PAREN
- ;; covered by name <empty formal_package_actual_part) in
formal_package_declaration
- ;; covers others => <>
- ;
-
-;; formal_package_association_list is merged into association_list to avoid
reduce/reduce conflict
-
-full_type_declaration
- : TYPE IDENTIFIER discriminant_part_opt IS type_definition
aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 7 statement-end])
- (wisi-name-action 2)
- (wisi-face-apply-action [2 nil font-lock-type-face])
-
- ;; Indentation of comment after 'is' is
- ;; ada-indent-record-rel-type if type_definition is a record.
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
- [ada-indent-broken (ada-indent-record* 'TYPE
5 ada-indent-broken)]
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- nil ada-indent-broken]))%
- | task_type_declaration
- | protected_type_declaration
- ;
-
-function_specification
- : FUNCTION name parameter_and_result_profile
- %((wisi-statement-action [1 statement-start])
- (wisi-name-action 2)
- (wisi-face-apply-action [2 font-lock-function-name-face
font-lock-function-name-face])
- (wisi-indent-action [nil
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken]))%
- %((wisi-propagate-name 2))%
- ;
-
-general_access_modifier_opt
- : ALL
- | CONSTANT
- | ;; empty
- ;
-
-;; generic_actual_part is not needed; see generic_instantiation
-
-;; generic_association is merged into association
-
-generic_declaration
- : generic_subprogram_declaration
- | generic_package_declaration
- ;
-
-generic_formal_part
- : GENERIC generic_formal_parameter_declarations
- %((wisi-statement-action [1 statement-start])
- (wisi-indent-action [nil ada-indent]))%
- | GENERIC
- %((wisi-statement-action [1 statement-start]))%
- ;
-
-generic_formal_parameter_declarations
- : generic_formal_parameter_declarations generic_formal_parameter_declaration
- | generic_formal_parameter_declaration
- ;
-
-generic_formal_parameter_declaration
- : formal_object_declaration
- | formal_type_declaration
- | formal_subprogram_declaration
- | formal_package_declaration
- | pragma_g
- | use_clause
- ;
-
-generic_instantiation
- ;; name generic_actual_part is included in name as a function call
- : PACKAGE name IS NEW name aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 7 statement-end])
- (wisi-name-action 2)
- (wisi-face-apply-action [2 font-lock-function-name-face
font-lock-function-name-face
- 5 font-lock-function-name-face
font-lock-function-name-face])
- (wisi-indent-action [nil
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- nil ada-indent-broken
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken ada-indent-broken]))%
- | overriding_indicator_opt PROCEDURE name IS NEW name
aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 2 statement-override 8
statement-end])
- (wisi-name-action 3)
- (wisi-face-apply-action [3 font-lock-function-name-face
font-lock-function-name-face
- 6 font-lock-function-name-face
font-lock-function-name-face])
- (wisi-indent-action [nil
- nil
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken ada-indent-broken
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken ada-indent-broken]))%
- | overriding_indicator_opt FUNCTION name IS NEW name
aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 2 statement-override 8
statement-end])
- (wisi-name-action 3)
- (wisi-face-apply-action [3 font-lock-function-name-face
font-lock-function-name-face
- 6 font-lock-function-name-face
font-lock-function-name-face])
- (wisi-indent-action [nil
- nil
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- nil ada-indent-broken
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken
- ada-indent-broken]))%
- ;
-
-generic_package_declaration
- : generic_formal_part package_specification SEMICOLON
- %((wisi-statement-action [1 statement-start 3 statement-end])
- (wisi-motion-action [1 2 3])
- (wisi-indent-action [[nil ada-indent] nil ada-indent-broken]))%
- ;
-
-generic_renaming_declaration
- : GENERIC PACKAGE name RENAMES name aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 7 statement-end])
- (wisi-name-action 3)
- (wisi-face-apply-action [3 font-lock-function-name-face
font-lock-function-name-face
- 5 font-lock-function-name-face
font-lock-function-name-face])
- (wisi-indent-action [nil
- nil
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken
- ada-indent-broken]))%
- | GENERIC PROCEDURE name RENAMES name aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 7 statement-end])
- (wisi-name-action 3)
- (wisi-face-apply-action [3 font-lock-function-name-face
font-lock-function-name-face
- 5 font-lock-function-name-face
font-lock-function-name-face])
- (wisi-indent-action [nil
- nil
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- (ada-indent-renames 3)
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken
- ada-indent-broken]))%
- | GENERIC FUNCTION name RENAMES name aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 7 statement-end])
- (wisi-name-action 3)
- (wisi-face-apply-action [3 font-lock-function-name-face
font-lock-function-name-face
- 5 font-lock-function-name-face
font-lock-function-name-face])
- (wisi-indent-action [nil
- nil
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- (ada-indent-renames 3)
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken
- ada-indent-broken]))%
- ;
-
-generic_subprogram_declaration
- : generic_formal_part subprogram_specification aspect_specification_opt
SEMICOLON
- %((wisi-statement-action [1 statement-start 2 statement-override 4
statement-end])
- (wisi-motion-action [1 2 4]))%
- ;
-
-goto_label
- : LESS_LESS IDENTIFIER GREATER_GREATER
- %((wisi-face-apply-action [2 nil font-lock-constant-face])
- (wisi-indent-action [ada-indent-label ada-indent-broken
ada-indent-broken]))%
- ;
-
-handled_sequence_of_statements
- : sequence_of_statements_opt EXCEPTION exception_handler_list_opt
- %((wisi-indent-action [[nil nil]
- (- ada-indent)
- [(- ada-indent-when ada-indent) (-
ada-indent-when ada-indent)]]))%
- | sequence_of_statements_opt
- ;
-
-identifier_list
- : identifier_list COMMA IDENTIFIER
- %((wisi-name-action 3)
- (wisi-indent-action [nil nil ada-indent-broken]))%
- | IDENTIFIER
- %((wisi-name-action 1))%
- ;
-
-identifier_opt
- : IDENTIFIER
- %()%
- %((wisi-propagate-name 1))%
- | ;; empty
- ;
-
-if_expression
- : IF expression_opt THEN expression_opt elsif_expression_list ELSE
expression_opt
- %((wisi-statement-action [1 motion 3 motion 6 motion])
- (wisi-motion-action [1 3 5 6])
- (wisi-indent-action [nil [ada-indent-broken ada-indent-broken] nil
ada-indent nil nil ada-indent]))%
- | IF expression_opt THEN expression_opt ELSE expression_opt
- %((wisi-statement-action [1 motion 3 motion 5 motion])
- (wisi-motion-action [1 3 5])
- (wisi-indent-action [nil [ada-indent-broken ada-indent-broken] nil
ada-indent nil ada-indent]))%
- | IF expression_opt THEN expression_opt elsif_expression_list
- %((wisi-statement-action [1 motion 3 motion])
- (wisi-motion-action [1 3 5])
- (wisi-indent-action [nil [ada-indent-broken ada-indent-broken] nil
ada-indent nil]))%
- | IF expression_opt THEN expression_opt
- %((wisi-statement-action [1 motion 3 motion])
- (wisi-motion-action [1 3])
- (wisi-indent-action [nil [ada-indent-broken ada-indent-broken] nil
ada-indent]))%
- ;
-
-if_statement
- : IF expression_opt THEN sequence_of_statements_opt elsif_statement_list ELSE
- sequence_of_statements_opt END IF SEMICOLON
- %((wisi-statement-action [1 statement-start 3 motion 6 motion 10
statement-end])
- (wisi-motion-action [1 3 5 6 10])
- (wisi-indent-action [nil
- [(wisi-hanging% ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken]
- nil
- [ada-indent ada-indent] nil nil
- [ada-indent ada-indent] nil ada-indent-broken
ada-indent-broken]))%
- | IF expression_opt THEN sequence_of_statements_opt ELSE
sequence_of_statements_opt END IF SEMICOLON
- %((wisi-statement-action [1 statement-start 3 motion 5 motion 9
statement-end])
- (wisi-motion-action [1 3 5 9])
- (wisi-indent-action [nil [(wisi-hanging% ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken]
- nil
- [ada-indent ada-indent] nil
- [ada-indent ada-indent] nil ada-indent-broken
ada-indent-broken]))%
- | IF expression_opt THEN sequence_of_statements_opt elsif_statement_list END
IF SEMICOLON
- %((wisi-statement-action [1 statement-start 3 motion 8 statement-end])
- (wisi-motion-action [1 3 5 8])
- (wisi-indent-action [nil [(wisi-hanging% ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken]
- nil
- [ada-indent ada-indent] nil nil ada-indent-broken
ada-indent-broken]))%
- | IF expression_opt THEN sequence_of_statements_opt END IF SEMICOLON
- %((wisi-statement-action [1 statement-start 3 motion 7 statement-end])
- (wisi-motion-action [1 3 7])
- (wisi-indent-action [nil [(wisi-hanging% ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken]
- nil
- [ada-indent ada-indent] nil ada-indent-broken
ada-indent-broken]))%
- ;
-
-incomplete_type_declaration
- : TYPE IDENTIFIER discriminant_part_opt IS TAGGED SEMICOLON
- %((wisi-statement-action [1 statement-start 6 statement-end])
- (wisi-name-action 2)
- (wisi-face-apply-action [2 nil font-lock-type-face])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken ada-indent-broken]))%
- | TYPE IDENTIFIER discriminant_part_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 3 statement-end])
- (wisi-name-action 2)
- (wisi-face-apply-action [2 nil font-lock-type-face])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken]))%
- ;
-
-index_constraint
- : LEFT_PAREN discrete_subtype_definition_list RIGHT_PAREN
- %((wisi-indent-action [nil (wisi-anchored 1 1) (wisi-anchored 1 0)]))%
- ;
-
-index_subtype_definition : name RANGE BOX ;
-
-index_subtype_definition_list
- : index_subtype_definition_list COMMA index_subtype_definition
- | index_subtype_definition
- ;
-
-interface_list
- : interface_list AND name
- %((wisi-face-apply-action [3 font-lock-function-name-face
font-lock-type-face]))%
- | name
- %((wisi-face-apply-action [1 font-lock-function-name-face
font-lock-type-face]))%
- ;
-
-interface_type_definition
- : LIMITED INTERFACE AND interface_list
- | TASK INTERFACE AND interface_list
- | PROTECTED INTERFACE AND interface_list
- | SYNCHRONIZED INTERFACE AND interface_list
- | LIMITED INTERFACE
- | TASK INTERFACE
- | PROTECTED INTERFACE
- | SYNCHRONIZED INTERFACE
- | INTERFACE
-;
-
-iteration_scheme
- : WHILE expression_opt
- %((wisi-indent-action [nil [ada-indent-broken ada-indent-broken]]))%
- | FOR iterator_specification_opt
- %((wisi-indent-action [nil [ada-indent-broken ada-indent-broken]]))%
- ;
-
-iterator_specification
- ;; also loop_parameter_specification, to avoid redundancy bewteen
- ;; iterator_name and discrete_subtype_definition; both can be just
- ;; 'name'. For example, a name could be either
- ;; 'Package_Name.Type_Name' from a loop_parameter_specification, or
- ;; "Object_Name.Iterator' from iterator_specification.
- ;;
- ;; That means both get marked with the same face, when they should
- ;; not be. If we include the conflict to get different face actions,
- ;; it will be resolved by identical stacks, one will be terminated at
- ;; random, and the wrong face action might still be applied. This can
- ;; only be fixed with true name resolution, so we remove any faces
- ;; that have been applied.
- ;;
- : IDENTIFIER COLON subtype_indication OF REVERSE name
- | IDENTIFIER COLON subtype_indication OF name
- | IDENTIFIER IN REVERSE discrete_subtype_definition
- %((wisi-face-remove-action [4]))%
-
- ;; The following can only be iterator_specifications. The name could
- ;; include a package name, but we can't tell that without full name
- ;; resolution.
- | IDENTIFIER OF REVERSE name
- | IDENTIFIER OF name
-
- | IDENTIFIER IN discrete_subtype_definition
- %((wisi-face-remove-action [3]))%
- ;
-
-iterator_specification_opt
- : iterator_specification
- | ;; empty
- ;
-
-;; library_* not needed; 'declaration' in compilation_unit
-
-loop_statement
- : block_label_opt iteration_scheme LOOP sequence_of_statements_opt END LOOP
identifier_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 2 statement-override 3 motion
8 statement-end])
- (wisi-motion-action [2 3 8])
- (wisi-indent-action [nil nil nil [ada-indent ada-indent] nil
ada-indent-broken ada-indent-broken
- ada-indent-broken]))%
- %((wisi-match-names 1 7))%
- | block_label_opt LOOP sequence_of_statements_opt END LOOP identifier_opt
SEMICOLON
- %((wisi-statement-action [1 statement-start 2 statement-override 4 motion
7 statement-end])
- (wisi-motion-action [2 4 7])
- (wisi-indent-action [nil nil [ada-indent ada-indent] nil
ada-indent-broken ada-indent-broken ada-indent-broken]))%
- %((wisi-match-names 1 6))%
- ;
-
-membership_choice_list
- : membership_choice_list BAR membership_choice
- | membership_choice
- ;
-
-membership_choice
- : simple_expression
- ;; ARM has choice_expression here, but that leads to a shift/reduce conflict,
because of the following productions:
- ;; membership_choice_list => membership_choice => choice_expression =>
choice_relation_and_list
- ;; relation => simple_expression IN choice_relation_and_list
- ;; thus 'choice_relation_and_list AND' could be followed by relation (=>
reduce) or choice_relation (=> shift)
- ;; This only occurs in legal Ada in expressions such as 'True in 1 and 3';
not useful, so we leave it out.
- | range_g
- ;; | name ;; subtype_mark - also covered by simple_expression; avoid
reduce/reduce conflict
- ;
-
-mod_clause_opt
- : AT MOD expression_opt SEMICOLON
- | ;; empty
- ;
-
-mode_opt
- : IN
- | IN OUT
- | OUT
- | ;; empty
- ;
-
-multiplying_operator : STAR | SLASH | MOD | REM ; ;; * | / | mod | rem
-
-name_list
- : name_list COMMA name
- | name
- ;
-
-name
- ;; ARM has name ( discrete_subtype_definition ) here, but that's
- ;; partly redundant with name actual_parameter_part, and partly with
- ;; subtype_indication; this is the part that is not redundant.
- : name LEFT_PAREN range_list RIGHT_PAREN ;; slice or constraint
- ;; test/ada_mode_nominal.ads Access_Unconstrained_Array_Type_1
- ;; test/ada_mode-parens.adb
- ;; Slice_1
- ;; (1,
- ;; C
- ;; (1 .. 2));
- ;;
- ;; tests/g-comlin.adb
- ;; return CL.Argument (The_Switch.Arg_Num)
- ;; (The_Switch.First ..
- ;; The_Switch.Last);
- %((wisi-indent-action [nil
- (wisi-anchored% 1 ada-indent-broken)
- (wisi-hanging (wisi-anchored 2 1)
- (wisi-anchored 2 (+ 1
ada-indent-broken)))
- (wisi-anchored 2 0)]))%
-
- | name actual_parameter_part
- ;; type_conversion, function_call, procedure call, generic
- ;; instantiation, indexed_component.
- ;;
- ;; test/ada_mode-parens.adb
- ;; No_Conditional_Set : constant Ada.Strings.Maps.Character_Set :=
- ;; Ada.Strings.Maps."or"
- ;; (Ada.Strings.Maps.To_Set (' '),
- ;;
- ;; Local_11 : Local_11_Type := Local_11_Type'
- ;; (A => Integer
- ;; (1.0),
- ;; indented by association
- ;;
- ;;test/hanging.adb; sets ada-indent-hanging-rel-exp: t
- ;; X_Long_Name
- ;; := F_Long_Name
- ;; (A => True,
- ;; B => True);
- %((wisi-indent-action [nil
- (if ada-indent-hanging-rel-exp
- (wisi-anchored 1 ada-indent-broken)
- (wisi-anchored% 1 ada-indent-broken))]))%
-
- | selected_component ;; starts with name
- %()%
- %((wisi-propagate-name 1))%
-
- | attribute_reference ;; starts with name
- | qualified_expression ;; starts with name
-
- | IDENTIFIER ;; from direct_name
- ;; marking this for possible later face-apply, to prevent applying
- ;; face to the aggregate of an allocator, and other similar cases.
- ;; test/ada_mode-nominal.adb
- ;; Object_3 : access Record_Type_3 := new Record_Type_3 (...)
- %((wisi-face-mark-action [1 suffix]))%
- %((wisi-propagate-name 1))%
-
- | CHARACTER_LITERAL ;; only in an expression, so no type or function-name
face
-
- | STRING_LITERAL ;; operator_symbol, designator
- %()%
- %((wisi-propagate-name 1))%
-
- | AT_SIGN ;; target_name
-
- ;; | explicit_dereference in selected_component
- ;; | indexed_component same as 'name actual_parameter_part' above
- ;; | generalized_reference same as 'name'
- ;; | generalized_indexing same as 'indexed_component'
- ;
-
-name_opt
- : name
- %()%
- %((wisi-propagate-name 1))%
- | ;; empty
- ;
-
-null_exclusion_opt
- : NOT NULL
- | ;; empty
- ;
-
-;; use _only_ to avoid a conflict between name and null_exclusion_opt; name
must be a type
-null_exclusion_opt_name_type
- : IDENTIFIER
- %((wisi-face-apply-action [1 nil font-lock-type-face]))%
- | selected_component
- %((wisi-face-apply-action [1 font-lock-function-name-face
font-lock-type-face]))%
- | NOT NULL IDENTIFIER
- %((wisi-face-apply-action [3 nil font-lock-type-face]))%
- | NOT NULL selected_component
- %((wisi-face-apply-action [3 font-lock-function-name-face
font-lock-type-face]))%
- ;
-
-null_procedure_declaration
- : overriding_indicator_opt procedure_specification IS NULL
aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 2 statement-override 6
statement-end])
- (wisi-indent-action [nil nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken]))%
- ;
-
-object_declaration
- : identifier_list COLON aliased_opt constant_opt subtype_indication
COLON_EQUAL
- expression_opt aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 9 statement-end])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken
- (wisi-anchored%- 6 ada-indent-broken)
ada-indent-broken ada-indent-broken]))%
- | identifier_list COLON aliased_opt constant_opt access_definition
COLON_EQUAL
- expression_opt aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 9 statement-end])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken ada-indent-broken
- (wisi-anchored% 6 ada-indent-broken)
ada-indent-broken ada-indent-broken]))%
- | identifier_list COLON aliased_opt constant_opt array_type_definition
COLON_EQUAL
- expression_opt aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 9 statement-end])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken ada-indent-broken
- (wisi-anchored% 6 ada-indent-broken)
ada-indent-broken ada-indent-broken]))%
- | identifier_list COLON aliased_opt constant_opt subtype_indication
aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 7 statement-end])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken ada-indent-broken]))%
- | identifier_list COLON aliased_opt constant_opt access_definition
aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 7 statement-end])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken
- ada-indent-broken ada-indent-broken]))%
- | identifier_list COLON aliased_opt constant_opt array_type_definition
aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 7 statement-end])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken
- ada-indent-broken ada-indent-broken]))%
- | single_task_declaration
- | single_protected_declaration
- ;
-
-object_renaming_declaration
- : IDENTIFIER COLON null_exclusion_opt name RENAMES name
aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 8 statement-end])
- (wisi-name-action 1)
- (wisi-face-apply-action [4 font-lock-function-name-face
font-lock-type-face])
- (wisi-indent-action [nil
- ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken ada-indent-broken]))%
- | IDENTIFIER COLON access_definition RENAMES name aspect_specification_opt
SEMICOLON
- %((wisi-statement-action [1 statement-start 7 statement-end])
- (wisi-name-action 1)
- (wisi-indent-action [nil
- ada-indent-broken ada-indent-broken
ada-indent-broken
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken ada-indent-broken]))%
- | IDENTIFIER COLON EXCEPTION RENAMES name aspect_specification_opt SEMICOLON
;; exception_renaming_declaration
- %((wisi-statement-action [1 statement-start 7 statement-end])
- (wisi-name-action 1)
- (wisi-face-apply-action [5 font-lock-function-name-face nil])
- (wisi-indent-action [nil
- ada-indent-broken ada-indent-broken
ada-indent-broken
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken ada-indent-broken]))%
- ;
-
-;; operator_symbol is STRING_LITERAL, in name
-
-overriding_indicator_opt
- : NOT OVERRIDING
- %((wisi-statement-action [1 statement-start 2 statement-override]))%
- | OVERRIDING
- %((wisi-statement-action [1 statement-start]))%
- | ;; empty - following keyword is statement-start
- ;
-
-package_body
- : PACKAGE BODY name aspect_specification_opt IS declarative_part_opt
- BEGIN handled_sequence_of_statements END name_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 5 motion 7 motion 11
statement-end])
- (wisi-name-action 3)
- (wisi-motion-action [1 5 7 [8 WHEN] 11])
- (wisi-face-apply-action [3 font-lock-function-name-face
font-lock-function-name-face
- 10 font-lock-function-name-face
font-lock-function-name-face])
- (wisi-indent-action [nil
- ada-indent-broken
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- nil nil [ada-indent ada-indent]
- nil [ada-indent ada-indent] nil
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken]))%
- %((wisi-match-names 3 10))%
-
- | PACKAGE BODY name aspect_specification_opt IS declarative_part_opt END
name_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 5 motion 9 statement-end])
- (wisi-name-action 3)
- (wisi-motion-action [1 5 9])
- (wisi-face-apply-action [3 font-lock-function-name-face
font-lock-function-name-face
- 8 font-lock-function-name-face
font-lock-function-name-face])
- (wisi-indent-action [nil
- ada-indent-broken
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken nil [ada-indent ada-indent] nil
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken]))%
- %((wisi-match-names 3 8))%
- ;
-
-package_body_stub
- : PACKAGE BODY name IS SEPARATE aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 7 statement-end])
- (wisi-name-action 3)
- (wisi-face-apply-action [3 font-lock-function-name-face
font-lock-function-name-face])
- (wisi-indent-action [nil
- ada-indent-broken
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- nil ada-indent-broken ada-indent-broken
ada-indent-broken]))%
- ;
-
-package_declaration
- : package_specification SEMICOLON
- %((wisi-statement-action [1 statement-start 2 statement-end])
- (wisi-motion-action [1 2]))%
- ;
-
-package_renaming_declaration
- : PACKAGE name RENAMES name aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 6 statement-end])
- (wisi-name-action 2)
- (wisi-face-apply-action [2 font-lock-function-name-face
font-lock-function-name-face
- 4 font-lock-function-name-face
font-lock-function-name-face])
- (wisi-indent-action [nil
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken ada-indent-broken]))%
- ;
-
-package_specification
- : PACKAGE name aspect_specification_opt IS declarative_part_opt PRIVATE
declarative_part_opt END name_opt
- %((wisi-statement-action [1 statement-start 4 motion 6 motion])
- (wisi-name-action 2)
- (wisi-motion-action [1 4 6])
- (wisi-face-apply-action [2 font-lock-function-name-face
font-lock-function-name-face
- 9 font-lock-function-name-face
font-lock-function-name-face])
- (wisi-indent-action [nil
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken nil [ada-indent ada-indent] nil
- [ada-indent ada-indent] nil
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))]))%
- %((wisi-match-names 2 9))%
- | PACKAGE name aspect_specification_opt IS declarative_part_opt END name_opt
- %((wisi-statement-action [1 statement-start 4 motion])
- (wisi-name-action 2)
- (wisi-motion-action [1 4])
- (wisi-face-apply-action [2 font-lock-function-name-face
font-lock-function-name-face
- 7 font-lock-function-name-face
font-lock-function-name-face])
- (wisi-indent-action [nil
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken nil [ada-indent ada-indent] nil
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))]))%
- %((wisi-match-names 2 7))%
- ;
-
-parameter_and_result_profile
- : formal_part result_profile
- %((wisi-indent-action [nil (ada-indent-return 1 0)]))%
- | result_profile
- ;
-
-;; parameter_association is merged into association
-;; parameter_association_list is merged into association_list
-
-parameter_profile_opt
- : formal_part
- | ;; empty
- ;
-
-parameter_specification
- : identifier_list COLON aliased_opt mode_opt null_exclusion_opt name
COLON_EQUAL expression_opt
- %((wisi-face-apply-action [6 font-lock-function-name-face
font-lock-type-face])
- (wisi-indent-action [nil
- ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken (wisi-anchored% 7
ada-indent-broken)]))%
- | identifier_list COLON aliased_opt mode_opt null_exclusion_opt name
- %((wisi-face-apply-action [6 font-lock-function-name-face
font-lock-type-face])
- (wisi-indent-action [nil
- ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))]))%
- | identifier_list COLON aliased_opt access_definition COLON_EQUAL
expression_opt
- %((wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken
- (wisi-anchored% 5 ada-indent-broken)]))%
- | identifier_list COLON aliased_opt access_definition
- %((wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken]))%
- | ;; empty
- ;
-
-parameter_specification_list
- : parameter_specification_list SEMICOLON parameter_specification
- | parameter_specification
- ;
-
-paren_expression
- : LEFT_PAREN expression_opt RIGHT_PAREN
- ;;test/ada_mode-parens.ads
- ;; function Expression_Function_1 (V : Integer) return Boolean
- ;; is ((V = V and then True)
- ;; or else True);
- %((wisi-indent-action [nil
- (wisi-hanging (wisi-anchored 1 1)
- (wisi-anchored 1 (+ 1
ada-indent-broken)))
- (wisi-anchored 1 0)]))%
-
- ;; AI12-0157[1] aggregate instead of (aggregate)
- | aggregate
- ;
-
-pragma_g
- : PRAGMA IDENTIFIER LEFT_PAREN association_list RIGHT_PAREN SEMICOLON
- ;; ARM has 'pragma_argument_association'; this is a superset, and reduces
redundancy
- %((wisi-statement-action [1 statement-start 6 statement-end])
- (wisi-face-apply-action [2 nil font-lock-function-name-face])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
(wisi-anchored 3 1) (wisi-anchored 3 0)
- ada-indent-broken]))%
- ;; ARM 4.5.7(7), ARM 4.5.8(4) allow ( conditional|quantified_expression )
instead of (( ... ))
- | PRAGMA IDENTIFIER LEFT_PAREN conditional_quantified_expression RIGHT_PAREN
SEMICOLON
- %((wisi-statement-action [1 statement-start 6 statement-end])
- (wisi-face-apply-action [2 nil font-lock-function-name-face])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
(wisi-anchored 3 1) (wisi-anchored 3 0)
- ada-indent-broken]))%
- | PRAGMA IDENTIFIER SEMICOLON
- %((wisi-statement-action [1 statement-start 3 statement-end])
- (wisi-face-apply-action [2 nil font-lock-function-name-face])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken]))%
- ;
-
-;; prefix is name
-
-primary
- : NUMERIC_LITERAL
- %((wisi-face-apply-action [1 nil font-lock-constant-face]))%
- | NULL
- ;; | STRING_LITERAL in name
- | aggregate
- %((wisi-indent-action [(ada-indent-aggregate)]))%
- | name
- | NEW name
- ;; allocator, FIXME: leaving out subpool_specification.
- %((wisi-face-apply-action [2 font-lock-function-name-face
font-lock-type-face]))%
- ;; | LEFT_PAREN expression RIGHT_PAREN ;; covered by aggregate
- ;; | LEFT_PAREN conditional_quantified_expression RIGHT_PAREN ; covered by
aggregate
- ;
-
-private_extension_declaration
- : TYPE IDENTIFIER discriminant_part_opt IS abstract_limited_synchronized_opt
NEW
- subtype_indication and_interface_list_opt WITH PRIVATE
aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 12 statement-end])
- (wisi-name-action 2)
- (wisi-face-apply-action [2 nil font-lock-type-face])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken ada-indent-broken
- ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken
- nil ada-indent-broken]))%
- ;
-
-private_type_declaration
- : TYPE IDENTIFIER discriminant_part_opt IS abstract_tagged_limited_opt
PRIVATE aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 8 statement-end])
- (wisi-name-action 2)
- (wisi-face-apply-action [2 nil font-lock-type-face])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken nil
ada-indent-broken ada-indent-broken
- nil ada-indent-broken]))%
- ;
-
-procedure_call_statement
- : name SEMICOLON
- %((wisi-statement-action [1 statement-start 2 statement-end])
- (wisi-indent-action [(wisi-hanging- nil ada-indent-broken)
ada-indent-broken]))%
- ;
-
-procedure_specification
- : PROCEDURE name parameter_profile_opt
- %((wisi-statement-action [1 statement-start])
- (wisi-name-action 2)
- (wisi-face-apply-action [2 font-lock-function-name-face
font-lock-function-name-face])
- (wisi-indent-action [nil
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken]))%
- %((wisi-propagate-name 2))%
- ;
-
-proper_body
- : subprogram_body
- | package_body
- | task_body
- | protected_body
- ;
-
-protected_body
- : PROTECTED BODY IDENTIFIER aspect_specification_opt IS
protected_operation_item_list_opt END identifier_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 5 motion 9 statement-end])
- (wisi-name-action 3)
- (wisi-motion-action [1 5 9])
- (wisi-face-apply-action [3 nil font-lock-type-face 8 nil
font-lock-type-face])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken nil nil
ada-indent nil ada-indent-broken
- ada-indent-broken]))%
- %((wisi-match-names 3 8))%
- ;
-
-protected_body_stub
- : PROTECTED BODY IDENTIFIER IS SEPARATE aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 7 statement-end])
- (wisi-name-action 3)
- (wisi-face-apply-action [3 nil font-lock-type-face])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken
- ada-indent-broken ada-indent-broken]))%
- ;
-
-protected_definition
- : declarative_part_opt PRIVATE declarative_part_opt END identifier_opt
- %((wisi-statement-action [2 motion])
- (wisi-face-apply-action [5 nil font-lock-type-face])
- (wisi-indent-action [[ada-indent ada-indent] nil [ada-indent ada-indent]
nil nil]))%
- %((wisi-propagate-name 5))%
-
- | declarative_part_opt END identifier_opt
- %((wisi-face-apply-action [3 nil font-lock-type-face])
- (wisi-indent-action [[ada-indent ada-indent] nil nil]))%
- %((wisi-propagate-name 3))%
- ;
-
-protected_operation_item
- : subprogram_declaration
- | subprogram_body
- | entry_body
- | expression_function_declaration
- | null_procedure_declaration
- | aspect_clause
- ;
-
-protected_operation_item_list
- : protected_operation_item_list protected_operation_item
- | protected_operation_item
- ;
-
-protected_operation_item_list_opt
- : protected_operation_item_list
- | ;; empty
- ;
-
-protected_opt
- : PROTECTED
- | ;; empty
- ;
-
-protected_type_declaration
- : PROTECTED TYPE IDENTIFIER discriminant_part_opt aspect_specification_opt IS
- NEW interface_list WITH protected_definition SEMICOLON
- %((wisi-statement-action [1 statement-start 6 motion 11 statement-end])
- (wisi-name-action 3)
- (wisi-motion-action [1 6 [10 PRIVATE] 11])
- (wisi-face-apply-action [3 nil font-lock-type-face])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken nil nil
- ada-indent-broken ada-indent-broken
ada-indent-broken nil ada-indent-broken]))%
- %((wisi-match-names 3 10))%
- | PROTECTED TYPE IDENTIFIER discriminant_part_opt aspect_specification_opt
IS protected_definition SEMICOLON
- %((wisi-statement-action [1 statement-start 6 motion 8 statement-end])
- (wisi-name-action 3)
- (wisi-motion-action [1 6 [7 PRIVATE] 8])
- (wisi-face-apply-action [3 nil font-lock-type-face])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken nil [nil ada-indent] nil
- ada-indent-broken]))%
- %((wisi-match-names 3 7))%
- ;
-
-;; protected_operation_declaration merged into declaration
-
-qualified_expression
- : name tick aggregate
- %((wisi-face-apply-action [1 font-lock-function-name-face
font-lock-type-face])
- (wisi-indent-action [nil nil (if ada-indent-hanging-rel-exp
- (wisi-anchored 1 ada-indent-broken)
- (wisi-anchored% 1 ada-indent-broken))]))%
- ;
-
-quantified_expression
- : FOR quantifier iterator_specification EQUAL_GREATER expression_opt
- %((wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken (wisi-anchored% 4 ada-indent-broken)]))%
- ;
-
-quantifier : ALL | SOME ;
-
-raise_expression
- : RAISE name WITH expression_opt
- %((wisi-indent-action [nil ada-indent-broken ada-indent-broken
(wisi-anchored% 3 ada-indent-broken)]))%
- | RAISE name
- ;
-
-raise_statement
- : RAISE name WITH expression_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 5 statement-end])
- ;; test/ada_mode-nominal.adb
- ;; raise Constraint_Error with
- ;; "help " &
- ;; "me!";
- ;;
- ;; raise Constraint_Error
- ;; with Integer'Image (1) &
- ;; "help!";
- (wisi-indent-action [nil
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken (wisi-anchored% 3
ada-indent-broken)
- ada-indent-broken]))%
- | RAISE name SEMICOLON
- %((wisi-statement-action [1 statement-start 3 statement-end])
- (wisi-indent-action [nil
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken]))%
- | RAISE SEMICOLON
- %((wisi-statement-action [1 statement-start 2 statement-end]))%
- ;
-
-range_g
- : name tick RANGE LEFT_PAREN expression_opt RIGHT_PAREN ;;
range_attribute_reference
- %((wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken (wisi-anchored 4 1)
- (wisi-anchored 4 0)]))%
- | name tick RANGE ;; range_attribute_reference
- | simple_expression DOT_DOT simple_expression
- ;
-
-range_list
- : range_list COMMA range_g
- | range_g
- ;
-
-real_range_specification_opt
- : RANGE simple_expression DOT_DOT simple_expression
- | ;; empty
- ;
-
-record_definition
- : RECORD component_list_opt END RECORD
- %((wisi-indent-action [[(ada-indent-record* 'TYPE 1 0) (ada-indent-record*
'TYPE 1 ada-indent)]
- [(ada-indent-record* 'TYPE 1 ada-indent)
(ada-indent-record* 'TYPE 1 ada-indent)]
- (ada-indent-record* 'TYPE 1 0)
- nil]))%
- ;; ' terminate quote
- | NULL RECORD
- ;
-
-record_representation_clause
- : FOR name USE RECORD mod_clause_opt component_clause_list END RECORD
SEMICOLON
- %((wisi-statement-action [1 statement-start 5 statement-end])
- (wisi-face-apply-action [2 font-lock-function-name-face
font-lock-type-face])
- (wisi-indent-action [nil
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken
- [(ada-indent-record* 'FOR 4 0) (ada-indent-record*
'FOR 4 ada-indent)]
- (ada-indent-record 1 4 ada-indent)
- [(ada-indent-record* 'FOR 4 ada-indent)
(ada-indent-record* 'FOR 4 ada-indent)]
- (ada-indent-record* 'FOR 4 0)
- ada-indent-broken ada-indent-broken]))%
- ;
-
-relation_and_list
- : relation_and_list AND relation
- | relation AND relation
- ;
-
-relation_and_then_list
- : relation_and_then_list AND THEN relation
- | relation AND THEN relation
- ;
-
-relation_or_list
- : relation_or_list OR relation
- | relation OR relation
- ;
-
-relation_or_else_list
- : relation_or_else_list OR ELSE relation
- | relation OR ELSE relation
- ;
-
-relation_xor_list
- : relation_xor_list XOR relation
- | relation XOR relation
- ;
-
-;; http://www.ada-auth.org/cgi-bin/cvsweb.cgi/ai12s/ai12-0022-1.txt?rev=1.13
-;; adds raise_expression
-relation
- : simple_expression NOT IN membership_choice_list
- | simple_expression IN membership_choice_list
- | simple_expression relational_operator simple_expression
- | simple_expression
- | raise_expression
- ;
-
-relational_operator
- : EQUAL | SLASH_EQUAL | LESS | LESS_EQUAL | GREATER | GREATER_EQUAL ;
- ;; = | /= | < | <= | > | >=
-
-renaming_declaration
- : object_renaming_declaration ;; includes exception_renaming_declaration
- | package_renaming_declaration
- | subprogram_renaming_declaration
- | generic_renaming_declaration
- ;
-
-requeue_statement
- : REQUEUE name WITH ABORT SEMICOLON
- %((wisi-statement-action [1 statement-start 5 statement-end]))%
- | REQUEUE name SEMICOLON
- %((wisi-statement-action [1 statement-start 3 statement-end]))%
- ;
-
-;; not in LRM; used to implement consistent indentation
-result_profile
- : RETURN null_exclusion_opt name_opt
- %((wisi-face-apply-action [3 font-lock-function-name-face
font-lock-type-face])
- (wisi-indent-action* 1
- [nil
- (wisi-anchored* 1 ada-indent-broken)
- (wisi-anchored*- 1 ada-indent-broken)]))%
- | RETURN access_definition
- ;; test/ada_mode-nominal.adb
- ;; function Function_Access_1
- ;; (A_Param : in Float)
- ;; return access
- ;; Standard.Float
- %((wisi-indent-action* 1 [nil (wisi-anchored*- 1 ada-indent-broken)]))%
- ;
-
-return_subtype_indication
- : subtype_indication
- | access_definition
- ;
-
-selected_component
- : name DOT IDENTIFIER
- %((wisi-face-mark-action [1 prefix 3 suffix])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken]))%
- %((wisi-merge-names 1 3))%
-
- | name DOT CHARACTER_LITERAL
- %((wisi-face-mark-action [1 prefix]))%
-
- | name DOT STRING_LITERAL
- %((wisi-face-mark-action [1 prefix]))%
- %((wisi-merge-names 1 3))%
-
- | name DOT ALL
- %((wisi-face-mark-action [1 prefix]))%
- ;
-
-;; selector_name - IDENTIFIER, STRING_LITERAL overlap name; CHARACTER_LITERAL
used separately
-;; : IDENTIFIER | CHARACTER_LITERAL | STRING_LITERAL ; ;; operator_symbol
-
-selective_accept
- : SELECT select_alternative_list_opt ELSE sequence_of_statements_opt END
SELECT SEMICOLON
- %((wisi-statement-action [1 statement-start 3 motion 7 statement-end])
- (wisi-motion-action [1 [2 OR] 3 7])
- (wisi-indent-action [[nil ada-indent] [nil ada-indent] nil [ada-indent
ada-indent] nil ada-indent-broken
- ada-indent-broken]))%
- | SELECT select_alternative_list_opt END SELECT SEMICOLON
- %((wisi-statement-action [1 statement-start 5 statement-end])
- (wisi-motion-action [1 [2 OR] 5])
- (wisi-indent-action [[nil ada-indent] [nil ada-indent] nil
ada-indent-broken ada-indent-broken]))%
- ;
-
-select_alternative
- ;; we can't use guard_opt here because when present a guard is a
- ;; block-start, but when absent there is no block-start
- : WHEN expression_opt EQUAL_GREATER accept_statement
sequence_of_statements_opt ;; guard accept_alternative
- %((wisi-statement-action [1 motion])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken ada-indent
ada-indent]))%
- | WHEN expression_opt EQUAL_GREATER TERMINATE SEMICOLON ;;
terminate_alternative
- %((wisi-statement-action [1 motion 4 statement-start 5 statement-end])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken ada-indent
nil]))%
- | WHEN expression_opt EQUAL_GREATER delay_alternative
- %((wisi-statement-action [1 motion])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent]))%
- | accept_statement sequence_of_statements_opt ;; accept_alternative
- | TERMINATE SEMICOLON ;; terminate_alternative
- %((wisi-statement-action [1 statement-start 2 statement-end]))%
- | delay_alternative
- ;
-
-select_alternative_list
- : select_alternative_list OR select_alternative
- %((wisi-statement-action [2 motion])
- (wisi-motion-action [[1 OR] 2])
- (wisi-indent-action [nil nil ada-indent]))%
- | select_alternative
- %((wisi-indent-action [ada-indent]))%
- ;
-
-select_alternative_list_opt
- : select_alternative_list
- | ;; empty
- ;
-
-select_statement
- : selective_accept
- | timed_entry_call
- | conditional_entry_call
- | asynchronous_select
- ;
-
-sequence_of_statements
- : sequence_of_statements statement
- | statement
- ;
-
-;; Wherever the ARM requires a sequence_of_statements, we allow
-;; nothing; this simplifies indenting skeletons (see ada-skel), and is
-;; more user-friendly for indenting while editing.
-sequence_of_statements_opt
- : sequence_of_statements
- | ;; empty
- ;
-
-simple_expression
- : unary_adding_operator term_list
- | term_list
- ;
-
-simple_return_statement
- : RETURN expression_opt SEMICOLON
- ;; test/ada_mode-parens.adb Function_3
- ;; return
- ;; 1.0 +
- ;; 2.0;
- %((wisi-statement-action [1 statement-start 3 statement-end])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken]))%
- ;
-
-simple_statement
- : NULL SEMICOLON;; null_statement
- %((wisi-statement-action [1 statement-start 2 statement-end]))%
- | assignment_statement
- | exit_statement
- | GOTO IDENTIFIER SEMICOLON ;; goto_statement
- %((wisi-statement-action [1 statement-start 3 statement-end])
- (wisi-face-apply-action [2 nil font-lock-constant-face]))%
- | procedure_call_statement
- | simple_return_statement
- ;; | entry_call_statement ; covered by procedure_call_statement
- | requeue_statement
- | delay_statement
- | ABORT name SEMICOLON ;; abort_statement; ignoring list of tasks
- %((wisi-statement-action [1 statement-start 3 statement-end]))%
- | raise_statement
- ;; | code_statement
- | pragma_g
- ;
-
-single_protected_declaration
- : PROTECTED IDENTIFIER aspect_specification_opt IS NEW interface_list WITH
protected_definition SEMICOLON
- %((wisi-statement-action [1 statement-start 4 motion 7 motion 9
statement-end])
- (wisi-name-action 2)
- (wisi-motion-action [1 4 7 [8 PRIVATE] 9])
- (wisi-face-apply-action [2 nil font-lock-type-face])
- (wisi-indent-action [nil ada-indent-broken nil nil ada-indent-broken
ada-indent-broken ada-indent-broken nil
- ada-indent-broken]))%
- %((wisi-match-names 2 8))%
-
- | PROTECTED IDENTIFIER aspect_specification_opt IS protected_definition
SEMICOLON
- %((wisi-statement-action [1 statement-start 4 motion 6 statement-end])
- (wisi-name-action 2)
- (wisi-motion-action [1 4 [5 PRIVATE] 6])
- (wisi-face-apply-action [2 nil font-lock-type-face])
- (wisi-indent-action [nil ada-indent-broken nil [nil ada-indent] nil
ada-indent-broken]))%
- %((wisi-match-names 2 5))%
- ;
-
-single_task_declaration
- : TASK IDENTIFIER aspect_specification_opt IS NEW interface_list WITH
task_definition END identifier_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 4 motion 11 statement-end])
- (wisi-name-action 2)
- (wisi-motion-action [1 4 [8 PRIVATE] 11])
- (wisi-face-apply-action [2 nil font-lock-type-face 9 nil
font-lock-type-face])
- (wisi-indent-action [nil ada-indent-broken nil nil ada-indent-broken
ada-indent-broken ada-indent-broken nil
- nil ada-indent-broken ada-indent-broken]))%
- %((wisi-match-names 2 10))%
-
- | TASK IDENTIFIER aspect_specification_opt IS task_definition END
identifier_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 4 motion 8 statement-end])
- (wisi-name-action 2)
- (wisi-motion-action [1 4 [5 PRIVATE] 8])
- (wisi-face-apply-action [2 nil font-lock-type-face 6 nil
font-lock-type-face])
- (wisi-indent-action [nil ada-indent-broken nil [nil ada-indent] nil nil
ada-indent-broken ada-indent-broken]))%
- %((wisi-match-names 2 7))%
-
- | TASK IDENTIFIER aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 4 statement-end])
- (wisi-name-action 2)
- (wisi-face-apply-action [2 nil font-lock-type-face])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken]))%
- ;
-
-statement
- : goto_label
- | simple_statement
- | compound_statement
- ;
-
-subprogram_body
- : overriding_indicator_opt subprogram_specification aspect_specification_opt
IS declarative_part_opt
- BEGIN handled_sequence_of_statements END name_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 2 statement-override 4 motion
6 motion 10 statement-end])
- (wisi-motion-action [1 2 4 6 [7 WHEN] 10])
- (wisi-face-apply-action [9 font-lock-function-name-face
font-lock-function-name-face])
- (wisi-indent-action [nil [nil ada-indent] nil nil [ada-indent ada-indent]
- nil [ada-indent ada-indent] nil ada-indent-broken
ada-indent-broken]))%
- %((wisi-match-names 2 9))%
- ;
-
-subprogram_body_stub
- : overriding_indicator_opt subprogram_specification IS SEPARATE
aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 2 statement-override 6
statement-end])
- (wisi-indent-action [nil nil nil ada-indent-broken ada-indent-broken
ada-indent-broken]))%
- ;
-
-subprogram_declaration
- : overriding_indicator_opt subprogram_specification aspect_specification_opt
SEMICOLON
- %((wisi-statement-action [1 statement-start 2 statement-override 4
statement-end]))%
- ;
-
-subprogram_default
- : name
- %((wisi-face-apply-action [1 font-lock-function-name-face
font-lock-function-name-face]))%
- | BOX
- | NULL ;
-
-subprogram_renaming_declaration
- : overriding_indicator_opt subprogram_specification RENAMES name
aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 2 statement-override 6
statement-end])
- (wisi-face-apply-action [4 font-lock-function-name-face
font-lock-function-name-face])
- (wisi-indent-action [nil
- nil (ada-indent-renames 2)
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- ada-indent-broken ada-indent-broken]))%
- ;
-
-subprogram_specification
- : procedure_specification
- %()%
- %((wisi-propagate-name 1))%
- | function_specification
- %()%
- %((wisi-propagate-name 1))%
- ;
-
-subtype_declaration
- : SUBTYPE IDENTIFIER IS subtype_indication aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 6 statement-end])
- (wisi-name-action 2)
- (wisi-face-apply-action [2 nil font-lock-type-face])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken nil
- ada-indent-broken]))%
- ;
-
-subtype_indication
- : NOT NULL name constraint
- ;; The last component of a selected_component could be an iterator
- ;; function in a loop iteration_scheme, not a type. See the comment
- ;; in iterator_specification.
- %((wisi-face-apply-action [3 font-lock-function-name-face
font-lock-type-face]))%
- | NOT NULL name
- %((wisi-face-apply-action [3 font-lock-function-name-face
font-lock-type-face]))%
- | name constraint
- %((wisi-face-apply-action [1 font-lock-function-name-face
font-lock-type-face]))%
- | name
- %((wisi-face-apply-action [1 font-lock-function-name-face
font-lock-type-face]))%
- ;
-
-;; subtype_mark replaced by name
-
-subunit
- : SEPARATE LEFT_PAREN name RIGHT_PAREN proper_body
- %((wisi-statement-action [1 statement-start 5 statement-override])
- (wisi-indent-action [nil
- (wisi-hanging%- ada-indent-broken (* 2
ada-indent-broken))
- (wisi-anchored 2 1) (wisi-anchored 2 0) nil]))%
- ;
-
-task_body
- : TASK BODY IDENTIFIER aspect_specification_opt IS declarative_part_opt
- BEGIN handled_sequence_of_statements END identifier_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 5 motion 7 motion 11
statement-end])
- (wisi-name-action 3)
- (wisi-motion-action [1 5 7 [8 WHEN] 11])
- (wisi-face-apply-action [3 nil font-lock-type-face 10 nil
font-lock-type-face])
- (wisi-indent-action [nil nil ada-indent-broken nil nil [ada-indent
ada-indent]
- nil [ada-indent ada-indent] nil
ada-indent-broken ada-indent-broken]))%
- %((wisi-match-names 3 10))%
- ;
-
-task_body_stub
- : TASK BODY IDENTIFIER IS SEPARATE aspect_specification_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 7 statement-end])
- (wisi-name-action 3)
- (wisi-face-apply-action [3 nil font-lock-type-face])
- (wisi-indent-action [nil nil ada-indent-broken nil ada-indent-broken
ada-indent-broken ada-indent-broken]))%
- ;
-
-;; LRM includes 'end identifier' here; we put that in
-;; task_type_declaration, single_task_declaration to simplify motion
-;; actions.
-task_definition
- : declarative_part_opt PRIVATE declarative_part_opt
- %((wisi-statement-action [2 motion])
- (wisi-indent-action [[ada-indent ada-indent] nil [ada-indent
ada-indent]]))%
- | declarative_part_opt
- %((wisi-indent-action [[ada-indent ada-indent]]))%
- ;
-
-;; task_item replaced by declaration
-
-task_type_declaration
- : TASK TYPE IDENTIFIER discriminant_part_opt aspect_specification_opt IS
- NEW interface_list WITH task_definition END identifier_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 6 motion 9 motion 13
statement-end])
- (wisi-name-action 3)
- (wisi-motion-action [1 6 9 [10 PRIVATE] 13])
- (wisi-face-apply-action [3 nil font-lock-type-face 12 nil
font-lock-type-face])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken nil nil
- ada-indent-broken ada-indent-broken
ada-indent-broken nil nil ada-indent-broken
- ada-indent-broken]))%
- %((wisi-match-names 3 12))%
- | TASK TYPE IDENTIFIER discriminant_part_opt aspect_specification_opt IS
task_definition END identifier_opt SEMICOLON
- %((wisi-statement-action [1 statement-start 6 motion 10 statement-end])
- (wisi-name-action 3)
- (wisi-face-apply-action [3 nil font-lock-type-face 9 nil
font-lock-type-face])
- (wisi-motion-action [1 6 [7 PRIVATE] 10])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken nil [nil ada-indent] nil nil
- ada-indent-broken ada-indent-broken]))%
- %((wisi-match-names 3 9))%
-
- | TASK TYPE IDENTIFIER discriminant_part_opt aspect_specification_opt
SEMICOLON
- %((wisi-statement-action [1 statement-start 6 statement-end])
- (wisi-name-action 3)
- (wisi-face-apply-action [3 nil font-lock-type-face])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken
- ada-indent-broken]))%
- ;
-
-term
- : term multiplying_operator factor
- | factor
- ;
-
-term_list
- : term_list binary_adding_operator term
- | term
- ;
-
-tick
- : TICK_1
- | TICK_2
- ;
-
-timed_entry_call
- : SELECT entry_call_alternative OR delay_alternative END SELECT SEMICOLON
- %((wisi-statement-action [1 statement-start 3 motion 6 statement-end])
- (wisi-motion-action [1 3 6])
- (wisi-indent-action [nil [ada-indent ada-indent] nil [ada-indent
ada-indent] nil ada-indent-broken
- ada-indent-broken]))%
- ;
-
-triggering_alternative
- : procedure_call_statement sequence_of_statements_opt
- | name sequence_of_statements_opt ;; entry_call_statement
- | delay_statement sequence_of_statements_opt
- ;
-
-type_declaration
- : full_type_declaration
- | incomplete_type_declaration
- | private_type_declaration
- | private_extension_declaration
- ;
-
-type_definition
- : enumeration_type_definition
- | RANGE simple_expression DOT_DOT simple_expression ;;
integer_type_definition
- | MOD expression_opt
- | DIGITS expression_opt real_range_specification_opt ;;
real_type_definition, floating_point_type_definition
- | DELTA expression_opt DIGITS expression_opt real_range_specification_opt ;;
decimal_fixed_point_definition
- | DELTA expression_opt real_range_specification_opt ;;
ordinary_fixed_point_definition
- | array_type_definition
- | abstract_tagged_limited_opt record_definition ;;record_type_definition
- | access_definition ;; access_type_definition
- | derived_type_definition
- | interface_type_definition
- ;
-
-variant_part
- : CASE direct_name_opt IS variant_list END CASE SEMICOLON
- %((wisi-statement-action [1 statement-start 7 statement-end])
- (wisi-motion-action [1 4 7])
- (wisi-indent-action [nil ada-indent-broken nil ada-indent-when nil
ada-indent-broken ada-indent-broken]))%
- ;
-
-variant_list
- : variant_list variant
- %((wisi-motion-action [1 2]))%
- | variant
- ;
-
-variant
- : WHEN discrete_choice_list EQUAL_GREATER component_list_opt
- %((wisi-statement-action [1 motion])
- ;; ada-indent-when applied in variant_part
- (wisi-indent-action [nil (wisi-hanging nil ada-indent-broken) ada-indent
[ada-indent ada-indent]]))%
- ;
-
-unary_adding_operator : PLUS | MINUS ; ;; + | -
-
-use_clause
- : USE ALL TYPE name_list SEMICOLON
- %((wisi-statement-action [1 statement-start 5 statement-end])
- (wisi-face-apply-list-action [4 font-lock-function-name-face
font-lock-type-face])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-use ada-indent-broken]))%
- | USE TYPE name_list SEMICOLON
- %((wisi-statement-action [1 statement-start 4 statement-end])
- (wisi-face-apply-list-action [3 font-lock-function-name-face
font-lock-type-face])
- (wisi-indent-action [nil ada-indent-broken ada-indent-use
ada-indent-broken]))%
- | USE name_list SEMICOLON
- %((wisi-statement-action [1 statement-start 3 statement-end])
- (wisi-face-apply-list-action [2 font-lock-function-name-face
font-lock-function-name-face])
- (wisi-indent-action [nil ada-indent-use ada-indent-broken]))%
- ;
-
-with_clause
- : LIMITED PRIVATE WITH name_list SEMICOLON
- %((wisi-statement-action [1 statement-start 5 statement-end])
- (wisi-face-apply-list-action [4 font-lock-function-name-face
font-lock-function-name-face])
- (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-with ada-indent-broken]))%
- | LIMITED WITH name_list SEMICOLON
- %((wisi-statement-action [1 statement-start 4 statement-end])
- (wisi-face-apply-list-action [3 font-lock-function-name-face
font-lock-function-name-face])
- (wisi-indent-action [nil ada-indent-broken ada-indent-with
ada-indent-broken]))%
- | PRIVATE WITH name_list SEMICOLON
- %((wisi-statement-action [1 statement-start 4 statement-end])
- (wisi-face-apply-list-action [3 font-lock-function-name-face
font-lock-function-name-face])
- (wisi-indent-action [nil ada-indent-broken ada-indent-with
ada-indent-broken]))%
- | WITH name_list SEMICOLON
- %((wisi-statement-action [1 statement-start 3 statement-end])
- (wisi-face-apply-list-action [2 font-lock-function-name-face
font-lock-function-name-face])
- (wisi-indent-action [nil ada-indent-with ada-indent-broken]))%
- ;
-
-;;; end of file
diff --git a/ada-process.el b/ada_annex_p-process.el
similarity index 62%
rename from ada-process.el
rename to ada_annex_p-process.el
index 8de15cddc0..8289bc9750 100644
--- a/ada-process.el
+++ b/ada_annex_p-process.el
@@ -1,7 +1,7 @@
-;;; ada-process.el --- Generated parser support file -*- lexical-binding:t -*-
-;; command line: wisitoken-bnf-generate.exe --generate LR1 Ada_Emacs re2c
PROCESS text_rep ada.wy
+;;; ada_annex_p-process.el --- Generated parser support file -*-
buffer-read-only:t lexical-binding:t -*-
+;; command line: wisitoken-bnf-generate.exe --generate LR1 Ada_Emacs re2c
PROCESS text_rep ada_annex_p.wy
-;; Copyright (C) 2013 - 2020 Free Software Foundation, Inc.
+;; Copyright (C) 2013 - 2022 Free Software Foundation, Inc.
;; This program is free software; you can redistribute it and/or
;; modify it under the terms of the GNU General Public License as
@@ -18,83 +18,92 @@
(require 'wisi-process-parse)
-(defconst ada-process-token-table
+(defconst ada_annex_p-process-token-table
[WHITESPACE
NEW_LINE
COMMENT
- ABS
- ACCEPT
- ABORT
- ABSTRACT
- ACCESS
- ALIASED
- ALL
- AND
- ARRAY
+ GNAT_PREP_IF
+ GNAT_PREP_ELSIF
+ GNAT_PREP_ELSE
+ GNAT_PREP_END_IF
+ CONFLICT_MARK_A
+ CONFLICT_MARK_B
+ CONFLICT_MARK_END
+ PLACEHOLDER
AT
- BEGIN
- BODY
- CASE
- CONSTANT
- DECLARE
+ RAISE
+ SEPARATE
+ TERMINATE
+ SELECT
+ UNTIL
DELAY
- DELTA
- DIGITS
- DO
- ELSE
- ELSIF
- END
+ ABORT
+ REQUEUE
+ ACCEPT
ENTRY
- EXCEPTION
- EXIT
- FOR
- FUNCTION
GENERIC
+ EXCEPTION
+ RENAMES
+ OVERRIDING
+ BODY
+ PRIVATE
+ PACKAGE
+ OUT
+ RETURN
GOTO
+ EXIT
+ DO
+ REVERSE
+ WHILE
+ LOOP
+ PARALLEL
+ BEGIN
+ DECLARE
+ SOME
+ ELSE
IF
+ THEN
+ ELSIF
+ REM
+ ABS
IN
- INTERFACE
- IS
- LIMITED
- LOOP
- MOD
- NEW
- NOT
- NULL
- OF
+ XOR
OR
- OTHERS
- OUT
- OVERRIDING
- PACKAGE
- PRAGMA
- PRIVATE
+ USE
+ FOR
+ NOT
+ FUNCTION
PROCEDURE
+ ALL
+ ACCESS
+ INTERFACE
+ SYNCHRONIZED
PROTECTED
- RAISE
- RANGE
+ TASK
+ WITH
+ OTHERS
+ WHEN
+ CASE
+ NULL
+ END
RECORD
- REM
- RENAMES
- REQUEUE
- RETURN
- REVERSE
- SEPARATE
- SELECT
- SOME
- SUBTYPE
- SYNCHRONIZED
TAGGED
- TASK
- TERMINATE
- THEN
+ OF
+ ARRAY
+ DELTA
+ DIGITS
+ MOD
+ RANGE
+ AND
+ NEW
+ LIMITED
+ ABSTRACT
+ CONSTANT
+ ALIASED
+ SUBTYPE
+ IS
TYPE
- UNTIL
- USE
- WHEN
- WHILE
- WITH
- XOR
+ PRAGMA
LEFT_PAREN
LEFT_SQUARE_BRACKET
RIGHT_PAREN
@@ -131,233 +140,356 @@
CHARACTER_LITERAL
Wisi_EOI
wisitoken_accept
- abstract_limited_synchronized_opt
- abstract_limited_opt
- abstract_tagged_limited_opt
+ tick
+ conditional_quantified_expression
+ pragma_argument_association_list
+ pragma_g
+ pragma_argument_association
+ basic_declaration
+ type_declaration
+ full_type_declaration
+ type_definition
+ subtype_declaration
+ subtype_indication
+ constraint
+ scalar_constraint
+ assign_value
+ object_declaration
+ defining_identifier_list
+ number_declaration
+ derived_type_definition
+ range_constraint
+ range_g
+ enumeration_literal_list
+ enumeration_type_definition
+ enumeration_literal_specification
+ integer_type_definition
+ signed_integer_type_definition
+ modular_type_definition
+ real_type_definition
+ floating_point_definition
+ real_range_specification
+ fixed_point_definition
+ ordinary_fixed_point_definition
+ decimal_fixed_point_definition
+ digits_constraint
+ array_type_definition
+ index_subtype_definition_list
+ unconstrained_array_definition
+ index_subtype_definition
+ discrete_subtype_definition_list
+ constrained_array_definition
+ discrete_subtype_definition
+ component_definition
+ index_constraint
+ discrete_range
+ discriminant_part
+ unknown_discriminant_part
+ discriminant_specification_list
+ known_discriminant_part
+ discriminant_specification
+ record_type_definition
+ record_definition
+ component_list
+ component_item
+ component_declaration
+ variant_list
+ variant_part
+ variant
+ discrete_choice_list
+ discrete_choice
+ record_extension_part
abstract_subprogram_declaration
- accept_statement
+ interface_type_definition
+ interface_list
+ access_type_definition
+ access_to_object_definition
+ general_access_modifier
+ access_to_subprogram_definition
+ null_exclusion
access_definition
- actual_parameter_part
- actual_parameter_part_opt
- aggregate
- aliased_opt
- and_interface_list_opt
- array_type_definition
- aspect_clause
- aspect_specification_opt
- assignment_statement
- association_opt
- association_list
- asynchronous_select
- at_clause
+ incomplete_type_declaration
+ declarative_item
+ declarative_item_pragma
+ declarative_part
+ basic_declarative_item
+ proper_body
+ name
+ direct_name
+ explicit_dereference
+ slice
+ selected_component
+ selector_name
attribute_reference
attribute_designator
+ range_attribute_reference
+ range_attribute_designator
+ aggregate
+ record_aggregate
+ record_component_association_list
+ record_component_association
+ component_choice_list
+ extension_aggregate
+ array_aggregate
+ expression_list
+ positional_array_aggregate
+ null_array_aggregate
+ named_array_aggregate
+ array_component_association_list
+ array_component_association
+ delta_aggregate
+ record_delta_aggregate
+ array_delta_aggregate
+ iterated_element_association
+ AND_relation_list
+ AND_THEN_relation_list
+ OR_relation_list
+ OR_ELSE_relation_list
+ XOR_relation_list
+ expression
+ relation
+ membership_choice_list
+ membership_choice
+ simple_expression
+ term
+ factor
+ primary
+ relational_operator
binary_adding_operator
- block_label
- block_label_opt
- block_statement
- body_g
- body_stub
+ unary_adding_operator
+ multiplying_operator
+ conditional_expression
+ elsif_expression_item
+ elsif_expression_list
+ if_expression
+ condition
+ case_expression_alternative_list
case_expression
case_expression_alternative
- case_expression_alternative_list
- case_statement
- case_statement_alternative
- case_statement_alternative_list
- compilation_unit
- compilation
- component_clause
- component_clause_list
- component_declaration
- component_definition
- component_item
- component_list
- component_list_opt
+ quantified_expression
+ quantifier
+ declare_expression
+ declare_item
+ reduction_attribute_reference
+ value_sequence
+ reduction_attribute_designator
+ reduction_specification
+ qualified_expression
+ allocator
+ subtype_indication_paren_constraint
+ subpool_specification
+ sequence_of_statements
+ sequence_of_statements_opt
+ statement
+ simple_statement
compound_statement
- conditional_entry_call
- conditional_quantified_expression
- constant_opt
- constraint
- constraint_opt
- declaration
- declarations
- declarative_part_opt
- delay_alternative
- delay_statement
- derived_type_definition
- direct_name
- direct_name_opt
- discrete_choice
- discrete_choice_list
- discrete_subtype_definition
- discrete_subtype_definition_list
- discriminant_part_opt
- discriminant_specification_opt
- discriminant_specification_list
- elsif_expression_item
- elsif_expression_list
+ null_statement
+ label
+ statement_identifier
+ assignment_statement
+ target_name
elsif_statement_item
elsif_statement_list
- entry_body
- entry_body_formal_part
- entry_call_alternative
- entry_declaration
- enumeration_literal
- enumeration_literal_list
- enumeration_representation_clause
- enumeration_type_definition
- exception_choice
- exception_choice_list
- exception_declaration
- exception_handler
- exception_handler_list
- exception_handler_list_opt
+ if_statement
+ case_statement_alternative_list
+ case_statement
+ case_statement_alternative
+ loop_statement
+ iteration_scheme
+ chunk_specification
+ loop_parameter_specification
+ iterator_filter
+ iterator_specification
+ loop_parameter_subtype_indication
+ procedural_iterator
+ iterator_parameter_specification
+ identifier_opt
+ label_opt
+ block_statement
+ statement_AND_list
+ parallel_block_statement
exit_statement
- expression
- expression_opt
- expression_function_declaration
+ goto_statement
+ subprogram_declaration
+ subprogram_specification
+ procedure_specification
+ function_specification
+ parameter_profile
+ result_profile
+ parameter_and_result_profile
+ parameter_specification_list
+ formal_part
+ parameter_specification
+ mode
+ global_aspect_definition
+ global_aspect_element
+ global_mode
+ basic_global_mode
+ global_set
+ global_designator
+ name_opt
+ subprogram_body
+ procedure_call_statement
+ function_call
+ parameter_association_list
+ actual_parameter_part
+ assoc_expression
+ parameter_association
+ simple_return_statement
extended_return_object_declaration
- extended_return_object_declaration_opt
extended_return_statement
- factor
- formal_object_declaration
- formal_part
- formal_subprogram_declaration
- formal_type_declaration
- formal_type_definition
- formal_derived_type_definition
- formal_package_declaration
- formal_package_actual_part
- full_type_declaration
- function_specification
- general_access_modifier_opt
- generic_declaration
- generic_formal_part
- generic_formal_parameter_declarations
- generic_formal_parameter_declaration
- generic_instantiation
- generic_package_declaration
- generic_renaming_declaration
- generic_subprogram_declaration
- goto_label
- handled_sequence_of_statements
- identifier_list
- identifier_opt
- if_expression
- if_statement
- incomplete_type_declaration
- index_constraint
- index_subtype_definition
- index_subtype_definition_list
- interface_list
- interface_type_definition
- iteration_scheme
- iterator_specification
- iterator_specification_opt
- loop_statement
- membership_choice_list
- membership_choice
- mod_clause_opt
- mode_opt
- multiplying_operator
- name_list
- name
- name_opt
- null_exclusion_opt
- null_exclusion_opt_name_type
+ return_subtype_indication
null_procedure_declaration
- object_declaration
- object_renaming_declaration
- overriding_indicator_opt
- package_body
- package_body_stub
+ expression_function_declaration
package_declaration
- package_renaming_declaration
+ basic_declarative_item_pragma
+ basic_declarative_item_list
package_specification
- parameter_and_result_profile
- parameter_profile_opt
- parameter_specification
- parameter_specification_list
- paren_expression
- pragma_g
- primary
- private_extension_declaration
+ package_body
private_type_declaration
- procedure_call_statement
- procedure_specification
- proper_body
- protected_body
- protected_body_stub
+ private_extension_declaration
+ overriding_indicator
+ use_clause
+ name_list
+ use_package_clause
+ use_type_clause
+ renaming_declaration
+ object_renaming_declaration
+ exception_renaming_declaration
+ package_renaming_declaration
+ subprogram_renaming_declaration
+ generic_renaming_declaration
+ task_type_declaration
+ single_task_declaration
+ task_item_list
+ task_definition
+ task_item
+ task_body
+ protected_type_declaration
+ single_protected_declaration
+ protected_operation_declaration_list
+ protected_element_declaration_list
protected_definition
- protected_operation_item
+ protected_operation_declaration
+ protected_element_declaration
protected_operation_item_list
- protected_operation_item_list_opt
- protected_opt
- protected_type_declaration
- qualified_expression
- quantified_expression
- quantifier
- raise_expression
- raise_statement
- range_g
- range_list
- real_range_specification_opt
- record_definition
- record_representation_clause
- relation_and_list
- relation_and_then_list
- relation_or_list
- relation_or_else_list
- relation_xor_list
- relation
- relational_operator
- renaming_declaration
+ protected_body
+ protected_operation_item
+ entry_declaration
+ accept_statement
+ entry_index
+ entry_body
+ entry_body_formal_part
+ entry_barrier
+ entry_index_specification
requeue_statement
- result_profile
- return_subtype_indication
- selected_component
+ delay_statement
+ delay_until_statement
+ delay_relative_statement
+ select_statement
+ guard_select
+ select_alternative_list
selective_accept
+ guard
select_alternative
- select_alternative_list
- select_alternative_list_opt
- select_statement
- sequence_of_statements
- sequence_of_statements_opt
- simple_expression
- simple_return_statement
- simple_statement
- single_protected_declaration
- single_task_declaration
- statement
- subprogram_body
- subprogram_body_stub
- subprogram_declaration
- subprogram_default
- subprogram_renaming_declaration
- subprogram_specification
- subtype_declaration
- subtype_indication
- subunit
- task_body
- task_body_stub
- task_definition
- task_type_declaration
- term
- term_list
- tick
+ accept_alternative
+ delay_alternative
+ terminate_alternative
timed_entry_call
+ entry_call_alternative
+ conditional_entry_call
+ asynchronous_select
triggering_alternative
- type_declaration
- type_definition
- variant_part
- variant_list
- variant
- unary_adding_operator
- use_clause
+ abortable_part
+ abort_statement
+ compilation
+ compilation_unit
with_clause
+ limited_with_clause
+ nonlimited_with_clause
+ body_stub
+ subprogram_body_stub
+ package_body_stub
+ task_body_stub
+ protected_body_stub
+ subunit
+ exception_declaration
+ exception_handler_list
+ handled_sequence_of_statements
+ exception_choice_list
+ exception_handler
+ choice_parameter_specification
+ exception_choice
+ raise_statement
+ raise_expression
+ generic_declaration
+ generic_subprogram_declaration
+ generic_package_declaration
+ generic_formal_part
+ generic_formal_parameter_declaration
+ generic_instantiation
+ formal_object_declaration
+ formal_type_declaration
+ formal_complete_type_declaration
+ formal_incomplete_type_declaration
+ formal_type_definition
+ formal_private_type_definition
+ formal_derived_type_definition
+ formal_discrete_type_definition
+ formal_signed_integer_type_definition
+ formal_modular_type_definition
+ formal_floating_point_definition
+ formal_ordinary_fixed_point_definition
+ formal_decimal_fixed_point_definition
+ formal_array_type_definition
+ formal_access_type_definition
+ formal_interface_type_definition
+ formal_subprogram_declaration
+ formal_concrete_subprogram_declaration
+ formal_abstract_subprogram_declaration
+ subprogram_default
+ default_name
+ formal_package_declaration
+ aspect_clause
+ aspect_association
+ aspect_mark_list
+ aspect_specification
+ aspect_mark
+ aspect_definition
+ attribute_definition_clause
+ enumeration_representation_clause
+ enumeration_aggregate
+ record_representation_clause
+ component_clause
+ position
+ first_bit
+ last_bit
+ extended_global_aspect_definition
+ extended_global_aspect_element
+ extended_global_mode
+ formal_parameter_designator
+ formal_parameter_set
+ formal_group_designator
+ dispatching_operation_set
+ dispatching_operation_specifier
+ delta_constraint
+ at_clause
+ mod_clause
+ discrete_range_COMMA_list
+ component_item_component_item_list
+ declarative_item_pragma_list
+ record_component_association_COMMA_list
+ declare_item_list
+ statement_statement_list
+ label_list
+ global_aspect_element_COMMA_list
+ generic_formal_parameter_declaration_list
+ term_binary_adding_operator_list
+ component_clause_list
+ Wisi_SOI
])
-(defconst ada-process-face-table
+(defconst ada_annex_p-process-face-table
[
font-lock-constant-face
font-lock-function-name-face
@@ -365,81 +497,82 @@
nil
])
-(defconst ada-process-repair-image
+(defconst ada_annex_p-process-repair-image
'(
- (ABS . "abs")
- (ACCEPT . "accept")
- (ABORT . "abort")
- (ABSTRACT . "abstract")
- (ACCESS . "access")
- (ALIASED . "aliased")
- (ALL . "all")
- (AND . "and")
- (ARRAY . "array")
(AT . "at")
- (BEGIN . "begin")
- (BODY . "body")
- (CASE . "case")
- (CONSTANT . "constant")
- (DECLARE . "declare")
+ (RAISE . "raise")
+ (SEPARATE . "separate")
+ (TERMINATE . "terminate")
+ (SELECT . "select")
+ (UNTIL . "until")
(DELAY . "delay")
- (DELTA . "delta")
- (DIGITS . "digits")
- (DO . "do")
- (ELSE . "else")
- (ELSIF . "elsif")
- (END . "end")
+ (ABORT . "abort")
+ (REQUEUE . "requeue")
+ (ACCEPT . "accept")
(ENTRY . "entry")
- (EXCEPTION . "exception")
- (EXIT . "exit")
- (FOR . "for")
- (FUNCTION . "function")
(GENERIC . "generic")
+ (EXCEPTION . "exception")
+ (RENAMES . "renames")
+ (OVERRIDING . "overriding")
+ (BODY . "body")
+ (PRIVATE . "private")
+ (PACKAGE . "package")
+ (OUT . "out")
+ (RETURN . "return")
(GOTO . "goto")
+ (EXIT . "exit")
+ (DO . "do")
+ (REVERSE . "reverse")
+ (WHILE . "while")
+ (LOOP . "loop")
+ (PARALLEL . "parallel")
+ (BEGIN . "begin")
+ (DECLARE . "declare")
+ (SOME . "some")
+ (ELSE . "else")
(IF . "if")
+ (THEN . "then")
+ (ELSIF . "elsif")
+ (REM . "rem")
+ (ABS . "abs")
(IN . "in")
- (INTERFACE . "interface")
- (IS . "is")
- (LIMITED . "limited")
- (LOOP . "loop")
- (MOD . "mod")
- (NEW . "new")
- (NOT . "not")
- (NULL . "null")
- (OF . "of")
+ (XOR . "xor")
(OR . "or")
- (OTHERS . "others")
- (OUT . "out")
- (OVERRIDING . "overriding")
- (PACKAGE . "package")
- (PRAGMA . "pragma")
- (PRIVATE . "private")
+ (USE . "use")
+ (FOR . "for")
+ (NOT . "not")
+ (FUNCTION . "function")
(PROCEDURE . "procedure")
+ (ALL . "all")
+ (ACCESS . "access")
+ (INTERFACE . "interface")
+ (SYNCHRONIZED . "synchronized")
(PROTECTED . "protected")
- (RAISE . "raise")
- (RANGE . "range")
+ (TASK . "task")
+ (WITH . "with")
+ (OTHERS . "others")
+ (WHEN . "when")
+ (CASE . "case")
+ (NULL . "null")
+ (END . "end")
(RECORD . "record")
- (REM . "rem")
- (RENAMES . "renames")
- (REQUEUE . "requeue")
- (RETURN . "return")
- (REVERSE . "reverse")
- (SEPARATE . "separate")
- (SELECT . "select")
- (SOME . "some")
- (SUBTYPE . "subtype")
- (SYNCHRONIZED . "synchronized")
(TAGGED . "tagged")
- (TASK . "task")
- (TERMINATE . "terminate")
- (THEN . "then")
+ (OF . "of")
+ (ARRAY . "array")
+ (DELTA . "delta")
+ (DIGITS . "digits")
+ (MOD . "mod")
+ (RANGE . "range")
+ (AND . "and")
+ (NEW . "new")
+ (LIMITED . "limited")
+ (ABSTRACT . "abstract")
+ (CONSTANT . "constant")
+ (ALIASED . "aliased")
+ (SUBTYPE . "subtype")
+ (IS . "is")
(TYPE . "type")
- (UNTIL . "until")
- (USE . "use")
- (WHEN . "when")
- (WHILE . "while")
- (WITH . "with")
- (XOR . "xor")
+ (PRAGMA . "pragma")
(LEFT_PAREN . "(")
(LEFT_SQUARE_BRACKET . "[")
(RIGHT_PAREN . ")")
@@ -476,4 +609,4 @@
(CHARACTER_LITERAL . "' '")
))
-(provide 'ada-process)
+(provide 'ada_annex_p-process)
diff --git a/ada_annex_p.wy b/ada_annex_p.wy
new file mode 100644
index 0000000000..f260e37b2d
--- /dev/null
+++ b/ada_annex_p.wy
@@ -0,0 +1,2761 @@
+;;; WisiToken grammar for Ada
+;;
+;; Author: Stephen Leake <stephe-leake@stephe-leake.org>
+;; Maintainer: Stephen Leake <stephe-leake@stephe-leake.org>
+;; Created: Sept 2012
+;; Keywords: syntax
+;;
+;; Copied from Ada Language Reference Manual Annex P
+;; (http://www.ada-auth.org/standards/ada2x.html), minimal changes
+;; made to conform with WisiToken requirements.
+
+;; Changes from Annex P:
+;;
+;; for WisiToken:
+;;
+;; - add single quotes around literal tokens, operators and reserved words,
digits.
+;;
+;; - delete italics part of token names
+;;
+;; - eliminate many redundancies which cause parse conflicts
+;;
+;; - replace low level lexical productions with regular expression tokens.
+;;
+;; - use nonterminal "tick" for '''.
+
+;; The programs 'annex_p_to_wy.adb' translates the text of ARM Annex P
+;; to a WisiToken .wy file, and 'compare_annex_p.adb' compares that
+;; with this file. Nonterminals that are changed in this file from ARM
+;; Annex P have comments explaining how. Some comments are recognized
+;; by 'compare_annex_p.adb' to help with the comparison; see the code
+;; for more detail.
+;;
+;; See ada_license.text for ARM Annex P copyright/license.
+;;
+;; re2c lexer syntax: http://re2c.org/
+
+%meta_syntax EBNF
+
+%code copyright_license %{
+;; Copyright (C) 2013 - 2022 Free Software Foundation, Inc.
+
+;; This program is free software; you can redistribute it and/or
+;; modify it under the terms of the GNU General Public License as
+;; published by the Free Software Foundation; either version 3, or (at
+;; your option) any later version.
+;;
+;; This software is distributed in the hope that it will be useful,
+;; but WITHOUT ANY WARRANTY; without even the implied warranty of
+;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+;; General Public License for more details.
+;;
+;; You should have received a copy of the GNU General Public License
+;; along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>.
+}%
+
+%code actions spec post
+%{
+ Partial_Parse_Active : aliased Boolean := False;
+ Partial_Parse_Byte_Goal : aliased WisiToken.Buffer_Pos :=
WisiToken.Buffer_Pos'Last;
+}%
+
+%generate LALR Ada_Emacs re2c Process
+%generate LR1 Ada_Emacs text_rep re2c Process
+
+%lr1_hash_table_size 124_087
+
+%language_runtime "Wisi.Ada"
+
+;; wisitoken-parse-lr-mckenzie_recover.adb requires 16.
+%max_parallel 20
+
+%case_insensitive
+%start compilation
+
+%token <left-paren> LEFT_PAREN "("
+%token <right-paren> RIGHT_PAREN ")"
+%token <left-paren> LEFT_SQUARE_BRACKET "["
+%token <right-paren> RIGHT_SQUARE_BRACKET "]"
+
+%token <punctuation> AMPERSAND "&"
+%token <punctuation> AT_SIGN "@"
+%token <punctuation> BAR "|"
+%token <punctuation> BOX "<>"
+%token <punctuation> COLON ":"
+%token <punctuation> COLON_EQUAL ":="
+%token <punctuation> COMMA ","
+%token <punctuation> DOT "."
+%token <punctuation> DOT_DOT ".."
+%token <punctuation> EQUAL "="
+%token <punctuation> EQUAL_GREATER "=>"
+%token <punctuation> GREATER ">"
+%token <punctuation> GREATER_EQUAL ">="
+%token <punctuation> GREATER_GREATER ">>"
+%token <punctuation> LESS "<"
+%token <punctuation> LESS_EQUAL "<="
+%token <punctuation> LESS_LESS "<<"
+%token <punctuation> MINUS "-"
+%token <punctuation> PLUS "+"
+%token <punctuation> SEMICOLON ";"
+%token <punctuation> SLASH "/"
+%token <punctuation> SLASH_EQUAL "/="
+%token <punctuation> STAR "*"
+%token <punctuation> STAR_STAR "**"
+
+;; Support GNAT character coding in names and character and string
+;; literals (see test/non_ascii.ads)
+%lexer_regexp GNAT_Char_Coding %[ ("[\""[0-9A-Fa-f]+"\"]") ]%
+
+;; re2c lookahead regular expression; this is not a character literal.
+;; re2c does not allow combining | with /, so we need three tokens for
+;; this (sigh). See wisitoken test character_literal.wy for rationale
+;; behind this design.
+%token <punctuation> TICK_1 "'"
+
+%token <regexp> TICK_2
+ %[ "'" / "('"([\x20-\U0010FFFF]|GNAT_Char_Coding)"'" ]%
+ "'"
+tick : TICK_1 | TICK_2 ;
+
+;; Handle 0.0, (1..Length) and 0..16#10FFFF#
+%token <regexp> NUMERIC_LITERAL
+ %[
([0-9])|([0-9_]+([.][0-9]+)?([eE[0-9_-]+)?)|([0-9]+"#"[0-9a-fA-F._-]+"#") ]%
+ "1234567890"
+
+;; Include ASCII control chars, except new-line and EOI, in whitespace, just
+;; in case they show up in some file (see wisi test_edit_source.adb)
+%non_grammar <non-reporting> WHITESPACE %[ [
\x00\x01\x02\x03\x05\x06\x07\x08\t\x0B\x0C\x0D\x0E\x0F\xFF]+ ]%
+
+%non_grammar <new-line> NEW_LINE
+
+;; Ada comments
+%non_grammar <comment-new-line> COMMENT "--"
+
+;; gnatprep preprocessor lines
+%non_grammar <comment-new-line> GNAT_PREP_IF "#if"
+%non_grammar <comment-new-line> GNAT_PREP_ELSIF "#elsif"
+%non_grammar <comment-new-line> GNAT_PREP_ELSE "#else"
+%non_grammar <comment-new-line> GNAT_PREP_END_IF "#end if"
+
+;; skeleton placeholders. Also terminated by newline, EOI to avoid
+;; accidently commenting out multiple lines.
+%non_grammar <comment-one-line> PLACEHOLDER "{" "}"
+
+;; git conflict marks. ada_mode-recover_conflict_marks.adb
+%non_grammar <comment-new-line> CONFLICT_MARK_A "<<<<<<<"
+%non_grammar <comment-new-line> CONFLICT_MARK_B ">>>>>>>"
+%non_grammar <comment-new-line> CONFLICT_MARK_END "======="
+
+;; '$' for gnatprep symbols.
+%token <symbol> IDENTIFIER
+ %[
([$a-zA-Z\x80-\U0010FFFF]|GNAT_Char_Coding)([0-9a-zA-Z_\x80-\U0010FFFF]|GNAT_Char_Coding)*
]%
+ "A_Bogus_Identifier"
+
+;; \x22 is "
+%token <string-double-one-line> STRING_LITERAL
+ %[ (["]([\x20-\x21\x23-\U0010FFFF]|GNAT_Char_Coding)*["])+ ]% '""'
+%escape_delimiter_doubled STRING_LITERAL
+
+%token <string-single-one-line> CHARACTER_LITERAL %[
"'"([\x20-\U0010FFFF]|GNAT_Char_Coding)"'" ]% "' '"
+
+%elisp_face font-lock-constant-face
+%elisp_face font-lock-function-name-face
+%elisp_face font-lock-type-face
+%elisp_face nil
+
+;; function name Ada function arg_count token_index args
+%elisp_indent ada-indent-aggregate Ada_Indent_Aggregate 0
+%elisp_indent ada-indent-aspect Ada_Indent_Aspect 0
+%elisp_indent ada-indent-renames Ada_Indent_Renames_0 1 1
+%elisp_indent ada-indent-return Ada_Indent_Return_0 2 1
+%elisp_indent ada-indent-record Ada_Indent_Record_0 3 1 2
+%elisp_indent "ada-indent-record*" Ada_Indent_Record_1 3 2
+
+;; Set McKenzie error recovery costs.
+;;
+;; We assume the user is typing new code more often than deleting or
+;; changing old. Minimal_Complete reduces cost for insert, so the
+;; default cost is higher for insert than delete. Often insert requires
+;; push_back first, to get the parser in the right state, so push_back
+;; is cheaper.
+;;
+;; We need a balance between Minimal_Complete and other solutions; if
+;; Minimal_Complete is too cheap, it will complete the entire
+;; compilation_Unit before the error point, when doing something else
+;; at some point is better (see test/ada_mode-recover_29.adb, _15,
+;; _16, _24). On the other hand, doing lots of Minimal_Complete is
+;; very common when writing new code (see
+;; test/ada_mode-recover_10.adb, _error_during_resume_01).
+;; test/ada_mode-recover_16.adb requires default delete cost 3.
+;;
+;; test/ada_mode-recover_change_name.adb needs 'ignore check fail' cost 2
+;;
+;; Default cost for insert, delete, push_back/undo_reduce, ignore check fail.
+%mckenzie_cost_default 4 3 2 2
+%mckenzie_minimal_complete_cost_delta -3
+
+;; END is cheaper, because needing to insert it is a common case.
+%mckenzie_cost_insert END 3
+
+;; make inserting an expression or statement to finish a production
+;; cheap; see test/ada_mode-recover_41.adb
+%mckenzie_cost_insert IDENTIFIER 2
+
+;; Ada 2020 syntax caused a drastic increase in recursion, which
+;; increased the number of parse states with no Minimal_Complete
+;; action. So we reduce the cost of ';' and '=>' to compensate; see
+;; test/ada_mode-recover_partial_26.
+%mckenzie_cost_insert SEMICOLON 3
+%mckenzie_cost_insert EQUAL_GREATER 3
+
+;; Make RENAMES more expensive, since object declarations are more
+;; common than renames; ada_mode-recover_13.adb
+%mckenzie_cost_insert RENAMES 7
+
+;; This cost is applied once, independent of token count.
+;; test/ada_mode-recover_40.adb requires cost < 3, so insert 'if
+;; identifier then' is as cheap as 'delete else'.
+%mckenzie_cost_matching_begin 1
+
+;; Prefer doing more work at the current error point over moving
+;; forward to a new one; there is normally only one real error point.
+;; But not too much; test/ada_mode-recover_partial_02_lr1.adb requires
+;; cost 2.
+%mckenzie_cost_fast_forward 2
+
+;; Handle converting 'if' to 'case' (and vice-versa), since that is a
+;; common operation. See test/ada_mode-recover_29.adb. This also makes
+;; inserting 'end if;' free; that's used a lot. But this defeats
+;; Forbid_Minimal_Complete; see
+;; test/ada_mode-recover_constant_as_statement_1.adb.
+%mckenzie_cost_insert CASE 2
+%mckenzie_cost_insert IF 2
+
+;; Prefer undo_reduce over push_back; consider the code:
+;;
+;; loop
+;; if then
+;; statement;
+;; -- missing 'end if;'
+;; end loop;
+;; -- ^ error here
+;;
+;; Error recovery will insert 'end if;', after push_back or
+;; undo_reduce of the handled_sequence_of_statements including
+;; 'statement'. If it uses push_back, then 'end if;' is before
+;; 'statement'; if undo_reduce, after, which is the desired result.
+%mckenzie_cost_undo_reduce handled_sequence_of_statements 0
+%mckenzie_cost_undo_reduce sequence_of_statements 0
+%mckenzie_cost_undo_reduce sequence_of_statements 0
+%mckenzie_cost_undo_reduce declarative_part 0
+
+;; Missing or extra closing paren and comma are common; missing
+;; handled by Minimal_Complete.
+%mckenzie_cost_delete COMMA 1
+%mckenzie_cost_insert COMMA 3
+%mckenzie_cost_delete RIGHT_PAREN 1
+%mckenzie_cost_insert RIGHT_PAREN 3
+
+;; test/ada_mode-recover_partial_02_lr1.adb requires 45_000; wisitoken got 30%
faster
+%mckenzie_enqueue_limit 58_000
+
+;; 4 required for test/ada_mode-recover_match_names.adb.
+%mckenzie_check_limit 4
+
+;; After finding 1 solution, only check 100 more before giving up.
+;; Reduces solution time on complex errors.
+%mckenzie_check_delta_limit 100
+
+%end_names_optional_option End_Names_Optional
+
+;; This is the first step in a 3 branch conflict below.
+%conflict REDUCE defining_identifier_list | REDUCE direct_name on token COLON
+
+%conflict REDUCE defining_identifier_list | REDUCE direct_name on token COMMA
+%conflict REDUCE discrete_choice | REDUCE selector_name on token BAR
+%conflict REDUCE discrete_choice | REDUCE selector_name on token EQUAL_GREATER
+%conflict REDUCE name | REDUCE selector_name on token BAR
+%conflict REDUCE name | REDUCE selector_name on token EQUAL_GREATER
+%conflict REDUCE record_component_association | REDUCE expression_list on
token COMMA
+%conflict REDUCE record_component_association | REDUCE expression_list on
token RIGHT_PAREN
+%conflict REDUCE subtype_indication | REDUCE iterator_specification on token
EQUAL_GREATER
+%conflict REDUCE subtype_indication | REDUCE iterator_specification on token
LOOP
+%conflict REDUCE subtype_indication | REDUCE iterator_specification on token
USE
+%conflict REDUCE subtype_indication | REDUCE primary on token BAR
+%conflict REDUCE subtype_indication | REDUCE primary on token COMMA
+%conflict REDUCE subtype_indication | REDUCE primary on token EQUAL_GREATER
+%conflict REDUCE subtype_indication | REDUCE primary on token RIGHT_PAREN
+%conflict SHIFT at_clause | REDUCE name on token USE
+%conflict SHIFT attribute_definition_clause | REDUCE attribute_reference on
token USE
+%conflict SHIFT attribute_definition_clause | REDUCE label_opt on token FOR
+%conflict SHIFT dispatching_operation_set | REDUCE
extended_global_aspect_element on token COMMA
+%conflict SHIFT dispatching_operation_specifier | REDUCE subtype_indication |
REDUCE primary on token RIGHT_PAREN
+%conflict SHIFT expression_function_declaration | REDUCE
subprogram_specification on token IS
+%conflict SHIFT formal_derived_type_definition | REDUCE
formal_derived_type_definition on token WITH
+%conflict SHIFT full_type_declaration | REDUCE discriminant_part on token IS
+%conflict SHIFT generic_instantiation | REDUCE parameter_profile on token IS
+%conflict SHIFT generic_renaming_declaration | REDUCE generic_formal_part on
token FUNCTION
+%conflict SHIFT generic_renaming_declaration | REDUCE generic_formal_part on
token PACKAGE
+%conflict SHIFT generic_renaming_declaration | REDUCE generic_formal_part on
token PROCEDURE
+%conflict SHIFT global_set | REDUCE formal_parameter_set on token COMMA
+%conflict SHIFT global_set | REDUCE global_aspect_element on token COMMA
+%conflict SHIFT iterator_filter | REDUCE subtype_indication on token WHEN
+%conflict SHIFT membership_choice_list | REDUCE relation on token BAR
+%conflict SHIFT null_exclusion | REDUCE mode on token NOT
+%conflict SHIFT null_procedure_declaration | REDUCE subprogram_specification
on token IS
+%conflict SHIFT object_renaming_declaration | REDUCE defining_identifier_list
on token COLON
+%conflict SHIFT object_renaming_declaration | REDUCE defining_identifier_list
| REDUCE direct_name on token COLON
+%conflict SHIFT package_body_stub | REDUCE direct_name on token IS
+%conflict SHIFT parallel_block_statement | REDUCE label_opt on token PARALLEL
+%conflict SHIFT raise_expression | REDUCE raise_expression on token WITH
+%conflict SHIFT record_extension_part | REDUCE derived_type_definition on
token WITH
+%conflict SHIFT tick | REDUCE direct_name on token TICK_1
+%conflict SHIFT tick | REDUCE direct_name on token TICK_2
+%conflict SHIFT value_sequence | REDUCE array_component_association on token
RIGHT_SQUARE_BRACKET
+
+;;; grammar rules
+
+;;:new; for ARM 4.5.7(7), ARM 4.5.8(4) allow "(
conditional|quantified_expression )" instead of "(( ... ))"
+conditional_quantified_expression
+ : if_expression
+ | case_expression
+ | quantified_expression
+ ;
+
+pragma_argument_association_list ;;:new; split out from pragma_g for action
+ : pragma_argument_association
+ %((wisi-indent-action [(wisi-hanging nil ada-indent-broken)]))%
+ | pragma_argument_association_list ',' pragma_argument_association
+ %((wisi-indent-action [nil nil (wisi-hanging nil ada-indent-broken)]))%
+ ;
+
+pragma_g
+ : 'pragma' IDENTIFIER ['(' pragma_argument_association_list ')'] ';'
+ %((wisi-statement-action [1 statement-start 6 statement-end])
+ (wisi-face-apply-action [2 nil font-lock-function-name-face])
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken
(wisi-anchored 3 1) (wisi-anchored 3 0)
+ ada-indent-broken]))%
+ ;; ARM 4.5.7(7), ARM 4.5.8(4) allow "( conditional|quantified_expression )"
instead of "(( ... ))"
+ | 'pragma' IDENTIFIER ['(' conditional_quantified_expression ')'] ';'
+ %((wisi-statement-action [1 statement-start 6 statement-end])
+ (wisi-face-apply-action [2 nil font-lock-function-name-face])
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken
(wisi-anchored 3 1) (wisi-anchored 3 0)
+ ada-indent-broken]))%
+ ;
+
+pragma_argument_association
+ ;; [ IDENTIFIER '=>' ] name ;;:redundant with expression
+ ;; [IDENTIFIER '=>'] expression ;;:redundant with aspect_mark
+ ;; aspect_mark '=>' name ;;:redundant with expression
+ : [aspect_mark '=>'] expression
+ ;; indent applied in pragma_argument_association_list
+ ;
+
+basic_declaration
+ : type_declaration
+ | subtype_declaration
+ | object_declaration
+ | number_declaration
+ | subprogram_declaration
+ | abstract_subprogram_declaration
+ | null_procedure_declaration
+ | expression_function_declaration
+ | package_declaration
+ | renaming_declaration
+ | exception_declaration
+ | generic_declaration
+ | generic_instantiation
+ ;
+
+;; defining_identifier ;;:redundant with IDENTIFIER
+;; ::= IDENTIFIER
+
+type_declaration
+ : full_type_declaration
+ | incomplete_type_declaration
+ | private_type_declaration
+ | private_extension_declaration
+ ;
+
+full_type_declaration
+ : 'type' IDENTIFIER [known_discriminant_part] 'is' type_definition
[aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 7 statement-end])
+ (wisi-name-action 2)
+ (wisi-face-apply-action [2 nil font-lock-type-face])
+
+ ;; Indentation of comment after 'is' is
+ ;; ada-indent-record-rel-type if type_definition is a record.
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken
+ [ada-indent-broken (ada-indent-record* 'TYPE 5
ada-indent-broken)]
+ (wisi-hanging% ada-indent-broken (* 2
ada-indent-broken))
+ nil ada-indent-broken]))%
+ | task_type_declaration
+ | protected_type_declaration
+ ;
+
+type_definition
+ : enumeration_type_definition
+ | integer_type_definition
+ | real_type_definition
+ | array_type_definition
+ | record_type_definition
+ | access_type_definition
+ | derived_type_definition
+ | interface_type_definition
+ ;
+
+subtype_declaration
+ : 'subtype' IDENTIFIER 'is' subtype_indication [aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 6 statement-end])
+ (wisi-name-action 2)
+ (wisi-face-apply-action [2 nil font-lock-type-face])
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken
+ ;; test/adacore_9717_001.ads Another_Long_Name
+ (wisi-hanging* ada-indent-broken
ada-indent-broken)
+ nil
+ ada-indent-broken]))%
+ ;
+
+subtype_indication
+ : [null_exclusion] name [constraint] ;;:edited; subtype_mark inlined
+ ;
+
+;; subtype_mark ;;:inlined
+;; ::= name
+
+constraint
+ : scalar_constraint
+ | index_constraint
+ ;; discriminant_constraint deleted; redundant with subprogram_call in name
+ ;
+
+scalar_constraint ::= range_constraint | digits_constraint | delta_constraint ;
+
+;; composite_constraint ;;:deleted; no longer used
+;; : index_constraint
+;; | discriminant_constraint ;;:redundant with expanded actual_parameter_part
+;; ;
+
+assign_value ;;:new; split out from object_declaration assignment_statement,
and others for indent
+ : ':=' expression
+ ;
+
+object_declaration
+ : defining_identifier_list ':' ['aliased'] ['constant'] subtype_indication
[assign_value]
+ [aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 8 statement-end])
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken
+ (wisi-hanging* ada-indent-broken
ada-indent-broken)
+ (wisi-hanging% (wisi-anchored% 5
ada-indent-broken)
+ (wisi-anchored% 5 (* 2
ada-indent-broken)))
+ ada-indent-broken ada-indent-broken]))%
+ | defining_identifier_list ':' ['aliased'] ['constant'] access_definition
[assign_value]
+ [aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 8 statement-end])
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken
+ (wisi-hanging* ada-indent-broken
ada-indent-broken)
+ (wisi-hanging% (wisi-anchored% 5
ada-indent-broken)
+ (wisi-anchored% 5 (* 2
ada-indent-broken)))
+ ada-indent-broken ada-indent-broken]))%
+ | defining_identifier_list ':' ['aliased'] ['constant']
array_type_definition [assign_value]
+ [aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 8 statement-end])
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken
+ (wisi-hanging* ada-indent-broken
ada-indent-broken)
+ (wisi-hanging% (wisi-anchored% 5
ada-indent-broken)
+ (wisi-anchored% 5 (* 2
ada-indent-broken)))
+ ada-indent-broken ada-indent-broken]))%
+ | single_task_declaration
+ | single_protected_declaration
+ ;
+
+defining_identifier_list
+ : IDENTIFIER
+ %((wisi-name-action 1))%
+ | defining_identifier_list ',' IDENTIFIER
+ %((wisi-name-action 3)
+ (wisi-indent-action [nil nil ada-indent-broken]))%
+ ;
+
+number_declaration
+ : defining_identifier_list ':' 'constant' assign_value ';'
+ %((wisi-statement-action [1 statement-start 5 statement-end])
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken
+ (wisi-hanging% (wisi-anchored% 4
ada-indent-broken)
+ (wisi-anchored% 4 (* 2
ada-indent-broken)))
+ ada-indent-broken]))%
+ ;
+
+derived_type_definition
+ : ['abstract'] ['limited'] 'new' subtype_indication [['and' interface_list]
record_extension_part] ;
+
+range_constraint ::= 'range' range_g ;
+
+range_g : range_attribute_reference | simple_expression '..' simple_expression
;
+
+enumeration_literal_list ;;:new for action
+ : enumeration_literal_specification {',' enumeration_literal_specification} ;
+
+enumeration_type_definition
+ : '(' enumeration_literal_list ')'
+ %((wisi-indent-action [nil (wisi-anchored 1 1) (wisi-anchored 1 0)]))%
+ ;
+
+enumeration_literal_specification : IDENTIFIER | CHARACTER_LITERAL ;
+
+;; defining_character_literal ::= CHARACTER_LITERAL
+
+integer_type_definition
+ : signed_integer_type_definition
+ %((wisi-indent-action [(wisi-hanging nil ada-indent-broken)]))%
+ | modular_type_definition
+ %((wisi-indent-action [(wisi-hanging nil ada-indent-broken)]))%
+ ;
+
+signed_integer_type_definition ::= 'range' simple_expression '..'
simple_expression ;
+
+modular_type_definition ::= 'mod' expression ;
+
+real_type_definition ::= floating_point_definition | fixed_point_definition ;
+
+floating_point_definition ::= 'digits' expression [real_range_specification] ;
+
+real_range_specification : 'range' simple_expression '..' simple_expression ;
+
+fixed_point_definition : ordinary_fixed_point_definition |
decimal_fixed_point_definition ;
+
+ordinary_fixed_point_definition : 'delta' expression real_range_specification ;
+
+decimal_fixed_point_definition : 'delta' expression 'digits' expression
[real_range_specification] ;
+
+digits_constraint : 'digits' simple_expression [range_constraint] ;
+
+array_type_definition ::= unconstrained_array_definition |
constrained_array_definition ;
+
+index_subtype_definition_list : index_subtype_definition {','
index_subtype_definition} ;
+
+unconstrained_array_definition
+ : 'array' '(' index_subtype_definition_list ')' 'of' component_definition
+ %((wisi-indent-action [nil nil (wisi-anchored 2 1) (wisi-anchored 2 0) nil
nil]))%
+ ;
+
+index_subtype_definition : name 'range' '<>' ;
+
+discrete_subtype_definition_list : discrete_subtype_definition {','
discrete_subtype_definition} ;
+
+constrained_array_definition
+ : 'array' '(' discrete_subtype_definition_list ')' 'of' component_definition
+ %((wisi-indent-action [nil nil (wisi-anchored 2 1) (wisi-anchored 2 0) nil
nil]))%
+ ;
+
+discrete_subtype_definition
+ : subtype_indication
+ | range_g
+ ;
+
+component_definition ::=
+ ['aliased'] subtype_indication
+ | ['aliased'] access_definition
+ ;
+
+index_constraint
+ : '(' discrete_range ',' discrete_range {',' discrete_range} ')' ;;:edited
single discrete_range redundant with slice
+ ;
+
+discrete_range
+ : subtype_indication
+ %((wisi-indent-action [(wisi-hanging nil ada-indent-broken)]))%
+ | range_g
+ %((wisi-indent-action [(wisi-hanging nil ada-indent-broken)]))%
+ ;
+
+discriminant_part : unknown_discriminant_part | known_discriminant_part ;
+
+unknown_discriminant_part : '(' '<>' ')' ;
+
+discriminant_specification_list ;;:new for action
+ : discriminant_specification {';' discriminant_specification} ;
+
+known_discriminant_part
+ : '(' discriminant_specification_list ')'
+ %((wisi-indent-action [nil (wisi-anchored 1 1) (wisi-anchored 1 0)]))%
+ ;
+
+discriminant_specification
+ : defining_identifier_list ':' [null_exclusion] name [assign_value]
+ %((wisi-face-apply-action [4 font-lock-function-name-face
font-lock-type-face])
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken
+ (wisi-hanging% (wisi-anchored% 4
ada-indent-broken)
+ (wisi-anchored% 4 (* 2
ada-indent-broken)))]))%
+ | defining_identifier_list ':' access_definition [assign_value]
+ %((wisi-indent-action [nil ada-indent-broken ada-indent-broken
+ (wisi-hanging% (wisi-anchored% 3
ada-indent-broken)
+ (wisi-anchored% 3 (* 2
ada-indent-broken)))]))%
+ ;
+
+;; default_expression ::= expression ;;:inlined
+
+;; discriminant_association_list ;;:redundant with parameter_association_list
+;; : discriminant_association {',' discriminant_association} ;
+
+;; discriminant_constraint ;;:redundant with expanded
parameter_association_list
+;; : '(' parameter_association_list ')'
+
+;; discriminant_association ;;: redundant with expanded parameter_association
+;; : component_choice_list assoc_expression
+
+record_type_definition ::= [['abstract'] 'tagged'] ['limited']
record_definition ;
+
+record_definition
+ : 'record' component_list 'end' 'record' [IDENTIFIER]
+ %((wisi-indent-action [(ada-indent-record* 'TYPE 1 0)
+ [(ada-indent-record* 'TYPE 1 ada-indent)
(ada-indent-record* 'TYPE 1 ada-indent)]
+ (ada-indent-record* 'TYPE 1 0)
+ nil ada-indent-broken]))%
+ ;; We don't do wisi-match-names here, because the trailing
+ ;; identifier is a 2020 addition, and most coding standards don't
+ ;; require it.
+ | 'null' 'record'
+ ;
+
+component_list
+ : component_item {component_item}
+ | {component_item} variant_part
+ | 'null' ';'
+ %((wisi-statement-action [1 statement-start 2 statement-end]))%
+ ;
+
+component_item ::= component_declaration | aspect_clause ;
+
+component_declaration
+ : defining_identifier_list ':' component_definition [assign_value]
[aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 6 statement-end])
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken
+ (wisi-hanging% (wisi-anchored% 3
ada-indent-broken)
+ (wisi-anchored% 3 (* 2
ada-indent-broken)))
+ ada-indent-broken ada-indent-broken]))%
+ ;
+
+variant_list ;;:new; split out from variant_part for action
+ : variant
+ | variant_list variant
+ %((wisi-motion-action [1 2]))%
+ ;
+
+variant_part
+ : 'case' direct_name 'is' variant_list 'end' 'case' ';'
+ %((wisi-statement-action [1 statement-start 7 statement-end])
+ (wisi-motion-action [1 4 7])
+ (wisi-indent-action [nil ada-indent-broken nil ada-indent-when nil
ada-indent-broken ada-indent-broken]))%
+ ;
+
+variant
+ : 'when' discrete_choice_list '=>' component_list
+ %((wisi-statement-action [1 motion])
+ ;; ada-indent-when applied in variant_part; consistent with
+ ;; discrete_choice_list in case_statement.
+ (wisi-indent-action [nil nil ada-indent [ada-indent ada-indent]]))%
+ ;
+
+discrete_choice_list
+ : discrete_choice
+ | discrete_choice_list '|' discrete_choice
+ ;
+
+discrete_choice
+ : expression ;;:edited choice_expression -> expression
+ %((wisi-indent-action [(wisi-hanging nil ada-indent-broken)]))%
+ | subtype_indication
+ %((wisi-indent-action [(wisi-hanging nil ada-indent-broken)]))%
+ | range_g
+ %((wisi-indent-action [(wisi-hanging nil ada-indent-broken)]))%
+ | 'others'
+ ;
+
+record_extension_part
+ : 'with' record_definition
+ ;; comment after 'with' same as 'record'
+ %((wisi-indent-action [[nil (ada-indent-record* 'TYPE 2 0)] nil]))%
+ ;
+
+abstract_subprogram_declaration
+ : [overriding_indicator] subprogram_specification 'is' 'abstract'
[aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 2 statement-override 6
statement-end])
+ ;; 'is' consistent with expression_function; same as ada-mode 7.0.1
+ (wisi-indent-action [nil nil ada-indent-subprogram-is ada-indent-broken
nil ada-indent-broken]))%
+ ;
+
+interface_type_definition
+ : ['limited' | 'task' | 'protected' | 'synchronized'] 'interface' ['and'
interface_list]
+ ;
+
+interface_list
+ : name ;;:new; explicit list for action
+ %((wisi-face-apply-action [1 font-lock-function-name-face
font-lock-type-face]))%
+ | interface_list AND name ;;:new explicit list for action
+ %((wisi-face-apply-action [3 font-lock-function-name-face
font-lock-type-face]))%
+ ;
+
+access_type_definition
+ : [null_exclusion] access_to_object_definition
+ | [null_exclusion] 'access' ['protected'] access_to_subprogram_definition
;;:edited
+ ;
+
+access_to_object_definition ::= 'access' [general_access_modifier]
subtype_indication ;
+
+general_access_modifier ::= 'all' | 'constant' ;
+
+access_to_subprogram_definition
+ : 'procedure' parameter_profile ;;:edited; move 'access' ['protected'] to
access_type_definition for indent
+ ;; test/ada_mode-nominal.ads
+ ;; type Procedure_Access_Type_8 is access
+ ;; protected procedure
+ ;; (A_Param : out Integer);
+ %((wisi-indent-action [nil (wisi-anchored% 1 ada-indent-broken)]))%
+ | 'function' parameter_and_result_profile ;;:edited
+ ;; test/ada_mode-nominal.ads
+ ;; type Function_Access_Type_10 is access
+ ;; protected function
+ ;; (A_Param : in Float)
+ ;; return Standard.Float;
+ %((wisi-indent-action [nil (wisi-anchored% 1 ada-indent-broken)]))%
+ ;
+
+null_exclusion ::= 'not' 'null' ;
+
+access_definition
+ : [null_exclusion] 'access' ['constant'] name
+ %((wisi-face-apply-action [4 font-lock-function-name-face
font-lock-type-face]))%
+
+ | [null_exclusion] 'access' ['protected'] 'procedure' parameter_profile
+ %((wisi-indent-action [nil nil nil nil (wisi-anchored% 4
ada-indent-broken)]))%
+
+ | [null_exclusion] 'access' ['protected'] 'function'
parameter_and_result_profile
+ %((wisi-indent-action [nil nil nil nil (wisi-anchored% 4
ada-indent-broken)]))%
+ ;
+
+incomplete_type_declaration
+ : 'type' IDENTIFIER [discriminant_part] ['is' 'tagged'] ';'
+ %((wisi-statement-action [1 statement-start 6 statement-end])
+ (wisi-name-action 2)
+ (wisi-face-apply-action [2 nil font-lock-type-face])
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken
+ ada-indent-broken]))%
+ ;
+
+declarative_item : basic_declarative_item | proper_body | body_stub ;
+
+;; declarative_item is in compilation_unit, as is statement. statement
+;; contains pragma_g, so declarative_item can't. But pragma_g must be in the
+;; grammar for declarative_part, so we include it here.
+declarative_item_pragma
+ : declarative_item
+ | pragma_g
+ ;
+
+declarative_part : [declarative_item_pragma+] ;
+
+basic_declarative_item : basic_declaration | aspect_clause | use_clause ;
+
+;; body ;;:inlined
+;; ::= proper_body | body_stub
+
+proper_body : subprogram_body | package_body | task_body | protected_body ;
+
+name
+ : direct_name
+ %()%
+ %((wisi-propagate-name 1))%
+
+ | explicit_dereference
+ ;; indexed_component ;; redundant with 'name actual_parameter_part'
+ | slice
+
+ | selected_component
+ %()%
+ %((wisi-propagate-name 1))%
+
+ | attribute_reference
+ ;; type_conversion ;;:redundant with function_call
+ | function_call
+ | CHARACTER_LITERAL
+ | qualified_expression
+ ;; name ;; redundant - inlined generalized_reference
+ ;; generalized_indexing ;; redundant with function_call
+ | target_name
+ ;
+
+direct_name
+ : IDENTIFIER
+ ;; marking this for possible later face-apply, to prevent applying
+ ;; face to the aggregate of an allocator, and other similar cases.
+ ;; test/ada_mode-nominal.adb
+ ;; Object_3 : access Record_Type_3 := new Record_Type_3 (...)
+ %((wisi-face-mark-action [1 suffix]))%
+ %((wisi-propagate-name 1))%
+
+ | STRING_LITERAL
+ %()%
+ %((wisi-propagate-name 1))%
+ ;
+
+;; deleted prefix ::= name | implicit_dereference ;; inlined in 'name'
+
+explicit_dereference : name '.' 'all' ;
+
+;; implicit_dereference ;;:inlined; only used in 'prefix'
+;; ::= name
+
+;; indexed_component ;;:redundant with function_call
+;; ::= name '(' expression {',' expression} ')'
+
+slice
+ : name '(' discrete_range ')'
+ %((wisi-indent-action [nil nil (wisi-anchored 2 1) (wisi-anchored 2 0)]))%
+ ;
+
+selected_component
+ : name '.' selector_name
+ ;; higher level productions should apply hanging indent to names
+ %((wisi-face-mark-action [1 prefix 3 suffix]))%
+ %((wisi-merge-names 1 3))%
+ ;
+
+selector_name
+ : direct_name ;; edited; redundant IDENTIFIER | STRING_LITERAL
+ | CHARACTER_LITERAL
+ | 'others' ;;:new from component_choice_list, formal_package_actual_part to
reduce conflicts
+ ;
+
+attribute_reference : name tick attribute_designator |
reduction_attribute_reference ;
+
+attribute_designator
+ : IDENTIFIER ;; deleted ['(' expression ')'] - redundant with function_call
in name
+ | 'access'
+ | 'delta'
+ | 'digits'
+ | 'mod'
+ ;
+
+range_attribute_reference : name tick range_attribute_designator ;
+
+range_attribute_designator
+ : 'range' ['(' expression ')']
+ %((wisi-indent-action [nil ada-indent-broken
+ (wisi-hanging (wisi-anchored 2 1)
+ (wisi-anchored 2 (+ 1
ada-indent-broken)))
+ (wisi-anchored 2 0)]))%
+ ;
+
+;; generalized_reference ::= name ;; inlined to name
+
+;; generalized_indexing ::= name actual_parameter_part - redundant with
function_call
+
+aggregate
+ : record_aggregate
+ | extension_aggregate
+ | array_aggregate
+ | delta_aggregate
+ ;; container_aggregate ;; redundant with array_aggregate
+
+ ;; ARM 4.5.7(7), ARM 4.5.8(4), ARM 4.5.9(4) allow
+ ;; ( conditional | quantified_expression | declare_expression )
+ ;; instead of (( ... ))
+ | '(' conditional_expression ')' ;;:new
+ %((wisi-indent-action [nil [(wisi-anchored 1 1) (wisi-anchored 1 1)]
(wisi-anchored 1 0)]))%
+ | '(' quantified_expression ')' ;;:new
+ %((wisi-indent-action [nil [(wisi-anchored 1 1) (wisi-anchored 1 1)]
(wisi-anchored 1 0)]))%
+ | '(' declare_expression ')' ;;:new
+ %((wisi-indent-action [nil [(wisi-anchored 1 1) (wisi-anchored 1 1)]
(wisi-anchored 1 0)]))%
+ ;
+
+record_aggregate
+ : '(' record_component_association_list ')'
+ %((wisi-indent-action [nil [(wisi-anchored 1 1) (wisi-anchored 1 1)]
(wisi-anchored 1 0)]))%
+ ;
+
+record_component_association_list
+ : record_component_association {',' record_component_association}
+ | 'null' 'record'
+ ;
+
+record_component_association
+ : component_choice_list assoc_expression ;;:edited:; [] inlined for action
+ %((wisi-indent-action [nil ada-indent-broken]))%
+ | expression ;;new:; [] inlined for action
+ %((wisi-indent-action [(wisi-hanging nil ada-indent-broken)]))%
+ ;; | component_choice_list '=>' '<>' ;;:redundant with expanded
assoc_expression
+ ;
+
+component_choice_list
+ : selector_name
+ | component_choice_list '|' selector_name
+ ;; This indent is not consistent with discrete_choice_list in
+ ;; case_statement, but it is backward-compatible.
+ %((wisi-indent-action [nil nil ada-indent-broken]))%
+ ;; | 'others' ;;:redundant with expanded selector_name
+ ;
+
+extension_aggregate
+ : '(' expression 'with' record_component_association_list ')'
+ %((wisi-indent-action [nil
+ (wisi-hanging (wisi-anchored 1 1)
+ (wisi-anchored 1 (+ 1
ada-indent-broken)))
+ (wisi-anchored 1 1)
+ [(wisi-anchored 1 1) (wisi-anchored 1 1)]
+ (wisi-anchored 1 0)]))%
+ ;
+
+;; ancestor_part ::= expression | name ;; inlined to 'expression'
+
+array_aggregate ::= positional_array_aggregate | null_array_aggregate |
named_array_aggregate ;
+
+expression_list ;; new to support actions
+ : expression
+ %((wisi-indent-action [[(wisi-hanging nil ada-indent-broken) (wisi-hanging
nil ada-indent-broken)]]))%
+ | expression_list ',' expression
+ %((wisi-indent-action [nil nil [(wisi-hanging nil ada-indent-broken)
(wisi-hanging nil ada-indent-broken)]]))%
+ ;
+
+positional_array_aggregate
+ ;; There must be at least two items in a positional aggregate with
+ ;; parens. ARM Annex P enforces this in the syntax rules, but that
+ ;; causes too many conflicts, so we relax that here.
+ : '(' expression_list ')'
+ %((wisi-indent-action [nil
+ [(wisi-anchored 1 1) (wisi-anchored 1 1)]
+ (wisi-anchored 1 0)]))%
+ | '(' expression_list ',' 'others' assoc_expression ')'
+ %((wisi-indent-action [nil
+ (wisi-anchored 1 1)
+ nil
+ (wisi-anchored 1 1)
+ (wisi-anchored 1 (+ 1 ada-indent-broken))
+ (wisi-anchored 1 0)]))%
+ ;; | '(' expression_list ',' 'others' '=>' '<>' ')' ;;:redundant with
assoc_expression
+ | '[' expression_list [',' 'others' assoc_expression] ']'
+ %((wisi-indent-action [nil
+ (wisi-anchored 1 1)
+ nil
+ (wisi-anchored 1 1)
+ (wisi-anchored 1 (+ 1 ada-indent-broken))
+ (wisi-anchored 1 0)]))%
+ ;; | '[' expression_list ',' 'others' '=>' '<>' ']' ;;:redundant with
assoc_expression
+ ;
+
+null_array_aggregate ::= '[' ']' ;
+
+named_array_aggregate
+ : '(' array_component_association_list ')'
+ %((wisi-indent-action [nil [(wisi-anchored 1 1) (wisi-anchored 1 1)]
(wisi-anchored 1 0)]))%
+ | '[' array_component_association_list ']'
+ %((wisi-indent-action [nil [(wisi-anchored 1 1) (wisi-anchored 1 1)]
(wisi-anchored 1 0)]))%
+ ;
+
+array_component_association_list ::= array_component_association { ','
array_component_association} ;
+
+array_component_association
+ : discrete_choice_list assoc_expression
+ ;; This is not consistent with discrete_choice_list in
+ ;; case_statement, but it is backward-compatible.
+ %((wisi-indent-action [(wisi-hanging nil ada-indent-broken)
ada-indent-broken]))%
+ ;; | discrete_choice_list '=>' '<>' ;;:redundant with expanded
assoc_expression
+ ;; iterated_component_association ;;:deleted
+ | iterated_element_association ;;:new: superset of
iterated_component_association
+ ;
+
+;; iterated_component_association ;;:deleted; subset of
iterated_element_association
+;; : 'for' IDENTIFIER 'in' discrete_choice_list '=>' expression
+;; | 'for' iterator_specification '=>' expression
+;; ;
+
+delta_aggregate ::= record_delta_aggregate | array_delta_aggregate ;
+
+record_delta_aggregate
+ : '(' expression 'with' 'delta' record_component_association_list ')'
+ %((wisi-indent-action [nil
+ (wisi-hanging (wisi-anchored 1 1)
+ (wisi-anchored 1 (+ 1
ada-indent-broken)))
+ (wisi-anchored 1 1)
+ (wisi-anchored 1 1)
+ [(wisi-anchored 1 1) (wisi-anchored 1 1)]
+ (wisi-anchored 1 0)]))%
+ ;
+
+array_delta_aggregate
+ : '(' expression 'with' 'delta' array_component_association_list ')'
+ %((wisi-indent-action [nil
+ (wisi-hanging (wisi-anchored 1 1)
+ (wisi-anchored 1 (+ 1
ada-indent-broken)))
+ (wisi-anchored 1 1)
+ (wisi-anchored 1 1)
+ [(wisi-anchored 1 1) (wisi-anchored 1 1)]
+ (wisi-anchored 1 0)]))%
+
+ | '[' expression 'with' 'delta' array_component_association_list ']'
+ %((wisi-indent-action [nil
+ (wisi-hanging (wisi-anchored 1 1)
+ (wisi-anchored 1 (+ 1
ada-indent-broken)))
+ (wisi-anchored 1 1)
+ (wisi-anchored 1 1)
+ [(wisi-anchored 1 1) (wisi-anchored 1 1)]
+ (wisi-anchored 1 0)]))%
+ ;
+
+;; container_aggregate ::= ;; deleted; subset of array_aggregate except for
iterated_element_association
+;; null_array_aggregate
+;; | positional_container_aggregate
+;; | named_container_aggregate
+
+;; null_container_aggregate ::= '[' ']' ;; inlined to "null_array_aggregate"
+
+;; positional_container_aggregate ::= '[' expression {',' expression} ']' ;;
deleted; only used in container_aggregate
+
+;; named_container_aggregate ::= '[' container_element_association_list ']' ;;
deleted; only used in container_aggregate
+
+;; container_element_association_list ::= container_element_association { ','
container_element_association} ;; deleted; only used in container_aggregate
+
+;; container_element_association ::= ;; deleted; only used in
container_aggregate
+;; key_choice_list '=>' expression
+;; | key_choice_list '=>' '<>'
+;; | iterated_element_association
+
+;; key_choice_list ::= key_choice {'|' key_choice} ;; deleted; only used in
container_aggregate
+
+;; key_choice ::= expression | discrete_range ;; deleted; only used in
container_aggregate
+
+iterated_element_association
+ : 'for' loop_parameter_specification ['use' expression] assoc_expression
+ %((wisi-indent-action [nil ada-indent-broken ada-indent-broken
+ (wisi-hanging* ada-indent-broken
ada-indent-broken)
+ ada-indent-broken]))%
+ | 'for' iterator_specification ['use' expression] assoc_expression
+ %((wisi-indent-action [nil ada-indent-broken ada-indent-broken
+ (wisi-hanging* ada-indent-broken
ada-indent-broken)
+ ada-indent-broken]))%
+ ;
+
+AND_relation_list ;;:new, split out from expression for action. FIXME: put back
+ : 'and' relation
+ | AND_relation_list 'and' relation
+ ;
+
+AND_THEN_relation_list
+ : 'and' THEN relation
+ | AND_THEN_relation_list 'and' THEN relation
+ ;
+
+OR_relation_list
+ : 'or' relation
+ | OR_relation_list 'or' relation
+ ;
+
+OR_ELSE_relation_list
+ : 'or' ELSE relation
+ | OR_ELSE_relation_list 'or' ELSE relation
+ ;
+
+XOR_relation_list
+ : 'xor' relation
+ | XOR_relation_list 'xor' relation
+ ;
+
+expression
+ ;; containing productions should apply hanging indent
+ : relation ;;:new to reduce conflicts
+ | relation AND_relation_list
+ | relation AND_THEN_relation_list
+ | relation OR_relation_list
+ | relation OR_ELSE_relation_list
+ | relation XOR_relation_list
+ ;
+
+;; choice_expression ;;:deleted; mostly redundant with expression, delete to
reduce conflicts
+ ;; : choice_relation ;; new to reduce conflicts
+ ;; | choice_relation {'and' choice_relation}- ;; extra -
+ ;; | choice_relation {'or' choice_relation}- ;; extra -
+ ;; | choice_relation {'xor' choice_relation}- ;; extra -
+ ;; | choice_relation {'and' 'then' choice_relation}- ;; extra -
+ ;; | choice_relation {'or' 'else' choice_relation}- ;; extra -
+
+relation
+ : simple_expression [relational_operator simple_expression]
+ | simple_expression ['not'] 'in' membership_choice_list
+ | raise_expression
+ ;
+
+membership_choice_list ::= membership_choice {'|' membership_choice} ;
+
+membership_choice
+ : simple_expression
+ %((wisi-indent-action [(wisi-hanging nil ada-indent-broken)]))%
+ | range_g
+ %((wisi-indent-action [(wisi-hanging nil ada-indent-broken)]))%
+ ;; name ;; redundant - from inlined subtype_mark, redundant with name in
simple_expression
+ ;
+
+simple_expression : [unary_adding_operator] term {binary_adding_operator term}
;
+
+term : factor {multiplying_operator factor} ;
+
+factor ::= primary ['**' primary] | 'abs' primary | 'not' primary ;
+
+primary
+ : NUMERIC_LITERAL
+ %((wisi-face-apply-action [1 nil font-lock-constant-face]))%
+ | 'null'
+ ;; STRING_LITERAL ;;:redundant with name
+ | aggregate
+ %((wisi-indent-action [(ada-indent-aggregate)]))%
+ | name
+ | allocator
+ ;;| '(' expression ')' ;;:redundant with positional_aggregate
+ ;; '(' conditional_expression ')' ;;:redundant with aggregate
+ ;; '(' quantified_expression ')' ;;:redundant with aggregate
+ ;; | '(' declare_expression ')';;:redundant with aggregate
+ ;
+
+;; logical_operator ::= 'and' | 'or' | 'xor' ;;:deleted; not used in the
grammar
+
+relational_operator : '=' | '/=' | '<' | '<=' | '>' | '>=' ;
+
+binary_adding_operator : '+' | '-' | '&' ;
+
+unary_adding_operator : '+' | '-' ;
+
+multiplying_operator : '*' | '/' | 'mod' | 'rem' ;
+
+;; highest_precedence_operator ::= '**' | 'abs' | 'not' ;; not used in the
grammar
+
+conditional_expression : if_expression | case_expression ;
+
+elsif_expression_item ;;:new for action
+ : 'elsif' condition 'then' expression
+ %((wisi-statement-action [1 motion 3 motion])
+ (wisi-motion-action [1 3])
+ (wisi-indent-action [nil [ada-indent-broken ada-indent-broken] nil
+ (wisi-hanging* ada-indent ada-indent-broken)]))%
+ ;
+
+elsif_expression_list ;;:new for action
+ : elsif_expression_item
+ | elsif_expression_list elsif_expression_item
+ %((wisi-motion-action [1 2]))%
+ ;
+
+if_expression
+ : 'if' condition 'then' expression [elsif_expression_list] ['else'
expression]
+ %((wisi-statement-action [1 motion 3 motion 6 motion])
+ (wisi-motion-action [1 3 5 6])
+ (wisi-indent-action [nil
+ ;; test/ada_mode-conditional_expressions.adb
+ ;; K2b : Integer :=
+ ;; (if J >
+ ;; 42
+ ;; -- comment; matches last line of preceding
expression
+ ;; then -1
+ [(wisi-hanging* ada-indent-broken ada-indent-broken)
+ ada-indent-broken]
+ nil
+ ;; test/ada_mode-conditional_expressions.adb A :=
(if B ...
+ (wisi-hanging* ada-indent ada-indent-broken)
+ nil nil
+ (wisi-hanging* ada-indent ada-indent-broken)]))%
+ ;
+
+condition : expression ;
+
+case_expression_alternative_list ;;:new for action
+ : case_expression_alternative
+ | case_expression_alternative_list ',' case_expression_alternative
+ %((wisi-motion-action [1 3]))%
+ ;
+
+case_expression
+ : 'case' expression 'is' case_expression_alternative_list
+ %((wisi-statement-action [1 motion])
+ (wisi-motion-action [1 4])
+ (wisi-indent-action [nil [(wisi-hanging* ada-indent-broken
ada-indent-broken)
+ ada-indent-broken]
+ nil ada-indent-when]))%
+ ;
+
+case_expression_alternative
+ : 'when' discrete_choice_list '=>' expression
+ ;; test/ada_mode-conditional_expressions.adb
+ ;; when A =>
+ ;; J = 4
+ ;; or else M,
+ ;;
+ ;; L4 : Integer := (case J is
+ ;; when
+ ;; 42
+ ;; =>
+ ;; -1 +
+ ;; 2,
+ ;;
+ ;; The expression is indented ada-indent from 'when' independent
+ ;; of any intervening lines (consistent with case_statement_alternative).
+ %((wisi-statement-action [1 motion])
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken
+ ;; test/ada_mode-conditional_expressions.adb L3
for comment after '=>'
+ (wisi-hanging* ada-indent ada-indent-broken)]))%
+ ;
+
+quantified_expression
+ : 'for' quantifier loop_parameter_specification assoc_expression
+ %((wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken]))%
+ | 'for' quantifier iterator_specification assoc_expression
+ %((wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken]))%
+ ;
+
+quantifier : 'all' | 'some' ;
+
+;; predicate : expression ; inlined
+
+declare_expression
+ : 'declare' {declare_item} 'begin' expression
+ %((wisi-indent-action [nil (wisi-block ada-indent) nil (wisi-hanging%
ada-indent (+ ada-indent ada-indent-broken))]))%
+ ;
+
+declare_item ::= object_declaration | object_renaming_declaration ;
+
+reduction_attribute_reference
+ : value_sequence tick reduction_attribute_designator
+ ;; name tick reduction_attribute_designator ;; redundant with
attribute_reference in name
+ ;
+
+value_sequence : '[' ['parallel' ['(' chunk_specification ')']]
iterated_element_association ']' ;
+
+reduction_attribute_designator : IDENTIFIER '(' reduction_specification ')' ;
+
+reduction_specification
+ : name ',' expression
+ %((wisi-indent-action [(wisi-hanging nil ada-indent-broken)
+ nil
+ (wisi-hanging* ada-indent-broken
ada-indent-broken)]))%
+ ;
+
+;; type_conversion ;;:redundant with function_call
+;; : name '(' expression ')'
+;; | name '(' name ')'
+;; ;
+
+qualified_expression
+ : name tick aggregate
+ %((wisi-face-apply-action [1 font-lock-function-name-face
font-lock-type-face])
+ ;; test/indent.ads C_S_Controls, test/ada_mode-long_paren.adb Packet :=
new Packet_Type'
+ (wisi-indent-action [nil (wisi-anchored% 1 ada-indent-broken)
(wisi-anchored% 1 ada-indent-broken)]))%
+ ;
+
+;; LRM 4.8 has 'subtype_indication' here, which allows a constraint.
+;; That allows this derivation:
+;;
+;; term : factor * factor
+;; term : allocator * 4
+;; term : new subtype_indication * 4
+;; term : new name range 1 .. a + b * 4
+;;
+;; which gives conflicts on *, /, leading to geometric explosion of
+;; parallel parsing in arithmetic expressions. LRM 4.8(4) says the
+;; constraint is only allowed if the subtype is unconstrained, and the
+;; allocator is uninitialized. A constraint for an unconstrained
+;; subtype is either an index_constraint or discriminant_constraint;
+;; we can eliminate the conflicts by stating that explicitly here.
+allocator
+ : 'new' [subpool_specification] subtype_indication_paren_constraint
+ ;; 'new' [ subpool_specification ] qualified_expression ;;:redundant with
name in subtype_indication
+ ;
+subtype_indication_paren_constraint
+ : [null_exclusion] name ;; includes discriminant_constraint; redundant with
subprogram_call
+ | [null_exclusion] name index_constraint
+ %((wisi-face-apply-action [2 font-lock-function-name-face
font-lock-type-face]))%
+ ;
+
+subpool_specification ::= '(' name ')' ;
+
+sequence_of_statements : statement {statement} {label} ;
+
+sequence_of_statements_opt ;; new; eliminates many conflicts in entry_call
and select
+ : [sequence_of_statements]
+ ;
+
+;; inlined "[sequence_of_statements]" to "sequence_of_statements_opt"
+
+statement : {label} simple_statement | {label} compound_statement ;
+
+simple_statement
+ : null_statement
+ | assignment_statement
+ | exit_statement
+ | goto_statement
+ | procedure_call_statement
+ | simple_return_statement
+ ;; entry_call_statement ;;:redundant with procedure_call_statement
+ | requeue_statement
+ | delay_statement
+ | abort_statement
+ | raise_statement
+ ;; code_statement ;;:redundant with procedure_call_statement
+ | pragma_g ;;:new for pragma
+ ;
+
+compound_statement
+ : if_statement
+ | case_statement
+ | loop_statement
+ | block_statement
+ | extended_return_statement
+ | parallel_block_statement
+ | accept_statement
+ | select_statement
+ ;
+
+null_statement
+ : 'null' ';'
+ %((wisi-statement-action [1 statement-start 2 statement-end]))%
+ ;
+
+label
+ : '<<' statement_identifier '>>'
+ %((wisi-face-apply-action [2 nil font-lock-constant-face])
+ (wisi-indent-action [ada-indent-label ada-indent-broken
ada-indent-broken]))%
+ ;
+
+statement_identifier ::= direct_name ;
+
+assignment_statement
+ : name assign_value ';'
+ %((wisi-statement-action [1 statement-start 3 statement-end])
+ (wisi-indent-action [(wisi-hanging nil ada-indent-broken)
+ (wisi-hanging% (wisi-anchored% 1 ada-indent-broken)
+ (wisi-anchored% 1 (* 2
ada-indent-broken)))
+ ada-indent-broken]))%
+ ;
+
+target_name ::= '@' ;
+
+elsif_statement_item ;;:new for action
+ : 'elsif' condition 'then' sequence_of_statements
+ %((wisi-statement-action [1 motion 3 motion])
+ (wisi-motion-action [1 3])
+ (wisi-indent-action [nil [ada-indent-broken ada-indent-broken] nil
[(wisi-block ada-indent) ada-indent]]))%
+ ;
+
+elsif_statement_list ;;:new for action
+ : elsif_statement_item
+ | elsif_statement_list elsif_statement_item
+ ;
+
+if_statement
+ : 'if' condition 'then' sequence_of_statements [elsif_statement_list]
['else' sequence_of_statements] 'end' 'if' ';'
+ %((wisi-statement-action [1 statement-start 3 motion 6 motion 10
statement-end])
+ (wisi-motion-action [1 3 [5 ELSIF] 6 10])
+ (wisi-indent-action [nil
+ [(wisi-hanging* ada-indent-broken
ada-indent-broken) ada-indent-broken]
+ nil
+ [(wisi-block ada-indent) ada-indent] nil nil
+ [(wisi-block ada-indent) ada-indent] nil
ada-indent-broken ada-indent-broken]))%
+ ;
+
+case_statement_alternative_list ;;:new for action
+ : case_statement_alternative
+ | case_statement_alternative_list case_statement_alternative
+ ;
+
+case_statement
+ : 'case' expression 'is' case_statement_alternative_list 'end' 'case' ';'
+ %((wisi-statement-action [1 statement-start 7 statement-end])
+ (wisi-motion-action [1 [4 WHEN] 7])
+ (wisi-indent-action [nil
+ (wisi-hanging* ada-indent-broken ada-indent-broken)
+ nil [ada-indent-when ada-indent-when]
+ nil ada-indent-broken ada-indent-broken]))%
+ ;
+
+case_statement_alternative
+ : 'when' discrete_choice_list '=>' sequence_of_statements
+ %((wisi-statement-action [1 motion])
+ ;; ada-indent-when added in case_statement. The statements are
+ ;; indented ada-indent from 'when' independent of any intervening
+ ;; lines (consistent with case_expression_alternative).
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken
+ [(wisi-block ada-indent) ada-indent]]))%
+ ;
+
+loop_statement
+ : label_opt [iteration_scheme] 'loop' sequence_of_statements 'end' 'loop'
identifier_opt ';'
+ %((wisi-statement-action [1 statement-start 2 statement-override 3 motion
8 statement-end])
+ (wisi-motion-action [2 3 8])
+ (wisi-indent-action [ada-indent-label nil nil [(wisi-block ada-indent)
ada-indent] nil ada-indent-broken
+ ada-indent-broken
ada-indent-broken]))%
+ %((wisi-match-names 1 7))%
+ ;
+
+iteration_scheme
+ : 'while' condition
+ %((wisi-indent-action [nil [ada-indent-broken ada-indent-broken]]))%
+ | 'for' loop_parameter_specification
+ %((wisi-indent-action [nil [ada-indent-broken ada-indent-broken]]))%
+ | 'for' iterator_specification
+ %((wisi-indent-action [nil [ada-indent-broken ada-indent-broken]]))%
+ | ['parallel'] 'for' procedural_iterator
+ %((wisi-indent-action [nil nil [ada-indent-broken ada-indent-broken]]))%
+ | 'parallel' [ '(' chunk_specification ')' ] 'for'
loop_parameter_specification
+ %((wisi-indent-action [nil nil (wisi-anchored 1 1) (wisi-anchored 1 0) nil
[ada-indent-broken ada-indent-broken]]))%
+ | 'parallel' [ '(' chunk_specification ')' ] 'for' iterator_specification
+ %((wisi-indent-action [nil nil (wisi-anchored 1 1) (wisi-anchored 1 0) nil
[ada-indent-broken ada-indent-broken]]))%
+ ;
+
+chunk_specification
+ : simple_expression
+ %((wisi-indent-action [(wisi-hanging nil ada-indent-broken)]))%
+ | IDENTIFIER 'in' discrete_subtype_definition
+ %((wisi-indent-action [nil ada-indent-broken ada-indent-broken]))%
+ ;
+
+loop_parameter_specification
+ ;; This is very similar to iterator_specification;
+ ;; discrete_subtype_definition is a superset of 'name'. Could merge
+ ;; to reduce conflicts.
+ : IDENTIFIER 'in' ['reverse'] discrete_subtype_definition [iterator_filter]
+ ;
+
+iterator_filter ::= 'when' condition ;
+
+iterator_specification
+ : IDENTIFIER [':' loop_parameter_subtype_indication] 'in' ['reverse'] name
[iterator_filter]
+ ;; "name" here names an iterator function, not a type
+
+ | IDENTIFIER [':' loop_parameter_subtype_indication] 'of' ['reverse'] name
[iterator_filter]
+ ;; "name" here names an object, not a type
+ ;
+
+loop_parameter_subtype_indication ::= subtype_indication | access_definition ;
+
+procedural_iterator
+ : iterator_parameter_specification 'of' function_call [iterator_filter]
;;:edited iterator_procedure_call => function_call
+ ;
+
+iterator_parameter_specification ::=
+ formal_part
+ | '(' defining_identifier_list ')' ;; 'IDENTIFIER {',' IDENTIFIER}'
redundant with defining_identifier_list
+ ;
+
+;; iterator_procedure_call ;;:redundant with expanded function_call
+;; ::= name
+;; | name iterator_actual_parameter_part
+
+;; iterator_actual_parameter_part ;;:redundant with expanded
actual_parameter_part
+;; ::= '(' iterator_parameter_association { ','
iterator_parameter_association} ')'
+
+;; iterator_parameter_association ;;:redundant with expanded
parameter_association
+;; : parameter_association | parameter_association_with_box ;
+
+;; parameter_association_with_box ;;:redundant with expanded
parameter_association
+;; : [ selector_name '=>' ] '<>' ;
+
+identifier_opt ;;:new; split out from block_statement and other named
statements for wisi-match-names
+ : [IDENTIFIER] ;
+
+label_opt ;;:new; split out from block_statement for match_names
+ : [statement_identifier ':']
+ %()%
+ %((wisi-propagate-name 1))%
+ ;
+
+block_statement
+ : label_opt ['declare' declarative_part] 'begin'
handled_sequence_of_statements
+ 'end' identifier_opt ';'
+ %((wisi-statement-action [1 statement-start 2 statement-override 4
statement-override 8 statement-end])
+ (wisi-motion-action [1 2 4 [5 WHEN] 8])
+ (wisi-indent-action [ada-indent-label nil [(wisi-block ada-indent)
ada-indent] nil
+ [(wisi-block ada-indent)
ada-indent]
+ nil ada-indent-broken
ada-indent-broken]))%
+ %((wisi-match-names 1 7))%
+ ;
+
+statement_AND_list
+ : handled_sequence_of_statements
+ | statement_AND_list 'and' handled_sequence_of_statements
+ %((wisi-indent-action [nil (- ada-indent) nil]))%
+ ;
+
+parallel_block_statement
+ : 'parallel' 'do' handled_sequence_of_statements 'and' statement_AND_list
'end' 'do' ';'
+ %((wisi-indent-action [nil nil [(wisi-block ada-indent) ada-indent] nil
[(wisi-block ada-indent) ada-indent]
+ nil nil nil]))%
+ ;
+
+exit_statement
+ : 'exit' [name] ['when' condition] ';'
+ %((wisi-statement-action [1 statement-start 5 statement-end])
+ (wisi-indent-action [nil nil nil ada-indent-broken ada-indent-broken]))%
+ ;
+
+goto_statement
+ : 'goto' name ';'
+ %((wisi-statement-action [1 statement-start 3 statement-end])
+ (wisi-face-apply-action [2 nil font-lock-constant-face]))%
+ ;
+
+subprogram_declaration
+ : [overriding_indicator] subprogram_specification [aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 2 statement-override 4
statement-end]))%
+ ;
+
+subprogram_specification
+ : procedure_specification
+ %()%
+ %((wisi-propagate-name 1))%
+ | function_specification
+ %()%
+ %((wisi-propagate-name 1))%
+ ;
+
+procedure_specification
+ : 'procedure' name parameter_profile
+ %((wisi-statement-action [1 statement-start])
+ (wisi-name-action 2)
+ (wisi-face-apply-action [2 font-lock-function-name-face
font-lock-function-name-face])
+ ;; Comments after 'name' are assumed to be present only when
+ ;; 'parameter_profile_opt' is empty, so they are before the 'is'
+ ;; in a subprogram_body; indent the same as after a
+ ;; subprogram_declaration (see
+ ;; ada_mode-options-markus_column_0.adb). Similarly for comments
+ ;; after 'parameter_profile_opt'.
+ (wisi-indent-action [nil
+ [(wisi-hanging* ada-indent-broken ada-indent-broken)
+ nil]
+ [ada-indent-broken nil]]))%
+ %((wisi-propagate-name 2))%
+ ;
+
+function_specification
+ : 'function' name parameter_and_result_profile
+ %((wisi-statement-action [1 statement-start])
+ (wisi-name-action 2)
+ (wisi-face-apply-action [2 font-lock-function-name-face
font-lock-function-name-face])
+ (wisi-indent-action [nil
+ (wisi-hanging* ada-indent-broken ada-indent-broken)
+ ada-indent-broken]))%
+ %((wisi-propagate-name 2))%
+ ;
+
+;; designator ::= [name '.'] IDENTIFIER | STRING_LITERAL ;;:inlined to "name"
+
+;; defining_designator ::= name | STRING_LITERAL ;;:inlined to "name"
+
+;; defining_program_unit_name ::= [name '.'] IDENTIFIER ;;:inlined to "name";
redundant with selected_component in name
+
+;; operator_symbol ::= STRING_LITERAL ;;:inlined
+
+;; defining_operator_symbol ::= STRING_LITERAL ;;:inlined
+
+parameter_profile ::= [formal_part] ;
+
+result_profile ;;:new; split out from parameter_and_result_profile for indent
actions
+ : 'return' [null_exclusion] name
+ %((wisi-face-apply-action [3 font-lock-function-name-face
font-lock-type-face])
+ (wisi-indent-action [nil
+ (wisi-anchored% 1 ada-indent-broken)
+ (wisi-hanging
+ (wisi-anchored% 1 ada-indent-broken)
+ (wisi-anchored% 1 ada-indent-broken))]))%
+ | 'return' access_definition
+ ;; test/ada_mode-nominal.adb
+ ;; function Function_Access_1
+ ;; (A_Param : in Float)
+ ;; return access
+ ;; Standard.Float
+ %((wisi-indent-action [nil (wisi-anchored% 1 ada-indent-broken)]))%
+ ;
+
+parameter_and_result_profile
+ : formal_part result_profile ;;:inlined for action
+ %((wisi-indent-action [nil (ada-indent-return 1 0)]))%
+ | result_profile ;;:new
+ ;
+
+parameter_specification_list ;;:new; split out from formal_part for action
+ : parameter_specification {';' parameter_specification}
+ ;
+
+formal_part
+ : '(' parameter_specification_list ')'
+ %((wisi-statement-action [1 misc]) ;; for ada-wisi-in-paramlist-p,
ada-goto-declarative-region-start
+ (wisi-indent-action [nil (wisi-anchored 1 1) (wisi-anchored 1 0)]))%
+ ;
+
+parameter_specification
+ : defining_identifier_list ':' ['aliased'] mode [null_exclusion] name
[assign_value]
+ %((wisi-face-apply-action [6 font-lock-function-name-face
font-lock-type-face])
+ (wisi-indent-action [nil
+ ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken
+ ;; test/ada_mode-parens.ads Function_1
+ (wisi-hanging (wisi-anchored% 2 ada-indent-broken)
+ (wisi-anchored% 2 ada-indent-broken))
+ (wisi-hanging% (wisi-anchored% 2 ada-indent-broken)
+ (wisi-anchored% 2 (* 2
ada-indent-broken)))]))%
+ | defining_identifier_list ':' access_definition [assign_value]
+ %((wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken
+ (wisi-hanging% (wisi-anchored% 3
ada-indent-broken)
+ (wisi-anchored% 3 (* 2
ada-indent-broken)))]))%
+ ;
+
+mode : ['in'] | 'in' 'out' | 'out' ;
+
+global_aspect_definition
+ ;; 'null' ;;deleted; redundant with expression in aspect
+ ;; | 'unspecified' ;;deleted: not a keyword
+ : global_mode global_designator
+ | '(' global_aspect_element{ ',' global_aspect_element} ')'
+ | extended_global_aspect_definition
+ ;
+
+global_aspect_element ::= global_mode global_set |
extended_global_aspect_element ;
+
+global_mode ::= basic_global_mode | extended_global_mode ;
+
+basic_global_mode ::= 'in' | 'in' 'out' | 'out' ;
+
+global_set ::= name { ',' name} ;
+
+global_designator ::= 'all' | 'synchronized' | name ;
+
+;; global_name ::= name | name ;;:inlined to "name"
+
+name_opt ;;:new; split out from subprogram_body for wisi-match-names
+ : [name]
+ %()%
+ %((wisi-propagate-name 1))%
+ ;
+
+subprogram_body
+ : [overriding_indicator] subprogram_specification [aspect_specification]
'is' declarative_part
+ 'begin' handled_sequence_of_statements 'end' name_opt ';'
+ %((wisi-statement-action [1 statement-start 2 statement-override 4 motion
6 motion 10 statement-end])
+ (wisi-motion-action [1 2 4 6 [7 WHEN] 10])
+ (wisi-face-apply-action [9 font-lock-function-name-face
font-lock-function-name-face])
+ (wisi-indent-action [nil nil nil nil [(wisi-block ada-indent) ada-indent]
+ nil [(wisi-block ada-indent) ada-indent] nil
ada-indent-broken ada-indent-broken]))%
+ %((wisi-match-names 2 9))%
+ ;
+
+procedure_call_statement
+ : name ';'
+ %((wisi-statement-action [1 statement-start 2 statement-end])
+ (wisi-indent-action [(wisi-hanging nil ada-indent-broken)
ada-indent-broken]))%
+ ;; name actual_parameter_part ';' ;;:redundant with function_call in name
+ ;
+
+function_call
+ ;; name ;;:redundant with "name"
+ : name actual_parameter_part
+ ;; Using anchored is the only way to ensure enclosing indents are ignored.
+ %((wisi-indent-action [nil (wisi-anchored% 1 ada-indent-broken)]))%
+ ;
+
+parameter_association_list ;; new to support actions
+ : parameter_association
+ | parameter_association_list ',' parameter_association
+ ;
+
+actual_parameter_part
+ ;; '(' parameter_association {',' parameter_association} ')' ;;:deleted to
support actions
+ : '(' parameter_association_list ')' ;; new to support actions
+ ;; see note in test/ada_mode-parens.adb Local_10 about right paren indent.
+ %((wisi-indent-action [nil [(wisi-anchored 1 1) (wisi-anchored 1 1)]
(wisi-anchored 1 0)]))%
+
+ ;; ARM 4.5.7(7), ARM 4.5.8(4), ARM 4.5.9(4) allow
+ ;; ( conditional | quantified_expression | declare_expression)
+ ;; instead of (( ... ))
+ | '(' conditional_expression ')' ;; new
+ %((wisi-indent-action [nil [(wisi-anchored 1 1) (wisi-anchored 1 1)]
(wisi-anchored 1 0)]))%
+ | '(' quantified_expression ')' ;; new
+ %((wisi-indent-action [nil [(wisi-anchored 1 1) (wisi-anchored 1 1)]
(wisi-anchored 1 0)]))%
+ | '(' declare_expression ')' ;;:new
+ %((wisi-indent-action [nil [(wisi-anchored 1 1) (wisi-anchored 1 1)]
(wisi-anchored 1 0)]))%
+ ;
+
+assoc_expression ;;:new; split out from *_association for indent
+ : '=>' expression
+ ;; Using anchor is the only way to ignore subsequent indents
+ %((wisi-indent-action [nil (wisi-hanging%
+ (wisi-anchored% 1 ada-indent-broken)
+ (wisi-anchored% 1 (* 2 ada-indent-broken)))]))%
+ | '=>' '<>' ;;:new from iterator_parameter_association to reduce conflicts
+ ;
+
+parameter_association
+ : component_choice_list assoc_expression ;;:inlined for action, expanded to
component_choice_list to reduce conflicts
+ %((wisi-indent-action [nil ada-indent-broken ada-indent-broken]))%
+ | expression ;;:inlined for action
+ %((wisi-indent-action [(wisi-hanging nil ada-indent-broken)]))%
+ | '<>' ;;:new from iterator_parameter_association to reduce conflicts
+ ;
+
+;; explicit_actual_parameter ;;:inlined
+;; : expression
+;; ;; name ;;:redundant with expression
+;; ;
+
+simple_return_statement
+ : 'return' [expression]';'
+ ;; test/ada_mode-parens.adb Function_3
+ ;; return
+ ;; 1.0 +
+ ;; 2.0;
+ %((wisi-statement-action [1 statement-start 3 statement-end])
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken]))%
+ ;
+
+extended_return_object_declaration
+ : IDENTIFIER ':' ['aliased'] ['constant'] return_subtype_indication
[assign_value]
+ %((wisi-indent-action [nil nil ada-indent-broken ada-indent-broken
ada-indent-broken
+ (wisi-hanging% (wisi-anchored% 5
ada-indent-broken)
+ (wisi-anchored% 5 (* 2
ada-indent-broken)))]))%
+ ;
+
+extended_return_statement
+ : 'return' extended_return_object_declaration ['do'
handled_sequence_of_statements 'end' 'return'] ';'
+ ;; indent the same as a simple return statment
+ ;; test/ada_mode-nominal.adb
+ ;; return B : Integer :=
+ ;; (Local_Function);
+ ;; (wisi-indent-action [nil nil nil]))
+ %((wisi-statement-action [1 statement-start 3 motion 7 statement-end])
+ (wisi-motion-action [1 3 [4 WHEN] 7])
+ (wisi-indent-action [[nil ada-indent] ada-indent-broken nil [(wisi-block
ada-indent) ada-indent] nil
+ ada-indent-broken ada-indent-broken]))%
+ ;
+
+return_subtype_indication : subtype_indication | access_definition ;
+
+null_procedure_declaration
+ : [overriding_indicator] procedure_specification 'is' 'null'
[aspect_specification] ';'
+ ;; indent IS, WITH consistent with expression_function
+ %((wisi-statement-action [1 statement-start 2 statement-override 6
statement-end])
+ (wisi-indent-action [nil nil ada-indent-subprogram-is ada-indent-broken
nil ada-indent-broken]))%
+ ;
+
+expression_function_declaration
+ ;;:redundant with 'aggregate'
+ ;; [overriding_indicator] function_specification 'is' '(' expression ')'
[aspect_specification] ';'
+
+ : [overriding_indicator] function_specification 'is' aggregate
[aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 2 statement-override 6
statement-end])
+ (wisi-indent-action [nil nil ada-indent-subprogram-is ada-indent-broken
nil ada-indent-broken]))%
+ ;
+
+package_declaration
+ : package_specification ';'
+ %((wisi-statement-action [1 statement-start 2 statement-end])
+ (wisi-motion-action [1 2]))%
+ ;
+
+;; See comment at declarative_item_pragma for pragma_g
+basic_declarative_item_pragma
+ : basic_declarative_item
+ | pragma_g
+ ;
+
+basic_declarative_item_list ;;:new for action in package_specification
+ : basic_declarative_item_pragma+
+ ;
+
+;; replace "[[name '.' ] IDENTIFIER" with "name_opt" for consistency and for
actions
+package_specification
+ : 'package' name [aspect_specification] 'is' [basic_declarative_item_list]
+ ['private' [basic_declarative_item_list]] 'end' name_opt
+ %((wisi-statement-action [1 statement-start 4 motion 6 motion])
+ (wisi-name-action 2)
+ (wisi-motion-action [1 4 6])
+ (wisi-face-apply-action [2 font-lock-function-name-face
font-lock-function-name-face
+ 9 font-lock-function-name-face
font-lock-function-name-face])
+ (wisi-indent-action [nil
+ (wisi-hanging* ada-indent-broken ada-indent-broken)
+ nil nil [(wisi-block ada-indent) ada-indent] nil
+ [(wisi-block ada-indent) ada-indent] nil
+ (wisi-hanging* ada-indent-broken
ada-indent-broken)]))%
+ %((wisi-match-names 2 9))%
+ ;
+
+;; replace "[[name '.' ] IDENTIFIER" with "name" for consistency and for
actions
+package_body
+ : 'package' 'body' name [aspect_specification] 'is' declarative_part
+ ['begin' handled_sequence_of_statements] 'end' name_opt ';'
+ %((wisi-statement-action [1 statement-start 5 motion 7 motion 11
statement-end])
+ (wisi-name-action 3)
+ (wisi-motion-action [1 5 7 [8 WHEN] 13])
+ (wisi-face-apply-action [3 font-lock-function-name-face
font-lock-function-name-face
+ 10 font-lock-function-name-face
font-lock-function-name-face])
+ (wisi-indent-action [nil
+ ada-indent-broken
+ (wisi-hanging* ada-indent-broken ada-indent-broken)
+ nil nil [(wisi-block ada-indent) ada-indent]
+ nil [(wisi-block ada-indent) ada-indent] nil
+ (wisi-hanging* ada-indent-broken ada-indent-broken)
+ ada-indent-broken]))%
+ %((wisi-match-names 3 10))%
+ ;
+
+private_type_declaration
+ : 'type' IDENTIFIER [discriminant_part] 'is' [['abstract'] 'tagged']
['limited'] 'private' [aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 10 statement-end])
+ (wisi-name-action 2)
+ (wisi-face-apply-action [2 nil font-lock-type-face])
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken nil
ada-indent-broken ada-indent-broken
+ ada-indent-broken ada-indent-broken nil
ada-indent-broken]))%
+ ;
+
+private_extension_declaration
+ : 'type' IDENTIFIER [discriminant_part] 'is' ['abstract'] ['limited' |
'synchronized'] 'new'
+ subtype_indication ['and' interface_list] 'with' 'private'
[aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 15 statement-end])
+ (wisi-name-action 2)
+ (wisi-face-apply-action [2 nil font-lock-type-face])
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken ada-indent-broken
+ ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken ada-indent-broken
+ ada-indent-broken ada-indent-broken nil
ada-indent-broken]))%
+ ;
+
+overriding_indicator
+ : ['not'] 'overriding'
+ %((wisi-statement-action [1 statement-start 2 statement-override]))%
+ ;
+
+use_clause : use_package_clause | use_type_clause ;
+
+name_list ;;:new; split out from use_package_clause for action
+ : name
+ | name_list ',' name
+ ;
+
+use_package_clause
+ : 'use' name_list ';'
+ %((wisi-statement-action [1 statement-start 3 statement-end])
+ (wisi-face-apply-list-action [2 font-lock-function-name-face
font-lock-function-name-face])
+ (wisi-indent-action [nil ada-indent-use ada-indent-broken]))%
+ ;
+
+use_type_clause
+ ::= 'use' ['all'] 'type' name_list ';'
+ %((wisi-statement-action [1 statement-start 5 statement-end])
+ (wisi-face-apply-list-action [4 font-lock-function-name-face
font-lock-type-face])
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-use ada-indent-broken]))%
+ ;
+
+renaming_declaration
+ : object_renaming_declaration
+ | exception_renaming_declaration
+ | package_renaming_declaration
+ | subprogram_renaming_declaration
+ | generic_renaming_declaration
+ ;
+
+object_renaming_declaration
+ : IDENTIFIER [':' [null_exclusion] name] 'renames' name
[aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 8 statement-end])
+ (wisi-name-action 1)
+ (wisi-face-apply-action [4 font-lock-function-name-face
font-lock-type-face])
+ (wisi-indent-action [nil
+ ada-indent-broken ada-indent-broken
+ (wisi-hanging* ada-indent-broken ada-indent-broken)
+ ada-indent-broken
+ (wisi-hanging* ada-indent-broken ada-indent-broken)
+ ada-indent-broken ada-indent-broken]))%
+ | IDENTIFIER ':' access_definition 'renames' name [aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 7 statement-end])
+ (wisi-name-action 1)
+ (wisi-indent-action [nil
+ ada-indent-broken ada-indent-broken
ada-indent-broken
+ (wisi-hanging* ada-indent-broken ada-indent-broken)
+ ada-indent-broken ada-indent-broken]))%
+ ;
+
+exception_renaming_declaration
+ : IDENTIFIER ':' 'exception' 'renames' name [aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 7 statement-end])
+ (wisi-name-action 1)
+ (wisi-face-apply-action [5 font-lock-function-name-face nil])
+ (wisi-indent-action [nil
+ ada-indent-broken ada-indent-broken
ada-indent-broken
+ (wisi-hanging* ada-indent-broken ada-indent-broken)
+ ada-indent-broken ada-indent-broken]))%
+ ;
+
+package_renaming_declaration
+ : 'package' name 'renames' name [aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 6 statement-end])
+ (wisi-name-action 2)
+ (wisi-face-apply-action [2 font-lock-function-name-face
font-lock-function-name-face
+ 4 font-lock-function-name-face
font-lock-function-name-face])
+ (wisi-indent-action [nil
+ (wisi-hanging* ada-indent-broken ada-indent-broken)
+ ada-indent-broken
+ (wisi-hanging* ada-indent-broken ada-indent-broken)
+ nil ada-indent-broken]))%
+ ;
+
+subprogram_renaming_declaration
+ : [overriding_indicator] subprogram_specification 'renames' name
[aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 2 statement-override 6
statement-end])
+ (wisi-face-apply-action [4 font-lock-function-name-face
font-lock-function-name-face])
+ (wisi-indent-action [nil nil (ada-indent-renames 2)
+ (wisi-hanging* ada-indent-broken
ada-indent-broken)
+ nil ada-indent-broken]))%
+ ;
+
+generic_renaming_declaration
+ : 'generic' 'package' name 'renames' name [aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 7 statement-end])
+ (wisi-name-action 3)
+ (wisi-face-apply-action [3 font-lock-function-name-face
font-lock-function-name-face
+ 5 font-lock-function-name-face
font-lock-function-name-face])
+ (wisi-indent-action [nil
+ nil
+ (wisi-hanging* ada-indent-broken ada-indent-broken)
+ ada-indent-broken
+ (wisi-hanging* ada-indent-broken ada-indent-broken)
+ ada-indent-broken
+ ada-indent-broken]))%
+ | 'generic' 'procedure' name 'renames' name [aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 7 statement-end])
+ (wisi-name-action 3)
+ (wisi-face-apply-action [3 font-lock-function-name-face
font-lock-function-name-face
+ 5 font-lock-function-name-face
font-lock-function-name-face])
+ (wisi-indent-action [nil
+ nil
+ (wisi-hanging* ada-indent-broken ada-indent-broken)
+ ada-indent-broken
+ (wisi-hanging* ada-indent-broken ada-indent-broken)
+ ada-indent-broken
+ ada-indent-broken]))%
+ | 'generic' 'function' name 'renames' name [aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 7 statement-end])
+ (wisi-name-action 3)
+ (wisi-face-apply-action [3 font-lock-function-name-face
font-lock-function-name-face
+ 5 font-lock-function-name-face
font-lock-function-name-face])
+ (wisi-indent-action [nil
+ nil
+ (wisi-hanging* ada-indent-broken ada-indent-broken)
+ ada-indent-broken
+ (wisi-hanging* ada-indent-broken ada-indent-broken)
+ ada-indent-broken
+ ada-indent-broken]))%
+ ;
+
+task_type_declaration
+ : 'task' 'type' IDENTIFIER [known_discriminant_part] [aspect_specification]
+ ['is' ['new' interface_list 'with'] task_definition] ';'
+ %((wisi-statement-action [1 statement-start 6 motion 9 motion 11
statement-end])
+ (wisi-name-action 3)
+ (wisi-face-apply-action [3 nil font-lock-type-face 12 nil
font-lock-type-face])
+ (wisi-motion-action [1 6 9 [10 PRIVATE] 11])
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken nil
+ [nil ada-indent] ada-indent-broken
ada-indent-broken
+ ada-indent-broken nil ada-indent-broken]))%
+ %((wisi-match-names 3 10))%
+ ;
+
+single_task_declaration
+ : 'task' IDENTIFIER [aspect_specification] ['is' ['new' interface_list
'with'] task_definition] ';'
+ %((wisi-statement-action [1 statement-start 4 motion 9 statement-end])
+ (wisi-name-action 2)
+ (wisi-face-apply-action [2 nil font-lock-type-face])
+ (wisi-motion-action [1 4 [8 PRIVATE] 11])
+ (wisi-indent-action [nil ada-indent-broken nil [nil ada-indent]
ada-indent-broken
+ ada-indent-broken ada-indent-broken nil
ada-indent-broken]))%
+ %((wisi-match-names 2 8))%
+ ;
+
+task_item_list ;;:new; split out from task_definition for action
+ : task_item
+ | task_item_list task_item
+ ;
+
+task_definition
+ : task_item_list [ 'private' task_item_list] 'end' identifier_opt
+ %((wisi-statement-action [2 motion])
+ (wisi-face-apply-action [5 nil font-lock-type-face])
+ (wisi-indent-action [[ada-indent ada-indent] nil [ada-indent ada-indent]
nil ada-indent-broken]))%
+ %((wisi-propagate-name 5))%
+ ;
+
+task_item : entry_declaration | aspect_clause ;
+
+task_body
+ : 'task' 'body' IDENTIFIER [aspect_specification] 'is' declarative_part
+ 'begin' handled_sequence_of_statements 'end' identifier_opt ';'
+ %((wisi-statement-action [1 statement-start 5 motion 7 motion 11
statement-end])
+ (wisi-name-action 3)
+ (wisi-face-apply-action [3 nil font-lock-type-face 10 nil
font-lock-type-face])
+ (wisi-motion-action [1 5 7 [8 WHEN] 11])
+ (wisi-indent-action [nil nil ada-indent-broken nil nil [(wisi-block
ada-indent) ada-indent]
+ nil [(wisi-block ada-indent) ada-indent] nil
ada-indent-broken ada-indent-broken]))%
+ %((wisi-match-names 3 10))%
+ ;
+
+protected_type_declaration
+ :'protected' 'type' IDENTIFIER [known_discriminant_part]
[aspect_specification] 'is'
+ ['new' interface_list 'with'] protected_definition ';'
+ %((wisi-statement-action [1 statement-start 6 motion 11 statement-end])
+ (wisi-name-action 3)
+ (wisi-motion-action [1 6 [10 PRIVATE] 11])
+ (wisi-face-apply-action [3 nil font-lock-type-face])
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken nil [nil ada-indent]
+ ada-indent-broken ada-indent-broken
ada-indent-broken
+ [nil ada-indent-broken] ada-indent-broken]))%
+ %((wisi-match-names 3 10))%
+ ;
+
+single_protected_declaration
+ : 'protected' IDENTIFIER [aspect_specification] 'is' ['new' interface_list
'with'] protected_definition ';'
+ %((wisi-statement-action [1 statement-start 4 motion 7 motion 9
statement-end])
+ (wisi-motion-action [1 4 7 [8 PRIVATE] 9])
+ (wisi-name-action 2)
+ (wisi-face-apply-action [2 nil font-lock-type-face])
+ (wisi-indent-action [nil ada-indent-broken nil [nil ada-indent]
ada-indent-broken
+ ada-indent-broken ada-indent-broken nil
ada-indent-broken]))%
+ %((wisi-match-names 2 8))%
+ ;
+
+protected_operation_declaration_list ;;:new; split out from
protected_definition for actions
+ : protected_operation_declaration
+ | protected_operation_declaration_list protected_operation_declaration
+ ;
+
+protected_element_declaration_list ;;:new; split out from protected_definition
for actions
+ : protected_element_declaration
+ | protected_element_declaration_list protected_element_declaration
+ ;
+
+protected_definition
+ : [protected_operation_declaration_list] [ 'private'
[protected_element_declaration_list] ] 'end' [IDENTIFIER]
+ %((wisi-statement-action [2 motion])
+ (wisi-face-apply-action [5 nil font-lock-type-face])
+ (wisi-indent-action [[ada-indent ada-indent] nil [ada-indent ada-indent]
nil ada-indent-broken]))%
+ %((wisi-propagate-name 5))%
+ ;
+
+protected_operation_declaration
+ : subprogram_declaration
+ | pragma_g ;;:new for pragma
+ | entry_declaration
+ | aspect_clause
+ ;
+
+protected_element_declaration ::= protected_operation_declaration |
component_declaration ;
+
+protected_operation_item_list ;;:new; split out from protected_body for actions
+ : protected_operation_item
+ | protected_operation_item_list protected_operation_item
+ ;
+
+protected_body
+ : 'protected' 'body' IDENTIFIER [aspect_specification] 'is'
[protected_operation_item_list] 'end' identifier_opt ';'
+ %((wisi-statement-action [1 statement-start 5 motion 9 statement-end])
+ (wisi-name-action 3)
+ (wisi-motion-action [1 5 9])
+ (wisi-face-apply-action [3 nil font-lock-type-face 8 nil
font-lock-type-face])
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken nil nil
[(wisi-block ada-indent) ada-indent]
+ nil ada-indent-broken ada-indent-broken]))%
+ %((wisi-match-names 3 8))%
+ ;
+
+protected_operation_item
+ : subprogram_declaration
+ | subprogram_body
+ | null_procedure_declaration
+ | expression_function_declaration
+ | entry_body
+ | aspect_clause
+ ;
+
+;; synchronization_kind ::= By_Entry | By_Protected_Procedure | Optional ;;
not used in the grammar
+
+entry_declaration
+ : [overriding_indicator] 'entry' IDENTIFIER ['(' discrete_subtype_definition
')'] parameter_profile
+ [aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 2 statement-override 9
statement-end])
+ (wisi-name-action 3)
+ (wisi-face-apply-action [3 nil font-lock-function-name-face])
+ (wisi-indent-action [nil nil ada-indent-broken ada-indent-broken
(wisi-anchored 4 1) (wisi-anchored 4 0)
+ ada-indent-broken nil ada-indent-broken]))%
+ ;
+
+accept_statement ::=
+ 'accept' direct_name ['(' entry_index ')'] parameter_profile
+ ['do' handled_sequence_of_statements 'end' identifier_opt] ';'
+ %((wisi-statement-action [1 statement-start 7 motion 11 statement-end])
+ (wisi-motion-action [1 7 [8 WHEN] 11])
+ (wisi-face-apply-action [2 nil font-lock-function-name-face 10 nil
font-lock-function-name-face])
+ (wisi-indent-action [nil ada-indent-broken
+ ada-indent-broken nil nil ;; we assume the
entry index tokens are always on one line
+ ada-indent-broken
+ [nil ada-indent]
+ [(wisi-block ada-indent) ada-indent]
+ nil ada-indent-broken ada-indent-broken]))%
+ %((wisi-match-names 2 10))%
+ ;
+
+entry_index ::= expression ;
+
+entry_body
+ : 'entry' IDENTIFIER entry_body_formal_part [aspect_specification]
entry_barrier 'is' declarative_part 'begin'
+ handled_sequence_of_statements 'end' identifier_opt ';'
+ %((wisi-statement-action [1 statement-start 5 motion 6 motion 8 motion 12
statement-end])
+ (wisi-name-action 2)
+ (wisi-motion-action [1 5 6 8 [9 WHEN] 12])
+ (wisi-face-apply-action [2 nil font-lock-function-name-face 11 nil
font-lock-function-name-face])
+
+ ;; test/ada_mode-nominal.adb
+ ;; entry E2
+ ;; (X : Integer)
+ ;; when Local_1 = 0 and not
+ ;; (Local_2 = 1)
+ ;;
+ ;; entry E3
+ ;; (X : Integer) when Local_1 = 0 and not
+ ;; (Local_2 = 1)
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken nil
ada-indent-broken
+ nil [ada-indent ada-indent] nil [ada-indent
ada-indent] nil ada-indent-broken
+ ada-indent-broken]))%
+ %((wisi-match-names 2 11))%
+ ;
+
+entry_body_formal_part
+ : ['(' entry_index_specification ')'] parameter_profile
+ %((wisi-indent-action [nil (wisi-anchored 1 1) (wisi-anchored 1 0) nil]))%
+ ;
+
+entry_barrier
+ : 'when' condition
+ %((wisi-statement-action [1 motion])
+ (wisi-indent-action [nil (wisi-hanging* ada-indent-broken
ada-indent-broken)]))%
+ ;
+
+entry_index_specification ::= 'for' IDENTIFIER 'in'
discrete_subtype_definition ;
+
+;; entry_call_statement ::= name [actual_parameter_part] ';' ;; deleted;
redundant with procedure_call_statement
+
+requeue_statement
+ : 'requeue' name ['with' 'abort'] ';'
+ %((wisi-statement-action [1 statement-start 5 statement-end]))%
+ ;
+
+delay_statement : delay_until_statement | delay_relative_statement ;
+
+delay_until_statement
+ : 'delay' 'until' expression ';'
+ %((wisi-statement-action [1 statement-start 4 statement-end])
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken]))%
+ ;
+
+delay_relative_statement
+ : 'delay' expression ';'
+ %((wisi-statement-action [1 statement-start 3 statement-end])
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken]))%
+ ;
+
+select_statement
+ : selective_accept
+ | timed_entry_call
+ | conditional_entry_call
+ | asynchronous_select
+ ;
+
+guard_select ;;:new; split out from selective_accept for actions
+ : guard select_alternative
+ %((wisi-indent-action [nil (wisi-block ada-indent)]))%
+ | select_alternative
+ ;
+
+select_alternative_list ;;:new; split out from selective_accept for actions
+ : guard_select
+ | select_alternative_list 'or' guard_select
+ %((wisi-statement-action [2 motion])
+ (wisi-motion-action [[1 OR] 2])
+ (wisi-indent-action [nil (- ada-indent) nil]))%
+ ;
+
+selective_accept
+ : 'select' select_alternative_list [ 'else' sequence_of_statements ] 'end'
'select' ';'
+ %((wisi-statement-action [1 statement-start 3 motion 7 statement-end])
+ (wisi-motion-action [1 [2 OR] 3 7])
+ (wisi-indent-action [[nil ada-indent] [(wisi-block ada-indent)
ada-indent] nil
+ [(wisi-block ada-indent) ada-indent] nil
ada-indent-broken
+ ada-indent-broken]))%
+ ;
+
+guard
+ : 'when' condition '=>'
+ %((wisi-indent-action [nil (wisi-anchored 1 ada-indent-broken)
(wisi-anchored 1 ada-indent-broken)]))%
+ ;
+
+select_alternative
+ : accept_alternative
+ | delay_alternative
+ | terminate_alternative
+ ;
+
+accept_alternative
+ : accept_statement sequence_of_statements_opt
+ ;
+
+delay_alternative
+ : delay_statement sequence_of_statements_opt
+ ;
+
+terminate_alternative
+ : 'terminate' ';'
+ %((wisi-statement-action [1 statement-start 2 statement-end])
+ (wisi-indent-action [nil ada-indent-broken]))%
+ ;
+
+timed_entry_call
+ : 'select' entry_call_alternative 'or' delay_alternative 'end' 'select' ';'
+ %((wisi-statement-action [1 statement-start 3 motion 6 statement-end])
+ (wisi-motion-action [1 3 7])
+ (wisi-indent-action [nil [(wisi-block ada-indent) ada-indent] nil
[(wisi-block ada-indent) ada-indent] nil
+ ada-indent-broken ada-indent-broken]))%
+ ;
+
+entry_call_alternative : procedure_call_statement sequence_of_statements_opt ;
+
+;; procedure_or_entry_call ::= procedure_call_statement | entry_call_statement
;; inlined to procedure_call_statement
+
+conditional_entry_call
+ : 'select' entry_call_alternative 'else' sequence_of_statements 'end'
'select' ';'
+ %((wisi-statement-action [1 statement-start 3 motion 7 statement-end])
+ (wisi-motion-action [1 3 7])
+ (wisi-indent-action [nil [(wisi-block ada-indent) ada-indent] nil
[(wisi-block ada-indent) ada-indent] nil
+ ada-indent-broken ada-indent-broken]))%
+ ;
+
+asynchronous_select
+ : 'select' triggering_alternative 'then' 'abort' abortable_part 'end'
'select' ';'
+ %((wisi-statement-action [1 statement-start 3 motion 8 statement-end])
+ (wisi-motion-action [1 3 8])
+ (wisi-indent-action [nil [(wisi-block ada-indent) ada-indent] [nil
ada-indent-broken] ada-indent-broken
+ [(wisi-block ada-indent) ada-indent] nil
ada-indent-broken ada-indent-broken]))%
+ ;
+
+triggering_alternative
+ ;; triggering_statement [sequence_of_statements] ;;:deleted; causes
conflicts; replaced by the following:
+ : procedure_call_statement sequence_of_statements_opt ;;:new
+ | delay_statement sequence_of_statements_opt ;;:new
+ ;
+
+;; triggering_statement ::= procedure_call_statement | delay_statement ;;
deleted, inlined to reduce conflicts
+
+abortable_part : sequence_of_statements ;
+
+abort_statement
+ : 'abort' name {',' name} ';'
+ %((wisi-statement-action [1 statement-start 5 statement-end]))%
+ ;
+
+;; Compute indent for trailing comments.
+compilation
+ : compilation_unit
+ %((wisi-indent-action [[0 0]]))%
+ %((wisi-terminate-partial-parse))%
+ | compilation compilation_unit
+ %((wisi-indent-action [0 [0 0]]))%
+ ;
+
+;; extended for partial parse, fragment parse
+compilation_unit
+ ;; context_clause library_item ;;:redundant; all are in declarative_item
+ ;; context_clause subunit ;;:redundant
+ : with_clause ;;:new
+ | ['private'] declarative_item ;;:new
+ %((wisi-indent-action [0 0]))%
+ | statement ;;:new
+ | subunit ;;:new
+ | entry_declaration ;;:new for format parameter list
+ ;
+
+;; library_item ::=
+;; ['private'] library_unit_declaration
+;; | library_unit_body
+;; | ['private'] library_unit_renaming_declaration
+
+;; library_unit_declaration ::=
+;; subprogram_declaration
+;; | package_declaration
+;; | generic_declaration
+;; | generic_instantiation
+
+;; library_unit_renaming_declaration ::=
+;; package_renaming_declaration
+;; | generic_renaming_declaration
+;; | subprogram_renaming_declaration
+
+;; library_unit_body ::= subprogram_body | package_body
+
+;; parent_unit_name ::= name ;; inlined
+
+;; with_clause merged into compilation_unit; use_clause is already there via
declarative_item
+;; context_clause ::= context_item+
+;; context_item ::= with_clause | use_clause
+
+with_clause : limited_with_clause | nonlimited_with_clause ;
+
+limited_with_clause
+ : 'limited' ['private'] 'with' name_list ';'
+ %((wisi-statement-action [1 statement-start 5 statement-end])
+ (wisi-face-apply-list-action [4 font-lock-function-name-face
font-lock-function-name-face])
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-with ada-indent-broken]))%
+ ;
+
+nonlimited_with_clause
+ : ['private'] 'with' name_list ';'
+ %((wisi-statement-action [1 statement-start 2 statement-override 4
statement-end])
+ (wisi-face-apply-list-action [3 font-lock-function-name-face
font-lock-function-name-face])
+ (wisi-indent-action [nil nil ada-indent-with ada-indent-broken]))%
+ ;
+
+body_stub : subprogram_body_stub | package_body_stub | task_body_stub |
protected_body_stub ;
+
+subprogram_body_stub
+ : [overriding_indicator] subprogram_specification 'is' 'separate'
[aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 2 statement-override 6
statement-end])
+ (wisi-indent-action [nil nil nil ada-indent-broken nil
ada-indent-broken]))%
+ ;
+
+package_body_stub
+ : 'package' 'body' IDENTIFIER 'is' 'separate' [aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 7 statement-end])
+ (wisi-name-action 3)
+ (wisi-face-apply-action [3 font-lock-function-name-face
font-lock-function-name-face])
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken
+ nil ada-indent-broken nil ada-indent-broken]))%
+ ;
+
+task_body_stub
+ : 'task' 'body' IDENTIFIER 'is' 'separate' [aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 7 statement-end])
+ (wisi-name-action 3)
+ (wisi-face-apply-action [3 nil font-lock-type-face])
+ (wisi-indent-action [nil nil ada-indent-broken nil ada-indent-broken nil
ada-indent-broken]))%
+ ;
+
+protected_body_stub
+ : 'protected' 'body' IDENTIFIER 'is' 'separate' [aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 7 statement-end])
+ (wisi-name-action 3)
+ (wisi-face-apply-action [3 nil font-lock-type-face])
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken
+ nil ada-indent-broken]))%
+ ;
+
+subunit
+ : 'separate' '(' name ')' proper_body
+ %((wisi-statement-action [1 statement-start])
+ (wisi-indent-action [nil ada-indent-broken (wisi-anchored 2 1)
(wisi-anchored 2 0) nil]))%
+ ;
+
+exception_declaration
+ : defining_identifier_list ':' 'exception' [aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 5 statement-end]))%
+ ;
+
+exception_handler_list ;;:new for pragma, action
+ : exception_handler
+ | pragma_g ;;:new for pragma
+ | exception_handler_list exception_handler
+ %((wisi-motion-action [1 2]))%
+ ;
+
+handled_sequence_of_statements
+ : sequence_of_statements ['exception' exception_handler_list]
+ %((wisi-indent-action [[nil nil]
+ (- ada-indent)
+ [(- ada-indent-when ada-indent) (- ada-indent-when
ada-indent)]]))%
+ ;
+
+exception_choice_list ;;:new for action
+ : exception_choice {'|' exception_choice} ;
+
+exception_handler
+ : 'when' [choice_parameter_specification ':'] exception_choice_list '=>'
sequence_of_statements
+ %((wisi-statement-action [1 motion])
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken
+ ;; test/ada_mode-recover_30.adb Initialize
exception handler
+ [(wisi-block ada-indent) ada-indent]]))%
+ ;
+
+choice_parameter_specification ::= IDENTIFIER ;
+
+exception_choice ::= name | 'others' ;
+
+raise_statement
+ : 'raise' ';'
+ %((wisi-statement-action [1 statement-start 2 statement-end]))%
+ | 'raise' name ['with' expression] ';'
+ %((wisi-statement-action [1 statement-start 5 statement-end])
+ ;; test/ada_mode-nominal.adb
+ ;; raise Constraint_Error with
+ ;; "help " &
+ ;; "me!";
+ ;;
+ ;; raise Constraint_Error
+ ;; with Integer'Image (1) &
+ ;; "help!";
+ ;;
+ ;; test/ada_mode-recover_30.adb Initialize exception handler
+ (wisi-indent-action [nil
+ (wisi-hanging* ada-indent-broken ada-indent-broken)
+ ada-indent-broken
+ (wisi-anchored% 3 ada-indent-broken) ;; same as
7.0.1
+ ada-indent-broken]))%
+ ;
+
+raise_expression
+ : 'raise' name ['with' simple_expression]
+ %((wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken]))%
+ ;
+
+generic_declaration : generic_subprogram_declaration |
generic_package_declaration ;
+
+generic_subprogram_declaration
+ : generic_formal_part subprogram_specification [aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 2 statement-override 4
statement-end])
+ (wisi-motion-action [1 2 4]))%
+ ;
+
+generic_package_declaration
+ : generic_formal_part package_specification ';'
+ %((wisi-statement-action [1 statement-start 3 statement-end])
+ (wisi-motion-action [1 2 3])
+ (wisi-indent-action [[nil ada-indent] nil ada-indent-broken]))%
+ ;
+
+generic_formal_part
+ : 'generic' {generic_formal_parameter_declaration}
+ %((wisi-statement-action [1 statement-start])
+ (wisi-indent-action [nil (wisi-block ada-indent)]))%
+ ;
+
+generic_formal_parameter_declaration
+ : formal_object_declaration
+ | formal_type_declaration
+ | formal_subprogram_declaration
+ | formal_package_declaration
+ | use_clause ;;:new, moved here from generic_formal_part
+ | pragma_g ;;:new for pragma
+ ;
+
+generic_instantiation
+ : 'package' name 'is' 'new' name [aspect_specification] ';' ;;:edited;
generic_actual_part redundant with actual_parameter_part in function_call in
name
+ %((wisi-statement-action [1 statement-start 7 statement-end])
+ (wisi-name-action 2)
+ (wisi-face-apply-action [2 font-lock-function-name-face
font-lock-function-name-face])
+ (wisi-indent-action [nil
+ (wisi-hanging* ada-indent-broken ada-indent-broken)
+ nil ada-indent-broken
+ (wisi-hanging* ada-indent-broken ada-indent-broken)
+ nil ada-indent-broken]))%
+ | [overriding_indicator] 'procedure' name 'is' 'new' name
[aspect_specification] ';' ;;:edited; generic_actual_part covered by name
+ %((wisi-statement-action [1 statement-start 2 statement-override 8
statement-end])
+ (wisi-name-action 3)
+ (wisi-face-apply-action [3 font-lock-function-name-face
font-lock-function-name-face])
+ (wisi-indent-action [nil
+ nil
+ (wisi-hanging* ada-indent-broken ada-indent-broken)
+ ada-indent-broken ada-indent-broken
+ (wisi-hanging* ada-indent-broken ada-indent-broken)
+ nil ada-indent-broken]))%
+ | [overriding_indicator] 'function' name 'is' 'new' name
[aspect_specification] ';' ;;:edited; generic_actual_part covered by name
+ %((wisi-statement-action [1 statement-start 2 statement-override 8
statement-end])
+ (wisi-name-action 3)
+ (wisi-face-apply-action [3 font-lock-function-name-face
font-lock-function-name-face])
+ (wisi-indent-action [nil
+ nil
+ (wisi-hanging* ada-indent-broken ada-indent-broken)
+ ada-indent-broken ada-indent-broken
+ (wisi-hanging* ada-indent-broken ada-indent-broken)
+ nil ada-indent-broken]))%
+ ;
+
+;; generic_actual_part ;;:redundant with actual_parameter_part
+;; : '(' generic_association_list ')'
+
+;; generic_association ;;: redundant with parameter_association
+;; : selector_name assoc_expression
+;; | expression
+
+;; explicit_generic_actual_parameter ;;:inlined
+;; : expression
+;; ;; name ;;:redundant <variable_>name
+;; ;; name ;;:redundant <subprogram_>name
+;; ;; name ;;:redundant <entry_>name
+;; ;; name ;;:redundant subtype_mark
+;; ;; name ;;:redundant <package_instance_>name
+;; ;
+
+formal_object_declaration
+ : defining_identifier_list ':' mode [null_exclusion] name [assign_value]
[aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 8 statement-end])
+ (wisi-face-apply-action [5 font-lock-function-name-face
font-lock-type-face])
+ (wisi-indent-action [nil
+ ada-indent-broken ada-indent-broken
ada-indent-broken
+ (wisi-hanging* ada-indent-broken ada-indent-broken)
+ (wisi-hanging% (wisi-anchored% 5 ada-indent-broken)
+ (wisi-anchored% 5 (* 2
ada-indent-broken)))
+ ada-indent-broken ada-indent-broken]))%
+ | defining_identifier_list ':' mode access_definition [assign_value]
[aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 7 statement-end])
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken
+ (wisi-hanging% (wisi-anchored% 4
ada-indent-broken)
+ (wisi-anchored% 4 (* 2
ada-indent-broken)))
+ ada-indent-broken ada-indent-broken]))%
+ ;
+
+formal_type_declaration : formal_complete_type_declaration |
formal_incomplete_type_declaration ;
+
+formal_complete_type_declaration
+ : 'type' IDENTIFIER [discriminant_part] 'is' formal_type_definition [ 'or'
'use' name ] [aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 10 statement-end])
+ (wisi-face-apply-action [2 nil font-lock-type-face
+ 8 nil font-lock-type-face])
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken
+ ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken
+ ada-indent-broken]))%
+ ;
+
+formal_incomplete_type_declaration
+ : 'type' IDENTIFIER [discriminant_part] ['is' 'tagged'] ['or' 'use' name] ';'
+ %((wisi-statement-action [1 statement-start 9 statement-end])
+ (wisi-face-apply-action [2 nil font-lock-type-face
+ 8 nil font-lock-type-face])
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken
+ ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken]))%
+ ;
+
+formal_type_definition ::=
+ formal_private_type_definition
+ | formal_derived_type_definition
+ | formal_discrete_type_definition
+ | formal_signed_integer_type_definition
+ | formal_modular_type_definition
+ | formal_floating_point_definition
+ | formal_ordinary_fixed_point_definition
+ | formal_decimal_fixed_point_definition
+ | formal_array_type_definition
+ | formal_access_type_definition
+ | formal_interface_type_definition
+ ;
+
+formal_private_type_definition ::= [['abstract'] 'tagged'] ['limited']
'private' ;
+
+formal_derived_type_definition
+ : ['abstract'] ['limited' | 'synchronized'] 'new' name [['and'
interface_list] 'with' 'private']
+ %((wisi-face-apply-action [5 font-lock-function-name-face
font-lock-type-face]))%
+ ;
+
+formal_discrete_type_definition ::= '(' '<>' ')' ;
+
+formal_signed_integer_type_definition ::= 'range' '<>' ;
+
+formal_modular_type_definition ::= 'mod' '<>' ;
+
+formal_floating_point_definition ::= 'digits' '<>' ;
+
+formal_ordinary_fixed_point_definition ::= 'delta' '<>' ;
+
+formal_decimal_fixed_point_definition ::= 'delta' '<>' 'digits' '<>' ;
+
+formal_array_type_definition ::= array_type_definition ;
+
+formal_access_type_definition ::= access_type_definition ;
+
+formal_interface_type_definition ::= interface_type_definition ;
+
+formal_subprogram_declaration : formal_concrete_subprogram_declaration |
formal_abstract_subprogram_declaration ;
+
+formal_concrete_subprogram_declaration
+ : 'with' subprogram_specification ['is' subprogram_default]
[aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 6 statement-end])
+ (wisi-indent-action [nil nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken]))%
+ ;
+
+formal_abstract_subprogram_declaration
+ : 'with' subprogram_specification 'is' 'abstract' [subprogram_default]
[aspect_specification] ';'
+ %((wisi-statement-action [1 statement-start 7 statement-end])
+ (wisi-indent-action [nil nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken
+ ada-indent-broken]))%
+ ;
+
+subprogram_default
+ : default_name
+ | '<>'
+ | 'null'
+ ;
+
+default_name
+ : name
+ %((wisi-face-apply-action [1 font-lock-function-name-face
font-lock-function-name-face]))%
+ ;
+
+formal_package_declaration
+ : 'with' 'package' IDENTIFIER 'is' 'new' name [aspect_specification] ';'
+ ;;:edited formal_package_actual_part redundant with actual_parameter_part
in name
+ %((wisi-statement-action [1 statement-start 8 statement-end])
+ (wisi-face-apply-action [3 font-lock-function-name-face
font-lock-function-name-face
+ 6 font-lock-function-name-face
font-lock-function-name-face])
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken
+ (wisi-hanging* ada-indent-broken
ada-indent-broken)
+ ada-indent-broken ada-indent-broken]))%
+ ;
+
+;; formal_package_actual_part ;;:redundant with expanded formal_part
+;; : '(' ['others' '=>'] '<>' ')'
+;; | [generic_actual_part] ;;:redundant with formal_part
+;; | '(' formal_package_association {',' formal_package_association} [','
'others' '=>' '<>'] ')'
+
+;; formal_package_association ;;:redundant; covered by expanded formal_part
+;; : generic_assocation_list | selector_name '=>' '<>'
+
+aspect_clause
+ : attribute_definition_clause
+ | enumeration_representation_clause
+ | record_representation_clause
+ | at_clause
+ ;
+
+;; local_name ;;:redundant with attribute_designator in name; inlined to "name"
+;; : direct_name tick attribute_designator
+;; | name
+
+aspect_association ;;:new for wisi-ada.adb code.
+ : aspect_mark ['=>' aspect_definition]
+ ;; test/aspects.ads, test/ada_mode-nominal.adb task Executive;
+ %((wisi-indent-action [nil nil (ada-indent-aspect)]))%
+ ;
+
+aspect_mark_list
+ : aspect_association
+ | aspect_mark_list ',' aspect_association
+ ;
+
+aspect_specification
+ : 'with' aspect_mark_list
+ ;; test/ada_mode-recover_30.adb "-- comment after aspect_specification"
+ %((wisi-indent-action [nil [ada-indent-broken ada-indent-broken]]))%
+ ;
+
+aspect_mark : IDENTIFIER [tick IDENTIFIER] ; ;;:edited "class" changed
+;; to IDENTIFIER so foo'class is legal elsewhere
+
+aspect_definition
+ ;; name ;; redundant with expression
+ : expression
+ ;; indent done in aspect_association
+ ;; IDENTIFIER ;;:redundant with expression
+ ;; aggregate ;;:redundant with expression
+ | global_aspect_definition
+ ;
+
+attribute_definition_clause
+ : 'for' name tick attribute_designator 'use' expression ';'
+ %((wisi-statement-action [1 statement-start 7 statement-end])
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken
+ ada-indent-broken nil]))%
+ ;; 'for' name tick attribute_designator 'use' name ';' ;;:redundant with
expression
+ ;
+
+enumeration_representation_clause
+ : 'for' name 'use' enumeration_aggregate ';'
+ %((wisi-statement-action [1 statement-start 5 statement-end])
+ (wisi-face-apply-action [2 font-lock-function-name-face
font-lock-type-face])
+ (wisi-indent-action [nil
+ (wisi-hanging* ada-indent-broken ada-indent-broken)
+ ada-indent-broken ada-indent-broken
ada-indent-broken]))%
+ ;
+
+enumeration_aggregate : array_aggregate ;
+
+record_representation_clause
+ : 'for' name 'use' 'record' [mod_clause] {component_clause} 'end' 'record'
[name] ';'
+ %((wisi-statement-action [1 statement-start 10 statement-end])
+ (wisi-face-apply-action [2 font-lock-function-name-face font-lock-type-face
+ 9 font-lock-function-name-face
font-lock-type-face])
+ (wisi-indent-action [nil
+ (wisi-hanging* ada-indent-broken ada-indent-broken)
+ ada-indent-broken
+ [(ada-indent-record* 'FOR 4 0) (ada-indent-record*
'FOR 4 ada-indent)]
+ (ada-indent-record 1 4 ada-indent)
+ [(ada-indent-record* 'FOR 4 ada-indent)
(ada-indent-record* 'FOR 4 ada-indent)]
+ (ada-indent-record* 'FOR 4 0)
+ ada-indent-broken
+ (wisi-hanging* ada-indent-broken ada-indent-broken)
+ ada-indent-broken]))%
+ ;
+
+component_clause
+ : name 'at' position 'range' first_bit '..' last_bit ';'
+ %((wisi-statement-action [1 statement-start 8 statement-end])
+ (wisi-indent-action [nil ada-indent-broken ada-indent-broken
ada-indent-broken ada-indent-broken
+ ada-indent-broken ada-indent-broken
ada-indent-broken]))%
+ ;
+
+position : expression ;
+
+first_bit : simple_expression ;
+
+last_bit : simple_expression ;
+
+;; code_statement ;;:deleted; redundant with procedure_call_statement
+;; ::= qualified_expression ';'
+
+;; storage_pool_indicator ;;:deleted; not used in the grammar
+;; ::= name | 'null' | Standard
+
+;; restriction ;;:deleted; not used in the grammar
+;; ::= IDENTIFIER | IDENTIFIER '=>' restriction_parameter_argument
+
+;; restriction_parameter_argument ;;:deleted; not used in the grammar
+;; ::= name | expression
+
+extended_global_aspect_definition ::= 'use' formal_parameter_designator | 'do'
dispatching_operation_specifier ;
+
+extended_global_aspect_element ::=
+ 'use' formal_parameter_set
+ | 'do' dispatching_operation_set
+ ;
+
+extended_global_mode ::= 'overriding' basic_global_mode ;
+
+formal_parameter_designator ::= formal_group_designator | name ;
+
+formal_parameter_set ::= formal_group_designator | name {',' name} ;
+
+formal_group_designator ::= 'null' | 'all' ;
+
+;; formal_parameter_name ::= ;; inlined to "name"
+;; subtype_mark
+;; | name
+;; | name
+
+dispatching_operation_set ::= dispatching_operation_specifier {','
dispatching_operation_specifier} ;
+
+dispatching_operation_specifier ::= name '(' name ')' ;
+
+delta_constraint
+ : 'delta' simple_expression [range_constraint]
+ ;; constistent with ada-mode 3.1
+ %((wisi-indent-action [nil ada-indent-broken ada-indent-broken]))%
+ ;
+
+at_clause
+ : 'for' direct_name 'use' 'at' expression ';'
+ %((wisi-statement-action [1 statement-start 6 statement-end]))%
+ ;
+
+mod_clause ::= 'at' 'mod' expression ';' ;
+
+;; end of file
diff --git a/ada_annex_p_process_actions.adb b/ada_annex_p_process_actions.adb
new file mode 100644
index 0000000000..91b63ccdcd
--- /dev/null
+++ b/ada_annex_p_process_actions.adb
@@ -0,0 +1,15703 @@
+-- generated parser support file. -*- buffer-read-only:t -*-
+-- command line: wisitoken-bnf-generate.exe --generate LR1 Ada_Emacs re2c
PROCESS text_rep ada_annex_p.wy
+--
+
+-- Copyright (C) 2013 - 2022 Free Software Foundation, Inc.
+
+-- This program is free software; you can redistribute it and/or
+-- modify it under the terms of the GNU General Public License as
+-- published by the Free Software Foundation; either version 3, or (at
+-- your option) any later version.
+--
+-- This software is distributed in the hope that it will be useful,
+-- but WITHOUT ANY WARRANTY; without even the implied warranty of
+-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+-- General Public License for more details.
+--
+-- You should have received a copy of the GNU General Public License
+-- along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>.
+
+with SAL;
+with Wisi; use Wisi;
+with Wisi.Ada; use Wisi.Ada;
+with WisiToken.In_Parse_Actions; use WisiToken.In_Parse_Actions;
+package body Ada_Annex_P_Process_Actions is
+
+ use WisiToken.Syntax_Trees.In_Parse_Actions;
+ use all type Motion_Param_Array;
+
+ procedure pragma_argument_association_list_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (1 => (False, (Hanging_0,
(Label => None), (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end pragma_argument_association_list_0;
+
+ procedure pragma_argument_association_list_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Hanging_0, (Label => None), (Int,
Ada_Indent_Broken)))));
+ end case;
+ end pragma_argument_association_list_1;
+
+ procedure pragma_g_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple,
+ (Anchored_0, T3, 1))), T5 => (False, (Simple, (Anchored_0, T3, 0))),
T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end pragma_g_0;
+
+ procedure pragma_g_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T6 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end pragma_g_1;
+
+ procedure pragma_g_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple,
+ (Anchored_0, T3, 1))), T5 => (False, (Simple, (Anchored_0, T3, 0))),
T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end pragma_g_2;
+
+ procedure pragma_g_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T6 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end pragma_g_3;
+
+ procedure full_type_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (True, (Simple, (Int,
+ Ada_Indent_Broken)), (Simple, (Language, Ada_Indent_Record_1'Access,
83 & Integer (T5) & Ada_Indent_Broken))),
+ T5 => (False, (Hanging_1, (Int, Ada_Indent_Broken), (Int, 2 *
Ada_Indent_Broken))), T6 => (False, (Simple,
+ (Label => None))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end full_type_declaration_0;
+
+ procedure full_type_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (True, (Simple, (Int,
+ Ada_Indent_Broken)), (Simple, (Language, Ada_Indent_Record_1'Access,
83 & Integer (T5) & Ada_Indent_Broken))),
+ T5 => (False, (Hanging_1, (Int, Ada_Indent_Broken), (Int, 2 *
Ada_Indent_Broken))), T7 => (False, (Simple,
+ (Int, Ada_Indent_Broken)))));
+ end case;
+ end full_type_declaration_1;
+
+ procedure full_type_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (True, (Simple, (Int,
Ada_Indent_Broken)), (Simple, (Language,
+ Ada_Indent_Record_1'Access, 83 & Integer (T5) & Ada_Indent_Broken))),
T5 => (False, (Hanging_1, (Int,
+ Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken))), T6 => (False,
(Simple, (Label => None))), T7 => (False,
+ (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end full_type_declaration_2;
+
+ procedure full_type_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T7 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (True, (Simple, (Int,
Ada_Indent_Broken)), (Simple, (Language,
+ Ada_Indent_Record_1'Access, 83 & Integer (T5) & Ada_Indent_Broken))),
T5 => (False, (Hanging_1, (Int,
+ Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken))), T7 => (False,
(Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end full_type_declaration_3;
+
+ procedure subtype_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T5 => (False,
(Simple, (Label => None))), T6 => (False,
+ (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end subtype_declaration_0;
+
+ procedure subtype_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6 => (False,
(Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end subtype_declaration_1;
+
+ procedure object_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6 =>
+ (False, (Hanging_1, (Anchored_1, T5, Ada_Indent_Broken), (Anchored_1,
T5, 2 * Ada_Indent_Broken))), T7 =>
+ (False, (Simple, (Int, Ada_Indent_Broken))), T8 => (False, (Simple,
(Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_0;
+
+ procedure object_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6 =>
+ (False, (Hanging_1, (Anchored_1, T5, Ada_Indent_Broken), (Anchored_1,
T5, 2 * Ada_Indent_Broken))), T8 =>
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_1;
+
+ procedure object_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T7 =>
+ (False, (Simple, (Int, Ada_Indent_Broken))), T8 => (False, (Simple,
(Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_2;
+
+ procedure object_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T8 =>
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_3;
+
+ procedure object_declaration_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6 => (False,
(Hanging_1, (Anchored_1, T5, Ada_Indent_Broken),
+ (Anchored_1, T5, 2 * Ada_Indent_Broken))), T7 => (False, (Simple,
(Int, Ada_Indent_Broken))), T8 => (False,
+ (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_4;
+
+ procedure object_declaration_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6 => (False,
(Hanging_1, (Anchored_1, T5, Ada_Indent_Broken),
+ (Anchored_1, T5, 2 * Ada_Indent_Broken))), T8 => (False, (Simple,
(Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_5;
+
+ procedure object_declaration_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T7 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T7 => (False,
(Simple, (Int, Ada_Indent_Broken))), T8 =>
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_6;
+
+ procedure object_declaration_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T8 => (False,
(Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_7;
+
+ procedure object_declaration_8
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6 => (False,
(Hanging_1, (Anchored_1, T5, Ada_Indent_Broken),
+ (Anchored_1, T5, 2 * Ada_Indent_Broken))), T7 => (False, (Simple,
(Int, Ada_Indent_Broken))), T8 => (False,
+ (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_8;
+
+ procedure object_declaration_9
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6 => (False,
(Hanging_1, (Anchored_1, T5, Ada_Indent_Broken),
+ (Anchored_1, T5, 2 * Ada_Indent_Broken))), T8 => (False, (Simple,
(Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_9;
+
+ procedure object_declaration_10
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T7 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T7 => (False,
(Simple, (Int, Ada_Indent_Broken))), T8 =>
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_10;
+
+ procedure object_declaration_11
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T8 => (False,
(Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_11;
+
+ procedure object_declaration_12
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T5 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ T7 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6
+ => (False, (Hanging_1, (Anchored_1, T5, Ada_Indent_Broken),
(Anchored_1, T5, 2 * Ada_Indent_Broken))), T7 =>
+ (False, (Simple, (Int, Ada_Indent_Broken))), T8 => (False, (Simple,
(Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_12;
+
+ procedure object_declaration_13
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T5 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6
+ => (False, (Hanging_1, (Anchored_1, T5, Ada_Indent_Broken),
(Anchored_1, T5, 2 * Ada_Indent_Broken))), T8 =>
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_13;
+
+ procedure object_declaration_14
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T5 : constant SAL.Peek_Type := 3;
+ T7 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T7
+ => (False, (Simple, (Int, Ada_Indent_Broken))), T8 => (False,
(Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_14;
+
+ procedure object_declaration_15
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T5 : constant SAL.Peek_Type := 3;
+ T8 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T8
+ => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_15;
+
+ procedure object_declaration_16
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6 =>
+ (False, (Hanging_1, (Anchored_1, T5, Ada_Indent_Broken), (Anchored_1,
T5, 2 * Ada_Indent_Broken))), T7 =>
+ (False, (Simple, (Int, Ada_Indent_Broken))), T8 => (False, (Simple,
(Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_16;
+
+ procedure object_declaration_17
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6 =>
+ (False, (Hanging_1, (Anchored_1, T5, Ada_Indent_Broken), (Anchored_1,
T5, 2 * Ada_Indent_Broken))), T8 =>
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_17;
+
+ procedure object_declaration_18
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T7 =>
+ (False, (Simple, (Int, Ada_Indent_Broken))), T8 => (False, (Simple,
(Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_18;
+
+ procedure object_declaration_19
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T8 =>
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_19;
+
+ procedure object_declaration_20
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6 => (False,
(Hanging_1, (Anchored_1, T5, Ada_Indent_Broken),
+ (Anchored_1, T5, 2 * Ada_Indent_Broken))), T7 => (False, (Simple,
(Int, Ada_Indent_Broken))), T8 => (False,
+ (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_20;
+
+ procedure object_declaration_21
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6 => (False,
(Hanging_1, (Anchored_1, T5, Ada_Indent_Broken),
+ (Anchored_1, T5, 2 * Ada_Indent_Broken))), T8 => (False, (Simple,
(Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_21;
+
+ procedure object_declaration_22
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T7 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T7 => (False,
(Simple, (Int, Ada_Indent_Broken))), T8 =>
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_22;
+
+ procedure object_declaration_23
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T8 => (False,
(Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_23;
+
+ procedure object_declaration_24
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6 => (False,
(Hanging_1, (Anchored_1, T5, Ada_Indent_Broken),
+ (Anchored_1, T5, 2 * Ada_Indent_Broken))), T7 => (False, (Simple,
(Int, Ada_Indent_Broken))), T8 => (False,
+ (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_24;
+
+ procedure object_declaration_25
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6 => (False,
(Hanging_1, (Anchored_1, T5, Ada_Indent_Broken),
+ (Anchored_1, T5, 2 * Ada_Indent_Broken))), T8 => (False, (Simple,
(Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_25;
+
+ procedure object_declaration_26
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T7 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T7 => (False,
(Simple, (Int, Ada_Indent_Broken))), T8 =>
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_26;
+
+ procedure object_declaration_27
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T8 => (False,
(Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_27;
+
+ procedure object_declaration_28
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T5 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ T7 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6
+ => (False, (Hanging_1, (Anchored_1, T5, Ada_Indent_Broken),
(Anchored_1, T5, 2 * Ada_Indent_Broken))), T7 =>
+ (False, (Simple, (Int, Ada_Indent_Broken))), T8 => (False, (Simple,
(Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_28;
+
+ procedure object_declaration_29
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T5 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6
+ => (False, (Hanging_1, (Anchored_1, T5, Ada_Indent_Broken),
(Anchored_1, T5, 2 * Ada_Indent_Broken))), T8 =>
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_29;
+
+ procedure object_declaration_30
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T5 : constant SAL.Peek_Type := 3;
+ T7 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T7
+ => (False, (Simple, (Int, Ada_Indent_Broken))), T8 => (False,
(Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_30;
+
+ procedure object_declaration_31
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T5 : constant SAL.Peek_Type := 3;
+ T8 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T8
+ => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_31;
+
+ procedure object_declaration_32
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6 =>
+ (False, (Hanging_1, (Anchored_1, T5, Ada_Indent_Broken), (Anchored_1,
T5, 2 * Ada_Indent_Broken))), T7 =>
+ (False, (Simple, (Int, Ada_Indent_Broken))), T8 => (False, (Simple,
(Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_32;
+
+ procedure object_declaration_33
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6 =>
+ (False, (Hanging_1, (Anchored_1, T5, Ada_Indent_Broken), (Anchored_1,
T5, 2 * Ada_Indent_Broken))), T8 =>
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_33;
+
+ procedure object_declaration_34
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T7 =>
+ (False, (Simple, (Int, Ada_Indent_Broken))), T8 => (False, (Simple,
(Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_34;
+
+ procedure object_declaration_35
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T8 =>
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_35;
+
+ procedure object_declaration_36
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6 => (False,
(Hanging_1, (Anchored_1, T5, Ada_Indent_Broken),
+ (Anchored_1, T5, 2 * Ada_Indent_Broken))), T7 => (False, (Simple,
(Int, Ada_Indent_Broken))), T8 => (False,
+ (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_36;
+
+ procedure object_declaration_37
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6 => (False,
(Hanging_1, (Anchored_1, T5, Ada_Indent_Broken),
+ (Anchored_1, T5, 2 * Ada_Indent_Broken))), T8 => (False, (Simple,
(Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_37;
+
+ procedure object_declaration_38
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T7 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T7 => (False,
(Simple, (Int, Ada_Indent_Broken))), T8 =>
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_38;
+
+ procedure object_declaration_39
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T8 => (False,
(Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_39;
+
+ procedure object_declaration_40
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6 => (False,
(Hanging_1, (Anchored_1, T5, Ada_Indent_Broken),
+ (Anchored_1, T5, 2 * Ada_Indent_Broken))), T7 => (False, (Simple,
(Int, Ada_Indent_Broken))), T8 => (False,
+ (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_40;
+
+ procedure object_declaration_41
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6 => (False,
(Hanging_1, (Anchored_1, T5, Ada_Indent_Broken),
+ (Anchored_1, T5, 2 * Ada_Indent_Broken))), T8 => (False, (Simple,
(Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_41;
+
+ procedure object_declaration_42
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T7 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T7 => (False,
(Simple, (Int, Ada_Indent_Broken))), T8 =>
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_42;
+
+ procedure object_declaration_43
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T8 => (False,
(Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_43;
+
+ procedure object_declaration_44
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T5 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ T7 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6
+ => (False, (Hanging_1, (Anchored_1, T5, Ada_Indent_Broken),
(Anchored_1, T5, 2 * Ada_Indent_Broken))), T7 =>
+ (False, (Simple, (Int, Ada_Indent_Broken))), T8 => (False, (Simple,
(Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_44;
+
+ procedure object_declaration_45
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T5 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6
+ => (False, (Hanging_1, (Anchored_1, T5, Ada_Indent_Broken),
(Anchored_1, T5, 2 * Ada_Indent_Broken))), T8 =>
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_45;
+
+ procedure object_declaration_46
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T5 : constant SAL.Peek_Type := 3;
+ T7 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T7
+ => (False, (Simple, (Int, Ada_Indent_Broken))), T8 => (False,
(Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_46;
+
+ procedure object_declaration_47
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T5 : constant SAL.Peek_Type := 3;
+ T8 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T8
+ => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_declaration_47;
+
+ procedure defining_identifier_list_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Name_Action (Parse_Data, Tree, Nonterm, 1);
+ when Face =>
+ null;
+ when Indent =>
+ null;
+ end case;
+ end defining_identifier_list_0;
+
+ procedure defining_identifier_list_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end defining_identifier_list_1;
+
+ procedure number_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T5, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Hanging_1,
+ (Anchored_1, T4, Ada_Indent_Broken), (Anchored_1, T4, 2 *
Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end number_declaration_0;
+
+ procedure enumeration_type_definition_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Anchored_0, T1, 1))), T3 => (False, (Simple, (Anchored_0, T1, 0)))));
+ end case;
+ end enumeration_type_definition_0;
+
+ procedure integer_type_definition_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (1 => (False, (Hanging_0,
(Label => None), (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end integer_type_definition_0;
+
+ procedure integer_type_definition_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (1 => (False, (Hanging_0,
(Label => None), (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end integer_type_definition_1;
+
+ procedure unconstrained_array_definition_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Anchored_0, T2, 1))), T4
=> (False, (Simple, (Anchored_0, T2, 0))),
+ T5 => (False, (Simple, (Label => None))), T6 => (False, (Simple,
(Label => None)))));
+ end case;
+ end unconstrained_array_definition_0;
+
+ procedure constrained_array_definition_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Anchored_0, T2, 1))), T4
=> (False, (Simple, (Anchored_0, T2, 0))),
+ T5 => (False, (Simple, (Label => None))), T6 => (False, (Simple,
(Label => None)))));
+ end case;
+ end constrained_array_definition_0;
+
+ procedure discrete_range_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (1 => (False, (Hanging_0,
(Label => None), (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end discrete_range_0;
+
+ procedure discrete_range_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (1 => (False, (Hanging_0,
(Label => None), (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end discrete_range_1;
+
+ procedure known_discriminant_part_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Anchored_0, T1, 1))), T3 => (False, (Simple, (Anchored_0, T1, 0)))));
+ end case;
+ end known_discriminant_part_0;
+
+ procedure discriminant_specification_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T4, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Hanging_1, (Anchored_1, T4,
Ada_Indent_Broken), (Anchored_1, T4, 2 *
+ Ada_Indent_Broken)))));
+ end case;
+ end discriminant_specification_0;
+
+ procedure discriminant_specification_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T4, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end discriminant_specification_1;
+
+ procedure discriminant_specification_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T4, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Hanging_1,
+ (Anchored_1, T4, Ada_Indent_Broken), (Anchored_1, T4, 2 *
Ada_Indent_Broken)))));
+ end case;
+ end discriminant_specification_2;
+
+ procedure discriminant_specification_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T4, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end discriminant_specification_3;
+
+ procedure discriminant_specification_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Hanging_1,
+ (Anchored_1, T3, Ada_Indent_Broken), (Anchored_1, T3, 2 *
Ada_Indent_Broken)))));
+ end case;
+ end discriminant_specification_4;
+
+ procedure discriminant_specification_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end discriminant_specification_5;
+
+ procedure record_definition_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Language, Ada_Indent_Record_1'Access, 83
+ & Integer (T1) & 0))), T2 => (True, (Simple, (Language,
Ada_Indent_Record_1'Access, 83 & Integer (T1) &
+ Ada_Indent)), (Simple, (Language, Ada_Indent_Record_1'Access, 83 &
Integer (T1) & Ada_Indent))), T3 => (False,
+ (Simple, (Language, Ada_Indent_Record_1'Access, 83 & Integer (T1) &
0))), T4 => (False, (Simple, (Label =>
+ None))), T5 => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end record_definition_0;
+
+ procedure record_definition_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Language, Ada_Indent_Record_1'Access, 83
+ & Integer (T1) & 0))), T2 => (True, (Simple, (Language,
Ada_Indent_Record_1'Access, 83 & Integer (T1) &
+ Ada_Indent)), (Simple, (Language, Ada_Indent_Record_1'Access, 83 &
Integer (T1) & Ada_Indent))), T3 => (False,
+ (Simple, (Language, Ada_Indent_Record_1'Access, 83 & Integer (T1) &
0))), T4 => (False, (Simple, (Label =>
+ None)))));
+ end case;
+ end record_definition_1;
+
+ procedure component_list_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ null;
+ end case;
+ end component_list_3;
+
+ procedure component_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Hanging_1,
+ (Anchored_1, T3, Ada_Indent_Broken), (Anchored_1, T3, 2 *
Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end component_declaration_0;
+
+ procedure component_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Hanging_1,
+ (Anchored_1, T3, Ada_Indent_Broken), (Anchored_1, T3, 2 *
Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end component_declaration_1;
+
+ procedure component_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end component_declaration_2;
+
+ procedure component_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end component_declaration_3;
+
+ procedure variant_list_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(1,
Invalid_Token_ID) & Index_ID'(2, Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ null;
+ end case;
+ end variant_list_1;
+
+ procedure variant_part_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T4, Invalid_Token_ID) &
+ Index_ID'(T7, Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Label => None))),
T4 => (False, (Simple, (Int,
+ Ada_Indent_When))), T5 => (False, (Simple, (Label => None))), T6 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end variant_part_0;
+
+ procedure variant_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 => (T1, Motion)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Int, Ada_Indent))), T4 =>
(True, (Simple, (Int, Ada_Indent)),
+ (Simple, (Int, Ada_Indent)))));
+ end case;
+ end variant_0;
+
+ procedure discrete_choice_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (1 => (False, (Hanging_0,
(Label => None), (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end discrete_choice_0;
+
+ procedure discrete_choice_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (1 => (False, (Hanging_0,
(Label => None), (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end discrete_choice_1;
+
+ procedure discrete_choice_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (1 => (False, (Hanging_0,
(Label => None), (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end discrete_choice_2;
+
+ procedure record_extension_part_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (True, (Simple,
(Label => None)), (Simple, (Language,
+ Ada_Indent_Record_1'Access, 83 & Integer (T2) & 0))), T2 => (False,
(Simple, (Label => None)))));
+ end case;
+ end record_extension_part_0;
+
+ procedure abstract_subprogram_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_Override), (T6,
+ Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Int,
Ada_Indent_Subprogram_Is))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Label => None))), T6 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end abstract_subprogram_declaration_0;
+
+ procedure abstract_subprogram_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_Override), (T6,
+ Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Int,
Ada_Indent_Subprogram_Is))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end abstract_subprogram_declaration_1;
+
+ procedure abstract_subprogram_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T2,
Statement_Override), (T6, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Label => None))), T3 => (False, (Simple,
+ (Int, Ada_Indent_Subprogram_Is))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple,
+ (Label => None))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end abstract_subprogram_declaration_2;
+
+ procedure abstract_subprogram_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T2,
Statement_Override), (T6, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Label => None))), T3 => (False, (Simple,
+ (Int, Ada_Indent_Subprogram_Is))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Simple,
+ (Int, Ada_Indent_Broken)))));
+ end case;
+ end abstract_subprogram_declaration_3;
+
+ procedure interface_list_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (1, 1, 2)));
+ when Indent =>
+ null;
+ end case;
+ end interface_list_0;
+
+ procedure interface_list_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (3, 1, 2)));
+ when Indent =>
+ null;
+ end case;
+ end interface_list_1;
+
+ procedure access_to_subprogram_definition_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Anchored_1, T1, Ada_Indent_Broken)))));
+ end case;
+ end access_to_subprogram_definition_0;
+
+ procedure access_to_subprogram_definition_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Anchored_1, T1, Ada_Indent_Broken)))));
+ end case;
+ end access_to_subprogram_definition_1;
+
+ procedure access_definition_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T4 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T4, 1, 2)));
+ when Indent =>
+ null;
+ end case;
+ end access_definition_0;
+
+ procedure access_definition_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T4 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T4, 1, 2)));
+ when Indent =>
+ null;
+ end case;
+ end access_definition_1;
+
+ procedure access_definition_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T4 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T4, 1, 2)));
+ when Indent =>
+ null;
+ end case;
+ end access_definition_2;
+
+ procedure access_definition_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T4 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T4, 1, 2)));
+ when Indent =>
+ null;
+ end case;
+ end access_definition_3;
+
+ procedure access_definition_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Label => None))), T4 =>
(False, (Simple, (Label => None))), T5 =>
+ (False, (Simple, (Anchored_1, T4, Ada_Indent_Broken)))));
+ end case;
+ end access_definition_4;
+
+ procedure access_definition_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T4 => (False, (Simple, (Label => None))), T5 =>
(False, (Simple, (Anchored_1, T4,
+ Ada_Indent_Broken)))));
+ end case;
+ end access_definition_5;
+
+ procedure access_definition_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Label => None))), T3 => (False, (Simple,
+ (Label => None))), T4 => (False, (Simple, (Label => None))), T5 =>
(False, (Simple, (Anchored_1, T4,
+ Ada_Indent_Broken)))));
+ end case;
+ end access_definition_6;
+
+ procedure access_definition_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T4 : constant SAL.Peek_Type := 2;
+ T5 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Label => None))), T4 => (False, (Simple,
+ (Label => None))), T5 => (False, (Simple, (Anchored_1, T4,
Ada_Indent_Broken)))));
+ end case;
+ end access_definition_7;
+
+ procedure access_definition_8
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Label => None))), T4 =>
(False, (Simple, (Label => None))), T5 =>
+ (False, (Simple, (Anchored_1, T4, Ada_Indent_Broken)))));
+ end case;
+ end access_definition_8;
+
+ procedure access_definition_9
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T4 => (False, (Simple, (Label => None))), T5 =>
(False, (Simple, (Anchored_1, T4,
+ Ada_Indent_Broken)))));
+ end case;
+ end access_definition_9;
+
+ procedure access_definition_10
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Label => None))), T3 => (False, (Simple,
+ (Label => None))), T4 => (False, (Simple, (Label => None))), T5 =>
(False, (Simple, (Anchored_1, T4,
+ Ada_Indent_Broken)))));
+ end case;
+ end access_definition_10;
+
+ procedure access_definition_11
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T4 : constant SAL.Peek_Type := 2;
+ T5 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Label => None))), T4 => (False, (Simple,
+ (Label => None))), T5 => (False, (Simple, (Anchored_1, T4,
Ada_Indent_Broken)))));
+ end case;
+ end access_definition_11;
+
+ procedure incomplete_type_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end incomplete_type_declaration_0;
+
+ procedure incomplete_type_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end incomplete_type_declaration_1;
+
+ procedure incomplete_type_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end incomplete_type_declaration_2;
+
+ procedure incomplete_type_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T6 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end incomplete_type_declaration_3;
+
+ function name_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Recover_Active);
+ begin
+ return Propagate_Name (Tree, Nonterm, Tokens, 1);
+ end name_0_check;
+
+ function name_3_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Recover_Active);
+ begin
+ return Propagate_Name (Tree, Nonterm, Tokens, 1);
+ end name_3_check;
+
+ procedure direct_name_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Mark_Action (Parse_Data, Tree, Nonterm, (1 => (1, Suffix)));
+ when Indent =>
+ null;
+ end case;
+ end direct_name_0;
+
+ function direct_name_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Recover_Active);
+ begin
+ return Propagate_Name (Tree, Nonterm, Tokens, 1);
+ end direct_name_0_check;
+
+ function direct_name_1_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Recover_Active);
+ begin
+ return Propagate_Name (Tree, Nonterm, Tokens, 1);
+ end direct_name_1_check;
+
+ procedure slice_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Anchored_0, T2, 1))), T4
=> (False, (Simple, (Anchored_0, T2,
+ 0)))));
+ end case;
+ end slice_0;
+
+ procedure selected_component_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Mark_Action (Parse_Data, Tree, Nonterm, ((T1, Prefix), (T3,
Suffix)));
+ when Indent =>
+ null;
+ end case;
+ end selected_component_0;
+
+ function selected_component_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Recover_Active);
+ T1 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ return Merge_Names (Tree, Nonterm, Tokens, T1, T3);
+ end selected_component_0_check;
+
+ procedure range_attribute_designator_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Hanging_0, (Anchored_0,
T2, 1), (Anchored_0, T2, 1 +
+ Ada_Indent_Broken))), T4 => (False, (Simple, (Anchored_0, T2, 0)))));
+ end case;
+ end range_attribute_designator_0;
+
+ procedure range_attribute_designator_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None)))));
+ end case;
+ end range_attribute_designator_1;
+
+ procedure aggregate_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (True, (Simple,
+ (Anchored_0, T1, 1)), (Simple, (Anchored_0, T1, 1))), T3 => (False,
(Simple, (Anchored_0, T1, 0)))));
+ end case;
+ end aggregate_4;
+
+ procedure aggregate_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (True, (Simple,
+ (Anchored_0, T1, 1)), (Simple, (Anchored_0, T1, 1))), T3 => (False,
(Simple, (Anchored_0, T1, 0)))));
+ end case;
+ end aggregate_5;
+
+ procedure aggregate_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (True, (Simple,
+ (Anchored_0, T1, 1)), (Simple, (Anchored_0, T1, 1))), T3 => (False,
(Simple, (Anchored_0, T1, 0)))));
+ end case;
+ end aggregate_6;
+
+ procedure record_aggregate_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (True, (Simple,
+ (Anchored_0, T1, 1)), (Simple, (Anchored_0, T1, 1))), T3 => (False,
(Simple, (Anchored_0, T1, 0)))));
+ end case;
+ end record_aggregate_0;
+
+ procedure record_component_association_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, ((False, (Simple, (Label
=> None))), (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end record_component_association_0;
+
+ procedure record_component_association_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (1 => (False, (Hanging_0,
(Label => None), (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end record_component_association_1;
+
+ procedure component_choice_list_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end component_choice_list_1;
+
+ procedure extension_aggregate_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_0, (Anchored_0, T1, 1), (Anchored_0, T1, 1 +
Ada_Indent_Broken))), T3 => (False, (Simple,
+ (Anchored_0, T1, 1))), T4 => (True, (Simple, (Anchored_0, T1, 1)),
(Simple, (Anchored_0, T1, 1))), T5 =>
+ (False, (Simple, (Anchored_0, T1, 0)))));
+ end case;
+ end extension_aggregate_0;
+
+ procedure expression_list_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (1 => (True, (Hanging_0,
(Label => None), (Int,
+ Ada_Indent_Broken)), (Hanging_0, (Label => None), (Int,
Ada_Indent_Broken)))));
+ end case;
+ end expression_list_0;
+
+ procedure expression_list_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (True, (Hanging_0, (Label => None), (Int,
Ada_Indent_Broken)), (Hanging_0, (Label =>
+ None), (Int, Ada_Indent_Broken)))));
+ end case;
+ end expression_list_1;
+
+ procedure positional_array_aggregate_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (True, (Simple,
+ (Anchored_0, T1, 1)), (Simple, (Anchored_0, T1, 1))), T3 => (False,
(Simple, (Anchored_0, T1, 0)))));
+ end case;
+ end positional_array_aggregate_0;
+
+ procedure positional_array_aggregate_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Anchored_0, T1, 1))), T3 => (False, (Simple, (Label => None))), T4
=> (False, (Simple, (Anchored_0, T1, 1))),
+ T5 => (False, (Simple, (Anchored_0, T1, 1 + Ada_Indent_Broken))), T6
=> (False, (Simple, (Anchored_0, T1,
+ 0)))));
+ end case;
+ end positional_array_aggregate_1;
+
+ procedure positional_array_aggregate_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Anchored_0, T1, 1))), T3 => (False, (Simple, (Label => None))), T4
=> (False, (Simple, (Anchored_0, T1, 1))),
+ T5 => (False, (Simple, (Anchored_0, T1, 1 + Ada_Indent_Broken))), T6
=> (False, (Simple, (Anchored_0, T1,
+ 0)))));
+ end case;
+ end positional_array_aggregate_2;
+
+ procedure positional_array_aggregate_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T6 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Anchored_0, T1, 1))), T6 => (False, (Simple, (Anchored_0, T1, 0)))));
+ end case;
+ end positional_array_aggregate_3;
+
+ procedure named_array_aggregate_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (True, (Simple,
+ (Anchored_0, T1, 1)), (Simple, (Anchored_0, T1, 1))), T3 => (False,
(Simple, (Anchored_0, T1, 0)))));
+ end case;
+ end named_array_aggregate_0;
+
+ procedure named_array_aggregate_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (True, (Simple,
+ (Anchored_0, T1, 1)), (Simple, (Anchored_0, T1, 1))), T3 => (False,
(Simple, (Anchored_0, T1, 0)))));
+ end case;
+ end named_array_aggregate_1;
+
+ procedure array_component_association_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, ((False, (Hanging_0,
(Label => None), (Int, Ada_Indent_Broken))),
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end array_component_association_0;
+
+ procedure record_delta_aggregate_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_0, (Anchored_0, T1, 1), (Anchored_0, T1, 1 +
Ada_Indent_Broken))), T3 => (False, (Simple,
+ (Anchored_0, T1, 1))), T4 => (False, (Simple, (Anchored_0, T1, 1))),
T5 => (True, (Simple, (Anchored_0, T1,
+ 1)), (Simple, (Anchored_0, T1, 1))), T6 => (False, (Simple,
(Anchored_0, T1, 0)))));
+ end case;
+ end record_delta_aggregate_0;
+
+ procedure array_delta_aggregate_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_0, (Anchored_0, T1, 1), (Anchored_0, T1, 1 +
Ada_Indent_Broken))), T3 => (False, (Simple,
+ (Anchored_0, T1, 1))), T4 => (False, (Simple, (Anchored_0, T1, 1))),
T5 => (True, (Simple, (Anchored_0, T1,
+ 1)), (Simple, (Anchored_0, T1, 1))), T6 => (False, (Simple,
(Anchored_0, T1, 0)))));
+ end case;
+ end array_delta_aggregate_0;
+
+ procedure array_delta_aggregate_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_0, (Anchored_0, T1, 1), (Anchored_0, T1, 1 +
Ada_Indent_Broken))), T3 => (False, (Simple,
+ (Anchored_0, T1, 1))), T4 => (False, (Simple, (Anchored_0, T1, 1))),
T5 => (True, (Simple, (Anchored_0, T1,
+ 1)), (Simple, (Anchored_0, T1, 1))), T6 => (False, (Simple,
(Anchored_0, T1, 0)))));
+ end case;
+ end array_delta_aggregate_1;
+
+ procedure iterated_element_association_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T5 => (False,
(Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end iterated_element_association_0;
+
+ procedure iterated_element_association_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T5 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end iterated_element_association_1;
+
+ procedure iterated_element_association_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T5 => (False,
(Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end iterated_element_association_2;
+
+ procedure iterated_element_association_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T5 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end iterated_element_association_3;
+
+ procedure membership_choice_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (1 => (False, (Hanging_0,
(Label => None), (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end membership_choice_0;
+
+ procedure membership_choice_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (1 => (False, (Hanging_0,
(Label => None), (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end membership_choice_1;
+
+ procedure primary_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (1, 3, 0)));
+ when Indent =>
+ null;
+ end case;
+ end primary_0;
+
+ procedure primary_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (1 => (False, (Simple,
(Language, Ada_Indent_Aggregate'Access,
+ Null_Args)))));
+ end case;
+ end primary_2;
+
+ procedure elsif_expression_item_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Motion), (T3,
Motion)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T3,
+ Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (True, (Simple,
+ (Int, Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken))), T3 =>
(False, (Simple, (Label => None))), T4
+ => (False, (Hanging_2, (Int, Ada_Indent), (Int,
Ada_Indent_Broken)))));
+ end case;
+ end elsif_expression_item_0;
+
+ procedure elsif_expression_list_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(1,
Invalid_Token_ID) & Index_ID'(2, Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ null;
+ end case;
+ end elsif_expression_list_1;
+
+ procedure if_expression_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Motion), (T3,
Motion), (T6, Motion)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T3, Invalid_Token_ID) &
+ Index_ID'(T5, Invalid_Token_ID) & Index_ID'(T6, Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (True,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken)),
(Simple, (Int, Ada_Indent_Broken))), T3 =>
+ (False, (Simple, (Label => None))), T4 => (False, (Hanging_2, (Int,
Ada_Indent), (Int, Ada_Indent_Broken))),
+ T5 => (False, (Simple, (Label => None))), T6 => (False, (Simple,
(Label => None))), T7 => (False, (Hanging_2,
+ (Int, Ada_Indent), (Int, Ada_Indent_Broken)))));
+ end case;
+ end if_expression_0;
+
+ procedure if_expression_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Motion), (T3,
Motion)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T3, Invalid_Token_ID) &
+ Index_ID'(T5, Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (True,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken)),
(Simple, (Int, Ada_Indent_Broken))), T3 =>
+ (False, (Simple, (Label => None))), T4 => (False, (Hanging_2, (Int,
Ada_Indent), (Int, Ada_Indent_Broken))),
+ T5 => (False, (Simple, (Label => None)))));
+ end case;
+ end if_expression_1;
+
+ procedure if_expression_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Motion), (T3,
Motion), (T6, Motion)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T3, Invalid_Token_ID) &
+ Index_ID'(T6, Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (True,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken)),
(Simple, (Int, Ada_Indent_Broken))), T3 =>
+ (False, (Simple, (Label => None))), T4 => (False, (Hanging_2, (Int,
Ada_Indent), (Int, Ada_Indent_Broken))),
+ T6 => (False, (Simple, (Label => None))), T7 => (False, (Hanging_2,
(Int, Ada_Indent), (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end if_expression_2;
+
+ procedure if_expression_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Motion), (T3,
Motion)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T3,
+ Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (True,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken)),
(Simple, (Int, Ada_Indent_Broken))), T3 =>
+ (False, (Simple, (Label => None))), T4 => (False, (Hanging_2, (Int,
Ada_Indent), (Int, Ada_Indent_Broken)))));
+ end case;
+ end if_expression_3;
+
+ procedure case_expression_alternative_list_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T3,
+ Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ null;
+ end case;
+ end case_expression_alternative_list_1;
+
+ procedure case_expression_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 => (T1, Motion)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T4,
+ Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (True,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken)),
(Simple, (Int, Ada_Indent_Broken))), T3 =>
+ (False, (Simple, (Label => None))), T4 => (False, (Simple, (Int,
Ada_Indent_When)))));
+ end case;
+ end case_expression_0;
+
+ procedure case_expression_alternative_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 => (T1, Motion)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Hanging_2, (Int,
+ Ada_Indent), (Int, Ada_Indent_Broken)))));
+ end case;
+ end case_expression_alternative_0;
+
+ procedure quantified_expression_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end quantified_expression_0;
+
+ procedure quantified_expression_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end quantified_expression_1;
+
+ procedure declare_expression_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Block, Ada_Indent))), T3 => (False, (Simple, (Label => None))), T4
=> (False, (Hanging_1, (Int, Ada_Indent),
+ (Int, Ada_Indent + Ada_Indent_Broken)))));
+ end case;
+ end declare_expression_0;
+
+ procedure declare_expression_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T3 => (False, (Simple,
+ (Label => None))), T4 => (False, (Hanging_1, (Int, Ada_Indent), (Int,
Ada_Indent + Ada_Indent_Broken)))));
+ end case;
+ end declare_expression_1;
+
+ procedure reduction_specification_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False,
(Hanging_0, (Label => None), (Int,
+ Ada_Indent_Broken))), T2 => (False, (Simple, (Label => None))), T3 =>
(False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken)))));
+ end case;
+ end reduction_specification_0;
+
+ procedure qualified_expression_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (1, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, ((False, (Simple, (Label
=> None))), (False, (Simple, (Anchored_1,
+ 1, Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 1,
Ada_Indent_Broken)))));
+ end case;
+ end qualified_expression_0;
+
+ procedure subtype_indication_paren_constraint_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 1, 2)));
+ when Indent =>
+ null;
+ end case;
+ end subtype_indication_paren_constraint_2;
+
+ procedure subtype_indication_paren_constraint_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 1, 2)));
+ when Indent =>
+ null;
+ end case;
+ end subtype_indication_paren_constraint_3;
+
+ procedure null_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ null;
+ end case;
+ end null_statement_0;
+
+ procedure label_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 0)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Int, Ada_Indent_Label))), T2 => (False,
+ (Simple, (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end label_0;
+
+ procedure assignment_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T3, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False,
(Hanging_0, (Label => None), (Int,
+ Ada_Indent_Broken))), T2 => (False, (Hanging_1, (Anchored_1, T1,
Ada_Indent_Broken), (Anchored_1, T1, 2 *
+ Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end assignment_statement_0;
+
+ procedure elsif_statement_item_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Motion), (T3,
Motion)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T3,
+ Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (True, (Simple,
+ (Int, Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken))), T3 =>
(False, (Simple, (Label => None))), T4
+ => (True, (Simple, (Block, Ada_Indent)), (Simple, (Int,
Ada_Indent)))));
+ end case;
+ end elsif_statement_item_0;
+
+ procedure if_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ T9 : constant SAL.Peek_Type := 9;
+ T10 : constant SAL.Peek_Type := 10;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T3, Motion), (T6, Motion), (T10,
+ Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T3, Invalid_Token_ID) &
+ Index_ID'(T5, 44) & Index_ID'(T6, Invalid_Token_ID) & Index_ID'(T10,
Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (True,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken)),
(Simple, (Int, Ada_Indent_Broken))), T3 =>
+ (False, (Simple, (Label => None))), T4 => (True, (Simple, (Block,
Ada_Indent)), (Simple, (Int, Ada_Indent))),
+ T5 => (False, (Simple, (Label => None))), T6 => (False, (Simple,
(Label => None))), T7 => (True, (Simple,
+ (Block, Ada_Indent)), (Simple, (Int, Ada_Indent))), T8 => (False,
(Simple, (Label => None))), T9 => (False,
+ (Simple, (Int, Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end if_statement_0;
+
+ procedure if_statement_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ T10 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T3, Motion), (T10, Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T3, Invalid_Token_ID) &
+ Index_ID'(T5, 44) & Index_ID'(T10, Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (True,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken)),
(Simple, (Int, Ada_Indent_Broken))), T3 =>
+ (False, (Simple, (Label => None))), T4 => (True, (Simple, (Block,
Ada_Indent)), (Simple, (Int, Ada_Indent))),
+ T5 => (False, (Simple, (Label => None))), T8 => (False, (Simple,
(Label => None))), T9 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end if_statement_1;
+
+ procedure if_statement_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ T10 : constant SAL.Peek_Type := 9;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T3, Motion), (T6, Motion), (T10,
+ Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T3, Invalid_Token_ID) &
+ Index_ID'(T6, Invalid_Token_ID) & Index_ID'(T10, Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (True,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken)),
(Simple, (Int, Ada_Indent_Broken))), T3 =>
+ (False, (Simple, (Label => None))), T4 => (True, (Simple, (Block,
Ada_Indent)), (Simple, (Int, Ada_Indent))),
+ T6 => (False, (Simple, (Label => None))), T7 => (True, (Simple,
(Block, Ada_Indent)), (Simple, (Int,
+ Ada_Indent))), T8 => (False, (Simple, (Label => None))), T9 =>
(False, (Simple, (Int, Ada_Indent_Broken))),
+ T10 => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end if_statement_2;
+
+ procedure if_statement_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ T10 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T3, Motion), (T10, Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T3, Invalid_Token_ID) &
+ Index_ID'(T10, Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (True,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken)),
(Simple, (Int, Ada_Indent_Broken))), T3 =>
+ (False, (Simple, (Label => None))), T4 => (True, (Simple, (Block,
Ada_Indent)), (Simple, (Int, Ada_Indent))),
+ T8 => (False, (Simple, (Label => None))), T9 => (False, (Simple,
(Int, Ada_Indent_Broken))), T10 => (False,
+ (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end if_statement_3;
+
+ procedure case_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T4, 63) & Index_ID'(T7,
+ Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T3
=> (False, (Simple, (Label => None))), T4
+ => (True, (Simple, (Int, Ada_Indent_When)), (Simple, (Int,
Ada_Indent_When))), T5 => (False, (Simple, (Label
+ => None))), T6 => (False, (Simple, (Int, Ada_Indent_Broken))), T7 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end case_statement_0;
+
+ procedure case_statement_alternative_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 => (T1, Motion)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (True, (Simple, (Block,
+ Ada_Indent)), (Simple, (Int, Ada_Indent)))));
+ end case;
+ end case_statement_alternative_0;
+
+ procedure loop_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_Override), (T3, Motion),
+ (T8, Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T2,
Invalid_Token_ID) & Index_ID'(T3, Invalid_Token_ID) &
+ Index_ID'(T8, Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Int, Ada_Indent_Label))), T2 => (False,
+ (Simple, (Label => None))), T3 => (False, (Simple, (Label => None))),
T4 => (True, (Simple, (Block,
+ Ada_Indent)), (Simple, (Int, Ada_Indent))), T5 => (False, (Simple,
(Label => None))), T6 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end loop_statement_0;
+
+ function loop_statement_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T1 : constant SAL.Peek_Type := 1;
+ T7 : constant SAL.Peek_Type := 7;
+ begin
+ return Match_Names (Tree, Tokens, T1, T7, End_Names_Optional);
+ end loop_statement_0_check;
+
+ procedure loop_statement_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T3, Motion), (T8, Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T3,
Invalid_Token_ID) & Index_ID'(T8,
+ Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Int, Ada_Indent_Label))), T3 => (False,
+ (Simple, (Label => None))), T4 => (True, (Simple, (Block,
Ada_Indent)), (Simple, (Int, Ada_Indent))), T5 =>
+ (False, (Simple, (Label => None))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken))), T7 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end loop_statement_1;
+
+ function loop_statement_1_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T1 : constant SAL.Peek_Type := 1;
+ T7 : constant SAL.Peek_Type := 6;
+ begin
+ return Match_Names (Tree, Tokens, T1, T7, End_Names_Optional);
+ end loop_statement_1_check;
+
+ procedure iteration_scheme_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (True, (Simple,
+ (Int, Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end iteration_scheme_0;
+
+ procedure iteration_scheme_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (True, (Simple,
+ (Int, Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end iteration_scheme_1;
+
+ procedure iteration_scheme_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (True, (Simple,
+ (Int, Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end iteration_scheme_2;
+
+ procedure iteration_scheme_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (True, (Simple, (Int, Ada_Indent_Broken)),
(Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end iteration_scheme_3;
+
+ procedure iteration_scheme_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Label => None))), T3 => (True, (Simple,
+ (Int, Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end iteration_scheme_4;
+
+ procedure iteration_scheme_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Anchored_0, T1, 1))), T4
=> (False, (Simple, (Anchored_0, T1, 0))),
+ T5 => (False, (Simple, (Label => None))), T6 => (True, (Simple, (Int,
Ada_Indent_Broken)), (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end iteration_scheme_5;
+
+ procedure iteration_scheme_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T5 : constant SAL.Peek_Type := 2;
+ T6 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T5 => (False, (Simple,
+ (Label => None))), T6 => (True, (Simple, (Int, Ada_Indent_Broken)),
(Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end iteration_scheme_6;
+
+ procedure iteration_scheme_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Anchored_0, T1, 1))), T4
=> (False, (Simple, (Anchored_0, T1, 0))),
+ T5 => (False, (Simple, (Label => None))), T6 => (True, (Simple, (Int,
Ada_Indent_Broken)), (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end iteration_scheme_7;
+
+ procedure iteration_scheme_8
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T5 : constant SAL.Peek_Type := 2;
+ T6 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T5 => (False, (Simple,
+ (Label => None))), T6 => (True, (Simple, (Int, Ada_Indent_Broken)),
(Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end iteration_scheme_8;
+
+ procedure chunk_specification_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (1 => (False, (Hanging_0,
(Label => None), (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end chunk_specification_0;
+
+ procedure chunk_specification_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end chunk_specification_1;
+
+ function label_opt_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Recover_Active);
+ T1 : constant SAL.Peek_Type := 1;
+ begin
+ return Propagate_Name (Tree, Nonterm, Tokens, T1);
+ end label_opt_0_check;
+
+ procedure block_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_Override), (T4,
+ Statement_Override), (T8, Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T2, Invalid_Token_ID) &
+ Index_ID'(T4, Invalid_Token_ID) & Index_ID'(T5, 63) & Index_ID'(T8,
Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Int, Ada_Indent_Label))), T2 => (False,
+ (Simple, (Label => None))), T3 => (True, (Simple, (Block,
Ada_Indent)), (Simple, (Int, Ada_Indent))), T4 =>
+ (False, (Simple, (Label => None))), T5 => (True, (Simple, (Block,
Ada_Indent)), (Simple, (Int, Ada_Indent))),
+ T6 => (False, (Simple, (Label => None))), T7 => (False, (Simple,
(Int, Ada_Indent_Broken))), T8 => (False,
+ (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end block_statement_0;
+
+ function block_statement_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T1 : constant SAL.Peek_Type := 1;
+ T7 : constant SAL.Peek_Type := 7;
+ begin
+ return Match_Names (Tree, Tokens, T1, T7, End_Names_Optional);
+ end block_statement_0_check;
+
+ procedure block_statement_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T4 : constant SAL.Peek_Type := 2;
+ T5 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ T7 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T4, Statement_Override), (T8,
+ Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T4, Invalid_Token_ID) &
+ Index_ID'(T5, 63) & Index_ID'(T8, Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Int, Ada_Indent_Label))), T4 => (False,
+ (Simple, (Label => None))), T5 => (True, (Simple, (Block,
Ada_Indent)), (Simple, (Int, Ada_Indent))), T6 =>
+ (False, (Simple, (Label => None))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple,
+ (Int, Ada_Indent_Broken)))));
+ end case;
+ end block_statement_1;
+
+ function block_statement_1_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T1 : constant SAL.Peek_Type := 1;
+ T7 : constant SAL.Peek_Type := 5;
+ begin
+ return Match_Names (Tree, Tokens, T1, T7, End_Names_Optional);
+ end block_statement_1_check;
+
+ procedure statement_AND_list_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, -Ada_Indent))), T3 => (False, (Simple, (Label => None)))));
+ end case;
+ end statement_AND_list_1;
+
+ procedure parallel_block_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (True, (Simple, (Block, Ada_Indent)),
(Simple, (Int, Ada_Indent))), T4 => (False,
+ (Simple, (Label => None))), T5 => (True, (Simple, (Block,
Ada_Indent)), (Simple, (Int, Ada_Indent))), T6 =>
+ (False, (Simple, (Label => None))), T7 => (False, (Simple, (Label =>
None))), T8 => (False, (Simple, (Label =>
+ None)))));
+ end case;
+ end parallel_block_statement_0;
+
+ procedure exit_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T5, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Label => None))), T4 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end exit_statement_0;
+
+ procedure exit_statement_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T5 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T5, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end exit_statement_1;
+
+ procedure exit_statement_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T5, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T3 => (False, (Simple,
+ (Label => None))), T4 => (False, (Simple, (Int, Ada_Indent_Broken))),
T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end exit_statement_2;
+
+ procedure exit_statement_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T5 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T5, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T5 => (False, (Simple,
+ (Int, Ada_Indent_Broken)))));
+ end case;
+ end exit_statement_3;
+
+ procedure goto_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T3, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 0)));
+ when Indent =>
+ null;
+ end case;
+ end goto_statement_0;
+
+ procedure subprogram_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_Override), (T4,
+ Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ null;
+ end case;
+ end subprogram_declaration_0;
+
+ procedure subprogram_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_Override), (T4,
+ Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ null;
+ end case;
+ end subprogram_declaration_1;
+
+ procedure subprogram_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T4 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T2,
Statement_Override), (T4, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ null;
+ end case;
+ end subprogram_declaration_2;
+
+ procedure subprogram_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T4 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T2,
Statement_Override), (T4, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ null;
+ end case;
+ end subprogram_declaration_3;
+
+ function subprogram_specification_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Recover_Active);
+ begin
+ return Propagate_Name (Tree, Nonterm, Tokens, 1);
+ end subprogram_specification_0_check;
+
+ function subprogram_specification_1_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Recover_Active);
+ begin
+ return Propagate_Name (Tree, Nonterm, Tokens, 1);
+ end subprogram_specification_1_check;
+
+ procedure procedure_specification_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 => (T1,
Statement_Start)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 1, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (True,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken)),
(Simple, (Label => None))), T3 => (True,
+ (Simple, (Int, Ada_Indent_Broken)), (Simple, (Label => None)))));
+ end case;
+ end procedure_specification_0;
+
+ function procedure_specification_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Recover_Active);
+ T2 : constant SAL.Peek_Type := 2;
+ begin
+ return Propagate_Name (Tree, Nonterm, Tokens, T2);
+ end procedure_specification_0_check;
+
+ procedure function_specification_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 => (T1,
Statement_Start)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 1, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T3
=> (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end function_specification_0;
+
+ function function_specification_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Recover_Active);
+ T2 : constant SAL.Peek_Type := 2;
+ begin
+ return Propagate_Name (Tree, Nonterm, Tokens, T2);
+ end function_specification_0_check;
+
+ procedure result_profile_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Anchored_1, T1, Ada_Indent_Broken))), T3 => (False, (Hanging_0,
(Anchored_1, T1, Ada_Indent_Broken),
+ (Anchored_1, T1, Ada_Indent_Broken)))));
+ end case;
+ end result_profile_0;
+
+ procedure result_profile_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T3 => (False,
+ (Hanging_0, (Anchored_1, T1, Ada_Indent_Broken), (Anchored_1, T1,
Ada_Indent_Broken)))));
+ end case;
+ end result_profile_1;
+
+ procedure result_profile_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Anchored_1, T1, Ada_Indent_Broken)))));
+ end case;
+ end result_profile_2;
+
+ procedure parameter_and_result_profile_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, ((False, (Simple, (Label
=> None))), (False, (Simple, (Language,
+ Ada_Indent_Return_0'Access, 1 & 0)))));
+ end case;
+ end parameter_and_result_profile_0;
+
+ procedure formal_part_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 => (T1, Misc)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Anchored_0, T1, 1))), T3 => (False, (Simple, (Anchored_0, T1, 0)))));
+ end case;
+ end formal_part_0;
+
+ procedure parameter_specification_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T6, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Hanging_0,
+ (Anchored_1, T2, Ada_Indent_Broken), (Anchored_1, T2,
Ada_Indent_Broken))), T7 => (False, (Hanging_1,
+ (Anchored_1, T2, Ada_Indent_Broken), (Anchored_1, T2, 2 *
Ada_Indent_Broken)))));
+ end case;
+ end parameter_specification_0;
+
+ procedure parameter_specification_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T6, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Hanging_0,
+ (Anchored_1, T2, Ada_Indent_Broken), (Anchored_1, T2,
Ada_Indent_Broken)))));
+ end case;
+ end parameter_specification_1;
+
+ procedure parameter_specification_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T6, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Hanging_0, (Anchored_1, T2,
Ada_Indent_Broken), (Anchored_1, T2,
+ Ada_Indent_Broken))), T7 => (False, (Hanging_1, (Anchored_1, T2,
Ada_Indent_Broken), (Anchored_1, T2, 2 *
+ Ada_Indent_Broken)))));
+ end case;
+ end parameter_specification_2;
+
+ procedure parameter_specification_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T6, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Hanging_0, (Anchored_1, T2,
Ada_Indent_Broken), (Anchored_1, T2,
+ Ada_Indent_Broken)))));
+ end case;
+ end parameter_specification_3;
+
+ procedure parameter_specification_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T6, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Hanging_0, (Anchored_1, T2,
Ada_Indent_Broken), (Anchored_1, T2,
+ Ada_Indent_Broken))), T7 => (False, (Hanging_1, (Anchored_1, T2,
Ada_Indent_Broken), (Anchored_1, T2, 2 *
+ Ada_Indent_Broken)))));
+ end case;
+ end parameter_specification_4;
+
+ procedure parameter_specification_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T6, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Hanging_0, (Anchored_1, T2,
Ada_Indent_Broken), (Anchored_1, T2,
+ Ada_Indent_Broken)))));
+ end case;
+ end parameter_specification_5;
+
+ procedure parameter_specification_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ T7 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T6, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Hanging_0,
+ (Anchored_1, T2, Ada_Indent_Broken), (Anchored_1, T2,
Ada_Indent_Broken))), T7 => (False, (Hanging_1,
+ (Anchored_1, T2, Ada_Indent_Broken), (Anchored_1, T2, 2 *
Ada_Indent_Broken)))));
+ end case;
+ end parameter_specification_6;
+
+ procedure parameter_specification_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T6, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Hanging_0,
+ (Anchored_1, T2, Ada_Indent_Broken), (Anchored_1, T2,
Ada_Indent_Broken)))));
+ end case;
+ end parameter_specification_7;
+
+ procedure parameter_specification_8
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end parameter_specification_8;
+
+ procedure parameter_specification_9
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end parameter_specification_9;
+
+ function name_opt_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Recover_Active);
+ T1 : constant SAL.Peek_Type := 1;
+ begin
+ return Propagate_Name (Tree, Nonterm, Tokens, T1);
+ end name_opt_0_check;
+
+ procedure subprogram_body_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ T9 : constant SAL.Peek_Type := 9;
+ T10 : constant SAL.Peek_Type := 10;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_Override), (T4, Motion),
+ (T6, Motion), (T10, Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T2, Invalid_Token_ID) &
+ Index_ID'(T4, Invalid_Token_ID) & Index_ID'(T6, Invalid_Token_ID) &
Index_ID'(T7, 63) & Index_ID'(T10,
+ Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T9, 1, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Label => None))), T4 =>
(False, (Simple, (Label => None))), T5 =>
+ (True, (Simple, (Block, Ada_Indent)), (Simple, (Int, Ada_Indent))),
T6 => (False, (Simple, (Label => None))),
+ T7 => (True, (Simple, (Block, Ada_Indent)), (Simple, (Int,
Ada_Indent))), T8 => (False, (Simple, (Label =>
+ None))), T9 => (False, (Simple, (Int, Ada_Indent_Broken))), T10 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end subprogram_body_0;
+
+ function subprogram_body_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T2 : constant SAL.Peek_Type := 2;
+ T9 : constant SAL.Peek_Type := 9;
+ begin
+ return Match_Names (Tree, Tokens, T2, T9, End_Names_Optional);
+ end subprogram_body_0_check;
+
+ procedure subprogram_body_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ T10 : constant SAL.Peek_Type := 9;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_Override), (T4, Motion),
+ (T6, Motion), (T10, Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T2, Invalid_Token_ID) &
+ Index_ID'(T4, Invalid_Token_ID) & Index_ID'(T6, Invalid_Token_ID) &
Index_ID'(T7, 63) & Index_ID'(T10,
+ Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T9, 1, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T4 => (False, (Simple, (Label => None))), T5 =>
(True, (Simple, (Block, Ada_Indent)),
+ (Simple, (Int, Ada_Indent))), T6 => (False, (Simple, (Label =>
None))), T7 => (True, (Simple, (Block,
+ Ada_Indent)), (Simple, (Int, Ada_Indent))), T8 => (False, (Simple,
(Label => None))), T9 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end subprogram_body_1;
+
+ function subprogram_body_1_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T2 : constant SAL.Peek_Type := 2;
+ T9 : constant SAL.Peek_Type := 8;
+ begin
+ return Match_Names (Tree, Tokens, T2, T9, End_Names_Optional);
+ end subprogram_body_1_check;
+
+ procedure subprogram_body_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ T10 : constant SAL.Peek_Type := 9;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T2,
Statement_Override), (T4, Motion), (T6, Motion), (T10,
+ Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T2,
Invalid_Token_ID) & Index_ID'(T4, Invalid_Token_ID) &
+ Index_ID'(T6, Invalid_Token_ID) & Index_ID'(T7, 63) & Index_ID'(T10,
Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T9, 1, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Label => None))), T3 => (False, (Simple,
+ (Label => None))), T4 => (False, (Simple, (Label => None))), T5 =>
(True, (Simple, (Block, Ada_Indent)),
+ (Simple, (Int, Ada_Indent))), T6 => (False, (Simple, (Label =>
None))), T7 => (True, (Simple, (Block,
+ Ada_Indent)), (Simple, (Int, Ada_Indent))), T8 => (False, (Simple,
(Label => None))), T9 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end subprogram_body_2;
+
+ function subprogram_body_2_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T2 : constant SAL.Peek_Type := 1;
+ T9 : constant SAL.Peek_Type := 8;
+ begin
+ return Match_Names (Tree, Tokens, T2, T9, End_Names_Optional);
+ end subprogram_body_2_check;
+
+ procedure subprogram_body_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T4 : constant SAL.Peek_Type := 2;
+ T5 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ T7 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ T10 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T2,
Statement_Override), (T4, Motion), (T6, Motion), (T10,
+ Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T2,
Invalid_Token_ID) & Index_ID'(T4, Invalid_Token_ID) &
+ Index_ID'(T6, Invalid_Token_ID) & Index_ID'(T7, 63) & Index_ID'(T10,
Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T9, 1, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Label => None))), T4 => (False, (Simple,
+ (Label => None))), T5 => (True, (Simple, (Block, Ada_Indent)),
(Simple, (Int, Ada_Indent))), T6 => (False,
+ (Simple, (Label => None))), T7 => (True, (Simple, (Block,
Ada_Indent)), (Simple, (Int, Ada_Indent))), T8 =>
+ (False, (Simple, (Label => None))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T10 => (False, (Simple,
+ (Int, Ada_Indent_Broken)))));
+ end case;
+ end subprogram_body_3;
+
+ function subprogram_body_3_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T2 : constant SAL.Peek_Type := 1;
+ T9 : constant SAL.Peek_Type := 7;
+ begin
+ return Match_Names (Tree, Tokens, T2, T9, End_Names_Optional);
+ end subprogram_body_3_check;
+
+ procedure procedure_call_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False,
(Hanging_0, (Label => None), (Int,
+ Ada_Indent_Broken))), T2 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end procedure_call_statement_0;
+
+ procedure function_call_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, ((False, (Simple, (Label
=> None))), (False, (Simple, (Anchored_1,
+ 1, Ada_Indent_Broken)))));
+ end case;
+ end function_call_0;
+
+ procedure actual_parameter_part_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (True, (Simple,
+ (Anchored_0, T1, 1)), (Simple, (Anchored_0, T1, 1))), T3 => (False,
(Simple, (Anchored_0, T1, 0)))));
+ end case;
+ end actual_parameter_part_0;
+
+ procedure actual_parameter_part_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (True, (Simple,
+ (Anchored_0, T1, 1)), (Simple, (Anchored_0, T1, 1))), T3 => (False,
(Simple, (Anchored_0, T1, 0)))));
+ end case;
+ end actual_parameter_part_1;
+
+ procedure actual_parameter_part_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (True, (Simple,
+ (Anchored_0, T1, 1)), (Simple, (Anchored_0, T1, 1))), T3 => (False,
(Simple, (Anchored_0, T1, 0)))));
+ end case;
+ end actual_parameter_part_2;
+
+ procedure actual_parameter_part_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (True, (Simple,
+ (Anchored_0, T1, 1)), (Simple, (Anchored_0, T1, 1))), T3 => (False,
(Simple, (Anchored_0, T1, 0)))));
+ end case;
+ end actual_parameter_part_3;
+
+ procedure assoc_expression_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_1, (Anchored_1, T1, Ada_Indent_Broken), (Anchored_1, T1, 2 *
Ada_Indent_Broken)))));
+ end case;
+ end assoc_expression_0;
+
+ procedure parameter_association_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, ((False, (Simple, (Label
=> None))), (False, (Simple, (Int,
+ Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end parameter_association_0;
+
+ procedure parameter_association_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (1 => (False, (Hanging_0,
(Label => None), (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end parameter_association_1;
+
+ procedure simple_return_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T3, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end simple_return_statement_0;
+
+ procedure simple_return_statement_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T3, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T3 => (False, (Simple,
+ (Int, Ada_Indent_Broken)))));
+ end case;
+ end simple_return_statement_1;
+
+ procedure extended_return_object_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Int, Ada_Indent_Broken))),
T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Hanging_1,
+ (Anchored_1, T5, Ada_Indent_Broken), (Anchored_1, T5, 2 *
Ada_Indent_Broken)))));
+ end case;
+ end extended_return_object_declaration_0;
+
+ procedure extended_return_object_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Int, Ada_Indent_Broken))),
T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end extended_return_object_declaration_1;
+
+ procedure extended_return_object_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Int, Ada_Indent_Broken))),
T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Hanging_1, (Anchored_1, T5,
Ada_Indent_Broken), (Anchored_1, T5, 2 *
+ Ada_Indent_Broken)))));
+ end case;
+ end extended_return_object_declaration_2;
+
+ procedure extended_return_object_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Int, Ada_Indent_Broken))),
T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end extended_return_object_declaration_3;
+
+ procedure extended_return_object_declaration_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T4 => (False, (Simple, (Int, Ada_Indent_Broken))),
T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Hanging_1, (Anchored_1, T5,
Ada_Indent_Broken), (Anchored_1, T5, 2 *
+ Ada_Indent_Broken)))));
+ end case;
+ end extended_return_object_declaration_4;
+
+ procedure extended_return_object_declaration_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T4 => (False, (Simple, (Int, Ada_Indent_Broken))),
T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end extended_return_object_declaration_5;
+
+ procedure extended_return_object_declaration_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T5 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T5 => (False, (Simple, (Int, Ada_Indent_Broken))),
T6 => (False, (Hanging_1, (Anchored_1,
+ T5, Ada_Indent_Broken), (Anchored_1, T5, 2 * Ada_Indent_Broken)))));
+ end case;
+ end extended_return_object_declaration_6;
+
+ procedure extended_return_object_declaration_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T5 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end extended_return_object_declaration_7;
+
+ procedure extended_return_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T3, Motion), (T7, Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T3, Invalid_Token_ID) &
+ Index_ID'(T4, 63) & Index_ID'(T7, Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (True, (Simple,
(Label => None)), (Simple, (Int,
+ Ada_Indent))), T2 => (False, (Simple, (Int, Ada_Indent_Broken))), T3
=> (False, (Simple, (Label => None))), T4
+ => (True, (Simple, (Block, Ada_Indent)), (Simple, (Int,
Ada_Indent))), T5 => (False, (Simple, (Label =>
+ None))), T6 => (False, (Simple, (Int, Ada_Indent_Broken))), T7 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end extended_return_statement_0;
+
+ procedure extended_return_statement_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T7 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T7,
+ Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (True, (Simple,
(Label => None)), (Simple, (Int,
+ Ada_Indent))), T2 => (False, (Simple, (Int, Ada_Indent_Broken))), T7
=> (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end extended_return_statement_1;
+
+ procedure null_procedure_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_Override), (T6,
+ Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Int,
Ada_Indent_Subprogram_Is))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Label => None))), T6 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end null_procedure_declaration_0;
+
+ procedure null_procedure_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_Override), (T6,
+ Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Int,
Ada_Indent_Subprogram_Is))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end null_procedure_declaration_1;
+
+ procedure null_procedure_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T2,
Statement_Override), (T6, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Label => None))), T3 => (False, (Simple,
+ (Int, Ada_Indent_Subprogram_Is))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple,
+ (Label => None))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end null_procedure_declaration_2;
+
+ procedure null_procedure_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T2,
Statement_Override), (T6, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Label => None))), T3 => (False, (Simple,
+ (Int, Ada_Indent_Subprogram_Is))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Simple,
+ (Int, Ada_Indent_Broken)))));
+ end case;
+ end null_procedure_declaration_3;
+
+ procedure expression_function_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_Override), (T6,
+ Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Int,
Ada_Indent_Subprogram_Is))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Label => None))), T6 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end expression_function_declaration_0;
+
+ procedure expression_function_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_Override), (T6,
+ Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Int,
Ada_Indent_Subprogram_Is))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end expression_function_declaration_1;
+
+ procedure expression_function_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T2,
Statement_Override), (T6, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Label => None))), T3 => (False, (Simple,
+ (Int, Ada_Indent_Subprogram_Is))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple,
+ (Label => None))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end expression_function_declaration_2;
+
+ procedure expression_function_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T2,
Statement_Override), (T6, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Label => None))), T3 => (False, (Simple,
+ (Int, Ada_Indent_Subprogram_Is))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Simple,
+ (Int, Ada_Indent_Broken)))));
+ end case;
+ end expression_function_declaration_3;
+
+ procedure package_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T2,
+ Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ null;
+ end case;
+ end package_declaration_0;
+
+ procedure package_specification_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ T9 : constant SAL.Peek_Type := 9;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T4, Motion), (T6, Motion)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T4, Invalid_Token_ID) &
+ Index_ID'(T6, Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T2, 1, 1), (T9, 1,
1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T3
=> (False, (Simple, (Label => None))), T4
+ => (False, (Simple, (Label => None))), T5 => (True, (Simple, (Block,
Ada_Indent)), (Simple, (Int,
+ Ada_Indent))), T6 => (False, (Simple, (Label => None))), T7 => (True,
(Simple, (Block, Ada_Indent)), (Simple,
+ (Int, Ada_Indent))), T8 => (False, (Simple, (Label => None))), T9 =>
(False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken)))));
+ end case;
+ end package_specification_0;
+
+ function package_specification_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T2 : constant SAL.Peek_Type := 2;
+ T9 : constant SAL.Peek_Type := 9;
+ begin
+ return Match_Names (Tree, Tokens, T2, T9, End_Names_Optional);
+ end package_specification_0_check;
+
+ procedure package_specification_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T4, Motion), (T6, Motion)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T4, Invalid_Token_ID) &
+ Index_ID'(T6, Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T2, 1, 1), (T9, 1,
1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T3
=> (False, (Simple, (Label => None))), T4
+ => (False, (Simple, (Label => None))), T5 => (True, (Simple, (Block,
Ada_Indent)), (Simple, (Int,
+ Ada_Indent))), T6 => (False, (Simple, (Label => None))), T8 =>
(False, (Simple, (Label => None))), T9 =>
+ (False, (Hanging_2, (Int, Ada_Indent_Broken), (Int,
Ada_Indent_Broken)))));
+ end case;
+ end package_specification_1;
+
+ function package_specification_1_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T2 : constant SAL.Peek_Type := 2;
+ T9 : constant SAL.Peek_Type := 8;
+ begin
+ return Match_Names (Tree, Tokens, T2, T9, End_Names_Optional);
+ end package_specification_1_check;
+
+ procedure package_specification_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T4, Motion)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T4,
+ Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T2, 1, 1), (T9, 1,
1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T3
=> (False, (Simple, (Label => None))), T4
+ => (False, (Simple, (Label => None))), T5 => (True, (Simple, (Block,
Ada_Indent)), (Simple, (Int,
+ Ada_Indent))), T8 => (False, (Simple, (Label => None))), T9 =>
(False, (Hanging_2, (Int, Ada_Indent_Broken),
+ (Int, Ada_Indent_Broken)))));
+ end case;
+ end package_specification_2;
+
+ function package_specification_2_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T2 : constant SAL.Peek_Type := 2;
+ T9 : constant SAL.Peek_Type := 7;
+ begin
+ return Match_Names (Tree, Tokens, T2, T9, End_Names_Optional);
+ end package_specification_2_check;
+
+ procedure package_specification_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T4, Motion), (T6, Motion)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T4, Invalid_Token_ID) &
+ Index_ID'(T6, Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T2, 1, 1), (T9, 1,
1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T3
=> (False, (Simple, (Label => None))), T4
+ => (False, (Simple, (Label => None))), T6 => (False, (Simple, (Label
=> None))), T7 => (True, (Simple, (Block,
+ Ada_Indent)), (Simple, (Int, Ada_Indent))), T8 => (False, (Simple,
(Label => None))), T9 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken)))));
+ end case;
+ end package_specification_3;
+
+ function package_specification_3_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T2 : constant SAL.Peek_Type := 2;
+ T9 : constant SAL.Peek_Type := 8;
+ begin
+ return Match_Names (Tree, Tokens, T2, T9, End_Names_Optional);
+ end package_specification_3_check;
+
+ procedure package_specification_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T4, Motion), (T6, Motion)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T4, Invalid_Token_ID) &
+ Index_ID'(T6, Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T2, 1, 1), (T9, 1,
1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T3
=> (False, (Simple, (Label => None))), T4
+ => (False, (Simple, (Label => None))), T6 => (False, (Simple, (Label
=> None))), T8 => (False, (Simple, (Label
+ => None))), T9 => (False, (Hanging_2, (Int, Ada_Indent_Broken), (Int,
Ada_Indent_Broken)))));
+ end case;
+ end package_specification_4;
+
+ function package_specification_4_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T2 : constant SAL.Peek_Type := 2;
+ T9 : constant SAL.Peek_Type := 7;
+ begin
+ return Match_Names (Tree, Tokens, T2, T9, End_Names_Optional);
+ end package_specification_4_check;
+
+ procedure package_specification_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T4, Motion)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T4,
+ Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T2, 1, 1), (T9, 1,
1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T3
=> (False, (Simple, (Label => None))), T4
+ => (False, (Simple, (Label => None))), T8 => (False, (Simple, (Label
=> None))), T9 => (False, (Hanging_2,
+ (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken)))));
+ end case;
+ end package_specification_5;
+
+ function package_specification_5_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T2 : constant SAL.Peek_Type := 2;
+ T9 : constant SAL.Peek_Type := 6;
+ begin
+ return Match_Names (Tree, Tokens, T2, T9, End_Names_Optional);
+ end package_specification_5_check;
+
+ procedure package_specification_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T4, Motion), (T6, Motion)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T4, Invalid_Token_ID) &
+ Index_ID'(T6, Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T2, 1, 1), (T9, 1,
1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T4
=> (False, (Simple, (Label => None))), T5
+ => (True, (Simple, (Block, Ada_Indent)), (Simple, (Int,
Ada_Indent))), T6 => (False, (Simple, (Label =>
+ None))), T7 => (True, (Simple, (Block, Ada_Indent)), (Simple, (Int,
Ada_Indent))), T8 => (False, (Simple,
+ (Label => None))), T9 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken)))));
+ end case;
+ end package_specification_6;
+
+ function package_specification_6_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T2 : constant SAL.Peek_Type := 2;
+ T9 : constant SAL.Peek_Type := 8;
+ begin
+ return Match_Names (Tree, Tokens, T2, T9, End_Names_Optional);
+ end package_specification_6_check;
+
+ procedure package_specification_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T4, Motion), (T6, Motion)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T4, Invalid_Token_ID) &
+ Index_ID'(T6, Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T2, 1, 1), (T9, 1,
1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T4
=> (False, (Simple, (Label => None))), T5
+ => (True, (Simple, (Block, Ada_Indent)), (Simple, (Int,
Ada_Indent))), T6 => (False, (Simple, (Label =>
+ None))), T8 => (False, (Simple, (Label => None))), T9 => (False,
(Hanging_2, (Int, Ada_Indent_Broken), (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end package_specification_7;
+
+ function package_specification_7_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T2 : constant SAL.Peek_Type := 2;
+ T9 : constant SAL.Peek_Type := 7;
+ begin
+ return Match_Names (Tree, Tokens, T2, T9, End_Names_Optional);
+ end package_specification_7_check;
+
+ procedure package_specification_8
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T4, Motion)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T4,
+ Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T2, 1, 1), (T9, 1,
1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T4
=> (False, (Simple, (Label => None))), T5
+ => (True, (Simple, (Block, Ada_Indent)), (Simple, (Int,
Ada_Indent))), T8 => (False, (Simple, (Label =>
+ None))), T9 => (False, (Hanging_2, (Int, Ada_Indent_Broken), (Int,
Ada_Indent_Broken)))));
+ end case;
+ end package_specification_8;
+
+ function package_specification_8_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T2 : constant SAL.Peek_Type := 2;
+ T9 : constant SAL.Peek_Type := 6;
+ begin
+ return Match_Names (Tree, Tokens, T2, T9, End_Names_Optional);
+ end package_specification_8_check;
+
+ procedure package_specification_9
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ T7 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T4, Motion), (T6, Motion)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T4, Invalid_Token_ID) &
+ Index_ID'(T6, Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T2, 1, 1), (T9, 1,
1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T4
=> (False, (Simple, (Label => None))), T6
+ => (False, (Simple, (Label => None))), T7 => (True, (Simple, (Block,
Ada_Indent)), (Simple, (Int,
+ Ada_Indent))), T8 => (False, (Simple, (Label => None))), T9 =>
(False, (Hanging_2, (Int, Ada_Indent_Broken),
+ (Int, Ada_Indent_Broken)))));
+ end case;
+ end package_specification_9;
+
+ function package_specification_9_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T2 : constant SAL.Peek_Type := 2;
+ T9 : constant SAL.Peek_Type := 7;
+ begin
+ return Match_Names (Tree, Tokens, T2, T9, End_Names_Optional);
+ end package_specification_9_check;
+
+ procedure package_specification_10
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T4, Motion), (T6, Motion)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T4, Invalid_Token_ID) &
+ Index_ID'(T6, Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T2, 1, 1), (T9, 1,
1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T4
=> (False, (Simple, (Label => None))), T6
+ => (False, (Simple, (Label => None))), T8 => (False, (Simple, (Label
=> None))), T9 => (False, (Hanging_2,
+ (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken)))));
+ end case;
+ end package_specification_10;
+
+ function package_specification_10_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T2 : constant SAL.Peek_Type := 2;
+ T9 : constant SAL.Peek_Type := 6;
+ begin
+ return Match_Names (Tree, Tokens, T2, T9, End_Names_Optional);
+ end package_specification_10_check;
+
+ procedure package_specification_11
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T8 : constant SAL.Peek_Type := 4;
+ T9 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T4, Motion)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T4,
+ Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T2, 1, 1), (T9, 1,
1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T4
=> (False, (Simple, (Label => None))), T8
+ => (False, (Simple, (Label => None))), T9 => (False, (Hanging_2,
(Int, Ada_Indent_Broken), (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end package_specification_11;
+
+ function package_specification_11_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T2 : constant SAL.Peek_Type := 2;
+ T9 : constant SAL.Peek_Type := 5;
+ begin
+ return Match_Names (Tree, Tokens, T2, T9, End_Names_Optional);
+ end package_specification_11_check;
+
+ procedure package_body_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ T9 : constant SAL.Peek_Type := 9;
+ T10 : constant SAL.Peek_Type := 10;
+ T11 : constant SAL.Peek_Type := 11;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T5, Motion), (T7, Motion), (T11,
+ Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T5, Invalid_Token_ID) &
+ Index_ID'(T7, Invalid_Token_ID) & Index_ID'(T8, 63)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T3, 1, 1), (T10, 1,
1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T4
+ => (False, (Simple, (Label => None))), T5 => (False, (Simple, (Label
=> None))), T6 => (True, (Simple, (Block,
+ Ada_Indent)), (Simple, (Int, Ada_Indent))), T7 => (False, (Simple,
(Label => None))), T8 => (True, (Simple,
+ (Block, Ada_Indent)), (Simple, (Int, Ada_Indent))), T9 => (False,
(Simple, (Label => None))), T10 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T11
=> (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end package_body_0;
+
+ function package_body_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T3 : constant SAL.Peek_Type := 3;
+ T10 : constant SAL.Peek_Type := 10;
+ begin
+ return Match_Names (Tree, Tokens, T3, T10, End_Names_Optional);
+ end package_body_0_check;
+
+ procedure package_body_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ T10 : constant SAL.Peek_Type := 8;
+ T11 : constant SAL.Peek_Type := 9;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T5, Motion), (T11, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T5,
+ Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T3, 1, 1), (T10, 1,
1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T4
+ => (False, (Simple, (Label => None))), T5 => (False, (Simple, (Label
=> None))), T6 => (True, (Simple, (Block,
+ Ada_Indent)), (Simple, (Int, Ada_Indent))), T9 => (False, (Simple,
(Label => None))), T10 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T11
=> (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end package_body_1;
+
+ function package_body_1_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T3 : constant SAL.Peek_Type := 3;
+ T10 : constant SAL.Peek_Type := 8;
+ begin
+ return Match_Names (Tree, Tokens, T3, T10, End_Names_Optional);
+ end package_body_1_check;
+
+ procedure package_body_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ T10 : constant SAL.Peek_Type := 9;
+ T11 : constant SAL.Peek_Type := 10;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T5, Motion), (T7, Motion), (T11,
+ Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T5, Invalid_Token_ID) &
+ Index_ID'(T7, Invalid_Token_ID) & Index_ID'(T8, 63)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T3, 1, 1), (T10, 1,
1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T5
+ => (False, (Simple, (Label => None))), T6 => (True, (Simple, (Block,
Ada_Indent)), (Simple, (Int,
+ Ada_Indent))), T7 => (False, (Simple, (Label => None))), T8 => (True,
(Simple, (Block, Ada_Indent)), (Simple,
+ (Int, Ada_Indent))), T9 => (False, (Simple, (Label => None))), T10 =>
(False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T11 => (False,
(Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end package_body_2;
+
+ function package_body_2_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T3 : constant SAL.Peek_Type := 3;
+ T10 : constant SAL.Peek_Type := 9;
+ begin
+ return Match_Names (Tree, Tokens, T3, T10, End_Names_Optional);
+ end package_body_2_check;
+
+ procedure package_body_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ T10 : constant SAL.Peek_Type := 7;
+ T11 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T5, Motion), (T11, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T5,
+ Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T3, 1, 1), (T10, 1,
1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T5
+ => (False, (Simple, (Label => None))), T6 => (True, (Simple, (Block,
Ada_Indent)), (Simple, (Int,
+ Ada_Indent))), T9 => (False, (Simple, (Label => None))), T10 =>
(False, (Hanging_2, (Int, Ada_Indent_Broken),
+ (Int, Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end package_body_3;
+
+ function package_body_3_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T3 : constant SAL.Peek_Type := 3;
+ T10 : constant SAL.Peek_Type := 7;
+ begin
+ return Match_Names (Tree, Tokens, T3, T10, End_Names_Optional);
+ end package_body_3_check;
+
+ procedure private_type_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ T9 : constant SAL.Peek_Type := 9;
+ T10 : constant SAL.Peek_Type := 10;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Label
+ => None))), T5 => (False, (Simple, (Int, Ada_Indent_Broken))), T6 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Label => None))), T10
=> (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_type_declaration_0;
+
+ procedure private_type_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ T10 : constant SAL.Peek_Type := 9;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Label
+ => None))), T5 => (False, (Simple, (Int, Ada_Indent_Broken))), T6 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end private_type_declaration_1;
+
+ procedure private_type_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ T10 : constant SAL.Peek_Type := 9;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Label
+ => None))), T5 => (False, (Simple, (Int, Ada_Indent_Broken))), T6 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Label =>
+ None))), T10 => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end private_type_declaration_2;
+
+ procedure private_type_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T10 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Label
+ => None))), T5 => (False, (Simple, (Int, Ada_Indent_Broken))), T6 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_type_declaration_3;
+
+ procedure private_type_declaration_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ T10 : constant SAL.Peek_Type := 9;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Label
+ => None))), T6 => (False, (Simple, (Int, Ada_Indent_Broken))), T7 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Label =>
+ None))), T10 => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end private_type_declaration_4;
+
+ procedure private_type_declaration_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T10 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Label
+ => None))), T6 => (False, (Simple, (Int, Ada_Indent_Broken))), T7 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_type_declaration_5;
+
+ procedure private_type_declaration_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ T10 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Label
+ => None))), T6 => (False, (Simple, (Int, Ada_Indent_Broken))), T8 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Label => None))), T10
=> (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_type_declaration_6;
+
+ procedure private_type_declaration_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T10 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Label
+ => None))), T6 => (False, (Simple, (Int, Ada_Indent_Broken))), T8 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end private_type_declaration_7;
+
+ procedure private_type_declaration_8
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T7 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ T10 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Label
+ => None))), T7 => (False, (Simple, (Int, Ada_Indent_Broken))), T8 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Label => None))), T10
=> (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_type_declaration_8;
+
+ procedure private_type_declaration_9
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T7 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T10 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Label
+ => None))), T7 => (False, (Simple, (Int, Ada_Indent_Broken))), T8 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end private_type_declaration_9;
+
+ procedure private_type_declaration_10
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ T10 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Label
+ => None))), T8 => (False, (Simple, (Int, Ada_Indent_Broken))), T9 =>
(False, (Simple, (Label => None))), T10
+ => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end private_type_declaration_10;
+
+ procedure private_type_declaration_11
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ T10 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Label
+ => None))), T8 => (False, (Simple, (Int, Ada_Indent_Broken))), T10 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_type_declaration_11;
+
+ procedure private_type_declaration_12
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ T10 : constant SAL.Peek_Type := 9;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Label => None))),
T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Label =>
+ None))), T10 => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end private_type_declaration_12;
+
+ procedure private_type_declaration_13
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T10 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Label => None))),
T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_type_declaration_13;
+
+ procedure private_type_declaration_14
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ T10 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Label => None))),
T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Label => None))), T10
=> (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_type_declaration_14;
+
+ procedure private_type_declaration_15
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T10 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Label => None))),
T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end private_type_declaration_15;
+
+ procedure private_type_declaration_16
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ T7 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ T10 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Label => None))),
T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Label => None))), T10
=> (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_type_declaration_16;
+
+ procedure private_type_declaration_17
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ T7 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T10 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Label => None))),
T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end private_type_declaration_17;
+
+ procedure private_type_declaration_18
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ T10 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Label => None))),
T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Label =>
+ None))), T10 => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end private_type_declaration_18;
+
+ procedure private_type_declaration_19
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ T10 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Label => None))),
T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_type_declaration_19;
+
+ procedure private_type_declaration_20
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T7 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ T10 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Label => None))),
T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Label =>
+ None))), T10 => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end private_type_declaration_20;
+
+ procedure private_type_declaration_21
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T7 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ T10 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Label => None))),
T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_type_declaration_21;
+
+ procedure private_type_declaration_22
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T8 : constant SAL.Peek_Type := 4;
+ T9 : constant SAL.Peek_Type := 5;
+ T10 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Label => None))),
T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Label => None))), T10
=> (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_type_declaration_22;
+
+ procedure private_type_declaration_23
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T8 : constant SAL.Peek_Type := 4;
+ T10 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Label => None))),
T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end private_type_declaration_23;
+
+ procedure private_extension_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ T10 : constant SAL.Peek_Type := 9;
+ T11 : constant SAL.Peek_Type := 10;
+ T12 : constant SAL.Peek_Type := 11;
+ T13 : constant SAL.Peek_Type := 12;
+ T14 : constant SAL.Peek_Type := 13;
+ T15 : constant SAL.Peek_Type := 14;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T14 => (False, (Simple, (Label => None))), T15
=> (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_0;
+
+ procedure private_extension_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ T10 : constant SAL.Peek_Type := 9;
+ T11 : constant SAL.Peek_Type := 10;
+ T12 : constant SAL.Peek_Type := 11;
+ T13 : constant SAL.Peek_Type := 12;
+ T15 : constant SAL.Peek_Type := 13;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T15 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_1;
+
+ procedure private_extension_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ T12 : constant SAL.Peek_Type := 9;
+ T13 : constant SAL.Peek_Type := 10;
+ T14 : constant SAL.Peek_Type := 11;
+ T15 : constant SAL.Peek_Type := 12;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T14 => (False, (Simple, (Label => None))), T15
=> (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_2;
+
+ procedure private_extension_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ T12 : constant SAL.Peek_Type := 9;
+ T13 : constant SAL.Peek_Type := 10;
+ T15 : constant SAL.Peek_Type := 11;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T15 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_3;
+
+ procedure private_extension_declaration_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ T10 : constant SAL.Peek_Type := 9;
+ T11 : constant SAL.Peek_Type := 10;
+ T12 : constant SAL.Peek_Type := 11;
+ T13 : constant SAL.Peek_Type := 12;
+ T14 : constant SAL.Peek_Type := 13;
+ T15 : constant SAL.Peek_Type := 14;
+ T7 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T14 => (False, (Simple, (Label => None))), T15
=> (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_4;
+
+ procedure private_extension_declaration_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ T10 : constant SAL.Peek_Type := 9;
+ T11 : constant SAL.Peek_Type := 10;
+ T12 : constant SAL.Peek_Type := 11;
+ T13 : constant SAL.Peek_Type := 12;
+ T15 : constant SAL.Peek_Type := 13;
+ T7 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T15 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_5;
+
+ procedure private_extension_declaration_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ T12 : constant SAL.Peek_Type := 9;
+ T13 : constant SAL.Peek_Type := 10;
+ T14 : constant SAL.Peek_Type := 11;
+ T15 : constant SAL.Peek_Type := 12;
+ T7 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T14 => (False, (Simple, (Label => None))), T15
=> (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_6;
+
+ procedure private_extension_declaration_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ T12 : constant SAL.Peek_Type := 9;
+ T13 : constant SAL.Peek_Type := 10;
+ T15 : constant SAL.Peek_Type := 11;
+ T7 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T15 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_7;
+
+ procedure private_extension_declaration_8
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ T10 : constant SAL.Peek_Type := 8;
+ T11 : constant SAL.Peek_Type := 9;
+ T12 : constant SAL.Peek_Type := 10;
+ T13 : constant SAL.Peek_Type := 11;
+ T14 : constant SAL.Peek_Type := 12;
+ T15 : constant SAL.Peek_Type := 13;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
Ada_Indent_Broken))), T14 => (False, (Simple, (Label =>
+ None))), T15 => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_8;
+
+ procedure private_extension_declaration_9
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ T10 : constant SAL.Peek_Type := 8;
+ T11 : constant SAL.Peek_Type := 9;
+ T12 : constant SAL.Peek_Type := 10;
+ T13 : constant SAL.Peek_Type := 11;
+ T15 : constant SAL.Peek_Type := 12;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
Ada_Indent_Broken))), T15 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_9;
+
+ procedure private_extension_declaration_10
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ T12 : constant SAL.Peek_Type := 8;
+ T13 : constant SAL.Peek_Type := 9;
+ T14 : constant SAL.Peek_Type := 10;
+ T15 : constant SAL.Peek_Type := 11;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
Ada_Indent_Broken))), T14 => (False, (Simple, (Label =>
+ None))), T15 => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_10;
+
+ procedure private_extension_declaration_11
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ T12 : constant SAL.Peek_Type := 8;
+ T13 : constant SAL.Peek_Type := 9;
+ T15 : constant SAL.Peek_Type := 10;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
Ada_Indent_Broken))), T15 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_11;
+
+ procedure private_extension_declaration_12
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ T10 : constant SAL.Peek_Type := 8;
+ T11 : constant SAL.Peek_Type := 9;
+ T12 : constant SAL.Peek_Type := 10;
+ T13 : constant SAL.Peek_Type := 11;
+ T14 : constant SAL.Peek_Type := 12;
+ T15 : constant SAL.Peek_Type := 13;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
Ada_Indent_Broken))), T14 => (False, (Simple, (Label =>
+ None))), T15 => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_12;
+
+ procedure private_extension_declaration_13
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ T10 : constant SAL.Peek_Type := 8;
+ T11 : constant SAL.Peek_Type := 9;
+ T12 : constant SAL.Peek_Type := 10;
+ T13 : constant SAL.Peek_Type := 11;
+ T15 : constant SAL.Peek_Type := 12;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
Ada_Indent_Broken))), T15 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_13;
+
+ procedure private_extension_declaration_14
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ T12 : constant SAL.Peek_Type := 8;
+ T13 : constant SAL.Peek_Type := 9;
+ T14 : constant SAL.Peek_Type := 10;
+ T15 : constant SAL.Peek_Type := 11;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
Ada_Indent_Broken))), T14 => (False, (Simple, (Label =>
+ None))), T15 => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_14;
+
+ procedure private_extension_declaration_15
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ T12 : constant SAL.Peek_Type := 8;
+ T13 : constant SAL.Peek_Type := 9;
+ T15 : constant SAL.Peek_Type := 10;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
Ada_Indent_Broken))), T15 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_15;
+
+ procedure private_extension_declaration_16
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ T10 : constant SAL.Peek_Type := 8;
+ T11 : constant SAL.Peek_Type := 9;
+ T12 : constant SAL.Peek_Type := 10;
+ T13 : constant SAL.Peek_Type := 11;
+ T14 : constant SAL.Peek_Type := 12;
+ T15 : constant SAL.Peek_Type := 13;
+ T7 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
Ada_Indent_Broken))), T14 => (False, (Simple, (Label =>
+ None))), T15 => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_16;
+
+ procedure private_extension_declaration_17
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ T10 : constant SAL.Peek_Type := 8;
+ T11 : constant SAL.Peek_Type := 9;
+ T12 : constant SAL.Peek_Type := 10;
+ T13 : constant SAL.Peek_Type := 11;
+ T15 : constant SAL.Peek_Type := 12;
+ T7 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
Ada_Indent_Broken))), T15 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_17;
+
+ procedure private_extension_declaration_18
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ T12 : constant SAL.Peek_Type := 8;
+ T13 : constant SAL.Peek_Type := 9;
+ T14 : constant SAL.Peek_Type := 10;
+ T15 : constant SAL.Peek_Type := 11;
+ T7 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
Ada_Indent_Broken))), T14 => (False, (Simple, (Label =>
+ None))), T15 => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_18;
+
+ procedure private_extension_declaration_19
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ T12 : constant SAL.Peek_Type := 8;
+ T13 : constant SAL.Peek_Type := 9;
+ T15 : constant SAL.Peek_Type := 10;
+ T7 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
Ada_Indent_Broken))), T15 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_19;
+
+ procedure private_extension_declaration_20
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ T10 : constant SAL.Peek_Type := 7;
+ T11 : constant SAL.Peek_Type := 8;
+ T12 : constant SAL.Peek_Type := 9;
+ T13 : constant SAL.Peek_Type := 10;
+ T14 : constant SAL.Peek_Type := 11;
+ T15 : constant SAL.Peek_Type := 12;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T14 => (False, (Simple, (Label => None))), T15
=> (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_20;
+
+ procedure private_extension_declaration_21
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ T10 : constant SAL.Peek_Type := 7;
+ T11 : constant SAL.Peek_Type := 8;
+ T12 : constant SAL.Peek_Type := 9;
+ T13 : constant SAL.Peek_Type := 10;
+ T15 : constant SAL.Peek_Type := 11;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T15 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_21;
+
+ procedure private_extension_declaration_22
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ T12 : constant SAL.Peek_Type := 7;
+ T13 : constant SAL.Peek_Type := 8;
+ T14 : constant SAL.Peek_Type := 9;
+ T15 : constant SAL.Peek_Type := 10;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T14 => (False, (Simple, (Label => None))), T15
=> (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_22;
+
+ procedure private_extension_declaration_23
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ T12 : constant SAL.Peek_Type := 7;
+ T13 : constant SAL.Peek_Type := 8;
+ T15 : constant SAL.Peek_Type := 9;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T15 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_23;
+
+ procedure private_extension_declaration_24
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ T10 : constant SAL.Peek_Type := 8;
+ T11 : constant SAL.Peek_Type := 9;
+ T12 : constant SAL.Peek_Type := 10;
+ T13 : constant SAL.Peek_Type := 11;
+ T14 : constant SAL.Peek_Type := 12;
+ T15 : constant SAL.Peek_Type := 13;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
Ada_Indent_Broken))), T14 => (False, (Simple, (Label =>
+ None))), T15 => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_24;
+
+ procedure private_extension_declaration_25
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ T10 : constant SAL.Peek_Type := 8;
+ T11 : constant SAL.Peek_Type := 9;
+ T12 : constant SAL.Peek_Type := 10;
+ T13 : constant SAL.Peek_Type := 11;
+ T15 : constant SAL.Peek_Type := 12;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
Ada_Indent_Broken))), T15 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_25;
+
+ procedure private_extension_declaration_26
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ T12 : constant SAL.Peek_Type := 8;
+ T13 : constant SAL.Peek_Type := 9;
+ T14 : constant SAL.Peek_Type := 10;
+ T15 : constant SAL.Peek_Type := 11;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
Ada_Indent_Broken))), T14 => (False, (Simple, (Label =>
+ None))), T15 => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_26;
+
+ procedure private_extension_declaration_27
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ T12 : constant SAL.Peek_Type := 8;
+ T13 : constant SAL.Peek_Type := 9;
+ T15 : constant SAL.Peek_Type := 10;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
Ada_Indent_Broken))), T15 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_27;
+
+ procedure private_extension_declaration_28
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ T10 : constant SAL.Peek_Type := 8;
+ T11 : constant SAL.Peek_Type := 9;
+ T12 : constant SAL.Peek_Type := 10;
+ T13 : constant SAL.Peek_Type := 11;
+ T14 : constant SAL.Peek_Type := 12;
+ T15 : constant SAL.Peek_Type := 13;
+ T7 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
Ada_Indent_Broken))), T14 => (False, (Simple, (Label =>
+ None))), T15 => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_28;
+
+ procedure private_extension_declaration_29
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ T10 : constant SAL.Peek_Type := 8;
+ T11 : constant SAL.Peek_Type := 9;
+ T12 : constant SAL.Peek_Type := 10;
+ T13 : constant SAL.Peek_Type := 11;
+ T15 : constant SAL.Peek_Type := 12;
+ T7 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
Ada_Indent_Broken))), T15 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_29;
+
+ procedure private_extension_declaration_30
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ T12 : constant SAL.Peek_Type := 8;
+ T13 : constant SAL.Peek_Type := 9;
+ T14 : constant SAL.Peek_Type := 10;
+ T15 : constant SAL.Peek_Type := 11;
+ T7 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
Ada_Indent_Broken))), T14 => (False, (Simple, (Label =>
+ None))), T15 => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_30;
+
+ procedure private_extension_declaration_31
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ T12 : constant SAL.Peek_Type := 8;
+ T13 : constant SAL.Peek_Type := 9;
+ T15 : constant SAL.Peek_Type := 10;
+ T7 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
Ada_Indent_Broken))), T15 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_31;
+
+ procedure private_extension_declaration_32
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ T10 : constant SAL.Peek_Type := 7;
+ T11 : constant SAL.Peek_Type := 8;
+ T12 : constant SAL.Peek_Type := 9;
+ T13 : constant SAL.Peek_Type := 10;
+ T14 : constant SAL.Peek_Type := 11;
+ T15 : constant SAL.Peek_Type := 12;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T14 => (False, (Simple, (Label => None))), T15
=> (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_32;
+
+ procedure private_extension_declaration_33
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ T10 : constant SAL.Peek_Type := 7;
+ T11 : constant SAL.Peek_Type := 8;
+ T12 : constant SAL.Peek_Type := 9;
+ T13 : constant SAL.Peek_Type := 10;
+ T15 : constant SAL.Peek_Type := 11;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T15 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_33;
+
+ procedure private_extension_declaration_34
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ T12 : constant SAL.Peek_Type := 7;
+ T13 : constant SAL.Peek_Type := 8;
+ T14 : constant SAL.Peek_Type := 9;
+ T15 : constant SAL.Peek_Type := 10;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T14 => (False, (Simple, (Label => None))), T15
=> (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_34;
+
+ procedure private_extension_declaration_35
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ T12 : constant SAL.Peek_Type := 7;
+ T13 : constant SAL.Peek_Type := 8;
+ T15 : constant SAL.Peek_Type := 9;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T15 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_35;
+
+ procedure private_extension_declaration_36
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ T10 : constant SAL.Peek_Type := 7;
+ T11 : constant SAL.Peek_Type := 8;
+ T12 : constant SAL.Peek_Type := 9;
+ T13 : constant SAL.Peek_Type := 10;
+ T14 : constant SAL.Peek_Type := 11;
+ T15 : constant SAL.Peek_Type := 12;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T14 => (False, (Simple, (Label => None))), T15
=> (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_36;
+
+ procedure private_extension_declaration_37
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ T10 : constant SAL.Peek_Type := 7;
+ T11 : constant SAL.Peek_Type := 8;
+ T12 : constant SAL.Peek_Type := 9;
+ T13 : constant SAL.Peek_Type := 10;
+ T15 : constant SAL.Peek_Type := 11;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T15 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_37;
+
+ procedure private_extension_declaration_38
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ T12 : constant SAL.Peek_Type := 7;
+ T13 : constant SAL.Peek_Type := 8;
+ T14 : constant SAL.Peek_Type := 9;
+ T15 : constant SAL.Peek_Type := 10;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T14 => (False, (Simple, (Label => None))), T15
=> (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_38;
+
+ procedure private_extension_declaration_39
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ T12 : constant SAL.Peek_Type := 7;
+ T13 : constant SAL.Peek_Type := 8;
+ T15 : constant SAL.Peek_Type := 9;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T15 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_39;
+
+ procedure private_extension_declaration_40
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T8 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ T10 : constant SAL.Peek_Type := 7;
+ T11 : constant SAL.Peek_Type := 8;
+ T12 : constant SAL.Peek_Type := 9;
+ T13 : constant SAL.Peek_Type := 10;
+ T14 : constant SAL.Peek_Type := 11;
+ T15 : constant SAL.Peek_Type := 12;
+ T7 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T14 => (False, (Simple, (Label => None))), T15
=> (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_40;
+
+ procedure private_extension_declaration_41
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T8 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ T10 : constant SAL.Peek_Type := 7;
+ T11 : constant SAL.Peek_Type := 8;
+ T12 : constant SAL.Peek_Type := 9;
+ T13 : constant SAL.Peek_Type := 10;
+ T15 : constant SAL.Peek_Type := 11;
+ T7 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T15 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_41;
+
+ procedure private_extension_declaration_42
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T8 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ T12 : constant SAL.Peek_Type := 7;
+ T13 : constant SAL.Peek_Type := 8;
+ T14 : constant SAL.Peek_Type := 9;
+ T15 : constant SAL.Peek_Type := 10;
+ T7 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T14 => (False, (Simple, (Label => None))), T15
=> (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_42;
+
+ procedure private_extension_declaration_43
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T8 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ T12 : constant SAL.Peek_Type := 7;
+ T13 : constant SAL.Peek_Type := 8;
+ T15 : constant SAL.Peek_Type := 9;
+ T7 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T15 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_43;
+
+ procedure private_extension_declaration_44
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T8 : constant SAL.Peek_Type := 4;
+ T9 : constant SAL.Peek_Type := 5;
+ T10 : constant SAL.Peek_Type := 6;
+ T11 : constant SAL.Peek_Type := 7;
+ T12 : constant SAL.Peek_Type := 8;
+ T13 : constant SAL.Peek_Type := 9;
+ T14 : constant SAL.Peek_Type := 10;
+ T15 : constant SAL.Peek_Type := 11;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
Ada_Indent_Broken))), T14 => (False, (Simple, (Label =>
+ None))), T15 => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_44;
+
+ procedure private_extension_declaration_45
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T8 : constant SAL.Peek_Type := 4;
+ T9 : constant SAL.Peek_Type := 5;
+ T10 : constant SAL.Peek_Type := 6;
+ T11 : constant SAL.Peek_Type := 7;
+ T12 : constant SAL.Peek_Type := 8;
+ T13 : constant SAL.Peek_Type := 9;
+ T15 : constant SAL.Peek_Type := 10;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
Ada_Indent_Broken))), T15 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_45;
+
+ procedure private_extension_declaration_46
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T8 : constant SAL.Peek_Type := 4;
+ T9 : constant SAL.Peek_Type := 5;
+ T12 : constant SAL.Peek_Type := 6;
+ T13 : constant SAL.Peek_Type := 7;
+ T14 : constant SAL.Peek_Type := 8;
+ T15 : constant SAL.Peek_Type := 9;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
Ada_Indent_Broken))), T14 => (False, (Simple, (Label =>
+ None))), T15 => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_46;
+
+ procedure private_extension_declaration_47
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T8 : constant SAL.Peek_Type := 4;
+ T9 : constant SAL.Peek_Type := 5;
+ T12 : constant SAL.Peek_Type := 6;
+ T13 : constant SAL.Peek_Type := 7;
+ T15 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T15, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T13 => (False, (Simple, (Int,
Ada_Indent_Broken))), T15 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end private_extension_declaration_47;
+
+ procedure overriding_indicator_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_Override)));
+ when Face =>
+ null;
+ when Indent =>
+ null;
+ end case;
+ end overriding_indicator_0;
+
+ procedure overriding_indicator_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 => (T2,
Statement_Override)));
+ when Face =>
+ null;
+ when Indent =>
+ null;
+ end case;
+ end overriding_indicator_1;
+
+ procedure use_package_clause_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T3, Statement_End)));
+ when Face =>
+ Face_Apply_List_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 1, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Use))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end use_package_clause_0;
+
+ procedure use_type_clause_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T5, Statement_End)));
+ when Face =>
+ Face_Apply_List_Action (Parse_Data, Tree, Nonterm, (1 => (T4, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Use))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end use_type_clause_0;
+
+ procedure use_type_clause_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T5, Statement_End)));
+ when Face =>
+ Face_Apply_List_Action (Parse_Data, Tree, Nonterm, (1 => (T4, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T3 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Use))), T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end use_type_clause_1;
+
+ procedure object_renaming_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T1);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T4, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T5 => (False,
(Simple, (Int, Ada_Indent_Broken))), T6 =>
+ (False, (Hanging_2, (Int, Ada_Indent_Broken), (Int,
Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end object_renaming_declaration_0;
+
+ procedure object_renaming_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T1);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T4, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T5 => (False,
(Simple, (Int, Ada_Indent_Broken))), T6 =>
+ (False, (Hanging_2, (Int, Ada_Indent_Broken), (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end object_renaming_declaration_1;
+
+ procedure object_renaming_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T1);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T4, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T5
+ => (False, (Simple, (Int, Ada_Indent_Broken))), T6 => (False,
(Hanging_2, (Int, Ada_Indent_Broken), (Int,
+ Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end object_renaming_declaration_2;
+
+ procedure object_renaming_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T1);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T4, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T5
+ => (False, (Simple, (Int, Ada_Indent_Broken))), T6 => (False,
(Hanging_2, (Int, Ada_Indent_Broken), (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end object_renaming_declaration_3;
+
+ procedure object_renaming_declaration_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T5 : constant SAL.Peek_Type := 2;
+ T6 : constant SAL.Peek_Type := 3;
+ T7 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T1);
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T5 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T6 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T7
+ => (False, (Simple, (Int, Ada_Indent_Broken))), T8 => (False,
(Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_renaming_declaration_4;
+
+ procedure object_renaming_declaration_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T5 : constant SAL.Peek_Type := 2;
+ T6 : constant SAL.Peek_Type := 3;
+ T8 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T1);
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T5 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T6 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T8
+ => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_renaming_declaration_5;
+
+ procedure object_renaming_declaration_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T1);
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6 =>
+ (False, (Simple, (Int, Ada_Indent_Broken))), T7 => (False, (Simple,
(Int, Ada_Indent_Broken)))));
+ end case;
+ end object_renaming_declaration_6;
+
+ procedure object_renaming_declaration_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T1);
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T7 =>
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end object_renaming_declaration_7;
+
+ procedure exception_renaming_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T1);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 1, 3)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6 =>
+ (False, (Simple, (Int, Ada_Indent_Broken))), T7 => (False, (Simple,
(Int, Ada_Indent_Broken)))));
+ end case;
+ end exception_renaming_declaration_0;
+
+ procedure exception_renaming_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T1);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 1, 3)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T7 =>
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end exception_renaming_declaration_1;
+
+ procedure package_renaming_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T2, 1, 1), (T4, 1,
1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T3
=> (False, (Simple, (Int,
+ Ada_Indent_Broken))), T4 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T5 =>
+ (False, (Simple, (Label => None))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end package_renaming_declaration_0;
+
+ procedure package_renaming_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T2, 1, 1), (T4, 1,
1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T3
=> (False, (Simple, (Int,
+ Ada_Indent_Broken))), T4 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6 =>
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end package_renaming_declaration_1;
+
+ procedure subprogram_renaming_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_Override), (T6,
+ Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T4, 1, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Language,
Ada_Indent_Renames_0'Access, +Integer (T2)))), T4 =>
+ (False, (Hanging_2, (Int, Ada_Indent_Broken), (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Label =>
+ None))), T6 => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end subprogram_renaming_declaration_0;
+
+ procedure subprogram_renaming_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_Override), (T6,
+ Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T4, 1, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Language,
Ada_Indent_Renames_0'Access, +Integer (T2)))), T4 =>
+ (False, (Hanging_2, (Int, Ada_Indent_Broken), (Int,
Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end subprogram_renaming_declaration_1;
+
+ procedure subprogram_renaming_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T2,
Statement_Override), (T6, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T4, 1, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Label => None))), T3 => (False, (Simple,
+ (Language, Ada_Indent_Renames_0'Access, +Integer (T2)))), T4 =>
(False, (Hanging_2, (Int, Ada_Indent_Broken),
+ (Int, Ada_Indent_Broken))), T5 => (False, (Simple, (Label => None))),
T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end subprogram_renaming_declaration_2;
+
+ procedure subprogram_renaming_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T2,
Statement_Override), (T6, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T4, 1, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Label => None))), T3 => (False, (Simple,
+ (Language, Ada_Indent_Renames_0'Access, +Integer (T2)))), T4 =>
(False, (Hanging_2, (Int, Ada_Indent_Broken),
+ (Int, Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end subprogram_renaming_declaration_3;
+
+ procedure generic_renaming_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T3, 1, 1), (T5, 1,
1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T4 =>
+ (False, (Simple, (Int, Ada_Indent_Broken))), T5 => (False,
(Hanging_2, (Int, Ada_Indent_Broken), (Int,
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end generic_renaming_declaration_0;
+
+ procedure generic_renaming_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T3, 1, 1), (T5, 1,
1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T4 =>
+ (False, (Simple, (Int, Ada_Indent_Broken))), T5 => (False,
(Hanging_2, (Int, Ada_Indent_Broken), (Int,
+ Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end generic_renaming_declaration_1;
+
+ procedure generic_renaming_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T3, 1, 1), (T5, 1,
1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T4 =>
+ (False, (Simple, (Int, Ada_Indent_Broken))), T5 => (False,
(Hanging_2, (Int, Ada_Indent_Broken), (Int,
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end generic_renaming_declaration_2;
+
+ procedure generic_renaming_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T3, 1, 1), (T5, 1,
1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T4 =>
+ (False, (Simple, (Int, Ada_Indent_Broken))), T5 => (False,
(Hanging_2, (Int, Ada_Indent_Broken), (Int,
+ Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end generic_renaming_declaration_3;
+
+ procedure generic_renaming_declaration_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T3, 1, 1), (T5, 1,
1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T4 =>
+ (False, (Simple, (Int, Ada_Indent_Broken))), T5 => (False,
(Hanging_2, (Int, Ada_Indent_Broken), (Int,
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end generic_renaming_declaration_4;
+
+ procedure generic_renaming_declaration_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T3, 1, 1), (T5, 1,
1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T4 =>
+ (False, (Simple, (Int, Ada_Indent_Broken))), T5 => (False,
(Hanging_2, (Int, Ada_Indent_Broken), (Int,
+ Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end generic_renaming_declaration_5;
+
+ procedure task_type_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ T9 : constant SAL.Peek_Type := 9;
+ T10 : constant SAL.Peek_Type := 10;
+ T11 : constant SAL.Peek_Type := 11;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Motion), (T9, Motion), (T11,
+ Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T6, Invalid_Token_ID) &
+ Index_ID'(T9, Invalid_Token_ID) & Index_ID'(T10, 27) & Index_ID'(T11,
Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Label => None))), T6 =>
(True, (Simple, (Label => None)),
+ (Simple, (Int, Ada_Indent))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T10 => (False, (Simple, (Label =>
+ None))), T11 => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end task_type_declaration_0;
+
+ function task_type_declaration_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T3 : constant SAL.Peek_Type := 3;
+ T10 : constant SAL.Peek_Type := 10;
+ begin
+ return Match_Names (Tree, Tokens, T3, T10, End_Names_Optional);
+ end task_type_declaration_0_check;
+
+ procedure task_type_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T10 : constant SAL.Peek_Type := 7;
+ T11 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Motion), (T11, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T6, Invalid_Token_ID) &
+ Index_ID'(T10, 27) & Index_ID'(T11, Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Label => None))), T6 =>
(True, (Simple, (Label => None)),
+ (Simple, (Int, Ada_Indent))), T10 => (False, (Simple, (Label =>
None))), T11 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end task_type_declaration_1;
+
+ function task_type_declaration_1_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T3 : constant SAL.Peek_Type := 3;
+ T10 : constant SAL.Peek_Type := 7;
+ begin
+ return Match_Names (Tree, Tokens, T3, T10, End_Names_Optional);
+ end task_type_declaration_1_check;
+
+ procedure task_type_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T11 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T11, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T11,
+ Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Label => None))), T11
=> (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end task_type_declaration_2;
+
+ procedure task_type_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ T10 : constant SAL.Peek_Type := 9;
+ T11 : constant SAL.Peek_Type := 10;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Motion), (T9, Motion), (T11,
+ Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T6, Invalid_Token_ID) &
+ Index_ID'(T9, Invalid_Token_ID) & Index_ID'(T10, 27) & Index_ID'(T11,
Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (True, (Simple, (Label => None)),
(Simple, (Int, Ada_Indent))), T7 => (False,
+ (Simple, (Int, Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T10 => (False, (Simple, (Label =>
None))), T11 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end task_type_declaration_3;
+
+ function task_type_declaration_3_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T3 : constant SAL.Peek_Type := 3;
+ T10 : constant SAL.Peek_Type := 9;
+ begin
+ return Match_Names (Tree, Tokens, T3, T10, End_Names_Optional);
+ end task_type_declaration_3_check;
+
+ procedure task_type_declaration_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T10 : constant SAL.Peek_Type := 6;
+ T11 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Motion), (T11, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T6, Invalid_Token_ID) &
+ Index_ID'(T10, 27) & Index_ID'(T11, Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (True, (Simple, (Label => None)),
(Simple, (Int, Ada_Indent))), T10 => (False,
+ (Simple, (Label => None))), T11 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end task_type_declaration_4;
+
+ function task_type_declaration_4_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T3 : constant SAL.Peek_Type := 3;
+ T10 : constant SAL.Peek_Type := 6;
+ begin
+ return Match_Names (Tree, Tokens, T3, T10, End_Names_Optional);
+ end task_type_declaration_4_check;
+
+ procedure task_type_declaration_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T11 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T11, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T11,
+ Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end task_type_declaration_5;
+
+ procedure task_type_declaration_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ T10 : constant SAL.Peek_Type := 9;
+ T11 : constant SAL.Peek_Type := 10;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Motion), (T9, Motion), (T11,
+ Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T6, Invalid_Token_ID) &
+ Index_ID'(T9, Invalid_Token_ID) & Index_ID'(T10, 27) & Index_ID'(T11,
Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Label
+ => None))), T6 => (True, (Simple, (Label => None)), (Simple, (Int,
Ada_Indent))), T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T10 => (False, (Simple, (Label => None))), T11
=> (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end task_type_declaration_6;
+
+ function task_type_declaration_6_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T3 : constant SAL.Peek_Type := 3;
+ T10 : constant SAL.Peek_Type := 9;
+ begin
+ return Match_Names (Tree, Tokens, T3, T10, End_Names_Optional);
+ end task_type_declaration_6_check;
+
+ procedure task_type_declaration_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T10 : constant SAL.Peek_Type := 6;
+ T11 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Motion), (T11, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T6, Invalid_Token_ID) &
+ Index_ID'(T10, 27) & Index_ID'(T11, Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Label
+ => None))), T6 => (True, (Simple, (Label => None)), (Simple, (Int,
Ada_Indent))), T10 => (False, (Simple,
+ (Label => None))), T11 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end task_type_declaration_7;
+
+ function task_type_declaration_7_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T3 : constant SAL.Peek_Type := 3;
+ T10 : constant SAL.Peek_Type := 6;
+ begin
+ return Match_Names (Tree, Tokens, T3, T10, End_Names_Optional);
+ end task_type_declaration_7_check;
+
+ procedure task_type_declaration_8
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T11 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T11, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T11,
+ Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Label
+ => None))), T11 => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end task_type_declaration_8;
+
+ procedure task_type_declaration_9
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ T7 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ T10 : constant SAL.Peek_Type := 8;
+ T11 : constant SAL.Peek_Type := 9;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Motion), (T9, Motion), (T11,
+ Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T6, Invalid_Token_ID) &
+ Index_ID'(T9, Invalid_Token_ID) & Index_ID'(T10, 27) & Index_ID'(T11,
Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (True, (Simple, (Label =>
+ None)), (Simple, (Int, Ada_Indent))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False,
+ (Simple, (Int, Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T10 => (False,
+ (Simple, (Label => None))), T11 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end task_type_declaration_9;
+
+ function task_type_declaration_9_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T3 : constant SAL.Peek_Type := 3;
+ T10 : constant SAL.Peek_Type := 8;
+ begin
+ return Match_Names (Tree, Tokens, T3, T10, End_Names_Optional);
+ end task_type_declaration_9_check;
+
+ procedure task_type_declaration_10
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ T10 : constant SAL.Peek_Type := 5;
+ T11 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Motion), (T11, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T6, Invalid_Token_ID) &
+ Index_ID'(T10, 27) & Index_ID'(T11, Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (True, (Simple, (Label =>
+ None)), (Simple, (Int, Ada_Indent))), T10 => (False, (Simple, (Label
=> None))), T11 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end task_type_declaration_10;
+
+ function task_type_declaration_10_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T3 : constant SAL.Peek_Type := 3;
+ T10 : constant SAL.Peek_Type := 5;
+ begin
+ return Match_Names (Tree, Tokens, T3, T10, End_Names_Optional);
+ end task_type_declaration_10_check;
+
+ procedure task_type_declaration_11
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T11 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T11, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T11,
+ Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end task_type_declaration_11;
+
+ procedure single_task_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ T9 : constant SAL.Peek_Type := 9;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T4, Motion), (T9, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T4, Invalid_Token_ID) &
+ Index_ID'(T8, 27)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Label => None))),
T4 => (True, (Simple, (Label => None)),
+ (Simple, (Int, Ada_Indent))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Label =>
+ None))), T9 => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end single_task_declaration_0;
+
+ function single_task_declaration_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T2 : constant SAL.Peek_Type := 2;
+ T8 : constant SAL.Peek_Type := 8;
+ begin
+ return Match_Names (Tree, Tokens, T2, T8, End_Names_Optional);
+ end single_task_declaration_0_check;
+
+ procedure single_task_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T4, Motion), (T9, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T4, Invalid_Token_ID) &
+ Index_ID'(T8, 27)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Label => None))),
T4 => (True, (Simple, (Label => None)),
+ (Simple, (Int, Ada_Indent))), T8 => (False, (Simple, (Label =>
None))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end single_task_declaration_1;
+
+ function single_task_declaration_1_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T2 : constant SAL.Peek_Type := 2;
+ T8 : constant SAL.Peek_Type := 5;
+ begin
+ return Match_Names (Tree, Tokens, T2, T8, End_Names_Optional);
+ end single_task_declaration_1_check;
+
+ procedure single_task_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T9 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T9, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Label => None))),
T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end single_task_declaration_2;
+
+ procedure single_task_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T4, Motion), (T9, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T4, Invalid_Token_ID) &
+ Index_ID'(T8, 27)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (True, (Simple, (Label => None)),
(Simple, (Int, Ada_Indent))), T5 =>
+ (False, (Simple, (Int, Ada_Indent_Broken))), T6 => (False, (Simple,
(Int, Ada_Indent_Broken))), T7 => (False,
+ (Simple, (Int, Ada_Indent_Broken))), T8 => (False, (Simple, (Label =>
None))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end single_task_declaration_3;
+
+ function single_task_declaration_3_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T2 : constant SAL.Peek_Type := 2;
+ T8 : constant SAL.Peek_Type := 7;
+ begin
+ return Match_Names (Tree, Tokens, T2, T8, End_Names_Optional);
+ end single_task_declaration_3_check;
+
+ procedure single_task_declaration_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T8 : constant SAL.Peek_Type := 4;
+ T9 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T4, Motion), (T9, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T4, Invalid_Token_ID) &
+ Index_ID'(T8, 27)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (True, (Simple, (Label => None)),
(Simple, (Int, Ada_Indent))), T8 =>
+ (False, (Simple, (Label => None))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end single_task_declaration_4;
+
+ function single_task_declaration_4_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T2 : constant SAL.Peek_Type := 2;
+ T8 : constant SAL.Peek_Type := 4;
+ begin
+ return Match_Names (Tree, Tokens, T2, T8, End_Names_Optional);
+ end single_task_declaration_4_check;
+
+ procedure single_task_declaration_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T9 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T9, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end single_task_declaration_5;
+
+ procedure task_definition_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 => (T2, Motion)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (True, (Simple,
(Int, Ada_Indent)), (Simple, (Int,
+ Ada_Indent))), T2 => (False, (Simple, (Label => None))), T3 => (True,
(Simple, (Int, Ada_Indent)), (Simple,
+ (Int, Ada_Indent))), T4 => (False, (Simple, (Label => None))), T5 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end task_definition_0;
+
+ function task_definition_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Recover_Active);
+ T5 : constant SAL.Peek_Type := 5;
+ begin
+ return Propagate_Name (Tree, Nonterm, Tokens, T5);
+ end task_definition_0_check;
+
+ procedure task_definition_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T4 : constant SAL.Peek_Type := 2;
+ T5 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 .. 0 => (1, Motion)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (True, (Simple,
(Int, Ada_Indent)), (Simple, (Int,
+ Ada_Indent))), T4 => (False, (Simple, (Label => None))), T5 =>
(False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end task_definition_1;
+
+ function task_definition_1_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Recover_Active);
+ T5 : constant SAL.Peek_Type := 3;
+ begin
+ return Propagate_Name (Tree, Nonterm, Tokens, T5);
+ end task_definition_1_check;
+
+ procedure task_body_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ T9 : constant SAL.Peek_Type := 9;
+ T10 : constant SAL.Peek_Type := 10;
+ T11 : constant SAL.Peek_Type := 11;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T5, Motion), (T7, Motion), (T11,
+ Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T5, Invalid_Token_ID) &
+ Index_ID'(T7, Invalid_Token_ID) & Index_ID'(T8, 63) & Index_ID'(T11,
Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T3, 3, 2), (T10, 3,
2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Int, Ada_Indent_Broken))),
T4 => (False, (Simple, (Label =>
+ None))), T5 => (False, (Simple, (Label => None))), T6 => (True,
(Simple, (Block, Ada_Indent)), (Simple, (Int,
+ Ada_Indent))), T7 => (False, (Simple, (Label => None))), T8 => (True,
(Simple, (Block, Ada_Indent)), (Simple,
+ (Int, Ada_Indent))), T9 => (False, (Simple, (Label => None))), T10 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end task_body_0;
+
+ function task_body_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T3 : constant SAL.Peek_Type := 3;
+ T10 : constant SAL.Peek_Type := 10;
+ begin
+ return Match_Names (Tree, Tokens, T3, T10, End_Names_Optional);
+ end task_body_0_check;
+
+ procedure task_body_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ T10 : constant SAL.Peek_Type := 9;
+ T11 : constant SAL.Peek_Type := 10;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T5, Motion), (T7, Motion), (T11,
+ Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T5, Invalid_Token_ID) &
+ Index_ID'(T7, Invalid_Token_ID) & Index_ID'(T8, 63) & Index_ID'(T11,
Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T3, 3, 2), (T10, 3,
2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Int, Ada_Indent_Broken))),
T5 => (False, (Simple, (Label =>
+ None))), T6 => (True, (Simple, (Block, Ada_Indent)), (Simple, (Int,
Ada_Indent))), T7 => (False, (Simple,
+ (Label => None))), T8 => (True, (Simple, (Block, Ada_Indent)),
(Simple, (Int, Ada_Indent))), T9 => (False,
+ (Simple, (Label => None))), T10 => (False, (Simple, (Int,
Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end task_body_1;
+
+ function task_body_1_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T3 : constant SAL.Peek_Type := 3;
+ T10 : constant SAL.Peek_Type := 9;
+ begin
+ return Match_Names (Tree, Tokens, T3, T10, End_Names_Optional);
+ end task_body_1_check;
+
+ procedure protected_type_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ T9 : constant SAL.Peek_Type := 9;
+ T10 : constant SAL.Peek_Type := 10;
+ T11 : constant SAL.Peek_Type := 11;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Motion), (T11, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T6, Invalid_Token_ID) &
+ Index_ID'(T10, 27) & Index_ID'(T11, Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Label => None))), T6 =>
(True, (Simple, (Label => None)),
+ (Simple, (Int, Ada_Indent))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T10 => (True, (Simple, (Label =>
+ None)), (Simple, (Int, Ada_Indent_Broken))), T11 => (False, (Simple,
(Int, Ada_Indent_Broken)))));
+ end case;
+ end protected_type_declaration_0;
+
+ function protected_type_declaration_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T3 : constant SAL.Peek_Type := 3;
+ T10 : constant SAL.Peek_Type := 10;
+ begin
+ return Match_Names (Tree, Tokens, T3, T10, End_Names_Optional);
+ end protected_type_declaration_0_check;
+
+ procedure protected_type_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T10 : constant SAL.Peek_Type := 7;
+ T11 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Motion), (T11, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T6, Invalid_Token_ID) &
+ Index_ID'(T10, 27) & Index_ID'(T11, Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Label => None))), T6 =>
(True, (Simple, (Label => None)),
+ (Simple, (Int, Ada_Indent))), T10 => (True, (Simple, (Label =>
None)), (Simple, (Int, Ada_Indent_Broken))),
+ T11 => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end protected_type_declaration_1;
+
+ function protected_type_declaration_1_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T3 : constant SAL.Peek_Type := 3;
+ T10 : constant SAL.Peek_Type := 7;
+ begin
+ return Match_Names (Tree, Tokens, T3, T10, End_Names_Optional);
+ end protected_type_declaration_1_check;
+
+ procedure protected_type_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ T10 : constant SAL.Peek_Type := 9;
+ T11 : constant SAL.Peek_Type := 10;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Motion), (T11, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T6, Invalid_Token_ID) &
+ Index_ID'(T10, 27) & Index_ID'(T11, Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (True, (Simple, (Label => None)),
(Simple, (Int, Ada_Indent))), T7 => (False,
+ (Simple, (Int, Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T10 => (True, (Simple, (Label => None)),
(Simple, (Int, Ada_Indent_Broken))), T11
+ => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end protected_type_declaration_2;
+
+ function protected_type_declaration_2_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T3 : constant SAL.Peek_Type := 3;
+ T10 : constant SAL.Peek_Type := 9;
+ begin
+ return Match_Names (Tree, Tokens, T3, T10, End_Names_Optional);
+ end protected_type_declaration_2_check;
+
+ procedure protected_type_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T10 : constant SAL.Peek_Type := 6;
+ T11 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Motion), (T11, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T6, Invalid_Token_ID) &
+ Index_ID'(T10, 27) & Index_ID'(T11, Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (True, (Simple, (Label => None)),
(Simple, (Int, Ada_Indent))), T10 => (True,
+ (Simple, (Label => None)), (Simple, (Int, Ada_Indent_Broken))), T11
=> (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end protected_type_declaration_3;
+
+ function protected_type_declaration_3_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T3 : constant SAL.Peek_Type := 3;
+ T10 : constant SAL.Peek_Type := 6;
+ begin
+ return Match_Names (Tree, Tokens, T3, T10, End_Names_Optional);
+ end protected_type_declaration_3_check;
+
+ procedure protected_type_declaration_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ T10 : constant SAL.Peek_Type := 9;
+ T11 : constant SAL.Peek_Type := 10;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Motion), (T11, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T6, Invalid_Token_ID) &
+ Index_ID'(T10, 27) & Index_ID'(T11, Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Label
+ => None))), T6 => (True, (Simple, (Label => None)), (Simple, (Int,
Ada_Indent))), T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T10 => (True, (Simple, (Label => None)),
(Simple, (Int, Ada_Indent_Broken))), T11 =>
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end protected_type_declaration_4;
+
+ function protected_type_declaration_4_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T3 : constant SAL.Peek_Type := 3;
+ T10 : constant SAL.Peek_Type := 9;
+ begin
+ return Match_Names (Tree, Tokens, T3, T10, End_Names_Optional);
+ end protected_type_declaration_4_check;
+
+ procedure protected_type_declaration_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T10 : constant SAL.Peek_Type := 6;
+ T11 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Motion), (T11, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T6, Invalid_Token_ID) &
+ Index_ID'(T10, 27) & Index_ID'(T11, Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Label
+ => None))), T6 => (True, (Simple, (Label => None)), (Simple, (Int,
Ada_Indent))), T10 => (True, (Simple,
+ (Label => None)), (Simple, (Int, Ada_Indent_Broken))), T11 => (False,
(Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end protected_type_declaration_5;
+
+ function protected_type_declaration_5_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T3 : constant SAL.Peek_Type := 3;
+ T10 : constant SAL.Peek_Type := 6;
+ begin
+ return Match_Names (Tree, Tokens, T3, T10, End_Names_Optional);
+ end protected_type_declaration_5_check;
+
+ procedure protected_type_declaration_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ T7 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ T10 : constant SAL.Peek_Type := 8;
+ T11 : constant SAL.Peek_Type := 9;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Motion), (T11, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T6, Invalid_Token_ID) &
+ Index_ID'(T10, 27) & Index_ID'(T11, Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (True, (Simple, (Label =>
+ None)), (Simple, (Int, Ada_Indent))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False,
+ (Simple, (Int, Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T10 => (True, (Simple,
+ (Label => None)), (Simple, (Int, Ada_Indent_Broken))), T11 => (False,
(Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end protected_type_declaration_6;
+
+ function protected_type_declaration_6_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T3 : constant SAL.Peek_Type := 3;
+ T10 : constant SAL.Peek_Type := 8;
+ begin
+ return Match_Names (Tree, Tokens, T3, T10, End_Names_Optional);
+ end protected_type_declaration_6_check;
+
+ procedure protected_type_declaration_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ T10 : constant SAL.Peek_Type := 5;
+ T11 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Motion), (T11, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T6, Invalid_Token_ID) &
+ Index_ID'(T10, 27) & Index_ID'(T11, Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (True, (Simple, (Label =>
+ None)), (Simple, (Int, Ada_Indent))), T10 => (True, (Simple, (Label
=> None)), (Simple, (Int,
+ Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end protected_type_declaration_7;
+
+ function protected_type_declaration_7_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T3 : constant SAL.Peek_Type := 3;
+ T10 : constant SAL.Peek_Type := 5;
+ begin
+ return Match_Names (Tree, Tokens, T3, T10, End_Names_Optional);
+ end protected_type_declaration_7_check;
+
+ procedure single_protected_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ T9 : constant SAL.Peek_Type := 9;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T4, Motion), (T7, Motion), (T9,
+ Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T4, Invalid_Token_ID) &
+ Index_ID'(T7, Invalid_Token_ID) & Index_ID'(T8, 27) & Index_ID'(T9,
Invalid_Token_ID)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Label => None))),
T4 => (True, (Simple, (Label => None)),
+ (Simple, (Int, Ada_Indent))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Label =>
+ None))), T9 => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end single_protected_declaration_0;
+
+ function single_protected_declaration_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T2 : constant SAL.Peek_Type := 2;
+ T8 : constant SAL.Peek_Type := 8;
+ begin
+ return Match_Names (Tree, Tokens, T2, T8, End_Names_Optional);
+ end single_protected_declaration_0_check;
+
+ procedure single_protected_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T4, Motion), (T9, Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T4, Invalid_Token_ID) &
+ Index_ID'(T8, 27) & Index_ID'(T9, Invalid_Token_ID)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Label => None))),
T4 => (True, (Simple, (Label => None)),
+ (Simple, (Int, Ada_Indent))), T8 => (False, (Simple, (Label =>
None))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end single_protected_declaration_1;
+
+ function single_protected_declaration_1_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T2 : constant SAL.Peek_Type := 2;
+ T8 : constant SAL.Peek_Type := 5;
+ begin
+ return Match_Names (Tree, Tokens, T2, T8, End_Names_Optional);
+ end single_protected_declaration_1_check;
+
+ procedure single_protected_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T4, Motion), (T7, Motion), (T9,
+ Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T4, Invalid_Token_ID) &
+ Index_ID'(T7, Invalid_Token_ID) & Index_ID'(T8, 27) & Index_ID'(T9,
Invalid_Token_ID)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (True, (Simple, (Label => None)),
(Simple, (Int, Ada_Indent))), T5 =>
+ (False, (Simple, (Int, Ada_Indent_Broken))), T6 => (False, (Simple,
(Int, Ada_Indent_Broken))), T7 => (False,
+ (Simple, (Int, Ada_Indent_Broken))), T8 => (False, (Simple, (Label =>
None))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end single_protected_declaration_2;
+
+ function single_protected_declaration_2_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T2 : constant SAL.Peek_Type := 2;
+ T8 : constant SAL.Peek_Type := 7;
+ begin
+ return Match_Names (Tree, Tokens, T2, T8, End_Names_Optional);
+ end single_protected_declaration_2_check;
+
+ procedure single_protected_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T8 : constant SAL.Peek_Type := 4;
+ T9 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T4, Motion), (T9, Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T4, Invalid_Token_ID) &
+ Index_ID'(T8, 27) & Index_ID'(T9, Invalid_Token_ID)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (True, (Simple, (Label => None)),
(Simple, (Int, Ada_Indent))), T8 =>
+ (False, (Simple, (Label => None))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end single_protected_declaration_3;
+
+ function single_protected_declaration_3_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T2 : constant SAL.Peek_Type := 2;
+ T8 : constant SAL.Peek_Type := 4;
+ begin
+ return Match_Names (Tree, Tokens, T2, T8, End_Names_Optional);
+ end single_protected_declaration_3_check;
+
+ procedure protected_definition_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 => (T2, Motion)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (True, (Simple,
(Int, Ada_Indent)), (Simple, (Int,
+ Ada_Indent))), T2 => (False, (Simple, (Label => None))), T3 => (True,
(Simple, (Int, Ada_Indent)), (Simple,
+ (Int, Ada_Indent))), T4 => (False, (Simple, (Label => None))), T5 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end protected_definition_0;
+
+ function protected_definition_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Recover_Active);
+ T5 : constant SAL.Peek_Type := 5;
+ begin
+ return Propagate_Name (Tree, Nonterm, Tokens, T5);
+ end protected_definition_0_check;
+
+ procedure protected_definition_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 => (T2, Motion)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (True, (Simple,
(Int, Ada_Indent)), (Simple, (Int,
+ Ada_Indent))), T2 => (False, (Simple, (Label => None))), T3 => (True,
(Simple, (Int, Ada_Indent)), (Simple,
+ (Int, Ada_Indent))), T4 => (False, (Simple, (Label => None)))));
+ end case;
+ end protected_definition_1;
+
+ procedure protected_definition_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 => (T2, Motion)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (True, (Simple,
(Int, Ada_Indent)), (Simple, (Int,
+ Ada_Indent))), T2 => (False, (Simple, (Label => None))), T4 =>
(False, (Simple, (Label => None))), T5 =>
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end protected_definition_2;
+
+ function protected_definition_2_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Recover_Active);
+ T5 : constant SAL.Peek_Type := 4;
+ begin
+ return Propagate_Name (Tree, Nonterm, Tokens, T5);
+ end protected_definition_2_check;
+
+ procedure protected_definition_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 => (T2, Motion)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (True, (Simple,
(Int, Ada_Indent)), (Simple, (Int,
+ Ada_Indent))), T2 => (False, (Simple, (Label => None))), T4 =>
(False, (Simple, (Label => None)))));
+ end case;
+ end protected_definition_3;
+
+ procedure protected_definition_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T4 : constant SAL.Peek_Type := 2;
+ T5 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 .. 0 => (1, Motion)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (True, (Simple,
(Int, Ada_Indent)), (Simple, (Int,
+ Ada_Indent))), T4 => (False, (Simple, (Label => None))), T5 =>
(False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end protected_definition_4;
+
+ function protected_definition_4_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Recover_Active);
+ T5 : constant SAL.Peek_Type := 3;
+ begin
+ return Propagate_Name (Tree, Nonterm, Tokens, T5);
+ end protected_definition_4_check;
+
+ procedure protected_definition_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T4 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 .. 0 => (1, Motion)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (True, (Simple,
(Int, Ada_Indent)), (Simple, (Int,
+ Ada_Indent))), T4 => (False, (Simple, (Label => None)))));
+ end case;
+ end protected_definition_5;
+
+ procedure protected_definition_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 => (T2, Motion)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Label => None))), T3 => (True, (Simple,
+ (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), T4 => (False,
(Simple, (Label => None))), T5 => (False,
+ (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end protected_definition_6;
+
+ function protected_definition_6_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Recover_Active);
+ T5 : constant SAL.Peek_Type := 4;
+ begin
+ return Propagate_Name (Tree, Nonterm, Tokens, T5);
+ end protected_definition_6_check;
+
+ procedure protected_definition_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 => (T2, Motion)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Label => None))), T3 => (True, (Simple,
+ (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), T4 => (False,
(Simple, (Label => None)))));
+ end case;
+ end protected_definition_7;
+
+ procedure protected_definition_8
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T4 : constant SAL.Peek_Type := 2;
+ T5 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 => (T2, Motion)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Label => None))), T4 => (False, (Simple,
+ (Label => None))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end protected_definition_8;
+
+ function protected_definition_8_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Recover_Active);
+ T5 : constant SAL.Peek_Type := 3;
+ begin
+ return Propagate_Name (Tree, Nonterm, Tokens, T5);
+ end protected_definition_8_check;
+
+ procedure protected_definition_9
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T4 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 => (T2, Motion)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Label => None))), T4 => (False, (Simple,
+ (Label => None)))));
+ end case;
+ end protected_definition_9;
+
+ procedure protected_definition_10
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T4 : constant SAL.Peek_Type := 1;
+ T5 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 .. 0 => (1, Motion)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T4 => (False, (Simple,
(Label => None))), T5 => (False, (Simple,
+ (Int, Ada_Indent_Broken)))));
+ end case;
+ end protected_definition_10;
+
+ function protected_definition_10_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Recover_Active);
+ T5 : constant SAL.Peek_Type := 2;
+ begin
+ return Propagate_Name (Tree, Nonterm, Tokens, T5);
+ end protected_definition_10_check;
+
+ procedure protected_definition_11
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T4 : constant SAL.Peek_Type := 1;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 .. 0 => (1, Motion)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T4 => (False, (Simple,
(Label => None)))));
+ end case;
+ end protected_definition_11;
+
+ procedure protected_body_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ T9 : constant SAL.Peek_Type := 9;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T5, Motion), (T9, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T5, Invalid_Token_ID) &
+ Index_ID'(T9, Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T3, 3, 2), (T8, 3,
2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Label
+ => None))), T5 => (False, (Simple, (Label => None))), T6 => (True,
(Simple, (Block, Ada_Indent)), (Simple,
+ (Int, Ada_Indent))), T7 => (False, (Simple, (Label => None))), T8 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end protected_body_0;
+
+ function protected_body_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T3 : constant SAL.Peek_Type := 3;
+ T8 : constant SAL.Peek_Type := 8;
+ begin
+ return Match_Names (Tree, Tokens, T3, T8, End_Names_Optional);
+ end protected_body_0_check;
+
+ procedure protected_body_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T5, Motion), (T9, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T5, Invalid_Token_ID) &
+ Index_ID'(T9, Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T3, 3, 2), (T8, 3,
2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Label
+ => None))), T5 => (False, (Simple, (Label => None))), T7 => (False,
(Simple, (Label => None))), T8 => (False,
+ (Simple, (Int, Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end protected_body_1;
+
+ function protected_body_1_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T3 : constant SAL.Peek_Type := 3;
+ T8 : constant SAL.Peek_Type := 7;
+ begin
+ return Match_Names (Tree, Tokens, T3, T8, End_Names_Optional);
+ end protected_body_1_check;
+
+ procedure protected_body_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T5, Motion), (T9, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T5, Invalid_Token_ID) &
+ Index_ID'(T9, Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T3, 3, 2), (T8, 3,
2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Label
+ => None))), T6 => (True, (Simple, (Block, Ada_Indent)), (Simple,
(Int, Ada_Indent))), T7 => (False, (Simple,
+ (Label => None))), T8 => (False, (Simple, (Int, Ada_Indent_Broken))),
T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end protected_body_2;
+
+ function protected_body_2_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T3 : constant SAL.Peek_Type := 3;
+ T8 : constant SAL.Peek_Type := 7;
+ begin
+ return Match_Names (Tree, Tokens, T3, T8, End_Names_Optional);
+ end protected_body_2_check;
+
+ procedure protected_body_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T7 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T5, Motion), (T9, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T5, Invalid_Token_ID) &
+ Index_ID'(T9, Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T3, 3, 2), (T8, 3,
2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Label
+ => None))), T7 => (False, (Simple, (Label => None))), T8 => (False,
(Simple, (Int, Ada_Indent_Broken))), T9 =>
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end protected_body_3;
+
+ function protected_body_3_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T3 : constant SAL.Peek_Type := 3;
+ T8 : constant SAL.Peek_Type := 6;
+ begin
+ return Match_Names (Tree, Tokens, T3, T8, End_Names_Optional);
+ end protected_body_3_check;
+
+ procedure entry_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ T9 : constant SAL.Peek_Type := 9;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_Override), (T9,
+ Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Int, Ada_Indent_Broken))),
T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Anchored_0, T4, 1))),
T6 => (False, (Simple, (Anchored_0, T4,
+ 0))), T7 => (False, (Simple, (Int, Ada_Indent_Broken))), T8 =>
(False, (Simple, (Label => None))), T9 =>
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end entry_declaration_0;
+
+ procedure entry_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_Override), (T9,
+ Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Int, Ada_Indent_Broken))),
T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Anchored_0, T4, 1))),
T6 => (False, (Simple, (Anchored_0, T4,
+ 0))), T7 => (False, (Simple, (Int, Ada_Indent_Broken))), T9 =>
(False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end entry_declaration_1;
+
+ procedure entry_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T7 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_Override), (T9,
+ Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Int, Ada_Indent_Broken))),
T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Label => None))), T9 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end entry_declaration_2;
+
+ procedure entry_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T7 : constant SAL.Peek_Type := 4;
+ T9 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_Override), (T9,
+ Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Int, Ada_Indent_Broken))),
T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end entry_declaration_3;
+
+ procedure entry_declaration_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T2,
Statement_Override), (T9, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Label => None))), T3 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple,
+ (Anchored_0, T4, 1))), T6 => (False, (Simple, (Anchored_0, T4, 0))),
T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Label => None))), T9 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end entry_declaration_4;
+
+ procedure entry_declaration_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T2,
Statement_Override), (T9, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Label => None))), T3 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple,
+ (Anchored_0, T4, 1))), T6 => (False, (Simple, (Anchored_0, T4, 0))),
T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end entry_declaration_5;
+
+ procedure entry_declaration_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ T7 : constant SAL.Peek_Type := 3;
+ T8 : constant SAL.Peek_Type := 4;
+ T9 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T2,
Statement_Override), (T9, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Label => None))), T3 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Label
+ => None))), T9 => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end entry_declaration_6;
+
+ procedure entry_declaration_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ T7 : constant SAL.Peek_Type := 3;
+ T9 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T2,
Statement_Override), (T9, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Label => None))), T3 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end entry_declaration_7;
+
+ procedure accept_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ T9 : constant SAL.Peek_Type := 9;
+ T10 : constant SAL.Peek_Type := 10;
+ T11 : constant SAL.Peek_Type := 11;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Motion), (T11, Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T7, Invalid_Token_ID) &
+ Index_ID'(T8, 63) & Index_ID'(T11, Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T2, 3, 1), (T10, 3,
1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Label
+ => None))), T5 => (False, (Simple, (Label => None))), T6 => (False,
(Simple, (Int, Ada_Indent_Broken))), T7 =>
+ (True, (Simple, (Label => None)), (Simple, (Int, Ada_Indent))), T8 =>
(True, (Simple, (Block, Ada_Indent)),
+ (Simple, (Int, Ada_Indent))), T9 => (False, (Simple, (Label =>
None))), T10 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end accept_statement_0;
+
+ function accept_statement_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T2 : constant SAL.Peek_Type := 2;
+ T10 : constant SAL.Peek_Type := 10;
+ begin
+ return Match_Names (Tree, Tokens, T2, T10, End_Names_Optional);
+ end accept_statement_0_check;
+
+ procedure accept_statement_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T11 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T11, Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T11,
+ Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Label
+ => None))), T5 => (False, (Simple, (Label => None))), T6 => (False,
(Simple, (Int, Ada_Indent_Broken))), T11
+ => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end accept_statement_1;
+
+ procedure accept_statement_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T6 : constant SAL.Peek_Type := 3;
+ T7 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ T10 : constant SAL.Peek_Type := 7;
+ T11 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Motion), (T11, Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T7, Invalid_Token_ID) &
+ Index_ID'(T8, 63) & Index_ID'(T11, Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T2, 3, 1), (T10, 3,
1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken))), T7 => (True, (Simple, (Label =>
+ None)), (Simple, (Int, Ada_Indent))), T8 => (True, (Simple, (Block,
Ada_Indent)), (Simple, (Int,
+ Ada_Indent))), T9 => (False, (Simple, (Label => None))), T10 =>
(False, (Simple, (Int, Ada_Indent_Broken))),
+ T11 => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end accept_statement_2;
+
+ function accept_statement_2_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T2 : constant SAL.Peek_Type := 2;
+ T10 : constant SAL.Peek_Type := 7;
+ begin
+ return Match_Names (Tree, Tokens, T2, T10, End_Names_Optional);
+ end accept_statement_2_check;
+
+ procedure accept_statement_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T6 : constant SAL.Peek_Type := 3;
+ T11 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T11, Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T11,
+ Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken))), T11 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end accept_statement_3;
+
+ procedure entry_body_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ T9 : constant SAL.Peek_Type := 9;
+ T10 : constant SAL.Peek_Type := 10;
+ T11 : constant SAL.Peek_Type := 11;
+ T12 : constant SAL.Peek_Type := 12;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T5, Motion), (T6, Motion), (T8, Motion),
+ (T12, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T5, Invalid_Token_ID) &
+ Index_ID'(T6, Invalid_Token_ID) & Index_ID'(T8, Invalid_Token_ID) &
Index_ID'(T9, 63) & Index_ID'(T12,
+ Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T2, 3, 1), (T11, 3,
1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Label
+ => None))), T5 => (False, (Simple, (Int, Ada_Indent_Broken))), T6 =>
(False, (Simple, (Label => None))), T7 =>
+ (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), T8
=> (False, (Simple, (Label => None))), T9
+ => (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))),
T10 => (False, (Simple, (Label =>
+ None))), T11 => (False, (Simple, (Int, Ada_Indent_Broken))), T12 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end entry_body_0;
+
+ function entry_body_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T2 : constant SAL.Peek_Type := 2;
+ T11 : constant SAL.Peek_Type := 11;
+ begin
+ return Match_Names (Tree, Tokens, T2, T11, End_Names_Optional);
+ end entry_body_0_check;
+
+ procedure entry_body_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ T10 : constant SAL.Peek_Type := 9;
+ T11 : constant SAL.Peek_Type := 10;
+ T12 : constant SAL.Peek_Type := 11;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T5, Motion), (T6, Motion), (T8, Motion),
+ (T12, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T5, Invalid_Token_ID) &
+ Index_ID'(T6, Invalid_Token_ID) & Index_ID'(T8, Invalid_Token_ID) &
Index_ID'(T9, 63) & Index_ID'(T12,
+ Invalid_Token_ID)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T2, 3, 1), (T11, 3,
1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Label => None))), T7 =>
(True, (Simple, (Int, Ada_Indent)),
+ (Simple, (Int, Ada_Indent))), T8 => (False, (Simple, (Label =>
None))), T9 => (True, (Simple, (Int,
+ Ada_Indent)), (Simple, (Int, Ada_Indent))), T10 => (False, (Simple,
(Label => None))), T11 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T12 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end entry_body_1;
+
+ function entry_body_1_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Nonterm, Recover_Active);
+ T2 : constant SAL.Peek_Type := 2;
+ T11 : constant SAL.Peek_Type := 10;
+ begin
+ return Match_Names (Tree, Tokens, T2, T11, End_Names_Optional);
+ end entry_body_1_check;
+
+ procedure entry_body_formal_part_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Anchored_0, T1, 1))), T3 => (False, (Simple, (Anchored_0, T1, 0))),
T4 => (False, (Simple, (Label =>
+ None)))));
+ end case;
+ end entry_body_formal_part_0;
+
+ procedure entry_body_formal_part_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T4 : constant SAL.Peek_Type := 1;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T4 => (False, (Simple,
(Label => None)))));
+ end case;
+ end entry_body_formal_part_1;
+
+ procedure entry_barrier_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 => (T1, Motion)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken)))));
+ end case;
+ end entry_barrier_0;
+
+ procedure requeue_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T5 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T5, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ null;
+ end case;
+ end requeue_statement_0;
+
+ procedure requeue_statement_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T5 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T5, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ null;
+ end case;
+ end requeue_statement_1;
+
+ procedure delay_until_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T4, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end delay_until_statement_0;
+
+ procedure delay_relative_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T3, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end delay_relative_statement_0;
+
+ procedure guard_select_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, ((False, (Simple, (Label
=> None))), (False, (Simple, (Block,
+ Ada_Indent)))));
+ end case;
+ end guard_select_0;
+
+ procedure select_alternative_list_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 => (T2, Motion)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1, 49) &
Index_ID'(T2, Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, -Ada_Indent))), T3 => (False, (Simple, (Label => None)))));
+ end case;
+ end select_alternative_list_1;
+
+ procedure selective_accept_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T3, Motion), (T7, Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T2, 49) & Index_ID'(T3,
+ Invalid_Token_ID) & Index_ID'(T7, Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (True, (Simple,
(Label => None)), (Simple, (Int,
+ Ada_Indent))), T2 => (True, (Simple, (Block, Ada_Indent)), (Simple,
(Int, Ada_Indent))), T3 => (False,
+ (Simple, (Label => None))), T4 => (True, (Simple, (Block,
Ada_Indent)), (Simple, (Int, Ada_Indent))), T5 =>
+ (False, (Simple, (Label => None))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken))), T7 => (False, (Simple,
+ (Int, Ada_Indent_Broken)))));
+ end case;
+ end selective_accept_0;
+
+ procedure selective_accept_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T5 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ T7 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T2, 49) & Index_ID'(T7,
+ Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (True, (Simple,
(Label => None)), (Simple, (Int,
+ Ada_Indent))), T2 => (True, (Simple, (Block, Ada_Indent)), (Simple,
(Int, Ada_Indent))), T5 => (False,
+ (Simple, (Label => None))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end selective_accept_1;
+
+ procedure guard_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Anchored_0, T1, Ada_Indent_Broken))), T3 => (False, (Simple,
(Anchored_0, T1, Ada_Indent_Broken)))));
+ end case;
+ end guard_0;
+
+ procedure terminate_alternative_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken)))));
+ end case;
+ end terminate_alternative_0;
+
+ procedure timed_entry_call_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T3, Motion), (T6, Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T3, Invalid_Token_ID) &
+ Index_ID'(T7, Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (True, (Simple,
+ (Block, Ada_Indent)), (Simple, (Int, Ada_Indent))), T3 => (False,
(Simple, (Label => None))), T4 => (True,
+ (Simple, (Block, Ada_Indent)), (Simple, (Int, Ada_Indent))), T5 =>
(False, (Simple, (Label => None))), T6 =>
+ (False, (Simple, (Int, Ada_Indent_Broken))), T7 => (False, (Simple,
(Int, Ada_Indent_Broken)))));
+ end case;
+ end timed_entry_call_0;
+
+ procedure conditional_entry_call_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T3, Motion), (T7, Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T3, Invalid_Token_ID) &
+ Index_ID'(T7, Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (True, (Simple,
+ (Block, Ada_Indent)), (Simple, (Int, Ada_Indent))), T3 => (False,
(Simple, (Label => None))), T4 => (True,
+ (Simple, (Block, Ada_Indent)), (Simple, (Int, Ada_Indent))), T5 =>
(False, (Simple, (Label => None))), T6 =>
+ (False, (Simple, (Int, Ada_Indent_Broken))), T7 => (False, (Simple,
(Int, Ada_Indent_Broken)))));
+ end case;
+ end conditional_entry_call_0;
+
+ procedure asynchronous_select_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T3, Motion), (T8, Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T3, Invalid_Token_ID) &
+ Index_ID'(T8, Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (True, (Simple,
+ (Block, Ada_Indent)), (Simple, (Int, Ada_Indent))), T3 => (True,
(Simple, (Label => None)), (Simple, (Int,
+ Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (True, (Simple, (Block,
+ Ada_Indent)), (Simple, (Int, Ada_Indent))), T6 => (False, (Simple,
(Label => None))), T7 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end asynchronous_select_0;
+
+ procedure abort_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 => (T1,
Statement_Start)));
+ when Face =>
+ null;
+ when Indent =>
+ null;
+ end case;
+ end abort_statement_0;
+
+ procedure compilation_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (1 => (True, (Simple,
(Int, 0)), (Simple, (Int, 0)))));
+ end case;
+ end compilation_0;
+
+ function compilation_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
+ is
+ pragma Unreferenced (Tokens);
+ begin
+ return Terminate_Partial_Parse (Tree, Partial_Parse_Active,
Partial_Parse_Byte_Goal, Recover_Active, Nonterm);
+ end compilation_0_check;
+
+ procedure compilation_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, ((False, (Simple, (Int,
0))), (True, (Simple, (Int, 0)), (Simple,
+ (Int, 0)))));
+ end case;
+ end compilation_1;
+
+ procedure compilation_unit_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Int, 0))), T2 => (False, (Simple, (Int,
+ 0)))));
+ end case;
+ end compilation_unit_1;
+
+ procedure compilation_unit_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Int, 0)))));
+ end case;
+ end compilation_unit_2;
+
+ procedure limited_with_clause_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T5, Statement_End)));
+ when Face =>
+ Face_Apply_List_Action (Parse_Data, Tree, Nonterm, (1 => (T4, 1, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_With))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end limited_with_clause_0;
+
+ procedure limited_with_clause_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T5, Statement_End)));
+ when Face =>
+ Face_Apply_List_Action (Parse_Data, Tree, Nonterm, (1 => (T4, 1, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T3 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_With))), T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end limited_with_clause_1;
+
+ procedure nonlimited_with_clause_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_Override), (T4,
+ Statement_End)));
+ when Face =>
+ Face_Apply_List_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 1, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Int, Ada_Indent_With))),
T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end nonlimited_with_clause_0;
+
+ procedure nonlimited_with_clause_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T2,
Statement_Override), (T4, Statement_End)));
+ when Face =>
+ Face_Apply_List_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 1, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Label => None))), T3 => (False, (Simple,
+ (Int, Ada_Indent_With))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end nonlimited_with_clause_1;
+
+ procedure subprogram_body_stub_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_Override), (T6,
+ Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Label => None))), T4 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Label => None))), T6 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end subprogram_body_stub_0;
+
+ procedure subprogram_body_stub_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_Override), (T6,
+ Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Label => None))), T4 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end subprogram_body_stub_1;
+
+ procedure subprogram_body_stub_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T2,
Statement_Override), (T6, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Label => None))), T3 => (False, (Simple,
+ (Label => None))), T4 => (False, (Simple, (Int, Ada_Indent_Broken))),
T5 => (False, (Simple, (Label =>
+ None))), T6 => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end subprogram_body_stub_2;
+
+ procedure subprogram_body_stub_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T2,
Statement_Override), (T6, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Label => None))), T3 => (False, (Simple,
+ (Label => None))), T4 => (False, (Simple, (Int, Ada_Indent_Broken))),
T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end subprogram_body_stub_3;
+
+ procedure package_body_stub_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 1, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Label
+ => None))), T5 => (False, (Simple, (Int, Ada_Indent_Broken))), T6 =>
(False, (Simple, (Label => None))), T7 =>
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end package_body_stub_0;
+
+ procedure package_body_stub_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 1, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Label
+ => None))), T5 => (False, (Simple, (Int, Ada_Indent_Broken))), T7 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end package_body_stub_1;
+
+ procedure task_body_stub_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Int, Ada_Indent_Broken))),
T4 => (False, (Simple, (Label =>
+ None))), T5 => (False, (Simple, (Int, Ada_Indent_Broken))), T6 =>
(False, (Simple, (Label => None))), T7 =>
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end task_body_stub_0;
+
+ procedure task_body_stub_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Int, Ada_Indent_Broken))),
T4 => (False, (Simple, (Label =>
+ None))), T5 => (False, (Simple, (Int, Ada_Indent_Broken))), T7 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end task_body_stub_1;
+
+ procedure protected_body_stub_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Simple, (Label =>
+ None))), T7 => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end protected_body_stub_0;
+
+ procedure protected_body_stub_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end protected_body_stub_1;
+
+ procedure subunit_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 => (T1,
Statement_Start)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Anchored_0, T2,
1))), T4 => (False, (Simple, (Anchored_0,
+ T2, 0))), T5 => (False, (Simple, (Label => None)))));
+ end case;
+ end subunit_0;
+
+ procedure exception_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T5 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T5, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ null;
+ end case;
+ end exception_declaration_0;
+
+ procedure exception_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T5 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T5, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ null;
+ end case;
+ end exception_declaration_1;
+
+ procedure exception_handler_list_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(1,
Invalid_Token_ID) & Index_ID'(2, Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ null;
+ end case;
+ end exception_handler_list_2;
+
+ procedure handled_sequence_of_statements_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (True, (Simple,
(Label => None)), (Simple, (Label =>
+ None))), T2 => (False, (Simple, (Int, -Ada_Indent))), T3 => (True,
(Simple, (Int, Ada_Indent_When -
+ Ada_Indent)), (Simple, (Int, Ada_Indent_When - Ada_Indent)))));
+ end case;
+ end handled_sequence_of_statements_0;
+
+ procedure handled_sequence_of_statements_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (True, (Simple,
(Label => None)), (Simple, (Label =>
+ None)))));
+ end case;
+ end handled_sequence_of_statements_1;
+
+ procedure exception_handler_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 => (T1, Motion)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (True, (Simple, (Block,
+ Ada_Indent)), (Simple, (Int, Ada_Indent)))));
+ end case;
+ end exception_handler_0;
+
+ procedure exception_handler_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T4 : constant SAL.Peek_Type := 2;
+ T5 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 => (T1, Motion)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T4 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (True, (Simple, (Block,
+ Ada_Indent)), (Simple, (Int, Ada_Indent)))));
+ end case;
+ end exception_handler_1;
+
+ procedure raise_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ null;
+ end case;
+ end raise_statement_0;
+
+ procedure raise_statement_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T5, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T3
=> (False, (Simple, (Int,
+ Ada_Indent_Broken))), T4 => (False, (Simple, (Anchored_1, T3,
Ada_Indent_Broken))), T5 => (False, (Simple,
+ (Int, Ada_Indent_Broken)))));
+ end case;
+ end raise_statement_1;
+
+ procedure raise_statement_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T5 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T5, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T5
=> (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end raise_statement_2;
+
+ procedure raise_expression_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end raise_expression_0;
+
+ procedure raise_expression_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken)))));
+ end case;
+ end raise_expression_1;
+
+ procedure generic_subprogram_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_Override), (T4,
+ Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T2, Invalid_Token_ID) &
+ Index_ID'(T4, Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ null;
+ end case;
+ end generic_subprogram_declaration_0;
+
+ procedure generic_subprogram_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_Override), (T4,
+ Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T2, Invalid_Token_ID) &
+ Index_ID'(T4, Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ null;
+ end case;
+ end generic_subprogram_declaration_1;
+
+ procedure generic_package_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T3, Statement_End)));
+ Motion_Action (Parse_Data, Tree, Nonterm, (Index_ID'(T1,
Invalid_Token_ID) & Index_ID'(T2, Invalid_Token_ID) &
+ Index_ID'(T3, Invalid_Token_ID)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (True, (Simple,
(Label => None)), (Simple, (Int,
+ Ada_Indent))), T2 => (False, (Simple, (Label => None))), T3 =>
(False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end generic_package_declaration_0;
+
+ procedure generic_formal_part_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 => (T1,
Statement_Start)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Block, Ada_Indent)))));
+ end case;
+ end generic_formal_part_0;
+
+ procedure generic_formal_part_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 => (T1,
Statement_Start)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None)))));
+ end case;
+ end generic_formal_part_1;
+
+ procedure generic_instantiation_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 1, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T3
=> (False, (Simple, (Label => None))), T4
+ => (False, (Simple, (Int, Ada_Indent_Broken))), T5 => (False,
(Hanging_2, (Int, Ada_Indent_Broken), (Int,
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Label => None))), T7 =>
(False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end generic_instantiation_0;
+
+ procedure generic_instantiation_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T2);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 1, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T3
=> (False, (Simple, (Label => None))), T4
+ => (False, (Simple, (Int, Ada_Indent_Broken))), T5 => (False,
(Hanging_2, (Int, Ada_Indent_Broken), (Int,
+ Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end generic_instantiation_1;
+
+ procedure generic_instantiation_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_Override), (T8,
+ Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 1, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T4 =>
+ (False, (Simple, (Int, Ada_Indent_Broken))), T5 => (False, (Simple,
(Int, Ada_Indent_Broken))), T6 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T7
=> (False, (Simple, (Label => None))), T8
+ => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end generic_instantiation_2;
+
+ procedure generic_instantiation_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_Override), (T8,
+ Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 1, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T4 =>
+ (False, (Simple, (Int, Ada_Indent_Broken))), T5 => (False, (Simple,
(Int, Ada_Indent_Broken))), T6 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T8
=> (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end generic_instantiation_3;
+
+ procedure generic_instantiation_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T2,
Statement_Override), (T8, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 1, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Label => None))), T3 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T4
=> (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T7 => (False,
(Simple, (Label => None))), T8 => (False,
+ (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end generic_instantiation_4;
+
+ procedure generic_instantiation_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T2,
Statement_Override), (T8, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 1, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Label => None))), T3 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T4
=> (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T8 => (False,
(Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end generic_instantiation_5;
+
+ procedure generic_instantiation_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_Override), (T8,
+ Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 1, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T4 =>
+ (False, (Simple, (Int, Ada_Indent_Broken))), T5 => (False, (Simple,
(Int, Ada_Indent_Broken))), T6 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T7
=> (False, (Simple, (Label => None))), T8
+ => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end generic_instantiation_6;
+
+ procedure generic_instantiation_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T2, Statement_Override), (T8,
+ Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 1, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T4 =>
+ (False, (Simple, (Int, Ada_Indent_Broken))), T5 => (False, (Simple,
(Int, Ada_Indent_Broken))), T6 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T8
=> (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end generic_instantiation_7;
+
+ procedure generic_instantiation_8
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T2,
Statement_Override), (T8, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 1, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Label => None))), T3 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T4
=> (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T7 => (False,
(Simple, (Label => None))), T8 => (False,
+ (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end generic_instantiation_8;
+
+ procedure generic_instantiation_9
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T2 : constant SAL.Peek_Type := 1;
+ T3 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T2,
Statement_Override), (T8, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, T3);
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T3, 1, 1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T2 => (False, (Simple,
(Label => None))), T3 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T4
=> (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T8 => (False,
(Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end generic_instantiation_9;
+
+ procedure formal_object_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6 =>
+ (False, (Hanging_1, (Anchored_1, T5, Ada_Indent_Broken), (Anchored_1,
T5, 2 * Ada_Indent_Broken))), T7 =>
+ (False, (Simple, (Int, Ada_Indent_Broken))), T8 => (False, (Simple,
(Int, Ada_Indent_Broken)))));
+ end case;
+ end formal_object_declaration_0;
+
+ procedure formal_object_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6 =>
+ (False, (Hanging_1, (Anchored_1, T5, Ada_Indent_Broken), (Anchored_1,
T5, 2 * Ada_Indent_Broken))), T8 =>
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end formal_object_declaration_1;
+
+ procedure formal_object_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T7 =>
+ (False, (Simple, (Int, Ada_Indent_Broken))), T8 => (False, (Simple,
(Int, Ada_Indent_Broken)))));
+ end case;
+ end formal_object_declaration_2;
+
+ procedure formal_object_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T8 =>
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end formal_object_declaration_3;
+
+ procedure formal_object_declaration_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6 => (False,
(Hanging_1, (Anchored_1, T5, Ada_Indent_Broken),
+ (Anchored_1, T5, 2 * Ada_Indent_Broken))), T7 => (False, (Simple,
(Int, Ada_Indent_Broken))), T8 => (False,
+ (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end formal_object_declaration_4;
+
+ procedure formal_object_declaration_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T6 => (False,
(Hanging_1, (Anchored_1, T5, Ada_Indent_Broken),
+ (Anchored_1, T5, 2 * Ada_Indent_Broken))), T8 => (False, (Simple,
(Int, Ada_Indent_Broken)))));
+ end case;
+ end formal_object_declaration_5;
+
+ procedure formal_object_declaration_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T7 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T7 => (False,
(Simple, (Int, Ada_Indent_Broken))), T8 =>
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end formal_object_declaration_6;
+
+ procedure formal_object_declaration_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T8 => (False,
(Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end formal_object_declaration_7;
+
+ procedure formal_object_declaration_8
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Hanging_1, (Anchored_1, T4,
Ada_Indent_Broken), (Anchored_1, T4, 2 *
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end formal_object_declaration_8;
+
+ procedure formal_object_declaration_9
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Hanging_1, (Anchored_1, T4,
Ada_Indent_Broken), (Anchored_1, T4, 2 *
+ Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end formal_object_declaration_9;
+
+ procedure formal_object_declaration_10
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end formal_object_declaration_10;
+
+ procedure formal_object_declaration_11
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T7 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end formal_object_declaration_11;
+
+ procedure formal_complete_type_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ T9 : constant SAL.Peek_Type := 9;
+ T10 : constant SAL.Peek_Type := 10;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T2, 3, 2), (T8, 3,
2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end formal_complete_type_declaration_0;
+
+ procedure formal_complete_type_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ T10 : constant SAL.Peek_Type := 9;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T2, 3, 2), (T8, 3,
2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end formal_complete_type_declaration_1;
+
+ procedure formal_complete_type_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ T10 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end formal_complete_type_declaration_2;
+
+ procedure formal_complete_type_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T10 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end formal_complete_type_declaration_3;
+
+ procedure formal_complete_type_declaration_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ T10 : constant SAL.Peek_Type := 9;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T2, 3, 2), (T8, 3,
2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end formal_complete_type_declaration_4;
+
+ procedure formal_complete_type_declaration_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T10 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T2, 3, 2), (T8, 3,
2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end formal_complete_type_declaration_5;
+
+ procedure formal_complete_type_declaration_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T9 : constant SAL.Peek_Type := 5;
+ T10 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end formal_complete_type_declaration_6;
+
+ procedure formal_complete_type_declaration_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T10 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end formal_complete_type_declaration_7;
+
+ procedure formal_incomplete_type_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ T9 : constant SAL.Peek_Type := 9;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T9, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T2, 3, 2), (T8, 3,
2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end formal_incomplete_type_declaration_0;
+
+ procedure formal_incomplete_type_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T9, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end formal_incomplete_type_declaration_1;
+
+ procedure formal_incomplete_type_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ T7 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T9, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T2, 3, 2), (T8, 3,
2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end formal_incomplete_type_declaration_2;
+
+ procedure formal_incomplete_type_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T9 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T9, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end formal_incomplete_type_declaration_3;
+
+ procedure formal_incomplete_type_declaration_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T9, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T2, 3, 2), (T8, 3,
2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end formal_incomplete_type_declaration_4;
+
+ procedure formal_incomplete_type_declaration_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T4 : constant SAL.Peek_Type := 3;
+ T5 : constant SAL.Peek_Type := 4;
+ T9 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T9, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end formal_incomplete_type_declaration_5;
+
+ procedure formal_incomplete_type_declaration_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T6 : constant SAL.Peek_Type := 3;
+ T7 : constant SAL.Peek_Type := 4;
+ T8 : constant SAL.Peek_Type := 5;
+ T9 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T9, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T2, 3, 2), (T8, 3,
2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end formal_incomplete_type_declaration_6;
+
+ procedure formal_incomplete_type_declaration_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T9 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T9, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 3, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T9 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end formal_incomplete_type_declaration_7;
+
+ procedure formal_derived_type_definition_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T5 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 1, 2)));
+ when Indent =>
+ null;
+ end case;
+ end formal_derived_type_definition_0;
+
+ procedure formal_derived_type_definition_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T5 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 1, 2)));
+ when Indent =>
+ null;
+ end case;
+ end formal_derived_type_definition_1;
+
+ procedure formal_derived_type_definition_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T5 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 1, 2)));
+ when Indent =>
+ null;
+ end case;
+ end formal_derived_type_definition_2;
+
+ procedure formal_derived_type_definition_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T5 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 1, 2)));
+ when Indent =>
+ null;
+ end case;
+ end formal_derived_type_definition_3;
+
+ procedure formal_derived_type_definition_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T5 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 1, 2)));
+ when Indent =>
+ null;
+ end case;
+ end formal_derived_type_definition_4;
+
+ procedure formal_derived_type_definition_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T5 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 1, 2)));
+ when Indent =>
+ null;
+ end case;
+ end formal_derived_type_definition_5;
+
+ procedure formal_derived_type_definition_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T5 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 1, 2)));
+ when Indent =>
+ null;
+ end case;
+ end formal_derived_type_definition_6;
+
+ procedure formal_derived_type_definition_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T5 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 1, 2)));
+ when Indent =>
+ null;
+ end case;
+ end formal_derived_type_definition_7;
+
+ procedure formal_derived_type_definition_8
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T5 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 1, 2)));
+ when Indent =>
+ null;
+ end case;
+ end formal_derived_type_definition_8;
+
+ procedure formal_derived_type_definition_9
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T5 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 1, 2)));
+ when Indent =>
+ null;
+ end case;
+ end formal_derived_type_definition_9;
+
+ procedure formal_derived_type_definition_10
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T5 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 1, 2)));
+ when Indent =>
+ null;
+ end case;
+ end formal_derived_type_definition_10;
+
+ procedure formal_derived_type_definition_11
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T5 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 1, 2)));
+ when Indent =>
+ null;
+ end case;
+ end formal_derived_type_definition_11;
+
+ procedure formal_derived_type_definition_12
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T5 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 1, 2)));
+ when Indent =>
+ null;
+ end case;
+ end formal_derived_type_definition_12;
+
+ procedure formal_derived_type_definition_13
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T5 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 1, 2)));
+ when Indent =>
+ null;
+ end case;
+ end formal_derived_type_definition_13;
+
+ procedure formal_derived_type_definition_14
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T5 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 1, 2)));
+ when Indent =>
+ null;
+ end case;
+ end formal_derived_type_definition_14;
+
+ procedure formal_derived_type_definition_15
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T5 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 1, 2)));
+ when Indent =>
+ null;
+ end case;
+ end formal_derived_type_definition_15;
+
+ procedure formal_derived_type_definition_16
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T5 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 1, 2)));
+ when Indent =>
+ null;
+ end case;
+ end formal_derived_type_definition_16;
+
+ procedure formal_derived_type_definition_17
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T5 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T5, 1, 2)));
+ when Indent =>
+ null;
+ end case;
+ end formal_derived_type_definition_17;
+
+ procedure formal_concrete_subprogram_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Int, Ada_Indent_Broken))),
T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end formal_concrete_subprogram_declaration_0;
+
+ procedure formal_concrete_subprogram_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Int, Ada_Indent_Broken))),
T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end formal_concrete_subprogram_declaration_1;
+
+ procedure formal_concrete_subprogram_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T5 : constant SAL.Peek_Type := 3;
+ T6 : constant SAL.Peek_Type := 4;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T5 => (False, (Simple, (Int, Ada_Indent_Broken))),
T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end formal_concrete_subprogram_declaration_2;
+
+ procedure formal_concrete_subprogram_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T6 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end formal_concrete_subprogram_declaration_3;
+
+ procedure formal_abstract_subprogram_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Int, Ada_Indent_Broken))),
T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end formal_abstract_subprogram_declaration_0;
+
+ procedure formal_abstract_subprogram_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Int, Ada_Indent_Broken))),
T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end formal_abstract_subprogram_declaration_1;
+
+ procedure formal_abstract_subprogram_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Int, Ada_Indent_Broken))),
T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end formal_abstract_subprogram_declaration_2;
+
+ procedure formal_abstract_subprogram_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T7 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Int, Ada_Indent_Broken))),
T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end formal_abstract_subprogram_declaration_3;
+
+ procedure default_name_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (1, 1, 1)));
+ when Indent =>
+ null;
+ end case;
+ end default_name_0;
+
+ procedure formal_package_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T3, 1, 1), (T6, 1,
1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T7 => (False,
(Simple, (Int, Ada_Indent_Broken))), T8 =>
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end formal_package_declaration_0;
+
+ procedure formal_package_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T3, 1, 1), (T6, 1,
1)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Hanging_2, (Int,
+ Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T8 => (False,
(Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end formal_package_declaration_1;
+
+ procedure aspect_association_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Label => None))), T3 => (False, (Simple, (Language,
Ada_Indent_Aspect'Access, Null_Args)))));
+ end case;
+ end aspect_association_0;
+
+ procedure aspect_association_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None)))));
+ end case;
+ end aspect_association_1;
+
+ procedure aspect_specification_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (True, (Simple,
+ (Int, Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end aspect_specification_0;
+
+ procedure attribute_definition_clause_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T7, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T7 => (False, (Simple, (Label => None)))));
+ end case;
+ end attribute_definition_clause_0;
+
+ procedure enumeration_representation_clause_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T5, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T3
=> (False, (Simple, (Int,
+ Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end enumeration_representation_clause_0;
+
+ procedure record_representation_clause_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ T9 : constant SAL.Peek_Type := 9;
+ T10 : constant SAL.Peek_Type := 10;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T2, 1, 2), (T9, 1,
2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T3
=> (False, (Simple, (Int,
+ Ada_Indent_Broken))), T4 => (True, (Simple, (Language,
Ada_Indent_Record_1'Access, 51 & Integer (T4) & 0)),
+ (Simple, (Language, Ada_Indent_Record_1'Access, 51 & Integer (T4) &
Ada_Indent))), T5 => (False, (Simple,
+ (Language, Ada_Indent_Record_0'Access, Integer (T1) & Integer (T4) &
Ada_Indent))), T6 => (True, (Simple,
+ (Language, Ada_Indent_Record_1'Access, 51 & Integer (T4) &
Ada_Indent)), (Simple, (Language,
+ Ada_Indent_Record_1'Access, 51 & Integer (T4) & Ada_Indent))), T7 =>
(False, (Simple, (Language,
+ Ada_Indent_Record_1'Access, 51 & Integer (T4) & 0))), T8 => (False,
(Simple, (Int, Ada_Indent_Broken))), T9 =>
+ (False, (Hanging_2, (Int, Ada_Indent_Broken), (Int,
Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end record_representation_clause_0;
+
+ procedure record_representation_clause_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ T10 : constant SAL.Peek_Type := 9;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T3
=> (False, (Simple, (Int,
+ Ada_Indent_Broken))), T4 => (True, (Simple, (Language,
Ada_Indent_Record_1'Access, 51 & Integer (T4) & 0)),
+ (Simple, (Language, Ada_Indent_Record_1'Access, 51 & Integer (T4) &
Ada_Indent))), T5 => (False, (Simple,
+ (Language, Ada_Indent_Record_0'Access, Integer (T1) & Integer (T4) &
Ada_Indent))), T6 => (True, (Simple,
+ (Language, Ada_Indent_Record_1'Access, 51 & Integer (T4) &
Ada_Indent)), (Simple, (Language,
+ Ada_Indent_Record_1'Access, 51 & Integer (T4) & Ada_Indent))), T7 =>
(False, (Simple, (Language,
+ Ada_Indent_Record_1'Access, 51 & Integer (T4) & 0))), T8 => (False,
(Simple, (Int, Ada_Indent_Broken))), T10
+ => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end record_representation_clause_1;
+
+ procedure record_representation_clause_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ T10 : constant SAL.Peek_Type := 9;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T2, 1, 2), (T9, 1,
2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T3
=> (False, (Simple, (Int,
+ Ada_Indent_Broken))), T4 => (True, (Simple, (Language,
Ada_Indent_Record_1'Access, 51 & Integer (T4) & 0)),
+ (Simple, (Language, Ada_Indent_Record_1'Access, 51 & Integer (T4) &
Ada_Indent))), T5 => (False, (Simple,
+ (Language, Ada_Indent_Record_0'Access, Integer (T1) & Integer (T4) &
Ada_Indent))), T7 => (False, (Simple,
+ (Language, Ada_Indent_Record_1'Access, 51 & Integer (T4) & 0))), T8
=> (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T10 =>
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end record_representation_clause_2;
+
+ procedure record_representation_clause_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T10 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T3
=> (False, (Simple, (Int,
+ Ada_Indent_Broken))), T4 => (True, (Simple, (Language,
Ada_Indent_Record_1'Access, 51 & Integer (T4) & 0)),
+ (Simple, (Language, Ada_Indent_Record_1'Access, 51 & Integer (T4) &
Ada_Indent))), T5 => (False, (Simple,
+ (Language, Ada_Indent_Record_0'Access, Integer (T1) & Integer (T4) &
Ada_Indent))), T7 => (False, (Simple,
+ (Language, Ada_Indent_Record_1'Access, 51 & Integer (T4) & 0))), T8
=> (False, (Simple, (Int,
+ Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end record_representation_clause_3;
+
+ procedure record_representation_clause_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T9 : constant SAL.Peek_Type := 8;
+ T10 : constant SAL.Peek_Type := 9;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T2, 1, 2), (T9, 1,
2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T3
=> (False, (Simple, (Int,
+ Ada_Indent_Broken))), T4 => (True, (Simple, (Language,
Ada_Indent_Record_1'Access, 51 & Integer (T4) & 0)),
+ (Simple, (Language, Ada_Indent_Record_1'Access, 51 & Integer (T4) &
Ada_Indent))), T6 => (True, (Simple,
+ (Language, Ada_Indent_Record_1'Access, 51 & Integer (T4) &
Ada_Indent)), (Simple, (Language,
+ Ada_Indent_Record_1'Access, 51 & Integer (T4) & Ada_Indent))), T7 =>
(False, (Simple, (Language,
+ Ada_Indent_Record_1'Access, 51 & Integer (T4) & 0))), T8 => (False,
(Simple, (Int, Ada_Indent_Broken))), T9 =>
+ (False, (Hanging_2, (Int, Ada_Indent_Broken), (Int,
Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end record_representation_clause_4;
+
+ procedure record_representation_clause_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T6 : constant SAL.Peek_Type := 5;
+ T7 : constant SAL.Peek_Type := 6;
+ T8 : constant SAL.Peek_Type := 7;
+ T10 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T3
=> (False, (Simple, (Int,
+ Ada_Indent_Broken))), T4 => (True, (Simple, (Language,
Ada_Indent_Record_1'Access, 51 & Integer (T4) & 0)),
+ (Simple, (Language, Ada_Indent_Record_1'Access, 51 & Integer (T4) &
Ada_Indent))), T6 => (True, (Simple,
+ (Language, Ada_Indent_Record_1'Access, 51 & Integer (T4) &
Ada_Indent)), (Simple, (Language,
+ Ada_Indent_Record_1'Access, 51 & Integer (T4) & Ada_Indent))), T7 =>
(False, (Simple, (Language,
+ Ada_Indent_Record_1'Access, 51 & Integer (T4) & 0))), T8 => (False,
(Simple, (Int, Ada_Indent_Broken))), T10
+ => (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end record_representation_clause_5;
+
+ procedure record_representation_clause_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T7 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T9 : constant SAL.Peek_Type := 7;
+ T10 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((T2, 1, 2), (T9, 1,
2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T3
=> (False, (Simple, (Int,
+ Ada_Indent_Broken))), T4 => (True, (Simple, (Language,
Ada_Indent_Record_1'Access, 51 & Integer (T4) & 0)),
+ (Simple, (Language, Ada_Indent_Record_1'Access, 51 & Integer (T4) &
Ada_Indent))), T7 => (False, (Simple,
+ (Language, Ada_Indent_Record_1'Access, 51 & Integer (T4) & 0))), T8
=> (False, (Simple, (Int,
+ Ada_Indent_Broken))), T9 => (False, (Hanging_2, (Int,
Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T10 =>
+ (False, (Simple, (Int, Ada_Indent_Broken)))));
+ end case;
+ end record_representation_clause_6;
+
+ procedure record_representation_clause_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T7 : constant SAL.Peek_Type := 5;
+ T8 : constant SAL.Peek_Type := 6;
+ T10 : constant SAL.Peek_Type := 7;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T10, Statement_End)));
+ when Face =>
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (T2, 1, 2)));
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False,
+ (Hanging_2, (Int, Ada_Indent_Broken), (Int, Ada_Indent_Broken))), T3
=> (False, (Simple, (Int,
+ Ada_Indent_Broken))), T4 => (True, (Simple, (Language,
Ada_Indent_Record_1'Access, 51 & Integer (T4) & 0)),
+ (Simple, (Language, Ada_Indent_Record_1'Access, 51 & Integer (T4) &
Ada_Indent))), T7 => (False, (Simple,
+ (Language, Ada_Indent_Record_1'Access, 51 & Integer (T4) & 0))), T8
=> (False, (Simple, (Int,
+ Ada_Indent_Broken))), T10 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end record_representation_clause_7;
+
+ procedure component_clause_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ T4 : constant SAL.Peek_Type := 4;
+ T5 : constant SAL.Peek_Type := 5;
+ T6 : constant SAL.Peek_Type := 6;
+ T7 : constant SAL.Peek_Type := 7;
+ T8 : constant SAL.Peek_Type := 8;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T8, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken))), T4 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T5 => (False, (Simple, (Int,
Ada_Indent_Broken))), T6 => (False, (Simple, (Int,
+ Ada_Indent_Broken))), T7 => (False, (Simple, (Int,
Ada_Indent_Broken))), T8 => (False, (Simple, (Int,
+ Ada_Indent_Broken)))));
+ end case;
+ end component_clause_0;
+
+ procedure delta_constraint_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ T3 : constant SAL.Peek_Type := 3;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken))), T3 => (False, (Simple, (Int,
Ada_Indent_Broken)))));
+ end case;
+ end delta_constraint_0;
+
+ procedure delta_constraint_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T2 : constant SAL.Peek_Type := 2;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ null;
+ when Face =>
+ null;
+ when Indent =>
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, (T1 => (False, (Simple,
(Label => None))), T2 => (False, (Simple,
+ (Int, Ada_Indent_Broken)))));
+ end case;
+ end delta_constraint_1;
+
+ procedure at_clause_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
+ is
+ Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
+ T1 : constant SAL.Peek_Type := 1;
+ T6 : constant SAL.Peek_Type := 6;
+ begin
+ case Parse_Data.Post_Parse_Action is
+ when Navigate =>
+ Statement_Action (Parse_Data, Tree, Nonterm, ((T1, Statement_Start),
(T6, Statement_End)));
+ when Face =>
+ null;
+ when Indent =>
+ null;
+ end case;
+ end at_clause_0;
+
+end Ada_Annex_P_Process_Actions;
diff --git a/ada_annex_p_process_actions.ads b/ada_annex_p_process_actions.ads
new file mode 100644
index 0000000000..cec9c42b85
--- /dev/null
+++ b/ada_annex_p_process_actions.ads
@@ -0,0 +1,3729 @@
+-- generated parser support file. -*- buffer-read-only:t -*-
+-- command line: wisitoken-bnf-generate.exe --generate LR1 Ada_Emacs re2c
PROCESS text_rep ada_annex_p.wy
+--
+
+-- Copyright (C) 2013 - 2022 Free Software Foundation, Inc.
+
+-- This program is free software; you can redistribute it and/or
+-- modify it under the terms of the GNU General Public License as
+-- published by the Free Software Foundation; either version 3, or (at
+-- your option) any later version.
+--
+-- This software is distributed in the hope that it will be useful,
+-- but WITHOUT ANY WARRANTY; without even the implied warranty of
+-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+-- General Public License for more details.
+--
+-- You should have received a copy of the GNU General Public License
+-- along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>.
+
+with WisiToken.Syntax_Trees;
+package Ada_Annex_P_Process_Actions is
+
+ Descriptor : aliased constant WisiToken.Descriptor :=
+ (First_Terminal => 11,
+ Last_Terminal => 119,
+ First_Nonterminal => 120,
+ Last_Nonterminal => 466,
+ SOI_ID => 467,
+ EOI_ID => 119,
+ Accept_ID => 120,
+ Case_Insensitive => True,
+ New_Line_ID => 1,
+ String_1_ID => 118,
+ String_2_ID => 117,
+ Image =>
+ (new String'("WHITESPACE"),
+ new String'("NEW_LINE"),
+ new String'("COMMENT"),
+ new String'("GNAT_PREP_IF"),
+ new String'("GNAT_PREP_ELSIF"),
+ new String'("GNAT_PREP_ELSE"),
+ new String'("GNAT_PREP_END_IF"),
+ new String'("CONFLICT_MARK_A"),
+ new String'("CONFLICT_MARK_B"),
+ new String'("CONFLICT_MARK_END"),
+ new String'("PLACEHOLDER"),
+ new String'("AT"),
+ new String'("RAISE"),
+ new String'("SEPARATE"),
+ new String'("TERMINATE"),
+ new String'("SELECT"),
+ new String'("UNTIL"),
+ new String'("DELAY"),
+ new String'("ABORT"),
+ new String'("REQUEUE"),
+ new String'("ACCEPT"),
+ new String'("ENTRY"),
+ new String'("GENERIC"),
+ new String'("EXCEPTION"),
+ new String'("RENAMES"),
+ new String'("OVERRIDING"),
+ new String'("BODY"),
+ new String'("PRIVATE"),
+ new String'("PACKAGE"),
+ new String'("OUT"),
+ new String'("RETURN"),
+ new String'("GOTO"),
+ new String'("EXIT"),
+ new String'("DO"),
+ new String'("REVERSE"),
+ new String'("WHILE"),
+ new String'("LOOP"),
+ new String'("PARALLEL"),
+ new String'("BEGIN"),
+ new String'("DECLARE"),
+ new String'("SOME"),
+ new String'("ELSE"),
+ new String'("IF"),
+ new String'("THEN"),
+ new String'("ELSIF"),
+ new String'("REM"),
+ new String'("ABS"),
+ new String'("IN"),
+ new String'("XOR"),
+ new String'("OR"),
+ new String'("USE"),
+ new String'("FOR"),
+ new String'("NOT"),
+ new String'("FUNCTION"),
+ new String'("PROCEDURE"),
+ new String'("ALL"),
+ new String'("ACCESS"),
+ new String'("INTERFACE"),
+ new String'("SYNCHRONIZED"),
+ new String'("PROTECTED"),
+ new String'("TASK"),
+ new String'("WITH"),
+ new String'("OTHERS"),
+ new String'("WHEN"),
+ new String'("CASE"),
+ new String'("NULL"),
+ new String'("END"),
+ new String'("RECORD"),
+ new String'("TAGGED"),
+ new String'("OF"),
+ new String'("ARRAY"),
+ new String'("DELTA"),
+ new String'("DIGITS"),
+ new String'("MOD"),
+ new String'("RANGE"),
+ new String'("AND"),
+ new String'("NEW"),
+ new String'("LIMITED"),
+ new String'("ABSTRACT"),
+ new String'("CONSTANT"),
+ new String'("ALIASED"),
+ new String'("SUBTYPE"),
+ new String'("IS"),
+ new String'("TYPE"),
+ new String'("PRAGMA"),
+ new String'("LEFT_PAREN"),
+ new String'("LEFT_SQUARE_BRACKET"),
+ new String'("RIGHT_PAREN"),
+ new String'("RIGHT_SQUARE_BRACKET"),
+ new String'("AMPERSAND"),
+ new String'("AT_SIGN"),
+ new String'("BAR"),
+ new String'("BOX"),
+ new String'("COLON"),
+ new String'("COLON_EQUAL"),
+ new String'("COMMA"),
+ new String'("DOT"),
+ new String'("DOT_DOT"),
+ new String'("EQUAL"),
+ new String'("EQUAL_GREATER"),
+ new String'("GREATER"),
+ new String'("GREATER_EQUAL"),
+ new String'("GREATER_GREATER"),
+ new String'("LESS"),
+ new String'("LESS_EQUAL"),
+ new String'("LESS_LESS"),
+ new String'("MINUS"),
+ new String'("PLUS"),
+ new String'("SEMICOLON"),
+ new String'("SLASH"),
+ new String'("SLASH_EQUAL"),
+ new String'("STAR"),
+ new String'("STAR_STAR"),
+ new String'("TICK_1"),
+ new String'("TICK_2"),
+ new String'("NUMERIC_LITERAL"),
+ new String'("IDENTIFIER"),
+ new String'("STRING_LITERAL"),
+ new String'("CHARACTER_LITERAL"),
+ new String'("Wisi_EOI"),
+ new String'("wisitoken_accept"),
+ new String'("tick"),
+ new String'("conditional_quantified_expression"),
+ new String'("pragma_argument_association_list"),
+ new String'("pragma_g"),
+ new String'("pragma_argument_association"),
+ new String'("basic_declaration"),
+ new String'("type_declaration"),
+ new String'("full_type_declaration"),
+ new String'("type_definition"),
+ new String'("subtype_declaration"),
+ new String'("subtype_indication"),
+ new String'("constraint"),
+ new String'("scalar_constraint"),
+ new String'("assign_value"),
+ new String'("object_declaration"),
+ new String'("defining_identifier_list"),
+ new String'("number_declaration"),
+ new String'("derived_type_definition"),
+ new String'("range_constraint"),
+ new String'("range_g"),
+ new String'("enumeration_literal_list"),
+ new String'("enumeration_type_definition"),
+ new String'("enumeration_literal_specification"),
+ new String'("integer_type_definition"),
+ new String'("signed_integer_type_definition"),
+ new String'("modular_type_definition"),
+ new String'("real_type_definition"),
+ new String'("floating_point_definition"),
+ new String'("real_range_specification"),
+ new String'("fixed_point_definition"),
+ new String'("ordinary_fixed_point_definition"),
+ new String'("decimal_fixed_point_definition"),
+ new String'("digits_constraint"),
+ new String'("array_type_definition"),
+ new String'("index_subtype_definition_list"),
+ new String'("unconstrained_array_definition"),
+ new String'("index_subtype_definition"),
+ new String'("discrete_subtype_definition_list"),
+ new String'("constrained_array_definition"),
+ new String'("discrete_subtype_definition"),
+ new String'("component_definition"),
+ new String'("index_constraint"),
+ new String'("discrete_range"),
+ new String'("discriminant_part"),
+ new String'("unknown_discriminant_part"),
+ new String'("discriminant_specification_list"),
+ new String'("known_discriminant_part"),
+ new String'("discriminant_specification"),
+ new String'("record_type_definition"),
+ new String'("record_definition"),
+ new String'("component_list"),
+ new String'("component_item"),
+ new String'("component_declaration"),
+ new String'("variant_list"),
+ new String'("variant_part"),
+ new String'("variant"),
+ new String'("discrete_choice_list"),
+ new String'("discrete_choice"),
+ new String'("record_extension_part"),
+ new String'("abstract_subprogram_declaration"),
+ new String'("interface_type_definition"),
+ new String'("interface_list"),
+ new String'("access_type_definition"),
+ new String'("access_to_object_definition"),
+ new String'("general_access_modifier"),
+ new String'("access_to_subprogram_definition"),
+ new String'("null_exclusion"),
+ new String'("access_definition"),
+ new String'("incomplete_type_declaration"),
+ new String'("declarative_item"),
+ new String'("declarative_item_pragma"),
+ new String'("declarative_part"),
+ new String'("basic_declarative_item"),
+ new String'("proper_body"),
+ new String'("name"),
+ new String'("direct_name"),
+ new String'("explicit_dereference"),
+ new String'("slice"),
+ new String'("selected_component"),
+ new String'("selector_name"),
+ new String'("attribute_reference"),
+ new String'("attribute_designator"),
+ new String'("range_attribute_reference"),
+ new String'("range_attribute_designator"),
+ new String'("aggregate"),
+ new String'("record_aggregate"),
+ new String'("record_component_association_list"),
+ new String'("record_component_association"),
+ new String'("component_choice_list"),
+ new String'("extension_aggregate"),
+ new String'("array_aggregate"),
+ new String'("expression_list"),
+ new String'("positional_array_aggregate"),
+ new String'("null_array_aggregate"),
+ new String'("named_array_aggregate"),
+ new String'("array_component_association_list"),
+ new String'("array_component_association"),
+ new String'("delta_aggregate"),
+ new String'("record_delta_aggregate"),
+ new String'("array_delta_aggregate"),
+ new String'("iterated_element_association"),
+ new String'("AND_relation_list"),
+ new String'("AND_THEN_relation_list"),
+ new String'("OR_relation_list"),
+ new String'("OR_ELSE_relation_list"),
+ new String'("XOR_relation_list"),
+ new String'("expression"),
+ new String'("relation"),
+ new String'("membership_choice_list"),
+ new String'("membership_choice"),
+ new String'("simple_expression"),
+ new String'("term"),
+ new String'("factor"),
+ new String'("primary"),
+ new String'("relational_operator"),
+ new String'("binary_adding_operator"),
+ new String'("unary_adding_operator"),
+ new String'("multiplying_operator"),
+ new String'("conditional_expression"),
+ new String'("elsif_expression_item"),
+ new String'("elsif_expression_list"),
+ new String'("if_expression"),
+ new String'("condition"),
+ new String'("case_expression_alternative_list"),
+ new String'("case_expression"),
+ new String'("case_expression_alternative"),
+ new String'("quantified_expression"),
+ new String'("quantifier"),
+ new String'("declare_expression"),
+ new String'("declare_item"),
+ new String'("reduction_attribute_reference"),
+ new String'("value_sequence"),
+ new String'("reduction_attribute_designator"),
+ new String'("reduction_specification"),
+ new String'("qualified_expression"),
+ new String'("allocator"),
+ new String'("subtype_indication_paren_constraint"),
+ new String'("subpool_specification"),
+ new String'("sequence_of_statements"),
+ new String'("sequence_of_statements_opt"),
+ new String'("statement"),
+ new String'("simple_statement"),
+ new String'("compound_statement"),
+ new String'("null_statement"),
+ new String'("label"),
+ new String'("statement_identifier"),
+ new String'("assignment_statement"),
+ new String'("target_name"),
+ new String'("elsif_statement_item"),
+ new String'("elsif_statement_list"),
+ new String'("if_statement"),
+ new String'("case_statement_alternative_list"),
+ new String'("case_statement"),
+ new String'("case_statement_alternative"),
+ new String'("loop_statement"),
+ new String'("iteration_scheme"),
+ new String'("chunk_specification"),
+ new String'("loop_parameter_specification"),
+ new String'("iterator_filter"),
+ new String'("iterator_specification"),
+ new String'("loop_parameter_subtype_indication"),
+ new String'("procedural_iterator"),
+ new String'("iterator_parameter_specification"),
+ new String'("identifier_opt"),
+ new String'("label_opt"),
+ new String'("block_statement"),
+ new String'("statement_AND_list"),
+ new String'("parallel_block_statement"),
+ new String'("exit_statement"),
+ new String'("goto_statement"),
+ new String'("subprogram_declaration"),
+ new String'("subprogram_specification"),
+ new String'("procedure_specification"),
+ new String'("function_specification"),
+ new String'("parameter_profile"),
+ new String'("result_profile"),
+ new String'("parameter_and_result_profile"),
+ new String'("parameter_specification_list"),
+ new String'("formal_part"),
+ new String'("parameter_specification"),
+ new String'("mode"),
+ new String'("global_aspect_definition"),
+ new String'("global_aspect_element"),
+ new String'("global_mode"),
+ new String'("basic_global_mode"),
+ new String'("global_set"),
+ new String'("global_designator"),
+ new String'("name_opt"),
+ new String'("subprogram_body"),
+ new String'("procedure_call_statement"),
+ new String'("function_call"),
+ new String'("parameter_association_list"),
+ new String'("actual_parameter_part"),
+ new String'("assoc_expression"),
+ new String'("parameter_association"),
+ new String'("simple_return_statement"),
+ new String'("extended_return_object_declaration"),
+ new String'("extended_return_statement"),
+ new String'("return_subtype_indication"),
+ new String'("null_procedure_declaration"),
+ new String'("expression_function_declaration"),
+ new String'("package_declaration"),
+ new String'("basic_declarative_item_pragma"),
+ new String'("basic_declarative_item_list"),
+ new String'("package_specification"),
+ new String'("package_body"),
+ new String'("private_type_declaration"),
+ new String'("private_extension_declaration"),
+ new String'("overriding_indicator"),
+ new String'("use_clause"),
+ new String'("name_list"),
+ new String'("use_package_clause"),
+ new String'("use_type_clause"),
+ new String'("renaming_declaration"),
+ new String'("object_renaming_declaration"),
+ new String'("exception_renaming_declaration"),
+ new String'("package_renaming_declaration"),
+ new String'("subprogram_renaming_declaration"),
+ new String'("generic_renaming_declaration"),
+ new String'("task_type_declaration"),
+ new String'("single_task_declaration"),
+ new String'("task_item_list"),
+ new String'("task_definition"),
+ new String'("task_item"),
+ new String'("task_body"),
+ new String'("protected_type_declaration"),
+ new String'("single_protected_declaration"),
+ new String'("protected_operation_declaration_list"),
+ new String'("protected_element_declaration_list"),
+ new String'("protected_definition"),
+ new String'("protected_operation_declaration"),
+ new String'("protected_element_declaration"),
+ new String'("protected_operation_item_list"),
+ new String'("protected_body"),
+ new String'("protected_operation_item"),
+ new String'("entry_declaration"),
+ new String'("accept_statement"),
+ new String'("entry_index"),
+ new String'("entry_body"),
+ new String'("entry_body_formal_part"),
+ new String'("entry_barrier"),
+ new String'("entry_index_specification"),
+ new String'("requeue_statement"),
+ new String'("delay_statement"),
+ new String'("delay_until_statement"),
+ new String'("delay_relative_statement"),
+ new String'("select_statement"),
+ new String'("guard_select"),
+ new String'("select_alternative_list"),
+ new String'("selective_accept"),
+ new String'("guard"),
+ new String'("select_alternative"),
+ new String'("accept_alternative"),
+ new String'("delay_alternative"),
+ new String'("terminate_alternative"),
+ new String'("timed_entry_call"),
+ new String'("entry_call_alternative"),
+ new String'("conditional_entry_call"),
+ new String'("asynchronous_select"),
+ new String'("triggering_alternative"),
+ new String'("abortable_part"),
+ new String'("abort_statement"),
+ new String'("compilation"),
+ new String'("compilation_unit"),
+ new String'("with_clause"),
+ new String'("limited_with_clause"),
+ new String'("nonlimited_with_clause"),
+ new String'("body_stub"),
+ new String'("subprogram_body_stub"),
+ new String'("package_body_stub"),
+ new String'("task_body_stub"),
+ new String'("protected_body_stub"),
+ new String'("subunit"),
+ new String'("exception_declaration"),
+ new String'("exception_handler_list"),
+ new String'("handled_sequence_of_statements"),
+ new String'("exception_choice_list"),
+ new String'("exception_handler"),
+ new String'("choice_parameter_specification"),
+ new String'("exception_choice"),
+ new String'("raise_statement"),
+ new String'("raise_expression"),
+ new String'("generic_declaration"),
+ new String'("generic_subprogram_declaration"),
+ new String'("generic_package_declaration"),
+ new String'("generic_formal_part"),
+ new String'("generic_formal_parameter_declaration"),
+ new String'("generic_instantiation"),
+ new String'("formal_object_declaration"),
+ new String'("formal_type_declaration"),
+ new String'("formal_complete_type_declaration"),
+ new String'("formal_incomplete_type_declaration"),
+ new String'("formal_type_definition"),
+ new String'("formal_private_type_definition"),
+ new String'("formal_derived_type_definition"),
+ new String'("formal_discrete_type_definition"),
+ new String'("formal_signed_integer_type_definition"),
+ new String'("formal_modular_type_definition"),
+ new String'("formal_floating_point_definition"),
+ new String'("formal_ordinary_fixed_point_definition"),
+ new String'("formal_decimal_fixed_point_definition"),
+ new String'("formal_array_type_definition"),
+ new String'("formal_access_type_definition"),
+ new String'("formal_interface_type_definition"),
+ new String'("formal_subprogram_declaration"),
+ new String'("formal_concrete_subprogram_declaration"),
+ new String'("formal_abstract_subprogram_declaration"),
+ new String'("subprogram_default"),
+ new String'("default_name"),
+ new String'("formal_package_declaration"),
+ new String'("aspect_clause"),
+ new String'("aspect_association"),
+ new String'("aspect_mark_list"),
+ new String'("aspect_specification"),
+ new String'("aspect_mark"),
+ new String'("aspect_definition"),
+ new String'("attribute_definition_clause"),
+ new String'("enumeration_representation_clause"),
+ new String'("enumeration_aggregate"),
+ new String'("record_representation_clause"),
+ new String'("component_clause"),
+ new String'("position"),
+ new String'("first_bit"),
+ new String'("last_bit"),
+ new String'("extended_global_aspect_definition"),
+ new String'("extended_global_aspect_element"),
+ new String'("extended_global_mode"),
+ new String'("formal_parameter_designator"),
+ new String'("formal_parameter_set"),
+ new String'("formal_group_designator"),
+ new String'("dispatching_operation_set"),
+ new String'("dispatching_operation_specifier"),
+ new String'("delta_constraint"),
+ new String'("at_clause"),
+ new String'("mod_clause"),
+ new String'("discrete_range_COMMA_list"),
+ new String'("component_item_component_item_list"),
+ new String'("declarative_item_pragma_list"),
+ new String'("record_component_association_COMMA_list"),
+ new String'("declare_item_list"),
+ new String'("statement_statement_list"),
+ new String'("label_list"),
+ new String'("global_aspect_element_COMMA_list"),
+ new String'("generic_formal_parameter_declaration_list"),
+ new String'("term_binary_adding_operator_list"),
+ new String'("component_clause_list"),
+ new String'("Wisi_SOI")),
+ Terminal_Image_Width => 20,
+ Image_Width => 41,
+ Last_Lookahead => 119);
+
+ type Token_Enum_ID is
+ (WHITESPACE_ID,
+ NEW_LINE_ID,
+ COMMENT_ID,
+ GNAT_PREP_IF_ID,
+ GNAT_PREP_ELSIF_ID,
+ GNAT_PREP_ELSE_ID,
+ GNAT_PREP_END_IF_ID,
+ CONFLICT_MARK_A_ID,
+ CONFLICT_MARK_B_ID,
+ CONFLICT_MARK_END_ID,
+ PLACEHOLDER_ID,
+ AT_ID,
+ RAISE_ID,
+ SEPARATE_ID,
+ TERMINATE_ID,
+ SELECT_ID,
+ UNTIL_ID,
+ DELAY_ID,
+ ABORT_ID,
+ REQUEUE_ID,
+ ACCEPT_ID,
+ ENTRY_ID,
+ GENERIC_ID,
+ EXCEPTION_ID,
+ RENAMES_ID,
+ OVERRIDING_ID,
+ BODY_ID,
+ PRIVATE_ID,
+ PACKAGE_ID,
+ OUT_ID,
+ RETURN_ID,
+ GOTO_ID,
+ EXIT_ID,
+ DO_ID,
+ REVERSE_ID,
+ WHILE_ID,
+ LOOP_ID,
+ PARALLEL_ID,
+ BEGIN_ID,
+ DECLARE_ID,
+ SOME_ID,
+ ELSE_ID,
+ IF_ID,
+ THEN_ID,
+ ELSIF_ID,
+ REM_ID,
+ ABS_ID,
+ IN_ID,
+ XOR_ID,
+ OR_ID,
+ USE_ID,
+ FOR_ID,
+ NOT_ID,
+ FUNCTION_ID,
+ PROCEDURE_ID,
+ ALL_ID,
+ ACCESS_ID,
+ INTERFACE_ID,
+ SYNCHRONIZED_ID,
+ PROTECTED_ID,
+ TASK_ID,
+ WITH_ID,
+ OTHERS_ID,
+ WHEN_ID,
+ CASE_ID,
+ NULL_ID,
+ END_ID,
+ RECORD_ID,
+ TAGGED_ID,
+ OF_ID,
+ ARRAY_ID,
+ DELTA_ID,
+ DIGITS_ID,
+ MOD_ID,
+ RANGE_ID,
+ AND_ID,
+ NEW_ID,
+ LIMITED_ID,
+ ABSTRACT_ID,
+ CONSTANT_ID,
+ ALIASED_ID,
+ SUBTYPE_ID,
+ IS_ID,
+ TYPE_ID,
+ PRAGMA_ID,
+ LEFT_PAREN_ID,
+ LEFT_SQUARE_BRACKET_ID,
+ RIGHT_PAREN_ID,
+ RIGHT_SQUARE_BRACKET_ID,
+ AMPERSAND_ID,
+ AT_SIGN_ID,
+ BAR_ID,
+ BOX_ID,
+ COLON_ID,
+ COLON_EQUAL_ID,
+ COMMA_ID,
+ DOT_ID,
+ DOT_DOT_ID,
+ EQUAL_ID,
+ EQUAL_GREATER_ID,
+ GREATER_ID,
+ GREATER_EQUAL_ID,
+ GREATER_GREATER_ID,
+ LESS_ID,
+ LESS_EQUAL_ID,
+ LESS_LESS_ID,
+ MINUS_ID,
+ PLUS_ID,
+ SEMICOLON_ID,
+ SLASH_ID,
+ SLASH_EQUAL_ID,
+ STAR_ID,
+ STAR_STAR_ID,
+ TICK_1_ID,
+ TICK_2_ID,
+ NUMERIC_LITERAL_ID,
+ IDENTIFIER_ID,
+ STRING_LITERAL_ID,
+ CHARACTER_LITERAL_ID,
+ Wisi_EOI_ID,
+ wisitoken_accept_ID,
+ tick_ID,
+ conditional_quantified_expression_ID,
+ pragma_argument_association_list_ID,
+ pragma_g_ID,
+ pragma_argument_association_ID,
+ basic_declaration_ID,
+ type_declaration_ID,
+ full_type_declaration_ID,
+ type_definition_ID,
+ subtype_declaration_ID,
+ subtype_indication_ID,
+ constraint_ID,
+ scalar_constraint_ID,
+ assign_value_ID,
+ object_declaration_ID,
+ defining_identifier_list_ID,
+ number_declaration_ID,
+ derived_type_definition_ID,
+ range_constraint_ID,
+ range_g_ID,
+ enumeration_literal_list_ID,
+ enumeration_type_definition_ID,
+ enumeration_literal_specification_ID,
+ integer_type_definition_ID,
+ signed_integer_type_definition_ID,
+ modular_type_definition_ID,
+ real_type_definition_ID,
+ floating_point_definition_ID,
+ real_range_specification_ID,
+ fixed_point_definition_ID,
+ ordinary_fixed_point_definition_ID,
+ decimal_fixed_point_definition_ID,
+ digits_constraint_ID,
+ array_type_definition_ID,
+ index_subtype_definition_list_ID,
+ unconstrained_array_definition_ID,
+ index_subtype_definition_ID,
+ discrete_subtype_definition_list_ID,
+ constrained_array_definition_ID,
+ discrete_subtype_definition_ID,
+ component_definition_ID,
+ index_constraint_ID,
+ discrete_range_ID,
+ discriminant_part_ID,
+ unknown_discriminant_part_ID,
+ discriminant_specification_list_ID,
+ known_discriminant_part_ID,
+ discriminant_specification_ID,
+ record_type_definition_ID,
+ record_definition_ID,
+ component_list_ID,
+ component_item_ID,
+ component_declaration_ID,
+ variant_list_ID,
+ variant_part_ID,
+ variant_ID,
+ discrete_choice_list_ID,
+ discrete_choice_ID,
+ record_extension_part_ID,
+ abstract_subprogram_declaration_ID,
+ interface_type_definition_ID,
+ interface_list_ID,
+ access_type_definition_ID,
+ access_to_object_definition_ID,
+ general_access_modifier_ID,
+ access_to_subprogram_definition_ID,
+ null_exclusion_ID,
+ access_definition_ID,
+ incomplete_type_declaration_ID,
+ declarative_item_ID,
+ declarative_item_pragma_ID,
+ declarative_part_ID,
+ basic_declarative_item_ID,
+ proper_body_ID,
+ name_ID,
+ direct_name_ID,
+ explicit_dereference_ID,
+ slice_ID,
+ selected_component_ID,
+ selector_name_ID,
+ attribute_reference_ID,
+ attribute_designator_ID,
+ range_attribute_reference_ID,
+ range_attribute_designator_ID,
+ aggregate_ID,
+ record_aggregate_ID,
+ record_component_association_list_ID,
+ record_component_association_ID,
+ component_choice_list_ID,
+ extension_aggregate_ID,
+ array_aggregate_ID,
+ expression_list_ID,
+ positional_array_aggregate_ID,
+ null_array_aggregate_ID,
+ named_array_aggregate_ID,
+ array_component_association_list_ID,
+ array_component_association_ID,
+ delta_aggregate_ID,
+ record_delta_aggregate_ID,
+ array_delta_aggregate_ID,
+ iterated_element_association_ID,
+ AND_relation_list_ID,
+ AND_THEN_relation_list_ID,
+ OR_relation_list_ID,
+ OR_ELSE_relation_list_ID,
+ XOR_relation_list_ID,
+ expression_ID,
+ relation_ID,
+ membership_choice_list_ID,
+ membership_choice_ID,
+ simple_expression_ID,
+ term_ID,
+ factor_ID,
+ primary_ID,
+ relational_operator_ID,
+ binary_adding_operator_ID,
+ unary_adding_operator_ID,
+ multiplying_operator_ID,
+ conditional_expression_ID,
+ elsif_expression_item_ID,
+ elsif_expression_list_ID,
+ if_expression_ID,
+ condition_ID,
+ case_expression_alternative_list_ID,
+ case_expression_ID,
+ case_expression_alternative_ID,
+ quantified_expression_ID,
+ quantifier_ID,
+ declare_expression_ID,
+ declare_item_ID,
+ reduction_attribute_reference_ID,
+ value_sequence_ID,
+ reduction_attribute_designator_ID,
+ reduction_specification_ID,
+ qualified_expression_ID,
+ allocator_ID,
+ subtype_indication_paren_constraint_ID,
+ subpool_specification_ID,
+ sequence_of_statements_ID,
+ sequence_of_statements_opt_ID,
+ statement_ID,
+ simple_statement_ID,
+ compound_statement_ID,
+ null_statement_ID,
+ label_ID,
+ statement_identifier_ID,
+ assignment_statement_ID,
+ target_name_ID,
+ elsif_statement_item_ID,
+ elsif_statement_list_ID,
+ if_statement_ID,
+ case_statement_alternative_list_ID,
+ case_statement_ID,
+ case_statement_alternative_ID,
+ loop_statement_ID,
+ iteration_scheme_ID,
+ chunk_specification_ID,
+ loop_parameter_specification_ID,
+ iterator_filter_ID,
+ iterator_specification_ID,
+ loop_parameter_subtype_indication_ID,
+ procedural_iterator_ID,
+ iterator_parameter_specification_ID,
+ identifier_opt_ID,
+ label_opt_ID,
+ block_statement_ID,
+ statement_AND_list_ID,
+ parallel_block_statement_ID,
+ exit_statement_ID,
+ goto_statement_ID,
+ subprogram_declaration_ID,
+ subprogram_specification_ID,
+ procedure_specification_ID,
+ function_specification_ID,
+ parameter_profile_ID,
+ result_profile_ID,
+ parameter_and_result_profile_ID,
+ parameter_specification_list_ID,
+ formal_part_ID,
+ parameter_specification_ID,
+ mode_ID,
+ global_aspect_definition_ID,
+ global_aspect_element_ID,
+ global_mode_ID,
+ basic_global_mode_ID,
+ global_set_ID,
+ global_designator_ID,
+ name_opt_ID,
+ subprogram_body_ID,
+ procedure_call_statement_ID,
+ function_call_ID,
+ parameter_association_list_ID,
+ actual_parameter_part_ID,
+ assoc_expression_ID,
+ parameter_association_ID,
+ simple_return_statement_ID,
+ extended_return_object_declaration_ID,
+ extended_return_statement_ID,
+ return_subtype_indication_ID,
+ null_procedure_declaration_ID,
+ expression_function_declaration_ID,
+ package_declaration_ID,
+ basic_declarative_item_pragma_ID,
+ basic_declarative_item_list_ID,
+ package_specification_ID,
+ package_body_ID,
+ private_type_declaration_ID,
+ private_extension_declaration_ID,
+ overriding_indicator_ID,
+ use_clause_ID,
+ name_list_ID,
+ use_package_clause_ID,
+ use_type_clause_ID,
+ renaming_declaration_ID,
+ object_renaming_declaration_ID,
+ exception_renaming_declaration_ID,
+ package_renaming_declaration_ID,
+ subprogram_renaming_declaration_ID,
+ generic_renaming_declaration_ID,
+ task_type_declaration_ID,
+ single_task_declaration_ID,
+ task_item_list_ID,
+ task_definition_ID,
+ task_item_ID,
+ task_body_ID,
+ protected_type_declaration_ID,
+ single_protected_declaration_ID,
+ protected_operation_declaration_list_ID,
+ protected_element_declaration_list_ID,
+ protected_definition_ID,
+ protected_operation_declaration_ID,
+ protected_element_declaration_ID,
+ protected_operation_item_list_ID,
+ protected_body_ID,
+ protected_operation_item_ID,
+ entry_declaration_ID,
+ accept_statement_ID,
+ entry_index_ID,
+ entry_body_ID,
+ entry_body_formal_part_ID,
+ entry_barrier_ID,
+ entry_index_specification_ID,
+ requeue_statement_ID,
+ delay_statement_ID,
+ delay_until_statement_ID,
+ delay_relative_statement_ID,
+ select_statement_ID,
+ guard_select_ID,
+ select_alternative_list_ID,
+ selective_accept_ID,
+ guard_ID,
+ select_alternative_ID,
+ accept_alternative_ID,
+ delay_alternative_ID,
+ terminate_alternative_ID,
+ timed_entry_call_ID,
+ entry_call_alternative_ID,
+ conditional_entry_call_ID,
+ asynchronous_select_ID,
+ triggering_alternative_ID,
+ abortable_part_ID,
+ abort_statement_ID,
+ compilation_ID,
+ compilation_unit_ID,
+ with_clause_ID,
+ limited_with_clause_ID,
+ nonlimited_with_clause_ID,
+ body_stub_ID,
+ subprogram_body_stub_ID,
+ package_body_stub_ID,
+ task_body_stub_ID,
+ protected_body_stub_ID,
+ subunit_ID,
+ exception_declaration_ID,
+ exception_handler_list_ID,
+ handled_sequence_of_statements_ID,
+ exception_choice_list_ID,
+ exception_handler_ID,
+ choice_parameter_specification_ID,
+ exception_choice_ID,
+ raise_statement_ID,
+ raise_expression_ID,
+ generic_declaration_ID,
+ generic_subprogram_declaration_ID,
+ generic_package_declaration_ID,
+ generic_formal_part_ID,
+ generic_formal_parameter_declaration_ID,
+ generic_instantiation_ID,
+ formal_object_declaration_ID,
+ formal_type_declaration_ID,
+ formal_complete_type_declaration_ID,
+ formal_incomplete_type_declaration_ID,
+ formal_type_definition_ID,
+ formal_private_type_definition_ID,
+ formal_derived_type_definition_ID,
+ formal_discrete_type_definition_ID,
+ formal_signed_integer_type_definition_ID,
+ formal_modular_type_definition_ID,
+ formal_floating_point_definition_ID,
+ formal_ordinary_fixed_point_definition_ID,
+ formal_decimal_fixed_point_definition_ID,
+ formal_array_type_definition_ID,
+ formal_access_type_definition_ID,
+ formal_interface_type_definition_ID,
+ formal_subprogram_declaration_ID,
+ formal_concrete_subprogram_declaration_ID,
+ formal_abstract_subprogram_declaration_ID,
+ subprogram_default_ID,
+ default_name_ID,
+ formal_package_declaration_ID,
+ aspect_clause_ID,
+ aspect_association_ID,
+ aspect_mark_list_ID,
+ aspect_specification_ID,
+ aspect_mark_ID,
+ aspect_definition_ID,
+ attribute_definition_clause_ID,
+ enumeration_representation_clause_ID,
+ enumeration_aggregate_ID,
+ record_representation_clause_ID,
+ component_clause_ID,
+ position_ID,
+ first_bit_ID,
+ last_bit_ID,
+ extended_global_aspect_definition_ID,
+ extended_global_aspect_element_ID,
+ extended_global_mode_ID,
+ formal_parameter_designator_ID,
+ formal_parameter_set_ID,
+ formal_group_designator_ID,
+ dispatching_operation_set_ID,
+ dispatching_operation_specifier_ID,
+ delta_constraint_ID,
+ at_clause_ID,
+ mod_clause_ID,
+ discrete_range_COMMA_list_ID,
+ component_item_component_item_list_ID,
+ declarative_item_pragma_list_ID,
+ record_component_association_COMMA_list_ID,
+ declare_item_list_ID,
+ statement_statement_list_ID,
+ label_list_ID,
+ global_aspect_element_COMMA_list_ID,
+ generic_formal_parameter_declaration_list_ID,
+ term_binary_adding_operator_list_ID,
+ component_clause_list_ID,
+ Wisi_SOI_ID);
+
+ type Token_Enum_ID_Array is array (Positive range <>) of Token_Enum_ID;
+ use all type WisiToken.Token_ID;
+ function "+" (Item : in Token_Enum_ID) return WisiToken.Token_ID
+ is (WisiToken.Token_ID'First + Token_Enum_ID'Pos (Item));
+ function To_Token_Enum (Item : in WisiToken.Token_ID) return Token_Enum_ID
+ is (Token_Enum_ID'Val (Item - WisiToken.Token_ID'First));
+ function "-" (Item : in WisiToken.Token_ID) return Token_Enum_ID renames
To_Token_Enum;
+
+ procedure pragma_argument_association_list_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure pragma_argument_association_list_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure pragma_g_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure pragma_g_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure pragma_g_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure pragma_g_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure full_type_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure full_type_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure full_type_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure full_type_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure subtype_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure subtype_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_8
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_9
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_10
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_11
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_12
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_13
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_14
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_15
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_16
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_17
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_18
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_19
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_20
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_21
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_22
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_23
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_24
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_25
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_26
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_27
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_28
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_29
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_30
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_31
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_32
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_33
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_34
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_35
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_36
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_37
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_38
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_39
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_40
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_41
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_42
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_43
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_44
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_45
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_46
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_declaration_47
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure defining_identifier_list_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure defining_identifier_list_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure number_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure enumeration_type_definition_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure integer_type_definition_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure integer_type_definition_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure unconstrained_array_definition_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure constrained_array_definition_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure discrete_range_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure discrete_range_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure known_discriminant_part_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure discriminant_specification_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure discriminant_specification_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure discriminant_specification_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure discriminant_specification_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure discriminant_specification_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure discriminant_specification_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure record_definition_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure record_definition_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure component_list_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure component_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure component_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure component_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure component_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure variant_list_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure variant_part_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure variant_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure discrete_choice_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure discrete_choice_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure discrete_choice_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure record_extension_part_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure abstract_subprogram_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure abstract_subprogram_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure abstract_subprogram_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure abstract_subprogram_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure interface_list_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure interface_list_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure access_to_subprogram_definition_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure access_to_subprogram_definition_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure access_definition_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure access_definition_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure access_definition_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure access_definition_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure access_definition_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure access_definition_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure access_definition_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure access_definition_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure access_definition_8
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure access_definition_9
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure access_definition_10
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure access_definition_11
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure incomplete_type_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure incomplete_type_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure incomplete_type_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure incomplete_type_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure direct_name_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure slice_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure selected_component_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure range_attribute_designator_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure range_attribute_designator_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure aggregate_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure aggregate_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure aggregate_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure record_aggregate_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure record_component_association_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure record_component_association_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure component_choice_list_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure extension_aggregate_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure expression_list_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure expression_list_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure positional_array_aggregate_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure positional_array_aggregate_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure positional_array_aggregate_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure positional_array_aggregate_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure named_array_aggregate_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure named_array_aggregate_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure array_component_association_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure record_delta_aggregate_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure array_delta_aggregate_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure array_delta_aggregate_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure iterated_element_association_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure iterated_element_association_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure iterated_element_association_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure iterated_element_association_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure membership_choice_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure membership_choice_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure primary_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure primary_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure elsif_expression_item_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure elsif_expression_list_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure if_expression_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure if_expression_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure if_expression_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure if_expression_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure case_expression_alternative_list_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure case_expression_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure case_expression_alternative_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure quantified_expression_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure quantified_expression_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure declare_expression_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure declare_expression_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure reduction_specification_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure qualified_expression_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure subtype_indication_paren_constraint_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure subtype_indication_paren_constraint_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure null_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure label_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure assignment_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure elsif_statement_item_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure if_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure if_statement_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure if_statement_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure if_statement_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure case_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure case_statement_alternative_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure loop_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure loop_statement_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure iteration_scheme_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure iteration_scheme_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure iteration_scheme_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure iteration_scheme_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure iteration_scheme_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure iteration_scheme_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure iteration_scheme_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure iteration_scheme_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure iteration_scheme_8
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure chunk_specification_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure chunk_specification_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure block_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure block_statement_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure statement_AND_list_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure parallel_block_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure exit_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure exit_statement_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure exit_statement_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure exit_statement_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure goto_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure subprogram_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure subprogram_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure subprogram_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure subprogram_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure procedure_specification_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure function_specification_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure result_profile_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure result_profile_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure result_profile_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure parameter_and_result_profile_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_part_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure parameter_specification_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure parameter_specification_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure parameter_specification_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure parameter_specification_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure parameter_specification_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure parameter_specification_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure parameter_specification_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure parameter_specification_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure parameter_specification_8
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure parameter_specification_9
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure subprogram_body_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure subprogram_body_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure subprogram_body_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure subprogram_body_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure procedure_call_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure function_call_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure actual_parameter_part_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure actual_parameter_part_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure actual_parameter_part_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure actual_parameter_part_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure assoc_expression_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure parameter_association_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure parameter_association_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure simple_return_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure simple_return_statement_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure extended_return_object_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure extended_return_object_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure extended_return_object_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure extended_return_object_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure extended_return_object_declaration_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure extended_return_object_declaration_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure extended_return_object_declaration_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure extended_return_object_declaration_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure extended_return_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure extended_return_statement_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure null_procedure_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure null_procedure_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure null_procedure_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure null_procedure_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure expression_function_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure expression_function_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure expression_function_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure expression_function_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure package_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure package_specification_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure package_specification_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure package_specification_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure package_specification_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure package_specification_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure package_specification_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure package_specification_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure package_specification_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure package_specification_8
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure package_specification_9
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure package_specification_10
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure package_specification_11
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure package_body_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure package_body_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure package_body_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure package_body_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_type_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_type_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_type_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_type_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_type_declaration_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_type_declaration_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_type_declaration_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_type_declaration_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_type_declaration_8
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_type_declaration_9
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_type_declaration_10
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_type_declaration_11
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_type_declaration_12
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_type_declaration_13
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_type_declaration_14
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_type_declaration_15
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_type_declaration_16
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_type_declaration_17
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_type_declaration_18
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_type_declaration_19
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_type_declaration_20
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_type_declaration_21
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_type_declaration_22
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_type_declaration_23
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_8
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_9
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_10
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_11
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_12
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_13
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_14
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_15
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_16
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_17
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_18
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_19
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_20
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_21
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_22
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_23
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_24
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_25
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_26
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_27
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_28
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_29
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_30
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_31
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_32
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_33
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_34
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_35
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_36
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_37
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_38
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_39
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_40
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_41
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_42
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_43
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_44
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_45
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_46
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure private_extension_declaration_47
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure overriding_indicator_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure overriding_indicator_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure use_package_clause_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure use_type_clause_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure use_type_clause_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_renaming_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_renaming_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_renaming_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_renaming_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_renaming_declaration_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_renaming_declaration_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_renaming_declaration_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure object_renaming_declaration_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure exception_renaming_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure exception_renaming_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure package_renaming_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure package_renaming_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure subprogram_renaming_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure subprogram_renaming_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure subprogram_renaming_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure subprogram_renaming_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure generic_renaming_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure generic_renaming_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure generic_renaming_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure generic_renaming_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure generic_renaming_declaration_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure generic_renaming_declaration_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure task_type_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure task_type_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure task_type_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure task_type_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure task_type_declaration_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure task_type_declaration_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure task_type_declaration_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure task_type_declaration_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure task_type_declaration_8
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure task_type_declaration_9
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure task_type_declaration_10
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure task_type_declaration_11
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure single_task_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure single_task_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure single_task_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure single_task_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure single_task_declaration_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure single_task_declaration_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure task_definition_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure task_definition_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure task_body_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure task_body_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure protected_type_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure protected_type_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure protected_type_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure protected_type_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure protected_type_declaration_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure protected_type_declaration_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure protected_type_declaration_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure protected_type_declaration_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure single_protected_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure single_protected_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure single_protected_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure single_protected_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure protected_definition_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure protected_definition_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure protected_definition_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure protected_definition_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure protected_definition_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure protected_definition_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure protected_definition_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure protected_definition_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure protected_definition_8
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure protected_definition_9
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure protected_definition_10
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure protected_definition_11
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure protected_body_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure protected_body_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure protected_body_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure protected_body_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure entry_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure entry_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure entry_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure entry_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure entry_declaration_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure entry_declaration_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure entry_declaration_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure entry_declaration_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure accept_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure accept_statement_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure accept_statement_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure accept_statement_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure entry_body_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure entry_body_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure entry_body_formal_part_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure entry_body_formal_part_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure entry_barrier_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure requeue_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure requeue_statement_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure delay_until_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure delay_relative_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure guard_select_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure select_alternative_list_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure selective_accept_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure selective_accept_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure guard_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure terminate_alternative_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure timed_entry_call_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure conditional_entry_call_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure asynchronous_select_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure abort_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure compilation_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure compilation_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure compilation_unit_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure compilation_unit_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure limited_with_clause_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure limited_with_clause_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure nonlimited_with_clause_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure nonlimited_with_clause_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure subprogram_body_stub_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure subprogram_body_stub_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure subprogram_body_stub_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure subprogram_body_stub_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure package_body_stub_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure package_body_stub_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure task_body_stub_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure task_body_stub_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure protected_body_stub_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure protected_body_stub_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure subunit_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure exception_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure exception_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure exception_handler_list_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure handled_sequence_of_statements_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure handled_sequence_of_statements_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure exception_handler_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure exception_handler_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure raise_statement_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure raise_statement_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure raise_statement_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure raise_expression_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure raise_expression_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure generic_subprogram_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure generic_subprogram_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure generic_package_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure generic_formal_part_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure generic_formal_part_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure generic_instantiation_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure generic_instantiation_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure generic_instantiation_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure generic_instantiation_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure generic_instantiation_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure generic_instantiation_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure generic_instantiation_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure generic_instantiation_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure generic_instantiation_8
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure generic_instantiation_9
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_object_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_object_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_object_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_object_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_object_declaration_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_object_declaration_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_object_declaration_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_object_declaration_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_object_declaration_8
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_object_declaration_9
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_object_declaration_10
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_object_declaration_11
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_complete_type_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_complete_type_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_complete_type_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_complete_type_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_complete_type_declaration_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_complete_type_declaration_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_complete_type_declaration_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_complete_type_declaration_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_incomplete_type_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_incomplete_type_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_incomplete_type_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_incomplete_type_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_incomplete_type_declaration_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_incomplete_type_declaration_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_incomplete_type_declaration_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_incomplete_type_declaration_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_derived_type_definition_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_derived_type_definition_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_derived_type_definition_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_derived_type_definition_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_derived_type_definition_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_derived_type_definition_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_derived_type_definition_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_derived_type_definition_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_derived_type_definition_8
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_derived_type_definition_9
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_derived_type_definition_10
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_derived_type_definition_11
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_derived_type_definition_12
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_derived_type_definition_13
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_derived_type_definition_14
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_derived_type_definition_15
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_derived_type_definition_16
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_derived_type_definition_17
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_concrete_subprogram_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_concrete_subprogram_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_concrete_subprogram_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_concrete_subprogram_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_abstract_subprogram_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_abstract_subprogram_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_abstract_subprogram_declaration_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_abstract_subprogram_declaration_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure default_name_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_package_declaration_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure formal_package_declaration_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure aspect_association_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure aspect_association_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure aspect_specification_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure attribute_definition_clause_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure enumeration_representation_clause_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure record_representation_clause_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure record_representation_clause_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure record_representation_clause_2
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure record_representation_clause_3
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure record_representation_clause_4
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure record_representation_clause_5
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure record_representation_clause_6
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure record_representation_clause_7
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure component_clause_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure delta_constraint_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure delta_constraint_1
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ procedure at_clause_0
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
+ function name_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function name_3_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function direct_name_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function direct_name_1_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function selected_component_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function loop_statement_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function loop_statement_1_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function label_opt_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function block_statement_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function block_statement_1_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function subprogram_specification_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function subprogram_specification_1_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function procedure_specification_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function function_specification_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function name_opt_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function subprogram_body_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function subprogram_body_1_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function subprogram_body_2_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function subprogram_body_3_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function package_specification_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function package_specification_1_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function package_specification_2_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function package_specification_3_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function package_specification_4_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function package_specification_5_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function package_specification_6_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function package_specification_7_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function package_specification_8_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function package_specification_9_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function package_specification_10_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function package_specification_11_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function package_body_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function package_body_1_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function package_body_2_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function package_body_3_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function task_type_declaration_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function task_type_declaration_1_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function task_type_declaration_3_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function task_type_declaration_4_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function task_type_declaration_6_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function task_type_declaration_7_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function task_type_declaration_9_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function task_type_declaration_10_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function single_task_declaration_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function single_task_declaration_1_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function single_task_declaration_3_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function single_task_declaration_4_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function task_definition_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function task_definition_1_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function task_body_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function task_body_1_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function protected_type_declaration_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function protected_type_declaration_1_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function protected_type_declaration_2_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function protected_type_declaration_3_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function protected_type_declaration_4_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function protected_type_declaration_5_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function protected_type_declaration_6_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function protected_type_declaration_7_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function single_protected_declaration_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function single_protected_declaration_1_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function single_protected_declaration_2_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function single_protected_declaration_3_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function protected_definition_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function protected_definition_2_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function protected_definition_4_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function protected_definition_6_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function protected_definition_8_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function protected_definition_10_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function protected_body_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function protected_body_1_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function protected_body_2_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function protected_body_3_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function accept_statement_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function accept_statement_2_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function entry_body_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function entry_body_1_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+ function compilation_0_check
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
+ Recover_Active : in Boolean)
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
+
+ Partial_Parse_Active : aliased Boolean := False;
+ Partial_Parse_Byte_Goal : aliased WisiToken.Buffer_Pos :=
WisiToken.Buffer_Pos'Last;
+end Ada_Annex_P_Process_Actions;
diff --git a/ada_annex_p_process_lalr_main.adb
b/ada_annex_p_process_lalr_main.adb
new file mode 100644
index 0000000000..a5d43b287e
--- /dev/null
+++ b/ada_annex_p_process_lalr_main.adb
@@ -0,0 +1,32902 @@
+-- generated parser support file. -*- buffer-read-only:t -*-
+-- command line: wisitoken-bnf-generate.exe --generate LALR Ada_Emacs re2c
PROCESS ada_annex_p.wy
+--
+
+-- Copyright (C) 2013 - 2022 Free Software Foundation, Inc.
+
+-- This program is free software; you can redistribute it and/or
+-- modify it under the terms of the GNU General Public License as
+-- published by the Free Software Foundation; either version 3, or (at
+-- your option) any later version.
+--
+-- This software is distributed in the hope that it will be useful,
+-- but WITHOUT ANY WARRANTY; without even the implied warranty of
+-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+-- General Public License for more details.
+--
+-- You should have received a copy of the GNU General Public License
+-- along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>.
+
+with Ada_Annex_P_Process_Actions; use Ada_Annex_P_Process_Actions;
+with SAL;
+with WisiToken.Lexer.re2c;
+with ada_annex_p_re2c_c;
+package body Ada_Annex_P_Process_LALR_Main is
+
+ function Is_Block_Delimited (ID : in WisiToken.Token_ID) return Boolean
+ is begin
+ case To_Token_Enum (ID) is
+ when
+ COMMENT_ID |
+ GNAT_PREP_IF_ID |
+ GNAT_PREP_ELSIF_ID |
+ GNAT_PREP_ELSE_ID |
+ GNAT_PREP_END_IF_ID |
+ CONFLICT_MARK_A_ID |
+ CONFLICT_MARK_B_ID |
+ CONFLICT_MARK_END_ID |
+ PLACEHOLDER_ID |
+ STRING_LITERAL_ID |
+ CHARACTER_LITERAL_ID => return True;
+ when others => return False;
+ end case;
+ end Is_Block_Delimited;
+
+ function Same_Block_Delimiters (ID : in WisiToken.Token_ID) return Boolean
+ is begin
+ case To_Token_Enum (ID) is
+ when COMMENT_ID => return False;
+ when GNAT_PREP_IF_ID => return False;
+ when GNAT_PREP_ELSIF_ID => return False;
+ when GNAT_PREP_ELSE_ID => return False;
+ when GNAT_PREP_END_IF_ID => return False;
+ when CONFLICT_MARK_A_ID => return False;
+ when CONFLICT_MARK_B_ID => return False;
+ when CONFLICT_MARK_END_ID => return False;
+ when PLACEHOLDER_ID => return False;
+ when STRING_LITERAL_ID => return True;
+ when CHARACTER_LITERAL_ID => return True;
+ when others => return False;
+ end case;
+ end Same_Block_Delimiters;
+
+ function Escape_Delimiter_Doubled (ID : in WisiToken.Token_ID) return
Boolean
+ is begin
+ case To_Token_Enum (ID) is
+ when STRING_LITERAL_ID => return True;
+ when others => return False;
+ end case;
+ end Escape_Delimiter_Doubled;
+
+ function Start_Delimiter_Length (ID : in WisiToken.Token_ID) return Integer
+ is begin
+ case To_Token_Enum (ID) is
+ when COMMENT_ID => return 2;
+ when GNAT_PREP_IF_ID => return 3;
+ when GNAT_PREP_ELSIF_ID => return 6;
+ when GNAT_PREP_ELSE_ID => return 5;
+ when GNAT_PREP_END_IF_ID => return 7;
+ when CONFLICT_MARK_A_ID => return 7;
+ when CONFLICT_MARK_B_ID => return 7;
+ when CONFLICT_MARK_END_ID => return 7;
+ when PLACEHOLDER_ID => return 1;
+ when STRING_LITERAL_ID => return 1;
+ when CHARACTER_LITERAL_ID => return 1;
+ when others => raise SAL.Programmer_Error; return 0;
+ end case;
+ end Start_Delimiter_Length;
+
+ function End_Delimiter_Length (ID : in WisiToken.Token_ID) return Integer
+ is begin
+ case To_Token_Enum (ID) is
+ when
+ COMMENT_ID |
+ GNAT_PREP_IF_ID |
+ GNAT_PREP_ELSIF_ID |
+ GNAT_PREP_ELSE_ID |
+ GNAT_PREP_END_IF_ID |
+ CONFLICT_MARK_A_ID |
+ CONFLICT_MARK_B_ID |
+ CONFLICT_MARK_END_ID |
+ STRING_LITERAL_ID |
+ CHARACTER_LITERAL_ID => return 1;
+ when PLACEHOLDER_ID => return 1;
+ when others => raise SAL.Programmer_Error; return 0;
+ end case;
+ end End_Delimiter_Length;
+
+ function New_Line_Is_End_Delimiter (ID : in WisiToken.Token_ID) return
Boolean
+ is begin
+ return
+ (case To_Token_Enum (ID) is
+ when COMMENT_ID => True,
+ when GNAT_PREP_IF_ID => True,
+ when GNAT_PREP_ELSIF_ID => True,
+ when GNAT_PREP_ELSE_ID => True,
+ when GNAT_PREP_END_IF_ID => True,
+ when CONFLICT_MARK_A_ID => True,
+ when CONFLICT_MARK_B_ID => True,
+ when CONFLICT_MARK_END_ID => True,
+ when PLACEHOLDER_ID => True,
+ when STRING_LITERAL_ID => True,
+ when CHARACTER_LITERAL_ID => True,
+ when others => raise SAL.Programmer_Error);
+ end New_Line_Is_End_Delimiter;
+
+ function Find_End_Delimiter
+ (Source : in WisiToken.Lexer.Source;
+ ID : in WisiToken.Token_ID;
+ Token_Start : in WisiToken.Buffer_Pos)
+ return WisiToken.Buffer_Pos
+ is begin
+ return
+ (case To_Token_Enum (ID) is
+ when COMMENT_ID => WisiToken.Lexer.Find_New_Line (Source,
Token_Start),
+ when GNAT_PREP_IF_ID => WisiToken.Lexer.Find_New_Line (Source,
Token_Start),
+ when GNAT_PREP_ELSIF_ID => WisiToken.Lexer.Find_New_Line (Source,
Token_Start),
+ when GNAT_PREP_ELSE_ID => WisiToken.Lexer.Find_New_Line (Source,
Token_Start),
+ when GNAT_PREP_END_IF_ID => WisiToken.Lexer.Find_New_Line (Source,
Token_Start),
+ when CONFLICT_MARK_A_ID => WisiToken.Lexer.Find_New_Line (Source,
Token_Start),
+ when CONFLICT_MARK_B_ID => WisiToken.Lexer.Find_New_Line (Source,
Token_Start),
+ when CONFLICT_MARK_END_ID => WisiToken.Lexer.Find_New_Line (Source,
Token_Start),
+ when PLACEHOLDER_ID => WisiToken.Lexer.Find_String (Source,
Token_Start, "}"),
+ when STRING_LITERAL_ID => WisiToken.Lexer.Find_String_Or_New_Line
(Source, Token_Start, """"),
+ when CHARACTER_LITERAL_ID => WisiToken.Lexer.Find_String_Or_New_Line
(Source, Token_Start, """"),
+ when others => raise SAL.Programmer_Error);
+ end Find_End_Delimiter;
+
+ function Find_Scan_End
+ (Source : in WisiToken.Lexer.Source;
+ ID : in WisiToken.Token_ID;
+ Region : in WisiToken.Buffer_Region;
+ Inserted : in Boolean;
+ Start : in Boolean)
+ return WisiToken.Buffer_Pos
+ is
+ use WisiToken;
+ begin
+ return
+ (case To_Token_Enum (ID) is
+ when COMMENT_ID =>
+ (if Inserted then Region.Last
+ elsif Start then Region.Last
+ else Lexer.Find_New_Line (Source, Region.Last)),
+ when GNAT_PREP_IF_ID =>
+ (if Inserted then Region.Last
+ elsif Start then Region.Last
+ else Lexer.Find_New_Line (Source, Region.Last)),
+ when GNAT_PREP_ELSIF_ID =>
+ (if Inserted then Region.Last
+ elsif Start then Region.Last
+ else Lexer.Find_New_Line (Source, Region.Last)),
+ when GNAT_PREP_ELSE_ID =>
+ (if Inserted then Region.Last
+ elsif Start then Region.Last
+ else Lexer.Find_New_Line (Source, Region.Last)),
+ when GNAT_PREP_END_IF_ID =>
+ (if Inserted then Region.Last
+ elsif Start then Region.Last
+ else Lexer.Find_New_Line (Source, Region.Last)),
+ when CONFLICT_MARK_A_ID =>
+ (if Inserted then Region.Last
+ elsif Start then Region.Last
+ else Lexer.Find_New_Line (Source, Region.Last)),
+ when CONFLICT_MARK_B_ID =>
+ (if Inserted then Region.Last
+ elsif Start then Region.Last
+ else Lexer.Find_New_Line (Source, Region.Last)),
+ when CONFLICT_MARK_END_ID =>
+ (if Inserted then Region.Last
+ elsif Start then Region.Last
+ else Lexer.Find_New_Line (Source, Region.Last)),
+ when PLACEHOLDER_ID =>
+ (if Inserted then Region.Last
+ elsif Start then Region.Last
+ else Lexer.Find_String_Or_New_Line (Source, Region.Last, "{")),
+ when STRING_LITERAL_ID => Lexer.Find_New_Line (Source, Region.Last),
+ when CHARACTER_LITERAL_ID => Lexer.Find_New_Line (Source,
Region.Last),
+ when others => raise SAL.Programmer_Error);
+ end Find_Scan_End;
+
+ function Contains_End_Delimiter
+ (Source : in WisiToken.Lexer.Source;
+ ID : in WisiToken.Token_ID;
+ Region : in WisiToken.Buffer_Region)
+ return WisiToken.Base_Buffer_Pos
+ is
+ use WisiToken;
+ begin
+ return
+ (case To_Token_Enum (ID) is
+ when COMMENT_ID => Lexer.Find_New_Line (Source, Region),
+ when GNAT_PREP_IF_ID => Lexer.Find_New_Line (Source, Region),
+ when GNAT_PREP_ELSIF_ID => Lexer.Find_New_Line (Source, Region),
+ when GNAT_PREP_ELSE_ID => Lexer.Find_New_Line (Source, Region),
+ when GNAT_PREP_END_IF_ID => Lexer.Find_New_Line (Source, Region),
+ when CONFLICT_MARK_A_ID => Lexer.Find_New_Line (Source, Region),
+ when CONFLICT_MARK_B_ID => Lexer.Find_New_Line (Source, Region),
+ when CONFLICT_MARK_END_ID => Lexer.Find_New_Line (Source, Region),
+ when PLACEHOLDER_ID => Lexer.Find_String_Or_New_Line (Source, Region,
"}"),
+ when STRING_LITERAL_ID => Lexer.Find_String_Or_New_Line (Source,
Region, """"),
+ when CHARACTER_LITERAL_ID => Lexer.Find_String_Or_New_Line (Source,
Region, "'"),
+ when others => raise SAL.Programmer_Error);
+ end Contains_End_Delimiter;
+
+ function Line_Begin_Char_Pos
+ (Source : in WisiToken.Lexer.Source;
+ Token : in WisiToken.Lexer.Token;
+ Line : in WisiToken.Line_Number_Type)
+ return WisiToken.Buffer_Pos
+ is
+ pragma Unreferenced (Source, Line);
+ use all type WisiToken.Base_Buffer_Pos;
+ begin
+ case To_Token_Enum (Token.ID) is
+ when NEW_LINE_ID => return Token.Char_Region.Last + 1;
+ when COMMENT_ID => return Token.Char_Region.Last + 1;
+ when GNAT_PREP_IF_ID => return Token.Char_Region.Last + 1;
+ when GNAT_PREP_ELSIF_ID => return Token.Char_Region.Last + 1;
+ when GNAT_PREP_ELSE_ID => return Token.Char_Region.Last + 1;
+ when GNAT_PREP_END_IF_ID => return Token.Char_Region.Last + 1;
+ when CONFLICT_MARK_A_ID => return Token.Char_Region.Last + 1;
+ when CONFLICT_MARK_B_ID => return Token.Char_Region.Last + 1;
+ when CONFLICT_MARK_END_ID => return Token.Char_Region.Last + 1;
+ when others => raise SAL.Programmer_Error;
+ end case;
+ end Line_Begin_Char_Pos;
+
+ function Can_Contain_New_Line (ID : in WisiToken.Token_ID) return Boolean
+ is begin
+ case To_Token_Enum (ID) is
+ when NEW_LINE_ID => return True;
+ when COMMENT_ID => return True;
+ when GNAT_PREP_IF_ID => return True;
+ when GNAT_PREP_ELSIF_ID => return True;
+ when GNAT_PREP_ELSE_ID => return True;
+ when GNAT_PREP_END_IF_ID => return True;
+ when CONFLICT_MARK_A_ID => return True;
+ when CONFLICT_MARK_B_ID => return True;
+ when CONFLICT_MARK_END_ID => return True;
+ when others => return False;
+ end case;
+ end Can_Contain_New_Line;
+
+ function Terminated_By_New_Line (ID : in WisiToken.Token_ID) return Boolean
+ is begin
+ case To_Token_Enum (ID) is
+ when NEW_LINE_ID => return True;
+ when COMMENT_ID => return True;
+ when GNAT_PREP_IF_ID => return True;
+ when GNAT_PREP_ELSIF_ID => return True;
+ when GNAT_PREP_ELSE_ID => return True;
+ when GNAT_PREP_END_IF_ID => return True;
+ when CONFLICT_MARK_A_ID => return True;
+ when CONFLICT_MARK_B_ID => return True;
+ when CONFLICT_MARK_END_ID => return True;
+ when STRING_LITERAL_ID => return True;
+ when CHARACTER_LITERAL_ID => return True;
+ when others => return False;
+ end case;
+ end Terminated_By_New_Line;
+
+ package Lexer is new WisiToken.Lexer.re2c
+ (ada_annex_p_re2c_c.New_Lexer,
+ ada_annex_p_re2c_c.Free_Lexer,
+ ada_annex_p_re2c_c.Reset_Lexer,
+ ada_annex_p_re2c_c.Set_Verbosity,
+ ada_annex_p_re2c_c.Set_Position,
+ ada_annex_p_re2c_c.Next_Token,
+ Is_Block_Delimited,
+ Same_Block_Delimiters,
+ Escape_Delimiter_Doubled,
+ Start_Delimiter_Length,
+ End_Delimiter_Length,
+ New_Line_Is_End_Delimiter,
+ Find_End_Delimiter,
+ Contains_End_Delimiter,
+ Find_Scan_End,
+ Line_Begin_Char_Pos,
+ Can_Contain_New_Line,
+ Terminated_By_New_Line);
+
+ function Create_Parse_Table
+ return WisiToken.Parse.LR.Parse_Table_Ptr
+ is
+ use WisiToken.Parse.LR;
+ McKenzie_Param : constant McKenzie_Param_Type :=
+ (First_Terminal => 11,
+ Last_Terminal => 119,
+ First_Nonterminal => 120,
+ Last_Nonterminal => 466,
+ Insert =>
+ (4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 7, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 4, 4, 4, 4,
+ 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 4, 3, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
+ 4, 4, 4, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 4, 4, 4, 3, 4, 4, 4, 4, 4,
4, 4, 4, 3, 4, 4, 4, 4, 4, 4, 4, 2, 4, 4,
+ 4),
+ Delete =>
+ (3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
+ 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
+ 3, 3, 3, 3, 1, 3, 3, 3, 3, 3, 3, 3, 1, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
+ 3),
+ Push_Back =>
+ (2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2),
+ Undo_Reduce =>
+ (2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2),
+ Minimal_Complete_Cost_Delta => -3,
+ Fast_Forward => 2,
+ Matching_Begin => 1,
+ Ignore_Check_Fail => 2,
+ Check_Limit => 4,
+ Zombie_Limit => 4,
+ Check_Delta_Limit => 100,
+ Enqueue_Limit => 58000);
+
+ Table : constant Parse_Table_Ptr := new Parse_Table
+ (State_First => 0,
+ State_Last => 2402,
+ First_Terminal => 11,
+ Last_Terminal => 119,
+ First_Nonterminal => 120,
+ Last_Nonterminal => 466);
+ begin
+ declare
+ procedure Subr_1
+ is begin
+ Table.States (0).Action_List.Set_Capacity (41);
+ Add_Action (Table.States (0), 12, (401, 0), 1);
+ Add_Action (Table.States (0), 13, (393, 0), 2);
+ Add_Action (Table.States (0), 15, (370, 0), 3);
+ Add_Action (Table.States (0), 17, (365, 0), 4);
+ Add_Action (Table.States (0), 18, (382, 0), 5);
+ Add_Action (Table.States (0), 19, (363, 0), 6);
+ Add_Action (Table.States (0), 20, (357, 0), 7);
+ Add_Action (Table.States (0), 21, (356, 4), 8);
+ Add_Action (Table.States (0), 22, (339, 0), 9);
+ Add_Action (Table.States (0), 25, (329, 1), 10);
+ Add_Action (Table.States (0), 27, (384, 1), 11);
+ Add_Action (Table.States (0), 28, (325, 0), 12);
+ Add_Action (Table.States (0), 30, (316, 0), 13);
+ Add_Action (Table.States (0), 31, (290, 0), 14);
+ Add_Action (Table.States (0), 32, (289, 0), 15);
+ Add_Action (Table.States (0), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (0), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (0), 37, (288, 0), 17);
+ Add_Conflict (Table.States (0), 37, (285, 1), 0);
+ Add_Action (Table.States (0), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (0), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (0), 42, (271, 0), 18);
+ Add_Action (Table.States (0), 50, (332, 0), 19);
+ Add_Action (Table.States (0), 51, (437, 0), 20);
+ Add_Conflict (Table.States (0), 51, (285, 1), 0);
+ Add_Action (Table.States (0), 52, (329, 0), 21);
+ Add_Action (Table.States (0), 53, (294, 0), 22);
+ Add_Action (Table.States (0), 54, (293, 0), 23);
+ Add_Action (Table.States (0), 59, (346, 0), 24);
+ Add_Action (Table.States (0), 60, (340, 0), 25);
+ Add_Action (Table.States (0), 61, (387, 1), 26);
+ Add_Action (Table.States (0), 64, (273, 0), 27);
+ Add_Action (Table.States (0), 65, (264, 0), 28);
+ Add_Action (Table.States (0), 77, (386, 0), 29);
+ Add_Action (Table.States (0), 81, (130, 0), 30);
+ Add_Action (Table.States (0), 83, (128, 0), 31);
+ Add_Action (Table.States (0), 84, (124, 0), 32);
+ Add_Action (Table.States (0), 86, (252, 0), 33);
+ Add_Action (Table.States (0), 90, (268, 0), 34);
+ Add_Action (Table.States (0), 105, (265, 0), 35);
+ Add_Action (Table.States (0), 116, (136, 0), 36);
+ Add_Action (Table.States (0), 117, (196, 1), 37);
+ Add_Action (Table.States (0), 118, (195, 6), 38);
+ Table.States (0).Goto_List.Set_Capacity (106);
+ Add_Goto (Table.States (0), 124, 39);
+ Add_Goto (Table.States (0), 126, 40);
+ Add_Goto (Table.States (0), 127, 41);
+ Add_Goto (Table.States (0), 128, 42);
+ Add_Goto (Table.States (0), 130, 43);
+ Add_Goto (Table.States (0), 135, 44);
+ Add_Goto (Table.States (0), 136, 45);
+ Add_Goto (Table.States (0), 137, 46);
+ Add_Goto (Table.States (0), 180, 47);
+ Add_Goto (Table.States (0), 189, 48);
+ Add_Goto (Table.States (0), 190, 49);
+ Add_Goto (Table.States (0), 193, 50);
+ Add_Goto (Table.States (0), 194, 51);
+ Add_Goto (Table.States (0), 195, 52);
+ Add_Goto (Table.States (0), 196, 53);
+ Add_Goto (Table.States (0), 197, 54);
+ Add_Goto (Table.States (0), 198, 55);
+ Add_Goto (Table.States (0), 199, 56);
+ Add_Goto (Table.States (0), 201, 57);
+ Add_Goto (Table.States (0), 251, 58);
+ Add_Goto (Table.States (0), 252, 59);
+ Add_Goto (Table.States (0), 255, 60);
+ Add_Goto (Table.States (0), 261, 61);
+ Add_Goto (Table.States (0), 262, 62);
+ Add_Goto (Table.States (0), 263, 63);
+ Add_Goto (Table.States (0), 264, 64);
+ Add_Goto (Table.States (0), 265, 65);
+ Add_Goto (Table.States (0), 266, 66);
+ Add_Goto (Table.States (0), 267, 67);
+ Add_Goto (Table.States (0), 268, 68);
+ Add_Goto (Table.States (0), 271, 69);
+ Add_Goto (Table.States (0), 273, 70);
+ Add_Goto (Table.States (0), 275, 71);
+ Add_Goto (Table.States (0), 285, 72);
+ Add_Goto (Table.States (0), 286, 73);
+ Add_Goto (Table.States (0), 288, 74);
+ Add_Goto (Table.States (0), 289, 75);
+ Add_Goto (Table.States (0), 290, 76);
+ Add_Goto (Table.States (0), 291, 77);
+ Add_Goto (Table.States (0), 292, 78);
+ Add_Goto (Table.States (0), 293, 79);
+ Add_Goto (Table.States (0), 294, 80);
+ Add_Goto (Table.States (0), 309, 81);
+ Add_Goto (Table.States (0), 310, 82);
+ Add_Goto (Table.States (0), 311, 83);
+ Add_Goto (Table.States (0), 316, 84);
+ Add_Goto (Table.States (0), 318, 85);
+ Add_Goto (Table.States (0), 320, 86);
+ Add_Goto (Table.States (0), 321, 87);
+ Add_Goto (Table.States (0), 322, 88);
+ Add_Goto (Table.States (0), 325, 89);
+ Add_Goto (Table.States (0), 326, 90);
+ Add_Goto (Table.States (0), 327, 91);
+ Add_Goto (Table.States (0), 328, 92);
+ Add_Goto (Table.States (0), 329, 93);
+ Add_Goto (Table.States (0), 330, 94);
+ Add_Goto (Table.States (0), 332, 95);
+ Add_Goto (Table.States (0), 333, 96);
+ Add_Goto (Table.States (0), 334, 97);
+ Add_Goto (Table.States (0), 335, 98);
+ Add_Goto (Table.States (0), 336, 99);
+ Add_Goto (Table.States (0), 337, 100);
+ Add_Goto (Table.States (0), 338, 101);
+ Add_Goto (Table.States (0), 339, 102);
+ Add_Goto (Table.States (0), 340, 103);
+ Add_Goto (Table.States (0), 341, 104);
+ Add_Goto (Table.States (0), 345, 105);
+ Add_Goto (Table.States (0), 346, 106);
+ Add_Goto (Table.States (0), 347, 107);
+ Add_Goto (Table.States (0), 354, 108);
+ Add_Goto (Table.States (0), 356, 109);
+ Add_Goto (Table.States (0), 357, 110);
+ Add_Goto (Table.States (0), 363, 111);
+ Add_Goto (Table.States (0), 364, 112);
+ Add_Goto (Table.States (0), 365, 113);
+ Add_Goto (Table.States (0), 366, 114);
+ Add_Goto (Table.States (0), 367, 115);
+ Add_Goto (Table.States (0), 370, 116);
+ Add_Goto (Table.States (0), 376, 117);
+ Add_Goto (Table.States (0), 378, 118);
+ Add_Goto (Table.States (0), 379, 119);
+ Add_Goto (Table.States (0), 382, 120);
+ Add_Goto (Table.States (0), 383, 121);
+ Add_Goto (Table.States (0), 384, 122);
+ Add_Goto (Table.States (0), 385, 123);
+ Add_Goto (Table.States (0), 386, 124);
+ Add_Goto (Table.States (0), 387, 125);
+ Add_Goto (Table.States (0), 388, 126);
+ Add_Goto (Table.States (0), 389, 127);
+ Add_Goto (Table.States (0), 390, 128);
+ Add_Goto (Table.States (0), 391, 129);
+ Add_Goto (Table.States (0), 392, 130);
+ Add_Goto (Table.States (0), 393, 131);
+ Add_Goto (Table.States (0), 394, 132);
+ Add_Goto (Table.States (0), 401, 133);
+ Add_Goto (Table.States (0), 403, 134);
+ Add_Goto (Table.States (0), 404, 135);
+ Add_Goto (Table.States (0), 405, 136);
+ Add_Goto (Table.States (0), 406, 137);
+ Add_Goto (Table.States (0), 408, 138);
+ Add_Goto (Table.States (0), 431, 139);
+ Add_Goto (Table.States (0), 437, 140);
+ Add_Goto (Table.States (0), 438, 141);
+ Add_Goto (Table.States (0), 440, 142);
+ Add_Goto (Table.States (0), 454, 143);
+ Add_Goto (Table.States (0), 462, 144);
+ Table.States (1).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1), 86, (252, 0), 33);
+ Add_Action (Table.States (1), 90, (268, 0), 34);
+ Add_Action (Table.States (1), 108, (401, 0), 145);
+ Add_Action (Table.States (1), 116, (196, 0), 146);
+ Add_Action (Table.States (1), 117, (196, 1), 37);
+ Add_Action (Table.States (1), 118, (195, 6), 38);
+ Table.States (1).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (1), 195, 147);
+ Add_Goto (Table.States (1), 196, 148);
+ Add_Goto (Table.States (1), 197, 54);
+ Add_Goto (Table.States (1), 198, 55);
+ Add_Goto (Table.States (1), 199, 56);
+ Add_Goto (Table.States (1), 201, 57);
+ Add_Goto (Table.States (1), 251, 58);
+ Add_Goto (Table.States (1), 252, 59);
+ Add_Goto (Table.States (1), 255, 60);
+ Add_Goto (Table.States (1), 268, 68);
+ Add_Goto (Table.States (1), 311, 83);
+ Table.States (1).Kernel := To_Vector ((((401, 0), 12, 1, (32767,
0), 0), ((401, 1), 12, 4, (32767, 0),
+ 0), ((401, 2), 12, 2, (32767, 0), 0)));
+ Table.States (1).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (401, 0), 108, 145)));
+ Table.States (2).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2), 85, (393, 0), 149);
+ Table.States (2).Kernel := To_Vector ((0 => ((393, 0), 13, 9,
(32767, 0), 0)));
+ Table.States (2).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (393, 0), 85, 149)));
+ Table.States (3).Action_List.Set_Capacity (9);
+ Add_Action (Table.States (3), 14, (375, 0), 150);
+ Add_Action (Table.States (3), 17, (365, 0), 4);
+ Add_Action (Table.States (3), 20, (357, 0), 7);
+ Add_Action (Table.States (3), 63, (371, 0), 151);
+ Add_Action (Table.States (3), 86, (252, 0), 33);
+ Add_Action (Table.States (3), 90, (268, 0), 34);
+ Add_Action (Table.States (3), 116, (196, 0), 146);
+ Add_Action (Table.States (3), 117, (196, 1), 37);
+ Add_Action (Table.States (3), 118, (195, 6), 38);
+ Table.States (3).Goto_List.Set_Capacity (25);
+ Add_Goto (Table.States (3), 195, 152);
+ Add_Goto (Table.States (3), 196, 148);
+ Add_Goto (Table.States (3), 197, 54);
+ Add_Goto (Table.States (3), 198, 55);
+ Add_Goto (Table.States (3), 199, 56);
+ Add_Goto (Table.States (3), 201, 57);
+ Add_Goto (Table.States (3), 251, 58);
+ Add_Goto (Table.States (3), 252, 59);
+ Add_Goto (Table.States (3), 255, 60);
+ Add_Goto (Table.States (3), 268, 68);
+ Add_Goto (Table.States (3), 310, 153);
+ Add_Goto (Table.States (3), 311, 83);
+ Add_Goto (Table.States (3), 357, 154);
+ Add_Goto (Table.States (3), 364, 155);
+ Add_Goto (Table.States (3), 365, 113);
+ Add_Goto (Table.States (3), 366, 114);
+ Add_Goto (Table.States (3), 368, 156);
+ Add_Goto (Table.States (3), 369, 157);
+ Add_Goto (Table.States (3), 371, 158);
+ Add_Goto (Table.States (3), 372, 159);
+ Add_Goto (Table.States (3), 373, 160);
+ Add_Goto (Table.States (3), 374, 161);
+ Add_Goto (Table.States (3), 375, 162);
+ Add_Goto (Table.States (3), 377, 163);
+ Add_Goto (Table.States (3), 380, 164);
+ Table.States (3).Kernel := To_Vector ((((370, 0), 15, 8, (32767,
0), 0), ((370, 1), 15, 5, (32767, 0),
+ 0), ((376, 0), 15, 9, (32767, 0), 0), ((378, 0), 15, 8,
(32767, 0), 0), ((379, 0), 15, 9, (32767,
+ 0), 0)));
+ Table.States (3).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (375, 0), 14, 150)));
+ Table.States (4).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (4), 12, (402, 0), 165);
+ Add_Action (Table.States (4), 16, (365, 0), 166);
+ Add_Action (Table.States (4), 46, (233, 2), 167);
+ Add_Action (Table.States (4), 52, (233, 3), 168);
+ Add_Action (Table.States (4), 65, (234, 1), 169);
+ Add_Action (Table.States (4), 76, (256, 0), 170);
+ Add_Action (Table.States (4), 85, (205, 4), 171);
+ Add_Action (Table.States (4), 86, (213, 2), 172);
+ Add_Action (Table.States (4), 90, (268, 0), 34);
+ Add_Action (Table.States (4), 106, (237, 1), 173);
+ Add_Action (Table.States (4), 107, (237, 0), 174);
+ Add_Action (Table.States (4), 115, (234, 0), 175);
+ Add_Action (Table.States (4), 116, (196, 0), 146);
+ Add_Action (Table.States (4), 117, (196, 1), 37);
+ Add_Action (Table.States (4), 118, (195, 6), 38);
+ Table.States (4).Goto_List.Set_Capacity (31);
+ Add_Goto (Table.States (4), 195, 176);
+ Add_Goto (Table.States (4), 196, 148);
+ Add_Goto (Table.States (4), 197, 54);
+ Add_Goto (Table.States (4), 198, 55);
+ Add_Goto (Table.States (4), 199, 56);
+ Add_Goto (Table.States (4), 201, 57);
+ Add_Goto (Table.States (4), 205, 177);
+ Add_Goto (Table.States (4), 206, 178);
+ Add_Goto (Table.States (4), 210, 179);
+ Add_Goto (Table.States (4), 211, 180);
+ Add_Goto (Table.States (4), 213, 181);
+ Add_Goto (Table.States (4), 214, 182);
+ Add_Goto (Table.States (4), 215, 183);
+ Add_Goto (Table.States (4), 218, 184);
+ Add_Goto (Table.States (4), 219, 185);
+ Add_Goto (Table.States (4), 220, 186);
+ Add_Goto (Table.States (4), 227, 187);
+ Add_Goto (Table.States (4), 228, 188);
+ Add_Goto (Table.States (4), 231, 189);
+ Add_Goto (Table.States (4), 232, 190);
+ Add_Goto (Table.States (4), 233, 191);
+ Add_Goto (Table.States (4), 234, 192);
+ Add_Goto (Table.States (4), 237, 193);
+ Add_Goto (Table.States (4), 251, 58);
+ Add_Goto (Table.States (4), 252, 59);
+ Add_Goto (Table.States (4), 255, 60);
+ Add_Goto (Table.States (4), 256, 194);
+ Add_Goto (Table.States (4), 268, 68);
+ Add_Goto (Table.States (4), 311, 83);
+ Add_Goto (Table.States (4), 402, 195);
+ Add_Goto (Table.States (4), 465, 196);
+ Table.States (4).Kernel := To_Vector ((((365, 0), 17, 3, (32767,
0), 0), ((366, 0), 17, 2, (32767, 0),
+ 0)));
+ Table.States (4).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (5).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (5), 86, (252, 0), 33);
+ Add_Action (Table.States (5), 90, (268, 0), 34);
+ Add_Action (Table.States (5), 116, (196, 0), 146);
+ Add_Action (Table.States (5), 117, (196, 1), 37);
+ Add_Action (Table.States (5), 118, (195, 6), 38);
+ Table.States (5).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (5), 195, 197);
+ Add_Goto (Table.States (5), 196, 148);
+ Add_Goto (Table.States (5), 197, 54);
+ Add_Goto (Table.States (5), 198, 55);
+ Add_Goto (Table.States (5), 199, 56);
+ Add_Goto (Table.States (5), 201, 57);
+ Add_Goto (Table.States (5), 251, 58);
+ Add_Goto (Table.States (5), 252, 59);
+ Add_Goto (Table.States (5), 255, 60);
+ Add_Goto (Table.States (5), 268, 68);
+ Add_Goto (Table.States (5), 306, 198);
+ Add_Goto (Table.States (5), 311, 83);
+ Table.States (5).Kernel := To_Vector ((0 => ((382, 0), 18, 2,
(32767, 0), 0)));
+ Table.States (5).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (6).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (6), 86, (252, 0), 33);
+ Add_Action (Table.States (6), 90, (268, 0), 34);
+ Add_Action (Table.States (6), 116, (196, 0), 146);
+ Add_Action (Table.States (6), 117, (196, 1), 37);
+ Add_Action (Table.States (6), 118, (195, 6), 38);
+ Table.States (6).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (6), 195, 199);
+ Add_Goto (Table.States (6), 196, 148);
+ Add_Goto (Table.States (6), 197, 54);
+ Add_Goto (Table.States (6), 198, 55);
+ Add_Goto (Table.States (6), 199, 56);
+ Add_Goto (Table.States (6), 201, 57);
+ Add_Goto (Table.States (6), 251, 58);
+ Add_Goto (Table.States (6), 252, 59);
+ Add_Goto (Table.States (6), 255, 60);
+ Add_Goto (Table.States (6), 268, 68);
+ Add_Goto (Table.States (6), 311, 83);
+ Table.States (6).Kernel := To_Vector ((((363, 0), 19, 4, (32767,
0), 0), ((363, 1), 19, 2, (32767, 0),
+ 0)));
+ Table.States (6).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (7).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (7), 116, (196, 0), 146);
+ Add_Action (Table.States (7), 117, (196, 1), 37);
+ Table.States (7).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (7), 196, 200);
+ Table.States (7).Kernel := To_Vector ((((357, 0), 20, 9, (32767,
0), 0), ((357, 1), 20, 5, (32767, 0),
+ 0), ((357, 2), 20, 6, (32767, 0), 0), ((357, 3), 20, 2,
(32767, 0), 0)));
+ Table.States (7).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (8).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (8), 116, (356, 4), 201);
+ Table.States (8).Kernel := To_Vector ((((356, 4), 21, 7, (32767,
0), 0), ((356, 5), 21, 5, (32767, 0),
+ 0), ((356, 6), 21, 4, (32767, 0), 0), ((356, 7), 21, 2,
(32767, 0), 0)));
+ Table.States (8).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (356, 4), 116, 201)));
+ Table.States (9).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (9), 28, (339, 0), 202);
+ Add_Conflict (Table.States (9), 28, (406, 1), 1);
+ Add_Action (Table.States (9), 50, (332, 0), 19);
+ Add_Action (Table.States (9), 53, (339, 4), 203);
+ Add_Conflict (Table.States (9), 53, (406, 1), 1);
+ Add_Action (Table.States (9), 54, (339, 2), 204);
+ Add_Conflict (Table.States (9), 54, (406, 1), 1);
+ Add_Action (Table.States (9), 61, (426, 0), 205);
+ Add_Action (Table.States (9), 83, (411, 0), 206);
+ Add_Action (Table.States (9), 84, (124, 0), 32);
+ Add_Action (Table.States (9), 116, (136, 0), 207);
+ Table.States (9).Goto_List.Set_Capacity (15);
+ Add_Goto (Table.States (9), 124, 208);
+ Add_Goto (Table.States (9), 136, 209);
+ Add_Goto (Table.States (9), 330, 210);
+ Add_Goto (Table.States (9), 332, 95);
+ Add_Goto (Table.States (9), 333, 96);
+ Add_Goto (Table.States (9), 407, 211);
+ Add_Goto (Table.States (9), 409, 212);
+ Add_Goto (Table.States (9), 410, 213);
+ Add_Goto (Table.States (9), 411, 214);
+ Add_Goto (Table.States (9), 412, 215);
+ Add_Goto (Table.States (9), 425, 216);
+ Add_Goto (Table.States (9), 426, 217);
+ Add_Goto (Table.States (9), 427, 218);
+ Add_Goto (Table.States (9), 430, 219);
+ Add_Goto (Table.States (9), 464, 220);
+ Table.States (9).Kernel := To_Vector ((((339, 0), 22, 7, (32767,
0), 0), ((339, 1), 22, 5, (32767, 0),
+ 0), ((339, 2), 22, 7, (32767, 0), 0), ((339, 3), 22, 5,
(32767, 0), 0), ((339, 4), 22, 7, (32767,
+ 0), 0), ((339, 5), 22, 5, (32767, 0), 0), ((406, 0), 22, 3,
(32767, 0), 0), ((406, 1), 22, 0,
+ (406, 1), 1)));
+ Table.States (9).Minimal_Complete_Actions := To_Vector (((Shift,
(411, 0), 83, 206), (Reduce, (406, 1),
+ 1)));
+ Table.States (10).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (10), (21, 53, 54), (329, 1), 1);
+ Table.States (10).Kernel := To_Vector ((0 => ((329, 1), 25, 0,
(329, 1), 1)));
+ Table.States (10).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (329, 1), 1)));
+ Table.States (11).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (11), 22, (339, 0), 9);
+ Add_Action (Table.States (11), 25, (329, 1), 10);
+ Add_Action (Table.States (11), 28, (325, 0), 12);
+ Add_Action (Table.States (11), 50, (332, 0), 19);
+ Add_Action (Table.States (11), 51, (437, 0), 221);
+ Add_Action (Table.States (11), 52, (329, 0), 21);
+ Add_Action (Table.States (11), 53, (294, 0), 22);
+ Add_Action (Table.States (11), 54, (293, 0), 23);
+ Add_Action (Table.States (11), 59, (346, 0), 24);
+ Add_Action (Table.States (11), 60, (340, 0), 25);
+ Add_Action (Table.States (11), 61, (387, 0), 222);
+ Add_Action (Table.States (11), 81, (130, 0), 30);
+ Add_Action (Table.States (11), 83, (128, 0), 31);
+ Add_Action (Table.States (11), 116, (136, 0), 223);
+ Table.States (11).Goto_List.Set_Capacity (56);
+ Add_Goto (Table.States (11), 126, 40);
+ Add_Goto (Table.States (11), 127, 41);
+ Add_Goto (Table.States (11), 128, 42);
+ Add_Goto (Table.States (11), 130, 43);
+ Add_Goto (Table.States (11), 135, 44);
+ Add_Goto (Table.States (11), 136, 45);
+ Add_Goto (Table.States (11), 137, 46);
+ Add_Goto (Table.States (11), 180, 47);
+ Add_Goto (Table.States (11), 189, 48);
+ Add_Goto (Table.States (11), 190, 224);
+ Add_Goto (Table.States (11), 193, 50);
+ Add_Goto (Table.States (11), 194, 51);
+ Add_Goto (Table.States (11), 291, 77);
+ Add_Goto (Table.States (11), 292, 78);
+ Add_Goto (Table.States (11), 293, 79);
+ Add_Goto (Table.States (11), 294, 80);
+ Add_Goto (Table.States (11), 309, 81);
+ Add_Goto (Table.States (11), 320, 86);
+ Add_Goto (Table.States (11), 321, 87);
+ Add_Goto (Table.States (11), 322, 88);
+ Add_Goto (Table.States (11), 325, 89);
+ Add_Goto (Table.States (11), 326, 90);
+ Add_Goto (Table.States (11), 327, 91);
+ Add_Goto (Table.States (11), 328, 92);
+ Add_Goto (Table.States (11), 329, 225);
+ Add_Goto (Table.States (11), 330, 94);
+ Add_Goto (Table.States (11), 332, 95);
+ Add_Goto (Table.States (11), 333, 96);
+ Add_Goto (Table.States (11), 334, 97);
+ Add_Goto (Table.States (11), 335, 98);
+ Add_Goto (Table.States (11), 336, 99);
+ Add_Goto (Table.States (11), 337, 100);
+ Add_Goto (Table.States (11), 338, 101);
+ Add_Goto (Table.States (11), 339, 102);
+ Add_Goto (Table.States (11), 340, 103);
+ Add_Goto (Table.States (11), 341, 104);
+ Add_Goto (Table.States (11), 345, 105);
+ Add_Goto (Table.States (11), 346, 106);
+ Add_Goto (Table.States (11), 347, 107);
+ Add_Goto (Table.States (11), 354, 108);
+ Add_Goto (Table.States (11), 388, 126);
+ Add_Goto (Table.States (11), 389, 127);
+ Add_Goto (Table.States (11), 390, 128);
+ Add_Goto (Table.States (11), 391, 129);
+ Add_Goto (Table.States (11), 392, 130);
+ Add_Goto (Table.States (11), 394, 132);
+ Add_Goto (Table.States (11), 403, 134);
+ Add_Goto (Table.States (11), 404, 135);
+ Add_Goto (Table.States (11), 405, 136);
+ Add_Goto (Table.States (11), 406, 137);
+ Add_Goto (Table.States (11), 408, 138);
+ Add_Goto (Table.States (11), 431, 139);
+ Add_Goto (Table.States (11), 437, 140);
+ Add_Goto (Table.States (11), 438, 141);
+ Add_Goto (Table.States (11), 440, 142);
+ Add_Goto (Table.States (11), 454, 143);
+ Table.States (11).Kernel := To_Vector ((((384, 1), 27, 3,
(32767, 0), 0), ((387, 0), 27, 3, (32767,
+ 0), 0)));
+ Table.States (11).Minimal_Complete_Actions := To_Vector (((Shift,
(128, 0), 83, 31), (Shift, (387, 0),
+ 61, 222)));
+ end Subr_1;
+ procedure Subr_2
+ is begin
+ Table.States (12).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (12), 26, (326, 0), 226);
+ Add_Action (Table.States (12), 86, (252, 0), 33);
+ Add_Action (Table.States (12), 90, (268, 0), 34);
+ Add_Action (Table.States (12), 116, (196, 0), 146);
+ Add_Action (Table.States (12), 117, (196, 1), 37);
+ Add_Action (Table.States (12), 118, (195, 6), 38);
+ Table.States (12).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (12), 195, 227);
+ Add_Goto (Table.States (12), 196, 148);
+ Add_Goto (Table.States (12), 197, 54);
+ Add_Goto (Table.States (12), 198, 55);
+ Add_Goto (Table.States (12), 199, 56);
+ Add_Goto (Table.States (12), 201, 57);
+ Add_Goto (Table.States (12), 251, 58);
+ Add_Goto (Table.States (12), 252, 59);
+ Add_Goto (Table.States (12), 255, 60);
+ Add_Goto (Table.States (12), 268, 68);
+ Add_Goto (Table.States (12), 311, 83);
+ Table.States (12).Kernel := To_Vector ((((325, 0), 28, 12,
(32767, 0), 0), ((325, 1), 28, 9, (32767,
+ 0), 0), ((325, 2), 28, 8, (32767, 0), 0), ((325, 3), 28, 9,
(32767, 0), 0), ((325, 4), 28, 6,
+ (32767, 0), 0), ((325, 5), 28, 5, (32767, 0), 0), ((325, 6),
28, 10, (32767, 0), 0), ((325, 7), 28,
+ 7, (32767, 0), 0), ((325, 8), 28, 6, (32767, 0), 0), ((325,
9), 28, 7, (32767, 0), 0), ((325, 10),
+ 28, 4, (32767, 0), 0), ((325, 11), 28, 3, (32767, 0), 0),
((326, 0), 28, 10, (32767, 0), 0), ((326,
+ 1), 28, 7, (32767, 0), 0), ((326, 2), 28, 8, (32767, 0), 0),
((326, 3), 28, 5, (32767, 0), 0),
+ ((337, 0), 28, 6, (32767, 0), 0), ((337, 1), 28, 4, (32767,
0), 0), ((390, 0), 28, 7, (32767, 0),
+ 0), ((390, 1), 28, 5, (32767, 0), 0), ((408, 0), 28, 7,
(32767, 0), 0), ((408, 1), 28, 5, (32767,
+ 0), 0)));
+ Table.States (12).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (13).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (13), 12, (402, 0), 165);
+ Add_Action (Table.States (13), 46, (233, 2), 167);
+ Add_Action (Table.States (13), 52, (233, 3), 168);
+ Add_Action (Table.States (13), 65, (234, 1), 169);
+ Add_Action (Table.States (13), 76, (256, 0), 170);
+ Add_Action (Table.States (13), 85, (205, 4), 171);
+ Add_Action (Table.States (13), 86, (213, 2), 172);
+ Add_Action (Table.States (13), 90, (268, 0), 34);
+ Add_Action (Table.States (13), 106, (237, 1), 173);
+ Add_Action (Table.States (13), 107, (237, 0), 174);
+ Add_Action (Table.States (13), 108, (316, 1), 228);
+ Add_Action (Table.States (13), 115, (234, 0), 175);
+ Add_Action (Table.States (13), 116, (196, 0), 229);
+ Add_Action (Table.States (13), 117, (196, 1), 37);
+ Add_Action (Table.States (13), 118, (195, 6), 38);
+ Table.States (13).Goto_List.Set_Capacity (32);
+ Add_Goto (Table.States (13), 195, 176);
+ Add_Goto (Table.States (13), 196, 148);
+ Add_Goto (Table.States (13), 197, 54);
+ Add_Goto (Table.States (13), 198, 55);
+ Add_Goto (Table.States (13), 199, 56);
+ Add_Goto (Table.States (13), 201, 57);
+ Add_Goto (Table.States (13), 205, 177);
+ Add_Goto (Table.States (13), 206, 178);
+ Add_Goto (Table.States (13), 210, 179);
+ Add_Goto (Table.States (13), 211, 180);
+ Add_Goto (Table.States (13), 213, 181);
+ Add_Goto (Table.States (13), 214, 182);
+ Add_Goto (Table.States (13), 215, 183);
+ Add_Goto (Table.States (13), 218, 184);
+ Add_Goto (Table.States (13), 219, 185);
+ Add_Goto (Table.States (13), 220, 186);
+ Add_Goto (Table.States (13), 227, 230);
+ Add_Goto (Table.States (13), 228, 188);
+ Add_Goto (Table.States (13), 231, 189);
+ Add_Goto (Table.States (13), 232, 190);
+ Add_Goto (Table.States (13), 233, 191);
+ Add_Goto (Table.States (13), 234, 192);
+ Add_Goto (Table.States (13), 237, 193);
+ Add_Goto (Table.States (13), 251, 58);
+ Add_Goto (Table.States (13), 252, 59);
+ Add_Goto (Table.States (13), 255, 60);
+ Add_Goto (Table.States (13), 256, 194);
+ Add_Goto (Table.States (13), 268, 68);
+ Add_Goto (Table.States (13), 311, 83);
+ Add_Goto (Table.States (13), 317, 231);
+ Add_Goto (Table.States (13), 402, 195);
+ Add_Goto (Table.States (13), 465, 196);
+ Table.States (13).Kernel := To_Vector ((((316, 0), 30, 2,
(32767, 0), 0), ((316, 1), 30, 1, (32767,
+ 0), 0), ((318, 0), 30, 9, (32767, 0), 0), ((318, 1), 30, 4,
(32767, 0), 0)));
+ Table.States (13).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (316, 1), 108, 228)));
+ Table.States (14).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (14), 86, (252, 0), 33);
+ Add_Action (Table.States (14), 90, (268, 0), 34);
+ Add_Action (Table.States (14), 116, (196, 0), 146);
+ Add_Action (Table.States (14), 117, (196, 1), 37);
+ Add_Action (Table.States (14), 118, (195, 6), 38);
+ Table.States (14).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (14), 195, 232);
+ Add_Goto (Table.States (14), 196, 148);
+ Add_Goto (Table.States (14), 197, 54);
+ Add_Goto (Table.States (14), 198, 55);
+ Add_Goto (Table.States (14), 199, 56);
+ Add_Goto (Table.States (14), 201, 57);
+ Add_Goto (Table.States (14), 251, 58);
+ Add_Goto (Table.States (14), 252, 59);
+ Add_Goto (Table.States (14), 255, 60);
+ Add_Goto (Table.States (14), 268, 68);
+ Add_Goto (Table.States (14), 311, 83);
+ Table.States (14).Kernel := To_Vector ((0 => ((290, 0), 31, 2,
(32767, 0), 0)));
+ Table.States (14).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (15).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (15), 63, (289, 2), 233);
+ Add_Action (Table.States (15), 86, (252, 0), 33);
+ Add_Action (Table.States (15), 90, (268, 0), 34);
+ Add_Action (Table.States (15), 108, (289, 3), 234);
+ Add_Action (Table.States (15), 116, (196, 0), 146);
+ Add_Action (Table.States (15), 117, (196, 1), 37);
+ Add_Action (Table.States (15), 118, (195, 6), 38);
+ Table.States (15).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (15), 195, 235);
+ Add_Goto (Table.States (15), 196, 148);
+ Add_Goto (Table.States (15), 197, 54);
+ Add_Goto (Table.States (15), 198, 55);
+ Add_Goto (Table.States (15), 199, 56);
+ Add_Goto (Table.States (15), 201, 57);
+ Add_Goto (Table.States (15), 251, 58);
+ Add_Goto (Table.States (15), 252, 59);
+ Add_Goto (Table.States (15), 255, 60);
+ Add_Goto (Table.States (15), 268, 68);
+ Add_Goto (Table.States (15), 311, 83);
+ Table.States (15).Kernel := To_Vector ((((289, 0), 32, 4,
(32767, 0), 0), ((289, 1), 32, 2, (32767,
+ 0), 0), ((289, 2), 32, 3, (32767, 0), 0), ((289, 3), 32, 1,
(32767, 0), 0)));
+ Table.States (15).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (289, 3), 108, 234)));
+ Table.States (16).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (16), 12, (402, 0), 165);
+ Add_Action (Table.States (16), 46, (233, 2), 167);
+ Add_Action (Table.States (16), 52, (233, 3), 168);
+ Add_Action (Table.States (16), 65, (234, 1), 169);
+ Add_Action (Table.States (16), 76, (256, 0), 170);
+ Add_Action (Table.States (16), 85, (205, 4), 171);
+ Add_Action (Table.States (16), 86, (213, 2), 172);
+ Add_Action (Table.States (16), 90, (268, 0), 34);
+ Add_Action (Table.States (16), 106, (237, 1), 173);
+ Add_Action (Table.States (16), 107, (237, 0), 174);
+ Add_Action (Table.States (16), 115, (234, 0), 175);
+ Add_Action (Table.States (16), 116, (196, 0), 146);
+ Add_Action (Table.States (16), 117, (196, 1), 37);
+ Add_Action (Table.States (16), 118, (195, 6), 38);
+ Table.States (16).Goto_List.Set_Capacity (32);
+ Add_Goto (Table.States (16), 195, 176);
+ Add_Goto (Table.States (16), 196, 148);
+ Add_Goto (Table.States (16), 197, 54);
+ Add_Goto (Table.States (16), 198, 55);
+ Add_Goto (Table.States (16), 199, 56);
+ Add_Goto (Table.States (16), 201, 57);
+ Add_Goto (Table.States (16), 205, 177);
+ Add_Goto (Table.States (16), 206, 178);
+ Add_Goto (Table.States (16), 210, 179);
+ Add_Goto (Table.States (16), 211, 180);
+ Add_Goto (Table.States (16), 213, 181);
+ Add_Goto (Table.States (16), 214, 182);
+ Add_Goto (Table.States (16), 215, 183);
+ Add_Goto (Table.States (16), 218, 184);
+ Add_Goto (Table.States (16), 219, 185);
+ Add_Goto (Table.States (16), 220, 186);
+ Add_Goto (Table.States (16), 227, 236);
+ Add_Goto (Table.States (16), 228, 188);
+ Add_Goto (Table.States (16), 231, 189);
+ Add_Goto (Table.States (16), 232, 190);
+ Add_Goto (Table.States (16), 233, 191);
+ Add_Goto (Table.States (16), 234, 192);
+ Add_Goto (Table.States (16), 237, 193);
+ Add_Goto (Table.States (16), 243, 237);
+ Add_Goto (Table.States (16), 251, 58);
+ Add_Goto (Table.States (16), 252, 59);
+ Add_Goto (Table.States (16), 255, 60);
+ Add_Goto (Table.States (16), 256, 194);
+ Add_Goto (Table.States (16), 268, 68);
+ Add_Goto (Table.States (16), 311, 83);
+ Add_Goto (Table.States (16), 402, 195);
+ Add_Goto (Table.States (16), 465, 196);
+ Table.States (16).Kernel := To_Vector ((0 => ((276, 0), 35, 1,
(32767, 0), 0)));
+ Table.States (16).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (17).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (17), 33, (288, 0), 238);
+ Add_Action (Table.States (17), 51, (276, 3), 239);
+ Add_Action (Table.States (17), 85, (276, 5), 240);
+ Table.States (17).Kernel := To_Vector ((((276, 3), 37, 9,
(32767, 0), 0), ((276, 5), 37, 7, (32767,
+ 0), 0), ((276, 6), 37, 4, (32767, 0), 0), ((276, 7), 37, 7,
(32767, 0), 0), ((276, 8), 37, 4,
+ (32767, 0), 0), ((288, 0), 37, 9, (32767, 0), 0)));
+ Table.States (17).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (276, 3), 51, 239)));
+ Table.States (18).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (18), 12, (402, 0), 165);
+ Add_Action (Table.States (18), 46, (233, 2), 167);
+ Add_Action (Table.States (18), 52, (233, 3), 168);
+ Add_Action (Table.States (18), 65, (234, 1), 169);
+ Add_Action (Table.States (18), 76, (256, 0), 170);
+ Add_Action (Table.States (18), 85, (205, 4), 171);
+ Add_Action (Table.States (18), 86, (213, 2), 172);
+ Add_Action (Table.States (18), 90, (268, 0), 34);
+ Add_Action (Table.States (18), 106, (237, 1), 173);
+ Add_Action (Table.States (18), 107, (237, 0), 174);
+ Add_Action (Table.States (18), 115, (234, 0), 175);
+ Add_Action (Table.States (18), 116, (196, 0), 146);
+ Add_Action (Table.States (18), 117, (196, 1), 37);
+ Add_Action (Table.States (18), 118, (195, 6), 38);
+ Table.States (18).Goto_List.Set_Capacity (32);
+ Add_Goto (Table.States (18), 195, 176);
+ Add_Goto (Table.States (18), 196, 148);
+ Add_Goto (Table.States (18), 197, 54);
+ Add_Goto (Table.States (18), 198, 55);
+ Add_Goto (Table.States (18), 199, 56);
+ Add_Goto (Table.States (18), 201, 57);
+ Add_Goto (Table.States (18), 205, 177);
+ Add_Goto (Table.States (18), 206, 178);
+ Add_Goto (Table.States (18), 210, 179);
+ Add_Goto (Table.States (18), 211, 180);
+ Add_Goto (Table.States (18), 213, 181);
+ Add_Goto (Table.States (18), 214, 182);
+ Add_Goto (Table.States (18), 215, 183);
+ Add_Goto (Table.States (18), 218, 184);
+ Add_Goto (Table.States (18), 219, 185);
+ Add_Goto (Table.States (18), 220, 186);
+ Add_Goto (Table.States (18), 227, 236);
+ Add_Goto (Table.States (18), 228, 188);
+ Add_Goto (Table.States (18), 231, 189);
+ Add_Goto (Table.States (18), 232, 190);
+ Add_Goto (Table.States (18), 233, 191);
+ Add_Goto (Table.States (18), 234, 192);
+ Add_Goto (Table.States (18), 237, 193);
+ Add_Goto (Table.States (18), 243, 241);
+ Add_Goto (Table.States (18), 251, 58);
+ Add_Goto (Table.States (18), 252, 59);
+ Add_Goto (Table.States (18), 255, 60);
+ Add_Goto (Table.States (18), 256, 194);
+ Add_Goto (Table.States (18), 268, 68);
+ Add_Goto (Table.States (18), 311, 83);
+ Add_Goto (Table.States (18), 402, 195);
+ Add_Goto (Table.States (18), 465, 196);
+ Table.States (18).Kernel := To_Vector ((((271, 0), 42, 15,
(32767, 0), 0), ((271, 1), 42, 12, (32767,
+ 0), 0), ((271, 2), 42, 10, (32767, 0), 0), ((271, 3), 42, 7,
(32767, 0), 0)));
+ Table.States (18).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (19).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (19), 55, (333, 0), 242);
+ Add_Action (Table.States (19), 83, (333, 1), 243);
+ Add_Action (Table.States (19), 86, (252, 0), 33);
+ Add_Action (Table.States (19), 90, (268, 0), 34);
+ Add_Action (Table.States (19), 116, (196, 0), 146);
+ Add_Action (Table.States (19), 117, (196, 1), 37);
+ Add_Action (Table.States (19), 118, (195, 6), 38);
+ Table.States (19).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (19), 195, 244);
+ Add_Goto (Table.States (19), 196, 148);
+ Add_Goto (Table.States (19), 197, 54);
+ Add_Goto (Table.States (19), 198, 55);
+ Add_Goto (Table.States (19), 199, 56);
+ Add_Goto (Table.States (19), 201, 57);
+ Add_Goto (Table.States (19), 251, 58);
+ Add_Goto (Table.States (19), 252, 59);
+ Add_Goto (Table.States (19), 255, 60);
+ Add_Goto (Table.States (19), 268, 68);
+ Add_Goto (Table.States (19), 311, 83);
+ Add_Goto (Table.States (19), 331, 245);
+ Table.States (19).Kernel := To_Vector ((((332, 0), 50, 2,
(32767, 0), 0), ((333, 0), 50, 4, (32767,
+ 0), 0), ((333, 1), 50, 3, (32767, 0), 0)));
+ Table.States (19).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (20).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (20), 85, (283, 1), 246);
+ Add_Action (Table.States (20), 86, (252, 0), 33);
+ Add_Action (Table.States (20), 90, (268, 0), 34);
+ Add_Action (Table.States (20), 116, (196, 0), 247);
+ Add_Action (Table.States (20), 117, (196, 1), 37);
+ Add_Action (Table.States (20), 118, (195, 6), 38);
+ Table.States (20).Goto_List.Set_Capacity (16);
+ Add_Goto (Table.States (20), 195, 248);
+ Add_Goto (Table.States (20), 196, 249);
+ Add_Goto (Table.States (20), 197, 54);
+ Add_Goto (Table.States (20), 198, 55);
+ Add_Goto (Table.States (20), 199, 56);
+ Add_Goto (Table.States (20), 201, 57);
+ Add_Goto (Table.States (20), 251, 58);
+ Add_Goto (Table.States (20), 252, 59);
+ Add_Goto (Table.States (20), 255, 60);
+ Add_Goto (Table.States (20), 268, 68);
+ Add_Goto (Table.States (20), 278, 250);
+ Add_Goto (Table.States (20), 280, 251);
+ Add_Goto (Table.States (20), 282, 252);
+ Add_Goto (Table.States (20), 283, 253);
+ Add_Goto (Table.States (20), 299, 254);
+ Add_Goto (Table.States (20), 311, 83);
+ Table.States (20).Kernel := To_Vector ((((276, 1), 51, 3,
(32767, 0), 0), ((276, 2), 51, 3, (32767,
+ 0), 0), ((276, 4), 51, 8, (32767, 0), 0), ((437, 0), 51, 6,
(32767, 0), 0), ((438, 0), 51, 5,
+ (32767, 0), 0), ((440, 0), 51, 19, (32767, 0), 0), ((440, 1),
51, 18, (32767, 0), 0), ((440, 2),
+ 51, 11, (32767, 0), 0), ((440, 3), 51, 10, (32767, 0), 0),
((440, 4), 51, 15, (32767, 0), 0),
+ ((440, 5), 51, 14, (32767, 0), 0), ((440, 6), 51, 7, (32767,
0), 0), ((440, 7), 51, 6, (32767, 0),
+ 0), ((454, 0), 51, 5, (32767, 0), 0)));
+ Table.States (20).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 247)));
+ Table.States (21).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (21), 25, (329, 0), 255);
+ Table.States (21).Kernel := To_Vector ((0 => ((329, 0), 52, 1,
(32767, 0), 0)));
+ Table.States (21).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (329, 0), 25, 255)));
+ Table.States (22).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (22), 86, (252, 0), 33);
+ Add_Action (Table.States (22), 90, (268, 0), 34);
+ Add_Action (Table.States (22), 116, (196, 0), 146);
+ Add_Action (Table.States (22), 117, (196, 1), 37);
+ Add_Action (Table.States (22), 118, (195, 6), 38);
+ Table.States (22).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (22), 195, 256);
+ Add_Goto (Table.States (22), 196, 148);
+ Add_Goto (Table.States (22), 197, 54);
+ Add_Goto (Table.States (22), 198, 55);
+ Add_Goto (Table.States (22), 199, 56);
+ Add_Goto (Table.States (22), 201, 57);
+ Add_Goto (Table.States (22), 251, 58);
+ Add_Goto (Table.States (22), 252, 59);
+ Add_Goto (Table.States (22), 255, 60);
+ Add_Goto (Table.States (22), 268, 68);
+ Add_Goto (Table.States (22), 311, 83);
+ Table.States (22).Kernel := To_Vector ((((294, 0), 53, 3,
(32767, 0), 0), ((408, 8), 53, 7, (32767,
+ 0), 0), ((408, 9), 53, 5, (32767, 0), 0)));
+ Table.States (22).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (23).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (23), 86, (252, 0), 33);
+ Add_Action (Table.States (23), 90, (268, 0), 34);
+ Add_Action (Table.States (23), 116, (196, 0), 146);
+ Add_Action (Table.States (23), 117, (196, 1), 37);
+ Add_Action (Table.States (23), 118, (195, 6), 38);
+ Table.States (23).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (23), 195, 257);
+ Add_Goto (Table.States (23), 196, 148);
+ Add_Goto (Table.States (23), 197, 54);
+ Add_Goto (Table.States (23), 198, 55);
+ Add_Goto (Table.States (23), 199, 56);
+ Add_Goto (Table.States (23), 201, 57);
+ Add_Goto (Table.States (23), 251, 58);
+ Add_Goto (Table.States (23), 252, 59);
+ Add_Goto (Table.States (23), 255, 60);
+ Add_Goto (Table.States (23), 268, 68);
+ Add_Goto (Table.States (23), 311, 83);
+ Table.States (23).Kernel := To_Vector ((((293, 0), 54, 1,
(32767, 0), 0), ((408, 4), 54, 7, (32767,
+ 0), 0), ((408, 5), 54, 5, (32767, 0), 0)));
+ Table.States (23).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (24).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (24), 26, (354, 0), 258);
+ Add_Action (Table.States (24), 83, (346, 0), 259);
+ Add_Action (Table.States (24), 116, (347, 0), 260);
+ Table.States (24).Kernel := To_Vector ((((346, 0), 59, 15,
(32767, 0), 0), ((346, 1), 59, 12, (32767,
+ 0), 0), ((346, 2), 59, 13, (32767, 0), 0), ((346, 3), 59,
10, (32767, 0), 0), ((346, 4), 59, 10,
+ (32767, 0), 0), ((346, 5), 59, 7, (32767, 0), 0), ((346, 6),
59, 8, (32767, 0), 0), ((346, 7), 59,
+ 5, (32767, 0), 0), ((347, 0), 59, 9, (32767, 0), 0), ((347,
1), 59, 6, (32767, 0), 0), ((347, 2),
+ 59, 7, (32767, 0), 0), ((347, 3), 59, 4, (32767, 0), 0),
((354, 0), 59, 10, (32767, 0), 0), ((354,
+ 1), 59, 7, (32767, 0), 0), ((354, 2), 59, 8, (32767, 0), 0),
((354, 3), 59, 5, (32767, 0), 0),
+ ((392, 0), 59, 7, (32767, 0), 0), ((392, 1), 59, 5, (32767,
0), 0)));
+ Table.States (24).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (347, 0), 116, 260)));
+ Table.States (25).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (25), 26, (345, 0), 261);
+ Add_Action (Table.States (25), 83, (340, 0), 262);
+ Add_Action (Table.States (25), 116, (341, 0), 263);
+ Table.States (25).Kernel := To_Vector ((((340, 0), 60, 18,
(32767, 0), 0), ((340, 1), 60, 15, (32767,
+ 0), 0), ((340, 2), 60, 10, (32767, 0), 0), ((340, 3), 60,
16, (32767, 0), 0), ((340, 4), 60, 13,
+ (32767, 0), 0), ((340, 5), 60, 8, (32767, 0), 0), ((340, 6),
60, 13, (32767, 0), 0), ((340, 7), 60,
+ 10, (32767, 0), 0), ((340, 8), 60, 5, (32767, 0), 0), ((340,
9), 60, 11, (32767, 0), 0), ((340,
+ 10), 60, 8, (32767, 0), 0), ((340, 11), 60, 3, (32767, 0),
0), ((341, 0), 60, 12, (32767, 0), 0),
+ ((341, 1), 60, 9, (32767, 0), 0), ((341, 2), 60, 4, (32767,
0), 0), ((341, 3), 60, 10, (32767, 0),
+ 0), ((341, 4), 60, 7, (32767, 0), 0), ((341, 5), 60, 2,
(32767, 0), 0), ((345, 0), 60, 10, (32767,
+ 0), 0), ((345, 1), 60, 8, (32767, 0), 0), ((391, 0), 60, 7,
(32767, 0), 0), ((391, 1), 60, 5,
+ (32767, 0), 0)));
+ Table.States (25).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (341, 0), 116, 263)));
+ Table.States (26).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (26), 86, (252, 0), 33);
+ Add_Action (Table.States (26), 90, (268, 0), 34);
+ Add_Action (Table.States (26), 116, (196, 0), 146);
+ Add_Action (Table.States (26), 117, (196, 1), 37);
+ Add_Action (Table.States (26), 118, (195, 6), 38);
+ Table.States (26).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (26), 195, 244);
+ Add_Goto (Table.States (26), 196, 148);
+ Add_Goto (Table.States (26), 197, 54);
+ Add_Goto (Table.States (26), 198, 55);
+ Add_Goto (Table.States (26), 199, 56);
+ Add_Goto (Table.States (26), 201, 57);
+ Add_Goto (Table.States (26), 251, 58);
+ Add_Goto (Table.States (26), 252, 59);
+ Add_Goto (Table.States (26), 255, 60);
+ Add_Goto (Table.States (26), 268, 68);
+ Add_Goto (Table.States (26), 311, 83);
+ Add_Goto (Table.States (26), 331, 264);
+ Table.States (26).Kernel := To_Vector ((0 => ((387, 1), 61, 2,
(32767, 0), 0)));
+ Table.States (26).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (27).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (27), 12, (402, 0), 165);
+ Add_Action (Table.States (27), 46, (233, 2), 167);
+ Add_Action (Table.States (27), 52, (233, 3), 168);
+ Add_Action (Table.States (27), 65, (234, 1), 169);
+ Add_Action (Table.States (27), 76, (256, 0), 170);
+ Add_Action (Table.States (27), 85, (205, 4), 171);
+ Add_Action (Table.States (27), 86, (213, 2), 172);
+ Add_Action (Table.States (27), 90, (268, 0), 34);
+ Add_Action (Table.States (27), 106, (237, 1), 173);
+ Add_Action (Table.States (27), 107, (237, 0), 174);
+ Add_Action (Table.States (27), 115, (234, 0), 175);
+ Add_Action (Table.States (27), 116, (196, 0), 146);
+ Add_Action (Table.States (27), 117, (196, 1), 37);
+ Add_Action (Table.States (27), 118, (195, 6), 38);
+ Table.States (27).Goto_List.Set_Capacity (31);
+ Add_Goto (Table.States (27), 195, 176);
+ Add_Goto (Table.States (27), 196, 148);
+ Add_Goto (Table.States (27), 197, 54);
+ Add_Goto (Table.States (27), 198, 55);
+ Add_Goto (Table.States (27), 199, 56);
+ Add_Goto (Table.States (27), 201, 57);
+ Add_Goto (Table.States (27), 205, 177);
+ Add_Goto (Table.States (27), 206, 178);
+ Add_Goto (Table.States (27), 210, 179);
+ Add_Goto (Table.States (27), 211, 180);
+ Add_Goto (Table.States (27), 213, 181);
+ Add_Goto (Table.States (27), 214, 182);
+ Add_Goto (Table.States (27), 215, 183);
+ Add_Goto (Table.States (27), 218, 184);
+ Add_Goto (Table.States (27), 219, 185);
+ Add_Goto (Table.States (27), 220, 186);
+ Add_Goto (Table.States (27), 227, 265);
+ Add_Goto (Table.States (27), 228, 188);
+ Add_Goto (Table.States (27), 231, 189);
+ Add_Goto (Table.States (27), 232, 190);
+ Add_Goto (Table.States (27), 233, 191);
+ Add_Goto (Table.States (27), 234, 192);
+ Add_Goto (Table.States (27), 237, 193);
+ Add_Goto (Table.States (27), 251, 58);
+ Add_Goto (Table.States (27), 252, 59);
+ Add_Goto (Table.States (27), 255, 60);
+ Add_Goto (Table.States (27), 256, 194);
+ Add_Goto (Table.States (27), 268, 68);
+ Add_Goto (Table.States (27), 311, 83);
+ Add_Goto (Table.States (27), 402, 195);
+ Add_Goto (Table.States (27), 465, 196);
+ Table.States (27).Kernel := To_Vector ((0 => ((273, 0), 64, 10,
(32767, 0), 0)));
+ Table.States (27).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ end Subr_2;
+ procedure Subr_3
+ is begin
+ Table.States (28).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (28), 108, (264, 0), 266);
+ Table.States (28).Kernel := To_Vector ((0 => ((264, 0), 65, 1,
(32767, 0), 0)));
+ Table.States (28).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 108, 266)));
+ Table.States (29).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (29), 27, (386, 0), 267);
+ Add_Action (Table.States (29), 61, (386, 1), 268);
+ Table.States (29).Kernel := To_Vector ((((386, 0), 77, 4,
(32767, 0), 0), ((386, 1), 77, 3, (32767,
+ 0), 0)));
+ Table.States (29).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (386, 1), 61, 268)));
+ Table.States (30).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (30), 116, (130, 0), 269);
+ Table.States (30).Kernel := To_Vector ((((130, 0), 81, 6,
(32767, 0), 0), ((130, 1), 81, 4, (32767,
+ 0), 0)));
+ Table.States (30).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (130, 0), 116, 269)));
+ Table.States (31).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (31), 116, (128, 0), 270);
+ Table.States (31).Kernel := To_Vector ((((128, 0), 83, 11,
(32767, 0), 0), ((128, 1), 83, 9, (32767,
+ 0), 0), ((128, 2), 83, 6, (32767, 0), 0), ((128, 3), 83, 4,
(32767, 0), 0), ((189, 0), 83, 7,
+ (32767, 0), 0), ((189, 1), 83, 5, (32767, 0), 0), ((189, 2),
83, 4, (32767, 0), 0), ((189, 3), 83,
+ 2, (32767, 0), 0), ((327, 0), 83, 12, (32767, 0), 0), ((327,
1), 83, 10, (32767, 0), 0), ((327, 2),
+ 83, 11, (32767, 0), 0), ((327, 3), 83, 9, (32767, 0), 0),
((327, 4), 83, 11, (32767, 0), 0), ((327,
+ 5), 83, 9, (32767, 0), 0), ((327, 6), 83, 10, (32767, 0),
0), ((327, 7), 83, 8, (32767, 0), 0),
+ ((327, 8), 83, 10, (32767, 0), 0), ((327, 9), 83, 8, (32767,
0), 0), ((327, 10), 83, 9, (32767, 0),
+ 0), ((327, 11), 83, 7, (32767, 0), 0), ((327, 12), 83, 9,
(32767, 0), 0), ((327, 13), 83, 7,
+ (32767, 0), 0), ((327, 14), 83, 8, (32767, 0), 0), ((327, 15),
83, 6, (32767, 0), 0), ((327, 16),
+ 83, 8, (32767, 0), 0), ((327, 17), 83, 6, (32767, 0), 0),
((327, 18), 83, 7, (32767, 0), 0), ((327,
+ 19), 83, 5, (32767, 0), 0), ((327, 20), 83, 7, (32767, 0),
0), ((327, 21), 83, 5, (32767, 0), 0),
+ ((327, 22), 83, 6, (32767, 0), 0), ((327, 23), 83, 4, (32767,
0), 0), ((328, 0), 83, 16, (32767,
+ 0), 0), ((328, 1), 83, 14, (32767, 0), 0), ((328, 2), 83,
14, (32767, 0), 0), ((328, 3), 83, 12,
+ (32767, 0), 0), ((328, 4), 83, 16, (32767, 0), 0), ((328, 5),
83, 14, (32767, 0), 0), ((328, 6),
+ 83, 14, (32767, 0), 0), ((328, 7), 83, 12, (32767, 0), 0),
((328, 8), 83, 15, (32767, 0), 0),
+ ((328, 9), 83, 13, (32767, 0), 0), ((328, 10), 83, 13,
(32767, 0), 0), ((328, 11), 83, 11, (32767,
+ 0), 0), ((328, 12), 83, 15, (32767, 0), 0), ((328, 13), 83,
13, (32767, 0), 0), ((328, 14), 83,
+ 13, (32767, 0), 0), ((328, 15), 83, 11, (32767, 0), 0), ((328,
16), 83, 15, (32767, 0), 0), ((328,
+ 17), 83, 13, (32767, 0), 0), ((328, 18), 83, 13, (32767, 0),
0), ((328, 19), 83, 11, (32767, 0),
+ 0), ((328, 20), 83, 14, (32767, 0), 0), ((328, 21), 83, 12,
(32767, 0), 0), ((328, 22), 83, 12,
+ (32767, 0), 0), ((328, 23), 83, 10, (32767, 0), 0), ((328,
24), 83, 13, (32767, 0), 0), ((328, 25),
+ 83, 11, (32767, 0), 0), ((328, 26), 83, 11, (32767, 0), 0),
((328, 27), 83, 9, (32767, 0), 0),
+ ((328, 28), 83, 13, (32767, 0), 0), ((328, 29), 83, 11,
(32767, 0), 0), ((328, 30), 83, 11, (32767,
+ 0), 0), ((328, 31), 83, 9, (32767, 0), 0), ((328, 32), 83,
12, (32767, 0), 0), ((328, 33), 83, 10,
+ (32767, 0), 0), ((328, 34), 83, 10, (32767, 0), 0), ((328,
35), 83, 8, (32767, 0), 0), ((328, 36),
+ 83, 12, (32767, 0), 0), ((328, 37), 83, 10, (32767, 0), 0),
((328, 38), 83, 10, (32767, 0), 0),
+ ((328, 39), 83, 8, (32767, 0), 0), ((328, 40), 83, 12,
(32767, 0), 0), ((328, 41), 83, 10, (32767,
+ 0), 0), ((328, 42), 83, 10, (32767, 0), 0), ((328, 43), 83,
8, (32767, 0), 0), ((328, 44), 83, 11,
+ (32767, 0), 0), ((328, 45), 83, 9, (32767, 0), 0), ((328, 46),
83, 9, (32767, 0), 0), ((328, 47),
+ 83, 7, (32767, 0), 0)));
+ Table.States (31).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (128, 0), 116, 270)));
+ Table.States (32).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (32), 116, (124, 0), 271);
+ Table.States (32).Kernel := To_Vector ((((124, 0), 84, 5,
(32767, 0), 0), ((124, 1), 84, 2, (32767,
+ 0), 0), ((124, 2), 84, 8, (32767, 0), 0), ((124, 3), 84, 2,
(32767, 0), 0)));
+ Table.States (32).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (124, 0), 116, 271)));
+ Table.States (33).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (33), 37, (252, 0), 272);
+ Add_Action (Table.States (33), 51, (221, 0), 273);
+ Table.States (33).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (33), 221, 274);
+ Table.States (33).Kernel := To_Vector ((((252, 0), 86, 11,
(32767, 0), 0), ((252, 1), 86, 8, (32767,
+ 0), 0), ((252, 2), 86, 7, (32767, 0), 0)));
+ Table.States (33).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (221, 0), 51, 273)));
+ Table.States (34).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (34), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71, 72,
+ 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99, 100,
101, 103, 104, 106, 107, 108, 109, 110,
+ 111, 112, 113, 114), (268, 0), 1);
+ Table.States (34).Kernel := To_Vector ((0 => ((268, 0), 90, 0,
(268, 0), 1)));
+ Table.States (34).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (268, 0), 1)));
+ Table.States (35).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (35), 116, (196, 0), 146);
+ Add_Action (Table.States (35), 117, (196, 1), 37);
+ Table.States (35).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (35), 196, 275);
+ Add_Goto (Table.States (35), 266, 276);
+ Table.States (35).Kernel := To_Vector ((0 => ((265, 0), 105, 2,
(32767, 0), 0)));
+ Table.States (35).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (36).Action_List.Set_Capacity (9);
+ Add_Action (Table.States (36), 24, (335, 4), 277);
+ Add_Action (Table.States (36), 85, Reduce, (196, 0), 1);
+ Add_Action (Table.States (36), 93, (335, 0), 278);
+ Add_Conflict (Table.States (36), 93, (136, 0), 1);
+ Add_Conflict (Table.States (36), 93, (196, 0), 1);
+ Add_Action (Table.States (36), 94, Reduce, (196, 0), 1);
+ Add_Action (Table.States (36), 95, Reduce, (136, 0), 1);
+ Add_Action (Table.States (36), 96, Reduce, (196, 0), 1);
+ Add_Action (Table.States (36), 108, Reduce, (196, 0), 1);
+ Add_Action (Table.States (36), 113, Reduce, (196, 0), 1);
+ Add_Action (Table.States (36), 114, Reduce, (196, 0), 1);
+ Table.States (36).Kernel := To_Vector ((((136, 0), 116, 0, (136,
0), 1), ((196, 0), 116, 0, (196, 0),
+ 1), ((335, 0), 116, 9, (32767, 0), 0), ((335, 1), 116, 7,
(32767, 0), 0), ((335, 2), 116, 7,
+ (32767, 0), 0), ((335, 3), 116, 5, (32767, 0), 0), ((335, 4),
116, 5, (32767, 0), 0), ((335, 5),
+ 116, 3, (32767, 0), 0), ((335, 6), 116, 8, (32767, 0), 0),
((335, 7), 116, 6, (32767, 0), 0),
+ ((336, 0), 116, 7, (32767, 0), 0), ((336, 1), 116, 5, (32767,
0), 0)));
+ Table.States (36).Minimal_Complete_Actions := To_Vector (((Reduce,
(136, 0), 1), (Reduce, (196, 0), 1),
+ (Shift, (335, 4), 24, 277)));
+ Table.States (37).Action_List.Set_Capacity (49);
+ Add_Action (Table.States (37), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71, 72,
+ 73, 74, 75, 82, 85, 87, 88, 89, 91, 93, 94, 95, 96, 97, 98, 99,
100, 101, 102, 103, 104, 106, 107, 108,
+ 109, 110, 111, 112, 113, 114), (196, 1), 1);
+ Table.States (37).Kernel := To_Vector ((0 => ((196, 1), 117, 0,
(196, 1), 1)));
+ Table.States (37).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (196, 1), 1)));
+ Table.States (38).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (38), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71, 72,
+ 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99, 100,
101, 103, 104, 106, 107, 108, 109, 110,
+ 111, 112, 113, 114), (195, 6), 1);
+ Table.States (38).Kernel := To_Vector ((0 => ((195, 6), 118, 0,
(195, 6), 1)));
+ Table.States (38).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 6), 1)));
+ Table.States (39).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (39), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61, 63,
64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (262, 10), 1);
+ Table.States (39).Kernel := To_Vector ((0 => ((262, 10), 124, 0,
(262, 10), 1)));
+ Table.States (39).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (262, 10), 1)));
+ Table.States (40).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (40), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37, 38,
+ 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (193,
+ 0), 1);
+ Table.States (40).Kernel := To_Vector ((0 => ((193, 0), 126, 0,
(193, 0), 1)));
+ Table.States (40).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (193, 0), 1)));
+ Table.States (41).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (41), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37, 38,
+ 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (126,
+ 0), 1);
+ Table.States (41).Kernel := To_Vector ((0 => ((126, 0), 127, 0,
(126, 0), 1)));
+ Table.States (41).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (126, 0), 1)));
+ Table.States (42).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (42), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37, 38,
+ 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (127,
+ 0), 1);
+ Table.States (42).Kernel := To_Vector ((0 => ((127, 0), 128, 0,
(127, 0), 1)));
+ Table.States (42).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (127, 0), 1)));
+ Table.States (43).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (43), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37, 38,
+ 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (126,
+ 1), 1);
+ Table.States (43).Kernel := To_Vector ((0 => ((126, 1), 130, 0,
(126, 1), 1)));
+ Table.States (43).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (126, 1), 1)));
+ Table.States (44).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (44), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37, 38,
+ 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (126,
+ 2), 1);
+ Table.States (44).Kernel := To_Vector ((0 => ((126, 2), 135, 0,
(126, 2), 1)));
+ Table.States (44).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (126, 2), 1)));
+ Table.States (45).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (45), 93, (135, 0), 279);
+ Add_Action (Table.States (45), 95, (136, 1), 280);
+ Table.States (45).Kernel := To_Vector ((((135, 0), 136, 9,
(32767, 0), 0), ((135, 1), 136, 7, (32767,
+ 0), 0), ((135, 2), 136, 7, (32767, 0), 0), ((135, 3), 136,
5, (32767, 0), 0), ((135, 4), 136, 8,
+ (32767, 0), 0), ((135, 5), 136, 6, (32767, 0), 0), ((135, 6),
136, 6, (32767, 0), 0), ((135, 7),
+ 136, 4, (32767, 0), 0), ((135, 8), 136, 8, (32767, 0), 0),
((135, 9), 136, 6, (32767, 0), 0),
+ ((135, 10), 136, 6, (32767, 0), 0), ((135, 11), 136, 4,
(32767, 0), 0), ((135, 12), 136, 7, (32767,
+ 0), 0), ((135, 13), 136, 5, (32767, 0), 0), ((135, 14), 136,
5, (32767, 0), 0), ((135, 15), 136,
+ 3, (32767, 0), 0), ((135, 16), 136, 10, (32767, 0), 0), ((135,
17), 136, 8, (32767, 0), 0), ((135,
+ 18), 136, 8, (32767, 0), 0), ((135, 19), 136, 6, (32767, 0),
0), ((135, 20), 136, 9, (32767, 0),
+ 0), ((135, 21), 136, 7, (32767, 0), 0), ((135, 22), 136, 7,
(32767, 0), 0), ((135, 23), 136, 5,
+ (32767, 0), 0), ((135, 24), 136, 9, (32767, 0), 0), ((135,
25), 136, 7, (32767, 0), 0), ((135, 26),
+ 136, 7, (32767, 0), 0), ((135, 27), 136, 5, (32767, 0), 0),
((135, 28), 136, 8, (32767, 0), 0),
+ ((135, 29), 136, 6, (32767, 0), 0), ((135, 30), 136, 6,
(32767, 0), 0), ((135, 31), 136, 4, (32767,
+ 0), 0), ((135, 32), 136, 15, (32767, 0), 0), ((135, 33), 136,
13, (32767, 0), 0), ((135, 34), 136,
+ 13, (32767, 0), 0), ((135, 35), 136, 11, (32767, 0), 0),
((135, 36), 136, 14, (32767, 0), 0), ((135,
+ 37), 136, 12, (32767, 0), 0), ((135, 38), 136, 12, (32767,
0), 0), ((135, 39), 136, 10, (32767, 0),
+ 0), ((135, 40), 136, 14, (32767, 0), 0), ((135, 41), 136,
12, (32767, 0), 0), ((135, 42), 136, 12,
+ (32767, 0), 0), ((135, 43), 136, 10, (32767, 0), 0), ((135,
44), 136, 13, (32767, 0), 0), ((135,
+ 45), 136, 11, (32767, 0), 0), ((135, 46), 136, 11, (32767,
0), 0), ((135, 47), 136, 9, (32767, 0),
+ 0), ((136, 1), 136, 2, (32767, 0), 0), ((137, 0), 136, 5,
(32767, 0), 0), ((394, 0), 136, 5,
+ (32767, 0), 0), ((394, 1), 136, 3, (32767, 0), 0)));
+ Table.States (45).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 0), 93, 279)));
+ Table.States (46).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (46), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37, 38,
+ 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (126,
+ 3), 1);
+ Table.States (46).Kernel := To_Vector ((0 => ((126, 3), 137, 0,
(126, 3), 1)));
+ Table.States (46).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (126, 3), 1)));
+ Table.States (47).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (47), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37, 38,
+ 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (126,
+ 5), 1);
+ Table.States (47).Kernel := To_Vector ((0 => ((126, 5), 180, 0,
(126, 5), 1)));
+ Table.States (47).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (126, 5), 1)));
+ Table.States (48).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (48), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37, 38,
+ 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (127,
+ 1), 1);
+ Table.States (48).Kernel := To_Vector ((0 => ((127, 1), 189, 0,
(127, 1), 1)));
+ Table.States (48).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (127, 1), 1)));
+ Table.States (49).Action_List.Set_Capacity (42);
+ Add_Action (Table.States (49), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37, 38,
+ 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 77, 81, 83, 84,
86, 90, 105, 116, 117, 118, 119), (384, 2),
+ 1);
+ Table.States (49).Kernel := To_Vector ((0 => ((384, 2), 190, 0,
(384, 2), 1)));
+ Table.States (49).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (384, 2), 1)));
+ Table.States (50).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (50), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37, 38,
+ 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (190,
+ 0), 1);
+ Table.States (50).Kernel := To_Vector ((0 => ((190, 0), 193, 0,
(190, 0), 1)));
+ Table.States (50).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (190, 0), 1)));
+ Table.States (51).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (51), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37, 38,
+ 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (190,
+ 1), 1);
+ Table.States (51).Kernel := To_Vector ((0 => ((190, 1), 194, 0,
(190, 1), 1)));
+ Table.States (51).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (190, 1), 1)));
+ Table.States (52).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (52), 85, (198, 0), 281);
+ Add_Action (Table.States (52), 94, (134, 0), 282);
+ Add_Action (Table.States (52), 96, (197, 0), 283);
+ Add_Action (Table.States (52), 108, (310, 0), 284);
+ Add_Action (Table.States (52), 113, (121, 0), 285);
+ Add_Action (Table.States (52), 114, (121, 1), 286);
+ Table.States (52).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (52), 121, 287);
+ Add_Goto (Table.States (52), 134, 288);
+ Add_Goto (Table.States (52), 313, 289);
+ Table.States (52).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((267, 0), 195, 3, (32767, 0), 0), ((310, 0),
195, 1, (32767, 0), 0), ((311, 0),
+ 195, 3, (32767, 0), 0)));
+ Table.States (52).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (310, 0), 108, 284)));
+ Table.States (53).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (53), 85, Reduce, (195, 0), 1);
+ Add_Action (Table.States (53), 93, Reduce, (266, 0), 1);
+ Add_Action (Table.States (53), 94, Reduce, (195, 0), 1);
+ Add_Action (Table.States (53), 96, Reduce, (195, 0), 1);
+ Add_Action (Table.States (53), 108, Reduce, (195, 0), 1);
+ Add_Action (Table.States (53), 113, Reduce, (195, 0), 1);
+ Add_Action (Table.States (53), 114, Reduce, (195, 0), 1);
+ Table.States (53).Kernel := To_Vector ((((195, 0), 196, 0, (195,
0), 1), ((266, 0), 196, 0, (266, 0),
+ 1)));
+ Table.States (53).Minimal_Complete_Actions := To_Vector (((Reduce,
(195, 0), 1), (Reduce, (266, 0), 1)));
+ Table.States (54).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (54), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71, 72,
+ 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99, 100,
101, 103, 104, 106, 107, 108, 109, 110,
+ 111, 112, 113, 114), (195, 1), 1);
+ Table.States (54).Kernel := To_Vector ((0 => ((195, 1), 197, 0,
(195, 1), 1)));
+ Table.States (54).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 1)));
+ Table.States (55).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (55), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71, 72,
+ 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99, 100,
101, 103, 104, 106, 107, 108, 109, 110,
+ 111, 112, 113, 114), (195, 2), 1);
+ Table.States (55).Kernel := To_Vector ((0 => ((195, 2), 198, 0,
(195, 2), 1)));
+ Table.States (55).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 2), 1)));
+ Table.States (56).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (56), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71, 72,
+ 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99, 100,
101, 103, 104, 106, 107, 108, 109, 110,
+ 111, 112, 113, 114), (195, 3), 1);
+ Table.States (56).Kernel := To_Vector ((0 => ((195, 3), 199, 0,
(195, 3), 1)));
+ Table.States (56).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 3), 1)));
+ Table.States (57).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (57), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71, 72,
+ 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99, 100,
101, 103, 104, 106, 107, 108, 109, 110,
+ 111, 112, 113, 114), (195, 4), 1);
+ Table.States (57).Kernel := To_Vector ((0 => ((195, 4), 201, 0,
(195, 4), 1)));
+ Table.States (57).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 4), 1)));
+ Table.States (58).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (58), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71, 72,
+ 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99, 100,
101, 103, 104, 106, 107, 108, 109, 110,
+ 111, 112, 113, 114), (201, 1), 1);
+ Table.States (58).Kernel := To_Vector ((0 => ((201, 1), 251, 0,
(201, 1), 1)));
+ Table.States (58).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (201, 1), 1)));
+ Table.States (59).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (59), 113, (121, 0), 285);
+ Add_Action (Table.States (59), 114, (121, 1), 286);
+ Table.States (59).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (59), 121, 290);
+ Table.States (59).Kernel := To_Vector ((0 => ((251, 0), 252, 7,
(32767, 0), 0)));
+ Table.States (59).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (121, 0), 113, 285)));
+ Table.States (60).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (60), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71, 72,
+ 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99, 100,
101, 103, 104, 106, 107, 108, 109, 110,
+ 111, 112, 113, 114), (195, 7), 1);
+ Table.States (60).Kernel := To_Vector ((0 => ((195, 7), 255, 0,
(195, 7), 1)));
+ Table.States (60).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 7), 1)));
+ Table.States (61).Action_List.Set_Capacity (42);
+ Add_Action (Table.States (61), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37, 38,
+ 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 77, 81, 83, 84,
86, 90, 105, 116, 117, 118, 119), (384, 3),
+ 1);
+ Table.States (61).Kernel := To_Vector ((0 => ((384, 3), 261, 0,
(384, 3), 1)));
+ Table.States (61).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (384, 3), 1)));
+ Table.States (62).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (62), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61, 63,
64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (261, 1), 1);
+ Table.States (62).Kernel := To_Vector ((0 => ((261, 1), 262, 0,
(261, 1), 1)));
+ Table.States (62).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (261, 1), 1)));
+ Table.States (63).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (63), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61, 63,
64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (261, 3), 1);
+ Table.States (63).Kernel := To_Vector ((0 => ((261, 3), 263, 0,
(261, 3), 1)));
+ Table.States (63).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (261, 3), 1)));
+ Table.States (64).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (64), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61, 63,
64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (262, 0), 1);
+ Table.States (64).Kernel := To_Vector ((0 => ((262, 0), 264, 0,
(262, 0), 1)));
+ Table.States (64).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (262, 0), 1)));
+ Table.States (65).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (65), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61, 63,
64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (462, 0), 1);
+ Table.States (65).Kernel := To_Vector ((0 => ((462, 0), 265, 0,
(462, 0), 1)));
+ Table.States (65).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (462, 0), 1)));
+ Table.States (66).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (66), 93, (285, 0), 291);
+ Table.States (66).Kernel := To_Vector ((0 => ((285, 0), 266, 1,
(32767, 0), 0)));
+ Table.States (66).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (285, 0), 93, 291)));
+ Table.States (67).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (67), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61, 63,
64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (262, 1), 1);
+ Table.States (67).Kernel := To_Vector ((0 => ((262, 1), 267, 0,
(262, 1), 1)));
+ Table.States (67).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (262, 1), 1)));
+ Table.States (68).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (68), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71, 72,
+ 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99, 100,
101, 103, 104, 106, 107, 108, 109, 110,
+ 111, 112, 113, 114), (195, 8), 1);
+ Table.States (68).Kernel := To_Vector ((0 => ((195, 8), 268, 0,
(195, 8), 1)));
+ Table.States (68).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 8), 1)));
+ Table.States (69).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (69), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61, 63,
64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (263, 0), 1);
+ Table.States (69).Kernel := To_Vector ((0 => ((263, 0), 271, 0,
(263, 0), 1)));
+ Table.States (69).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (263, 0), 1)));
+ Table.States (70).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (70), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61, 63,
64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (263, 1), 1);
+ Table.States (70).Kernel := To_Vector ((0 => ((263, 1), 273, 0,
(263, 1), 1)));
+ Table.States (70).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (263, 1), 1)));
+ Table.States (71).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (71), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61, 63,
64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (263, 2), 1);
+ Table.States (71).Kernel := To_Vector ((0 => ((263, 2), 275, 0,
(263, 2), 1)));
+ Table.States (71).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (263, 2), 1)));
+ Table.States (72).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (72), 35, (276, 0), 16);
+ Add_Action (Table.States (72), 36, (275, 1), 292);
+ Add_Action (Table.States (72), 37, (276, 3), 293);
+ Add_Action (Table.States (72), 38, (286, 1), 294);
+ Add_Action (Table.States (72), 39, (286, 0), 295);
+ Add_Action (Table.States (72), 51, (276, 1), 296);
+ Table.States (72).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (72), 276, 297);
+ Table.States (72).Kernel := To_Vector ((((275, 0), 285, 8,
(32767, 0), 0), ((275, 1), 285, 6, (32767,
+ 0), 0), ((286, 0), 285, 6, (32767, 0), 0), ((286, 1), 285,
5, (32767, 0), 0)));
+ Table.States (72).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (286, 1), 38, 294)));
+ Table.States (73).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (73), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61, 63,
64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (263, 3), 1);
+ Table.States (73).Kernel := To_Vector ((0 => ((263, 3), 286, 0,
(263, 3), 1)));
+ Table.States (73).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (263, 3), 1)));
+ Table.States (74).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (74), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61, 63,
64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (263, 5), 1);
+ Table.States (74).Kernel := To_Vector ((0 => ((263, 5), 288, 0,
(263, 5), 1)));
+ Table.States (74).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (263, 5), 1)));
+ Table.States (75).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (75), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61, 63,
64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (262, 2), 1);
+ Table.States (75).Kernel := To_Vector ((0 => ((262, 2), 289, 0,
(262, 2), 1)));
+ Table.States (75).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (262, 2), 1)));
+ Table.States (76).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (76), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61, 63,
64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (262, 3), 1);
+ Table.States (76).Kernel := To_Vector ((0 => ((262, 3), 290, 0,
(262, 3), 1)));
+ Table.States (76).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (262, 3), 1)));
+ Table.States (77).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (77), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37, 38,
+ 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (126,
+ 4), 1);
+ Table.States (77).Kernel := To_Vector ((0 => ((126, 4), 291, 0,
(126, 4), 1)));
+ Table.States (77).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (126, 4), 1)));
+ Table.States (78).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (78), 24, (338, 2), 298);
+ Add_Action (Table.States (78), 61, (434, 0), 299);
+ Add_Action (Table.States (78), 82, (180, 2), 300);
+ Add_Action (Table.States (78), 108, (291, 3), 301);
+ Table.States (78).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (78), 434, 302);
+ Table.States (78).Kernel := To_Vector ((((180, 2), 292, 5,
(32767, 0), 0), ((180, 3), 292, 3, (32767,
+ 0), 0), ((291, 2), 292, 3, (32767, 0), 0), ((291, 3), 292,
1, (32767, 0), 0), ((309, 2), 292, 8,
+ (32767, 0), 0), ((309, 3), 292, 6, (32767, 0), 0), ((338, 2),
292, 5, (32767, 0), 0), ((338, 3),
+ 292, 3, (32767, 0), 0), ((389, 2), 292, 5, (32767, 0), 0),
((389, 3), 292, 3, (32767, 0), 0)));
+ Table.States (78).Minimal_Complete_Actions := To_Vector (((Shift,
(180, 2), 82, 300), (Shift, (338, 2),
+ 24, 298)));
+ Table.States (79).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (79), 24, Reduce, (292, 0), 1);
+ Add_Action (Table.States (79), 61, Reduce, (292, 0), 1);
+ Add_Action (Table.States (79), 82, (320, 2), 303);
+ Add_Conflict (Table.States (79), 82, (292, 0), 1);
+ Add_Action (Table.States (79), 108, Reduce, (292, 0), 1);
+ Table.States (79).Kernel := To_Vector ((((292, 0), 293, 0, (292,
0), 1), ((320, 2), 293, 5, (32767,
+ 0), 0), ((320, 3), 293, 3, (32767, 0), 0)));
+ Table.States (79).Minimal_Complete_Actions := To_Vector (((Reduce,
(292, 0), 1), (Shift, (320, 2), 82,
+ 303)));
+ Table.States (80).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (80), 24, Reduce, (292, 1), 1);
+ Add_Action (Table.States (80), 61, Reduce, (292, 1), 1);
+ Add_Action (Table.States (80), 82, (321, 2), 304);
+ Add_Conflict (Table.States (80), 82, (292, 1), 1);
+ Add_Action (Table.States (80), 108, Reduce, (292, 1), 1);
+ Table.States (80).Kernel := To_Vector ((((292, 1), 294, 0, (292,
1), 1), ((321, 2), 294, 6, (32767,
+ 0), 0), ((321, 3), 294, 4, (32767, 0), 0)));
+ Table.States (80).Minimal_Complete_Actions := To_Vector (((Reduce,
(292, 1), 1), (Shift, (321, 2), 82,
+ 304)));
+ end Subr_3;
+ procedure Subr_4
+ is begin
+ Table.States (81).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (81), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37, 38,
+ 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (194,
+ 0), 1);
+ Table.States (81).Kernel := To_Vector ((0 => ((194, 0), 309, 0,
(194, 0), 1)));
+ Table.States (81).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (194, 0), 1)));
+ Table.States (82).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (82), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61, 63,
64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (262, 4), 1);
+ Table.States (82).Kernel := To_Vector ((0 => ((262, 4), 310, 0,
(262, 4), 1)));
+ Table.States (82).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (262, 4), 1)));
+ Table.States (83).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (83), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71, 72,
+ 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99, 100,
101, 103, 104, 106, 107, 108, 109, 110,
+ 111, 112, 113, 114), (195, 5), 1);
+ Table.States (83).Kernel := To_Vector ((0 => ((195, 5), 311, 0,
(195, 5), 1)));
+ Table.States (83).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 5), 1)));
+ Table.States (84).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (84), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61, 63,
64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (262, 5), 1);
+ Table.States (84).Kernel := To_Vector ((0 => ((262, 5), 316, 0,
(262, 5), 1)));
+ Table.States (84).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (262, 5), 1)));
+ Table.States (85).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (85), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61, 63,
64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (263, 4), 1);
+ Table.States (85).Kernel := To_Vector ((0 => ((263, 4), 318, 0,
(263, 4), 1)));
+ Table.States (85).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (263, 4), 1)));
+ Table.States (86).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (86), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37, 38,
+ 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (126,
+ 6), 1);
+ Table.States (86).Kernel := To_Vector ((0 => ((126, 6), 320, 0,
(126, 6), 1)));
+ Table.States (86).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (126, 6), 1)));
+ Table.States (87).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (87), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37, 38,
+ 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (126,
+ 7), 1);
+ Table.States (87).Kernel := To_Vector ((0 => ((126, 7), 321, 0,
(126, 7), 1)));
+ Table.States (87).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (126, 7), 1)));
+ Table.States (88).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (88), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37, 38,
+ 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (126,
+ 8), 1);
+ Table.States (88).Kernel := To_Vector ((0 => ((126, 8), 322, 0,
(126, 8), 1)));
+ Table.States (88).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (126, 8), 1)));
+ Table.States (89).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (89), 108, (322, 0), 305);
+ Table.States (89).Kernel := To_Vector ((0 => ((322, 0), 325, 1,
(32767, 0), 0)));
+ Table.States (89).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (322, 0), 108, 305)));
+ Table.States (90).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (90), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37, 38,
+ 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (194,
+ 1), 1);
+ Table.States (90).Kernel := To_Vector ((0 => ((194, 1), 326, 0,
(194, 1), 1)));
+ Table.States (90).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (194, 1), 1)));
+ Table.States (91).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (91), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37, 38,
+ 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (127,
+ 2), 1);
+ Table.States (91).Kernel := To_Vector ((0 => ((127, 2), 327, 0,
(127, 2), 1)));
+ Table.States (91).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (127, 2), 1)));
+ Table.States (92).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (92), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37, 38,
+ 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (127,
+ 3), 1);
+ Table.States (92).Kernel := To_Vector ((0 => ((127, 3), 328, 0,
(127, 3), 1)));
+ Table.States (92).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (127, 3), 1)));
+ Table.States (93).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (93), 21, (356, 0), 306);
+ Add_Action (Table.States (93), 53, (294, 0), 307);
+ Add_Action (Table.States (93), 54, (293, 0), 308);
+ Table.States (93).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (93), 292, 309);
+ Add_Goto (Table.States (93), 293, 310);
+ Add_Goto (Table.States (93), 294, 311);
+ Table.States (93).Kernel := To_Vector ((((180, 0), 329, 7,
(32767, 0), 0), ((180, 1), 329, 5, (32767,
+ 0), 0), ((291, 0), 329, 5, (32767, 0), 0), ((291, 1), 329,
3, (32767, 0), 0), ((309, 0), 329, 10,
+ (32767, 0), 0), ((309, 1), 329, 8, (32767, 0), 0), ((320, 0),
329, 7, (32767, 0), 0), ((320, 1),
+ 329, 5, (32767, 0), 0), ((321, 0), 329, 10, (32767, 0), 0),
((321, 1), 329, 8, (32767, 0), 0),
+ ((338, 0), 329, 7, (32767, 0), 0), ((338, 1), 329, 5, (32767,
0), 0), ((356, 0), 329, 8, (32767,
+ 0), 0), ((356, 1), 329, 6, (32767, 0), 0), ((356, 2), 329,
5, (32767, 0), 0), ((356, 3), 329, 3,
+ (32767, 0), 0), ((389, 0), 329, 7, (32767, 0), 0), ((389, 1),
329, 5, (32767, 0), 0), ((408, 2),
+ 329, 8, (32767, 0), 0), ((408, 3), 329, 6, (32767, 0), 0),
((408, 6), 329, 8, (32767, 0), 0),
+ ((408, 7), 329, 6, (32767, 0), 0)));
+ Table.States (93).Minimal_Complete_Actions := To_Vector (((Shift,
(293, 0), 54, 308), (Shift, (356, 0),
+ 21, 306)));
+ Table.States (94).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (94), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37, 38,
+ 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (193,
+ 2), 1);
+ Table.States (94).Kernel := To_Vector ((0 => ((193, 2), 330, 0,
(193, 2), 1)));
+ Table.States (94).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (193, 2), 1)));
+ Table.States (95).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (95), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37, 38,
+ 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (330,
+ 0), 1);
+ Table.States (95).Kernel := To_Vector ((0 => ((330, 0), 332, 0,
(330, 0), 1)));
+ Table.States (95).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (330, 0), 1)));
+ Table.States (96).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (96), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37, 38,
+ 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (330,
+ 1), 1);
+ Table.States (96).Kernel := To_Vector ((0 => ((330, 1), 333, 0,
(330, 1), 1)));
+ Table.States (96).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (330, 1), 1)));
+ Table.States (97).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (97), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37, 38,
+ 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (126,
+ 9), 1);
+ Table.States (97).Kernel := To_Vector ((0 => ((126, 9), 334, 0,
(126, 9), 1)));
+ Table.States (97).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (126, 9), 1)));
+ Table.States (98).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (98), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37, 38,
+ 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (334,
+ 0), 1);
+ Table.States (98).Kernel := To_Vector ((0 => ((334, 0), 335, 0,
(334, 0), 1)));
+ Table.States (98).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (334, 0), 1)));
+ Table.States (99).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (99), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37, 38,
+ 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (334,
+ 1), 1);
+ Table.States (99).Kernel := To_Vector ((0 => ((334, 1), 336, 0,
(334, 1), 1)));
+ Table.States (99).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (334, 1), 1)));
+ Table.States (100).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (100), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (334, 2), 1);
+ Table.States (100).Kernel := To_Vector ((0 => ((334, 2), 337, 0,
(334, 2), 1)));
+ Table.States (100).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (334, 2), 1)));
+ Table.States (101).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (101), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (334, 3), 1);
+ Table.States (101).Kernel := To_Vector ((0 => ((334, 3), 338, 0,
(334, 3), 1)));
+ Table.States (101).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (334, 3), 1)));
+ Table.States (102).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (102), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (334, 4), 1);
+ Table.States (102).Kernel := To_Vector ((0 => ((334, 4), 339, 0,
(334, 4), 1)));
+ Table.States (102).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (334, 4), 1)));
+ Table.States (103).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (103), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (128, 4), 1);
+ Table.States (103).Kernel := To_Vector ((0 => ((128, 4), 340, 0,
(128, 4), 1)));
+ Table.States (103).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (128, 4), 1)));
+ Table.States (104).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (104), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 48), 1);
+ Table.States (104).Kernel := To_Vector ((0 => ((135, 48), 341,
0, (135, 48), 1)));
+ Table.States (104).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 48), 1)));
+ Table.States (105).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (105), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (194, 2), 1);
+ Table.States (105).Kernel := To_Vector ((0 => ((194, 2), 345, 0,
(194, 2), 1)));
+ Table.States (105).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (194, 2), 1)));
+ Table.States (106).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (106), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (128, 5), 1);
+ Table.States (106).Kernel := To_Vector ((0 => ((128, 5), 346, 0,
(128, 5), 1)));
+ Table.States (106).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (128, 5), 1)));
+ Table.States (107).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (107), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 49), 1);
+ Table.States (107).Kernel := To_Vector ((0 => ((135, 49), 347,
0, (135, 49), 1)));
+ Table.States (107).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 49), 1)));
+ Table.States (108).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (108), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (194, 3), 1);
+ Table.States (108).Kernel := To_Vector ((0 => ((194, 3), 354, 0,
(194, 3), 1)));
+ Table.States (108).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (194, 3), 1)));
+ Table.States (109).Action_List.Set_Capacity (42);
+ Add_Action (Table.States (109), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (384,
+ 5), 1);
+ Table.States (109).Kernel := To_Vector ((0 => ((384, 5), 356, 0,
(384, 5), 1)));
+ Table.States (109).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (384, 5), 1)));
+ Table.States (110).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (110), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (263, 6), 1);
+ Table.States (110).Kernel := To_Vector ((0 => ((263, 6), 357, 0,
(263, 6), 1)));
+ Table.States (110).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (263, 6), 1)));
+ Table.States (111).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (111), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (262, 6), 1);
+ Table.States (111).Kernel := To_Vector ((0 => ((262, 6), 363, 0,
(262, 6), 1)));
+ Table.States (111).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (262, 6), 1)));
+ Table.States (112).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (112), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (262, 7), 1);
+ Table.States (112).Kernel := To_Vector ((0 => ((262, 7), 364, 0,
(262, 7), 1)));
+ Table.States (112).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (262, 7), 1)));
+ Table.States (113).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (113), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (364, 0), 1);
+ Table.States (113).Kernel := To_Vector ((0 => ((364, 0), 365, 0,
(364, 0), 1)));
+ Table.States (113).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (364, 0), 1)));
+ Table.States (114).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (114), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (364, 1), 1);
+ Table.States (114).Kernel := To_Vector ((0 => ((364, 1), 366, 0,
(364, 1), 1)));
+ Table.States (114).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (364, 1), 1)));
+ Table.States (115).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (115), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (263, 7), 1);
+ Table.States (115).Kernel := To_Vector ((0 => ((263, 7), 367, 0,
(263, 7), 1)));
+ Table.States (115).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (263, 7), 1)));
+ Table.States (116).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (116), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (367, 0), 1);
+ Table.States (116).Kernel := To_Vector ((0 => ((367, 0), 370, 0,
(367, 0), 1)));
+ Table.States (116).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (367, 0), 1)));
+ Table.States (117).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (117), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (367, 1), 1);
+ Table.States (117).Kernel := To_Vector ((0 => ((367, 1), 376, 0,
(367, 1), 1)));
+ Table.States (117).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (367, 1), 1)));
+ Table.States (118).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (118), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (367, 2), 1);
+ Table.States (118).Kernel := To_Vector ((0 => ((367, 2), 378, 0,
(367, 2), 1)));
+ Table.States (118).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (367, 2), 1)));
+ Table.States (119).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (119), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (367, 3), 1);
+ Table.States (119).Kernel := To_Vector ((0 => ((367, 3), 379, 0,
(367, 3), 1)));
+ Table.States (119).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (367, 3), 1)));
+ Table.States (120).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (120), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (262, 8), 1);
+ Table.States (120).Kernel := To_Vector ((0 => ((262, 8), 382, 0,
(262, 8), 1)));
+ Table.States (120).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (262, 8), 1)));
+ Table.States (121).Action_List.Set_Capacity (42);
+ Add_Action (Table.States (121), 12, (401, 0), 1);
+ Add_Action (Table.States (121), 13, (393, 0), 2);
+ Add_Action (Table.States (121), 15, (370, 0), 3);
+ Add_Action (Table.States (121), 17, (365, 0), 4);
+ Add_Action (Table.States (121), 18, (382, 0), 5);
+ Add_Action (Table.States (121), 19, (363, 0), 6);
+ Add_Action (Table.States (121), 20, (357, 0), 7);
+ Add_Action (Table.States (121), 21, (356, 4), 8);
+ Add_Action (Table.States (121), 22, (339, 0), 9);
+ Add_Action (Table.States (121), 25, (329, 1), 10);
+ Add_Action (Table.States (121), 27, (384, 1), 11);
+ Add_Action (Table.States (121), 28, (325, 0), 12);
+ Add_Action (Table.States (121), 30, (316, 0), 13);
+ Add_Action (Table.States (121), 31, (290, 0), 14);
+ Add_Action (Table.States (121), 32, (289, 0), 15);
+ Add_Action (Table.States (121), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (121), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (121), 37, (288, 0), 17);
+ Add_Conflict (Table.States (121), 37, (285, 1), 0);
+ Add_Action (Table.States (121), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (121), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (121), 42, (271, 0), 18);
+ Add_Action (Table.States (121), 50, (332, 0), 19);
+ Add_Action (Table.States (121), 51, (437, 0), 20);
+ Add_Conflict (Table.States (121), 51, (285, 1), 0);
+ Add_Action (Table.States (121), 52, (329, 0), 21);
+ Add_Action (Table.States (121), 53, (294, 0), 22);
+ Add_Action (Table.States (121), 54, (293, 0), 23);
+ Add_Action (Table.States (121), 59, (346, 0), 24);
+ Add_Action (Table.States (121), 60, (340, 0), 25);
+ Add_Action (Table.States (121), 61, (387, 1), 26);
+ Add_Action (Table.States (121), 64, (273, 0), 27);
+ Add_Action (Table.States (121), 65, (264, 0), 28);
+ Add_Action (Table.States (121), 77, (386, 0), 29);
+ Add_Action (Table.States (121), 81, (130, 0), 30);
+ Add_Action (Table.States (121), 83, (128, 0), 31);
+ Add_Action (Table.States (121), 84, (124, 0), 32);
+ Add_Action (Table.States (121), 86, (252, 0), 33);
+ Add_Action (Table.States (121), 90, (268, 0), 34);
+ Add_Action (Table.States (121), 105, (265, 0), 35);
+ Add_Action (Table.States (121), 116, (136, 0), 36);
+ Add_Action (Table.States (121), 117, (196, 1), 37);
+ Add_Action (Table.States (121), 118, (195, 6), 38);
+ Add_Action (Table.States (121), 119, Accept_It, (120, 0), 1);
+ Table.States (121).Goto_List.Set_Capacity (105);
+ Add_Goto (Table.States (121), 124, 39);
+ Add_Goto (Table.States (121), 126, 40);
+ Add_Goto (Table.States (121), 127, 41);
+ Add_Goto (Table.States (121), 128, 42);
+ Add_Goto (Table.States (121), 130, 43);
+ Add_Goto (Table.States (121), 135, 44);
+ Add_Goto (Table.States (121), 136, 45);
+ Add_Goto (Table.States (121), 137, 46);
+ Add_Goto (Table.States (121), 180, 47);
+ Add_Goto (Table.States (121), 189, 48);
+ Add_Goto (Table.States (121), 190, 49);
+ Add_Goto (Table.States (121), 193, 50);
+ Add_Goto (Table.States (121), 194, 51);
+ Add_Goto (Table.States (121), 195, 52);
+ Add_Goto (Table.States (121), 196, 53);
+ Add_Goto (Table.States (121), 197, 54);
+ Add_Goto (Table.States (121), 198, 55);
+ Add_Goto (Table.States (121), 199, 56);
+ Add_Goto (Table.States (121), 201, 57);
+ Add_Goto (Table.States (121), 251, 58);
+ Add_Goto (Table.States (121), 252, 59);
+ Add_Goto (Table.States (121), 255, 60);
+ Add_Goto (Table.States (121), 261, 61);
+ Add_Goto (Table.States (121), 262, 62);
+ Add_Goto (Table.States (121), 263, 63);
+ Add_Goto (Table.States (121), 264, 64);
+ Add_Goto (Table.States (121), 265, 65);
+ Add_Goto (Table.States (121), 266, 66);
+ Add_Goto (Table.States (121), 267, 67);
+ Add_Goto (Table.States (121), 268, 68);
+ Add_Goto (Table.States (121), 271, 69);
+ Add_Goto (Table.States (121), 273, 70);
+ Add_Goto (Table.States (121), 275, 71);
+ Add_Goto (Table.States (121), 285, 72);
+ Add_Goto (Table.States (121), 286, 73);
+ Add_Goto (Table.States (121), 288, 74);
+ Add_Goto (Table.States (121), 289, 75);
+ Add_Goto (Table.States (121), 290, 76);
+ Add_Goto (Table.States (121), 291, 77);
+ Add_Goto (Table.States (121), 292, 78);
+ Add_Goto (Table.States (121), 293, 79);
+ Add_Goto (Table.States (121), 294, 80);
+ Add_Goto (Table.States (121), 309, 81);
+ Add_Goto (Table.States (121), 310, 82);
+ Add_Goto (Table.States (121), 311, 83);
+ Add_Goto (Table.States (121), 316, 84);
+ Add_Goto (Table.States (121), 318, 85);
+ Add_Goto (Table.States (121), 320, 86);
+ Add_Goto (Table.States (121), 321, 87);
+ Add_Goto (Table.States (121), 322, 88);
+ Add_Goto (Table.States (121), 325, 89);
+ Add_Goto (Table.States (121), 326, 90);
+ Add_Goto (Table.States (121), 327, 91);
+ Add_Goto (Table.States (121), 328, 92);
+ Add_Goto (Table.States (121), 329, 93);
+ Add_Goto (Table.States (121), 330, 94);
+ Add_Goto (Table.States (121), 332, 95);
+ Add_Goto (Table.States (121), 333, 96);
+ Add_Goto (Table.States (121), 334, 97);
+ Add_Goto (Table.States (121), 335, 98);
+ Add_Goto (Table.States (121), 336, 99);
+ Add_Goto (Table.States (121), 337, 100);
+ Add_Goto (Table.States (121), 338, 101);
+ Add_Goto (Table.States (121), 339, 102);
+ Add_Goto (Table.States (121), 340, 103);
+ Add_Goto (Table.States (121), 341, 104);
+ Add_Goto (Table.States (121), 345, 105);
+ Add_Goto (Table.States (121), 346, 106);
+ Add_Goto (Table.States (121), 347, 107);
+ Add_Goto (Table.States (121), 354, 108);
+ Add_Goto (Table.States (121), 356, 109);
+ Add_Goto (Table.States (121), 357, 110);
+ Add_Goto (Table.States (121), 363, 111);
+ Add_Goto (Table.States (121), 364, 112);
+ Add_Goto (Table.States (121), 365, 113);
+ Add_Goto (Table.States (121), 366, 114);
+ Add_Goto (Table.States (121), 367, 115);
+ Add_Goto (Table.States (121), 370, 116);
+ Add_Goto (Table.States (121), 376, 117);
+ Add_Goto (Table.States (121), 378, 118);
+ Add_Goto (Table.States (121), 379, 119);
+ Add_Goto (Table.States (121), 382, 120);
+ Add_Goto (Table.States (121), 384, 312);
+ Add_Goto (Table.States (121), 385, 123);
+ Add_Goto (Table.States (121), 386, 124);
+ Add_Goto (Table.States (121), 387, 125);
+ Add_Goto (Table.States (121), 388, 126);
+ Add_Goto (Table.States (121), 389, 127);
+ Add_Goto (Table.States (121), 390, 128);
+ Add_Goto (Table.States (121), 391, 129);
+ Add_Goto (Table.States (121), 392, 130);
+ Add_Goto (Table.States (121), 393, 131);
+ Add_Goto (Table.States (121), 394, 132);
+ Add_Goto (Table.States (121), 401, 133);
+ Add_Goto (Table.States (121), 403, 134);
+ Add_Goto (Table.States (121), 404, 135);
+ Add_Goto (Table.States (121), 405, 136);
+ Add_Goto (Table.States (121), 406, 137);
+ Add_Goto (Table.States (121), 408, 138);
+ Add_Goto (Table.States (121), 431, 139);
+ Add_Goto (Table.States (121), 437, 140);
+ Add_Goto (Table.States (121), 438, 141);
+ Add_Goto (Table.States (121), 440, 142);
+ Add_Goto (Table.States (121), 454, 143);
+ Add_Goto (Table.States (121), 462, 144);
+ Table.States (122).Action_List.Set_Capacity (42);
+ Add_Action (Table.States (122), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (383,
+ 0), 1);
+ Table.States (122).Kernel := To_Vector ((0 => ((383, 0), 384, 0,
(383, 0), 1)));
+ Table.States (122).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (383, 0), 1)));
+ Table.States (123).Action_List.Set_Capacity (42);
+ Add_Action (Table.States (123), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (384,
+ 0), 1);
+ Table.States (123).Kernel := To_Vector ((0 => ((384, 0), 385, 0,
(384, 0), 1)));
+ Table.States (123).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (384, 0), 1)));
+ end Subr_4;
+ procedure Subr_5
+ is begin
+ Table.States (124).Action_List.Set_Capacity (42);
+ Add_Action (Table.States (124), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (385,
+ 0), 1);
+ Table.States (124).Kernel := To_Vector ((0 => ((385, 0), 386, 0,
(385, 0), 1)));
+ Table.States (124).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (385, 0), 1)));
+ Table.States (125).Action_List.Set_Capacity (42);
+ Add_Action (Table.States (125), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (385,
+ 1), 1);
+ Table.States (125).Kernel := To_Vector ((0 => ((385, 1), 387, 0,
(385, 1), 1)));
+ Table.States (125).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (385, 1), 1)));
+ Table.States (126).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (126), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (190, 2), 1);
+ Table.States (126).Kernel := To_Vector ((0 => ((190, 2), 388, 0,
(190, 2), 1)));
+ Table.States (126).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (190, 2), 1)));
+ Table.States (127).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (127), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (388, 0), 1);
+ Table.States (127).Kernel := To_Vector ((0 => ((388, 0), 389, 0,
(388, 0), 1)));
+ Table.States (127).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (388, 0), 1)));
+ Table.States (128).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (128), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (388, 1), 1);
+ Table.States (128).Kernel := To_Vector ((0 => ((388, 1), 390, 0,
(388, 1), 1)));
+ Table.States (128).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (388, 1), 1)));
+ Table.States (129).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (129), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (388, 2), 1);
+ Table.States (129).Kernel := To_Vector ((0 => ((388, 2), 391, 0,
(388, 2), 1)));
+ Table.States (129).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (388, 2), 1)));
+ Table.States (130).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (130), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (388, 3), 1);
+ Table.States (130).Kernel := To_Vector ((0 => ((388, 3), 392, 0,
(388, 3), 1)));
+ Table.States (130).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (388, 3), 1)));
+ Table.States (131).Action_List.Set_Capacity (42);
+ Add_Action (Table.States (131), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (384,
+ 4), 1);
+ Table.States (131).Kernel := To_Vector ((0 => ((384, 4), 393, 0,
(384, 4), 1)));
+ Table.States (131).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (384, 4), 1)));
+ Table.States (132).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (132), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (126, 10), 1);
+ Table.States (132).Kernel := To_Vector ((0 => ((126, 10), 394,
0, (126, 10), 1)));
+ Table.States (132).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (126, 10), 1)));
+ Table.States (133).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (133), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (262, 9), 1);
+ Table.States (133).Kernel := To_Vector ((0 => ((262, 9), 401, 0,
(262, 9), 1)));
+ Table.States (133).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (262, 9), 1)));
+ Table.States (134).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (134), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (126, 11), 1);
+ Table.States (134).Kernel := To_Vector ((0 => ((126, 11), 403,
0, (126, 11), 1)));
+ Table.States (134).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (126, 11), 1)));
+ Table.States (135).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (135), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (403, 0), 1);
+ Table.States (135).Kernel := To_Vector ((0 => ((403, 0), 404, 0,
(403, 0), 1)));
+ Table.States (135).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (403, 0), 1)));
+ Table.States (136).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (136), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (403, 1), 1);
+ Table.States (136).Kernel := To_Vector ((0 => ((403, 1), 405, 0,
(403, 1), 1)));
+ Table.States (136).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (403, 1), 1)));
+ Table.States (137).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (137), 28, (325, 0), 313);
+ Add_Action (Table.States (137), 53, (294, 0), 314);
+ Add_Action (Table.States (137), 54, (293, 0), 315);
+ Table.States (137).Goto_List.Set_Capacity (4);
+ Add_Goto (Table.States (137), 292, 316);
+ Add_Goto (Table.States (137), 293, 317);
+ Add_Goto (Table.States (137), 294, 318);
+ Add_Goto (Table.States (137), 325, 319);
+ Table.States (137).Kernel := To_Vector ((((404, 0), 406, 5,
(32767, 0), 0), ((404, 1), 406, 3, (32767,
+ 0), 0), ((405, 0), 406, 5, (32767, 0), 0)));
+ Table.States (137).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (293, 0), 54, 315)));
+ Table.States (138).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (138), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (126, 12), 1);
+ Table.States (138).Kernel := To_Vector ((0 => ((126, 12), 408,
0, (126, 12), 1)));
+ Table.States (138).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (126, 12), 1)));
+ Table.States (139).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (139), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (193, 1), 1);
+ Table.States (139).Kernel := To_Vector ((0 => ((193, 1), 431, 0,
(193, 1), 1)));
+ Table.States (139).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (193, 1), 1)));
+ Table.States (140).Action_List.Set_Capacity (44);
+ Add_Action (Table.States (140), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 63, 64, 65, 66, 77,
81, 83, 84, 86, 90, 105, 116, 117, 118,
+ 119), (431, 0), 1);
+ Table.States (140).Kernel := To_Vector ((0 => ((431, 0), 437, 0,
(431, 0), 1)));
+ Table.States (140).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (431, 0), 1)));
+ Table.States (141).Action_List.Set_Capacity (44);
+ Add_Action (Table.States (141), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 63, 64, 65, 66, 77,
81, 83, 84, 86, 90, 105, 116, 117, 118,
+ 119), (431, 1), 1);
+ Table.States (141).Kernel := To_Vector ((0 => ((431, 1), 438, 0,
(431, 1), 1)));
+ Table.States (141).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (431, 1), 1)));
+ Table.States (142).Action_List.Set_Capacity (44);
+ Add_Action (Table.States (142), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 63, 64, 65, 66, 77,
81, 83, 84, 86, 90, 105, 116, 117, 118,
+ 119), (431, 2), 1);
+ Table.States (142).Kernel := To_Vector ((0 => ((431, 2), 440, 0,
(431, 2), 1)));
+ Table.States (142).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (431, 2), 1)));
+ Table.States (143).Action_List.Set_Capacity (44);
+ Add_Action (Table.States (143), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 63, 64, 65, 66, 77,
81, 83, 84, 86, 90, 105, 116, 117, 118,
+ 119), (431, 3), 1);
+ Table.States (143).Kernel := To_Vector ((0 => ((431, 3), 454, 0,
(431, 3), 1)));
+ Table.States (143).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (431, 3), 1)));
+ Table.States (144).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (144), 12, (401, 0), 1);
+ Add_Action (Table.States (144), 15, (370, 0), 3);
+ Add_Action (Table.States (144), 17, (365, 0), 4);
+ Add_Action (Table.States (144), 18, (382, 0), 5);
+ Add_Action (Table.States (144), 19, (363, 0), 6);
+ Add_Action (Table.States (144), 20, (357, 0), 7);
+ Add_Action (Table.States (144), 30, (316, 0), 13);
+ Add_Action (Table.States (144), 31, (290, 0), 14);
+ Add_Action (Table.States (144), 32, (289, 0), 15);
+ Add_Action (Table.States (144), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (144), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (144), 37, (288, 0), 17);
+ Add_Conflict (Table.States (144), 37, (285, 1), 0);
+ Add_Action (Table.States (144), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (144), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (144), 42, (271, 0), 18);
+ Add_Action (Table.States (144), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (144), 64, (273, 0), 27);
+ Add_Action (Table.States (144), 65, (264, 0), 28);
+ Add_Action (Table.States (144), 84, (124, 0), 32);
+ Add_Action (Table.States (144), 86, (252, 0), 33);
+ Add_Action (Table.States (144), 90, (268, 0), 34);
+ Add_Action (Table.States (144), 105, (265, 0), 35);
+ Add_Action (Table.States (144), 116, (196, 0), 146);
+ Add_Action (Table.States (144), 117, (196, 1), 37);
+ Add_Action (Table.States (144), 118, (195, 6), 38);
+ Table.States (144).Goto_List.Set_Capacity (42);
+ Add_Goto (Table.States (144), 124, 39);
+ Add_Goto (Table.States (144), 195, 52);
+ Add_Goto (Table.States (144), 196, 53);
+ Add_Goto (Table.States (144), 197, 54);
+ Add_Goto (Table.States (144), 198, 55);
+ Add_Goto (Table.States (144), 199, 56);
+ Add_Goto (Table.States (144), 201, 57);
+ Add_Goto (Table.States (144), 251, 58);
+ Add_Goto (Table.States (144), 252, 59);
+ Add_Goto (Table.States (144), 255, 60);
+ Add_Goto (Table.States (144), 262, 320);
+ Add_Goto (Table.States (144), 263, 321);
+ Add_Goto (Table.States (144), 264, 64);
+ Add_Goto (Table.States (144), 265, 322);
+ Add_Goto (Table.States (144), 266, 66);
+ Add_Goto (Table.States (144), 267, 67);
+ Add_Goto (Table.States (144), 268, 68);
+ Add_Goto (Table.States (144), 271, 69);
+ Add_Goto (Table.States (144), 273, 70);
+ Add_Goto (Table.States (144), 275, 71);
+ Add_Goto (Table.States (144), 285, 72);
+ Add_Goto (Table.States (144), 286, 73);
+ Add_Goto (Table.States (144), 288, 74);
+ Add_Goto (Table.States (144), 289, 75);
+ Add_Goto (Table.States (144), 290, 76);
+ Add_Goto (Table.States (144), 310, 82);
+ Add_Goto (Table.States (144), 311, 83);
+ Add_Goto (Table.States (144), 316, 84);
+ Add_Goto (Table.States (144), 318, 85);
+ Add_Goto (Table.States (144), 357, 110);
+ Add_Goto (Table.States (144), 363, 111);
+ Add_Goto (Table.States (144), 364, 112);
+ Add_Goto (Table.States (144), 365, 113);
+ Add_Goto (Table.States (144), 366, 114);
+ Add_Goto (Table.States (144), 367, 115);
+ Add_Goto (Table.States (144), 370, 116);
+ Add_Goto (Table.States (144), 376, 117);
+ Add_Goto (Table.States (144), 378, 118);
+ Add_Goto (Table.States (144), 379, 119);
+ Add_Goto (Table.States (144), 382, 120);
+ Add_Goto (Table.States (144), 401, 133);
+ Add_Goto (Table.States (144), 462, 323);
+ Table.States (144).Kernel := To_Vector ((((261, 0), 462, 2,
(32767, 0), 0), ((261, 2), 462, 3, (32767,
+ 0), 0), ((462, 1), 462, 3, (32767, 0), 0), ((462, 2), 462,
3, (32767, 0), 0)));
+ Table.States (144).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ Table.States (145).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (145), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (401, 0), 2);
+ Table.States (145).Kernel := To_Vector ((0 => ((401, 0), 108, 0,
(401, 0), 2)));
+ Table.States (145).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (401, 0), 2)));
+ Table.States (146).Action_List.Set_Capacity (49);
+ Add_Action (Table.States (146), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 93, 94, 95, 96, 97, 98,
99, 100, 101, 102, 103, 104, 106, 107, 108,
+ 109, 110, 111, 112, 113, 114), (196, 0), 1);
+ Table.States (146).Kernel := To_Vector ((0 => ((196, 0), 116, 0,
(196, 0), 1)));
+ Table.States (146).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (196, 0), 1)));
+ Table.States (147).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (147), 61, (401, 1), 324);
+ Add_Action (Table.States (147), 85, (198, 0), 281);
+ Add_Action (Table.States (147), 96, (197, 0), 283);
+ Add_Action (Table.States (147), 108, (401, 2), 325);
+ Add_Action (Table.States (147), 113, (121, 0), 285);
+ Add_Action (Table.States (147), 114, (121, 1), 286);
+ Table.States (147).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (147), 121, 287);
+ Add_Goto (Table.States (147), 313, 289);
+ Table.States (147).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0), ((401, 1),
195, 3, (32767, 0), 0), ((401, 2),
+ 195, 1, (32767, 0), 0)));
+ Table.States (147).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (401, 2), 108, 325)));
+ Table.States (148).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (148), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (195, 0), 1);
+ Table.States (148).Kernel := To_Vector ((0 => ((195, 0), 196, 0,
(195, 0), 1)));
+ Table.States (148).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 0), 1)));
+ Table.States (149).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (149), 86, (252, 0), 33);
+ Add_Action (Table.States (149), 90, (268, 0), 34);
+ Add_Action (Table.States (149), 116, (196, 0), 146);
+ Add_Action (Table.States (149), 117, (196, 1), 37);
+ Add_Action (Table.States (149), 118, (195, 6), 38);
+ Table.States (149).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (149), 195, 326);
+ Add_Goto (Table.States (149), 196, 148);
+ Add_Goto (Table.States (149), 197, 54);
+ Add_Goto (Table.States (149), 198, 55);
+ Add_Goto (Table.States (149), 199, 56);
+ Add_Goto (Table.States (149), 201, 57);
+ Add_Goto (Table.States (149), 251, 58);
+ Add_Goto (Table.States (149), 252, 59);
+ Add_Goto (Table.States (149), 255, 60);
+ Add_Goto (Table.States (149), 268, 68);
+ Add_Goto (Table.States (149), 311, 83);
+ Table.States (149).Kernel := To_Vector ((0 => ((393, 0), 85, 8,
(32767, 0), 0)));
+ Table.States (149).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (150).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (150), 108, (375, 0), 327);
+ Table.States (150).Kernel := To_Vector ((0 => ((375, 0), 14, 1,
(32767, 0), 0)));
+ Table.States (150).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (375, 0), 108, 327)));
+ Table.States (151).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (151), 12, (402, 0), 165);
+ Add_Action (Table.States (151), 46, (233, 2), 167);
+ Add_Action (Table.States (151), 52, (233, 3), 168);
+ Add_Action (Table.States (151), 65, (234, 1), 169);
+ Add_Action (Table.States (151), 76, (256, 0), 170);
+ Add_Action (Table.States (151), 85, (205, 4), 171);
+ Add_Action (Table.States (151), 86, (213, 2), 172);
+ Add_Action (Table.States (151), 90, (268, 0), 34);
+ Add_Action (Table.States (151), 106, (237, 1), 173);
+ Add_Action (Table.States (151), 107, (237, 0), 174);
+ Add_Action (Table.States (151), 115, (234, 0), 175);
+ Add_Action (Table.States (151), 116, (196, 0), 146);
+ Add_Action (Table.States (151), 117, (196, 1), 37);
+ Add_Action (Table.States (151), 118, (195, 6), 38);
+ Table.States (151).Goto_List.Set_Capacity (32);
+ Add_Goto (Table.States (151), 195, 176);
+ Add_Goto (Table.States (151), 196, 148);
+ Add_Goto (Table.States (151), 197, 54);
+ Add_Goto (Table.States (151), 198, 55);
+ Add_Goto (Table.States (151), 199, 56);
+ Add_Goto (Table.States (151), 201, 57);
+ Add_Goto (Table.States (151), 205, 177);
+ Add_Goto (Table.States (151), 206, 178);
+ Add_Goto (Table.States (151), 210, 179);
+ Add_Goto (Table.States (151), 211, 180);
+ Add_Goto (Table.States (151), 213, 181);
+ Add_Goto (Table.States (151), 214, 182);
+ Add_Goto (Table.States (151), 215, 183);
+ Add_Goto (Table.States (151), 218, 184);
+ Add_Goto (Table.States (151), 219, 185);
+ Add_Goto (Table.States (151), 220, 186);
+ Add_Goto (Table.States (151), 227, 236);
+ Add_Goto (Table.States (151), 228, 188);
+ Add_Goto (Table.States (151), 231, 189);
+ Add_Goto (Table.States (151), 232, 190);
+ Add_Goto (Table.States (151), 233, 191);
+ Add_Goto (Table.States (151), 234, 192);
+ Add_Goto (Table.States (151), 237, 193);
+ Add_Goto (Table.States (151), 243, 328);
+ Add_Goto (Table.States (151), 251, 58);
+ Add_Goto (Table.States (151), 252, 59);
+ Add_Goto (Table.States (151), 255, 60);
+ Add_Goto (Table.States (151), 256, 194);
+ Add_Goto (Table.States (151), 268, 68);
+ Add_Goto (Table.States (151), 311, 83);
+ Add_Goto (Table.States (151), 402, 195);
+ Add_Goto (Table.States (151), 465, 196);
+ Table.States (151).Kernel := To_Vector ((0 => ((371, 0), 63, 2,
(32767, 0), 0)));
+ Table.States (151).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (152).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (152), 85, (198, 0), 281);
+ Add_Action (Table.States (152), 96, (197, 0), 283);
+ Add_Action (Table.States (152), 108, (310, 0), 284);
+ Add_Action (Table.States (152), 113, (121, 0), 285);
+ Add_Action (Table.States (152), 114, (121, 1), 286);
+ Table.States (152).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (152), 121, 287);
+ Add_Goto (Table.States (152), 313, 289);
+ Table.States (152).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((310, 0), 195, 1, (32767, 0), 0), ((311, 0),
195, 3, (32767, 0), 0)));
+ Table.States (152).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (310, 0), 108, 284)));
+ Table.States (153).Action_List.Set_Capacity (28);
+ Add_Action (Table.States (153), 12, (401, 0), 1);
+ Add_Action (Table.States (153), 15, (370, 0), 3);
+ Add_Action (Table.States (153), 17, (365, 0), 4);
+ Add_Action (Table.States (153), 18, (382, 0), 5);
+ Add_Action (Table.States (153), 19, (363, 0), 6);
+ Add_Action (Table.States (153), 20, (357, 0), 7);
+ Add_Action (Table.States (153), 30, (316, 0), 13);
+ Add_Action (Table.States (153), 31, (290, 0), 14);
+ Add_Action (Table.States (153), 32, (289, 0), 15);
+ Add_Action (Table.States (153), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (153), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (153), 37, (288, 0), 17);
+ Add_Conflict (Table.States (153), 37, (285, 1), 0);
+ Add_Action (Table.States (153), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (153), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (153), 41, Reduce, (260, 1), 0);
+ Add_Action (Table.States (153), 42, (271, 0), 18);
+ Add_Action (Table.States (153), 43, Reduce, (260, 1), 0);
+ Add_Action (Table.States (153), 49, Reduce, (260, 1), 0);
+ Add_Action (Table.States (153), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (153), 64, (273, 0), 27);
+ Add_Action (Table.States (153), 65, (264, 0), 28);
+ Add_Action (Table.States (153), 84, (124, 0), 32);
+ Add_Action (Table.States (153), 86, (252, 0), 33);
+ Add_Action (Table.States (153), 90, (268, 0), 34);
+ Add_Action (Table.States (153), 105, (265, 0), 35);
+ Add_Action (Table.States (153), 116, (196, 0), 146);
+ Add_Action (Table.States (153), 117, (196, 1), 37);
+ Add_Action (Table.States (153), 118, (195, 6), 38);
+ Table.States (153).Goto_List.Set_Capacity (46);
+ Add_Goto (Table.States (153), 124, 39);
+ Add_Goto (Table.States (153), 195, 52);
+ Add_Goto (Table.States (153), 196, 53);
+ Add_Goto (Table.States (153), 197, 54);
+ Add_Goto (Table.States (153), 198, 55);
+ Add_Goto (Table.States (153), 199, 56);
+ Add_Goto (Table.States (153), 201, 57);
+ Add_Goto (Table.States (153), 251, 58);
+ Add_Goto (Table.States (153), 252, 59);
+ Add_Goto (Table.States (153), 255, 60);
+ Add_Goto (Table.States (153), 259, 329);
+ Add_Goto (Table.States (153), 260, 330);
+ Add_Goto (Table.States (153), 261, 331);
+ Add_Goto (Table.States (153), 262, 62);
+ Add_Goto (Table.States (153), 263, 63);
+ Add_Goto (Table.States (153), 264, 64);
+ Add_Goto (Table.States (153), 265, 65);
+ Add_Goto (Table.States (153), 266, 66);
+ Add_Goto (Table.States (153), 267, 67);
+ Add_Goto (Table.States (153), 268, 68);
+ Add_Goto (Table.States (153), 271, 69);
+ Add_Goto (Table.States (153), 273, 70);
+ Add_Goto (Table.States (153), 275, 71);
+ Add_Goto (Table.States (153), 285, 72);
+ Add_Goto (Table.States (153), 286, 73);
+ Add_Goto (Table.States (153), 288, 74);
+ Add_Goto (Table.States (153), 289, 75);
+ Add_Goto (Table.States (153), 290, 76);
+ Add_Goto (Table.States (153), 310, 82);
+ Add_Goto (Table.States (153), 311, 83);
+ Add_Goto (Table.States (153), 316, 84);
+ Add_Goto (Table.States (153), 318, 85);
+ Add_Goto (Table.States (153), 357, 110);
+ Add_Goto (Table.States (153), 363, 111);
+ Add_Goto (Table.States (153), 364, 112);
+ Add_Goto (Table.States (153), 365, 113);
+ Add_Goto (Table.States (153), 366, 114);
+ Add_Goto (Table.States (153), 367, 115);
+ Add_Goto (Table.States (153), 370, 116);
+ Add_Goto (Table.States (153), 376, 117);
+ Add_Goto (Table.States (153), 378, 118);
+ Add_Goto (Table.States (153), 379, 119);
+ Add_Goto (Table.States (153), 382, 120);
+ Add_Goto (Table.States (153), 401, 133);
+ Add_Goto (Table.States (153), 461, 332);
+ Add_Goto (Table.States (153), 462, 144);
+ Table.States (153).Kernel := To_Vector ((((377, 0), 310, 0,
(260, 1), 0), ((380, 0), 310, 0, (260, 1),
+ 0)));
+ Table.States (153).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (260, 1), 0)));
+ end Subr_5;
+ procedure Subr_6
+ is begin
+ Table.States (154).Action_List.Set_Capacity (28);
+ Add_Action (Table.States (154), 12, (401, 0), 1);
+ Add_Action (Table.States (154), 15, (370, 0), 3);
+ Add_Action (Table.States (154), 17, (365, 0), 4);
+ Add_Action (Table.States (154), 18, (382, 0), 5);
+ Add_Action (Table.States (154), 19, (363, 0), 6);
+ Add_Action (Table.States (154), 20, (357, 0), 7);
+ Add_Action (Table.States (154), 30, (316, 0), 13);
+ Add_Action (Table.States (154), 31, (290, 0), 14);
+ Add_Action (Table.States (154), 32, (289, 0), 15);
+ Add_Action (Table.States (154), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (154), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (154), 37, (288, 0), 17);
+ Add_Conflict (Table.States (154), 37, (285, 1), 0);
+ Add_Action (Table.States (154), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (154), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (154), 41, Reduce, (260, 1), 0);
+ Add_Action (Table.States (154), 42, (271, 0), 18);
+ Add_Action (Table.States (154), 49, Reduce, (260, 1), 0);
+ Add_Action (Table.States (154), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (154), 64, (273, 0), 27);
+ Add_Action (Table.States (154), 65, (264, 0), 28);
+ Add_Action (Table.States (154), 66, Reduce, (260, 1), 0);
+ Add_Action (Table.States (154), 84, (124, 0), 32);
+ Add_Action (Table.States (154), 86, (252, 0), 33);
+ Add_Action (Table.States (154), 90, (268, 0), 34);
+ Add_Action (Table.States (154), 105, (265, 0), 35);
+ Add_Action (Table.States (154), 116, (196, 0), 146);
+ Add_Action (Table.States (154), 117, (196, 1), 37);
+ Add_Action (Table.States (154), 118, (195, 6), 38);
+ Table.States (154).Goto_List.Set_Capacity (46);
+ Add_Goto (Table.States (154), 124, 39);
+ Add_Goto (Table.States (154), 195, 52);
+ Add_Goto (Table.States (154), 196, 53);
+ Add_Goto (Table.States (154), 197, 54);
+ Add_Goto (Table.States (154), 198, 55);
+ Add_Goto (Table.States (154), 199, 56);
+ Add_Goto (Table.States (154), 201, 57);
+ Add_Goto (Table.States (154), 251, 58);
+ Add_Goto (Table.States (154), 252, 59);
+ Add_Goto (Table.States (154), 255, 60);
+ Add_Goto (Table.States (154), 259, 329);
+ Add_Goto (Table.States (154), 260, 333);
+ Add_Goto (Table.States (154), 261, 331);
+ Add_Goto (Table.States (154), 262, 62);
+ Add_Goto (Table.States (154), 263, 63);
+ Add_Goto (Table.States (154), 264, 64);
+ Add_Goto (Table.States (154), 265, 65);
+ Add_Goto (Table.States (154), 266, 66);
+ Add_Goto (Table.States (154), 267, 67);
+ Add_Goto (Table.States (154), 268, 68);
+ Add_Goto (Table.States (154), 271, 69);
+ Add_Goto (Table.States (154), 273, 70);
+ Add_Goto (Table.States (154), 275, 71);
+ Add_Goto (Table.States (154), 285, 72);
+ Add_Goto (Table.States (154), 286, 73);
+ Add_Goto (Table.States (154), 288, 74);
+ Add_Goto (Table.States (154), 289, 75);
+ Add_Goto (Table.States (154), 290, 76);
+ Add_Goto (Table.States (154), 310, 82);
+ Add_Goto (Table.States (154), 311, 83);
+ Add_Goto (Table.States (154), 316, 84);
+ Add_Goto (Table.States (154), 318, 85);
+ Add_Goto (Table.States (154), 357, 110);
+ Add_Goto (Table.States (154), 363, 111);
+ Add_Goto (Table.States (154), 364, 112);
+ Add_Goto (Table.States (154), 365, 113);
+ Add_Goto (Table.States (154), 366, 114);
+ Add_Goto (Table.States (154), 367, 115);
+ Add_Goto (Table.States (154), 370, 116);
+ Add_Goto (Table.States (154), 376, 117);
+ Add_Goto (Table.States (154), 378, 118);
+ Add_Goto (Table.States (154), 379, 119);
+ Add_Goto (Table.States (154), 382, 120);
+ Add_Goto (Table.States (154), 401, 133);
+ Add_Goto (Table.States (154), 461, 332);
+ Add_Goto (Table.States (154), 462, 144);
+ Table.States (154).Kernel := To_Vector ((0 => ((373, 0), 357, 0,
(260, 1), 0)));
+ Table.States (154).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (260, 1), 0)));
+ Table.States (155).Action_List.Set_Capacity (29);
+ Add_Action (Table.States (155), 12, (401, 0), 1);
+ Add_Action (Table.States (155), 15, (370, 0), 3);
+ Add_Action (Table.States (155), 17, (365, 0), 4);
+ Add_Action (Table.States (155), 18, (382, 0), 5);
+ Add_Action (Table.States (155), 19, (363, 0), 6);
+ Add_Action (Table.States (155), 20, (357, 0), 7);
+ Add_Action (Table.States (155), 30, (316, 0), 13);
+ Add_Action (Table.States (155), 31, (290, 0), 14);
+ Add_Action (Table.States (155), 32, (289, 0), 15);
+ Add_Action (Table.States (155), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (155), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (155), 37, (288, 0), 17);
+ Add_Conflict (Table.States (155), 37, (285, 1), 0);
+ Add_Action (Table.States (155), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (155), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (155), 41, Reduce, (260, 1), 0);
+ Add_Action (Table.States (155), 42, (271, 0), 18);
+ Add_Action (Table.States (155), 43, Reduce, (260, 1), 0);
+ Add_Action (Table.States (155), 49, Reduce, (260, 1), 0);
+ Add_Action (Table.States (155), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (155), 64, (273, 0), 27);
+ Add_Action (Table.States (155), 65, (264, 0), 28);
+ Add_Action (Table.States (155), 66, Reduce, (260, 1), 0);
+ Add_Action (Table.States (155), 84, (124, 0), 32);
+ Add_Action (Table.States (155), 86, (252, 0), 33);
+ Add_Action (Table.States (155), 90, (268, 0), 34);
+ Add_Action (Table.States (155), 105, (265, 0), 35);
+ Add_Action (Table.States (155), 116, (196, 0), 146);
+ Add_Action (Table.States (155), 117, (196, 1), 37);
+ Add_Action (Table.States (155), 118, (195, 6), 38);
+ Table.States (155).Goto_List.Set_Capacity (46);
+ Add_Goto (Table.States (155), 124, 39);
+ Add_Goto (Table.States (155), 195, 52);
+ Add_Goto (Table.States (155), 196, 53);
+ Add_Goto (Table.States (155), 197, 54);
+ Add_Goto (Table.States (155), 198, 55);
+ Add_Goto (Table.States (155), 199, 56);
+ Add_Goto (Table.States (155), 201, 57);
+ Add_Goto (Table.States (155), 251, 58);
+ Add_Goto (Table.States (155), 252, 59);
+ Add_Goto (Table.States (155), 255, 60);
+ Add_Goto (Table.States (155), 259, 329);
+ Add_Goto (Table.States (155), 260, 334);
+ Add_Goto (Table.States (155), 261, 331);
+ Add_Goto (Table.States (155), 262, 62);
+ Add_Goto (Table.States (155), 263, 63);
+ Add_Goto (Table.States (155), 264, 64);
+ Add_Goto (Table.States (155), 265, 65);
+ Add_Goto (Table.States (155), 266, 66);
+ Add_Goto (Table.States (155), 267, 67);
+ Add_Goto (Table.States (155), 268, 68);
+ Add_Goto (Table.States (155), 271, 69);
+ Add_Goto (Table.States (155), 273, 70);
+ Add_Goto (Table.States (155), 275, 71);
+ Add_Goto (Table.States (155), 285, 72);
+ Add_Goto (Table.States (155), 286, 73);
+ Add_Goto (Table.States (155), 288, 74);
+ Add_Goto (Table.States (155), 289, 75);
+ Add_Goto (Table.States (155), 290, 76);
+ Add_Goto (Table.States (155), 310, 82);
+ Add_Goto (Table.States (155), 311, 83);
+ Add_Goto (Table.States (155), 316, 84);
+ Add_Goto (Table.States (155), 318, 85);
+ Add_Goto (Table.States (155), 357, 110);
+ Add_Goto (Table.States (155), 363, 111);
+ Add_Goto (Table.States (155), 364, 112);
+ Add_Goto (Table.States (155), 365, 113);
+ Add_Goto (Table.States (155), 366, 114);
+ Add_Goto (Table.States (155), 367, 115);
+ Add_Goto (Table.States (155), 370, 116);
+ Add_Goto (Table.States (155), 376, 117);
+ Add_Goto (Table.States (155), 378, 118);
+ Add_Goto (Table.States (155), 379, 119);
+ Add_Goto (Table.States (155), 382, 120);
+ Add_Goto (Table.States (155), 401, 133);
+ Add_Goto (Table.States (155), 461, 332);
+ Add_Goto (Table.States (155), 462, 144);
+ Table.States (155).Kernel := To_Vector ((((374, 0), 364, 0,
(260, 1), 0), ((380, 1), 364, 0, (260, 1),
+ 0)));
+ Table.States (155).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (260, 1), 0)));
+ Table.States (156).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (156), (41, 49, 66), (369, 0), 1);
+ Table.States (156).Kernel := To_Vector ((0 => ((369, 0), 368, 0,
(369, 0), 1)));
+ Table.States (156).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (369, 0), 1)));
+ Table.States (157).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (157), 41, (370, 0), 335);
+ Add_Action (Table.States (157), 49, (369, 1), 336);
+ Add_Action (Table.States (157), 66, (370, 1), 337);
+ Table.States (157).Kernel := To_Vector ((((369, 1), 369, 3,
(32767, 0), 0), ((370, 0), 369, 6, (32767,
+ 0), 0), ((370, 1), 369, 3, (32767, 0), 0)));
+ Table.States (157).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (370, 1), 66, 337)));
+ Table.States (158).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (158), 14, (375, 0), 150);
+ Add_Action (Table.States (158), 17, (365, 0), 4);
+ Add_Action (Table.States (158), 20, (357, 0), 7);
+ Table.States (158).Goto_List.Set_Capacity (8);
+ Add_Goto (Table.States (158), 357, 154);
+ Add_Goto (Table.States (158), 364, 338);
+ Add_Goto (Table.States (158), 365, 113);
+ Add_Goto (Table.States (158), 366, 114);
+ Add_Goto (Table.States (158), 372, 339);
+ Add_Goto (Table.States (158), 373, 160);
+ Add_Goto (Table.States (158), 374, 161);
+ Add_Goto (Table.States (158), 375, 162);
+ Table.States (158).Kernel := To_Vector ((0 => ((368, 0), 371, 2,
(32767, 0), 0)));
+ Table.States (158).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (375, 0), 14, 150)));
+ Table.States (159).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (159), (41, 49, 66), (368, 1), 1);
+ Table.States (159).Kernel := To_Vector ((0 => ((368, 1), 372, 0,
(368, 1), 1)));
+ Table.States (159).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (368, 1), 1)));
+ Table.States (160).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (160), (41, 49, 66), (372, 0), 1);
+ Table.States (160).Kernel := To_Vector ((0 => ((372, 0), 373, 0,
(372, 0), 1)));
+ Table.States (160).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (372, 0), 1)));
+ Table.States (161).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (161), (41, 49, 66), (372, 1), 1);
+ Table.States (161).Kernel := To_Vector ((0 => ((372, 1), 374, 0,
(372, 1), 1)));
+ Table.States (161).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (372, 1), 1)));
+ Table.States (162).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (162), (41, 49, 66), (372, 2), 1);
+ Table.States (162).Kernel := To_Vector ((0 => ((372, 2), 375, 0,
(372, 2), 1)));
+ Table.States (162).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (372, 2), 1)));
+ Table.States (163).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (163), 41, (378, 0), 340);
+ Add_Action (Table.States (163), 49, (376, 0), 341);
+ Table.States (163).Kernel := To_Vector ((((376, 0), 377, 7,
(32767, 0), 0), ((378, 0), 377, 6, (32767,
+ 0), 0)));
+ Table.States (163).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (378, 0), 41, 340)));
+ Table.States (164).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (164), 43, (379, 0), 342);
+ Table.States (164).Kernel := To_Vector ((0 => ((379, 0), 380, 7,
(32767, 0), 0)));
+ Table.States (164).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (379, 0), 43, 342)));
+ Table.States (165).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (165), 86, (252, 0), 33);
+ Add_Action (Table.States (165), 90, (268, 0), 34);
+ Add_Action (Table.States (165), 116, (196, 0), 146);
+ Add_Action (Table.States (165), 117, (196, 1), 37);
+ Add_Action (Table.States (165), 118, (195, 6), 38);
+ Table.States (165).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (165), 195, 343);
+ Add_Goto (Table.States (165), 196, 148);
+ Add_Goto (Table.States (165), 197, 54);
+ Add_Goto (Table.States (165), 198, 55);
+ Add_Goto (Table.States (165), 199, 56);
+ Add_Goto (Table.States (165), 201, 57);
+ Add_Goto (Table.States (165), 251, 58);
+ Add_Goto (Table.States (165), 252, 59);
+ Add_Goto (Table.States (165), 255, 60);
+ Add_Goto (Table.States (165), 268, 68);
+ Add_Goto (Table.States (165), 311, 83);
+ Table.States (165).Kernel := To_Vector ((((402, 0), 12, 3,
(32767, 0), 0), ((402, 1), 12, 1, (32767,
+ 0), 0)));
+ Table.States (165).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (166).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (166), 12, (402, 0), 165);
+ Add_Action (Table.States (166), 46, (233, 2), 167);
+ Add_Action (Table.States (166), 52, (233, 3), 168);
+ Add_Action (Table.States (166), 65, (234, 1), 169);
+ Add_Action (Table.States (166), 76, (256, 0), 170);
+ Add_Action (Table.States (166), 85, (205, 4), 171);
+ Add_Action (Table.States (166), 86, (213, 2), 172);
+ Add_Action (Table.States (166), 90, (268, 0), 34);
+ Add_Action (Table.States (166), 106, (237, 1), 173);
+ Add_Action (Table.States (166), 107, (237, 0), 174);
+ Add_Action (Table.States (166), 115, (234, 0), 175);
+ Add_Action (Table.States (166), 116, (196, 0), 146);
+ Add_Action (Table.States (166), 117, (196, 1), 37);
+ Add_Action (Table.States (166), 118, (195, 6), 38);
+ Table.States (166).Goto_List.Set_Capacity (31);
+ Add_Goto (Table.States (166), 195, 176);
+ Add_Goto (Table.States (166), 196, 148);
+ Add_Goto (Table.States (166), 197, 54);
+ Add_Goto (Table.States (166), 198, 55);
+ Add_Goto (Table.States (166), 199, 56);
+ Add_Goto (Table.States (166), 201, 57);
+ Add_Goto (Table.States (166), 205, 177);
+ Add_Goto (Table.States (166), 206, 178);
+ Add_Goto (Table.States (166), 210, 179);
+ Add_Goto (Table.States (166), 211, 180);
+ Add_Goto (Table.States (166), 213, 181);
+ Add_Goto (Table.States (166), 214, 182);
+ Add_Goto (Table.States (166), 215, 183);
+ Add_Goto (Table.States (166), 218, 184);
+ Add_Goto (Table.States (166), 219, 185);
+ Add_Goto (Table.States (166), 220, 186);
+ Add_Goto (Table.States (166), 227, 344);
+ Add_Goto (Table.States (166), 228, 188);
+ Add_Goto (Table.States (166), 231, 189);
+ Add_Goto (Table.States (166), 232, 190);
+ Add_Goto (Table.States (166), 233, 191);
+ Add_Goto (Table.States (166), 234, 192);
+ Add_Goto (Table.States (166), 237, 193);
+ Add_Goto (Table.States (166), 251, 58);
+ Add_Goto (Table.States (166), 252, 59);
+ Add_Goto (Table.States (166), 255, 60);
+ Add_Goto (Table.States (166), 256, 194);
+ Add_Goto (Table.States (166), 268, 68);
+ Add_Goto (Table.States (166), 311, 83);
+ Add_Goto (Table.States (166), 402, 195);
+ Add_Goto (Table.States (166), 465, 196);
+ Table.States (166).Kernel := To_Vector ((0 => ((365, 0), 16, 2,
(32767, 0), 0)));
+ Table.States (166).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (167).Action_List.Set_Capacity (9);
+ Add_Action (Table.States (167), 65, (234, 1), 169);
+ Add_Action (Table.States (167), 76, (256, 0), 170);
+ Add_Action (Table.States (167), 85, (205, 4), 171);
+ Add_Action (Table.States (167), 86, (213, 2), 172);
+ Add_Action (Table.States (167), 90, (268, 0), 34);
+ Add_Action (Table.States (167), 115, (234, 0), 175);
+ Add_Action (Table.States (167), 116, (196, 0), 146);
+ Add_Action (Table.States (167), 117, (196, 1), 37);
+ Add_Action (Table.States (167), 118, (195, 6), 38);
+ Table.States (167).Goto_List.Set_Capacity (23);
+ Add_Goto (Table.States (167), 195, 176);
+ Add_Goto (Table.States (167), 196, 148);
+ Add_Goto (Table.States (167), 197, 54);
+ Add_Goto (Table.States (167), 198, 55);
+ Add_Goto (Table.States (167), 199, 56);
+ Add_Goto (Table.States (167), 201, 57);
+ Add_Goto (Table.States (167), 205, 177);
+ Add_Goto (Table.States (167), 206, 178);
+ Add_Goto (Table.States (167), 210, 179);
+ Add_Goto (Table.States (167), 211, 180);
+ Add_Goto (Table.States (167), 213, 181);
+ Add_Goto (Table.States (167), 214, 182);
+ Add_Goto (Table.States (167), 215, 183);
+ Add_Goto (Table.States (167), 218, 184);
+ Add_Goto (Table.States (167), 219, 185);
+ Add_Goto (Table.States (167), 220, 186);
+ Add_Goto (Table.States (167), 234, 345);
+ Add_Goto (Table.States (167), 251, 58);
+ Add_Goto (Table.States (167), 252, 59);
+ Add_Goto (Table.States (167), 255, 60);
+ Add_Goto (Table.States (167), 256, 194);
+ Add_Goto (Table.States (167), 268, 68);
+ Add_Goto (Table.States (167), 311, 83);
+ Table.States (167).Kernel := To_Vector ((0 => ((233, 2), 46, 1,
(32767, 0), 0)));
+ Table.States (167).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (168).Action_List.Set_Capacity (9);
+ Add_Action (Table.States (168), 65, (234, 1), 169);
+ Add_Action (Table.States (168), 76, (256, 0), 170);
+ Add_Action (Table.States (168), 85, (205, 4), 171);
+ Add_Action (Table.States (168), 86, (213, 2), 172);
+ Add_Action (Table.States (168), 90, (268, 0), 34);
+ Add_Action (Table.States (168), 115, (234, 0), 175);
+ Add_Action (Table.States (168), 116, (196, 0), 146);
+ Add_Action (Table.States (168), 117, (196, 1), 37);
+ Add_Action (Table.States (168), 118, (195, 6), 38);
+ Table.States (168).Goto_List.Set_Capacity (23);
+ Add_Goto (Table.States (168), 195, 176);
+ Add_Goto (Table.States (168), 196, 148);
+ Add_Goto (Table.States (168), 197, 54);
+ Add_Goto (Table.States (168), 198, 55);
+ Add_Goto (Table.States (168), 199, 56);
+ Add_Goto (Table.States (168), 201, 57);
+ Add_Goto (Table.States (168), 205, 177);
+ Add_Goto (Table.States (168), 206, 178);
+ Add_Goto (Table.States (168), 210, 179);
+ Add_Goto (Table.States (168), 211, 180);
+ Add_Goto (Table.States (168), 213, 181);
+ Add_Goto (Table.States (168), 214, 182);
+ Add_Goto (Table.States (168), 215, 183);
+ Add_Goto (Table.States (168), 218, 184);
+ Add_Goto (Table.States (168), 219, 185);
+ Add_Goto (Table.States (168), 220, 186);
+ Add_Goto (Table.States (168), 234, 346);
+ Add_Goto (Table.States (168), 251, 58);
+ Add_Goto (Table.States (168), 252, 59);
+ Add_Goto (Table.States (168), 255, 60);
+ Add_Goto (Table.States (168), 256, 194);
+ Add_Goto (Table.States (168), 268, 68);
+ Add_Goto (Table.States (168), 311, 83);
+ Table.States (168).Kernel := To_Vector ((0 => ((233, 3), 52, 1,
(32767, 0), 0)));
+ Table.States (168).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (169).Action_List.Set_Capacity (39);
+ Add_Action (Table.States (169), (33, 36, 41, 43, 44, 45, 47, 48,
49, 50, 52, 61, 63, 69, 72, 73, 74, 75,
+ 82, 87, 88, 89, 91, 94, 95, 97, 98, 99, 100, 101, 103, 104, 106,
107, 108, 109, 110, 111, 112), (234, 1),
+ 1);
+ Table.States (169).Kernel := To_Vector ((0 => ((234, 1), 65, 0,
(234, 1), 1)));
+ Table.States (169).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (234, 1), 1)));
+ Table.States (170).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (170), 52, (187, 0), 347);
+ Add_Action (Table.States (170), 85, (258, 0), 348);
+ Add_Action (Table.States (170), 86, (252, 0), 33);
+ Add_Action (Table.States (170), 90, (268, 0), 34);
+ Add_Action (Table.States (170), 116, (196, 0), 146);
+ Add_Action (Table.States (170), 117, (196, 1), 37);
+ Add_Action (Table.States (170), 118, (195, 6), 38);
+ Table.States (170).Goto_List.Set_Capacity (14);
+ Add_Goto (Table.States (170), 187, 349);
+ Add_Goto (Table.States (170), 195, 350);
+ Add_Goto (Table.States (170), 196, 148);
+ Add_Goto (Table.States (170), 197, 54);
+ Add_Goto (Table.States (170), 198, 55);
+ Add_Goto (Table.States (170), 199, 56);
+ Add_Goto (Table.States (170), 201, 57);
+ Add_Goto (Table.States (170), 251, 58);
+ Add_Goto (Table.States (170), 252, 59);
+ Add_Goto (Table.States (170), 255, 60);
+ Add_Goto (Table.States (170), 257, 351);
+ Add_Goto (Table.States (170), 258, 352);
+ Add_Goto (Table.States (170), 268, 68);
+ Add_Goto (Table.States (170), 311, 83);
+ Table.States (170).Kernel := To_Vector ((((256, 0), 76, 4,
(32767, 0), 0), ((256, 1), 76, 1, (32767,
+ 0), 0)));
+ Table.States (170).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ end Subr_6;
+ procedure Subr_7
+ is begin
+ Table.States (171).Action_List.Set_Capacity (19);
+ Add_Action (Table.States (171), 12, (402, 0), 165);
+ Add_Action (Table.States (171), 39, (249, 0), 353);
+ Add_Action (Table.States (171), 42, (242, 0), 354);
+ Add_Action (Table.States (171), 46, (233, 2), 167);
+ Add_Action (Table.States (171), 51, (221, 0), 355);
+ Add_Action (Table.States (171), 52, (187, 0), 356);
+ Add_Action (Table.States (171), 62, (178, 3), 357);
+ Add_Action (Table.States (171), 64, (245, 0), 358);
+ Add_Action (Table.States (171), 65, (207, 1), 359);
+ Add_Action (Table.States (171), 76, (256, 0), 170);
+ Add_Action (Table.States (171), 85, (205, 4), 171);
+ Add_Action (Table.States (171), 86, (213, 2), 172);
+ Add_Action (Table.States (171), 90, (268, 0), 34);
+ Add_Action (Table.States (171), 106, (237, 1), 173);
+ Add_Action (Table.States (171), 107, (237, 0), 174);
+ Add_Action (Table.States (171), 115, (234, 0), 175);
+ Add_Action (Table.States (171), 116, (196, 0), 146);
+ Add_Action (Table.States (171), 117, (196, 1), 37);
+ Add_Action (Table.States (171), 118, (195, 6), 360);
+ Table.States (171).Goto_List.Set_Capacity (51);
+ Add_Goto (Table.States (171), 131, 361);
+ Add_Goto (Table.States (171), 140, 362);
+ Add_Goto (Table.States (171), 177, 363);
+ Add_Goto (Table.States (171), 178, 364);
+ Add_Goto (Table.States (171), 187, 365);
+ Add_Goto (Table.States (171), 195, 366);
+ Add_Goto (Table.States (171), 196, 367);
+ Add_Goto (Table.States (171), 197, 54);
+ Add_Goto (Table.States (171), 198, 55);
+ Add_Goto (Table.States (171), 199, 56);
+ Add_Goto (Table.States (171), 200, 368);
+ Add_Goto (Table.States (171), 201, 57);
+ Add_Goto (Table.States (171), 203, 369);
+ Add_Goto (Table.States (171), 205, 177);
+ Add_Goto (Table.States (171), 206, 178);
+ Add_Goto (Table.States (171), 207, 370);
+ Add_Goto (Table.States (171), 208, 371);
+ Add_Goto (Table.States (171), 209, 372);
+ Add_Goto (Table.States (171), 210, 179);
+ Add_Goto (Table.States (171), 211, 180);
+ Add_Goto (Table.States (171), 212, 373);
+ Add_Goto (Table.States (171), 213, 181);
+ Add_Goto (Table.States (171), 214, 182);
+ Add_Goto (Table.States (171), 215, 183);
+ Add_Goto (Table.States (171), 216, 374);
+ Add_Goto (Table.States (171), 217, 375);
+ Add_Goto (Table.States (171), 218, 184);
+ Add_Goto (Table.States (171), 219, 185);
+ Add_Goto (Table.States (171), 220, 186);
+ Add_Goto (Table.States (171), 221, 376);
+ Add_Goto (Table.States (171), 227, 377);
+ Add_Goto (Table.States (171), 228, 188);
+ Add_Goto (Table.States (171), 231, 378);
+ Add_Goto (Table.States (171), 232, 190);
+ Add_Goto (Table.States (171), 233, 191);
+ Add_Goto (Table.States (171), 234, 192);
+ Add_Goto (Table.States (171), 237, 193);
+ Add_Goto (Table.States (171), 239, 379);
+ Add_Goto (Table.States (171), 242, 380);
+ Add_Goto (Table.States (171), 245, 381);
+ Add_Goto (Table.States (171), 247, 382);
+ Add_Goto (Table.States (171), 249, 383);
+ Add_Goto (Table.States (171), 251, 58);
+ Add_Goto (Table.States (171), 252, 59);
+ Add_Goto (Table.States (171), 255, 60);
+ Add_Goto (Table.States (171), 256, 194);
+ Add_Goto (Table.States (171), 268, 68);
+ Add_Goto (Table.States (171), 311, 83);
+ Add_Goto (Table.States (171), 402, 195);
+ Add_Goto (Table.States (171), 459, 384);
+ Add_Goto (Table.States (171), 465, 196);
+ Table.States (171).Kernel := To_Vector ((((205, 4), 85, 5,
(32767, 0), 0), ((205, 5), 85, 8, (32767,
+ 0), 0), ((205, 6), 85, 4, (32767, 0), 0), ((206, 0), 85, 3,
(32767, 0), 0), ((210, 0), 85, 5,
+ (32767, 0), 0), ((213, 0), 85, 2, (32767, 0), 0), ((213, 1),
85, 6, (32767, 0), 0), ((215, 0), 85,
+ 4, (32767, 0), 0), ((219, 0), 85, 6, (32767, 0), 0), ((220,
0), 85, 7, (32767, 0), 0)));
+ Table.States (171).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (172).Action_List.Set_Capacity (18);
+ Add_Action (Table.States (172), 12, (402, 0), 165);
+ Add_Action (Table.States (172), 37, (252, 0), 272);
+ Add_Action (Table.States (172), 46, (233, 2), 167);
+ Add_Action (Table.States (172), 51, (221, 0), 273);
+ Add_Action (Table.States (172), 52, (187, 0), 356);
+ Add_Action (Table.States (172), 62, (178, 3), 385);
+ Add_Action (Table.States (172), 65, (234, 1), 169);
+ Add_Action (Table.States (172), 76, (256, 0), 170);
+ Add_Action (Table.States (172), 85, (205, 4), 171);
+ Add_Action (Table.States (172), 86, (213, 2), 172);
+ Add_Action (Table.States (172), 88, (214, 0), 386);
+ Add_Action (Table.States (172), 90, (268, 0), 34);
+ Add_Action (Table.States (172), 106, (237, 1), 173);
+ Add_Action (Table.States (172), 107, (237, 0), 174);
+ Add_Action (Table.States (172), 115, (234, 0), 175);
+ Add_Action (Table.States (172), 116, (196, 0), 146);
+ Add_Action (Table.States (172), 117, (196, 1), 37);
+ Add_Action (Table.States (172), 118, (195, 6), 38);
+ Table.States (172).Goto_List.Set_Capacity (41);
+ Add_Goto (Table.States (172), 131, 361);
+ Add_Goto (Table.States (172), 140, 362);
+ Add_Goto (Table.States (172), 177, 363);
+ Add_Goto (Table.States (172), 178, 364);
+ Add_Goto (Table.States (172), 187, 365);
+ Add_Goto (Table.States (172), 195, 366);
+ Add_Goto (Table.States (172), 196, 148);
+ Add_Goto (Table.States (172), 197, 54);
+ Add_Goto (Table.States (172), 198, 55);
+ Add_Goto (Table.States (172), 199, 56);
+ Add_Goto (Table.States (172), 201, 57);
+ Add_Goto (Table.States (172), 203, 369);
+ Add_Goto (Table.States (172), 205, 177);
+ Add_Goto (Table.States (172), 206, 178);
+ Add_Goto (Table.States (172), 210, 179);
+ Add_Goto (Table.States (172), 211, 180);
+ Add_Goto (Table.States (172), 212, 387);
+ Add_Goto (Table.States (172), 213, 181);
+ Add_Goto (Table.States (172), 214, 182);
+ Add_Goto (Table.States (172), 215, 183);
+ Add_Goto (Table.States (172), 216, 388);
+ Add_Goto (Table.States (172), 217, 375);
+ Add_Goto (Table.States (172), 218, 184);
+ Add_Goto (Table.States (172), 219, 185);
+ Add_Goto (Table.States (172), 220, 186);
+ Add_Goto (Table.States (172), 221, 389);
+ Add_Goto (Table.States (172), 227, 390);
+ Add_Goto (Table.States (172), 228, 188);
+ Add_Goto (Table.States (172), 231, 378);
+ Add_Goto (Table.States (172), 232, 190);
+ Add_Goto (Table.States (172), 233, 191);
+ Add_Goto (Table.States (172), 234, 192);
+ Add_Goto (Table.States (172), 237, 193);
+ Add_Goto (Table.States (172), 251, 58);
+ Add_Goto (Table.States (172), 252, 59);
+ Add_Goto (Table.States (172), 255, 60);
+ Add_Goto (Table.States (172), 256, 194);
+ Add_Goto (Table.States (172), 268, 68);
+ Add_Goto (Table.States (172), 311, 83);
+ Add_Goto (Table.States (172), 402, 195);
+ Add_Goto (Table.States (172), 465, 196);
+ Table.States (172).Kernel := To_Vector ((((213, 2), 86, 6,
(32767, 0), 0), ((213, 3), 86, 2, (32767,
+ 0), 0), ((214, 0), 86, 1, (32767, 0), 0), ((215, 1), 86, 4,
(32767, 0), 0), ((220, 1), 86, 7,
+ (32767, 0), 0), ((252, 0), 86, 11, (32767, 0), 0), ((252, 1),
86, 8, (32767, 0), 0), ((252, 2), 86,
+ 7, (32767, 0), 0)));
+ Table.States (172).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (214, 0), 88, 386)));
+ Table.States (173).Action_List.Set_Capacity (11);
+ Add_Action (Table.States (173), (46, 52, 65, 76, 85, 86, 90, 115,
116, 117, 118), (237, 1), 1);
+ Table.States (173).Kernel := To_Vector ((0 => ((237, 1), 106, 0,
(237, 1), 1)));
+ Table.States (173).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (237, 1), 1)));
+ Table.States (174).Action_List.Set_Capacity (11);
+ Add_Action (Table.States (174), (46, 52, 65, 76, 85, 86, 90, 115,
116, 117, 118), (237, 0), 1);
+ Table.States (174).Kernel := To_Vector ((0 => ((237, 0), 107, 0,
(237, 0), 1)));
+ Table.States (174).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (237, 0), 1)));
+ Table.States (175).Action_List.Set_Capacity (39);
+ Add_Action (Table.States (175), (33, 36, 41, 43, 44, 45, 47, 48,
49, 50, 52, 61, 63, 69, 72, 73, 74, 75,
+ 82, 87, 88, 89, 91, 94, 95, 97, 98, 99, 100, 101, 103, 104, 106,
107, 108, 109, 110, 111, 112), (234, 0),
+ 1);
+ Table.States (175).Kernel := To_Vector ((0 => ((234, 0), 115, 0,
(234, 0), 1)));
+ Table.States (175).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (234, 0), 1)));
+ Table.States (176).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (176), 33, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 36, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 41, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 43, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 44, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 45, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 47, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 48, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 49, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 50, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 52, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 61, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 63, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 69, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 72, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 73, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 74, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 75, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 82, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 85, (198, 0), 281);
+ Add_Action (Table.States (176), 87, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 88, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 89, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 91, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 94, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 95, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 96, (197, 0), 283);
+ Add_Action (Table.States (176), 97, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 98, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 99, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 100, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 101, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 103, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 104, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 106, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 107, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 108, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 109, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 110, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 111, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 112, Reduce, (234, 3), 1);
+ Add_Action (Table.States (176), 113, (121, 0), 285);
+ Add_Action (Table.States (176), 114, (121, 1), 286);
+ Table.States (176).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (176), 121, 287);
+ Add_Goto (Table.States (176), 313, 289);
+ Table.States (176).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((234, 3), 195, 0,
+ (234, 3), 1), ((255, 0), 195, 3, (32767, 0), 0), ((311, 0),
195, 3, (32767, 0), 0)));
+ Table.States (176).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (234, 3), 1)));
+ Table.States (177).Action_List.Set_Capacity (39);
+ Add_Action (Table.States (177), (33, 36, 41, 43, 44, 45, 47, 48,
49, 50, 52, 61, 63, 69, 72, 73, 74, 75,
+ 82, 87, 88, 89, 91, 94, 95, 97, 98, 99, 100, 101, 103, 104, 106,
107, 108, 109, 110, 111, 112), (234, 2),
+ 1);
+ Table.States (177).Kernel := To_Vector ((0 => ((234, 2), 205, 0,
(234, 2), 1)));
+ Table.States (177).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (234, 2), 1)));
+ Table.States (178).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (178), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (205, 0), 1);
+ Table.States (178).Kernel := To_Vector ((0 => ((205, 0), 206, 0,
(205, 0), 1)));
+ Table.States (178).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (205, 0), 1)));
+ Table.States (179).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (179), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (205, 1), 1);
+ Table.States (179).Kernel := To_Vector ((0 => ((205, 1), 210, 0,
(205, 1), 1)));
+ Table.States (179).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (205, 1), 1)));
+ Table.States (180).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (180), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (205, 2), 1);
+ Table.States (180).Kernel := To_Vector ((0 => ((205, 2), 211, 0,
(205, 2), 1)));
+ Table.States (180).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (205, 2), 1)));
+ Table.States (181).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (181), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (211, 0), 1);
+ Table.States (181).Kernel := To_Vector ((0 => ((211, 0), 213, 0,
(211, 0), 1)));
+ Table.States (181).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (211, 0), 1)));
+ Table.States (182).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (182), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (211, 1), 1);
+ Table.States (182).Kernel := To_Vector ((0 => ((211, 1), 214, 0,
(211, 1), 1)));
+ Table.States (182).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (211, 1), 1)));
+ Table.States (183).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (183), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (211, 2), 1);
+ Table.States (183).Kernel := To_Vector ((0 => ((211, 2), 215, 0,
(211, 2), 1)));
+ Table.States (183).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (211, 2), 1)));
+ Table.States (184).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (184), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (205, 3), 1);
+ Table.States (184).Kernel := To_Vector ((0 => ((205, 3), 218, 0,
(205, 3), 1)));
+ Table.States (184).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (205, 3), 1)));
+ Table.States (185).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (185), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (218, 0), 1);
+ Table.States (185).Kernel := To_Vector ((0 => ((218, 0), 219, 0,
(218, 0), 1)));
+ Table.States (185).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (218, 0), 1)));
+ Table.States (186).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (186), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (218, 1), 1);
+ Table.States (186).Kernel := To_Vector ((0 => ((218, 1), 220, 0,
(218, 1), 1)));
+ Table.States (186).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (218, 1), 1)));
+ Table.States (187).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (187), 108, (366, 0), 391);
+ Table.States (187).Kernel := To_Vector ((0 => ((366, 0), 227, 1,
(32767, 0), 0)));
+ Table.States (187).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (366, 0), 108, 391)));
+ Table.States (188).Action_List.Set_Capacity (20);
+ Add_Action (Table.States (188), 33, Reduce, (227, 0), 1);
+ Add_Action (Table.States (188), 36, Reduce, (227, 0), 1);
+ Add_Action (Table.States (188), 41, Reduce, (227, 0), 1);
+ Add_Action (Table.States (188), 43, Reduce, (227, 0), 1);
+ Add_Action (Table.States (188), 44, Reduce, (227, 0), 1);
+ Add_Action (Table.States (188), 48, (226, 0), 392);
+ Add_Action (Table.States (188), 49, (224, 0), 393);
+ Add_Action (Table.States (188), 50, Reduce, (227, 0), 1);
+ Add_Action (Table.States (188), 61, Reduce, (227, 0), 1);
+ Add_Action (Table.States (188), 63, Reduce, (227, 0), 1);
+ Add_Action (Table.States (188), 72, Reduce, (227, 0), 1);
+ Add_Action (Table.States (188), 74, Reduce, (227, 0), 1);
+ Add_Action (Table.States (188), 75, (222, 0), 394);
+ Add_Action (Table.States (188), 82, Reduce, (227, 0), 1);
+ Add_Action (Table.States (188), 87, Reduce, (227, 0), 1);
+ Add_Action (Table.States (188), 88, Reduce, (227, 0), 1);
+ Add_Action (Table.States (188), 91, Reduce, (227, 0), 1);
+ Add_Action (Table.States (188), 95, Reduce, (227, 0), 1);
+ Add_Action (Table.States (188), 99, Reduce, (227, 0), 1);
+ Add_Action (Table.States (188), 108, Reduce, (227, 0), 1);
+ Table.States (188).Goto_List.Set_Capacity (5);
+ Add_Goto (Table.States (188), 222, 395);
+ Add_Goto (Table.States (188), 223, 396);
+ Add_Goto (Table.States (188), 224, 397);
+ Add_Goto (Table.States (188), 225, 398);
+ Add_Goto (Table.States (188), 226, 399);
+ Table.States (188).Kernel := To_Vector ((((227, 0), 228, 0,
(227, 0), 1), ((227, 1), 228, 2, (32767,
+ 0), 0), ((227, 2), 228, 3, (32767, 0), 0), ((227, 3), 228,
2, (32767, 0), 0), ((227, 4), 228, 3,
+ (32767, 0), 0), ((227, 5), 228, 2, (32767, 0), 0)));
+ Table.States (188).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (227, 0), 1)));
+ Table.States (189).Action_List.Set_Capacity (28);
+ Add_Action (Table.States (189), 33, Reduce, (228, 1), 1);
+ Add_Action (Table.States (189), 36, Reduce, (228, 1), 1);
+ Add_Action (Table.States (189), 41, Reduce, (228, 1), 1);
+ Add_Action (Table.States (189), 43, Reduce, (228, 1), 1);
+ Add_Action (Table.States (189), 44, Reduce, (228, 1), 1);
+ Add_Action (Table.States (189), 47, (228, 3), 400);
+ Add_Action (Table.States (189), 48, Reduce, (228, 1), 1);
+ Add_Action (Table.States (189), 49, Reduce, (228, 1), 1);
+ Add_Action (Table.States (189), 50, Reduce, (228, 1), 1);
+ Add_Action (Table.States (189), 52, (228, 2), 401);
+ Add_Action (Table.States (189), 61, Reduce, (228, 1), 1);
+ Add_Action (Table.States (189), 63, Reduce, (228, 1), 1);
+ Add_Action (Table.States (189), 72, Reduce, (228, 1), 1);
+ Add_Action (Table.States (189), 74, Reduce, (228, 1), 1);
+ Add_Action (Table.States (189), 75, Reduce, (228, 1), 1);
+ Add_Action (Table.States (189), 82, Reduce, (228, 1), 1);
+ Add_Action (Table.States (189), 87, Reduce, (228, 1), 1);
+ Add_Action (Table.States (189), 88, Reduce, (228, 1), 1);
+ Add_Action (Table.States (189), 91, Reduce, (228, 1), 1);
+ Add_Action (Table.States (189), 95, Reduce, (228, 1), 1);
+ Add_Action (Table.States (189), 98, (235, 0), 402);
+ Add_Action (Table.States (189), 99, Reduce, (228, 1), 1);
+ Add_Action (Table.States (189), 100, (235, 4), 403);
+ Add_Action (Table.States (189), 101, (235, 5), 404);
+ Add_Action (Table.States (189), 103, (235, 2), 405);
+ Add_Action (Table.States (189), 104, (235, 3), 406);
+ Add_Action (Table.States (189), 108, Reduce, (228, 1), 1);
+ Add_Action (Table.States (189), 110, (235, 1), 407);
+ Table.States (189).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (189), 235, 408);
+ Table.States (189).Kernel := To_Vector ((((228, 0), 231, 2,
(32767, 0), 0), ((228, 1), 231, 0, (228,
+ 1), 1), ((228, 2), 231, 3, (32767, 0), 0), ((228, 3), 231,
2, (32767, 0), 0)));
+ Table.States (189).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (228, 1), 1)));
+ Table.States (190).Action_List.Set_Capacity (38);
+ Add_Action (Table.States (190), 33, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 36, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 41, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 43, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 44, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 45, (238, 3), 409);
+ Add_Action (Table.States (190), 47, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 48, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 49, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 50, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 52, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 61, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 63, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 69, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 72, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 73, (238, 2), 410);
+ Add_Action (Table.States (190), 74, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 75, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 82, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 87, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 88, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 89, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 91, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 94, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 95, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 97, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 98, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 99, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 100, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 101, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 103, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 104, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 106, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 107, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 108, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 109, (238, 1), 411);
+ Add_Action (Table.States (190), 110, Reduce, (465, 0), 1);
+ Add_Action (Table.States (190), 111, (238, 0), 412);
+ Table.States (190).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (190), 238, 413);
+ Table.States (190).Kernel := To_Vector ((((232, 1), 232, 2,
(32767, 0), 0), ((232, 2), 232, 2, (32767,
+ 0), 0), ((465, 0), 232, 0, (465, 0), 1)));
+ Table.States (190).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (465, 0), 1)));
+ end Subr_7;
+ procedure Subr_8
+ is begin
+ Table.States (191).Action_List.Set_Capacity (38);
+ Add_Action (Table.States (191), (33, 36, 41, 43, 44, 45, 47, 48,
49, 50, 52, 61, 63, 69, 72, 73, 74, 75,
+ 82, 87, 88, 89, 91, 94, 95, 97, 98, 99, 100, 101, 103, 104, 106,
107, 108, 109, 110, 111), (232, 0), 1);
+ Table.States (191).Kernel := To_Vector ((0 => ((232, 0), 233, 0,
(232, 0), 1)));
+ Table.States (191).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (232, 0), 1)));
+ Table.States (192).Action_List.Set_Capacity (39);
+ Add_Action (Table.States (192), 33, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 36, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 41, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 43, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 44, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 45, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 47, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 48, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 49, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 50, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 52, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 61, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 63, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 69, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 72, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 73, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 74, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 75, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 82, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 87, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 88, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 89, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 91, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 94, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 95, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 97, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 98, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 99, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 100, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 101, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 103, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 104, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 106, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 107, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 108, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 109, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 110, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 111, Reduce, (233, 1), 1);
+ Add_Action (Table.States (192), 112, (233, 0), 414);
+ Table.States (192).Kernel := To_Vector ((((233, 0), 234, 2,
(32767, 0), 0), ((233, 1), 234, 0, (233,
+ 1), 1)));
+ Table.States (192).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (233, 1), 1)));
+ Table.States (193).Action_List.Set_Capacity (11);
+ Add_Action (Table.States (193), 46, (233, 2), 167);
+ Add_Action (Table.States (193), 52, (233, 3), 168);
+ Add_Action (Table.States (193), 65, (234, 1), 169);
+ Add_Action (Table.States (193), 76, (256, 0), 170);
+ Add_Action (Table.States (193), 85, (205, 4), 171);
+ Add_Action (Table.States (193), 86, (213, 2), 172);
+ Add_Action (Table.States (193), 90, (268, 0), 34);
+ Add_Action (Table.States (193), 115, (234, 0), 175);
+ Add_Action (Table.States (193), 116, (196, 0), 146);
+ Add_Action (Table.States (193), 117, (196, 1), 37);
+ Add_Action (Table.States (193), 118, (195, 6), 38);
+ Table.States (193).Goto_List.Set_Capacity (26);
+ Add_Goto (Table.States (193), 195, 176);
+ Add_Goto (Table.States (193), 196, 148);
+ Add_Goto (Table.States (193), 197, 54);
+ Add_Goto (Table.States (193), 198, 55);
+ Add_Goto (Table.States (193), 199, 56);
+ Add_Goto (Table.States (193), 201, 57);
+ Add_Goto (Table.States (193), 205, 177);
+ Add_Goto (Table.States (193), 206, 178);
+ Add_Goto (Table.States (193), 210, 179);
+ Add_Goto (Table.States (193), 211, 180);
+ Add_Goto (Table.States (193), 213, 181);
+ Add_Goto (Table.States (193), 214, 182);
+ Add_Goto (Table.States (193), 215, 183);
+ Add_Goto (Table.States (193), 218, 184);
+ Add_Goto (Table.States (193), 219, 185);
+ Add_Goto (Table.States (193), 220, 186);
+ Add_Goto (Table.States (193), 232, 190);
+ Add_Goto (Table.States (193), 233, 191);
+ Add_Goto (Table.States (193), 234, 192);
+ Add_Goto (Table.States (193), 251, 58);
+ Add_Goto (Table.States (193), 252, 59);
+ Add_Goto (Table.States (193), 255, 60);
+ Add_Goto (Table.States (193), 256, 194);
+ Add_Goto (Table.States (193), 268, 68);
+ Add_Goto (Table.States (193), 311, 83);
+ Add_Goto (Table.States (193), 465, 415);
+ Table.States (193).Kernel := To_Vector ((0 => ((231, 0), 237, 1,
(32767, 0), 0)));
+ Table.States (193).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (194).Action_List.Set_Capacity (39);
+ Add_Action (Table.States (194), (33, 36, 41, 43, 44, 45, 47, 48,
49, 50, 52, 61, 63, 69, 72, 73, 74, 75,
+ 82, 87, 88, 89, 91, 94, 95, 97, 98, 99, 100, 101, 103, 104, 106,
107, 108, 109, 110, 111, 112), (234, 4),
+ 1);
+ Table.States (194).Kernel := To_Vector ((0 => ((234, 4), 256, 0,
(234, 4), 1)));
+ Table.States (194).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (234, 4), 1)));
+ Table.States (195).Action_List.Set_Capacity (20);
+ Add_Action (Table.States (195), (33, 36, 41, 43, 44, 48, 49, 50,
61, 63, 72, 74, 75, 82, 87, 88, 91, 95,
+ 99, 108), (228, 4), 1);
+ Table.States (195).Kernel := To_Vector ((0 => ((228, 4), 402, 0,
(228, 4), 1)));
+ Table.States (195).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (228, 4), 1)));
+ Table.States (196).Action_List.Set_Capacity (34);
+ Add_Action (Table.States (196), 33, Reduce, (231, 1), 1);
+ Add_Action (Table.States (196), 36, Reduce, (231, 1), 1);
+ Add_Action (Table.States (196), 41, Reduce, (231, 1), 1);
+ Add_Action (Table.States (196), 43, Reduce, (231, 1), 1);
+ Add_Action (Table.States (196), 44, Reduce, (231, 1), 1);
+ Add_Action (Table.States (196), 47, Reduce, (231, 1), 1);
+ Add_Action (Table.States (196), 48, Reduce, (231, 1), 1);
+ Add_Action (Table.States (196), 49, Reduce, (231, 1), 1);
+ Add_Action (Table.States (196), 50, Reduce, (231, 1), 1);
+ Add_Action (Table.States (196), 52, Reduce, (231, 1), 1);
+ Add_Action (Table.States (196), 61, Reduce, (231, 1), 1);
+ Add_Action (Table.States (196), 63, Reduce, (231, 1), 1);
+ Add_Action (Table.States (196), 69, Reduce, (231, 1), 1);
+ Add_Action (Table.States (196), 72, Reduce, (231, 1), 1);
+ Add_Action (Table.States (196), 74, Reduce, (231, 1), 1);
+ Add_Action (Table.States (196), 75, Reduce, (231, 1), 1);
+ Add_Action (Table.States (196), 82, Reduce, (231, 1), 1);
+ Add_Action (Table.States (196), 87, Reduce, (231, 1), 1);
+ Add_Action (Table.States (196), 88, Reduce, (231, 1), 1);
+ Add_Action (Table.States (196), 89, (236, 2), 416);
+ Add_Action (Table.States (196), 91, Reduce, (231, 1), 1);
+ Add_Action (Table.States (196), 94, Reduce, (231, 1), 1);
+ Add_Action (Table.States (196), 95, Reduce, (231, 1), 1);
+ Add_Action (Table.States (196), 97, Reduce, (231, 1), 1);
+ Add_Action (Table.States (196), 98, Reduce, (231, 1), 1);
+ Add_Action (Table.States (196), 99, Reduce, (231, 1), 1);
+ Add_Action (Table.States (196), 100, Reduce, (231, 1), 1);
+ Add_Action (Table.States (196), 101, Reduce, (231, 1), 1);
+ Add_Action (Table.States (196), 103, Reduce, (231, 1), 1);
+ Add_Action (Table.States (196), 104, Reduce, (231, 1), 1);
+ Add_Action (Table.States (196), 106, (236, 1), 417);
+ Add_Action (Table.States (196), 107, (236, 0), 418);
+ Add_Action (Table.States (196), 108, Reduce, (231, 1), 1);
+ Add_Action (Table.States (196), 110, Reduce, (231, 1), 1);
+ Table.States (196).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (196), 236, 419);
+ Table.States (196).Kernel := To_Vector ((((231, 1), 465, 0,
(231, 1), 1), ((465, 1), 465, 2, (32767,
+ 0), 0), ((465, 2), 465, 2, (32767, 0), 0)));
+ Table.States (196).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (231, 1), 1)));
+ Table.States (197).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (197), 85, (198, 0), 281);
+ Add_Action (Table.States (197), 87, Reduce, (306, 0), 1);
+ Add_Action (Table.States (197), 95, Reduce, (306, 0), 1);
+ Add_Action (Table.States (197), 96, (197, 0), 283);
+ Add_Action (Table.States (197), 108, Reduce, (306, 0), 1);
+ Add_Action (Table.States (197), 113, (121, 0), 285);
+ Add_Action (Table.States (197), 114, (121, 1), 286);
+ Table.States (197).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (197), 121, 287);
+ Add_Goto (Table.States (197), 313, 289);
+ Table.States (197).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((306, 0), 195, 0, (306, 0), 1), ((311, 0),
195, 3, (32767, 0), 0)));
+ Table.States (197).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (306, 0), 1)));
+ Table.States (198).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (198), 95, (306, 1), 420);
+ Add_Action (Table.States (198), 108, (382, 0), 421);
+ Table.States (198).Kernel := To_Vector ((((306, 1), 306, 2,
(32767, 0), 0), ((306, 2), 306, 2, (32767,
+ 0), 0), ((382, 0), 306, 1, (32767, 0), 0)));
+ Table.States (198).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (382, 0), 108, 421)));
+ Table.States (199).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (199), 61, (363, 0), 422);
+ Add_Action (Table.States (199), 85, (198, 0), 281);
+ Add_Action (Table.States (199), 96, (197, 0), 283);
+ Add_Action (Table.States (199), 108, (363, 1), 423);
+ Add_Action (Table.States (199), 113, (121, 0), 285);
+ Add_Action (Table.States (199), 114, (121, 1), 286);
+ Table.States (199).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (199), 121, 287);
+ Add_Goto (Table.States (199), 313, 289);
+ Table.States (199).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0), ((363, 0),
195, 3, (32767, 0), 0), ((363, 1),
+ 195, 1, (32767, 0), 0)));
+ Table.States (199).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (363, 1), 108, 423)));
+ Table.States (200).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (200), 33, Reduce, (295, 1), 0);
+ Add_Action (Table.States (200), 85, (299, 0), 424);
+ Add_Action (Table.States (200), 108, Reduce, (295, 1), 0);
+ Table.States (200).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (200), 295, 425);
+ Add_Goto (Table.States (200), 299, 426);
+ Table.States (200).Kernel := To_Vector ((((357, 0), 196, 8,
(32767, 0), 0), ((357, 1), 196, 4, (32767,
+ 0), 0), ((357, 2), 196, 5, (32767, 0), 0), ((357, 3), 196,
1, (32767, 0), 0)));
+ Table.States (200).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (295, 1), 0)));
+ Table.States (201).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (201), 61, Reduce, (295, 1), 0);
+ Add_Action (Table.States (201), 85, (299, 0), 427);
+ Add_Action (Table.States (201), 108, Reduce, (295, 1), 0);
+ Table.States (201).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (201), 295, 428);
+ Add_Goto (Table.States (201), 299, 426);
+ Table.States (201).Kernel := To_Vector ((((356, 4), 116, 6,
(32767, 0), 0), ((356, 5), 116, 4, (32767,
+ 0), 0), ((356, 6), 116, 3, (32767, 0), 0), ((356, 7), 116,
1, (32767, 0), 0)));
+ Table.States (201).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (295, 1), 0)));
+ Table.States (202).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (202), 86, (252, 0), 33);
+ Add_Action (Table.States (202), 90, (268, 0), 34);
+ Add_Action (Table.States (202), 116, (196, 0), 146);
+ Add_Action (Table.States (202), 117, (196, 1), 37);
+ Add_Action (Table.States (202), 118, (195, 6), 38);
+ Table.States (202).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (202), 195, 429);
+ Add_Goto (Table.States (202), 196, 148);
+ Add_Goto (Table.States (202), 197, 54);
+ Add_Goto (Table.States (202), 198, 55);
+ Add_Goto (Table.States (202), 199, 56);
+ Add_Goto (Table.States (202), 201, 57);
+ Add_Goto (Table.States (202), 251, 58);
+ Add_Goto (Table.States (202), 252, 59);
+ Add_Goto (Table.States (202), 255, 60);
+ Add_Goto (Table.States (202), 268, 68);
+ Add_Goto (Table.States (202), 311, 83);
+ Table.States (202).Kernel := To_Vector ((((339, 0), 28, 6,
(32767, 0), 0), ((339, 1), 28, 4, (32767,
+ 0), 0)));
+ Table.States (202).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (203).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (203), 86, (252, 0), 33);
+ Add_Action (Table.States (203), 90, (268, 0), 34);
+ Add_Action (Table.States (203), 116, (196, 0), 146);
+ Add_Action (Table.States (203), 117, (196, 1), 37);
+ Add_Action (Table.States (203), 118, (195, 6), 38);
+ Table.States (203).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (203), 195, 430);
+ Add_Goto (Table.States (203), 196, 148);
+ Add_Goto (Table.States (203), 197, 54);
+ Add_Goto (Table.States (203), 198, 55);
+ Add_Goto (Table.States (203), 199, 56);
+ Add_Goto (Table.States (203), 201, 57);
+ Add_Goto (Table.States (203), 251, 58);
+ Add_Goto (Table.States (203), 252, 59);
+ Add_Goto (Table.States (203), 255, 60);
+ Add_Goto (Table.States (203), 268, 68);
+ Add_Goto (Table.States (203), 311, 83);
+ Table.States (203).Kernel := To_Vector ((((339, 4), 53, 6,
(32767, 0), 0), ((339, 5), 53, 4, (32767,
+ 0), 0)));
+ Table.States (203).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (204).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (204), 86, (252, 0), 33);
+ Add_Action (Table.States (204), 90, (268, 0), 34);
+ Add_Action (Table.States (204), 116, (196, 0), 146);
+ Add_Action (Table.States (204), 117, (196, 1), 37);
+ Add_Action (Table.States (204), 118, (195, 6), 38);
+ Table.States (204).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (204), 195, 431);
+ Add_Goto (Table.States (204), 196, 148);
+ Add_Goto (Table.States (204), 197, 54);
+ Add_Goto (Table.States (204), 198, 55);
+ Add_Goto (Table.States (204), 199, 56);
+ Add_Goto (Table.States (204), 201, 57);
+ Add_Goto (Table.States (204), 251, 58);
+ Add_Goto (Table.States (204), 252, 59);
+ Add_Goto (Table.States (204), 255, 60);
+ Add_Goto (Table.States (204), 268, 68);
+ Add_Goto (Table.States (204), 311, 83);
+ Table.States (204).Kernel := To_Vector ((((339, 2), 54, 6,
(32767, 0), 0), ((339, 3), 54, 4, (32767,
+ 0), 0)));
+ Table.States (204).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (205).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (205), 28, (430, 0), 432);
+ Add_Action (Table.States (205), 53, (294, 0), 314);
+ Add_Action (Table.States (205), 54, (293, 0), 315);
+ Table.States (205).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (205), 292, 433);
+ Add_Goto (Table.States (205), 293, 317);
+ Add_Goto (Table.States (205), 294, 318);
+ Table.States (205).Kernel := To_Vector ((((426, 0), 61, 7,
(32767, 0), 0), ((426, 1), 61, 5, (32767,
+ 0), 0), ((426, 2), 61, 5, (32767, 0), 0), ((426, 3), 61, 3,
(32767, 0), 0), ((427, 0), 61, 8,
+ (32767, 0), 0), ((427, 1), 61, 6, (32767, 0), 0), ((427, 2),
61, 7, (32767, 0), 0), ((427, 3), 61,
+ 5, (32767, 0), 0), ((430, 0), 61, 8, (32767, 0), 0), ((430,
1), 61, 6, (32767, 0), 0)));
+ Table.States (205).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (293, 0), 54, 315)));
+ Table.States (206).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (206), 116, (411, 0), 434);
+ Table.States (206).Kernel := To_Vector ((((411, 0), 83, 12,
(32767, 0), 0), ((411, 1), 83, 10, (32767,
+ 0), 0), ((411, 2), 83, 9, (32767, 0), 0), ((411, 3), 83, 7,
(32767, 0), 0), ((411, 4), 83, 9,
+ (32767, 0), 0), ((411, 5), 83, 7, (32767, 0), 0), ((411, 6),
83, 6, (32767, 0), 0), ((411, 7), 83,
+ 4, (32767, 0), 0), ((412, 0), 83, 10, (32767, 0), 0), ((412,
1), 83, 7, (32767, 0), 0), ((412, 2),
+ 83, 8, (32767, 0), 0), ((412, 3), 83, 5, (32767, 0), 0),
((412, 4), 83, 7, (32767, 0), 0), ((412,
+ 5), 83, 4, (32767, 0), 0), ((412, 6), 83, 5, (32767, 0), 0),
((412, 7), 83, 2, (32767, 0), 0)));
+ Table.States (206).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (411, 0), 116, 434)));
+ Table.States (207).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (207), (87, 93, 95), (136, 0), 1);
+ Table.States (207).Kernel := To_Vector ((0 => ((136, 0), 116, 0,
(136, 0), 1)));
+ Table.States (207).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (136, 0), 1)));
+ Table.States (208).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (208), (28, 50, 53, 54, 61, 83, 84, 116),
(407, 5), 1);
+ Table.States (208).Kernel := To_Vector ((0 => ((407, 5), 124, 0,
(407, 5), 1)));
+ Table.States (208).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (407, 5), 1)));
+ Table.States (209).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (209), 93, (409, 0), 435);
+ Add_Action (Table.States (209), 95, (136, 1), 280);
+ Table.States (209).Kernel := To_Vector ((((136, 1), 136, 2,
(32767, 0), 0), ((409, 0), 136, 9, (32767,
+ 0), 0), ((409, 1), 136, 7, (32767, 0), 0), ((409, 2), 136,
7, (32767, 0), 0), ((409, 3), 136, 5,
+ (32767, 0), 0), ((409, 4), 136, 7, (32767, 0), 0), ((409, 5),
136, 5, (32767, 0), 0), ((409, 6),
+ 136, 5, (32767, 0), 0), ((409, 7), 136, 3, (32767, 0), 0),
((409, 8), 136, 8, (32767, 0), 0),
+ ((409, 9), 136, 6, (32767, 0), 0), ((409, 10), 136, 6,
(32767, 0), 0), ((409, 11), 136, 4, (32767,
+ 0), 0)));
+ Table.States (209).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (409, 0), 93, 435)));
+ Table.States (210).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (210), (28, 50, 53, 54, 61, 83, 84, 116),
(407, 4), 1);
+ Table.States (210).Kernel := To_Vector ((0 => ((407, 4), 330, 0,
(407, 4), 1)));
+ Table.States (210).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (407, 4), 1)));
+ Table.States (211).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (211), (28, 50, 53, 54, 61, 83, 84, 116),
(464, 0), 1);
+ Table.States (211).Kernel := To_Vector ((0 => ((464, 0), 407, 0,
(464, 0), 1)));
+ Table.States (211).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (464, 0), 1)));
+ Table.States (212).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (212), (28, 50, 53, 54, 61, 83, 84, 116),
(407, 0), 1);
+ Table.States (212).Kernel := To_Vector ((0 => ((407, 0), 409, 0,
(407, 0), 1)));
+ Table.States (212).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (407, 0), 1)));
+ Table.States (213).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (213), (28, 50, 53, 54, 61, 83, 84, 116),
(407, 1), 1);
+ Table.States (213).Kernel := To_Vector ((0 => ((407, 1), 410, 0,
(407, 1), 1)));
+ Table.States (213).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (407, 1), 1)));
+ Table.States (214).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (214), (28, 50, 53, 54, 61, 83, 84, 116),
(410, 0), 1);
+ Table.States (214).Kernel := To_Vector ((0 => ((410, 0), 411, 0,
(410, 0), 1)));
+ Table.States (214).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (410, 0), 1)));
+ Table.States (215).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (215), (28, 50, 53, 54, 61, 83, 84, 116),
(410, 1), 1);
+ Table.States (215).Kernel := To_Vector ((0 => ((410, 1), 412, 0,
(410, 1), 1)));
+ Table.States (215).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (410, 1), 1)));
+ Table.States (216).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (216), (28, 50, 53, 54, 61, 83, 84, 116),
(407, 2), 1);
+ Table.States (216).Kernel := To_Vector ((0 => ((407, 2), 425, 0,
(407, 2), 1)));
+ Table.States (216).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (407, 2), 1)));
+ Table.States (217).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (217), (28, 50, 53, 54, 61, 83, 84, 116),
(425, 0), 1);
+ Table.States (217).Kernel := To_Vector ((0 => ((425, 0), 426, 0,
(425, 0), 1)));
+ Table.States (217).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (425, 0), 1)));
+ Table.States (218).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (218), (28, 50, 53, 54, 61, 83, 84, 116),
(425, 1), 1);
+ Table.States (218).Kernel := To_Vector ((0 => ((425, 1), 427, 0,
(425, 1), 1)));
+ Table.States (218).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (425, 1), 1)));
+ Table.States (219).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (219), (28, 50, 53, 54, 61, 83, 84, 116),
(407, 3), 1);
+ Table.States (219).Kernel := To_Vector ((0 => ((407, 3), 430, 0,
(407, 3), 1)));
+ Table.States (219).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (407, 3), 1)));
+ Table.States (220).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (220), 28, Reduce, (406, 0), 2);
+ Add_Action (Table.States (220), 50, (332, 0), 19);
+ Add_Action (Table.States (220), 53, Reduce, (406, 0), 2);
+ Add_Action (Table.States (220), 54, Reduce, (406, 0), 2);
+ Add_Action (Table.States (220), 61, (426, 0), 205);
+ Add_Action (Table.States (220), 83, (411, 0), 206);
+ Add_Action (Table.States (220), 84, (124, 0), 32);
+ Add_Action (Table.States (220), 116, (136, 0), 207);
+ Table.States (220).Goto_List.Set_Capacity (15);
+ Add_Goto (Table.States (220), 124, 208);
+ Add_Goto (Table.States (220), 136, 209);
+ Add_Goto (Table.States (220), 330, 210);
+ Add_Goto (Table.States (220), 332, 95);
+ Add_Goto (Table.States (220), 333, 96);
+ Add_Goto (Table.States (220), 407, 436);
+ Add_Goto (Table.States (220), 409, 212);
+ Add_Goto (Table.States (220), 410, 213);
+ Add_Goto (Table.States (220), 411, 214);
+ Add_Goto (Table.States (220), 412, 215);
+ Add_Goto (Table.States (220), 425, 216);
+ Add_Goto (Table.States (220), 426, 217);
+ Add_Goto (Table.States (220), 427, 218);
+ Add_Goto (Table.States (220), 430, 219);
+ Add_Goto (Table.States (220), 464, 437);
+ Table.States (220).Kernel := To_Vector ((((406, 0), 464, 0,
(406, 0), 2), ((464, 1), 464, 3, (32767,
+ 0), 0), ((464, 2), 464, 3, (32767, 0), 0)));
+ Table.States (220).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (406, 0), 2)));
+ end Subr_8;
+ procedure Subr_9
+ is begin
+ Table.States (221).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (221), 86, (252, 0), 33);
+ Add_Action (Table.States (221), 90, (268, 0), 34);
+ Add_Action (Table.States (221), 116, (196, 0), 146);
+ Add_Action (Table.States (221), 117, (196, 1), 37);
+ Add_Action (Table.States (221), 118, (195, 6), 38);
+ Table.States (221).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (221), 195, 248);
+ Add_Goto (Table.States (221), 196, 249);
+ Add_Goto (Table.States (221), 197, 54);
+ Add_Goto (Table.States (221), 198, 55);
+ Add_Goto (Table.States (221), 199, 56);
+ Add_Goto (Table.States (221), 201, 57);
+ Add_Goto (Table.States (221), 251, 58);
+ Add_Goto (Table.States (221), 252, 59);
+ Add_Goto (Table.States (221), 255, 60);
+ Add_Goto (Table.States (221), 268, 68);
+ Add_Goto (Table.States (221), 311, 83);
+ Table.States (221).Kernel := To_Vector ((((437, 0), 51, 6,
(32767, 0), 0), ((438, 0), 51, 5, (32767,
+ 0), 0), ((440, 0), 51, 19, (32767, 0), 0), ((440, 1), 51,
18, (32767, 0), 0), ((440, 2), 51, 11,
+ (32767, 0), 0), ((440, 3), 51, 10, (32767, 0), 0), ((440, 4),
51, 15, (32767, 0), 0), ((440, 5),
+ 51, 14, (32767, 0), 0), ((440, 6), 51, 7, (32767, 0), 0),
((440, 7), 51, 6, (32767, 0), 0), ((454,
+ 0), 51, 5, (32767, 0), 0)));
+ Table.States (221).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (222).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (222), 86, (252, 0), 33);
+ Add_Action (Table.States (222), 90, (268, 0), 34);
+ Add_Action (Table.States (222), 116, (196, 0), 146);
+ Add_Action (Table.States (222), 117, (196, 1), 37);
+ Add_Action (Table.States (222), 118, (195, 6), 38);
+ Table.States (222).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (222), 195, 244);
+ Add_Goto (Table.States (222), 196, 148);
+ Add_Goto (Table.States (222), 197, 54);
+ Add_Goto (Table.States (222), 198, 55);
+ Add_Goto (Table.States (222), 199, 56);
+ Add_Goto (Table.States (222), 201, 57);
+ Add_Goto (Table.States (222), 251, 58);
+ Add_Goto (Table.States (222), 252, 59);
+ Add_Goto (Table.States (222), 255, 60);
+ Add_Goto (Table.States (222), 268, 68);
+ Add_Goto (Table.States (222), 311, 83);
+ Add_Goto (Table.States (222), 331, 438);
+ Table.States (222).Kernel := To_Vector ((0 => ((387, 0), 61, 2,
(32767, 0), 0)));
+ Table.States (222).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (223).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (223), 24, (335, 4), 277);
+ Add_Action (Table.States (223), 93, (335, 0), 278);
+ Add_Conflict (Table.States (223), 93, (136, 0), 1);
+ Add_Action (Table.States (223), 95, Reduce, (136, 0), 1);
+ Table.States (223).Kernel := To_Vector ((((136, 0), 116, 0,
(136, 0), 1), ((335, 0), 116, 9, (32767,
+ 0), 0), ((335, 1), 116, 7, (32767, 0), 0), ((335, 2), 116,
7, (32767, 0), 0), ((335, 3), 116, 5,
+ (32767, 0), 0), ((335, 4), 116, 5, (32767, 0), 0), ((335, 5),
116, 3, (32767, 0), 0), ((335, 6),
+ 116, 8, (32767, 0), 0), ((335, 7), 116, 6, (32767, 0), 0),
((336, 0), 116, 7, (32767, 0), 0),
+ ((336, 1), 116, 5, (32767, 0), 0)));
+ Table.States (223).Minimal_Complete_Actions := To_Vector
(((Reduce, (136, 0), 1), (Shift, (335, 4), 24,
+ 277)));
+ Table.States (224).Action_List.Set_Capacity (42);
+ Add_Action (Table.States (224), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (384,
+ 1), 2);
+ Table.States (224).Kernel := To_Vector ((0 => ((384, 1), 190, 0,
(384, 1), 2)));
+ Table.States (224).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (384, 1), 2)));
+ Table.States (225).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (225), 53, (294, 0), 307);
+ Add_Action (Table.States (225), 54, (293, 0), 308);
+ Table.States (225).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (225), 292, 309);
+ Add_Goto (Table.States (225), 293, 310);
+ Add_Goto (Table.States (225), 294, 311);
+ Table.States (225).Kernel := To_Vector ((((180, 0), 329, 7,
(32767, 0), 0), ((180, 1), 329, 5, (32767,
+ 0), 0), ((291, 0), 329, 5, (32767, 0), 0), ((291, 1), 329,
3, (32767, 0), 0), ((309, 0), 329, 10,
+ (32767, 0), 0), ((309, 1), 329, 8, (32767, 0), 0), ((320, 0),
329, 7, (32767, 0), 0), ((320, 1),
+ 329, 5, (32767, 0), 0), ((321, 0), 329, 10, (32767, 0), 0),
((321, 1), 329, 8, (32767, 0), 0),
+ ((338, 0), 329, 7, (32767, 0), 0), ((338, 1), 329, 5, (32767,
0), 0), ((389, 0), 329, 7, (32767,
+ 0), 0), ((389, 1), 329, 5, (32767, 0), 0), ((408, 2), 329,
8, (32767, 0), 0), ((408, 3), 329, 6,
+ (32767, 0), 0), ((408, 6), 329, 8, (32767, 0), 0), ((408, 7),
329, 6, (32767, 0), 0)));
+ Table.States (225).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (293, 0), 54, 308)));
+ Table.States (226).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (226), 86, (252, 0), 33);
+ Add_Action (Table.States (226), 90, (268, 0), 34);
+ Add_Action (Table.States (226), 116, (196, 0), 439);
+ Add_Action (Table.States (226), 117, (196, 1), 37);
+ Add_Action (Table.States (226), 118, (195, 6), 38);
+ Table.States (226).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (226), 195, 440);
+ Add_Goto (Table.States (226), 196, 148);
+ Add_Goto (Table.States (226), 197, 54);
+ Add_Goto (Table.States (226), 198, 55);
+ Add_Goto (Table.States (226), 199, 56);
+ Add_Goto (Table.States (226), 201, 57);
+ Add_Goto (Table.States (226), 251, 58);
+ Add_Goto (Table.States (226), 252, 59);
+ Add_Goto (Table.States (226), 255, 60);
+ Add_Goto (Table.States (226), 268, 68);
+ Add_Goto (Table.States (226), 311, 83);
+ Table.States (226).Kernel := To_Vector ((((326, 0), 26, 9,
(32767, 0), 0), ((326, 1), 26, 6, (32767,
+ 0), 0), ((326, 2), 26, 7, (32767, 0), 0), ((326, 3), 26, 4,
(32767, 0), 0), ((390, 0), 26, 6,
+ (32767, 0), 0), ((390, 1), 26, 4, (32767, 0), 0)));
+ Table.States (226).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 439)));
+ Table.States (227).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (227), 24, (337, 0), 441);
+ Add_Action (Table.States (227), 61, (434, 0), 299);
+ Add_Action (Table.States (227), 82, (325, 6), 442);
+ Add_Action (Table.States (227), 85, (198, 0), 281);
+ Add_Action (Table.States (227), 96, (197, 0), 283);
+ Add_Action (Table.States (227), 113, (121, 0), 285);
+ Add_Action (Table.States (227), 114, (121, 1), 286);
+ Table.States (227).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (227), 121, 287);
+ Add_Goto (Table.States (227), 313, 289);
+ Add_Goto (Table.States (227), 434, 443);
+ Table.States (227).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0), ((325, 0),
195, 11, (32767, 0), 0), ((325, 1),
+ 195, 8, (32767, 0), 0), ((325, 2), 195, 7, (32767, 0), 0),
((325, 3), 195, 8, (32767, 0), 0),
+ ((325, 4), 195, 5, (32767, 0), 0), ((325, 5), 195, 4, (32767,
0), 0), ((325, 6), 195, 9, (32767,
+ 0), 0), ((325, 7), 195, 6, (32767, 0), 0), ((325, 8), 195,
5, (32767, 0), 0), ((325, 9), 195, 6,
+ (32767, 0), 0), ((325, 10), 195, 3, (32767, 0), 0), ((325,
11), 195, 2, (32767, 0), 0), ((337, 0),
+ 195, 5, (32767, 0), 0), ((337, 1), 195, 3, (32767, 0), 0),
((408, 0), 195, 6, (32767, 0), 0),
+ ((408, 1), 195, 4, (32767, 0), 0)));
+ Table.States (227).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (325, 6), 82, 442)));
+ Table.States (228).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (228), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (316, 1), 2);
+ Table.States (228).Kernel := To_Vector ((0 => ((316, 1), 108, 0,
(316, 1), 2)));
+ Table.States (228).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (316, 1), 2)));
+ Table.States (229).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (229), 45, Reduce, (196, 0), 1);
+ Add_Action (Table.States (229), 47, Reduce, (196, 0), 1);
+ Add_Action (Table.States (229), 48, Reduce, (196, 0), 1);
+ Add_Action (Table.States (229), 49, Reduce, (196, 0), 1);
+ Add_Action (Table.States (229), 52, Reduce, (196, 0), 1);
+ Add_Action (Table.States (229), 73, Reduce, (196, 0), 1);
+ Add_Action (Table.States (229), 75, Reduce, (196, 0), 1);
+ Add_Action (Table.States (229), 85, Reduce, (196, 0), 1);
+ Add_Action (Table.States (229), 89, Reduce, (196, 0), 1);
+ Add_Action (Table.States (229), 93, (317, 0), 444);
+ Add_Action (Table.States (229), 96, Reduce, (196, 0), 1);
+ Add_Action (Table.States (229), 98, Reduce, (196, 0), 1);
+ Add_Action (Table.States (229), 100, Reduce, (196, 0), 1);
+ Add_Action (Table.States (229), 101, Reduce, (196, 0), 1);
+ Add_Action (Table.States (229), 103, Reduce, (196, 0), 1);
+ Add_Action (Table.States (229), 104, Reduce, (196, 0), 1);
+ Add_Action (Table.States (229), 106, Reduce, (196, 0), 1);
+ Add_Action (Table.States (229), 107, Reduce, (196, 0), 1);
+ Add_Action (Table.States (229), 108, Reduce, (196, 0), 1);
+ Add_Action (Table.States (229), 109, Reduce, (196, 0), 1);
+ Add_Action (Table.States (229), 110, Reduce, (196, 0), 1);
+ Add_Action (Table.States (229), 111, Reduce, (196, 0), 1);
+ Add_Action (Table.States (229), 112, Reduce, (196, 0), 1);
+ Add_Action (Table.States (229), 113, Reduce, (196, 0), 1);
+ Add_Action (Table.States (229), 114, Reduce, (196, 0), 1);
+ Table.States (229).Kernel := To_Vector ((((196, 0), 116, 0,
(196, 0), 1), ((317, 0), 116, 6, (32767,
+ 0), 0), ((317, 1), 116, 4, (32767, 0), 0), ((317, 2), 116,
5, (32767, 0), 0), ((317, 3), 116, 3,
+ (32767, 0), 0), ((317, 4), 116, 5, (32767, 0), 0), ((317, 5),
116, 3, (32767, 0), 0), ((317, 6),
+ 116, 4, (32767, 0), 0), ((317, 7), 116, 2, (32767, 0), 0)));
+ Table.States (229).Minimal_Complete_Actions := To_Vector
(((Reduce, (196, 0), 1), (Shift, (317, 0), 93,
+ 444)));
+ Table.States (230).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (230), 108, (316, 0), 445);
+ Table.States (230).Kernel := To_Vector ((0 => ((316, 0), 227, 1,
(32767, 0), 0)));
+ Table.States (230).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (316, 0), 108, 445)));
+ Table.States (231).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (231), 33, (318, 0), 446);
+ Add_Action (Table.States (231), 108, (318, 1), 447);
+ Table.States (231).Kernel := To_Vector ((((318, 0), 317, 6,
(32767, 0), 0), ((318, 1), 317, 1, (32767,
+ 0), 0)));
+ Table.States (231).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (318, 1), 108, 447)));
+ Table.States (232).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (232), 85, (198, 0), 281);
+ Add_Action (Table.States (232), 96, (197, 0), 283);
+ Add_Action (Table.States (232), 108, (290, 0), 448);
+ Add_Action (Table.States (232), 113, (121, 0), 285);
+ Add_Action (Table.States (232), 114, (121, 1), 286);
+ Table.States (232).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (232), 121, 287);
+ Add_Goto (Table.States (232), 313, 289);
+ Table.States (232).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((290, 0), 195, 1, (32767, 0), 0), ((311, 0),
195, 3, (32767, 0), 0)));
+ Table.States (232).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (290, 0), 108, 448)));
+ Table.States (233).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (233), 12, (402, 0), 165);
+ Add_Action (Table.States (233), 46, (233, 2), 167);
+ Add_Action (Table.States (233), 52, (233, 3), 168);
+ Add_Action (Table.States (233), 65, (234, 1), 169);
+ Add_Action (Table.States (233), 76, (256, 0), 170);
+ Add_Action (Table.States (233), 85, (205, 4), 171);
+ Add_Action (Table.States (233), 86, (213, 2), 172);
+ Add_Action (Table.States (233), 90, (268, 0), 34);
+ Add_Action (Table.States (233), 106, (237, 1), 173);
+ Add_Action (Table.States (233), 107, (237, 0), 174);
+ Add_Action (Table.States (233), 115, (234, 0), 175);
+ Add_Action (Table.States (233), 116, (196, 0), 146);
+ Add_Action (Table.States (233), 117, (196, 1), 37);
+ Add_Action (Table.States (233), 118, (195, 6), 38);
+ Table.States (233).Goto_List.Set_Capacity (32);
+ Add_Goto (Table.States (233), 195, 176);
+ Add_Goto (Table.States (233), 196, 148);
+ Add_Goto (Table.States (233), 197, 54);
+ Add_Goto (Table.States (233), 198, 55);
+ Add_Goto (Table.States (233), 199, 56);
+ Add_Goto (Table.States (233), 201, 57);
+ Add_Goto (Table.States (233), 205, 177);
+ Add_Goto (Table.States (233), 206, 178);
+ Add_Goto (Table.States (233), 210, 179);
+ Add_Goto (Table.States (233), 211, 180);
+ Add_Goto (Table.States (233), 213, 181);
+ Add_Goto (Table.States (233), 214, 182);
+ Add_Goto (Table.States (233), 215, 183);
+ Add_Goto (Table.States (233), 218, 184);
+ Add_Goto (Table.States (233), 219, 185);
+ Add_Goto (Table.States (233), 220, 186);
+ Add_Goto (Table.States (233), 227, 236);
+ Add_Goto (Table.States (233), 228, 188);
+ Add_Goto (Table.States (233), 231, 189);
+ Add_Goto (Table.States (233), 232, 190);
+ Add_Goto (Table.States (233), 233, 191);
+ Add_Goto (Table.States (233), 234, 192);
+ Add_Goto (Table.States (233), 237, 193);
+ Add_Goto (Table.States (233), 243, 449);
+ Add_Goto (Table.States (233), 251, 58);
+ Add_Goto (Table.States (233), 252, 59);
+ Add_Goto (Table.States (233), 255, 60);
+ Add_Goto (Table.States (233), 256, 194);
+ Add_Goto (Table.States (233), 268, 68);
+ Add_Goto (Table.States (233), 311, 83);
+ Add_Goto (Table.States (233), 402, 195);
+ Add_Goto (Table.States (233), 465, 196);
+ Table.States (233).Kernel := To_Vector ((0 => ((289, 2), 63, 2,
(32767, 0), 0)));
+ Table.States (233).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (234).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (234), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (289, 3), 2);
+ Table.States (234).Kernel := To_Vector ((0 => ((289, 3), 108, 0,
(289, 3), 2)));
+ Table.States (234).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (289, 3), 2)));
+ Table.States (235).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (235), 63, (289, 0), 450);
+ Add_Action (Table.States (235), 85, (198, 0), 281);
+ Add_Action (Table.States (235), 96, (197, 0), 283);
+ Add_Action (Table.States (235), 108, (289, 1), 451);
+ Add_Action (Table.States (235), 113, (121, 0), 285);
+ Add_Action (Table.States (235), 114, (121, 1), 286);
+ Table.States (235).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (235), 121, 287);
+ Add_Goto (Table.States (235), 313, 289);
+ Table.States (235).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((289, 0), 195, 3, (32767, 0), 0), ((289, 1),
195, 1, (32767, 0), 0), ((311, 0),
+ 195, 3, (32767, 0), 0)));
+ Table.States (235).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (289, 1), 108, 451)));
+ Table.States (236).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (236), (36, 43, 50, 82, 99, 108), (243,
0), 1);
+ Table.States (236).Kernel := To_Vector ((0 => ((243, 0), 227, 0,
(243, 0), 1)));
+ Table.States (236).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (243, 0), 1)));
+ Table.States (237).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (237), (1 => 36), (276, 0), 2);
+ Table.States (237).Kernel := To_Vector ((0 => ((276, 0), 243, 0,
(276, 0), 2)));
+ Table.States (237).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (276, 0), 2)));
+ Table.States (238).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (238), 12, (401, 0), 1);
+ Add_Action (Table.States (238), 15, (370, 0), 3);
+ Add_Action (Table.States (238), 17, (365, 0), 4);
+ Add_Action (Table.States (238), 18, (382, 0), 5);
+ Add_Action (Table.States (238), 19, (363, 0), 6);
+ Add_Action (Table.States (238), 20, (357, 0), 7);
+ Add_Action (Table.States (238), 30, (316, 0), 13);
+ Add_Action (Table.States (238), 31, (290, 0), 14);
+ Add_Action (Table.States (238), 32, (289, 0), 15);
+ Add_Action (Table.States (238), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (238), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (238), 37, (288, 0), 17);
+ Add_Conflict (Table.States (238), 37, (285, 1), 0);
+ Add_Action (Table.States (238), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (238), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (238), 42, (271, 0), 18);
+ Add_Action (Table.States (238), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (238), 64, (273, 0), 27);
+ Add_Action (Table.States (238), 65, (264, 0), 28);
+ Add_Action (Table.States (238), 84, (124, 0), 32);
+ Add_Action (Table.States (238), 86, (252, 0), 33);
+ Add_Action (Table.States (238), 90, (268, 0), 34);
+ Add_Action (Table.States (238), 105, (265, 0), 35);
+ Add_Action (Table.States (238), 116, (196, 0), 146);
+ Add_Action (Table.States (238), 117, (196, 1), 37);
+ Add_Action (Table.States (238), 118, (195, 6), 38);
+ Table.States (238).Goto_List.Set_Capacity (46);
+ Add_Goto (Table.States (238), 124, 39);
+ Add_Goto (Table.States (238), 195, 52);
+ Add_Goto (Table.States (238), 196, 53);
+ Add_Goto (Table.States (238), 197, 54);
+ Add_Goto (Table.States (238), 198, 55);
+ Add_Goto (Table.States (238), 199, 56);
+ Add_Goto (Table.States (238), 201, 57);
+ Add_Goto (Table.States (238), 251, 58);
+ Add_Goto (Table.States (238), 252, 59);
+ Add_Goto (Table.States (238), 255, 60);
+ Add_Goto (Table.States (238), 259, 452);
+ Add_Goto (Table.States (238), 261, 331);
+ Add_Goto (Table.States (238), 262, 62);
+ Add_Goto (Table.States (238), 263, 63);
+ Add_Goto (Table.States (238), 264, 64);
+ Add_Goto (Table.States (238), 265, 65);
+ Add_Goto (Table.States (238), 266, 66);
+ Add_Goto (Table.States (238), 267, 67);
+ Add_Goto (Table.States (238), 268, 68);
+ Add_Goto (Table.States (238), 271, 69);
+ Add_Goto (Table.States (238), 273, 70);
+ Add_Goto (Table.States (238), 275, 71);
+ Add_Goto (Table.States (238), 285, 72);
+ Add_Goto (Table.States (238), 286, 73);
+ Add_Goto (Table.States (238), 288, 74);
+ Add_Goto (Table.States (238), 289, 75);
+ Add_Goto (Table.States (238), 290, 76);
+ Add_Goto (Table.States (238), 310, 82);
+ Add_Goto (Table.States (238), 311, 83);
+ Add_Goto (Table.States (238), 316, 84);
+ Add_Goto (Table.States (238), 318, 85);
+ Add_Goto (Table.States (238), 357, 110);
+ Add_Goto (Table.States (238), 363, 111);
+ Add_Goto (Table.States (238), 364, 112);
+ Add_Goto (Table.States (238), 365, 113);
+ Add_Goto (Table.States (238), 366, 114);
+ Add_Goto (Table.States (238), 367, 115);
+ Add_Goto (Table.States (238), 370, 116);
+ Add_Goto (Table.States (238), 376, 117);
+ Add_Goto (Table.States (238), 378, 118);
+ Add_Goto (Table.States (238), 379, 119);
+ Add_Goto (Table.States (238), 382, 120);
+ Add_Goto (Table.States (238), 396, 453);
+ Add_Goto (Table.States (238), 401, 133);
+ Add_Goto (Table.States (238), 461, 332);
+ Add_Goto (Table.States (238), 462, 144);
+ Table.States (238).Kernel := To_Vector ((0 => ((288, 0), 33, 8,
(32767, 0), 0)));
+ Table.States (238).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ Table.States (239).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (239), 85, (283, 1), 246);
+ Add_Action (Table.States (239), 116, (278, 0), 454);
+ Table.States (239).Goto_List.Set_Capacity (5);
+ Add_Goto (Table.States (239), 278, 455);
+ Add_Goto (Table.States (239), 280, 456);
+ Add_Goto (Table.States (239), 282, 457);
+ Add_Goto (Table.States (239), 283, 253);
+ Add_Goto (Table.States (239), 299, 254);
+ Table.States (239).Kernel := To_Vector ((((276, 3), 51, 8,
(32767, 0), 0), ((276, 6), 51, 3, (32767,
+ 0), 0), ((276, 8), 51, 3, (32767, 0), 0)));
+ Table.States (239).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (278, 0), 116, 454)));
+ Table.States (240).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (240), 46, (233, 2), 167);
+ Add_Action (Table.States (240), 52, (233, 3), 168);
+ Add_Action (Table.States (240), 65, (234, 1), 169);
+ Add_Action (Table.States (240), 76, (256, 0), 170);
+ Add_Action (Table.States (240), 85, (205, 4), 171);
+ Add_Action (Table.States (240), 86, (213, 2), 172);
+ Add_Action (Table.States (240), 90, (268, 0), 34);
+ Add_Action (Table.States (240), 106, (237, 1), 173);
+ Add_Action (Table.States (240), 107, (237, 0), 174);
+ Add_Action (Table.States (240), 115, (234, 0), 175);
+ Add_Action (Table.States (240), 116, (196, 0), 458);
+ Add_Action (Table.States (240), 117, (196, 1), 37);
+ Add_Action (Table.States (240), 118, (195, 6), 38);
+ Table.States (240).Goto_List.Set_Capacity (29);
+ Add_Goto (Table.States (240), 195, 176);
+ Add_Goto (Table.States (240), 196, 148);
+ Add_Goto (Table.States (240), 197, 54);
+ Add_Goto (Table.States (240), 198, 55);
+ Add_Goto (Table.States (240), 199, 56);
+ Add_Goto (Table.States (240), 201, 57);
+ Add_Goto (Table.States (240), 205, 177);
+ Add_Goto (Table.States (240), 206, 178);
+ Add_Goto (Table.States (240), 210, 179);
+ Add_Goto (Table.States (240), 211, 180);
+ Add_Goto (Table.States (240), 213, 181);
+ Add_Goto (Table.States (240), 214, 182);
+ Add_Goto (Table.States (240), 215, 183);
+ Add_Goto (Table.States (240), 218, 184);
+ Add_Goto (Table.States (240), 219, 185);
+ Add_Goto (Table.States (240), 220, 186);
+ Add_Goto (Table.States (240), 231, 459);
+ Add_Goto (Table.States (240), 232, 190);
+ Add_Goto (Table.States (240), 233, 191);
+ Add_Goto (Table.States (240), 234, 192);
+ Add_Goto (Table.States (240), 237, 193);
+ Add_Goto (Table.States (240), 251, 58);
+ Add_Goto (Table.States (240), 252, 59);
+ Add_Goto (Table.States (240), 255, 60);
+ Add_Goto (Table.States (240), 256, 194);
+ Add_Goto (Table.States (240), 268, 68);
+ Add_Goto (Table.States (240), 277, 460);
+ Add_Goto (Table.States (240), 311, 83);
+ Add_Goto (Table.States (240), 465, 196);
+ Table.States (240).Kernel := To_Vector ((((276, 5), 85, 6,
(32767, 0), 0), ((276, 7), 85, 6, (32767,
+ 0), 0)));
+ Table.States (240).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ end Subr_9;
+ procedure Subr_10
+ is begin
+ Table.States (241).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (241), 43, (271, 0), 461);
+ Table.States (241).Kernel := To_Vector ((((271, 0), 243, 14,
(32767, 0), 0), ((271, 1), 243, 11,
+ (32767, 0), 0), ((271, 2), 243, 9, (32767, 0), 0), ((271, 3),
243, 6, (32767, 0), 0)));
+ Table.States (241).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (271, 0), 43, 461)));
+ Table.States (242).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (242), 83, (333, 0), 462);
+ Table.States (242).Kernel := To_Vector ((0 => ((333, 0), 55, 3,
(32767, 0), 0)));
+ Table.States (242).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (333, 0), 83, 462)));
+ Table.States (243).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (243), 86, (252, 0), 33);
+ Add_Action (Table.States (243), 90, (268, 0), 34);
+ Add_Action (Table.States (243), 116, (196, 0), 146);
+ Add_Action (Table.States (243), 117, (196, 1), 37);
+ Add_Action (Table.States (243), 118, (195, 6), 38);
+ Table.States (243).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (243), 195, 244);
+ Add_Goto (Table.States (243), 196, 148);
+ Add_Goto (Table.States (243), 197, 54);
+ Add_Goto (Table.States (243), 198, 55);
+ Add_Goto (Table.States (243), 199, 56);
+ Add_Goto (Table.States (243), 201, 57);
+ Add_Goto (Table.States (243), 251, 58);
+ Add_Goto (Table.States (243), 252, 59);
+ Add_Goto (Table.States (243), 255, 60);
+ Add_Goto (Table.States (243), 268, 68);
+ Add_Goto (Table.States (243), 311, 83);
+ Add_Goto (Table.States (243), 331, 463);
+ Table.States (243).Kernel := To_Vector ((0 => ((333, 1), 83, 2,
(32767, 0), 0)));
+ Table.States (243).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (244).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (244), 85, (198, 0), 281);
+ Add_Action (Table.States (244), 95, Reduce, (331, 0), 1);
+ Add_Action (Table.States (244), 96, (197, 0), 283);
+ Add_Action (Table.States (244), 108, Reduce, (331, 0), 1);
+ Add_Action (Table.States (244), 113, (121, 0), 285);
+ Add_Action (Table.States (244), 114, (121, 1), 286);
+ Table.States (244).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (244), 121, 287);
+ Add_Goto (Table.States (244), 313, 289);
+ Table.States (244).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0), ((331, 0),
195, 0, (331, 0), 1)));
+ Table.States (244).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (331, 0), 1)));
+ Table.States (245).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (245), 95, (331, 1), 464);
+ Add_Action (Table.States (245), 108, (332, 0), 465);
+ Table.States (245).Kernel := To_Vector ((((331, 1), 331, 2,
(32767, 0), 0), ((332, 0), 331, 1, (32767,
+ 0), 0)));
+ Table.States (245).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (332, 0), 108, 465)));
+ Table.States (246).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (246), 116, (136, 0), 207);
+ Table.States (246).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (246), 136, 466);
+ Add_Goto (Table.States (246), 298, 467);
+ Add_Goto (Table.States (246), 300, 468);
+ Table.States (246).Kernel := To_Vector ((((283, 1), 85, 2,
(32767, 0), 0), ((299, 0), 85, 4, (32767,
+ 0), 0)));
+ Table.States (246).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (136, 0), 116, 207)));
+ Table.States (247).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (247), 47, (278, 0), 469);
+ Add_Action (Table.States (247), 50, Reduce, (196, 0), 1);
+ Add_Action (Table.States (247), 69, (280, 12), 470);
+ Add_Action (Table.States (247), 85, Reduce, (196, 0), 1);
+ Add_Action (Table.States (247), 93, (280, 0), 471);
+ Add_Action (Table.States (247), 96, Reduce, (196, 0), 1);
+ Add_Action (Table.States (247), 113, Reduce, (196, 0), 1);
+ Add_Action (Table.States (247), 114, Reduce, (196, 0), 1);
+ Table.States (247).Kernel := To_Vector ((((196, 0), 116, 0,
(196, 0), 1), ((278, 0), 116, 5, (32767,
+ 0), 0), ((278, 1), 116, 3, (32767, 0), 0), ((278, 2), 116,
4, (32767, 0), 0), ((278, 3), 116, 2,
+ (32767, 0), 0), ((280, 0), 116, 7, (32767, 0), 0), ((280, 1),
116, 5, (32767, 0), 0), ((280, 2),
+ 116, 6, (32767, 0), 0), ((280, 3), 116, 4, (32767, 0), 0),
((280, 4), 116, 5, (32767, 0), 0),
+ ((280, 5), 116, 3, (32767, 0), 0), ((280, 6), 116, 4, (32767,
0), 0), ((280, 7), 116, 2, (32767,
+ 0), 0), ((280, 8), 116, 7, (32767, 0), 0), ((280, 9), 116,
5, (32767, 0), 0), ((280, 10), 116, 6,
+ (32767, 0), 0), ((280, 11), 116, 4, (32767, 0), 0), ((280,
12), 116, 5, (32767, 0), 0), ((280, 13),
+ 116, 3, (32767, 0), 0), ((280, 14), 116, 4, (32767, 0), 0),
((280, 15), 116, 2, (32767, 0), 0)));
+ Table.States (247).Minimal_Complete_Actions := To_Vector
(((Reduce, (196, 0), 1), (Shift, (278, 0), 47,
+ 469), (Shift, (280, 12), 69, 470)));
+ Table.States (248).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (248), 50, (438, 0), 472);
+ Add_Action (Table.States (248), 85, (198, 0), 281);
+ Add_Action (Table.States (248), 96, (197, 0), 283);
+ Add_Action (Table.States (248), 113, (121, 0), 285);
+ Add_Action (Table.States (248), 114, (121, 1), 286);
+ Table.States (248).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (248), 121, 473);
+ Add_Goto (Table.States (248), 313, 289);
+ Table.States (248).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0), ((437, 0),
195, 5, (32767, 0), 0), ((438, 0),
+ 195, 4, (32767, 0), 0), ((440, 0), 195, 18, (32767, 0), 0),
((440, 1), 195, 17, (32767, 0), 0),
+ ((440, 2), 195, 10, (32767, 0), 0), ((440, 3), 195, 9,
(32767, 0), 0), ((440, 4), 195, 14, (32767,
+ 0), 0), ((440, 5), 195, 13, (32767, 0), 0), ((440, 6), 195,
6, (32767, 0), 0), ((440, 7), 195, 5,
+ (32767, 0), 0)));
+ Table.States (248).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (438, 0), 50, 472)));
+ Table.States (249).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (249), 50, (454, 0), 474);
+ Add_Conflict (Table.States (249), 50, (195, 0), 1);
+ Add_Action (Table.States (249), 85, Reduce, (195, 0), 1);
+ Add_Action (Table.States (249), 96, Reduce, (195, 0), 1);
+ Add_Action (Table.States (249), 113, Reduce, (195, 0), 1);
+ Add_Action (Table.States (249), 114, Reduce, (195, 0), 1);
+ Table.States (249).Kernel := To_Vector ((((195, 0), 196, 0,
(195, 0), 1), ((454, 0), 196, 4, (32767,
+ 0), 0)));
+ Table.States (249).Minimal_Complete_Actions := To_Vector
(((Reduce, (195, 0), 1), (Shift, (454, 0), 50,
+ 474)));
+ Table.States (250).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (250), (1 => 36), (276, 1), 2);
+ Table.States (250).Kernel := To_Vector ((0 => ((276, 1), 278, 0,
(276, 1), 2)));
+ Table.States (250).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (276, 1), 2)));
+ Table.States (251).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (251), (1 => 36), (276, 2), 2);
+ Table.States (251).Kernel := To_Vector ((0 => ((276, 2), 280, 0,
(276, 2), 2)));
+ Table.States (251).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (276, 2), 2)));
+ Table.States (252).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (252), (1 => 36), (276, 4), 2);
+ Table.States (252).Kernel := To_Vector ((0 => ((276, 4), 282, 0,
(276, 4), 2)));
+ Table.States (252).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (276, 4), 2)));
+ Table.States (253).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (253), 69, (282, 0), 475);
+ Table.States (253).Kernel := To_Vector ((((282, 0), 283, 7,
(32767, 0), 0), ((282, 1), 283, 5, (32767,
+ 0), 0)));
+ Table.States (253).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (282, 0), 69, 475)));
+ Table.States (254).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (254), (1 => 69), (283, 0), 1);
+ Table.States (254).Kernel := To_Vector ((0 => ((283, 0), 299, 0,
(283, 0), 1)));
+ Table.States (254).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (283, 0), 1)));
+ Table.States (255).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (255), (21, 53, 54), (329, 0), 2);
+ Table.States (255).Kernel := To_Vector ((0 => ((329, 0), 25, 0,
(329, 0), 2)));
+ Table.States (255).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (329, 0), 2)));
+ Table.States (256).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (256), 30, (296, 0), 476);
+ Add_Action (Table.States (256), 82, (408, 8), 477);
+ Add_Action (Table.States (256), 85, (198, 0), 478);
+ Add_Action (Table.States (256), 96, (197, 0), 283);
+ Add_Action (Table.States (256), 113, (121, 0), 285);
+ Add_Action (Table.States (256), 114, (121, 1), 286);
+ Table.States (256).Goto_List.Set_Capacity (5);
+ Add_Goto (Table.States (256), 121, 287);
+ Add_Goto (Table.States (256), 296, 479);
+ Add_Goto (Table.States (256), 297, 480);
+ Add_Goto (Table.States (256), 299, 481);
+ Add_Goto (Table.States (256), 313, 289);
+ Table.States (256).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((294, 0), 195, 2, (32767, 0), 0), ((311, 0),
195, 3, (32767, 0), 0), ((408, 8),
+ 195, 6, (32767, 0), 0), ((408, 9), 195, 4, (32767, 0), 0)));
+ Table.States (256).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (296, 0), 30, 476)));
+ Table.States (257).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (257), 24, Reduce, (295, 1), 0);
+ Add_Action (Table.States (257), 61, Reduce, (295, 1), 0);
+ Add_Action (Table.States (257), 82, (408, 4), 482);
+ Add_Conflict (Table.States (257), 82, (295, 1), 0);
+ Add_Action (Table.States (257), 85, (198, 0), 478);
+ Add_Action (Table.States (257), 96, (197, 0), 283);
+ Add_Action (Table.States (257), 108, Reduce, (295, 1), 0);
+ Add_Action (Table.States (257), 113, (121, 0), 285);
+ Add_Action (Table.States (257), 114, (121, 1), 286);
+ Table.States (257).Goto_List.Set_Capacity (4);
+ Add_Goto (Table.States (257), 121, 287);
+ Add_Goto (Table.States (257), 295, 483);
+ Add_Goto (Table.States (257), 299, 426);
+ Add_Goto (Table.States (257), 313, 289);
+ Table.States (257).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((293, 0), 195, 0, (295, 1), 0), ((311, 0),
195, 3, (32767, 0), 0), ((408, 4), 195,
+ 6, (32767, 0), 0), ((408, 5), 195, 4, (32767, 0), 0)));
+ Table.States (257).Minimal_Complete_Actions := To_Vector
(((Reduce, (295, 1), 0), (Shift, (408, 4), 82,
+ 482)));
+ Table.States (258).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (258), 116, (354, 0), 484);
+ Table.States (258).Kernel := To_Vector ((((354, 0), 26, 9,
(32767, 0), 0), ((354, 1), 26, 6, (32767,
+ 0), 0), ((354, 2), 26, 7, (32767, 0), 0), ((354, 3), 26, 4,
(32767, 0), 0), ((392, 0), 26, 6,
+ (32767, 0), 0), ((392, 1), 26, 4, (32767, 0), 0)));
+ Table.States (258).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (354, 0), 116, 484)));
+ Table.States (259).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (259), 116, (346, 0), 485);
+ Table.States (259).Kernel := To_Vector ((((346, 0), 83, 14,
(32767, 0), 0), ((346, 1), 83, 11, (32767,
+ 0), 0), ((346, 2), 83, 12, (32767, 0), 0), ((346, 3), 83, 9,
(32767, 0), 0), ((346, 4), 83, 9,
+ (32767, 0), 0), ((346, 5), 83, 6, (32767, 0), 0), ((346, 6),
83, 7, (32767, 0), 0), ((346, 7), 83,
+ 4, (32767, 0), 0)));
+ Table.States (259).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (346, 0), 116, 485)));
+ Table.States (260).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (260), 61, (434, 0), 299);
+ Add_Action (Table.States (260), 82, (347, 2), 486);
+ Table.States (260).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (260), 434, 487);
+ Table.States (260).Kernel := To_Vector ((((347, 0), 116, 8,
(32767, 0), 0), ((347, 1), 116, 5, (32767,
+ 0), 0), ((347, 2), 116, 6, (32767, 0), 0), ((347, 3), 116,
3, (32767, 0), 0)));
+ Table.States (260).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (347, 2), 82, 486)));
+ Table.States (261).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (261), 116, (345, 0), 488);
+ Table.States (261).Kernel := To_Vector ((((345, 0), 26, 9,
(32767, 0), 0), ((345, 1), 26, 7, (32767,
+ 0), 0), ((391, 0), 26, 6, (32767, 0), 0), ((391, 1), 26, 4,
(32767, 0), 0)));
+ Table.States (261).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (345, 0), 116, 488)));
+ Table.States (262).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (262), 116, (340, 0), 489);
+ Table.States (262).Kernel := To_Vector ((((340, 0), 83, 17,
(32767, 0), 0), ((340, 1), 83, 14, (32767,
+ 0), 0), ((340, 2), 83, 9, (32767, 0), 0), ((340, 3), 83, 15,
(32767, 0), 0), ((340, 4), 83, 12,
+ (32767, 0), 0), ((340, 5), 83, 7, (32767, 0), 0), ((340, 6),
83, 12, (32767, 0), 0), ((340, 7), 83,
+ 9, (32767, 0), 0), ((340, 8), 83, 4, (32767, 0), 0), ((340,
9), 83, 10, (32767, 0), 0), ((340, 10),
+ 83, 7, (32767, 0), 0), ((340, 11), 83, 2, (32767, 0), 0)));
+ Table.States (262).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (340, 0), 116, 489)));
+ Table.States (263).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (263), 61, (434, 0), 299);
+ Add_Action (Table.States (263), 82, (341, 3), 490);
+ Add_Action (Table.States (263), 108, (341, 5), 491);
+ Table.States (263).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (263), 434, 492);
+ Table.States (263).Kernel := To_Vector ((((341, 0), 116, 11,
(32767, 0), 0), ((341, 1), 116, 8,
+ (32767, 0), 0), ((341, 2), 116, 3, (32767, 0), 0), ((341, 3),
116, 9, (32767, 0), 0), ((341, 4),
+ 116, 6, (32767, 0), 0), ((341, 5), 116, 1, (32767, 0), 0)));
+ Table.States (263).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (341, 5), 108, 491)));
+ Table.States (264).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (264), 95, (331, 1), 464);
+ Add_Action (Table.States (264), 108, (387, 1), 493);
+ Table.States (264).Kernel := To_Vector ((((331, 1), 331, 2,
(32767, 0), 0), ((387, 1), 331, 1, (32767,
+ 0), 0)));
+ Table.States (264).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (387, 1), 108, 493)));
+ Table.States (265).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (265), 82, (273, 0), 494);
+ Table.States (265).Kernel := To_Vector ((0 => ((273, 0), 227, 9,
(32767, 0), 0)));
+ Table.States (265).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (273, 0), 82, 494)));
+ Table.States (266).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (266), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (264, 0), 2);
+ Table.States (266).Kernel := To_Vector ((0 => ((264, 0), 108, 0,
(264, 0), 2)));
+ Table.States (266).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (264, 0), 2)));
+ Table.States (267).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (267), 61, (386, 0), 495);
+ Table.States (267).Kernel := To_Vector ((0 => ((386, 0), 27, 3,
(32767, 0), 0)));
+ Table.States (267).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (386, 0), 61, 495)));
+ Table.States (268).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (268), 86, (252, 0), 33);
+ Add_Action (Table.States (268), 90, (268, 0), 34);
+ Add_Action (Table.States (268), 116, (196, 0), 146);
+ Add_Action (Table.States (268), 117, (196, 1), 37);
+ Add_Action (Table.States (268), 118, (195, 6), 38);
+ Table.States (268).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (268), 195, 244);
+ Add_Goto (Table.States (268), 196, 148);
+ Add_Goto (Table.States (268), 197, 54);
+ Add_Goto (Table.States (268), 198, 55);
+ Add_Goto (Table.States (268), 199, 56);
+ Add_Goto (Table.States (268), 201, 57);
+ Add_Goto (Table.States (268), 251, 58);
+ Add_Goto (Table.States (268), 252, 59);
+ Add_Goto (Table.States (268), 255, 60);
+ Add_Goto (Table.States (268), 268, 68);
+ Add_Goto (Table.States (268), 311, 83);
+ Add_Goto (Table.States (268), 331, 496);
+ Table.States (268).Kernel := To_Vector ((0 => ((386, 1), 61, 2,
(32767, 0), 0)));
+ Table.States (268).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (269).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (269), 82, (130, 0), 497);
+ Table.States (269).Kernel := To_Vector ((((130, 0), 116, 5,
(32767, 0), 0), ((130, 1), 116, 3, (32767,
+ 0), 0)));
+ Table.States (269).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (130, 0), 82, 497)));
+ Table.States (270).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (270), 82, (128, 2), 498);
+ Add_Action (Table.States (270), 85, (165, 0), 499);
+ Add_Action (Table.States (270), 108, (189, 3), 500);
+ Table.States (270).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (270), 164, 501);
+ Add_Goto (Table.States (270), 165, 502);
+ Add_Goto (Table.States (270), 167, 503);
+ Table.States (270).Kernel := To_Vector ((((128, 0), 116, 10,
(32767, 0), 0), ((128, 1), 116, 8,
+ (32767, 0), 0), ((128, 2), 116, 5, (32767, 0), 0), ((128, 3),
116, 3, (32767, 0), 0), ((189, 0),
+ 116, 6, (32767, 0), 0), ((189, 1), 116, 4, (32767, 0), 0),
((189, 2), 116, 3, (32767, 0), 0),
+ ((189, 3), 116, 1, (32767, 0), 0), ((327, 0), 116, 11,
(32767, 0), 0), ((327, 1), 116, 9, (32767,
+ 0), 0), ((327, 2), 116, 10, (32767, 0), 0), ((327, 3), 116,
8, (32767, 0), 0), ((327, 4), 116, 10,
+ (32767, 0), 0), ((327, 5), 116, 8, (32767, 0), 0), ((327, 6),
116, 9, (32767, 0), 0), ((327, 7),
+ 116, 7, (32767, 0), 0), ((327, 8), 116, 9, (32767, 0), 0),
((327, 9), 116, 7, (32767, 0), 0),
+ ((327, 10), 116, 8, (32767, 0), 0), ((327, 11), 116, 6,
(32767, 0), 0), ((327, 12), 116, 8, (32767,
+ 0), 0), ((327, 13), 116, 6, (32767, 0), 0), ((327, 14), 116,
7, (32767, 0), 0), ((327, 15), 116,
+ 5, (32767, 0), 0), ((327, 16), 116, 7, (32767, 0), 0), ((327,
17), 116, 5, (32767, 0), 0), ((327,
+ 18), 116, 6, (32767, 0), 0), ((327, 19), 116, 4, (32767, 0),
0), ((327, 20), 116, 6, (32767, 0),
+ 0), ((327, 21), 116, 4, (32767, 0), 0), ((327, 22), 116, 5,
(32767, 0), 0), ((327, 23), 116, 3,
+ (32767, 0), 0), ((328, 0), 116, 15, (32767, 0), 0), ((328, 1),
116, 13, (32767, 0), 0), ((328, 2),
+ 116, 13, (32767, 0), 0), ((328, 3), 116, 11, (32767, 0), 0),
((328, 4), 116, 15, (32767, 0), 0),
+ ((328, 5), 116, 13, (32767, 0), 0), ((328, 6), 116, 13,
(32767, 0), 0), ((328, 7), 116, 11, (32767,
+ 0), 0), ((328, 8), 116, 14, (32767, 0), 0), ((328, 9), 116,
12, (32767, 0), 0), ((328, 10), 116,
+ 12, (32767, 0), 0), ((328, 11), 116, 10, (32767, 0), 0),
((328, 12), 116, 14, (32767, 0), 0), ((328,
+ 13), 116, 12, (32767, 0), 0), ((328, 14), 116, 12, (32767,
0), 0), ((328, 15), 116, 10, (32767, 0),
+ 0), ((328, 16), 116, 14, (32767, 0), 0), ((328, 17), 116,
12, (32767, 0), 0), ((328, 18), 116, 12,
+ (32767, 0), 0), ((328, 19), 116, 10, (32767, 0), 0), ((328,
20), 116, 13, (32767, 0), 0), ((328,
+ 21), 116, 11, (32767, 0), 0), ((328, 22), 116, 11, (32767,
0), 0), ((328, 23), 116, 9, (32767, 0),
+ 0), ((328, 24), 116, 12, (32767, 0), 0), ((328, 25), 116, 10,
(32767, 0), 0), ((328, 26), 116, 10,
+ (32767, 0), 0), ((328, 27), 116, 8, (32767, 0), 0), ((328,
28), 116, 12, (32767, 0), 0), ((328, 29),
+ 116, 10, (32767, 0), 0), ((328, 30), 116, 10, (32767, 0),
0), ((328, 31), 116, 8, (32767, 0), 0),
+ ((328, 32), 116, 11, (32767, 0), 0), ((328, 33), 116, 9,
(32767, 0), 0), ((328, 34), 116, 9,
+ (32767, 0), 0), ((328, 35), 116, 7, (32767, 0), 0), ((328,
36), 116, 11, (32767, 0), 0), ((328, 37),
+ 116, 9, (32767, 0), 0), ((328, 38), 116, 9, (32767, 0), 0),
((328, 39), 116, 7, (32767, 0), 0),
+ ((328, 40), 116, 11, (32767, 0), 0), ((328, 41), 116, 9,
(32767, 0), 0), ((328, 42), 116, 9,
+ (32767, 0), 0), ((328, 43), 116, 7, (32767, 0), 0), ((328,
44), 116, 10, (32767, 0), 0), ((328, 45),
+ 116, 8, (32767, 0), 0), ((328, 46), 116, 8, (32767, 0), 0),
((328, 47), 116, 6, (32767, 0), 0)));
+ Table.States (270).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (189, 3), 108, 500)));
+ Table.States (271).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (271), 85, (124, 0), 504);
+ Add_Action (Table.States (271), 108, (124, 1), 505);
+ Table.States (271).Kernel := To_Vector ((((124, 0), 116, 4,
(32767, 0), 0), ((124, 1), 116, 1, (32767,
+ 0), 0), ((124, 2), 116, 7, (32767, 0), 0), ((124, 3), 116,
1, (32767, 0), 0)));
+ Table.States (271).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (124, 1), 108, 505)));
+ Table.States (272).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (272), 51, (221, 0), 273);
+ Add_Action (Table.States (272), 85, (252, 0), 506);
+ Table.States (272).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (272), 221, 507);
+ Table.States (272).Kernel := To_Vector ((((252, 0), 37, 10,
(32767, 0), 0), ((252, 1), 37, 7, (32767,
+ 0), 0)));
+ Table.States (272).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (221, 0), 51, 273)));
+ Table.States (273).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (273), 116, (278, 0), 454);
+ Table.States (273).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (273), 278, 508);
+ Add_Goto (Table.States (273), 280, 509);
+ Table.States (273).Kernel := To_Vector ((((221, 0), 51, 7,
(32767, 0), 0), ((221, 1), 51, 5, (32767,
+ 0), 0), ((221, 2), 51, 7, (32767, 0), 0), ((221, 3), 51, 5,
(32767, 0), 0)));
+ Table.States (273).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (278, 0), 116, 454)));
+ Table.States (274).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (274), 88, (252, 2), 510);
+ Table.States (274).Kernel := To_Vector ((0 => ((252, 2), 221, 1,
(32767, 0), 0)));
+ Table.States (274).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (252, 2), 88, 510)));
+ Table.States (275).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (275), (1 => 102), (266, 0), 1);
+ Table.States (275).Kernel := To_Vector ((0 => ((266, 0), 196, 0,
(266, 0), 1)));
+ Table.States (275).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (266, 0), 1)));
+ Table.States (276).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (276), 102, (265, 0), 511);
+ Table.States (276).Kernel := To_Vector ((0 => ((265, 0), 266, 1,
(32767, 0), 0)));
+ Table.States (276).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (265, 0), 102, 511)));
+ Table.States (277).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (277), 86, (252, 0), 33);
+ Add_Action (Table.States (277), 90, (268, 0), 34);
+ Add_Action (Table.States (277), 116, (196, 0), 146);
+ Add_Action (Table.States (277), 117, (196, 1), 37);
+ Add_Action (Table.States (277), 118, (195, 6), 38);
+ Table.States (277).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (277), 195, 512);
+ Add_Goto (Table.States (277), 196, 148);
+ Add_Goto (Table.States (277), 197, 54);
+ Add_Goto (Table.States (277), 198, 55);
+ Add_Goto (Table.States (277), 199, 56);
+ Add_Goto (Table.States (277), 201, 57);
+ Add_Goto (Table.States (277), 251, 58);
+ Add_Goto (Table.States (277), 252, 59);
+ Add_Goto (Table.States (277), 255, 60);
+ Add_Goto (Table.States (277), 268, 68);
+ Add_Goto (Table.States (277), 311, 83);
+ Table.States (277).Kernel := To_Vector ((((335, 4), 24, 4,
(32767, 0), 0), ((335, 5), 24, 2, (32767,
+ 0), 0)));
+ Table.States (277).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (278).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (278), 23, (336, 0), 513);
+ Add_Action (Table.States (278), 52, (187, 0), 347);
+ Add_Action (Table.States (278), 56, (188, 2), 514);
+ Add_Action (Table.States (278), 86, (252, 0), 33);
+ Add_Action (Table.States (278), 90, (268, 0), 34);
+ Add_Action (Table.States (278), 116, (196, 0), 146);
+ Add_Action (Table.States (278), 117, (196, 1), 37);
+ Add_Action (Table.States (278), 118, (195, 6), 38);
+ Table.States (278).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (278), 187, 515);
+ Add_Goto (Table.States (278), 188, 516);
+ Add_Goto (Table.States (278), 195, 517);
+ Add_Goto (Table.States (278), 196, 148);
+ Add_Goto (Table.States (278), 197, 54);
+ Add_Goto (Table.States (278), 198, 55);
+ Add_Goto (Table.States (278), 199, 56);
+ Add_Goto (Table.States (278), 201, 57);
+ Add_Goto (Table.States (278), 251, 58);
+ Add_Goto (Table.States (278), 252, 59);
+ Add_Goto (Table.States (278), 255, 60);
+ Add_Goto (Table.States (278), 268, 68);
+ Add_Goto (Table.States (278), 311, 83);
+ Table.States (278).Kernel := To_Vector ((((335, 0), 93, 8,
(32767, 0), 0), ((335, 1), 93, 6, (32767,
+ 0), 0), ((335, 2), 93, 6, (32767, 0), 0), ((335, 3), 93, 4,
(32767, 0), 0), ((335, 6), 93, 7,
+ (32767, 0), 0), ((335, 7), 93, 5, (32767, 0), 0), ((336, 0),
93, 6, (32767, 0), 0), ((336, 1), 93,
+ 4, (32767, 0), 0)));
+ Table.States (278).Minimal_Complete_Actions := To_Vector (((Shift,
(196, 0), 116, 146), (Shift, (336, 0),
+ 23, 513)));
+ Table.States (279).Action_List.Set_Capacity (11);
+ Add_Action (Table.States (279), 23, (394, 0), 518);
+ Add_Action (Table.States (279), 52, (187, 0), 347);
+ Add_Action (Table.States (279), 56, (188, 2), 514);
+ Add_Action (Table.States (279), 70, (156, 0), 519);
+ Add_Action (Table.States (279), 79, (135, 8), 520);
+ Add_Action (Table.States (279), 80, (135, 0), 521);
+ Add_Action (Table.States (279), 86, (252, 0), 33);
+ Add_Action (Table.States (279), 90, (268, 0), 34);
+ Add_Action (Table.States (279), 116, (196, 0), 146);
+ Add_Action (Table.States (279), 117, (196, 1), 37);
+ Add_Action (Table.States (279), 118, (195, 6), 38);
+ Table.States (279).Goto_List.Set_Capacity (17);
+ Add_Goto (Table.States (279), 131, 522);
+ Add_Goto (Table.States (279), 154, 523);
+ Add_Goto (Table.States (279), 156, 524);
+ Add_Goto (Table.States (279), 159, 525);
+ Add_Goto (Table.States (279), 187, 526);
+ Add_Goto (Table.States (279), 188, 527);
+ Add_Goto (Table.States (279), 195, 528);
+ Add_Goto (Table.States (279), 196, 148);
+ Add_Goto (Table.States (279), 197, 54);
+ Add_Goto (Table.States (279), 198, 55);
+ Add_Goto (Table.States (279), 199, 56);
+ Add_Goto (Table.States (279), 201, 57);
+ Add_Goto (Table.States (279), 251, 58);
+ Add_Goto (Table.States (279), 252, 59);
+ Add_Goto (Table.States (279), 255, 60);
+ Add_Goto (Table.States (279), 268, 68);
+ Add_Goto (Table.States (279), 311, 83);
+ Table.States (279).Kernel := To_Vector ((((135, 0), 93, 8,
(32767, 0), 0), ((135, 1), 93, 6, (32767,
+ 0), 0), ((135, 2), 93, 6, (32767, 0), 0), ((135, 3), 93, 4,
(32767, 0), 0), ((135, 4), 93, 7,
+ (32767, 0), 0), ((135, 5), 93, 5, (32767, 0), 0), ((135, 6),
93, 5, (32767, 0), 0), ((135, 7), 93,
+ 3, (32767, 0), 0), ((135, 8), 93, 7, (32767, 0), 0), ((135,
9), 93, 5, (32767, 0), 0), ((135, 10),
+ 93, 5, (32767, 0), 0), ((135, 11), 93, 3, (32767, 0), 0),
((135, 12), 93, 6, (32767, 0), 0), ((135,
+ 13), 93, 4, (32767, 0), 0), ((135, 14), 93, 4, (32767, 0),
0), ((135, 15), 93, 2, (32767, 0), 0),
+ ((135, 16), 93, 9, (32767, 0), 0), ((135, 17), 93, 7, (32767,
0), 0), ((135, 18), 93, 7, (32767,
+ 0), 0), ((135, 19), 93, 5, (32767, 0), 0), ((135, 20), 93,
8, (32767, 0), 0), ((135, 21), 93, 6,
+ (32767, 0), 0), ((135, 22), 93, 6, (32767, 0), 0), ((135, 23),
93, 4, (32767, 0), 0), ((135, 24),
+ 93, 8, (32767, 0), 0), ((135, 25), 93, 6, (32767, 0), 0),
((135, 26), 93, 6, (32767, 0), 0), ((135,
+ 27), 93, 4, (32767, 0), 0), ((135, 28), 93, 7, (32767, 0),
0), ((135, 29), 93, 5, (32767, 0), 0),
+ ((135, 30), 93, 5, (32767, 0), 0), ((135, 31), 93, 3, (32767,
0), 0), ((135, 32), 93, 14, (32767,
+ 0), 0), ((135, 33), 93, 12, (32767, 0), 0), ((135, 34), 93,
12, (32767, 0), 0), ((135, 35), 93,
+ 10, (32767, 0), 0), ((135, 36), 93, 13, (32767, 0), 0), ((135,
37), 93, 11, (32767, 0), 0), ((135,
+ 38), 93, 11, (32767, 0), 0), ((135, 39), 93, 9, (32767, 0),
0), ((135, 40), 93, 13, (32767, 0),
+ 0), ((135, 41), 93, 11, (32767, 0), 0), ((135, 42), 93, 11,
(32767, 0), 0), ((135, 43), 93, 9,
+ (32767, 0), 0), ((135, 44), 93, 12, (32767, 0), 0), ((135,
45), 93, 10, (32767, 0), 0), ((135, 46),
+ 93, 10, (32767, 0), 0), ((135, 47), 93, 8, (32767, 0), 0),
((137, 0), 93, 4, (32767, 0), 0), ((394,
+ 0), 93, 4, (32767, 0), 0), ((394, 1), 93, 2, (32767, 0),
0)));
+ Table.States (279).Minimal_Complete_Actions := To_Vector (((Shift,
(196, 0), 116, 146), (Shift, (394, 0),
+ 23, 518)));
+ end Subr_10;
+ procedure Subr_11
+ is begin
+ Table.States (280).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (280), 116, (136, 1), 529);
+ Table.States (280).Kernel := To_Vector ((0 => ((136, 1), 95, 1,
(32767, 0), 0)));
+ Table.States (280).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (136, 1), 116, 529)));
+ Table.States (281).Action_List.Set_Capacity (20);
+ Add_Action (Table.States (281), 12, (402, 0), 165);
+ Add_Action (Table.States (281), 39, (249, 0), 353);
+ Add_Action (Table.States (281), 42, (242, 0), 354);
+ Add_Action (Table.States (281), 46, (233, 2), 167);
+ Add_Action (Table.States (281), 51, (247, 0), 530);
+ Add_Action (Table.States (281), 52, (187, 0), 356);
+ Add_Action (Table.States (281), 62, (200, 2), 531);
+ Add_Action (Table.States (281), 64, (245, 0), 358);
+ Add_Action (Table.States (281), 65, (234, 1), 169);
+ Add_Action (Table.States (281), 76, (256, 0), 170);
+ Add_Action (Table.States (281), 85, (205, 4), 171);
+ Add_Action (Table.States (281), 86, (213, 2), 172);
+ Add_Action (Table.States (281), 90, (268, 0), 34);
+ Add_Action (Table.States (281), 92, (315, 2), 532);
+ Add_Action (Table.States (281), 106, (237, 1), 173);
+ Add_Action (Table.States (281), 107, (237, 0), 174);
+ Add_Action (Table.States (281), 115, (234, 0), 175);
+ Add_Action (Table.States (281), 116, (196, 0), 146);
+ Add_Action (Table.States (281), 117, (196, 1), 37);
+ Add_Action (Table.States (281), 118, (195, 6), 360);
+ Table.States (281).Goto_List.Set_Capacity (45);
+ Add_Goto (Table.States (281), 131, 533);
+ Add_Goto (Table.States (281), 140, 534);
+ Add_Goto (Table.States (281), 163, 535);
+ Add_Goto (Table.States (281), 187, 365);
+ Add_Goto (Table.States (281), 195, 366);
+ Add_Goto (Table.States (281), 196, 367);
+ Add_Goto (Table.States (281), 197, 54);
+ Add_Goto (Table.States (281), 198, 55);
+ Add_Goto (Table.States (281), 199, 56);
+ Add_Goto (Table.States (281), 200, 368);
+ Add_Goto (Table.States (281), 201, 57);
+ Add_Goto (Table.States (281), 203, 369);
+ Add_Goto (Table.States (281), 205, 177);
+ Add_Goto (Table.States (281), 206, 178);
+ Add_Goto (Table.States (281), 209, 536);
+ Add_Goto (Table.States (281), 210, 179);
+ Add_Goto (Table.States (281), 211, 180);
+ Add_Goto (Table.States (281), 213, 181);
+ Add_Goto (Table.States (281), 214, 182);
+ Add_Goto (Table.States (281), 215, 183);
+ Add_Goto (Table.States (281), 218, 184);
+ Add_Goto (Table.States (281), 219, 185);
+ Add_Goto (Table.States (281), 220, 186);
+ Add_Goto (Table.States (281), 227, 537);
+ Add_Goto (Table.States (281), 228, 188);
+ Add_Goto (Table.States (281), 231, 378);
+ Add_Goto (Table.States (281), 232, 190);
+ Add_Goto (Table.States (281), 233, 191);
+ Add_Goto (Table.States (281), 234, 192);
+ Add_Goto (Table.States (281), 237, 193);
+ Add_Goto (Table.States (281), 239, 538);
+ Add_Goto (Table.States (281), 242, 380);
+ Add_Goto (Table.States (281), 245, 381);
+ Add_Goto (Table.States (281), 247, 539);
+ Add_Goto (Table.States (281), 249, 540);
+ Add_Goto (Table.States (281), 251, 58);
+ Add_Goto (Table.States (281), 252, 59);
+ Add_Goto (Table.States (281), 255, 60);
+ Add_Goto (Table.States (281), 256, 194);
+ Add_Goto (Table.States (281), 268, 68);
+ Add_Goto (Table.States (281), 311, 83);
+ Add_Goto (Table.States (281), 312, 541);
+ Add_Goto (Table.States (281), 315, 542);
+ Add_Goto (Table.States (281), 402, 195);
+ Add_Goto (Table.States (281), 465, 196);
+ Table.States (281).Kernel := To_Vector ((((198, 0), 85, 2,
(32767, 0), 0), ((313, 0), 85, 2, (32767,
+ 0), 0), ((313, 1), 85, 5, (32767, 0), 0), ((313, 2), 85, 8,
(32767, 0), 0), ((313, 3), 85, 4,
+ (32767, 0), 0)));
+ Table.States (281).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (282).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (282), 12, (402, 0), 165);
+ Add_Action (Table.States (282), 46, (233, 2), 167);
+ Add_Action (Table.States (282), 52, (233, 3), 168);
+ Add_Action (Table.States (282), 65, (234, 1), 169);
+ Add_Action (Table.States (282), 76, (256, 0), 170);
+ Add_Action (Table.States (282), 85, (205, 4), 171);
+ Add_Action (Table.States (282), 86, (213, 2), 172);
+ Add_Action (Table.States (282), 90, (268, 0), 34);
+ Add_Action (Table.States (282), 106, (237, 1), 173);
+ Add_Action (Table.States (282), 107, (237, 0), 174);
+ Add_Action (Table.States (282), 115, (234, 0), 175);
+ Add_Action (Table.States (282), 116, (196, 0), 146);
+ Add_Action (Table.States (282), 117, (196, 1), 37);
+ Add_Action (Table.States (282), 118, (195, 6), 38);
+ Table.States (282).Goto_List.Set_Capacity (31);
+ Add_Goto (Table.States (282), 195, 176);
+ Add_Goto (Table.States (282), 196, 148);
+ Add_Goto (Table.States (282), 197, 54);
+ Add_Goto (Table.States (282), 198, 55);
+ Add_Goto (Table.States (282), 199, 56);
+ Add_Goto (Table.States (282), 201, 57);
+ Add_Goto (Table.States (282), 205, 177);
+ Add_Goto (Table.States (282), 206, 178);
+ Add_Goto (Table.States (282), 210, 179);
+ Add_Goto (Table.States (282), 211, 180);
+ Add_Goto (Table.States (282), 213, 181);
+ Add_Goto (Table.States (282), 214, 182);
+ Add_Goto (Table.States (282), 215, 183);
+ Add_Goto (Table.States (282), 218, 184);
+ Add_Goto (Table.States (282), 219, 185);
+ Add_Goto (Table.States (282), 220, 186);
+ Add_Goto (Table.States (282), 227, 543);
+ Add_Goto (Table.States (282), 228, 188);
+ Add_Goto (Table.States (282), 231, 189);
+ Add_Goto (Table.States (282), 232, 190);
+ Add_Goto (Table.States (282), 233, 191);
+ Add_Goto (Table.States (282), 234, 192);
+ Add_Goto (Table.States (282), 237, 193);
+ Add_Goto (Table.States (282), 251, 58);
+ Add_Goto (Table.States (282), 252, 59);
+ Add_Goto (Table.States (282), 255, 60);
+ Add_Goto (Table.States (282), 256, 194);
+ Add_Goto (Table.States (282), 268, 68);
+ Add_Goto (Table.States (282), 311, 83);
+ Add_Goto (Table.States (282), 402, 195);
+ Add_Goto (Table.States (282), 465, 196);
+ Table.States (282).Kernel := To_Vector ((0 => ((134, 0), 94, 1,
(32767, 0), 0)));
+ Table.States (282).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (283).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (283), 55, (197, 0), 544);
+ Add_Action (Table.States (283), 62, (200, 2), 531);
+ Add_Action (Table.States (283), 116, (196, 0), 146);
+ Add_Action (Table.States (283), 117, (196, 1), 37);
+ Add_Action (Table.States (283), 118, (200, 1), 545);
+ Table.States (283).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (283), 196, 546);
+ Add_Goto (Table.States (283), 200, 547);
+ Table.States (283).Kernel := To_Vector ((((197, 0), 96, 1,
(32767, 0), 0), ((199, 0), 96, 1, (32767,
+ 0), 0)));
+ Table.States (284).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (284), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (310, 0), 2);
+ Table.States (284).Kernel := To_Vector ((0 => ((310, 0), 108, 0,
(310, 0), 2)));
+ Table.States (284).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (310, 0), 2)));
+ Table.States (285).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (285), (56, 71, 72, 73, 74, 85, 86, 116),
(121, 0), 1);
+ Table.States (285).Kernel := To_Vector ((0 => ((121, 0), 113, 0,
(121, 0), 1)));
+ Table.States (285).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (121, 0), 1)));
+ Table.States (286).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (286), (56, 71, 72, 73, 74, 85, 86, 116),
(121, 1), 1);
+ Table.States (286).Kernel := To_Vector ((0 => ((121, 1), 114, 0,
(121, 1), 1)));
+ Table.States (286).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (121, 1), 1)));
+ Table.States (287).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (287), 56, (202, 1), 548);
+ Add_Action (Table.States (287), 71, (202, 2), 549);
+ Add_Action (Table.States (287), 72, (202, 3), 550);
+ Add_Action (Table.States (287), 73, (202, 4), 551);
+ Add_Action (Table.States (287), 85, (205, 4), 171);
+ Add_Action (Table.States (287), 86, (213, 2), 552);
+ Add_Action (Table.States (287), 116, (202, 0), 553);
+ Table.States (287).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (287), 202, 554);
+ Add_Goto (Table.States (287), 205, 555);
+ Add_Goto (Table.States (287), 206, 178);
+ Add_Goto (Table.States (287), 210, 179);
+ Add_Goto (Table.States (287), 211, 180);
+ Add_Goto (Table.States (287), 213, 181);
+ Add_Goto (Table.States (287), 214, 182);
+ Add_Goto (Table.States (287), 215, 183);
+ Add_Goto (Table.States (287), 218, 184);
+ Add_Goto (Table.States (287), 219, 185);
+ Add_Goto (Table.States (287), 220, 186);
+ Table.States (287).Kernel := To_Vector ((((201, 0), 121, 1,
(32767, 0), 0), ((255, 0), 121, 2, (32767,
+ 0), 0)));
+ Table.States (288).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (288), 108, (267, 0), 556);
+ Table.States (288).Kernel := To_Vector ((0 => ((267, 0), 134, 1,
(32767, 0), 0)));
+ Table.States (288).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (267, 0), 108, 556)));
+ Table.States (289).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (289), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (311, 0), 2);
+ Table.States (289).Kernel := To_Vector ((0 => ((311, 0), 313, 0,
(311, 0), 2)));
+ Table.States (289).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (311, 0), 2)));
+ Table.States (290).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (290), 116, (253, 0), 557);
+ Table.States (290).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (290), 253, 558);
+ Table.States (290).Kernel := To_Vector ((0 => ((251, 0), 121, 6,
(32767, 0), 0)));
+ Table.States (290).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (253, 0), 116, 557)));
+ Table.States (291).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (291), (35, 36, 37, 38, 39, 51), (285,
0), 2);
+ Table.States (291).Kernel := To_Vector ((0 => ((285, 0), 93, 0,
(285, 0), 2)));
+ Table.States (291).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (285, 0), 2)));
+ Table.States (292).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (292), 12, (401, 0), 1);
+ Add_Action (Table.States (292), 15, (370, 0), 3);
+ Add_Action (Table.States (292), 17, (365, 0), 4);
+ Add_Action (Table.States (292), 18, (382, 0), 5);
+ Add_Action (Table.States (292), 19, (363, 0), 6);
+ Add_Action (Table.States (292), 20, (357, 0), 7);
+ Add_Action (Table.States (292), 30, (316, 0), 13);
+ Add_Action (Table.States (292), 31, (290, 0), 14);
+ Add_Action (Table.States (292), 32, (289, 0), 15);
+ Add_Action (Table.States (292), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (292), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (292), 37, (288, 0), 17);
+ Add_Conflict (Table.States (292), 37, (285, 1), 0);
+ Add_Action (Table.States (292), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (292), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (292), 42, (271, 0), 18);
+ Add_Action (Table.States (292), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (292), 64, (273, 0), 27);
+ Add_Action (Table.States (292), 65, (264, 0), 28);
+ Add_Action (Table.States (292), 84, (124, 0), 32);
+ Add_Action (Table.States (292), 86, (252, 0), 33);
+ Add_Action (Table.States (292), 90, (268, 0), 34);
+ Add_Action (Table.States (292), 105, (265, 0), 35);
+ Add_Action (Table.States (292), 116, (196, 0), 146);
+ Add_Action (Table.States (292), 117, (196, 1), 37);
+ Add_Action (Table.States (292), 118, (195, 6), 38);
+ Table.States (292).Goto_List.Set_Capacity (45);
+ Add_Goto (Table.States (292), 124, 39);
+ Add_Goto (Table.States (292), 195, 52);
+ Add_Goto (Table.States (292), 196, 53);
+ Add_Goto (Table.States (292), 197, 54);
+ Add_Goto (Table.States (292), 198, 55);
+ Add_Goto (Table.States (292), 199, 56);
+ Add_Goto (Table.States (292), 201, 57);
+ Add_Goto (Table.States (292), 251, 58);
+ Add_Goto (Table.States (292), 252, 59);
+ Add_Goto (Table.States (292), 255, 60);
+ Add_Goto (Table.States (292), 259, 559);
+ Add_Goto (Table.States (292), 261, 331);
+ Add_Goto (Table.States (292), 262, 62);
+ Add_Goto (Table.States (292), 263, 63);
+ Add_Goto (Table.States (292), 264, 64);
+ Add_Goto (Table.States (292), 265, 65);
+ Add_Goto (Table.States (292), 266, 66);
+ Add_Goto (Table.States (292), 267, 67);
+ Add_Goto (Table.States (292), 268, 68);
+ Add_Goto (Table.States (292), 271, 69);
+ Add_Goto (Table.States (292), 273, 70);
+ Add_Goto (Table.States (292), 275, 71);
+ Add_Goto (Table.States (292), 285, 72);
+ Add_Goto (Table.States (292), 286, 73);
+ Add_Goto (Table.States (292), 288, 74);
+ Add_Goto (Table.States (292), 289, 75);
+ Add_Goto (Table.States (292), 290, 76);
+ Add_Goto (Table.States (292), 310, 82);
+ Add_Goto (Table.States (292), 311, 83);
+ Add_Goto (Table.States (292), 316, 84);
+ Add_Goto (Table.States (292), 318, 85);
+ Add_Goto (Table.States (292), 357, 110);
+ Add_Goto (Table.States (292), 363, 111);
+ Add_Goto (Table.States (292), 364, 112);
+ Add_Goto (Table.States (292), 365, 113);
+ Add_Goto (Table.States (292), 366, 114);
+ Add_Goto (Table.States (292), 367, 115);
+ Add_Goto (Table.States (292), 370, 116);
+ Add_Goto (Table.States (292), 376, 117);
+ Add_Goto (Table.States (292), 378, 118);
+ Add_Goto (Table.States (292), 379, 119);
+ Add_Goto (Table.States (292), 382, 120);
+ Add_Goto (Table.States (292), 401, 133);
+ Add_Goto (Table.States (292), 461, 332);
+ Add_Goto (Table.States (292), 462, 144);
+ Table.States (292).Kernel := To_Vector ((0 => ((275, 1), 36, 5,
(32767, 0), 0)));
+ Table.States (292).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ Table.States (293).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (293), 51, (276, 3), 239);
+ Add_Action (Table.States (293), 85, (276, 5), 240);
+ Table.States (293).Kernel := To_Vector ((((276, 3), 37, 9,
(32767, 0), 0), ((276, 5), 37, 7, (32767,
+ 0), 0), ((276, 6), 37, 4, (32767, 0), 0), ((276, 7), 37, 7,
(32767, 0), 0), ((276, 8), 37, 4,
+ (32767, 0), 0)));
+ Table.States (293).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (276, 3), 51, 239)));
+ Table.States (294).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (294), 12, (401, 0), 1);
+ Add_Action (Table.States (294), 15, (370, 0), 3);
+ Add_Action (Table.States (294), 17, (365, 0), 4);
+ Add_Action (Table.States (294), 18, (382, 0), 5);
+ Add_Action (Table.States (294), 19, (363, 0), 6);
+ Add_Action (Table.States (294), 20, (357, 0), 7);
+ Add_Action (Table.States (294), 30, (316, 0), 13);
+ Add_Action (Table.States (294), 31, (290, 0), 14);
+ Add_Action (Table.States (294), 32, (289, 0), 15);
+ Add_Action (Table.States (294), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (294), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (294), 37, (288, 0), 17);
+ Add_Conflict (Table.States (294), 37, (285, 1), 0);
+ Add_Action (Table.States (294), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (294), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (294), 42, (271, 0), 18);
+ Add_Action (Table.States (294), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (294), 64, (273, 0), 27);
+ Add_Action (Table.States (294), 65, (264, 0), 28);
+ Add_Action (Table.States (294), 84, (124, 0), 32);
+ Add_Action (Table.States (294), 86, (252, 0), 33);
+ Add_Action (Table.States (294), 90, (268, 0), 34);
+ Add_Action (Table.States (294), 105, (265, 0), 35);
+ Add_Action (Table.States (294), 116, (196, 0), 146);
+ Add_Action (Table.States (294), 117, (196, 1), 37);
+ Add_Action (Table.States (294), 118, (195, 6), 38);
+ Table.States (294).Goto_List.Set_Capacity (46);
+ Add_Goto (Table.States (294), 124, 39);
+ Add_Goto (Table.States (294), 195, 52);
+ Add_Goto (Table.States (294), 196, 53);
+ Add_Goto (Table.States (294), 197, 54);
+ Add_Goto (Table.States (294), 198, 55);
+ Add_Goto (Table.States (294), 199, 56);
+ Add_Goto (Table.States (294), 201, 57);
+ Add_Goto (Table.States (294), 251, 58);
+ Add_Goto (Table.States (294), 252, 59);
+ Add_Goto (Table.States (294), 255, 60);
+ Add_Goto (Table.States (294), 259, 452);
+ Add_Goto (Table.States (294), 261, 331);
+ Add_Goto (Table.States (294), 262, 62);
+ Add_Goto (Table.States (294), 263, 63);
+ Add_Goto (Table.States (294), 264, 64);
+ Add_Goto (Table.States (294), 265, 65);
+ Add_Goto (Table.States (294), 266, 66);
+ Add_Goto (Table.States (294), 267, 67);
+ Add_Goto (Table.States (294), 268, 68);
+ Add_Goto (Table.States (294), 271, 69);
+ Add_Goto (Table.States (294), 273, 70);
+ Add_Goto (Table.States (294), 275, 71);
+ Add_Goto (Table.States (294), 285, 72);
+ Add_Goto (Table.States (294), 286, 73);
+ Add_Goto (Table.States (294), 288, 74);
+ Add_Goto (Table.States (294), 289, 75);
+ Add_Goto (Table.States (294), 290, 76);
+ Add_Goto (Table.States (294), 310, 82);
+ Add_Goto (Table.States (294), 311, 83);
+ Add_Goto (Table.States (294), 316, 84);
+ Add_Goto (Table.States (294), 318, 85);
+ Add_Goto (Table.States (294), 357, 110);
+ Add_Goto (Table.States (294), 363, 111);
+ Add_Goto (Table.States (294), 364, 112);
+ Add_Goto (Table.States (294), 365, 113);
+ Add_Goto (Table.States (294), 366, 114);
+ Add_Goto (Table.States (294), 367, 115);
+ Add_Goto (Table.States (294), 370, 116);
+ Add_Goto (Table.States (294), 376, 117);
+ Add_Goto (Table.States (294), 378, 118);
+ Add_Goto (Table.States (294), 379, 119);
+ Add_Goto (Table.States (294), 382, 120);
+ Add_Goto (Table.States (294), 396, 560);
+ Add_Goto (Table.States (294), 401, 133);
+ Add_Goto (Table.States (294), 461, 332);
+ Add_Goto (Table.States (294), 462, 144);
+ Table.States (294).Kernel := To_Vector ((0 => ((286, 1), 38, 4,
(32767, 0), 0)));
+ Table.States (294).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ Table.States (295).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (295), 22, (339, 0), 9);
+ Add_Action (Table.States (295), 25, (329, 1), 10);
+ Add_Action (Table.States (295), 28, (325, 0), 12);
+ Add_Action (Table.States (295), 38, Reduce, (192, 1), 0);
+ Add_Action (Table.States (295), 50, (332, 0), 19);
+ Add_Action (Table.States (295), 51, (437, 0), 221);
+ Add_Action (Table.States (295), 52, (329, 0), 21);
+ Add_Action (Table.States (295), 53, (294, 0), 22);
+ Add_Action (Table.States (295), 54, (293, 0), 23);
+ Add_Action (Table.States (295), 59, (346, 0), 24);
+ Add_Action (Table.States (295), 60, (340, 0), 25);
+ Add_Action (Table.States (295), 81, (130, 0), 30);
+ Add_Action (Table.States (295), 83, (128, 0), 31);
+ Add_Action (Table.States (295), 84, (124, 0), 32);
+ Add_Action (Table.States (295), 116, (136, 0), 223);
+ Table.States (295).Goto_List.Set_Capacity (60);
+ Add_Goto (Table.States (295), 124, 561);
+ Add_Goto (Table.States (295), 126, 40);
+ Add_Goto (Table.States (295), 127, 41);
+ Add_Goto (Table.States (295), 128, 42);
+ Add_Goto (Table.States (295), 130, 43);
+ Add_Goto (Table.States (295), 135, 44);
+ Add_Goto (Table.States (295), 136, 45);
+ Add_Goto (Table.States (295), 137, 46);
+ Add_Goto (Table.States (295), 180, 47);
+ Add_Goto (Table.States (295), 189, 48);
+ Add_Goto (Table.States (295), 190, 562);
+ Add_Goto (Table.States (295), 191, 563);
+ Add_Goto (Table.States (295), 192, 564);
+ Add_Goto (Table.States (295), 193, 50);
+ Add_Goto (Table.States (295), 194, 51);
+ Add_Goto (Table.States (295), 291, 77);
+ Add_Goto (Table.States (295), 292, 78);
+ Add_Goto (Table.States (295), 293, 79);
+ Add_Goto (Table.States (295), 294, 80);
+ Add_Goto (Table.States (295), 309, 81);
+ Add_Goto (Table.States (295), 320, 86);
+ Add_Goto (Table.States (295), 321, 87);
+ Add_Goto (Table.States (295), 322, 88);
+ Add_Goto (Table.States (295), 325, 89);
+ Add_Goto (Table.States (295), 326, 90);
+ Add_Goto (Table.States (295), 327, 91);
+ Add_Goto (Table.States (295), 328, 92);
+ Add_Goto (Table.States (295), 329, 225);
+ Add_Goto (Table.States (295), 330, 94);
+ Add_Goto (Table.States (295), 332, 95);
+ Add_Goto (Table.States (295), 333, 96);
+ Add_Goto (Table.States (295), 334, 97);
+ Add_Goto (Table.States (295), 335, 98);
+ Add_Goto (Table.States (295), 336, 99);
+ Add_Goto (Table.States (295), 337, 100);
+ Add_Goto (Table.States (295), 338, 101);
+ Add_Goto (Table.States (295), 339, 102);
+ Add_Goto (Table.States (295), 340, 103);
+ Add_Goto (Table.States (295), 341, 104);
+ Add_Goto (Table.States (295), 345, 105);
+ Add_Goto (Table.States (295), 346, 106);
+ Add_Goto (Table.States (295), 347, 107);
+ Add_Goto (Table.States (295), 354, 108);
+ Add_Goto (Table.States (295), 388, 126);
+ Add_Goto (Table.States (295), 389, 127);
+ Add_Goto (Table.States (295), 390, 128);
+ Add_Goto (Table.States (295), 391, 129);
+ Add_Goto (Table.States (295), 392, 130);
+ Add_Goto (Table.States (295), 394, 132);
+ Add_Goto (Table.States (295), 403, 134);
+ Add_Goto (Table.States (295), 404, 135);
+ Add_Goto (Table.States (295), 405, 136);
+ Add_Goto (Table.States (295), 406, 137);
+ Add_Goto (Table.States (295), 408, 138);
+ Add_Goto (Table.States (295), 431, 139);
+ Add_Goto (Table.States (295), 437, 140);
+ Add_Goto (Table.States (295), 438, 141);
+ Add_Goto (Table.States (295), 440, 142);
+ Add_Goto (Table.States (295), 454, 143);
+ Add_Goto (Table.States (295), 458, 565);
+ Table.States (295).Kernel := To_Vector ((0 => ((286, 0), 39, 5,
(32767, 0), 0)));
+ Table.States (295).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (192, 1), 0)));
+ end Subr_11;
+ procedure Subr_12
+ is begin
+ Table.States (296).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (296), 85, (283, 1), 246);
+ Add_Action (Table.States (296), 116, (278, 0), 454);
+ Table.States (296).Goto_List.Set_Capacity (5);
+ Add_Goto (Table.States (296), 278, 250);
+ Add_Goto (Table.States (296), 280, 251);
+ Add_Goto (Table.States (296), 282, 252);
+ Add_Goto (Table.States (296), 283, 253);
+ Add_Goto (Table.States (296), 299, 254);
+ Table.States (296).Kernel := To_Vector ((((276, 1), 51, 3,
(32767, 0), 0), ((276, 2), 51, 3, (32767,
+ 0), 0), ((276, 4), 51, 8, (32767, 0), 0)));
+ Table.States (296).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (278, 0), 116, 454)));
+ Table.States (297).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (297), 36, (275, 0), 566);
+ Table.States (297).Kernel := To_Vector ((0 => ((275, 0), 276, 6,
(32767, 0), 0)));
+ Table.States (297).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (275, 0), 36, 566)));
+ Table.States (298).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (298), 86, (252, 0), 33);
+ Add_Action (Table.States (298), 90, (268, 0), 34);
+ Add_Action (Table.States (298), 116, (196, 0), 146);
+ Add_Action (Table.States (298), 117, (196, 1), 37);
+ Add_Action (Table.States (298), 118, (195, 6), 38);
+ Table.States (298).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (298), 195, 567);
+ Add_Goto (Table.States (298), 196, 148);
+ Add_Goto (Table.States (298), 197, 54);
+ Add_Goto (Table.States (298), 198, 55);
+ Add_Goto (Table.States (298), 199, 56);
+ Add_Goto (Table.States (298), 201, 57);
+ Add_Goto (Table.States (298), 251, 58);
+ Add_Goto (Table.States (298), 252, 59);
+ Add_Goto (Table.States (298), 255, 60);
+ Add_Goto (Table.States (298), 268, 68);
+ Add_Goto (Table.States (298), 311, 83);
+ Table.States (298).Kernel := To_Vector ((((338, 2), 24, 4,
(32767, 0), 0), ((338, 3), 24, 2, (32767,
+ 0), 0)));
+ Table.States (298).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (299).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (299), 116, (435, 0), 568);
+ Table.States (299).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (299), 432, 569);
+ Add_Goto (Table.States (299), 433, 570);
+ Add_Goto (Table.States (299), 435, 571);
+ Table.States (299).Kernel := To_Vector ((0 => ((434, 0), 61, 1,
(32767, 0), 0)));
+ Table.States (299).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (435, 0), 116, 568)));
+ Table.States (300).Action_List.Set_Capacity (17);
+ Add_Action (Table.States (300), 13, (389, 2), 572);
+ Add_Action (Table.States (300), 22, (339, 0), 9);
+ Add_Action (Table.States (300), 25, (329, 1), 10);
+ Add_Action (Table.States (300), 28, (325, 0), 12);
+ Add_Action (Table.States (300), 38, Reduce, (192, 1), 0);
+ Add_Action (Table.States (300), 50, (332, 0), 19);
+ Add_Action (Table.States (300), 51, (437, 0), 221);
+ Add_Action (Table.States (300), 52, (329, 0), 21);
+ Add_Action (Table.States (300), 53, (294, 0), 22);
+ Add_Action (Table.States (300), 54, (293, 0), 23);
+ Add_Action (Table.States (300), 59, (346, 0), 24);
+ Add_Action (Table.States (300), 60, (340, 0), 25);
+ Add_Action (Table.States (300), 78, (180, 2), 573);
+ Add_Action (Table.States (300), 81, (130, 0), 30);
+ Add_Action (Table.States (300), 83, (128, 0), 31);
+ Add_Action (Table.States (300), 84, (124, 0), 32);
+ Add_Action (Table.States (300), 116, (136, 0), 223);
+ Table.States (300).Goto_List.Set_Capacity (60);
+ Add_Goto (Table.States (300), 124, 561);
+ Add_Goto (Table.States (300), 126, 40);
+ Add_Goto (Table.States (300), 127, 41);
+ Add_Goto (Table.States (300), 128, 42);
+ Add_Goto (Table.States (300), 130, 43);
+ Add_Goto (Table.States (300), 135, 44);
+ Add_Goto (Table.States (300), 136, 45);
+ Add_Goto (Table.States (300), 137, 46);
+ Add_Goto (Table.States (300), 180, 47);
+ Add_Goto (Table.States (300), 189, 48);
+ Add_Goto (Table.States (300), 190, 562);
+ Add_Goto (Table.States (300), 191, 563);
+ Add_Goto (Table.States (300), 192, 574);
+ Add_Goto (Table.States (300), 193, 50);
+ Add_Goto (Table.States (300), 194, 51);
+ Add_Goto (Table.States (300), 291, 77);
+ Add_Goto (Table.States (300), 292, 78);
+ Add_Goto (Table.States (300), 293, 79);
+ Add_Goto (Table.States (300), 294, 80);
+ Add_Goto (Table.States (300), 309, 81);
+ Add_Goto (Table.States (300), 320, 86);
+ Add_Goto (Table.States (300), 321, 87);
+ Add_Goto (Table.States (300), 322, 88);
+ Add_Goto (Table.States (300), 325, 89);
+ Add_Goto (Table.States (300), 326, 90);
+ Add_Goto (Table.States (300), 327, 91);
+ Add_Goto (Table.States (300), 328, 92);
+ Add_Goto (Table.States (300), 329, 225);
+ Add_Goto (Table.States (300), 330, 94);
+ Add_Goto (Table.States (300), 332, 95);
+ Add_Goto (Table.States (300), 333, 96);
+ Add_Goto (Table.States (300), 334, 97);
+ Add_Goto (Table.States (300), 335, 98);
+ Add_Goto (Table.States (300), 336, 99);
+ Add_Goto (Table.States (300), 337, 100);
+ Add_Goto (Table.States (300), 338, 101);
+ Add_Goto (Table.States (300), 339, 102);
+ Add_Goto (Table.States (300), 340, 103);
+ Add_Goto (Table.States (300), 341, 104);
+ Add_Goto (Table.States (300), 345, 105);
+ Add_Goto (Table.States (300), 346, 106);
+ Add_Goto (Table.States (300), 347, 107);
+ Add_Goto (Table.States (300), 354, 108);
+ Add_Goto (Table.States (300), 388, 126);
+ Add_Goto (Table.States (300), 389, 127);
+ Add_Goto (Table.States (300), 390, 128);
+ Add_Goto (Table.States (300), 391, 129);
+ Add_Goto (Table.States (300), 392, 130);
+ Add_Goto (Table.States (300), 394, 132);
+ Add_Goto (Table.States (300), 403, 134);
+ Add_Goto (Table.States (300), 404, 135);
+ Add_Goto (Table.States (300), 405, 136);
+ Add_Goto (Table.States (300), 406, 137);
+ Add_Goto (Table.States (300), 408, 138);
+ Add_Goto (Table.States (300), 431, 139);
+ Add_Goto (Table.States (300), 437, 140);
+ Add_Goto (Table.States (300), 438, 141);
+ Add_Goto (Table.States (300), 440, 142);
+ Add_Goto (Table.States (300), 454, 143);
+ Add_Goto (Table.States (300), 458, 565);
+ Table.States (300).Kernel := To_Vector ((((180, 2), 82, 4,
(32767, 0), 0), ((180, 3), 82, 2, (32767,
+ 0), 0), ((309, 3), 82, 5, (32767, 0), 0), ((389, 2), 82, 4,
(32767, 0), 0), ((389, 3), 82, 2,
+ (32767, 0), 0)));
+ Table.States (300).Minimal_Complete_Actions := To_Vector (((Shift,
(180, 2), 78, 573), (Shift, (389, 2),
+ 13, 572)));
+ Table.States (301).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (301), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (291, 3), 2);
+ Table.States (301).Kernel := To_Vector ((0 => ((291, 3), 108, 0,
(291, 3), 2)));
+ Table.States (301).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (291, 3), 2)));
+ Table.States (302).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (302), 82, (309, 2), 575);
+ Add_Action (Table.States (302), 108, (291, 2), 576);
+ Table.States (302).Kernel := To_Vector ((((291, 2), 434, 1,
(32767, 0), 0), ((309, 2), 434, 6, (32767,
+ 0), 0)));
+ Table.States (302).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (309, 2), 82, 575)));
+ Table.States (303).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (303), 65, (320, 2), 577);
+ Table.States (303).Kernel := To_Vector ((((320, 2), 82, 4,
(32767, 0), 0), ((320, 3), 82, 2, (32767,
+ 0), 0)));
+ Table.States (303).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (320, 2), 65, 577)));
+ Table.States (304).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (304), 85, (205, 4), 171);
+ Add_Action (Table.States (304), 86, (213, 2), 552);
+ Table.States (304).Goto_List.Set_Capacity (10);
+ Add_Goto (Table.States (304), 205, 578);
+ Add_Goto (Table.States (304), 206, 178);
+ Add_Goto (Table.States (304), 210, 179);
+ Add_Goto (Table.States (304), 211, 180);
+ Add_Goto (Table.States (304), 213, 181);
+ Add_Goto (Table.States (304), 214, 182);
+ Add_Goto (Table.States (304), 215, 183);
+ Add_Goto (Table.States (304), 218, 184);
+ Add_Goto (Table.States (304), 219, 185);
+ Add_Goto (Table.States (304), 220, 186);
+ Table.States (304).Kernel := To_Vector ((((321, 2), 82, 5,
(32767, 0), 0), ((321, 3), 82, 3, (32767,
+ 0), 0)));
+ Table.States (304).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (213, 2), 86, 552)));
+ Table.States (305).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (305), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (322, 0), 2);
+ Table.States (305).Kernel := To_Vector ((0 => ((322, 0), 108, 0,
(322, 0), 2)));
+ Table.States (305).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (322, 0), 2)));
+ Table.States (306).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (306), 116, (356, 0), 579);
+ Table.States (306).Kernel := To_Vector ((((356, 0), 21, 7,
(32767, 0), 0), ((356, 1), 21, 5, (32767,
+ 0), 0), ((356, 2), 21, 4, (32767, 0), 0), ((356, 3), 21, 2,
(32767, 0), 0)));
+ Table.States (306).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (356, 0), 116, 579)));
+ Table.States (307).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (307), 86, (252, 0), 33);
+ Add_Action (Table.States (307), 90, (268, 0), 34);
+ Add_Action (Table.States (307), 116, (196, 0), 146);
+ Add_Action (Table.States (307), 117, (196, 1), 37);
+ Add_Action (Table.States (307), 118, (195, 6), 38);
+ Table.States (307).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (307), 195, 580);
+ Add_Goto (Table.States (307), 196, 148);
+ Add_Goto (Table.States (307), 197, 54);
+ Add_Goto (Table.States (307), 198, 55);
+ Add_Goto (Table.States (307), 199, 56);
+ Add_Goto (Table.States (307), 201, 57);
+ Add_Goto (Table.States (307), 251, 58);
+ Add_Goto (Table.States (307), 252, 59);
+ Add_Goto (Table.States (307), 255, 60);
+ Add_Goto (Table.States (307), 268, 68);
+ Add_Goto (Table.States (307), 311, 83);
+ Table.States (307).Kernel := To_Vector ((((294, 0), 53, 3,
(32767, 0), 0), ((408, 6), 53, 7, (32767,
+ 0), 0), ((408, 7), 53, 5, (32767, 0), 0)));
+ Table.States (307).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (308).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (308), 86, (252, 0), 33);
+ Add_Action (Table.States (308), 90, (268, 0), 34);
+ Add_Action (Table.States (308), 116, (196, 0), 146);
+ Add_Action (Table.States (308), 117, (196, 1), 37);
+ Add_Action (Table.States (308), 118, (195, 6), 38);
+ Table.States (308).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (308), 195, 581);
+ Add_Goto (Table.States (308), 196, 148);
+ Add_Goto (Table.States (308), 197, 54);
+ Add_Goto (Table.States (308), 198, 55);
+ Add_Goto (Table.States (308), 199, 56);
+ Add_Goto (Table.States (308), 201, 57);
+ Add_Goto (Table.States (308), 251, 58);
+ Add_Goto (Table.States (308), 252, 59);
+ Add_Goto (Table.States (308), 255, 60);
+ Add_Goto (Table.States (308), 268, 68);
+ Add_Goto (Table.States (308), 311, 83);
+ Table.States (308).Kernel := To_Vector ((((293, 0), 54, 1,
(32767, 0), 0), ((408, 2), 54, 7, (32767,
+ 0), 0), ((408, 3), 54, 5, (32767, 0), 0)));
+ Table.States (308).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (309).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (309), 24, (338, 0), 582);
+ Add_Action (Table.States (309), 61, (434, 0), 299);
+ Add_Action (Table.States (309), 82, (180, 0), 583);
+ Add_Action (Table.States (309), 108, (291, 1), 584);
+ Table.States (309).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (309), 434, 585);
+ Table.States (309).Kernel := To_Vector ((((180, 0), 292, 5,
(32767, 0), 0), ((180, 1), 292, 3, (32767,
+ 0), 0), ((291, 0), 292, 3, (32767, 0), 0), ((291, 1), 292,
1, (32767, 0), 0), ((309, 0), 292, 8,
+ (32767, 0), 0), ((309, 1), 292, 6, (32767, 0), 0), ((338, 0),
292, 5, (32767, 0), 0), ((338, 1),
+ 292, 3, (32767, 0), 0), ((389, 0), 292, 5, (32767, 0), 0),
((389, 1), 292, 3, (32767, 0), 0)));
+ Table.States (309).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (291, 1), 108, 584)));
+ Table.States (310).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (310), 24, Reduce, (292, 0), 1);
+ Add_Action (Table.States (310), 61, Reduce, (292, 0), 1);
+ Add_Action (Table.States (310), 82, (320, 0), 586);
+ Add_Conflict (Table.States (310), 82, (292, 0), 1);
+ Add_Action (Table.States (310), 108, Reduce, (292, 0), 1);
+ Table.States (310).Kernel := To_Vector ((((292, 0), 293, 0,
(292, 0), 1), ((320, 0), 293, 5, (32767,
+ 0), 0), ((320, 1), 293, 3, (32767, 0), 0)));
+ Table.States (310).Minimal_Complete_Actions := To_Vector
(((Reduce, (292, 0), 1), (Shift, (320, 0), 82,
+ 586)));
+ Table.States (311).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (311), 24, Reduce, (292, 1), 1);
+ Add_Action (Table.States (311), 61, Reduce, (292, 1), 1);
+ Add_Action (Table.States (311), 82, (321, 0), 587);
+ Add_Conflict (Table.States (311), 82, (292, 1), 1);
+ Add_Action (Table.States (311), 108, Reduce, (292, 1), 1);
+ Table.States (311).Kernel := To_Vector ((((292, 1), 294, 0,
(292, 1), 1), ((321, 0), 294, 6, (32767,
+ 0), 0), ((321, 1), 294, 4, (32767, 0), 0)));
+ Table.States (311).Minimal_Complete_Actions := To_Vector
(((Reduce, (292, 1), 1), (Shift, (321, 0), 82,
+ 587)));
+ Table.States (312).Action_List.Set_Capacity (42);
+ Add_Action (Table.States (312), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (383,
+ 1), 2);
+ Table.States (312).Kernel := To_Vector ((0 => ((383, 1), 384, 0,
(383, 1), 2)));
+ Table.States (312).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (383, 1), 2)));
+ Table.States (313).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (313), 86, (252, 0), 33);
+ Add_Action (Table.States (313), 90, (268, 0), 34);
+ Add_Action (Table.States (313), 116, (196, 0), 146);
+ Add_Action (Table.States (313), 117, (196, 1), 37);
+ Add_Action (Table.States (313), 118, (195, 6), 38);
+ Table.States (313).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (313), 195, 588);
+ Add_Goto (Table.States (313), 196, 148);
+ Add_Goto (Table.States (313), 197, 54);
+ Add_Goto (Table.States (313), 198, 55);
+ Add_Goto (Table.States (313), 199, 56);
+ Add_Goto (Table.States (313), 201, 57);
+ Add_Goto (Table.States (313), 251, 58);
+ Add_Goto (Table.States (313), 252, 59);
+ Add_Goto (Table.States (313), 255, 60);
+ Add_Goto (Table.States (313), 268, 68);
+ Add_Goto (Table.States (313), 311, 83);
+ Table.States (313).Kernel := To_Vector ((((325, 0), 28, 12,
(32767, 0), 0), ((325, 1), 28, 9, (32767,
+ 0), 0), ((325, 2), 28, 8, (32767, 0), 0), ((325, 3), 28, 9,
(32767, 0), 0), ((325, 4), 28, 6,
+ (32767, 0), 0), ((325, 5), 28, 5, (32767, 0), 0), ((325, 6),
28, 10, (32767, 0), 0), ((325, 7), 28,
+ 7, (32767, 0), 0), ((325, 8), 28, 6, (32767, 0), 0), ((325,
9), 28, 7, (32767, 0), 0), ((325, 10),
+ 28, 4, (32767, 0), 0), ((325, 11), 28, 3, (32767, 0), 0)));
+ Table.States (313).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (314).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (314), 86, (252, 0), 33);
+ Add_Action (Table.States (314), 90, (268, 0), 34);
+ Add_Action (Table.States (314), 116, (196, 0), 146);
+ Add_Action (Table.States (314), 117, (196, 1), 37);
+ Add_Action (Table.States (314), 118, (195, 6), 38);
+ Table.States (314).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (314), 195, 589);
+ Add_Goto (Table.States (314), 196, 148);
+ Add_Goto (Table.States (314), 197, 54);
+ Add_Goto (Table.States (314), 198, 55);
+ Add_Goto (Table.States (314), 199, 56);
+ Add_Goto (Table.States (314), 201, 57);
+ Add_Goto (Table.States (314), 251, 58);
+ Add_Goto (Table.States (314), 252, 59);
+ Add_Goto (Table.States (314), 255, 60);
+ Add_Goto (Table.States (314), 268, 68);
+ Add_Goto (Table.States (314), 311, 83);
+ Table.States (314).Kernel := To_Vector ((0 => ((294, 0), 53, 3,
(32767, 0), 0)));
+ Table.States (314).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (315).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (315), 86, (252, 0), 33);
+ Add_Action (Table.States (315), 90, (268, 0), 34);
+ Add_Action (Table.States (315), 116, (196, 0), 146);
+ Add_Action (Table.States (315), 117, (196, 1), 37);
+ Add_Action (Table.States (315), 118, (195, 6), 38);
+ Table.States (315).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (315), 195, 590);
+ Add_Goto (Table.States (315), 196, 148);
+ Add_Goto (Table.States (315), 197, 54);
+ Add_Goto (Table.States (315), 198, 55);
+ Add_Goto (Table.States (315), 199, 56);
+ Add_Goto (Table.States (315), 201, 57);
+ Add_Goto (Table.States (315), 251, 58);
+ Add_Goto (Table.States (315), 252, 59);
+ Add_Goto (Table.States (315), 255, 60);
+ Add_Goto (Table.States (315), 268, 68);
+ Add_Goto (Table.States (315), 311, 83);
+ Table.States (315).Kernel := To_Vector ((0 => ((293, 0), 54, 1,
(32767, 0), 0)));
+ Table.States (315).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (316).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (316), 61, (434, 0), 299);
+ Add_Action (Table.States (316), 108, (404, 1), 591);
+ Table.States (316).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (316), 434, 592);
+ Table.States (316).Kernel := To_Vector ((((404, 0), 292, 3,
(32767, 0), 0), ((404, 1), 292, 1, (32767,
+ 0), 0)));
+ Table.States (316).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (404, 1), 108, 591)));
+ Table.States (317).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (317), (61, 82, 108), (292, 0), 1);
+ Table.States (317).Kernel := To_Vector ((0 => ((292, 0), 293, 0,
(292, 0), 1)));
+ Table.States (317).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (292, 0), 1)));
+ Table.States (318).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (318), (61, 82, 108), (292, 1), 1);
+ Table.States (318).Kernel := To_Vector ((0 => ((292, 1), 294, 0,
(292, 1), 1)));
+ Table.States (318).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (292, 1), 1)));
+ Table.States (319).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (319), 108, (405, 0), 593);
+ Table.States (319).Kernel := To_Vector ((0 => ((405, 0), 325, 1,
(32767, 0), 0)));
+ Table.States (319).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (405, 0), 108, 593)));
+ Table.States (320).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (320), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (261, 0), 2);
+ Table.States (320).Kernel := To_Vector ((0 => ((261, 0), 262, 0,
(261, 0), 2)));
+ Table.States (320).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (261, 0), 2)));
+ Table.States (321).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (321), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (261, 2), 2);
+ Table.States (321).Kernel := To_Vector ((0 => ((261, 2), 263, 0,
(261, 2), 2)));
+ Table.States (321).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (261, 2), 2)));
+ Table.States (322).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (322), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (462, 1), 2);
+ Table.States (322).Kernel := To_Vector ((((462, 0), 265, 0,
(462, 0), 1), ((462, 1), 265, 0, (462, 1),
+ 2)));
+ Table.States (322).Minimal_Complete_Actions := To_Vector
(((Reduce, (462, 0), 1), (Reduce, (462, 1),
+ 2)));
+ Table.States (323).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (323), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (462, 2), 2);
+ Table.States (323).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (323), 265, 322);
+ Add_Goto (Table.States (323), 462, 323);
+ Table.States (323).Kernel := To_Vector ((((462, 1), 462, 3,
(32767, 0), 0), ((462, 2), 462, 0, (462,
+ 2), 2), ((462, 2), 462, 3, (32767, 0), 0)));
+ Table.States (323).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (462, 2), 2)));
+ Table.States (324).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (324), 12, (402, 0), 165);
+ Add_Action (Table.States (324), 46, (233, 2), 167);
+ Add_Action (Table.States (324), 52, (233, 3), 168);
+ Add_Action (Table.States (324), 65, (234, 1), 169);
+ Add_Action (Table.States (324), 76, (256, 0), 170);
+ Add_Action (Table.States (324), 85, (205, 4), 171);
+ Add_Action (Table.States (324), 86, (213, 2), 172);
+ Add_Action (Table.States (324), 90, (268, 0), 34);
+ Add_Action (Table.States (324), 106, (237, 1), 173);
+ Add_Action (Table.States (324), 107, (237, 0), 174);
+ Add_Action (Table.States (324), 115, (234, 0), 175);
+ Add_Action (Table.States (324), 116, (196, 0), 146);
+ Add_Action (Table.States (324), 117, (196, 1), 37);
+ Add_Action (Table.States (324), 118, (195, 6), 38);
+ Table.States (324).Goto_List.Set_Capacity (31);
+ Add_Goto (Table.States (324), 195, 176);
+ Add_Goto (Table.States (324), 196, 148);
+ Add_Goto (Table.States (324), 197, 54);
+ Add_Goto (Table.States (324), 198, 55);
+ Add_Goto (Table.States (324), 199, 56);
+ Add_Goto (Table.States (324), 201, 57);
+ Add_Goto (Table.States (324), 205, 177);
+ Add_Goto (Table.States (324), 206, 178);
+ Add_Goto (Table.States (324), 210, 179);
+ Add_Goto (Table.States (324), 211, 180);
+ Add_Goto (Table.States (324), 213, 181);
+ Add_Goto (Table.States (324), 214, 182);
+ Add_Goto (Table.States (324), 215, 183);
+ Add_Goto (Table.States (324), 218, 184);
+ Add_Goto (Table.States (324), 219, 185);
+ Add_Goto (Table.States (324), 220, 186);
+ Add_Goto (Table.States (324), 227, 594);
+ Add_Goto (Table.States (324), 228, 188);
+ Add_Goto (Table.States (324), 231, 189);
+ Add_Goto (Table.States (324), 232, 190);
+ Add_Goto (Table.States (324), 233, 191);
+ Add_Goto (Table.States (324), 234, 192);
+ Add_Goto (Table.States (324), 237, 193);
+ Add_Goto (Table.States (324), 251, 58);
+ Add_Goto (Table.States (324), 252, 59);
+ Add_Goto (Table.States (324), 255, 60);
+ Add_Goto (Table.States (324), 256, 194);
+ Add_Goto (Table.States (324), 268, 68);
+ Add_Goto (Table.States (324), 311, 83);
+ Add_Goto (Table.States (324), 402, 195);
+ Add_Goto (Table.States (324), 465, 196);
+ Table.States (324).Kernel := To_Vector ((0 => ((401, 1), 61, 2,
(32767, 0), 0)));
+ Table.States (324).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ end Subr_12;
+ procedure Subr_13
+ is begin
+ Table.States (325).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (325), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (401, 2), 3);
+ Table.States (325).Kernel := To_Vector ((0 => ((401, 2), 108, 0,
(401, 2), 3)));
+ Table.States (325).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (401, 2), 3)));
+ Table.States (326).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (326), 85, (198, 0), 281);
+ Add_Action (Table.States (326), 87, (393, 0), 595);
+ Add_Action (Table.States (326), 96, (197, 0), 283);
+ Add_Action (Table.States (326), 113, (121, 0), 285);
+ Add_Action (Table.States (326), 114, (121, 1), 286);
+ Table.States (326).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (326), 121, 287);
+ Add_Goto (Table.States (326), 313, 289);
+ Table.States (326).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0), ((393, 0),
195, 7, (32767, 0), 0)));
+ Table.States (326).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (393, 0), 87, 595)));
+ Table.States (327).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (327), (41, 49, 66), (375, 0), 2);
+ Table.States (327).Kernel := To_Vector ((0 => ((375, 0), 108, 0,
(375, 0), 2)));
+ Table.States (327).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (375, 0), 2)));
+ Table.States (328).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (328), 99, (371, 0), 596);
+ Table.States (328).Kernel := To_Vector ((0 => ((371, 0), 243, 1,
(32767, 0), 0)));
+ Table.States (328).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (371, 0), 99, 596)));
+ Table.States (329).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (329), (41, 43, 49, 66), (260, 0), 1);
+ Table.States (329).Kernel := To_Vector ((0 => ((260, 0), 259, 0,
(260, 0), 1)));
+ Table.States (329).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (260, 0), 1)));
+ Table.States (330).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (330), 41, Reduce, (377, 0), 2);
+ Add_Action (Table.States (330), 43, Reduce, (380, 0), 2);
+ Add_Action (Table.States (330), 49, Reduce, (377, 0), 2);
+ Table.States (330).Kernel := To_Vector ((((377, 0), 260, 0,
(377, 0), 2), ((380, 0), 260, 0, (380, 0),
+ 2)));
+ Table.States (330).Minimal_Complete_Actions := To_Vector
(((Reduce, (377, 0), 2), (Reduce, (380, 0),
+ 2)));
+ Table.States (331).Action_List.Set_Capacity (33);
+ Add_Action (Table.States (331), (12, 15, 17, 18, 19, 20, 23, 30,
31, 32, 35, 36, 37, 38, 39, 41, 42, 43,
+ 44, 49, 51, 63, 64, 65, 66, 75, 84, 86, 90, 105, 116, 117, 118),
(461, 0), 1);
+ Table.States (331).Kernel := To_Vector ((0 => ((461, 0), 261, 0,
(461, 0), 1)));
+ Table.States (331).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (461, 0), 1)));
+ Table.States (332).Action_List.Set_Capacity (33);
+ Add_Action (Table.States (332), 12, (401, 0), 1);
+ Add_Action (Table.States (332), 15, (370, 0), 3);
+ Add_Action (Table.States (332), 17, (365, 0), 4);
+ Add_Action (Table.States (332), 18, (382, 0), 5);
+ Add_Action (Table.States (332), 19, (363, 0), 6);
+ Add_Action (Table.States (332), 20, (357, 0), 7);
+ Add_Action (Table.States (332), 23, Reduce, (259, 1), 1);
+ Add_Action (Table.States (332), 30, (316, 0), 13);
+ Add_Action (Table.States (332), 31, (290, 0), 14);
+ Add_Action (Table.States (332), 32, (289, 0), 15);
+ Add_Action (Table.States (332), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (332), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (332), 37, (288, 0), 17);
+ Add_Conflict (Table.States (332), 37, (285, 1), 0);
+ Add_Action (Table.States (332), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (332), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (332), 41, Reduce, (259, 1), 1);
+ Add_Action (Table.States (332), 42, (271, 0), 18);
+ Add_Action (Table.States (332), 43, Reduce, (259, 1), 1);
+ Add_Action (Table.States (332), 44, Reduce, (259, 1), 1);
+ Add_Action (Table.States (332), 49, Reduce, (259, 1), 1);
+ Add_Action (Table.States (332), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (332), 63, Reduce, (259, 1), 1);
+ Add_Action (Table.States (332), 64, (273, 0), 27);
+ Add_Action (Table.States (332), 65, (264, 0), 28);
+ Add_Action (Table.States (332), 66, Reduce, (259, 1), 1);
+ Add_Action (Table.States (332), 75, Reduce, (259, 1), 1);
+ Add_Action (Table.States (332), 84, (124, 0), 32);
+ Add_Action (Table.States (332), 86, (252, 0), 33);
+ Add_Action (Table.States (332), 90, (268, 0), 34);
+ Add_Action (Table.States (332), 105, (265, 0), 35);
+ Add_Action (Table.States (332), 116, (196, 0), 146);
+ Add_Action (Table.States (332), 117, (196, 1), 37);
+ Add_Action (Table.States (332), 118, (195, 6), 38);
+ Table.States (332).Goto_List.Set_Capacity (44);
+ Add_Goto (Table.States (332), 124, 39);
+ Add_Goto (Table.States (332), 195, 52);
+ Add_Goto (Table.States (332), 196, 53);
+ Add_Goto (Table.States (332), 197, 54);
+ Add_Goto (Table.States (332), 198, 55);
+ Add_Goto (Table.States (332), 199, 56);
+ Add_Goto (Table.States (332), 201, 57);
+ Add_Goto (Table.States (332), 251, 58);
+ Add_Goto (Table.States (332), 252, 59);
+ Add_Goto (Table.States (332), 255, 60);
+ Add_Goto (Table.States (332), 261, 597);
+ Add_Goto (Table.States (332), 262, 62);
+ Add_Goto (Table.States (332), 263, 63);
+ Add_Goto (Table.States (332), 264, 64);
+ Add_Goto (Table.States (332), 265, 65);
+ Add_Goto (Table.States (332), 266, 66);
+ Add_Goto (Table.States (332), 267, 67);
+ Add_Goto (Table.States (332), 268, 68);
+ Add_Goto (Table.States (332), 271, 69);
+ Add_Goto (Table.States (332), 273, 70);
+ Add_Goto (Table.States (332), 275, 71);
+ Add_Goto (Table.States (332), 285, 72);
+ Add_Goto (Table.States (332), 286, 73);
+ Add_Goto (Table.States (332), 288, 74);
+ Add_Goto (Table.States (332), 289, 75);
+ Add_Goto (Table.States (332), 290, 76);
+ Add_Goto (Table.States (332), 310, 82);
+ Add_Goto (Table.States (332), 311, 83);
+ Add_Goto (Table.States (332), 316, 84);
+ Add_Goto (Table.States (332), 318, 85);
+ Add_Goto (Table.States (332), 357, 110);
+ Add_Goto (Table.States (332), 363, 111);
+ Add_Goto (Table.States (332), 364, 112);
+ Add_Goto (Table.States (332), 365, 113);
+ Add_Goto (Table.States (332), 366, 114);
+ Add_Goto (Table.States (332), 367, 115);
+ Add_Goto (Table.States (332), 370, 116);
+ Add_Goto (Table.States (332), 376, 117);
+ Add_Goto (Table.States (332), 378, 118);
+ Add_Goto (Table.States (332), 379, 119);
+ Add_Goto (Table.States (332), 382, 120);
+ Add_Goto (Table.States (332), 401, 133);
+ Add_Goto (Table.States (332), 461, 598);
+ Add_Goto (Table.States (332), 462, 599);
+ Table.States (332).Kernel := To_Vector ((((259, 0), 461, 3,
(32767, 0), 0), ((259, 1), 461, 0, (259,
+ 1), 1), ((461, 1), 461, 2, (32767, 0), 0), ((461, 2), 461,
2, (32767, 0), 0)));
+ Table.States (332).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (259, 1), 1)));
+ Table.States (333).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (333), (41, 49, 66), (373, 0), 2);
+ Table.States (333).Kernel := To_Vector ((0 => ((373, 0), 260, 0,
(373, 0), 2)));
+ Table.States (333).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (373, 0), 2)));
+ Table.States (334).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (334), 41, Reduce, (374, 0), 2);
+ Add_Action (Table.States (334), 43, Reduce, (380, 1), 2);
+ Add_Action (Table.States (334), 49, Reduce, (374, 0), 2);
+ Add_Action (Table.States (334), 66, Reduce, (374, 0), 2);
+ Table.States (334).Kernel := To_Vector ((((374, 0), 260, 0,
(374, 0), 2), ((380, 1), 260, 0, (380, 1),
+ 2)));
+ Table.States (334).Minimal_Complete_Actions := To_Vector
(((Reduce, (374, 0), 2), (Reduce, (380, 1),
+ 2)));
+ Table.States (335).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (335), 12, (401, 0), 1);
+ Add_Action (Table.States (335), 15, (370, 0), 3);
+ Add_Action (Table.States (335), 17, (365, 0), 4);
+ Add_Action (Table.States (335), 18, (382, 0), 5);
+ Add_Action (Table.States (335), 19, (363, 0), 6);
+ Add_Action (Table.States (335), 20, (357, 0), 7);
+ Add_Action (Table.States (335), 30, (316, 0), 13);
+ Add_Action (Table.States (335), 31, (290, 0), 14);
+ Add_Action (Table.States (335), 32, (289, 0), 15);
+ Add_Action (Table.States (335), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (335), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (335), 37, (288, 0), 17);
+ Add_Conflict (Table.States (335), 37, (285, 1), 0);
+ Add_Action (Table.States (335), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (335), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (335), 42, (271, 0), 18);
+ Add_Action (Table.States (335), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (335), 64, (273, 0), 27);
+ Add_Action (Table.States (335), 65, (264, 0), 28);
+ Add_Action (Table.States (335), 84, (124, 0), 32);
+ Add_Action (Table.States (335), 86, (252, 0), 33);
+ Add_Action (Table.States (335), 90, (268, 0), 34);
+ Add_Action (Table.States (335), 105, (265, 0), 35);
+ Add_Action (Table.States (335), 116, (196, 0), 146);
+ Add_Action (Table.States (335), 117, (196, 1), 37);
+ Add_Action (Table.States (335), 118, (195, 6), 38);
+ Table.States (335).Goto_List.Set_Capacity (45);
+ Add_Goto (Table.States (335), 124, 39);
+ Add_Goto (Table.States (335), 195, 52);
+ Add_Goto (Table.States (335), 196, 53);
+ Add_Goto (Table.States (335), 197, 54);
+ Add_Goto (Table.States (335), 198, 55);
+ Add_Goto (Table.States (335), 199, 56);
+ Add_Goto (Table.States (335), 201, 57);
+ Add_Goto (Table.States (335), 251, 58);
+ Add_Goto (Table.States (335), 252, 59);
+ Add_Goto (Table.States (335), 255, 60);
+ Add_Goto (Table.States (335), 259, 600);
+ Add_Goto (Table.States (335), 261, 331);
+ Add_Goto (Table.States (335), 262, 62);
+ Add_Goto (Table.States (335), 263, 63);
+ Add_Goto (Table.States (335), 264, 64);
+ Add_Goto (Table.States (335), 265, 65);
+ Add_Goto (Table.States (335), 266, 66);
+ Add_Goto (Table.States (335), 267, 67);
+ Add_Goto (Table.States (335), 268, 68);
+ Add_Goto (Table.States (335), 271, 69);
+ Add_Goto (Table.States (335), 273, 70);
+ Add_Goto (Table.States (335), 275, 71);
+ Add_Goto (Table.States (335), 285, 72);
+ Add_Goto (Table.States (335), 286, 73);
+ Add_Goto (Table.States (335), 288, 74);
+ Add_Goto (Table.States (335), 289, 75);
+ Add_Goto (Table.States (335), 290, 76);
+ Add_Goto (Table.States (335), 310, 82);
+ Add_Goto (Table.States (335), 311, 83);
+ Add_Goto (Table.States (335), 316, 84);
+ Add_Goto (Table.States (335), 318, 85);
+ Add_Goto (Table.States (335), 357, 110);
+ Add_Goto (Table.States (335), 363, 111);
+ Add_Goto (Table.States (335), 364, 112);
+ Add_Goto (Table.States (335), 365, 113);
+ Add_Goto (Table.States (335), 366, 114);
+ Add_Goto (Table.States (335), 367, 115);
+ Add_Goto (Table.States (335), 370, 116);
+ Add_Goto (Table.States (335), 376, 117);
+ Add_Goto (Table.States (335), 378, 118);
+ Add_Goto (Table.States (335), 379, 119);
+ Add_Goto (Table.States (335), 382, 120);
+ Add_Goto (Table.States (335), 401, 133);
+ Add_Goto (Table.States (335), 461, 332);
+ Add_Goto (Table.States (335), 462, 144);
+ Table.States (335).Kernel := To_Vector ((0 => ((370, 0), 41, 5,
(32767, 0), 0)));
+ Table.States (335).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ Table.States (336).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (336), 14, (375, 0), 150);
+ Add_Action (Table.States (336), 17, (365, 0), 4);
+ Add_Action (Table.States (336), 20, (357, 0), 7);
+ Add_Action (Table.States (336), 63, (371, 0), 151);
+ Table.States (336).Goto_List.Set_Capacity (10);
+ Add_Goto (Table.States (336), 357, 154);
+ Add_Goto (Table.States (336), 364, 338);
+ Add_Goto (Table.States (336), 365, 113);
+ Add_Goto (Table.States (336), 366, 114);
+ Add_Goto (Table.States (336), 368, 601);
+ Add_Goto (Table.States (336), 371, 158);
+ Add_Goto (Table.States (336), 372, 159);
+ Add_Goto (Table.States (336), 373, 160);
+ Add_Goto (Table.States (336), 374, 161);
+ Add_Goto (Table.States (336), 375, 162);
+ Table.States (336).Kernel := To_Vector ((0 => ((369, 1), 49, 2,
(32767, 0), 0)));
+ Table.States (336).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (375, 0), 14, 150)));
+ Table.States (337).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (337), 15, (370, 1), 602);
+ Table.States (337).Kernel := To_Vector ((0 => ((370, 1), 66, 2,
(32767, 0), 0)));
+ Table.States (337).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (370, 1), 15, 602)));
+ Table.States (338).Action_List.Set_Capacity (28);
+ Add_Action (Table.States (338), 12, (401, 0), 1);
+ Add_Action (Table.States (338), 15, (370, 0), 3);
+ Add_Action (Table.States (338), 17, (365, 0), 4);
+ Add_Action (Table.States (338), 18, (382, 0), 5);
+ Add_Action (Table.States (338), 19, (363, 0), 6);
+ Add_Action (Table.States (338), 20, (357, 0), 7);
+ Add_Action (Table.States (338), 30, (316, 0), 13);
+ Add_Action (Table.States (338), 31, (290, 0), 14);
+ Add_Action (Table.States (338), 32, (289, 0), 15);
+ Add_Action (Table.States (338), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (338), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (338), 37, (288, 0), 17);
+ Add_Conflict (Table.States (338), 37, (285, 1), 0);
+ Add_Action (Table.States (338), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (338), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (338), 41, Reduce, (260, 1), 0);
+ Add_Action (Table.States (338), 42, (271, 0), 18);
+ Add_Action (Table.States (338), 49, Reduce, (260, 1), 0);
+ Add_Action (Table.States (338), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (338), 64, (273, 0), 27);
+ Add_Action (Table.States (338), 65, (264, 0), 28);
+ Add_Action (Table.States (338), 66, Reduce, (260, 1), 0);
+ Add_Action (Table.States (338), 84, (124, 0), 32);
+ Add_Action (Table.States (338), 86, (252, 0), 33);
+ Add_Action (Table.States (338), 90, (268, 0), 34);
+ Add_Action (Table.States (338), 105, (265, 0), 35);
+ Add_Action (Table.States (338), 116, (196, 0), 146);
+ Add_Action (Table.States (338), 117, (196, 1), 37);
+ Add_Action (Table.States (338), 118, (195, 6), 38);
+ Table.States (338).Goto_List.Set_Capacity (46);
+ Add_Goto (Table.States (338), 124, 39);
+ Add_Goto (Table.States (338), 195, 52);
+ Add_Goto (Table.States (338), 196, 53);
+ Add_Goto (Table.States (338), 197, 54);
+ Add_Goto (Table.States (338), 198, 55);
+ Add_Goto (Table.States (338), 199, 56);
+ Add_Goto (Table.States (338), 201, 57);
+ Add_Goto (Table.States (338), 251, 58);
+ Add_Goto (Table.States (338), 252, 59);
+ Add_Goto (Table.States (338), 255, 60);
+ Add_Goto (Table.States (338), 259, 329);
+ Add_Goto (Table.States (338), 260, 603);
+ Add_Goto (Table.States (338), 261, 331);
+ Add_Goto (Table.States (338), 262, 62);
+ Add_Goto (Table.States (338), 263, 63);
+ Add_Goto (Table.States (338), 264, 64);
+ Add_Goto (Table.States (338), 265, 65);
+ Add_Goto (Table.States (338), 266, 66);
+ Add_Goto (Table.States (338), 267, 67);
+ Add_Goto (Table.States (338), 268, 68);
+ Add_Goto (Table.States (338), 271, 69);
+ Add_Goto (Table.States (338), 273, 70);
+ Add_Goto (Table.States (338), 275, 71);
+ Add_Goto (Table.States (338), 285, 72);
+ Add_Goto (Table.States (338), 286, 73);
+ Add_Goto (Table.States (338), 288, 74);
+ Add_Goto (Table.States (338), 289, 75);
+ Add_Goto (Table.States (338), 290, 76);
+ Add_Goto (Table.States (338), 310, 82);
+ Add_Goto (Table.States (338), 311, 83);
+ Add_Goto (Table.States (338), 316, 84);
+ Add_Goto (Table.States (338), 318, 85);
+ Add_Goto (Table.States (338), 357, 110);
+ Add_Goto (Table.States (338), 363, 111);
+ Add_Goto (Table.States (338), 364, 112);
+ Add_Goto (Table.States (338), 365, 113);
+ Add_Goto (Table.States (338), 366, 114);
+ Add_Goto (Table.States (338), 367, 115);
+ Add_Goto (Table.States (338), 370, 116);
+ Add_Goto (Table.States (338), 376, 117);
+ Add_Goto (Table.States (338), 378, 118);
+ Add_Goto (Table.States (338), 379, 119);
+ Add_Goto (Table.States (338), 382, 120);
+ Add_Goto (Table.States (338), 401, 133);
+ Add_Goto (Table.States (338), 461, 332);
+ Add_Goto (Table.States (338), 462, 144);
+ Table.States (338).Kernel := To_Vector ((0 => ((374, 0), 364, 0,
(260, 1), 0)));
+ Table.States (338).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (260, 1), 0)));
+ Table.States (339).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (339), (41, 49, 66), (368, 0), 2);
+ Table.States (339).Kernel := To_Vector ((0 => ((368, 0), 372, 0,
(368, 0), 2)));
+ Table.States (339).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (368, 0), 2)));
+ Table.States (340).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (340), 12, (401, 0), 1);
+ Add_Action (Table.States (340), 15, (370, 0), 3);
+ Add_Action (Table.States (340), 17, (365, 0), 4);
+ Add_Action (Table.States (340), 18, (382, 0), 5);
+ Add_Action (Table.States (340), 19, (363, 0), 6);
+ Add_Action (Table.States (340), 20, (357, 0), 7);
+ Add_Action (Table.States (340), 30, (316, 0), 13);
+ Add_Action (Table.States (340), 31, (290, 0), 14);
+ Add_Action (Table.States (340), 32, (289, 0), 15);
+ Add_Action (Table.States (340), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (340), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (340), 37, (288, 0), 17);
+ Add_Conflict (Table.States (340), 37, (285, 1), 0);
+ Add_Action (Table.States (340), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (340), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (340), 42, (271, 0), 18);
+ Add_Action (Table.States (340), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (340), 64, (273, 0), 27);
+ Add_Action (Table.States (340), 65, (264, 0), 28);
+ Add_Action (Table.States (340), 84, (124, 0), 32);
+ Add_Action (Table.States (340), 86, (252, 0), 33);
+ Add_Action (Table.States (340), 90, (268, 0), 34);
+ Add_Action (Table.States (340), 105, (265, 0), 35);
+ Add_Action (Table.States (340), 116, (196, 0), 146);
+ Add_Action (Table.States (340), 117, (196, 1), 37);
+ Add_Action (Table.States (340), 118, (195, 6), 38);
+ Table.States (340).Goto_List.Set_Capacity (45);
+ Add_Goto (Table.States (340), 124, 39);
+ Add_Goto (Table.States (340), 195, 52);
+ Add_Goto (Table.States (340), 196, 53);
+ Add_Goto (Table.States (340), 197, 54);
+ Add_Goto (Table.States (340), 198, 55);
+ Add_Goto (Table.States (340), 199, 56);
+ Add_Goto (Table.States (340), 201, 57);
+ Add_Goto (Table.States (340), 251, 58);
+ Add_Goto (Table.States (340), 252, 59);
+ Add_Goto (Table.States (340), 255, 60);
+ Add_Goto (Table.States (340), 259, 604);
+ Add_Goto (Table.States (340), 261, 331);
+ Add_Goto (Table.States (340), 262, 62);
+ Add_Goto (Table.States (340), 263, 63);
+ Add_Goto (Table.States (340), 264, 64);
+ Add_Goto (Table.States (340), 265, 65);
+ Add_Goto (Table.States (340), 266, 66);
+ Add_Goto (Table.States (340), 267, 67);
+ Add_Goto (Table.States (340), 268, 68);
+ Add_Goto (Table.States (340), 271, 69);
+ Add_Goto (Table.States (340), 273, 70);
+ Add_Goto (Table.States (340), 275, 71);
+ Add_Goto (Table.States (340), 285, 72);
+ Add_Goto (Table.States (340), 286, 73);
+ Add_Goto (Table.States (340), 288, 74);
+ Add_Goto (Table.States (340), 289, 75);
+ Add_Goto (Table.States (340), 290, 76);
+ Add_Goto (Table.States (340), 310, 82);
+ Add_Goto (Table.States (340), 311, 83);
+ Add_Goto (Table.States (340), 316, 84);
+ Add_Goto (Table.States (340), 318, 85);
+ Add_Goto (Table.States (340), 357, 110);
+ Add_Goto (Table.States (340), 363, 111);
+ Add_Goto (Table.States (340), 364, 112);
+ Add_Goto (Table.States (340), 365, 113);
+ Add_Goto (Table.States (340), 366, 114);
+ Add_Goto (Table.States (340), 367, 115);
+ Add_Goto (Table.States (340), 370, 116);
+ Add_Goto (Table.States (340), 376, 117);
+ Add_Goto (Table.States (340), 378, 118);
+ Add_Goto (Table.States (340), 379, 119);
+ Add_Goto (Table.States (340), 382, 120);
+ Add_Goto (Table.States (340), 401, 133);
+ Add_Goto (Table.States (340), 461, 332);
+ Add_Goto (Table.States (340), 462, 144);
+ Table.States (340).Kernel := To_Vector ((0 => ((378, 0), 41, 5,
(32767, 0), 0)));
+ Table.States (340).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ end Subr_13;
+ procedure Subr_14
+ is begin
+ Table.States (341).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (341), 17, (365, 0), 4);
+ Table.States (341).Goto_List.Set_Capacity (4);
+ Add_Goto (Table.States (341), 364, 338);
+ Add_Goto (Table.States (341), 365, 113);
+ Add_Goto (Table.States (341), 366, 114);
+ Add_Goto (Table.States (341), 374, 605);
+ Table.States (341).Kernel := To_Vector ((0 => ((376, 0), 49, 6,
(32767, 0), 0)));
+ Table.States (341).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (365, 0), 17, 4)));
+ Table.States (342).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (342), 18, (379, 0), 606);
+ Table.States (342).Kernel := To_Vector ((0 => ((379, 0), 43, 6,
(32767, 0), 0)));
+ Table.States (342).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (379, 0), 18, 606)));
+ Table.States (343).Action_List.Set_Capacity (24);
+ Add_Action (Table.States (343), 33, Reduce, (402, 1), 2);
+ Add_Action (Table.States (343), 36, Reduce, (402, 1), 2);
+ Add_Action (Table.States (343), 41, Reduce, (402, 1), 2);
+ Add_Action (Table.States (343), 43, Reduce, (402, 1), 2);
+ Add_Action (Table.States (343), 44, Reduce, (402, 1), 2);
+ Add_Action (Table.States (343), 48, Reduce, (402, 1), 2);
+ Add_Action (Table.States (343), 49, Reduce, (402, 1), 2);
+ Add_Action (Table.States (343), 50, Reduce, (402, 1), 2);
+ Add_Action (Table.States (343), 61, (402, 0), 607);
+ Add_Conflict (Table.States (343), 61, (402, 1), 2);
+ Add_Action (Table.States (343), 63, Reduce, (402, 1), 2);
+ Add_Action (Table.States (343), 72, Reduce, (402, 1), 2);
+ Add_Action (Table.States (343), 74, Reduce, (402, 1), 2);
+ Add_Action (Table.States (343), 75, Reduce, (402, 1), 2);
+ Add_Action (Table.States (343), 82, Reduce, (402, 1), 2);
+ Add_Action (Table.States (343), 85, (198, 0), 281);
+ Add_Action (Table.States (343), 87, Reduce, (402, 1), 2);
+ Add_Action (Table.States (343), 88, Reduce, (402, 1), 2);
+ Add_Action (Table.States (343), 91, Reduce, (402, 1), 2);
+ Add_Action (Table.States (343), 95, Reduce, (402, 1), 2);
+ Add_Action (Table.States (343), 96, (197, 0), 283);
+ Add_Action (Table.States (343), 99, Reduce, (402, 1), 2);
+ Add_Action (Table.States (343), 108, Reduce, (402, 1), 2);
+ Add_Action (Table.States (343), 113, (121, 0), 285);
+ Add_Action (Table.States (343), 114, (121, 1), 286);
+ Table.States (343).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (343), 121, 287);
+ Add_Goto (Table.States (343), 313, 289);
+ Table.States (343).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0), ((402, 0),
195, 2, (32767, 0), 0), ((402, 1),
+ 195, 0, (402, 1), 2)));
+ Table.States (343).Minimal_Complete_Actions := To_Vector (((Shift,
(402, 0), 61, 607), (Reduce, (402, 1),
+ 2)));
+ Table.States (344).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (344), 108, (365, 0), 608);
+ Table.States (344).Kernel := To_Vector ((0 => ((365, 0), 227, 1,
(32767, 0), 0)));
+ Table.States (344).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (365, 0), 108, 608)));
+ Table.States (345).Action_List.Set_Capacity (38);
+ Add_Action (Table.States (345), (33, 36, 41, 43, 44, 45, 47, 48,
49, 50, 52, 61, 63, 69, 72, 73, 74, 75,
+ 82, 87, 88, 89, 91, 94, 95, 97, 98, 99, 100, 101, 103, 104, 106,
107, 108, 109, 110, 111), (233, 2), 2);
+ Table.States (345).Kernel := To_Vector ((0 => ((233, 2), 234, 0,
(233, 2), 2)));
+ Table.States (345).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (233, 2), 2)));
+ Table.States (346).Action_List.Set_Capacity (38);
+ Add_Action (Table.States (346), (33, 36, 41, 43, 44, 45, 47, 48,
49, 50, 52, 61, 63, 69, 72, 73, 74, 75,
+ 82, 87, 88, 89, 91, 94, 95, 97, 98, 99, 100, 101, 103, 104, 106,
107, 108, 109, 110, 111), (233, 3), 2);
+ Table.States (346).Kernel := To_Vector ((0 => ((233, 3), 234, 0,
(233, 3), 2)));
+ Table.States (346).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (233, 3), 2)));
+ Table.States (347).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (347), 65, (187, 0), 609);
+ Table.States (347).Kernel := To_Vector ((0 => ((187, 0), 52, 1,
(32767, 0), 0)));
+ Table.States (347).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (187, 0), 65, 609)));
+ Table.States (348).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (348), 86, (252, 0), 33);
+ Add_Action (Table.States (348), 90, (268, 0), 34);
+ Add_Action (Table.States (348), 116, (196, 0), 146);
+ Add_Action (Table.States (348), 117, (196, 1), 37);
+ Add_Action (Table.States (348), 118, (195, 6), 38);
+ Table.States (348).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (348), 195, 610);
+ Add_Goto (Table.States (348), 196, 148);
+ Add_Goto (Table.States (348), 197, 54);
+ Add_Goto (Table.States (348), 198, 55);
+ Add_Goto (Table.States (348), 199, 56);
+ Add_Goto (Table.States (348), 201, 57);
+ Add_Goto (Table.States (348), 251, 58);
+ Add_Goto (Table.States (348), 252, 59);
+ Add_Goto (Table.States (348), 255, 60);
+ Add_Goto (Table.States (348), 268, 68);
+ Add_Goto (Table.States (348), 311, 83);
+ Table.States (348).Kernel := To_Vector ((0 => ((258, 0), 85, 2,
(32767, 0), 0)));
+ Table.States (348).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (349).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (349), 86, (252, 0), 33);
+ Add_Action (Table.States (349), 90, (268, 0), 34);
+ Add_Action (Table.States (349), 116, (196, 0), 146);
+ Add_Action (Table.States (349), 117, (196, 1), 37);
+ Add_Action (Table.States (349), 118, (195, 6), 38);
+ Table.States (349).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (349), 195, 611);
+ Add_Goto (Table.States (349), 196, 148);
+ Add_Goto (Table.States (349), 197, 54);
+ Add_Goto (Table.States (349), 198, 55);
+ Add_Goto (Table.States (349), 199, 56);
+ Add_Goto (Table.States (349), 201, 57);
+ Add_Goto (Table.States (349), 251, 58);
+ Add_Goto (Table.States (349), 252, 59);
+ Add_Goto (Table.States (349), 255, 60);
+ Add_Goto (Table.States (349), 268, 68);
+ Add_Goto (Table.States (349), 311, 83);
+ Table.States (349).Kernel := To_Vector ((((257, 0), 187, 1,
(32767, 0), 0), ((257, 2), 187, 6, (32767,
+ 0), 0)));
+ Table.States (349).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (350).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (350), 33, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 36, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 41, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 43, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 44, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 45, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 47, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 48, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 49, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 50, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 52, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 61, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 63, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 69, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 72, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 73, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 74, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 75, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 82, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 85, (162, 0), 612);
+ Add_Action (Table.States (350), 87, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 88, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 89, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 91, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 94, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 95, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 96, (197, 0), 283);
+ Add_Action (Table.States (350), 97, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 98, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 99, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 100, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 101, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 103, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 104, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 106, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 107, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 108, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 109, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 110, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 111, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 112, Reduce, (257, 1), 1);
+ Add_Action (Table.States (350), 113, (121, 0), 285);
+ Add_Action (Table.States (350), 114, (121, 1), 286);
+ Table.States (350).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (350), 121, 287);
+ Add_Goto (Table.States (350), 162, 613);
+ Add_Goto (Table.States (350), 313, 289);
+ Table.States (350).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((257, 1), 195, 0, (257, 1), 1), ((257, 3),
195, 5, (32767, 0), 0), ((311, 0), 195,
+ 3, (32767, 0), 0)));
+ Table.States (350).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (257, 1), 1)));
+ Table.States (351).Action_List.Set_Capacity (39);
+ Add_Action (Table.States (351), (33, 36, 41, 43, 44, 45, 47, 48,
49, 50, 52, 61, 63, 69, 72, 73, 74, 75,
+ 82, 87, 88, 89, 91, 94, 95, 97, 98, 99, 100, 101, 103, 104, 106,
107, 108, 109, 110, 111, 112), (256, 1),
+ 2);
+ Table.States (351).Kernel := To_Vector ((0 => ((256, 1), 257, 0,
(256, 1), 2)));
+ Table.States (351).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (256, 1), 2)));
+ Table.States (352).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (352), 52, (187, 0), 347);
+ Add_Action (Table.States (352), 86, (252, 0), 33);
+ Add_Action (Table.States (352), 90, (268, 0), 34);
+ Add_Action (Table.States (352), 116, (196, 0), 146);
+ Add_Action (Table.States (352), 117, (196, 1), 37);
+ Add_Action (Table.States (352), 118, (195, 6), 38);
+ Table.States (352).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (352), 187, 349);
+ Add_Goto (Table.States (352), 195, 350);
+ Add_Goto (Table.States (352), 196, 148);
+ Add_Goto (Table.States (352), 197, 54);
+ Add_Goto (Table.States (352), 198, 55);
+ Add_Goto (Table.States (352), 199, 56);
+ Add_Goto (Table.States (352), 201, 57);
+ Add_Goto (Table.States (352), 251, 58);
+ Add_Goto (Table.States (352), 252, 59);
+ Add_Goto (Table.States (352), 255, 60);
+ Add_Goto (Table.States (352), 257, 614);
+ Add_Goto (Table.States (352), 268, 68);
+ Add_Goto (Table.States (352), 311, 83);
+ Table.States (352).Kernel := To_Vector ((0 => ((256, 0), 258, 1,
(32767, 0), 0)));
+ Table.States (352).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (353).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (353), 38, (249, 1), 615);
+ Add_Action (Table.States (353), 59, (347, 0), 616);
+ Add_Action (Table.States (353), 60, (341, 0), 617);
+ Add_Action (Table.States (353), 116, (136, 0), 618);
+ Table.States (353).Goto_List.Set_Capacity (7);
+ Add_Goto (Table.States (353), 135, 619);
+ Add_Goto (Table.States (353), 136, 620);
+ Add_Goto (Table.States (353), 250, 621);
+ Add_Goto (Table.States (353), 335, 622);
+ Add_Goto (Table.States (353), 341, 104);
+ Add_Goto (Table.States (353), 347, 107);
+ Add_Goto (Table.States (353), 460, 623);
+ Table.States (353).Kernel := To_Vector ((((249, 0), 39, 5,
(32767, 0), 0), ((249, 1), 39, 2, (32767,
+ 0), 0)));
+ Table.States (353).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (249, 1), 38, 615)));
+ Table.States (354).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (354), 12, (402, 0), 165);
+ Add_Action (Table.States (354), 46, (233, 2), 167);
+ Add_Action (Table.States (354), 52, (233, 3), 168);
+ Add_Action (Table.States (354), 65, (234, 1), 169);
+ Add_Action (Table.States (354), 76, (256, 0), 170);
+ Add_Action (Table.States (354), 85, (205, 4), 171);
+ Add_Action (Table.States (354), 86, (213, 2), 172);
+ Add_Action (Table.States (354), 90, (268, 0), 34);
+ Add_Action (Table.States (354), 106, (237, 1), 173);
+ Add_Action (Table.States (354), 107, (237, 0), 174);
+ Add_Action (Table.States (354), 115, (234, 0), 175);
+ Add_Action (Table.States (354), 116, (196, 0), 146);
+ Add_Action (Table.States (354), 117, (196, 1), 37);
+ Add_Action (Table.States (354), 118, (195, 6), 38);
+ Table.States (354).Goto_List.Set_Capacity (32);
+ Add_Goto (Table.States (354), 195, 176);
+ Add_Goto (Table.States (354), 196, 148);
+ Add_Goto (Table.States (354), 197, 54);
+ Add_Goto (Table.States (354), 198, 55);
+ Add_Goto (Table.States (354), 199, 56);
+ Add_Goto (Table.States (354), 201, 57);
+ Add_Goto (Table.States (354), 205, 177);
+ Add_Goto (Table.States (354), 206, 178);
+ Add_Goto (Table.States (354), 210, 179);
+ Add_Goto (Table.States (354), 211, 180);
+ Add_Goto (Table.States (354), 213, 181);
+ Add_Goto (Table.States (354), 214, 182);
+ Add_Goto (Table.States (354), 215, 183);
+ Add_Goto (Table.States (354), 218, 184);
+ Add_Goto (Table.States (354), 219, 185);
+ Add_Goto (Table.States (354), 220, 186);
+ Add_Goto (Table.States (354), 227, 236);
+ Add_Goto (Table.States (354), 228, 188);
+ Add_Goto (Table.States (354), 231, 189);
+ Add_Goto (Table.States (354), 232, 190);
+ Add_Goto (Table.States (354), 233, 191);
+ Add_Goto (Table.States (354), 234, 192);
+ Add_Goto (Table.States (354), 237, 193);
+ Add_Goto (Table.States (354), 243, 624);
+ Add_Goto (Table.States (354), 251, 58);
+ Add_Goto (Table.States (354), 252, 59);
+ Add_Goto (Table.States (354), 255, 60);
+ Add_Goto (Table.States (354), 256, 194);
+ Add_Goto (Table.States (354), 268, 68);
+ Add_Goto (Table.States (354), 311, 83);
+ Add_Goto (Table.States (354), 402, 195);
+ Add_Goto (Table.States (354), 465, 196);
+ Table.States (354).Kernel := To_Vector ((((242, 0), 42, 9,
(32767, 0), 0), ((242, 1), 42, 7, (32767,
+ 0), 0), ((242, 2), 42, 5, (32767, 0), 0), ((242, 3), 42, 3,
(32767, 0), 0)));
+ Table.States (354).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (355).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (355), 40, (248, 1), 625);
+ Add_Action (Table.States (355), 55, (248, 0), 626);
+ Add_Action (Table.States (355), 116, (278, 0), 454);
+ Table.States (355).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (355), 248, 627);
+ Add_Goto (Table.States (355), 278, 508);
+ Add_Goto (Table.States (355), 280, 509);
+ Table.States (355).Kernel := To_Vector ((((221, 0), 51, 7,
(32767, 0), 0), ((221, 1), 51, 5, (32767,
+ 0), 0), ((221, 2), 51, 7, (32767, 0), 0), ((221, 3), 51, 5,
(32767, 0), 0), ((247, 0), 51, 6,
+ (32767, 0), 0), ((247, 1), 51, 6, (32767, 0), 0)));
+ Table.States (355).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (278, 0), 116, 454)));
+ Table.States (356).Action_List.Set_Capacity (9);
+ Add_Action (Table.States (356), 65, (187, 0), 628);
+ Add_Action (Table.States (356), 76, (256, 0), 170);
+ Add_Action (Table.States (356), 85, (205, 4), 171);
+ Add_Action (Table.States (356), 86, (213, 2), 172);
+ Add_Action (Table.States (356), 90, (268, 0), 34);
+ Add_Action (Table.States (356), 115, (234, 0), 175);
+ Add_Action (Table.States (356), 116, (196, 0), 146);
+ Add_Action (Table.States (356), 117, (196, 1), 37);
+ Add_Action (Table.States (356), 118, (195, 6), 38);
+ Table.States (356).Goto_List.Set_Capacity (23);
+ Add_Goto (Table.States (356), 195, 176);
+ Add_Goto (Table.States (356), 196, 148);
+ Add_Goto (Table.States (356), 197, 54);
+ Add_Goto (Table.States (356), 198, 55);
+ Add_Goto (Table.States (356), 199, 56);
+ Add_Goto (Table.States (356), 201, 57);
+ Add_Goto (Table.States (356), 205, 177);
+ Add_Goto (Table.States (356), 206, 178);
+ Add_Goto (Table.States (356), 210, 179);
+ Add_Goto (Table.States (356), 211, 180);
+ Add_Goto (Table.States (356), 213, 181);
+ Add_Goto (Table.States (356), 214, 182);
+ Add_Goto (Table.States (356), 215, 183);
+ Add_Goto (Table.States (356), 218, 184);
+ Add_Goto (Table.States (356), 219, 185);
+ Add_Goto (Table.States (356), 220, 186);
+ Add_Goto (Table.States (356), 234, 346);
+ Add_Goto (Table.States (356), 251, 58);
+ Add_Goto (Table.States (356), 252, 59);
+ Add_Goto (Table.States (356), 255, 60);
+ Add_Goto (Table.States (356), 256, 194);
+ Add_Goto (Table.States (356), 268, 68);
+ Add_Goto (Table.States (356), 311, 83);
+ Table.States (356).Kernel := To_Vector ((((187, 0), 52, 1,
(32767, 0), 0), ((233, 3), 52, 1, (32767,
+ 0), 0)));
+ Table.States (356).Minimal_Complete_Actions := To_Vector (((Shift,
(187, 0), 65, 628), (Shift, (234, 0),
+ 115, 175)));
+ Table.States (357).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (357), 91, Reduce, (178, 3), 1);
+ Add_Conflict (Table.States (357), 91, (200, 2), 1);
+ Add_Action (Table.States (357), 99, Reduce, (178, 3), 1);
+ Add_Conflict (Table.States (357), 99, (200, 2), 1);
+ Table.States (357).Kernel := To_Vector ((((178, 3), 62, 0, (178,
3), 1), ((200, 2), 62, 0, (200, 2),
+ 1)));
+ Table.States (357).Minimal_Complete_Actions := To_Vector
(((Reduce, (178, 3), 1), (Reduce, (200, 2),
+ 1)));
+ Table.States (358).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (358), 12, (402, 0), 165);
+ Add_Action (Table.States (358), 46, (233, 2), 167);
+ Add_Action (Table.States (358), 52, (233, 3), 168);
+ Add_Action (Table.States (358), 65, (234, 1), 169);
+ Add_Action (Table.States (358), 76, (256, 0), 170);
+ Add_Action (Table.States (358), 85, (205, 4), 171);
+ Add_Action (Table.States (358), 86, (213, 2), 172);
+ Add_Action (Table.States (358), 90, (268, 0), 34);
+ Add_Action (Table.States (358), 106, (237, 1), 173);
+ Add_Action (Table.States (358), 107, (237, 0), 174);
+ Add_Action (Table.States (358), 115, (234, 0), 175);
+ Add_Action (Table.States (358), 116, (196, 0), 146);
+ Add_Action (Table.States (358), 117, (196, 1), 37);
+ Add_Action (Table.States (358), 118, (195, 6), 38);
+ Table.States (358).Goto_List.Set_Capacity (31);
+ Add_Goto (Table.States (358), 195, 176);
+ Add_Goto (Table.States (358), 196, 148);
+ Add_Goto (Table.States (358), 197, 54);
+ Add_Goto (Table.States (358), 198, 55);
+ Add_Goto (Table.States (358), 199, 56);
+ Add_Goto (Table.States (358), 201, 57);
+ Add_Goto (Table.States (358), 205, 177);
+ Add_Goto (Table.States (358), 206, 178);
+ Add_Goto (Table.States (358), 210, 179);
+ Add_Goto (Table.States (358), 211, 180);
+ Add_Goto (Table.States (358), 213, 181);
+ Add_Goto (Table.States (358), 214, 182);
+ Add_Goto (Table.States (358), 215, 183);
+ Add_Goto (Table.States (358), 218, 184);
+ Add_Goto (Table.States (358), 219, 185);
+ Add_Goto (Table.States (358), 220, 186);
+ Add_Goto (Table.States (358), 227, 629);
+ Add_Goto (Table.States (358), 228, 188);
+ Add_Goto (Table.States (358), 231, 189);
+ Add_Goto (Table.States (358), 232, 190);
+ Add_Goto (Table.States (358), 233, 191);
+ Add_Goto (Table.States (358), 234, 192);
+ Add_Goto (Table.States (358), 237, 193);
+ Add_Goto (Table.States (358), 251, 58);
+ Add_Goto (Table.States (358), 252, 59);
+ Add_Goto (Table.States (358), 255, 60);
+ Add_Goto (Table.States (358), 256, 194);
+ Add_Goto (Table.States (358), 268, 68);
+ Add_Goto (Table.States (358), 311, 83);
+ Add_Goto (Table.States (358), 402, 195);
+ Add_Goto (Table.States (358), 465, 196);
+ Table.States (358).Kernel := To_Vector ((0 => ((245, 0), 64, 6,
(32767, 0), 0)));
+ Table.States (358).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ end Subr_14;
+ procedure Subr_15
+ is begin
+ Table.States (359).Action_List.Set_Capacity (26);
+ Add_Action (Table.States (359), 45, Reduce, (234, 1), 1);
+ Add_Action (Table.States (359), 47, Reduce, (234, 1), 1);
+ Add_Action (Table.States (359), 48, Reduce, (234, 1), 1);
+ Add_Action (Table.States (359), 49, Reduce, (234, 1), 1);
+ Add_Action (Table.States (359), 52, Reduce, (234, 1), 1);
+ Add_Action (Table.States (359), 61, Reduce, (234, 1), 1);
+ Add_Action (Table.States (359), 67, (207, 1), 630);
+ Add_Action (Table.States (359), 73, Reduce, (234, 1), 1);
+ Add_Action (Table.States (359), 75, Reduce, (234, 1), 1);
+ Add_Action (Table.States (359), 87, Reduce, (234, 1), 1);
+ Add_Action (Table.States (359), 89, Reduce, (234, 1), 1);
+ Add_Action (Table.States (359), 91, Reduce, (234, 1), 1);
+ Add_Action (Table.States (359), 95, Reduce, (234, 1), 1);
+ Add_Action (Table.States (359), 97, Reduce, (234, 1), 1);
+ Add_Action (Table.States (359), 98, Reduce, (234, 1), 1);
+ Add_Action (Table.States (359), 99, Reduce, (234, 1), 1);
+ Add_Action (Table.States (359), 100, Reduce, (234, 1), 1);
+ Add_Action (Table.States (359), 101, Reduce, (234, 1), 1);
+ Add_Action (Table.States (359), 103, Reduce, (234, 1), 1);
+ Add_Action (Table.States (359), 104, Reduce, (234, 1), 1);
+ Add_Action (Table.States (359), 106, Reduce, (234, 1), 1);
+ Add_Action (Table.States (359), 107, Reduce, (234, 1), 1);
+ Add_Action (Table.States (359), 109, Reduce, (234, 1), 1);
+ Add_Action (Table.States (359), 110, Reduce, (234, 1), 1);
+ Add_Action (Table.States (359), 111, Reduce, (234, 1), 1);
+ Add_Action (Table.States (359), 112, Reduce, (234, 1), 1);
+ Table.States (359).Kernel := To_Vector ((((207, 1), 65, 1,
(32767, 0), 0), ((234, 1), 65, 0, (234, 1),
+ 1)));
+ Table.States (359).Minimal_Complete_Actions := To_Vector (((Shift,
(207, 1), 67, 630), (Reduce, (234, 1),
+ 1)));
+ Table.States (360).Action_List.Set_Capacity (32);
+ Add_Action (Table.States (360), 45, Reduce, (195, 6), 1);
+ Add_Action (Table.States (360), 47, Reduce, (195, 6), 1);
+ Add_Action (Table.States (360), 48, Reduce, (195, 6), 1);
+ Add_Action (Table.States (360), 49, Reduce, (195, 6), 1);
+ Add_Action (Table.States (360), 52, Reduce, (195, 6), 1);
+ Add_Action (Table.States (360), 61, Reduce, (195, 6), 1);
+ Add_Action (Table.States (360), 71, Reduce, (195, 6), 1);
+ Add_Action (Table.States (360), 72, Reduce, (195, 6), 1);
+ Add_Action (Table.States (360), 73, Reduce, (195, 6), 1);
+ Add_Action (Table.States (360), 74, Reduce, (195, 6), 1);
+ Add_Action (Table.States (360), 75, Reduce, (195, 6), 1);
+ Add_Action (Table.States (360), 85, Reduce, (195, 6), 1);
+ Add_Action (Table.States (360), 87, Reduce, (195, 6), 1);
+ Add_Action (Table.States (360), 89, Reduce, (195, 6), 1);
+ Add_Action (Table.States (360), 91, Reduce, (195, 6), 1);
+ Add_Conflict (Table.States (360), 91, (200, 1), 1);
+ Add_Action (Table.States (360), 95, Reduce, (195, 6), 1);
+ Add_Action (Table.States (360), 96, Reduce, (195, 6), 1);
+ Add_Action (Table.States (360), 97, Reduce, (195, 6), 1);
+ Add_Action (Table.States (360), 98, Reduce, (195, 6), 1);
+ Add_Action (Table.States (360), 99, Reduce, (195, 6), 1);
+ Add_Conflict (Table.States (360), 99, (200, 1), 1);
+ Add_Action (Table.States (360), 100, Reduce, (195, 6), 1);
+ Add_Action (Table.States (360), 101, Reduce, (195, 6), 1);
+ Add_Action (Table.States (360), 103, Reduce, (195, 6), 1);
+ Add_Action (Table.States (360), 104, Reduce, (195, 6), 1);
+ Add_Action (Table.States (360), 106, Reduce, (195, 6), 1);
+ Add_Action (Table.States (360), 107, Reduce, (195, 6), 1);
+ Add_Action (Table.States (360), 109, Reduce, (195, 6), 1);
+ Add_Action (Table.States (360), 110, Reduce, (195, 6), 1);
+ Add_Action (Table.States (360), 111, Reduce, (195, 6), 1);
+ Add_Action (Table.States (360), 112, Reduce, (195, 6), 1);
+ Add_Action (Table.States (360), 113, Reduce, (195, 6), 1);
+ Add_Action (Table.States (360), 114, Reduce, (195, 6), 1);
+ Table.States (360).Kernel := To_Vector ((((195, 6), 118, 0,
(195, 6), 1), ((200, 1), 118, 0, (200, 1),
+ 1)));
+ Table.States (360).Minimal_Complete_Actions := To_Vector
(((Reduce, (195, 6), 1), (Reduce, (200, 1),
+ 1)));
+ Table.States (361).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (361), (91, 99), (178, 1), 1);
+ Table.States (361).Kernel := To_Vector ((0 => ((178, 1), 131, 0,
(178, 1), 1)));
+ Table.States (361).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (178, 1), 1)));
+ Table.States (362).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (362), (91, 99), (178, 2), 1);
+ Table.States (362).Kernel := To_Vector ((0 => ((178, 2), 140, 0,
(178, 2), 1)));
+ Table.States (362).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (178, 2), 1)));
+ Table.States (363).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (363), 91, (177, 1), 631);
+ Add_Action (Table.States (363), 99, (314, 0), 632);
+ Table.States (363).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (363), 314, 633);
+ Table.States (363).Kernel := To_Vector ((((177, 1), 177, 2,
(32767, 0), 0), ((217, 0), 177, 2, (32767,
+ 0), 0)));
+ Table.States (364).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (364), (91, 99), (177, 0), 1);
+ Table.States (364).Kernel := To_Vector ((0 => ((177, 0), 178, 0,
(177, 0), 1)));
+ Table.States (364).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (177, 0), 1)));
+ Table.States (365).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (365), 86, (252, 0), 33);
+ Add_Action (Table.States (365), 90, (268, 0), 34);
+ Add_Action (Table.States (365), 116, (196, 0), 146);
+ Add_Action (Table.States (365), 117, (196, 1), 37);
+ Add_Action (Table.States (365), 118, (195, 6), 38);
+ Table.States (365).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (365), 195, 634);
+ Add_Goto (Table.States (365), 196, 148);
+ Add_Goto (Table.States (365), 197, 54);
+ Add_Goto (Table.States (365), 198, 55);
+ Add_Goto (Table.States (365), 199, 56);
+ Add_Goto (Table.States (365), 201, 57);
+ Add_Goto (Table.States (365), 251, 58);
+ Add_Goto (Table.States (365), 252, 59);
+ Add_Goto (Table.States (365), 255, 60);
+ Add_Goto (Table.States (365), 268, 68);
+ Add_Goto (Table.States (365), 311, 83);
+ Table.States (365).Kernel := To_Vector ((((131, 0), 187, 3,
(32767, 0), 0), ((131, 1), 187, 1, (32767,
+ 0), 0)));
+ Table.States (365).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (366).Action_List.Set_Capacity (33);
+ Add_Action (Table.States (366), 45, Reduce, (234, 3), 1);
+ Add_Action (Table.States (366), 47, Reduce, (234, 3), 1);
+ Add_Action (Table.States (366), 48, Reduce, (234, 3), 1);
+ Add_Action (Table.States (366), 49, Reduce, (234, 3), 1);
+ Add_Action (Table.States (366), 52, Reduce, (234, 3), 1);
+ Add_Action (Table.States (366), 61, Reduce, (234, 3), 1);
+ Add_Action (Table.States (366), 71, (453, 0), 635);
+ Add_Action (Table.States (366), 72, (153, 0), 636);
+ Add_Action (Table.States (366), 73, Reduce, (234, 3), 1);
+ Add_Action (Table.States (366), 74, (139, 0), 637);
+ Add_Action (Table.States (366), 75, Reduce, (234, 3), 1);
+ Add_Action (Table.States (366), 85, (162, 0), 612);
+ Add_Action (Table.States (366), 87, Reduce, (131, 3), 1);
+ Add_Conflict (Table.States (366), 87, (234, 3), 1);
+ Add_Action (Table.States (366), 88, Reduce, (234, 3), 1);
+ Add_Action (Table.States (366), 89, Reduce, (234, 3), 1);
+ Add_Action (Table.States (366), 91, Reduce, (131, 3), 1);
+ Add_Conflict (Table.States (366), 91, (234, 3), 1);
+ Add_Action (Table.States (366), 95, Reduce, (131, 3), 1);
+ Add_Conflict (Table.States (366), 95, (234, 3), 1);
+ Add_Action (Table.States (366), 96, (197, 0), 283);
+ Add_Action (Table.States (366), 97, Reduce, (234, 3), 1);
+ Add_Action (Table.States (366), 98, Reduce, (234, 3), 1);
+ Add_Action (Table.States (366), 99, Reduce, (131, 3), 1);
+ Add_Conflict (Table.States (366), 99, (234, 3), 1);
+ Add_Action (Table.States (366), 100, Reduce, (234, 3), 1);
+ Add_Action (Table.States (366), 101, Reduce, (234, 3), 1);
+ Add_Action (Table.States (366), 103, Reduce, (234, 3), 1);
+ Add_Action (Table.States (366), 104, Reduce, (234, 3), 1);
+ Add_Action (Table.States (366), 106, Reduce, (234, 3), 1);
+ Add_Action (Table.States (366), 107, Reduce, (234, 3), 1);
+ Add_Action (Table.States (366), 109, Reduce, (234, 3), 1);
+ Add_Action (Table.States (366), 110, Reduce, (234, 3), 1);
+ Add_Action (Table.States (366), 111, Reduce, (234, 3), 1);
+ Add_Action (Table.States (366), 112, Reduce, (234, 3), 1);
+ Add_Action (Table.States (366), 113, (121, 0), 285);
+ Add_Action (Table.States (366), 114, (121, 1), 286);
+ Table.States (366).Goto_List.Set_Capacity (8);
+ Add_Goto (Table.States (366), 121, 638);
+ Add_Goto (Table.States (366), 132, 639);
+ Add_Goto (Table.States (366), 133, 640);
+ Add_Goto (Table.States (366), 139, 641);
+ Add_Goto (Table.States (366), 153, 642);
+ Add_Goto (Table.States (366), 162, 643);
+ Add_Goto (Table.States (366), 313, 289);
+ Add_Goto (Table.States (366), 453, 644);
+ Table.States (366).Kernel := To_Vector ((((131, 2), 195, 2,
(32767, 0), 0), ((131, 3), 195, 0, (131,
+ 3), 1), ((197, 0), 195, 2, (32767, 0), 0), ((198, 0), 195,
3, (32767, 0), 0), ((199, 0), 195, 2,
+ (32767, 0), 0), ((201, 0), 195, 2, (32767, 0), 0), ((203, 0),
195, 2, (32767, 0), 0), ((234, 3),
+ 195, 0, (234, 3), 1), ((255, 0), 195, 3, (32767, 0), 0),
((311, 0), 195, 3, (32767, 0), 0)));
+ Table.States (366).Minimal_Complete_Actions := To_Vector
(((Reduce, (131, 3), 1), (Reduce, (234, 3),
+ 1)));
+ Table.States (367).Action_List.Set_Capacity (32);
+ Add_Action (Table.States (367), 45, Reduce, (195, 0), 1);
+ Add_Action (Table.States (367), 47, Reduce, (195, 0), 1);
+ Add_Action (Table.States (367), 48, Reduce, (195, 0), 1);
+ Add_Action (Table.States (367), 49, Reduce, (195, 0), 1);
+ Add_Action (Table.States (367), 52, Reduce, (195, 0), 1);
+ Add_Action (Table.States (367), 61, Reduce, (195, 0), 1);
+ Add_Action (Table.States (367), 71, Reduce, (195, 0), 1);
+ Add_Action (Table.States (367), 72, Reduce, (195, 0), 1);
+ Add_Action (Table.States (367), 73, Reduce, (195, 0), 1);
+ Add_Action (Table.States (367), 74, Reduce, (195, 0), 1);
+ Add_Action (Table.States (367), 75, Reduce, (195, 0), 1);
+ Add_Action (Table.States (367), 85, Reduce, (195, 0), 1);
+ Add_Action (Table.States (367), 87, Reduce, (195, 0), 1);
+ Add_Action (Table.States (367), 89, Reduce, (195, 0), 1);
+ Add_Action (Table.States (367), 91, Reduce, (195, 0), 1);
+ Add_Conflict (Table.States (367), 91, (200, 0), 1);
+ Add_Action (Table.States (367), 95, Reduce, (195, 0), 1);
+ Add_Action (Table.States (367), 96, Reduce, (195, 0), 1);
+ Add_Action (Table.States (367), 97, Reduce, (195, 0), 1);
+ Add_Action (Table.States (367), 98, Reduce, (195, 0), 1);
+ Add_Action (Table.States (367), 99, Reduce, (195, 0), 1);
+ Add_Conflict (Table.States (367), 99, (200, 0), 1);
+ Add_Action (Table.States (367), 100, Reduce, (195, 0), 1);
+ Add_Action (Table.States (367), 101, Reduce, (195, 0), 1);
+ Add_Action (Table.States (367), 103, Reduce, (195, 0), 1);
+ Add_Action (Table.States (367), 104, Reduce, (195, 0), 1);
+ Add_Action (Table.States (367), 106, Reduce, (195, 0), 1);
+ Add_Action (Table.States (367), 107, Reduce, (195, 0), 1);
+ Add_Action (Table.States (367), 109, Reduce, (195, 0), 1);
+ Add_Action (Table.States (367), 110, Reduce, (195, 0), 1);
+ Add_Action (Table.States (367), 111, Reduce, (195, 0), 1);
+ Add_Action (Table.States (367), 112, Reduce, (195, 0), 1);
+ Add_Action (Table.States (367), 113, Reduce, (195, 0), 1);
+ Add_Action (Table.States (367), 114, Reduce, (195, 0), 1);
+ Table.States (367).Kernel := To_Vector ((((195, 0), 196, 0,
(195, 0), 1), ((200, 0), 196, 0, (200, 0),
+ 1)));
+ Table.States (367).Minimal_Complete_Actions := To_Vector
(((Reduce, (195, 0), 1), (Reduce, (200, 0),
+ 1)));
+ Table.States (368).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (368), (91, 99), (209, 0), 1);
+ Table.States (368).Kernel := To_Vector ((0 => ((209, 0), 200, 0,
(209, 0), 1)));
+ Table.States (368).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (209, 0), 1)));
+ Table.States (369).Action_List.Set_Capacity (23);
+ Add_Action (Table.States (369), (33, 36, 41, 43, 44, 47, 48, 49,
50, 61, 63, 69, 72, 74, 75, 82, 87, 88,
+ 91, 94, 95, 99, 108), (140, 0), 1);
+ Table.States (369).Kernel := To_Vector ((0 => ((140, 0), 203, 0,
(140, 0), 1)));
+ Table.States (369).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (140, 0), 1)));
+ Table.States (370).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (370), 87, (206, 0), 645);
+ Table.States (370).Kernel := To_Vector ((0 => ((206, 0), 207, 1,
(32767, 0), 0)));
+ Table.States (370).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (206, 0), 87, 645)));
+ Table.States (371).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (371), (87, 95), (459, 0), 1);
+ Table.States (371).Kernel := To_Vector ((0 => ((459, 0), 208, 0,
(459, 0), 1)));
+ Table.States (371).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (459, 0), 1)));
+ Table.States (372).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (372), 91, (209, 1), 646);
+ Add_Action (Table.States (372), 99, (314, 0), 632);
+ Table.States (372).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (372), 314, 647);
+ Table.States (372).Kernel := To_Vector ((((208, 0), 209, 2,
(32767, 0), 0), ((209, 1), 209, 2, (32767,
+ 0), 0)));
+ Table.States (372).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (314, 0), 99, 632)));
+ Table.States (373).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (373), 87, (213, 0), 648);
+ Add_Action (Table.States (373), 95, (212, 1), 649);
+ Table.States (373).Kernel := To_Vector ((((212, 1), 212, 2,
(32767, 0), 0), ((213, 0), 212, 1, (32767,
+ 0), 0), ((213, 1), 212, 5, (32767, 0), 0)));
+ Table.States (373).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (213, 0), 87, 648)));
+ Table.States (374).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (374), 87, (215, 0), 650);
+ Add_Action (Table.States (374), 95, (216, 1), 651);
+ Table.States (374).Kernel := To_Vector ((((215, 0), 216, 1,
(32767, 0), 0), ((216, 1), 216, 4, (32767,
+ 0), 0), ((216, 2), 216, 4, (32767, 0), 0)));
+ Table.States (374).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (215, 0), 87, 650)));
+ Table.States (375).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (375), (87, 88, 95), (216, 0), 1);
+ Table.States (375).Kernel := To_Vector ((0 => ((216, 0), 217, 0,
(216, 0), 1)));
+ Table.States (375).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (216, 0), 1)));
+ Table.States (376).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (376), (87, 88, 95), (217, 1), 1);
+ Table.States (376).Kernel := To_Vector ((0 => ((217, 1), 221, 0,
(217, 1), 1)));
+ Table.States (376).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (217, 1), 1)));
+ Table.States (377).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (377), 61, (210, 0), 652);
+ Add_Action (Table.States (377), 87, Reduce, (208, 1), 1);
+ Add_Conflict (Table.States (377), 87, (212, 0), 1);
+ Add_Action (Table.States (377), 91, Reduce, (178, 0), 1);
+ Add_Action (Table.States (377), 95, Reduce, (208, 1), 1);
+ Add_Conflict (Table.States (377), 95, (212, 0), 1);
+ Add_Action (Table.States (377), 99, Reduce, (178, 0), 1);
+ Table.States (377).Kernel := To_Vector ((((178, 0), 227, 0,
(178, 0), 1), ((208, 1), 227, 0, (208, 1),
+ 1), ((210, 0), 227, 4, (32767, 0), 0), ((212, 0), 227, 0,
(212, 0), 1), ((219, 0), 227, 5, (32767,
+ 0), 0), ((220, 0), 227, 6, (32767, 0), 0)));
+ Table.States (377).Minimal_Complete_Actions := To_Vector
(((Reduce, (178, 0), 1), (Reduce, (208, 1), 1),
+ (Shift, (210, 0), 61, 652), (Reduce, (212, 0), 1)));
+ Table.States (378).Action_List.Set_Capacity (18);
+ Add_Action (Table.States (378), 47, (228, 3), 400);
+ Add_Action (Table.States (378), 48, Reduce, (228, 1), 1);
+ Add_Action (Table.States (378), 49, Reduce, (228, 1), 1);
+ Add_Action (Table.States (378), 52, (228, 2), 401);
+ Add_Action (Table.States (378), 61, Reduce, (228, 1), 1);
+ Add_Action (Table.States (378), 75, Reduce, (228, 1), 1);
+ Add_Action (Table.States (378), 87, Reduce, (228, 1), 1);
+ Add_Action (Table.States (378), 88, Reduce, (228, 1), 1);
+ Add_Action (Table.States (378), 91, Reduce, (228, 1), 1);
+ Add_Action (Table.States (378), 95, Reduce, (228, 1), 1);
+ Add_Action (Table.States (378), 97, (140, 1), 653);
+ Add_Action (Table.States (378), 98, (235, 0), 402);
+ Add_Action (Table.States (378), 99, Reduce, (228, 1), 1);
+ Add_Action (Table.States (378), 100, (235, 4), 403);
+ Add_Action (Table.States (378), 101, (235, 5), 404);
+ Add_Action (Table.States (378), 103, (235, 2), 405);
+ Add_Action (Table.States (378), 104, (235, 3), 406);
+ Add_Action (Table.States (378), 110, (235, 1), 407);
+ Table.States (378).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (378), 235, 408);
+ Table.States (378).Kernel := To_Vector ((((140, 1), 231, 2,
(32767, 0), 0), ((228, 0), 231, 2, (32767,
+ 0), 0), ((228, 1), 231, 0, (228, 1), 1), ((228, 2), 231, 3,
(32767, 0), 0), ((228, 3), 231, 2,
+ (32767, 0), 0)));
+ Table.States (378).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (228, 1), 1)));
+ Table.States (379).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (379), 87, (205, 4), 654);
+ Table.States (379).Kernel := To_Vector ((0 => ((205, 4), 239, 1,
(32767, 0), 0)));
+ Table.States (379).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (205, 4), 87, 654)));
+ Table.States (380).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (380), (1 => 87), (239, 0), 1);
+ Table.States (380).Kernel := To_Vector ((0 => ((239, 0), 242, 0,
(239, 0), 1)));
+ Table.States (380).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (239, 0), 1)));
+ Table.States (381).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (381), (1 => 87), (239, 1), 1);
+ Table.States (381).Kernel := To_Vector ((0 => ((239, 1), 245, 0,
(239, 1), 1)));
+ Table.States (381).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (239, 1), 1)));
+ Table.States (382).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (382), 87, (205, 5), 655);
+ Table.States (382).Kernel := To_Vector ((0 => ((205, 5), 247, 1,
(32767, 0), 0)));
+ Table.States (382).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (205, 5), 87, 655)));
+ Table.States (383).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (383), 87, (205, 6), 656);
+ Table.States (383).Kernel := To_Vector ((0 => ((205, 6), 249, 1,
(32767, 0), 0)));
+ Table.States (383).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (205, 6), 87, 656)));
+ Table.States (384).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (384), 87, Reduce, (207, 0), 1);
+ Add_Action (Table.States (384), 95, (459, 1), 657);
+ Table.States (384).Kernel := To_Vector ((((207, 0), 459, 0,
(207, 0), 1), ((459, 1), 459, 2, (32767,
+ 0), 0), ((459, 2), 459, 4, (32767, 0), 0)));
+ Table.States (384).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (207, 0), 1)));
+ Table.States (385).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (385), (91, 99), (178, 3), 1);
+ Table.States (385).Kernel := To_Vector ((0 => ((178, 3), 62, 0,
(178, 3), 1)));
+ Table.States (385).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (178, 3), 1)));
+ end Subr_15;
+ procedure Subr_16
+ is begin
+ Table.States (386).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (386), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (214, 0), 2);
+ Table.States (386).Kernel := To_Vector ((0 => ((214, 0), 88, 0,
(214, 0), 2)));
+ Table.States (386).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (214, 0), 2)));
+ Table.States (387).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (387), 88, (213, 3), 658);
+ Add_Action (Table.States (387), 95, (212, 1), 659);
+ Table.States (387).Kernel := To_Vector ((((212, 1), 212, 2,
(32767, 0), 0), ((213, 2), 212, 5, (32767,
+ 0), 0), ((213, 3), 212, 1, (32767, 0), 0)));
+ Table.States (387).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (213, 3), 88, 658)));
+ Table.States (388).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (388), 88, (215, 1), 660);
+ Add_Action (Table.States (388), 95, (216, 1), 651);
+ Table.States (388).Kernel := To_Vector ((((215, 1), 216, 1,
(32767, 0), 0), ((216, 1), 216, 4, (32767,
+ 0), 0), ((216, 2), 216, 4, (32767, 0), 0)));
+ Table.States (388).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (215, 1), 88, 660)));
+ Table.States (389).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (389), 88, (252, 2), 510);
+ Add_Conflict (Table.States (389), 88, (217, 1), 1);
+ Add_Action (Table.States (389), 95, Reduce, (217, 1), 1);
+ Table.States (389).Kernel := To_Vector ((((217, 1), 221, 0,
(217, 1), 1), ((252, 2), 221, 1, (32767,
+ 0), 0)));
+ Table.States (389).Minimal_Complete_Actions := To_Vector
(((Reduce, (217, 1), 1), (Shift, (252, 2), 88,
+ 510)));
+ Table.States (390).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (390), 61, (220, 1), 661);
+ Add_Action (Table.States (390), 88, Reduce, (212, 0), 1);
+ Add_Action (Table.States (390), 91, Reduce, (178, 0), 1);
+ Add_Action (Table.States (390), 95, Reduce, (212, 0), 1);
+ Add_Action (Table.States (390), 99, Reduce, (178, 0), 1);
+ Table.States (390).Kernel := To_Vector ((((178, 0), 227, 0,
(178, 0), 1), ((212, 0), 227, 0, (212, 0),
+ 1), ((220, 1), 227, 6, (32767, 0), 0)));
+ Table.States (390).Minimal_Complete_Actions := To_Vector
(((Reduce, (178, 0), 1), (Reduce, (212, 0), 1),
+ (Shift, (220, 1), 61, 661)));
+ Table.States (391).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (391), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (366, 0), 3);
+ Table.States (391).Kernel := To_Vector ((0 => ((366, 0), 108, 0,
(366, 0), 3)));
+ Table.States (391).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (366, 0), 3)));
+ Table.States (392).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (392), 12, (402, 0), 165);
+ Add_Action (Table.States (392), 46, (233, 2), 167);
+ Add_Action (Table.States (392), 52, (233, 3), 168);
+ Add_Action (Table.States (392), 65, (234, 1), 169);
+ Add_Action (Table.States (392), 76, (256, 0), 170);
+ Add_Action (Table.States (392), 85, (205, 4), 171);
+ Add_Action (Table.States (392), 86, (213, 2), 172);
+ Add_Action (Table.States (392), 90, (268, 0), 34);
+ Add_Action (Table.States (392), 106, (237, 1), 173);
+ Add_Action (Table.States (392), 107, (237, 0), 174);
+ Add_Action (Table.States (392), 115, (234, 0), 175);
+ Add_Action (Table.States (392), 116, (196, 0), 146);
+ Add_Action (Table.States (392), 117, (196, 1), 37);
+ Add_Action (Table.States (392), 118, (195, 6), 38);
+ Table.States (392).Goto_List.Set_Capacity (30);
+ Add_Goto (Table.States (392), 195, 176);
+ Add_Goto (Table.States (392), 196, 148);
+ Add_Goto (Table.States (392), 197, 54);
+ Add_Goto (Table.States (392), 198, 55);
+ Add_Goto (Table.States (392), 199, 56);
+ Add_Goto (Table.States (392), 201, 57);
+ Add_Goto (Table.States (392), 205, 177);
+ Add_Goto (Table.States (392), 206, 178);
+ Add_Goto (Table.States (392), 210, 179);
+ Add_Goto (Table.States (392), 211, 180);
+ Add_Goto (Table.States (392), 213, 181);
+ Add_Goto (Table.States (392), 214, 182);
+ Add_Goto (Table.States (392), 215, 183);
+ Add_Goto (Table.States (392), 218, 184);
+ Add_Goto (Table.States (392), 219, 185);
+ Add_Goto (Table.States (392), 220, 186);
+ Add_Goto (Table.States (392), 228, 662);
+ Add_Goto (Table.States (392), 231, 189);
+ Add_Goto (Table.States (392), 232, 190);
+ Add_Goto (Table.States (392), 233, 191);
+ Add_Goto (Table.States (392), 234, 192);
+ Add_Goto (Table.States (392), 237, 193);
+ Add_Goto (Table.States (392), 251, 58);
+ Add_Goto (Table.States (392), 252, 59);
+ Add_Goto (Table.States (392), 255, 60);
+ Add_Goto (Table.States (392), 256, 194);
+ Add_Goto (Table.States (392), 268, 68);
+ Add_Goto (Table.States (392), 311, 83);
+ Add_Goto (Table.States (392), 402, 195);
+ Add_Goto (Table.States (392), 465, 196);
+ Table.States (392).Kernel := To_Vector ((0 => ((226, 0), 48, 1,
(32767, 0), 0)));
+ Table.States (392).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (393).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (393), 12, (402, 0), 165);
+ Add_Action (Table.States (393), 41, (225, 0), 663);
+ Add_Action (Table.States (393), 46, (233, 2), 167);
+ Add_Action (Table.States (393), 52, (233, 3), 168);
+ Add_Action (Table.States (393), 65, (234, 1), 169);
+ Add_Action (Table.States (393), 76, (256, 0), 170);
+ Add_Action (Table.States (393), 85, (205, 4), 171);
+ Add_Action (Table.States (393), 86, (213, 2), 172);
+ Add_Action (Table.States (393), 90, (268, 0), 34);
+ Add_Action (Table.States (393), 106, (237, 1), 173);
+ Add_Action (Table.States (393), 107, (237, 0), 174);
+ Add_Action (Table.States (393), 115, (234, 0), 175);
+ Add_Action (Table.States (393), 116, (196, 0), 146);
+ Add_Action (Table.States (393), 117, (196, 1), 37);
+ Add_Action (Table.States (393), 118, (195, 6), 38);
+ Table.States (393).Goto_List.Set_Capacity (30);
+ Add_Goto (Table.States (393), 195, 176);
+ Add_Goto (Table.States (393), 196, 148);
+ Add_Goto (Table.States (393), 197, 54);
+ Add_Goto (Table.States (393), 198, 55);
+ Add_Goto (Table.States (393), 199, 56);
+ Add_Goto (Table.States (393), 201, 57);
+ Add_Goto (Table.States (393), 205, 177);
+ Add_Goto (Table.States (393), 206, 178);
+ Add_Goto (Table.States (393), 210, 179);
+ Add_Goto (Table.States (393), 211, 180);
+ Add_Goto (Table.States (393), 213, 181);
+ Add_Goto (Table.States (393), 214, 182);
+ Add_Goto (Table.States (393), 215, 183);
+ Add_Goto (Table.States (393), 218, 184);
+ Add_Goto (Table.States (393), 219, 185);
+ Add_Goto (Table.States (393), 220, 186);
+ Add_Goto (Table.States (393), 228, 664);
+ Add_Goto (Table.States (393), 231, 189);
+ Add_Goto (Table.States (393), 232, 190);
+ Add_Goto (Table.States (393), 233, 191);
+ Add_Goto (Table.States (393), 234, 192);
+ Add_Goto (Table.States (393), 237, 193);
+ Add_Goto (Table.States (393), 251, 58);
+ Add_Goto (Table.States (393), 252, 59);
+ Add_Goto (Table.States (393), 255, 60);
+ Add_Goto (Table.States (393), 256, 194);
+ Add_Goto (Table.States (393), 268, 68);
+ Add_Goto (Table.States (393), 311, 83);
+ Add_Goto (Table.States (393), 402, 195);
+ Add_Goto (Table.States (393), 465, 196);
+ Table.States (393).Kernel := To_Vector ((((224, 0), 49, 1,
(32767, 0), 0), ((225, 0), 49, 2, (32767,
+ 0), 0)));
+ Table.States (393).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (394).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (394), 12, (402, 0), 165);
+ Add_Action (Table.States (394), 43, (223, 0), 665);
+ Add_Action (Table.States (394), 46, (233, 2), 167);
+ Add_Action (Table.States (394), 52, (233, 3), 168);
+ Add_Action (Table.States (394), 65, (234, 1), 169);
+ Add_Action (Table.States (394), 76, (256, 0), 170);
+ Add_Action (Table.States (394), 85, (205, 4), 171);
+ Add_Action (Table.States (394), 86, (213, 2), 172);
+ Add_Action (Table.States (394), 90, (268, 0), 34);
+ Add_Action (Table.States (394), 106, (237, 1), 173);
+ Add_Action (Table.States (394), 107, (237, 0), 174);
+ Add_Action (Table.States (394), 115, (234, 0), 175);
+ Add_Action (Table.States (394), 116, (196, 0), 146);
+ Add_Action (Table.States (394), 117, (196, 1), 37);
+ Add_Action (Table.States (394), 118, (195, 6), 38);
+ Table.States (394).Goto_List.Set_Capacity (30);
+ Add_Goto (Table.States (394), 195, 176);
+ Add_Goto (Table.States (394), 196, 148);
+ Add_Goto (Table.States (394), 197, 54);
+ Add_Goto (Table.States (394), 198, 55);
+ Add_Goto (Table.States (394), 199, 56);
+ Add_Goto (Table.States (394), 201, 57);
+ Add_Goto (Table.States (394), 205, 177);
+ Add_Goto (Table.States (394), 206, 178);
+ Add_Goto (Table.States (394), 210, 179);
+ Add_Goto (Table.States (394), 211, 180);
+ Add_Goto (Table.States (394), 213, 181);
+ Add_Goto (Table.States (394), 214, 182);
+ Add_Goto (Table.States (394), 215, 183);
+ Add_Goto (Table.States (394), 218, 184);
+ Add_Goto (Table.States (394), 219, 185);
+ Add_Goto (Table.States (394), 220, 186);
+ Add_Goto (Table.States (394), 228, 666);
+ Add_Goto (Table.States (394), 231, 189);
+ Add_Goto (Table.States (394), 232, 190);
+ Add_Goto (Table.States (394), 233, 191);
+ Add_Goto (Table.States (394), 234, 192);
+ Add_Goto (Table.States (394), 237, 193);
+ Add_Goto (Table.States (394), 251, 58);
+ Add_Goto (Table.States (394), 252, 59);
+ Add_Goto (Table.States (394), 255, 60);
+ Add_Goto (Table.States (394), 256, 194);
+ Add_Goto (Table.States (394), 268, 68);
+ Add_Goto (Table.States (394), 311, 83);
+ Add_Goto (Table.States (394), 402, 195);
+ Add_Goto (Table.States (394), 465, 196);
+ Table.States (394).Kernel := To_Vector ((((222, 0), 75, 1,
(32767, 0), 0), ((223, 0), 75, 2, (32767,
+ 0), 0)));
+ Table.States (394).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (395).Action_List.Set_Capacity (18);
+ Add_Action (Table.States (395), 33, Reduce, (227, 1), 2);
+ Add_Action (Table.States (395), 36, Reduce, (227, 1), 2);
+ Add_Action (Table.States (395), 41, Reduce, (227, 1), 2);
+ Add_Action (Table.States (395), 43, Reduce, (227, 1), 2);
+ Add_Action (Table.States (395), 44, Reduce, (227, 1), 2);
+ Add_Action (Table.States (395), 50, Reduce, (227, 1), 2);
+ Add_Action (Table.States (395), 61, Reduce, (227, 1), 2);
+ Add_Action (Table.States (395), 63, Reduce, (227, 1), 2);
+ Add_Action (Table.States (395), 72, Reduce, (227, 1), 2);
+ Add_Action (Table.States (395), 74, Reduce, (227, 1), 2);
+ Add_Action (Table.States (395), 75, (222, 1), 667);
+ Add_Action (Table.States (395), 82, Reduce, (227, 1), 2);
+ Add_Action (Table.States (395), 87, Reduce, (227, 1), 2);
+ Add_Action (Table.States (395), 88, Reduce, (227, 1), 2);
+ Add_Action (Table.States (395), 91, Reduce, (227, 1), 2);
+ Add_Action (Table.States (395), 95, Reduce, (227, 1), 2);
+ Add_Action (Table.States (395), 99, Reduce, (227, 1), 2);
+ Add_Action (Table.States (395), 108, Reduce, (227, 1), 2);
+ Table.States (395).Kernel := To_Vector ((((222, 1), 222, 2,
(32767, 0), 0), ((227, 1), 222, 0, (227,
+ 1), 2)));
+ Table.States (395).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (227, 1), 2)));
+ Table.States (396).Action_List.Set_Capacity (18);
+ Add_Action (Table.States (396), 33, Reduce, (227, 2), 2);
+ Add_Action (Table.States (396), 36, Reduce, (227, 2), 2);
+ Add_Action (Table.States (396), 41, Reduce, (227, 2), 2);
+ Add_Action (Table.States (396), 43, Reduce, (227, 2), 2);
+ Add_Action (Table.States (396), 44, Reduce, (227, 2), 2);
+ Add_Action (Table.States (396), 50, Reduce, (227, 2), 2);
+ Add_Action (Table.States (396), 61, Reduce, (227, 2), 2);
+ Add_Action (Table.States (396), 63, Reduce, (227, 2), 2);
+ Add_Action (Table.States (396), 72, Reduce, (227, 2), 2);
+ Add_Action (Table.States (396), 74, Reduce, (227, 2), 2);
+ Add_Action (Table.States (396), 75, (223, 1), 668);
+ Add_Action (Table.States (396), 82, Reduce, (227, 2), 2);
+ Add_Action (Table.States (396), 87, Reduce, (227, 2), 2);
+ Add_Action (Table.States (396), 88, Reduce, (227, 2), 2);
+ Add_Action (Table.States (396), 91, Reduce, (227, 2), 2);
+ Add_Action (Table.States (396), 95, Reduce, (227, 2), 2);
+ Add_Action (Table.States (396), 99, Reduce, (227, 2), 2);
+ Add_Action (Table.States (396), 108, Reduce, (227, 2), 2);
+ Table.States (396).Kernel := To_Vector ((((223, 1), 223, 3,
(32767, 0), 0), ((227, 2), 223, 0, (227,
+ 2), 2)));
+ Table.States (396).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (227, 2), 2)));
+ Table.States (397).Action_List.Set_Capacity (18);
+ Add_Action (Table.States (397), 33, Reduce, (227, 3), 2);
+ Add_Action (Table.States (397), 36, Reduce, (227, 3), 2);
+ Add_Action (Table.States (397), 41, Reduce, (227, 3), 2);
+ Add_Action (Table.States (397), 43, Reduce, (227, 3), 2);
+ Add_Action (Table.States (397), 44, Reduce, (227, 3), 2);
+ Add_Action (Table.States (397), 49, (224, 1), 669);
+ Add_Action (Table.States (397), 50, Reduce, (227, 3), 2);
+ Add_Action (Table.States (397), 61, Reduce, (227, 3), 2);
+ Add_Action (Table.States (397), 63, Reduce, (227, 3), 2);
+ Add_Action (Table.States (397), 72, Reduce, (227, 3), 2);
+ Add_Action (Table.States (397), 74, Reduce, (227, 3), 2);
+ Add_Action (Table.States (397), 82, Reduce, (227, 3), 2);
+ Add_Action (Table.States (397), 87, Reduce, (227, 3), 2);
+ Add_Action (Table.States (397), 88, Reduce, (227, 3), 2);
+ Add_Action (Table.States (397), 91, Reduce, (227, 3), 2);
+ Add_Action (Table.States (397), 95, Reduce, (227, 3), 2);
+ Add_Action (Table.States (397), 99, Reduce, (227, 3), 2);
+ Add_Action (Table.States (397), 108, Reduce, (227, 3), 2);
+ Table.States (397).Kernel := To_Vector ((((224, 1), 224, 2,
(32767, 0), 0), ((227, 3), 224, 0, (227,
+ 3), 2)));
+ Table.States (397).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (227, 3), 2)));
+ Table.States (398).Action_List.Set_Capacity (18);
+ Add_Action (Table.States (398), 33, Reduce, (227, 4), 2);
+ Add_Action (Table.States (398), 36, Reduce, (227, 4), 2);
+ Add_Action (Table.States (398), 41, Reduce, (227, 4), 2);
+ Add_Action (Table.States (398), 43, Reduce, (227, 4), 2);
+ Add_Action (Table.States (398), 44, Reduce, (227, 4), 2);
+ Add_Action (Table.States (398), 49, (225, 1), 670);
+ Add_Action (Table.States (398), 50, Reduce, (227, 4), 2);
+ Add_Action (Table.States (398), 61, Reduce, (227, 4), 2);
+ Add_Action (Table.States (398), 63, Reduce, (227, 4), 2);
+ Add_Action (Table.States (398), 72, Reduce, (227, 4), 2);
+ Add_Action (Table.States (398), 74, Reduce, (227, 4), 2);
+ Add_Action (Table.States (398), 82, Reduce, (227, 4), 2);
+ Add_Action (Table.States (398), 87, Reduce, (227, 4), 2);
+ Add_Action (Table.States (398), 88, Reduce, (227, 4), 2);
+ Add_Action (Table.States (398), 91, Reduce, (227, 4), 2);
+ Add_Action (Table.States (398), 95, Reduce, (227, 4), 2);
+ Add_Action (Table.States (398), 99, Reduce, (227, 4), 2);
+ Add_Action (Table.States (398), 108, Reduce, (227, 4), 2);
+ Table.States (398).Kernel := To_Vector ((((225, 1), 225, 3,
(32767, 0), 0), ((227, 4), 225, 0, (227,
+ 4), 2)));
+ Table.States (398).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (227, 4), 2)));
+ Table.States (399).Action_List.Set_Capacity (18);
+ Add_Action (Table.States (399), 33, Reduce, (227, 5), 2);
+ Add_Action (Table.States (399), 36, Reduce, (227, 5), 2);
+ Add_Action (Table.States (399), 41, Reduce, (227, 5), 2);
+ Add_Action (Table.States (399), 43, Reduce, (227, 5), 2);
+ Add_Action (Table.States (399), 44, Reduce, (227, 5), 2);
+ Add_Action (Table.States (399), 48, (226, 1), 671);
+ Add_Action (Table.States (399), 50, Reduce, (227, 5), 2);
+ Add_Action (Table.States (399), 61, Reduce, (227, 5), 2);
+ Add_Action (Table.States (399), 63, Reduce, (227, 5), 2);
+ Add_Action (Table.States (399), 72, Reduce, (227, 5), 2);
+ Add_Action (Table.States (399), 74, Reduce, (227, 5), 2);
+ Add_Action (Table.States (399), 82, Reduce, (227, 5), 2);
+ Add_Action (Table.States (399), 87, Reduce, (227, 5), 2);
+ Add_Action (Table.States (399), 88, Reduce, (227, 5), 2);
+ Add_Action (Table.States (399), 91, Reduce, (227, 5), 2);
+ Add_Action (Table.States (399), 95, Reduce, (227, 5), 2);
+ Add_Action (Table.States (399), 99, Reduce, (227, 5), 2);
+ Add_Action (Table.States (399), 108, Reduce, (227, 5), 2);
+ Table.States (399).Kernel := To_Vector ((((226, 1), 226, 2,
(32767, 0), 0), ((227, 5), 226, 0, (227,
+ 5), 2)));
+ Table.States (399).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (227, 5), 2)));
+ Table.States (400).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (400), 46, (233, 2), 167);
+ Add_Action (Table.States (400), 52, (233, 3), 168);
+ Add_Action (Table.States (400), 65, (234, 1), 169);
+ Add_Action (Table.States (400), 76, (256, 0), 170);
+ Add_Action (Table.States (400), 85, (205, 4), 171);
+ Add_Action (Table.States (400), 86, (213, 2), 172);
+ Add_Action (Table.States (400), 90, (268, 0), 34);
+ Add_Action (Table.States (400), 106, (237, 1), 173);
+ Add_Action (Table.States (400), 107, (237, 0), 174);
+ Add_Action (Table.States (400), 115, (234, 0), 175);
+ Add_Action (Table.States (400), 116, (196, 0), 146);
+ Add_Action (Table.States (400), 117, (196, 1), 37);
+ Add_Action (Table.States (400), 118, (195, 6), 38);
+ Table.States (400).Goto_List.Set_Capacity (32);
+ Add_Goto (Table.States (400), 140, 672);
+ Add_Goto (Table.States (400), 195, 673);
+ Add_Goto (Table.States (400), 196, 148);
+ Add_Goto (Table.States (400), 197, 54);
+ Add_Goto (Table.States (400), 198, 55);
+ Add_Goto (Table.States (400), 199, 56);
+ Add_Goto (Table.States (400), 201, 57);
+ Add_Goto (Table.States (400), 203, 369);
+ Add_Goto (Table.States (400), 205, 177);
+ Add_Goto (Table.States (400), 206, 178);
+ Add_Goto (Table.States (400), 210, 179);
+ Add_Goto (Table.States (400), 211, 180);
+ Add_Goto (Table.States (400), 213, 181);
+ Add_Goto (Table.States (400), 214, 182);
+ Add_Goto (Table.States (400), 215, 183);
+ Add_Goto (Table.States (400), 218, 184);
+ Add_Goto (Table.States (400), 219, 185);
+ Add_Goto (Table.States (400), 220, 186);
+ Add_Goto (Table.States (400), 229, 674);
+ Add_Goto (Table.States (400), 230, 675);
+ Add_Goto (Table.States (400), 231, 676);
+ Add_Goto (Table.States (400), 232, 190);
+ Add_Goto (Table.States (400), 233, 191);
+ Add_Goto (Table.States (400), 234, 192);
+ Add_Goto (Table.States (400), 237, 193);
+ Add_Goto (Table.States (400), 251, 58);
+ Add_Goto (Table.States (400), 252, 59);
+ Add_Goto (Table.States (400), 255, 60);
+ Add_Goto (Table.States (400), 256, 194);
+ Add_Goto (Table.States (400), 268, 68);
+ Add_Goto (Table.States (400), 311, 83);
+ Add_Goto (Table.States (400), 465, 196);
+ Table.States (400).Kernel := To_Vector ((0 => ((228, 3), 47, 1,
(32767, 0), 0)));
+ Table.States (400).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ end Subr_16;
+ procedure Subr_17
+ is begin
+ Table.States (401).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (401), 47, (228, 2), 677);
+ Table.States (401).Kernel := To_Vector ((0 => ((228, 2), 52, 2,
(32767, 0), 0)));
+ Table.States (401).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (228, 2), 47, 677)));
+ Table.States (402).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (402), (46, 52, 65, 76, 85, 86, 90, 106,
107, 115, 116, 117, 118), (235, 0), 1);
+ Table.States (402).Kernel := To_Vector ((0 => ((235, 0), 98, 0,
(235, 0), 1)));
+ Table.States (402).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (235, 0), 1)));
+ Table.States (403).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (403), (46, 52, 65, 76, 85, 86, 90, 106,
107, 115, 116, 117, 118), (235, 4), 1);
+ Table.States (403).Kernel := To_Vector ((0 => ((235, 4), 100, 0,
(235, 4), 1)));
+ Table.States (403).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (235, 4), 1)));
+ Table.States (404).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (404), (46, 52, 65, 76, 85, 86, 90, 106,
107, 115, 116, 117, 118), (235, 5), 1);
+ Table.States (404).Kernel := To_Vector ((0 => ((235, 5), 101, 0,
(235, 5), 1)));
+ Table.States (404).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (235, 5), 1)));
+ Table.States (405).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (405), (46, 52, 65, 76, 85, 86, 90, 106,
107, 115, 116, 117, 118), (235, 2), 1);
+ Table.States (405).Kernel := To_Vector ((0 => ((235, 2), 103, 0,
(235, 2), 1)));
+ Table.States (405).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (235, 2), 1)));
+ Table.States (406).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (406), (46, 52, 65, 76, 85, 86, 90, 106,
107, 115, 116, 117, 118), (235, 3), 1);
+ Table.States (406).Kernel := To_Vector ((0 => ((235, 3), 104, 0,
(235, 3), 1)));
+ Table.States (406).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (235, 3), 1)));
+ Table.States (407).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (407), (46, 52, 65, 76, 85, 86, 90, 106,
107, 115, 116, 117, 118), (235, 1), 1);
+ Table.States (407).Kernel := To_Vector ((0 => ((235, 1), 110, 0,
(235, 1), 1)));
+ Table.States (407).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (235, 1), 1)));
+ Table.States (408).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (408), 46, (233, 2), 167);
+ Add_Action (Table.States (408), 52, (233, 3), 168);
+ Add_Action (Table.States (408), 65, (234, 1), 169);
+ Add_Action (Table.States (408), 76, (256, 0), 170);
+ Add_Action (Table.States (408), 85, (205, 4), 171);
+ Add_Action (Table.States (408), 86, (213, 2), 172);
+ Add_Action (Table.States (408), 90, (268, 0), 34);
+ Add_Action (Table.States (408), 106, (237, 1), 173);
+ Add_Action (Table.States (408), 107, (237, 0), 174);
+ Add_Action (Table.States (408), 115, (234, 0), 175);
+ Add_Action (Table.States (408), 116, (196, 0), 146);
+ Add_Action (Table.States (408), 117, (196, 1), 37);
+ Add_Action (Table.States (408), 118, (195, 6), 38);
+ Table.States (408).Goto_List.Set_Capacity (28);
+ Add_Goto (Table.States (408), 195, 176);
+ Add_Goto (Table.States (408), 196, 148);
+ Add_Goto (Table.States (408), 197, 54);
+ Add_Goto (Table.States (408), 198, 55);
+ Add_Goto (Table.States (408), 199, 56);
+ Add_Goto (Table.States (408), 201, 57);
+ Add_Goto (Table.States (408), 205, 177);
+ Add_Goto (Table.States (408), 206, 178);
+ Add_Goto (Table.States (408), 210, 179);
+ Add_Goto (Table.States (408), 211, 180);
+ Add_Goto (Table.States (408), 213, 181);
+ Add_Goto (Table.States (408), 214, 182);
+ Add_Goto (Table.States (408), 215, 183);
+ Add_Goto (Table.States (408), 218, 184);
+ Add_Goto (Table.States (408), 219, 185);
+ Add_Goto (Table.States (408), 220, 186);
+ Add_Goto (Table.States (408), 231, 678);
+ Add_Goto (Table.States (408), 232, 190);
+ Add_Goto (Table.States (408), 233, 191);
+ Add_Goto (Table.States (408), 234, 192);
+ Add_Goto (Table.States (408), 237, 193);
+ Add_Goto (Table.States (408), 251, 58);
+ Add_Goto (Table.States (408), 252, 59);
+ Add_Goto (Table.States (408), 255, 60);
+ Add_Goto (Table.States (408), 256, 194);
+ Add_Goto (Table.States (408), 268, 68);
+ Add_Goto (Table.States (408), 311, 83);
+ Add_Goto (Table.States (408), 465, 196);
+ Table.States (408).Kernel := To_Vector ((0 => ((228, 0), 235, 1,
(32767, 0), 0)));
+ Table.States (408).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (409).Action_List.Set_Capacity (11);
+ Add_Action (Table.States (409), (46, 52, 65, 76, 85, 86, 90, 115,
116, 117, 118), (238, 3), 1);
+ Table.States (409).Kernel := To_Vector ((0 => ((238, 3), 45, 0,
(238, 3), 1)));
+ Table.States (409).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (238, 3), 1)));
+ Table.States (410).Action_List.Set_Capacity (11);
+ Add_Action (Table.States (410), (46, 52, 65, 76, 85, 86, 90, 115,
116, 117, 118), (238, 2), 1);
+ Table.States (410).Kernel := To_Vector ((0 => ((238, 2), 73, 0,
(238, 2), 1)));
+ Table.States (410).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (238, 2), 1)));
+ Table.States (411).Action_List.Set_Capacity (11);
+ Add_Action (Table.States (411), (46, 52, 65, 76, 85, 86, 90, 115,
116, 117, 118), (238, 1), 1);
+ Table.States (411).Kernel := To_Vector ((0 => ((238, 1), 109, 0,
(238, 1), 1)));
+ Table.States (411).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (238, 1), 1)));
+ Table.States (412).Action_List.Set_Capacity (11);
+ Add_Action (Table.States (412), (46, 52, 65, 76, 85, 86, 90, 115,
116, 117, 118), (238, 0), 1);
+ Table.States (412).Kernel := To_Vector ((0 => ((238, 0), 111, 0,
(238, 0), 1)));
+ Table.States (412).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (238, 0), 1)));
+ Table.States (413).Action_List.Set_Capacity (11);
+ Add_Action (Table.States (413), 46, (233, 2), 167);
+ Add_Action (Table.States (413), 52, (233, 3), 168);
+ Add_Action (Table.States (413), 65, (234, 1), 169);
+ Add_Action (Table.States (413), 76, (256, 0), 170);
+ Add_Action (Table.States (413), 85, (205, 4), 171);
+ Add_Action (Table.States (413), 86, (213, 2), 172);
+ Add_Action (Table.States (413), 90, (268, 0), 34);
+ Add_Action (Table.States (413), 115, (234, 0), 175);
+ Add_Action (Table.States (413), 116, (196, 0), 146);
+ Add_Action (Table.States (413), 117, (196, 1), 37);
+ Add_Action (Table.States (413), 118, (195, 6), 38);
+ Table.States (413).Goto_List.Set_Capacity (25);
+ Add_Goto (Table.States (413), 195, 176);
+ Add_Goto (Table.States (413), 196, 148);
+ Add_Goto (Table.States (413), 197, 54);
+ Add_Goto (Table.States (413), 198, 55);
+ Add_Goto (Table.States (413), 199, 56);
+ Add_Goto (Table.States (413), 201, 57);
+ Add_Goto (Table.States (413), 205, 177);
+ Add_Goto (Table.States (413), 206, 178);
+ Add_Goto (Table.States (413), 210, 179);
+ Add_Goto (Table.States (413), 211, 180);
+ Add_Goto (Table.States (413), 213, 181);
+ Add_Goto (Table.States (413), 214, 182);
+ Add_Goto (Table.States (413), 215, 183);
+ Add_Goto (Table.States (413), 218, 184);
+ Add_Goto (Table.States (413), 219, 185);
+ Add_Goto (Table.States (413), 220, 186);
+ Add_Goto (Table.States (413), 232, 679);
+ Add_Goto (Table.States (413), 233, 680);
+ Add_Goto (Table.States (413), 234, 192);
+ Add_Goto (Table.States (413), 251, 58);
+ Add_Goto (Table.States (413), 252, 59);
+ Add_Goto (Table.States (413), 255, 60);
+ Add_Goto (Table.States (413), 256, 194);
+ Add_Goto (Table.States (413), 268, 68);
+ Add_Goto (Table.States (413), 311, 83);
+ Table.States (413).Kernel := To_Vector ((((232, 1), 238, 1,
(32767, 0), 0), ((232, 2), 238, 1, (32767,
+ 0), 0)));
+ Table.States (414).Action_List.Set_Capacity (9);
+ Add_Action (Table.States (414), 65, (234, 1), 169);
+ Add_Action (Table.States (414), 76, (256, 0), 170);
+ Add_Action (Table.States (414), 85, (205, 4), 171);
+ Add_Action (Table.States (414), 86, (213, 2), 172);
+ Add_Action (Table.States (414), 90, (268, 0), 34);
+ Add_Action (Table.States (414), 115, (234, 0), 175);
+ Add_Action (Table.States (414), 116, (196, 0), 146);
+ Add_Action (Table.States (414), 117, (196, 1), 37);
+ Add_Action (Table.States (414), 118, (195, 6), 38);
+ Table.States (414).Goto_List.Set_Capacity (23);
+ Add_Goto (Table.States (414), 195, 176);
+ Add_Goto (Table.States (414), 196, 148);
+ Add_Goto (Table.States (414), 197, 54);
+ Add_Goto (Table.States (414), 198, 55);
+ Add_Goto (Table.States (414), 199, 56);
+ Add_Goto (Table.States (414), 201, 57);
+ Add_Goto (Table.States (414), 205, 177);
+ Add_Goto (Table.States (414), 206, 178);
+ Add_Goto (Table.States (414), 210, 179);
+ Add_Goto (Table.States (414), 211, 180);
+ Add_Goto (Table.States (414), 213, 181);
+ Add_Goto (Table.States (414), 214, 182);
+ Add_Goto (Table.States (414), 215, 183);
+ Add_Goto (Table.States (414), 218, 184);
+ Add_Goto (Table.States (414), 219, 185);
+ Add_Goto (Table.States (414), 220, 186);
+ Add_Goto (Table.States (414), 234, 681);
+ Add_Goto (Table.States (414), 251, 58);
+ Add_Goto (Table.States (414), 252, 59);
+ Add_Goto (Table.States (414), 255, 60);
+ Add_Goto (Table.States (414), 256, 194);
+ Add_Goto (Table.States (414), 268, 68);
+ Add_Goto (Table.States (414), 311, 83);
+ Table.States (414).Kernel := To_Vector ((0 => ((233, 0), 112, 1,
(32767, 0), 0)));
+ Table.States (414).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (415).Action_List.Set_Capacity (34);
+ Add_Action (Table.States (415), 33, Reduce, (231, 0), 2);
+ Add_Action (Table.States (415), 36, Reduce, (231, 0), 2);
+ Add_Action (Table.States (415), 41, Reduce, (231, 0), 2);
+ Add_Action (Table.States (415), 43, Reduce, (231, 0), 2);
+ Add_Action (Table.States (415), 44, Reduce, (231, 0), 2);
+ Add_Action (Table.States (415), 47, Reduce, (231, 0), 2);
+ Add_Action (Table.States (415), 48, Reduce, (231, 0), 2);
+ Add_Action (Table.States (415), 49, Reduce, (231, 0), 2);
+ Add_Action (Table.States (415), 50, Reduce, (231, 0), 2);
+ Add_Action (Table.States (415), 52, Reduce, (231, 0), 2);
+ Add_Action (Table.States (415), 61, Reduce, (231, 0), 2);
+ Add_Action (Table.States (415), 63, Reduce, (231, 0), 2);
+ Add_Action (Table.States (415), 69, Reduce, (231, 0), 2);
+ Add_Action (Table.States (415), 72, Reduce, (231, 0), 2);
+ Add_Action (Table.States (415), 74, Reduce, (231, 0), 2);
+ Add_Action (Table.States (415), 75, Reduce, (231, 0), 2);
+ Add_Action (Table.States (415), 82, Reduce, (231, 0), 2);
+ Add_Action (Table.States (415), 87, Reduce, (231, 0), 2);
+ Add_Action (Table.States (415), 88, Reduce, (231, 0), 2);
+ Add_Action (Table.States (415), 89, (236, 2), 416);
+ Add_Action (Table.States (415), 91, Reduce, (231, 0), 2);
+ Add_Action (Table.States (415), 94, Reduce, (231, 0), 2);
+ Add_Action (Table.States (415), 95, Reduce, (231, 0), 2);
+ Add_Action (Table.States (415), 97, Reduce, (231, 0), 2);
+ Add_Action (Table.States (415), 98, Reduce, (231, 0), 2);
+ Add_Action (Table.States (415), 99, Reduce, (231, 0), 2);
+ Add_Action (Table.States (415), 100, Reduce, (231, 0), 2);
+ Add_Action (Table.States (415), 101, Reduce, (231, 0), 2);
+ Add_Action (Table.States (415), 103, Reduce, (231, 0), 2);
+ Add_Action (Table.States (415), 104, Reduce, (231, 0), 2);
+ Add_Action (Table.States (415), 106, (236, 1), 417);
+ Add_Action (Table.States (415), 107, (236, 0), 418);
+ Add_Action (Table.States (415), 108, Reduce, (231, 0), 2);
+ Add_Action (Table.States (415), 110, Reduce, (231, 0), 2);
+ Table.States (415).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (415), 236, 419);
+ Table.States (415).Kernel := To_Vector ((((231, 0), 465, 0,
(231, 0), 2), ((465, 1), 465, 2, (32767,
+ 0), 0), ((465, 2), 465, 2, (32767, 0), 0)));
+ Table.States (415).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (231, 0), 2)));
+ Table.States (416).Action_List.Set_Capacity (11);
+ Add_Action (Table.States (416), (46, 52, 65, 76, 85, 86, 90, 115,
116, 117, 118), (236, 2), 1);
+ Table.States (416).Kernel := To_Vector ((0 => ((236, 2), 89, 0,
(236, 2), 1)));
+ Table.States (416).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (236, 2), 1)));
+ Table.States (417).Action_List.Set_Capacity (11);
+ Add_Action (Table.States (417), (46, 52, 65, 76, 85, 86, 90, 115,
116, 117, 118), (236, 1), 1);
+ Table.States (417).Kernel := To_Vector ((0 => ((236, 1), 106, 0,
(236, 1), 1)));
+ Table.States (417).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (236, 1), 1)));
+ Table.States (418).Action_List.Set_Capacity (11);
+ Add_Action (Table.States (418), (46, 52, 65, 76, 85, 86, 90, 115,
116, 117, 118), (236, 0), 1);
+ Table.States (418).Kernel := To_Vector ((0 => ((236, 0), 107, 0,
(236, 0), 1)));
+ Table.States (418).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (236, 0), 1)));
+ Table.States (419).Action_List.Set_Capacity (11);
+ Add_Action (Table.States (419), 46, (233, 2), 167);
+ Add_Action (Table.States (419), 52, (233, 3), 168);
+ Add_Action (Table.States (419), 65, (234, 1), 169);
+ Add_Action (Table.States (419), 76, (256, 0), 170);
+ Add_Action (Table.States (419), 85, (205, 4), 171);
+ Add_Action (Table.States (419), 86, (213, 2), 172);
+ Add_Action (Table.States (419), 90, (268, 0), 34);
+ Add_Action (Table.States (419), 115, (234, 0), 175);
+ Add_Action (Table.States (419), 116, (196, 0), 146);
+ Add_Action (Table.States (419), 117, (196, 1), 37);
+ Add_Action (Table.States (419), 118, (195, 6), 38);
+ Table.States (419).Goto_List.Set_Capacity (26);
+ Add_Goto (Table.States (419), 195, 176);
+ Add_Goto (Table.States (419), 196, 148);
+ Add_Goto (Table.States (419), 197, 54);
+ Add_Goto (Table.States (419), 198, 55);
+ Add_Goto (Table.States (419), 199, 56);
+ Add_Goto (Table.States (419), 201, 57);
+ Add_Goto (Table.States (419), 205, 177);
+ Add_Goto (Table.States (419), 206, 178);
+ Add_Goto (Table.States (419), 210, 179);
+ Add_Goto (Table.States (419), 211, 180);
+ Add_Goto (Table.States (419), 213, 181);
+ Add_Goto (Table.States (419), 214, 182);
+ Add_Goto (Table.States (419), 215, 183);
+ Add_Goto (Table.States (419), 218, 184);
+ Add_Goto (Table.States (419), 219, 185);
+ Add_Goto (Table.States (419), 220, 186);
+ Add_Goto (Table.States (419), 232, 682);
+ Add_Goto (Table.States (419), 233, 191);
+ Add_Goto (Table.States (419), 234, 192);
+ Add_Goto (Table.States (419), 251, 58);
+ Add_Goto (Table.States (419), 252, 59);
+ Add_Goto (Table.States (419), 255, 60);
+ Add_Goto (Table.States (419), 256, 194);
+ Add_Goto (Table.States (419), 268, 68);
+ Add_Goto (Table.States (419), 311, 83);
+ Add_Goto (Table.States (419), 465, 683);
+ Table.States (419).Kernel := To_Vector ((((465, 1), 236, 1,
(32767, 0), 0), ((465, 2), 236, 1, (32767,
+ 0), 0)));
+ Table.States (420).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (420), 86, (252, 0), 33);
+ Add_Action (Table.States (420), 90, (268, 0), 34);
+ Add_Action (Table.States (420), 116, (196, 0), 146);
+ Add_Action (Table.States (420), 117, (196, 1), 37);
+ Add_Action (Table.States (420), 118, (195, 6), 38);
+ Table.States (420).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (420), 195, 684);
+ Add_Goto (Table.States (420), 196, 148);
+ Add_Goto (Table.States (420), 197, 54);
+ Add_Goto (Table.States (420), 198, 55);
+ Add_Goto (Table.States (420), 199, 56);
+ Add_Goto (Table.States (420), 201, 57);
+ Add_Goto (Table.States (420), 251, 58);
+ Add_Goto (Table.States (420), 252, 59);
+ Add_Goto (Table.States (420), 255, 60);
+ Add_Goto (Table.States (420), 268, 68);
+ Add_Goto (Table.States (420), 306, 685);
+ Add_Goto (Table.States (420), 311, 83);
+ Table.States (420).Kernel := To_Vector ((((306, 1), 95, 1,
(32767, 0), 0), ((306, 2), 95, 1, (32767,
+ 0), 0)));
+ Table.States (421).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (421), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (382, 0), 3);
+ Table.States (421).Kernel := To_Vector ((0 => ((382, 0), 108, 0,
(382, 0), 3)));
+ Table.States (421).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (382, 0), 3)));
+ Table.States (422).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (422), 18, (363, 0), 686);
+ Table.States (422).Kernel := To_Vector ((0 => ((363, 0), 61, 2,
(32767, 0), 0)));
+ Table.States (422).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (363, 0), 18, 686)));
+ Table.States (423).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (423), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (363, 1), 3);
+ Table.States (423).Kernel := To_Vector ((0 => ((363, 1), 108, 0,
(363, 1), 3)));
+ Table.States (423).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (363, 1), 3)));
+ Table.States (424).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (424), 12, (402, 0), 165);
+ Add_Action (Table.States (424), 46, (233, 2), 167);
+ Add_Action (Table.States (424), 52, (233, 3), 168);
+ Add_Action (Table.States (424), 65, (234, 1), 169);
+ Add_Action (Table.States (424), 76, (256, 0), 170);
+ Add_Action (Table.States (424), 85, (205, 4), 171);
+ Add_Action (Table.States (424), 86, (213, 2), 172);
+ Add_Action (Table.States (424), 90, (268, 0), 34);
+ Add_Action (Table.States (424), 106, (237, 1), 173);
+ Add_Action (Table.States (424), 107, (237, 0), 174);
+ Add_Action (Table.States (424), 115, (234, 0), 175);
+ Add_Action (Table.States (424), 116, (136, 0), 687);
+ Add_Action (Table.States (424), 117, (196, 1), 37);
+ Add_Action (Table.States (424), 118, (195, 6), 38);
+ Table.States (424).Goto_List.Set_Capacity (35);
+ Add_Goto (Table.States (424), 136, 688);
+ Add_Goto (Table.States (424), 195, 176);
+ Add_Goto (Table.States (424), 196, 148);
+ Add_Goto (Table.States (424), 197, 54);
+ Add_Goto (Table.States (424), 198, 55);
+ Add_Goto (Table.States (424), 199, 56);
+ Add_Goto (Table.States (424), 201, 57);
+ Add_Goto (Table.States (424), 205, 177);
+ Add_Goto (Table.States (424), 206, 178);
+ Add_Goto (Table.States (424), 210, 179);
+ Add_Goto (Table.States (424), 211, 180);
+ Add_Goto (Table.States (424), 213, 181);
+ Add_Goto (Table.States (424), 214, 182);
+ Add_Goto (Table.States (424), 215, 183);
+ Add_Goto (Table.States (424), 218, 184);
+ Add_Goto (Table.States (424), 219, 185);
+ Add_Goto (Table.States (424), 220, 186);
+ Add_Goto (Table.States (424), 227, 689);
+ Add_Goto (Table.States (424), 228, 188);
+ Add_Goto (Table.States (424), 231, 189);
+ Add_Goto (Table.States (424), 232, 190);
+ Add_Goto (Table.States (424), 233, 191);
+ Add_Goto (Table.States (424), 234, 192);
+ Add_Goto (Table.States (424), 237, 193);
+ Add_Goto (Table.States (424), 251, 58);
+ Add_Goto (Table.States (424), 252, 59);
+ Add_Goto (Table.States (424), 255, 60);
+ Add_Goto (Table.States (424), 256, 194);
+ Add_Goto (Table.States (424), 268, 68);
+ Add_Goto (Table.States (424), 298, 467);
+ Add_Goto (Table.States (424), 300, 468);
+ Add_Goto (Table.States (424), 311, 83);
+ Add_Goto (Table.States (424), 358, 690);
+ Add_Goto (Table.States (424), 402, 195);
+ Add_Goto (Table.States (424), 465, 196);
+ Table.States (424).Kernel := To_Vector ((((299, 0), 85, 4,
(32767, 0), 0), ((357, 0), 85, 7, (32767,
+ 0), 0), ((357, 1), 85, 3, (32767, 0), 0)));
+ Table.States (424).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (425).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (425), 33, (357, 2), 691);
+ Add_Action (Table.States (425), 108, (357, 3), 692);
+ Table.States (425).Kernel := To_Vector ((((357, 2), 295, 5,
(32767, 0), 0), ((357, 3), 295, 1, (32767,
+ 0), 0)));
+ Table.States (425).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (357, 3), 108, 692)));
+ Table.States (426).Action_List.Set_Capacity (11);
+ Add_Action (Table.States (426), (24, 33, 47, 49, 61, 63, 69, 82,
87, 94, 108), (295, 0), 1);
+ Table.States (426).Kernel := To_Vector ((0 => ((295, 0), 299, 0,
(295, 0), 1)));
+ Table.States (426).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (295, 0), 1)));
+ Table.States (427).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (427), 46, (233, 2), 167);
+ Add_Action (Table.States (427), 52, (187, 0), 356);
+ Add_Action (Table.States (427), 65, (234, 1), 169);
+ Add_Action (Table.States (427), 76, (256, 0), 170);
+ Add_Action (Table.States (427), 85, (205, 4), 171);
+ Add_Action (Table.States (427), 86, (213, 2), 172);
+ Add_Action (Table.States (427), 90, (268, 0), 34);
+ Add_Action (Table.States (427), 106, (237, 1), 173);
+ Add_Action (Table.States (427), 107, (237, 0), 174);
+ Add_Action (Table.States (427), 115, (234, 0), 175);
+ Add_Action (Table.States (427), 116, (136, 0), 687);
+ Add_Action (Table.States (427), 117, (196, 1), 37);
+ Add_Action (Table.States (427), 118, (195, 6), 38);
+ Table.States (427).Goto_List.Set_Capacity (36);
+ Add_Goto (Table.States (427), 131, 693);
+ Add_Goto (Table.States (427), 136, 688);
+ Add_Goto (Table.States (427), 140, 694);
+ Add_Goto (Table.States (427), 160, 695);
+ Add_Goto (Table.States (427), 187, 365);
+ Add_Goto (Table.States (427), 195, 366);
+ Add_Goto (Table.States (427), 196, 148);
+ Add_Goto (Table.States (427), 197, 54);
+ Add_Goto (Table.States (427), 198, 55);
+ Add_Goto (Table.States (427), 199, 56);
+ Add_Goto (Table.States (427), 201, 57);
+ Add_Goto (Table.States (427), 203, 369);
+ Add_Goto (Table.States (427), 205, 177);
+ Add_Goto (Table.States (427), 206, 178);
+ Add_Goto (Table.States (427), 210, 179);
+ Add_Goto (Table.States (427), 211, 180);
+ Add_Goto (Table.States (427), 213, 181);
+ Add_Goto (Table.States (427), 214, 182);
+ Add_Goto (Table.States (427), 215, 183);
+ Add_Goto (Table.States (427), 218, 184);
+ Add_Goto (Table.States (427), 219, 185);
+ Add_Goto (Table.States (427), 220, 186);
+ Add_Goto (Table.States (427), 231, 696);
+ Add_Goto (Table.States (427), 232, 190);
+ Add_Goto (Table.States (427), 233, 191);
+ Add_Goto (Table.States (427), 234, 192);
+ Add_Goto (Table.States (427), 237, 193);
+ Add_Goto (Table.States (427), 251, 58);
+ Add_Goto (Table.States (427), 252, 59);
+ Add_Goto (Table.States (427), 255, 60);
+ Add_Goto (Table.States (427), 256, 194);
+ Add_Goto (Table.States (427), 268, 68);
+ Add_Goto (Table.States (427), 298, 467);
+ Add_Goto (Table.States (427), 300, 468);
+ Add_Goto (Table.States (427), 311, 83);
+ Add_Goto (Table.States (427), 465, 196);
+ Table.States (427).Kernel := To_Vector ((((299, 0), 85, 4,
(32767, 0), 0), ((356, 4), 85, 5, (32767,
+ 0), 0), ((356, 5), 85, 3, (32767, 0), 0)));
+ Table.States (427).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (136, 0), 116, 687)));
+ end Subr_17;
+ procedure Subr_18
+ is begin
+ Table.States (428).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (428), 61, (434, 0), 299);
+ Add_Action (Table.States (428), 108, (356, 7), 697);
+ Table.States (428).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (428), 434, 698);
+ Table.States (428).Kernel := To_Vector ((((356, 6), 295, 3,
(32767, 0), 0), ((356, 7), 295, 1, (32767,
+ 0), 0)));
+ Table.States (428).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (356, 7), 108, 697)));
+ Table.States (429).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (429), 24, (339, 0), 699);
+ Add_Action (Table.States (429), 85, (198, 0), 281);
+ Add_Action (Table.States (429), 96, (197, 0), 283);
+ Add_Action (Table.States (429), 113, (121, 0), 285);
+ Add_Action (Table.States (429), 114, (121, 1), 286);
+ Table.States (429).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (429), 121, 287);
+ Add_Goto (Table.States (429), 313, 289);
+ Table.States (429).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0), ((339, 0),
195, 5, (32767, 0), 0), ((339, 1),
+ 195, 3, (32767, 0), 0)));
+ Table.States (429).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (339, 0), 24, 699)));
+ Table.States (430).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (430), 24, (339, 4), 700);
+ Add_Action (Table.States (430), 85, (198, 0), 281);
+ Add_Action (Table.States (430), 96, (197, 0), 283);
+ Add_Action (Table.States (430), 113, (121, 0), 285);
+ Add_Action (Table.States (430), 114, (121, 1), 286);
+ Table.States (430).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (430), 121, 287);
+ Add_Goto (Table.States (430), 313, 289);
+ Table.States (430).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0), ((339, 4),
195, 5, (32767, 0), 0), ((339, 5),
+ 195, 3, (32767, 0), 0)));
+ Table.States (430).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (339, 4), 24, 700)));
+ Table.States (431).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (431), 24, (339, 2), 701);
+ Add_Action (Table.States (431), 85, (198, 0), 281);
+ Add_Action (Table.States (431), 96, (197, 0), 283);
+ Add_Action (Table.States (431), 113, (121, 0), 285);
+ Add_Action (Table.States (431), 114, (121, 1), 286);
+ Table.States (431).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (431), 121, 287);
+ Add_Goto (Table.States (431), 313, 289);
+ Table.States (431).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0), ((339, 2),
195, 5, (32767, 0), 0), ((339, 3),
+ 195, 3, (32767, 0), 0)));
+ Table.States (431).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (339, 2), 24, 701)));
+ Table.States (432).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (432), 116, (430, 0), 702);
+ Table.States (432).Kernel := To_Vector ((((430, 0), 28, 7,
(32767, 0), 0), ((430, 1), 28, 5, (32767,
+ 0), 0)));
+ Table.States (432).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (430, 0), 116, 702)));
+ Table.States (433).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (433), 61, (434, 0), 299);
+ Add_Action (Table.States (433), 82, (426, 0), 703);
+ Add_Action (Table.States (433), 108, (426, 3), 704);
+ Table.States (433).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (433), 434, 705);
+ Table.States (433).Kernel := To_Vector ((((426, 0), 292, 5,
(32767, 0), 0), ((426, 1), 292, 3, (32767,
+ 0), 0), ((426, 2), 292, 3, (32767, 0), 0), ((426, 3), 292,
1, (32767, 0), 0), ((427, 0), 292, 6,
+ (32767, 0), 0), ((427, 1), 292, 4, (32767, 0), 0), ((427, 2),
292, 5, (32767, 0), 0), ((427, 3),
+ 292, 3, (32767, 0), 0)));
+ Table.States (433).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (426, 3), 108, 704)));
+ Table.States (434).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (434), 49, (412, 6), 706);
+ Add_Action (Table.States (434), 82, (411, 4), 707);
+ Add_Action (Table.States (434), 85, (165, 0), 499);
+ Add_Action (Table.States (434), 108, (412, 7), 708);
+ Table.States (434).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (434), 164, 709);
+ Add_Goto (Table.States (434), 165, 502);
+ Add_Goto (Table.States (434), 167, 710);
+ Table.States (434).Kernel := To_Vector ((((411, 0), 116, 11,
(32767, 0), 0), ((411, 1), 116, 9,
+ (32767, 0), 0), ((411, 2), 116, 8, (32767, 0), 0), ((411, 3),
116, 6, (32767, 0), 0), ((411, 4),
+ 116, 8, (32767, 0), 0), ((411, 5), 116, 6, (32767, 0), 0),
((411, 6), 116, 5, (32767, 0), 0),
+ ((411, 7), 116, 3, (32767, 0), 0), ((412, 0), 116, 9, (32767,
0), 0), ((412, 1), 116, 6, (32767,
+ 0), 0), ((412, 2), 116, 7, (32767, 0), 0), ((412, 3), 116,
4, (32767, 0), 0), ((412, 4), 116, 6,
+ (32767, 0), 0), ((412, 5), 116, 3, (32767, 0), 0), ((412, 6),
116, 4, (32767, 0), 0), ((412, 7),
+ 116, 1, (32767, 0), 0)));
+ Table.States (434).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (412, 7), 108, 708)));
+ Table.States (435).Action_List.Set_Capacity (9);
+ Add_Action (Table.States (435), 29, (301, 3), 711);
+ Add_Action (Table.States (435), 47, (301, 0), 712);
+ Add_Action (Table.States (435), 52, Reduce, (301, 1), 0);
+ Add_Action (Table.States (435), 56, Reduce, (301, 1), 0);
+ Add_Action (Table.States (435), 86, Reduce, (301, 1), 0);
+ Add_Action (Table.States (435), 90, Reduce, (301, 1), 0);
+ Add_Action (Table.States (435), 116, Reduce, (301, 1), 0);
+ Add_Action (Table.States (435), 117, Reduce, (301, 1), 0);
+ Add_Action (Table.States (435), 118, Reduce, (301, 1), 0);
+ Table.States (435).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (435), 301, 713);
+ Table.States (435).Kernel := To_Vector ((((409, 0), 93, 8,
(32767, 0), 0), ((409, 1), 93, 6, (32767,
+ 0), 0), ((409, 2), 93, 6, (32767, 0), 0), ((409, 3), 93, 4,
(32767, 0), 0), ((409, 4), 93, 6,
+ (32767, 0), 0), ((409, 5), 93, 4, (32767, 0), 0), ((409, 6),
93, 4, (32767, 0), 0), ((409, 7), 93,
+ 2, (32767, 0), 0), ((409, 8), 93, 7, (32767, 0), 0), ((409,
9), 93, 5, (32767, 0), 0), ((409, 10),
+ 93, 5, (32767, 0), 0), ((409, 11), 93, 3, (32767, 0), 0)));
+ Table.States (435).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (301, 1), 0)));
+ Table.States (436).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (436), (28, 50, 53, 54, 61, 83, 84, 116),
(464, 1), 2);
+ Table.States (436).Kernel := To_Vector ((((464, 0), 407, 0,
(464, 0), 1), ((464, 1), 407, 0, (464, 1),
+ 2)));
+ Table.States (436).Minimal_Complete_Actions := To_Vector
(((Reduce, (464, 0), 1), (Reduce, (464, 1),
+ 2)));
+ Table.States (437).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (437), (28, 50, 53, 54, 61, 83, 84, 116),
(464, 2), 2);
+ Table.States (437).Goto_List.Set_Capacity (15);
+ Add_Goto (Table.States (437), 124, 208);
+ Add_Goto (Table.States (437), 136, 209);
+ Add_Goto (Table.States (437), 330, 210);
+ Add_Goto (Table.States (437), 332, 95);
+ Add_Goto (Table.States (437), 333, 96);
+ Add_Goto (Table.States (437), 407, 436);
+ Add_Goto (Table.States (437), 409, 212);
+ Add_Goto (Table.States (437), 410, 213);
+ Add_Goto (Table.States (437), 411, 214);
+ Add_Goto (Table.States (437), 412, 215);
+ Add_Goto (Table.States (437), 425, 216);
+ Add_Goto (Table.States (437), 426, 217);
+ Add_Goto (Table.States (437), 427, 218);
+ Add_Goto (Table.States (437), 430, 219);
+ Add_Goto (Table.States (437), 464, 437);
+ Table.States (437).Kernel := To_Vector ((((464, 1), 464, 3,
(32767, 0), 0), ((464, 2), 464, 0, (464,
+ 2), 2), ((464, 2), 464, 3, (32767, 0), 0)));
+ Table.States (437).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (464, 2), 2)));
+ Table.States (438).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (438), 95, (331, 1), 464);
+ Add_Action (Table.States (438), 108, (387, 0), 714);
+ Table.States (438).Kernel := To_Vector ((((331, 1), 331, 2,
(32767, 0), 0), ((387, 0), 331, 1, (32767,
+ 0), 0)));
+ Table.States (438).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (387, 0), 108, 714)));
+ Table.States (439).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (439), 61, Reduce, (196, 0), 1);
+ Add_Action (Table.States (439), 82, (390, 0), 715);
+ Add_Conflict (Table.States (439), 82, (196, 0), 1);
+ Add_Action (Table.States (439), 85, Reduce, (196, 0), 1);
+ Add_Action (Table.States (439), 96, Reduce, (196, 0), 1);
+ Add_Action (Table.States (439), 113, Reduce, (196, 0), 1);
+ Add_Action (Table.States (439), 114, Reduce, (196, 0), 1);
+ Table.States (439).Kernel := To_Vector ((((196, 0), 116, 0,
(196, 0), 1), ((390, 0), 116, 5, (32767,
+ 0), 0), ((390, 1), 116, 3, (32767, 0), 0)));
+ Table.States (439).Minimal_Complete_Actions := To_Vector
(((Reduce, (196, 0), 1), (Shift, (390, 0), 82,
+ 715)));
+ Table.States (440).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (440), 61, (434, 0), 299);
+ Add_Action (Table.States (440), 82, (326, 2), 716);
+ Add_Action (Table.States (440), 85, (198, 0), 281);
+ Add_Action (Table.States (440), 96, (197, 0), 283);
+ Add_Action (Table.States (440), 113, (121, 0), 285);
+ Add_Action (Table.States (440), 114, (121, 1), 286);
+ Table.States (440).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (440), 121, 287);
+ Add_Goto (Table.States (440), 313, 289);
+ Add_Goto (Table.States (440), 434, 717);
+ Table.States (440).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0), ((326, 0),
195, 8, (32767, 0), 0), ((326, 1),
+ 195, 5, (32767, 0), 0), ((326, 2), 195, 6, (32767, 0), 0),
((326, 3), 195, 3, (32767, 0), 0)));
+ Table.States (440).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (326, 2), 82, 716)));
+ Table.States (441).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (441), 86, (252, 0), 33);
+ Add_Action (Table.States (441), 90, (268, 0), 34);
+ Add_Action (Table.States (441), 116, (196, 0), 146);
+ Add_Action (Table.States (441), 117, (196, 1), 37);
+ Add_Action (Table.States (441), 118, (195, 6), 38);
+ Table.States (441).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (441), 195, 718);
+ Add_Goto (Table.States (441), 196, 148);
+ Add_Goto (Table.States (441), 197, 54);
+ Add_Goto (Table.States (441), 198, 55);
+ Add_Goto (Table.States (441), 199, 56);
+ Add_Goto (Table.States (441), 201, 57);
+ Add_Goto (Table.States (441), 251, 58);
+ Add_Goto (Table.States (441), 252, 59);
+ Add_Goto (Table.States (441), 255, 60);
+ Add_Goto (Table.States (441), 268, 68);
+ Add_Goto (Table.States (441), 311, 83);
+ Table.States (441).Kernel := To_Vector ((((337, 0), 24, 4,
(32767, 0), 0), ((337, 1), 24, 2, (32767,
+ 0), 0)));
+ Table.States (441).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (442).Action_List.Set_Capacity (17);
+ Add_Action (Table.States (442), 22, (339, 0), 9);
+ Add_Action (Table.States (442), 25, (329, 1), 10);
+ Add_Action (Table.States (442), 27, (325, 9), 719);
+ Add_Action (Table.States (442), 28, (325, 0), 720);
+ Add_Action (Table.States (442), 50, (332, 0), 19);
+ Add_Action (Table.States (442), 51, (437, 0), 221);
+ Add_Action (Table.States (442), 52, (329, 0), 21);
+ Add_Action (Table.States (442), 53, (294, 0), 22);
+ Add_Action (Table.States (442), 54, (293, 0), 23);
+ Add_Action (Table.States (442), 59, (346, 0), 721);
+ Add_Action (Table.States (442), 60, (340, 0), 722);
+ Add_Action (Table.States (442), 66, (325, 11), 723);
+ Add_Action (Table.States (442), 76, (408, 0), 724);
+ Add_Action (Table.States (442), 81, (130, 0), 30);
+ Add_Action (Table.States (442), 83, (128, 0), 31);
+ Add_Action (Table.States (442), 84, (124, 0), 32);
+ Add_Action (Table.States (442), 116, (136, 0), 223);
+ Table.States (442).Goto_List.Set_Capacity (48);
+ Add_Goto (Table.States (442), 124, 725);
+ Add_Goto (Table.States (442), 126, 40);
+ Add_Goto (Table.States (442), 127, 41);
+ Add_Goto (Table.States (442), 128, 42);
+ Add_Goto (Table.States (442), 130, 43);
+ Add_Goto (Table.States (442), 135, 44);
+ Add_Goto (Table.States (442), 136, 45);
+ Add_Goto (Table.States (442), 137, 46);
+ Add_Goto (Table.States (442), 180, 47);
+ Add_Goto (Table.States (442), 189, 48);
+ Add_Goto (Table.States (442), 193, 726);
+ Add_Goto (Table.States (442), 291, 77);
+ Add_Goto (Table.States (442), 292, 727);
+ Add_Goto (Table.States (442), 293, 79);
+ Add_Goto (Table.States (442), 294, 80);
+ Add_Goto (Table.States (442), 320, 86);
+ Add_Goto (Table.States (442), 321, 87);
+ Add_Goto (Table.States (442), 322, 88);
+ Add_Goto (Table.States (442), 323, 728);
+ Add_Goto (Table.States (442), 324, 729);
+ Add_Goto (Table.States (442), 325, 89);
+ Add_Goto (Table.States (442), 327, 91);
+ Add_Goto (Table.States (442), 328, 92);
+ Add_Goto (Table.States (442), 329, 730);
+ Add_Goto (Table.States (442), 330, 94);
+ Add_Goto (Table.States (442), 332, 95);
+ Add_Goto (Table.States (442), 333, 96);
+ Add_Goto (Table.States (442), 334, 97);
+ Add_Goto (Table.States (442), 335, 98);
+ Add_Goto (Table.States (442), 336, 99);
+ Add_Goto (Table.States (442), 337, 100);
+ Add_Goto (Table.States (442), 338, 101);
+ Add_Goto (Table.States (442), 339, 102);
+ Add_Goto (Table.States (442), 340, 103);
+ Add_Goto (Table.States (442), 341, 104);
+ Add_Goto (Table.States (442), 346, 106);
+ Add_Goto (Table.States (442), 347, 107);
+ Add_Goto (Table.States (442), 394, 132);
+ Add_Goto (Table.States (442), 403, 134);
+ Add_Goto (Table.States (442), 404, 135);
+ Add_Goto (Table.States (442), 405, 136);
+ Add_Goto (Table.States (442), 406, 137);
+ Add_Goto (Table.States (442), 408, 138);
+ Add_Goto (Table.States (442), 431, 139);
+ Add_Goto (Table.States (442), 437, 140);
+ Add_Goto (Table.States (442), 438, 141);
+ Add_Goto (Table.States (442), 440, 142);
+ Add_Goto (Table.States (442), 454, 143);
+ Table.States (442).Kernel := To_Vector ((((325, 6), 82, 8,
(32767, 0), 0), ((325, 7), 82, 5, (32767,
+ 0), 0), ((325, 8), 82, 4, (32767, 0), 0), ((325, 9), 82, 5,
(32767, 0), 0), ((325, 10), 82, 2,
+ (32767, 0), 0), ((325, 11), 82, 1, (32767, 0), 0), ((408, 0),
82, 5, (32767, 0), 0), ((408, 1), 82,
+ 3, (32767, 0), 0)));
+ Table.States (442).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (325, 11), 66, 723)));
+ Table.States (443).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (443), 82, (325, 0), 731);
+ Table.States (443).Kernel := To_Vector ((((325, 0), 434, 9,
(32767, 0), 0), ((325, 1), 434, 6, (32767,
+ 0), 0), ((325, 2), 434, 5, (32767, 0), 0), ((325, 3), 434,
6, (32767, 0), 0), ((325, 4), 434, 3,
+ (32767, 0), 0), ((325, 5), 434, 2, (32767, 0), 0)));
+ Table.States (443).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (325, 0), 82, 731)));
+ Table.States (444).Action_List.Set_Capacity (9);
+ Add_Action (Table.States (444), 52, (187, 0), 347);
+ Add_Action (Table.States (444), 56, (188, 2), 514);
+ Add_Action (Table.States (444), 79, (317, 4), 732);
+ Add_Action (Table.States (444), 80, (317, 0), 733);
+ Add_Action (Table.States (444), 86, (252, 0), 33);
+ Add_Action (Table.States (444), 90, (268, 0), 34);
+ Add_Action (Table.States (444), 116, (196, 0), 146);
+ Add_Action (Table.States (444), 117, (196, 1), 37);
+ Add_Action (Table.States (444), 118, (195, 6), 38);
+ Table.States (444).Goto_List.Set_Capacity (15);
+ Add_Goto (Table.States (444), 131, 734);
+ Add_Goto (Table.States (444), 187, 526);
+ Add_Goto (Table.States (444), 188, 735);
+ Add_Goto (Table.States (444), 195, 528);
+ Add_Goto (Table.States (444), 196, 148);
+ Add_Goto (Table.States (444), 197, 54);
+ Add_Goto (Table.States (444), 198, 55);
+ Add_Goto (Table.States (444), 199, 56);
+ Add_Goto (Table.States (444), 201, 57);
+ Add_Goto (Table.States (444), 251, 58);
+ Add_Goto (Table.States (444), 252, 59);
+ Add_Goto (Table.States (444), 255, 60);
+ Add_Goto (Table.States (444), 268, 68);
+ Add_Goto (Table.States (444), 311, 83);
+ Add_Goto (Table.States (444), 319, 736);
+ Table.States (444).Kernel := To_Vector ((((317, 0), 93, 5,
(32767, 0), 0), ((317, 1), 93, 3, (32767,
+ 0), 0), ((317, 2), 93, 4, (32767, 0), 0), ((317, 3), 93, 2,
(32767, 0), 0), ((317, 4), 93, 4,
+ (32767, 0), 0), ((317, 5), 93, 2, (32767, 0), 0), ((317, 6),
93, 3, (32767, 0), 0), ((317, 7), 93,
+ 1, (32767, 0), 0)));
+ Table.States (444).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (445).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (445), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (316, 0), 3);
+ Table.States (445).Kernel := To_Vector ((0 => ((316, 0), 108, 0,
(316, 0), 3)));
+ Table.States (445).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (316, 0), 3)));
+ Table.States (446).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (446), 12, (401, 0), 1);
+ Add_Action (Table.States (446), 15, (370, 0), 3);
+ Add_Action (Table.States (446), 17, (365, 0), 4);
+ Add_Action (Table.States (446), 18, (382, 0), 5);
+ Add_Action (Table.States (446), 19, (363, 0), 6);
+ Add_Action (Table.States (446), 20, (357, 0), 7);
+ Add_Action (Table.States (446), 30, (316, 0), 13);
+ Add_Action (Table.States (446), 31, (290, 0), 14);
+ Add_Action (Table.States (446), 32, (289, 0), 15);
+ Add_Action (Table.States (446), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (446), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (446), 37, (288, 0), 17);
+ Add_Conflict (Table.States (446), 37, (285, 1), 0);
+ Add_Action (Table.States (446), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (446), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (446), 42, (271, 0), 18);
+ Add_Action (Table.States (446), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (446), 64, (273, 0), 27);
+ Add_Action (Table.States (446), 65, (264, 0), 28);
+ Add_Action (Table.States (446), 84, (124, 0), 32);
+ Add_Action (Table.States (446), 86, (252, 0), 33);
+ Add_Action (Table.States (446), 90, (268, 0), 34);
+ Add_Action (Table.States (446), 105, (265, 0), 35);
+ Add_Action (Table.States (446), 116, (196, 0), 146);
+ Add_Action (Table.States (446), 117, (196, 1), 37);
+ Add_Action (Table.States (446), 118, (195, 6), 38);
+ Table.States (446).Goto_List.Set_Capacity (46);
+ Add_Goto (Table.States (446), 124, 39);
+ Add_Goto (Table.States (446), 195, 52);
+ Add_Goto (Table.States (446), 196, 53);
+ Add_Goto (Table.States (446), 197, 54);
+ Add_Goto (Table.States (446), 198, 55);
+ Add_Goto (Table.States (446), 199, 56);
+ Add_Goto (Table.States (446), 201, 57);
+ Add_Goto (Table.States (446), 251, 58);
+ Add_Goto (Table.States (446), 252, 59);
+ Add_Goto (Table.States (446), 255, 60);
+ Add_Goto (Table.States (446), 259, 452);
+ Add_Goto (Table.States (446), 261, 331);
+ Add_Goto (Table.States (446), 262, 62);
+ Add_Goto (Table.States (446), 263, 63);
+ Add_Goto (Table.States (446), 264, 64);
+ Add_Goto (Table.States (446), 265, 65);
+ Add_Goto (Table.States (446), 266, 66);
+ Add_Goto (Table.States (446), 267, 67);
+ Add_Goto (Table.States (446), 268, 68);
+ Add_Goto (Table.States (446), 271, 69);
+ Add_Goto (Table.States (446), 273, 70);
+ Add_Goto (Table.States (446), 275, 71);
+ Add_Goto (Table.States (446), 285, 72);
+ Add_Goto (Table.States (446), 286, 73);
+ Add_Goto (Table.States (446), 288, 74);
+ Add_Goto (Table.States (446), 289, 75);
+ Add_Goto (Table.States (446), 290, 76);
+ Add_Goto (Table.States (446), 310, 82);
+ Add_Goto (Table.States (446), 311, 83);
+ Add_Goto (Table.States (446), 316, 84);
+ Add_Goto (Table.States (446), 318, 85);
+ Add_Goto (Table.States (446), 357, 110);
+ Add_Goto (Table.States (446), 363, 111);
+ Add_Goto (Table.States (446), 364, 112);
+ Add_Goto (Table.States (446), 365, 113);
+ Add_Goto (Table.States (446), 366, 114);
+ Add_Goto (Table.States (446), 367, 115);
+ Add_Goto (Table.States (446), 370, 116);
+ Add_Goto (Table.States (446), 376, 117);
+ Add_Goto (Table.States (446), 378, 118);
+ Add_Goto (Table.States (446), 379, 119);
+ Add_Goto (Table.States (446), 382, 120);
+ Add_Goto (Table.States (446), 396, 737);
+ Add_Goto (Table.States (446), 401, 133);
+ Add_Goto (Table.States (446), 461, 332);
+ Add_Goto (Table.States (446), 462, 144);
+ Table.States (446).Kernel := To_Vector ((0 => ((318, 0), 33, 5,
(32767, 0), 0)));
+ Table.States (446).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ Table.States (447).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (447), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (318, 1), 3);
+ Table.States (447).Kernel := To_Vector ((0 => ((318, 1), 108, 0,
(318, 1), 3)));
+ Table.States (447).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (318, 1), 3)));
+ Table.States (448).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (448), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (290, 0), 3);
+ Table.States (448).Kernel := To_Vector ((0 => ((290, 0), 108, 0,
(290, 0), 3)));
+ Table.States (448).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (290, 0), 3)));
+ end Subr_18;
+ procedure Subr_19
+ is begin
+ Table.States (449).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (449), 108, (289, 2), 738);
+ Table.States (449).Kernel := To_Vector ((0 => ((289, 2), 243, 1,
(32767, 0), 0)));
+ Table.States (449).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (289, 2), 108, 738)));
+ Table.States (450).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (450), 12, (402, 0), 165);
+ Add_Action (Table.States (450), 46, (233, 2), 167);
+ Add_Action (Table.States (450), 52, (233, 3), 168);
+ Add_Action (Table.States (450), 65, (234, 1), 169);
+ Add_Action (Table.States (450), 76, (256, 0), 170);
+ Add_Action (Table.States (450), 85, (205, 4), 171);
+ Add_Action (Table.States (450), 86, (213, 2), 172);
+ Add_Action (Table.States (450), 90, (268, 0), 34);
+ Add_Action (Table.States (450), 106, (237, 1), 173);
+ Add_Action (Table.States (450), 107, (237, 0), 174);
+ Add_Action (Table.States (450), 115, (234, 0), 175);
+ Add_Action (Table.States (450), 116, (196, 0), 146);
+ Add_Action (Table.States (450), 117, (196, 1), 37);
+ Add_Action (Table.States (450), 118, (195, 6), 38);
+ Table.States (450).Goto_List.Set_Capacity (32);
+ Add_Goto (Table.States (450), 195, 176);
+ Add_Goto (Table.States (450), 196, 148);
+ Add_Goto (Table.States (450), 197, 54);
+ Add_Goto (Table.States (450), 198, 55);
+ Add_Goto (Table.States (450), 199, 56);
+ Add_Goto (Table.States (450), 201, 57);
+ Add_Goto (Table.States (450), 205, 177);
+ Add_Goto (Table.States (450), 206, 178);
+ Add_Goto (Table.States (450), 210, 179);
+ Add_Goto (Table.States (450), 211, 180);
+ Add_Goto (Table.States (450), 213, 181);
+ Add_Goto (Table.States (450), 214, 182);
+ Add_Goto (Table.States (450), 215, 183);
+ Add_Goto (Table.States (450), 218, 184);
+ Add_Goto (Table.States (450), 219, 185);
+ Add_Goto (Table.States (450), 220, 186);
+ Add_Goto (Table.States (450), 227, 236);
+ Add_Goto (Table.States (450), 228, 188);
+ Add_Goto (Table.States (450), 231, 189);
+ Add_Goto (Table.States (450), 232, 190);
+ Add_Goto (Table.States (450), 233, 191);
+ Add_Goto (Table.States (450), 234, 192);
+ Add_Goto (Table.States (450), 237, 193);
+ Add_Goto (Table.States (450), 243, 739);
+ Add_Goto (Table.States (450), 251, 58);
+ Add_Goto (Table.States (450), 252, 59);
+ Add_Goto (Table.States (450), 255, 60);
+ Add_Goto (Table.States (450), 256, 194);
+ Add_Goto (Table.States (450), 268, 68);
+ Add_Goto (Table.States (450), 311, 83);
+ Add_Goto (Table.States (450), 402, 195);
+ Add_Goto (Table.States (450), 465, 196);
+ Table.States (450).Kernel := To_Vector ((0 => ((289, 0), 63, 2,
(32767, 0), 0)));
+ Table.States (450).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (451).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (451), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (289, 1), 3);
+ Table.States (451).Kernel := To_Vector ((0 => ((289, 1), 108, 0,
(289, 1), 3)));
+ Table.States (451).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (289, 1), 3)));
+ Table.States (452).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (452), 23, (396, 0), 740);
+ Add_Action (Table.States (452), 66, Reduce, (396, 1), 1);
+ Add_Action (Table.States (452), 75, Reduce, (396, 1), 1);
+ Table.States (452).Kernel := To_Vector ((((396, 0), 259, 4,
(32767, 0), 0), ((396, 1), 259, 0, (396,
+ 1), 1)));
+ Table.States (452).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (396, 1), 1)));
+ Table.States (453).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (453), 75, (288, 0), 741);
+ Table.States (453).Kernel := To_Vector ((0 => ((288, 0), 396, 6,
(32767, 0), 0)));
+ Table.States (453).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (288, 0), 75, 741)));
+ Table.States (454).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (454), 47, (278, 0), 469);
+ Add_Action (Table.States (454), 69, (280, 12), 470);
+ Add_Action (Table.States (454), 93, (280, 0), 471);
+ Table.States (454).Kernel := To_Vector ((((278, 0), 116, 5,
(32767, 0), 0), ((278, 1), 116, 3, (32767,
+ 0), 0), ((278, 2), 116, 4, (32767, 0), 0), ((278, 3), 116,
2, (32767, 0), 0), ((280, 0), 116, 7,
+ (32767, 0), 0), ((280, 1), 116, 5, (32767, 0), 0), ((280, 2),
116, 6, (32767, 0), 0), ((280, 3),
+ 116, 4, (32767, 0), 0), ((280, 4), 116, 5, (32767, 0), 0),
((280, 5), 116, 3, (32767, 0), 0),
+ ((280, 6), 116, 4, (32767, 0), 0), ((280, 7), 116, 2, (32767,
0), 0), ((280, 8), 116, 7, (32767,
+ 0), 0), ((280, 9), 116, 5, (32767, 0), 0), ((280, 10), 116,
6, (32767, 0), 0), ((280, 11), 116, 4,
+ (32767, 0), 0), ((280, 12), 116, 5, (32767, 0), 0), ((280,
13), 116, 3, (32767, 0), 0), ((280, 14),
+ 116, 4, (32767, 0), 0), ((280, 15), 116, 2, (32767, 0), 0)));
+ Table.States (454).Minimal_Complete_Actions := To_Vector (((Shift,
(278, 0), 47, 469), (Shift, (280, 12),
+ 69, 470)));
+ Table.States (455).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (455), (1 => 36), (276, 6), 3);
+ Table.States (455).Kernel := To_Vector ((0 => ((276, 6), 278, 0,
(276, 6), 3)));
+ Table.States (455).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (276, 6), 3)));
+ Table.States (456).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (456), (1 => 36), (276, 8), 3);
+ Table.States (456).Kernel := To_Vector ((0 => ((276, 8), 280, 0,
(276, 8), 3)));
+ Table.States (456).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (276, 8), 3)));
+ Table.States (457).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (457), (1 => 36), (276, 3), 3);
+ Table.States (457).Kernel := To_Vector ((0 => ((276, 3), 282, 0,
(276, 3), 3)));
+ Table.States (457).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (276, 3), 3)));
+ Table.States (458).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (458), 45, Reduce, (196, 0), 1);
+ Add_Action (Table.States (458), 47, (277, 1), 742);
+ Add_Action (Table.States (458), 73, Reduce, (196, 0), 1);
+ Add_Action (Table.States (458), 85, Reduce, (196, 0), 1);
+ Add_Action (Table.States (458), 87, Reduce, (196, 0), 1);
+ Add_Action (Table.States (458), 89, Reduce, (196, 0), 1);
+ Add_Action (Table.States (458), 96, Reduce, (196, 0), 1);
+ Add_Action (Table.States (458), 106, Reduce, (196, 0), 1);
+ Add_Action (Table.States (458), 107, Reduce, (196, 0), 1);
+ Add_Action (Table.States (458), 109, Reduce, (196, 0), 1);
+ Add_Action (Table.States (458), 111, Reduce, (196, 0), 1);
+ Add_Action (Table.States (458), 112, Reduce, (196, 0), 1);
+ Add_Action (Table.States (458), 113, Reduce, (196, 0), 1);
+ Add_Action (Table.States (458), 114, Reduce, (196, 0), 1);
+ Table.States (458).Kernel := To_Vector ((((196, 0), 116, 0,
(196, 0), 1), ((277, 1), 116, 2, (32767,
+ 0), 0)));
+ Table.States (458).Minimal_Complete_Actions := To_Vector
(((Reduce, (196, 0), 1), (Shift, (277, 1), 47,
+ 742)));
+ Table.States (459).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (459), (1 => 87), (277, 0), 1);
+ Table.States (459).Kernel := To_Vector ((0 => ((277, 0), 231, 0,
(277, 0), 1)));
+ Table.States (459).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (277, 0), 1)));
+ Table.States (460).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (460), 87, (276, 5), 743);
+ Table.States (460).Kernel := To_Vector ((((276, 5), 277, 5,
(32767, 0), 0), ((276, 7), 277, 5, (32767,
+ 0), 0)));
+ Table.States (460).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (276, 5), 87, 743)));
+ Table.States (461).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (461), 12, (401, 0), 1);
+ Add_Action (Table.States (461), 15, (370, 0), 3);
+ Add_Action (Table.States (461), 17, (365, 0), 4);
+ Add_Action (Table.States (461), 18, (382, 0), 5);
+ Add_Action (Table.States (461), 19, (363, 0), 6);
+ Add_Action (Table.States (461), 20, (357, 0), 7);
+ Add_Action (Table.States (461), 30, (316, 0), 13);
+ Add_Action (Table.States (461), 31, (290, 0), 14);
+ Add_Action (Table.States (461), 32, (289, 0), 15);
+ Add_Action (Table.States (461), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (461), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (461), 37, (288, 0), 17);
+ Add_Conflict (Table.States (461), 37, (285, 1), 0);
+ Add_Action (Table.States (461), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (461), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (461), 42, (271, 0), 18);
+ Add_Action (Table.States (461), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (461), 64, (273, 0), 27);
+ Add_Action (Table.States (461), 65, (264, 0), 28);
+ Add_Action (Table.States (461), 84, (124, 0), 32);
+ Add_Action (Table.States (461), 86, (252, 0), 33);
+ Add_Action (Table.States (461), 90, (268, 0), 34);
+ Add_Action (Table.States (461), 105, (265, 0), 35);
+ Add_Action (Table.States (461), 116, (196, 0), 146);
+ Add_Action (Table.States (461), 117, (196, 1), 37);
+ Add_Action (Table.States (461), 118, (195, 6), 38);
+ Table.States (461).Goto_List.Set_Capacity (45);
+ Add_Goto (Table.States (461), 124, 39);
+ Add_Goto (Table.States (461), 195, 52);
+ Add_Goto (Table.States (461), 196, 53);
+ Add_Goto (Table.States (461), 197, 54);
+ Add_Goto (Table.States (461), 198, 55);
+ Add_Goto (Table.States (461), 199, 56);
+ Add_Goto (Table.States (461), 201, 57);
+ Add_Goto (Table.States (461), 251, 58);
+ Add_Goto (Table.States (461), 252, 59);
+ Add_Goto (Table.States (461), 255, 60);
+ Add_Goto (Table.States (461), 259, 744);
+ Add_Goto (Table.States (461), 261, 331);
+ Add_Goto (Table.States (461), 262, 62);
+ Add_Goto (Table.States (461), 263, 63);
+ Add_Goto (Table.States (461), 264, 64);
+ Add_Goto (Table.States (461), 265, 65);
+ Add_Goto (Table.States (461), 266, 66);
+ Add_Goto (Table.States (461), 267, 67);
+ Add_Goto (Table.States (461), 268, 68);
+ Add_Goto (Table.States (461), 271, 69);
+ Add_Goto (Table.States (461), 273, 70);
+ Add_Goto (Table.States (461), 275, 71);
+ Add_Goto (Table.States (461), 285, 72);
+ Add_Goto (Table.States (461), 286, 73);
+ Add_Goto (Table.States (461), 288, 74);
+ Add_Goto (Table.States (461), 289, 75);
+ Add_Goto (Table.States (461), 290, 76);
+ Add_Goto (Table.States (461), 310, 82);
+ Add_Goto (Table.States (461), 311, 83);
+ Add_Goto (Table.States (461), 316, 84);
+ Add_Goto (Table.States (461), 318, 85);
+ Add_Goto (Table.States (461), 357, 110);
+ Add_Goto (Table.States (461), 363, 111);
+ Add_Goto (Table.States (461), 364, 112);
+ Add_Goto (Table.States (461), 365, 113);
+ Add_Goto (Table.States (461), 366, 114);
+ Add_Goto (Table.States (461), 367, 115);
+ Add_Goto (Table.States (461), 370, 116);
+ Add_Goto (Table.States (461), 376, 117);
+ Add_Goto (Table.States (461), 378, 118);
+ Add_Goto (Table.States (461), 379, 119);
+ Add_Goto (Table.States (461), 382, 120);
+ Add_Goto (Table.States (461), 401, 133);
+ Add_Goto (Table.States (461), 461, 332);
+ Add_Goto (Table.States (461), 462, 144);
+ Table.States (461).Kernel := To_Vector ((((271, 0), 43, 13,
(32767, 0), 0), ((271, 1), 43, 10, (32767,
+ 0), 0), ((271, 2), 43, 8, (32767, 0), 0), ((271, 3), 43, 5,
(32767, 0), 0)));
+ Table.States (461).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ Table.States (462).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (462), 86, (252, 0), 33);
+ Add_Action (Table.States (462), 90, (268, 0), 34);
+ Add_Action (Table.States (462), 116, (196, 0), 146);
+ Add_Action (Table.States (462), 117, (196, 1), 37);
+ Add_Action (Table.States (462), 118, (195, 6), 38);
+ Table.States (462).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (462), 195, 244);
+ Add_Goto (Table.States (462), 196, 148);
+ Add_Goto (Table.States (462), 197, 54);
+ Add_Goto (Table.States (462), 198, 55);
+ Add_Goto (Table.States (462), 199, 56);
+ Add_Goto (Table.States (462), 201, 57);
+ Add_Goto (Table.States (462), 251, 58);
+ Add_Goto (Table.States (462), 252, 59);
+ Add_Goto (Table.States (462), 255, 60);
+ Add_Goto (Table.States (462), 268, 68);
+ Add_Goto (Table.States (462), 311, 83);
+ Add_Goto (Table.States (462), 331, 745);
+ Table.States (462).Kernel := To_Vector ((0 => ((333, 0), 83, 2,
(32767, 0), 0)));
+ Table.States (462).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (463).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (463), 95, (331, 1), 464);
+ Add_Action (Table.States (463), 108, (333, 1), 746);
+ Table.States (463).Kernel := To_Vector ((((331, 1), 331, 2,
(32767, 0), 0), ((333, 1), 331, 1, (32767,
+ 0), 0)));
+ Table.States (463).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (333, 1), 108, 746)));
+ Table.States (464).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (464), 86, (252, 0), 33);
+ Add_Action (Table.States (464), 90, (268, 0), 34);
+ Add_Action (Table.States (464), 116, (196, 0), 146);
+ Add_Action (Table.States (464), 117, (196, 1), 37);
+ Add_Action (Table.States (464), 118, (195, 6), 38);
+ Table.States (464).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (464), 195, 747);
+ Add_Goto (Table.States (464), 196, 148);
+ Add_Goto (Table.States (464), 197, 54);
+ Add_Goto (Table.States (464), 198, 55);
+ Add_Goto (Table.States (464), 199, 56);
+ Add_Goto (Table.States (464), 201, 57);
+ Add_Goto (Table.States (464), 251, 58);
+ Add_Goto (Table.States (464), 252, 59);
+ Add_Goto (Table.States (464), 255, 60);
+ Add_Goto (Table.States (464), 268, 68);
+ Add_Goto (Table.States (464), 311, 83);
+ Table.States (464).Kernel := To_Vector ((0 => ((331, 1), 95, 1,
(32767, 0), 0)));
+ Table.States (464).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (465).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (465), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (332, 0), 3);
+ Table.States (465).Kernel := To_Vector ((0 => ((332, 0), 108, 0,
(332, 0), 3)));
+ Table.States (465).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (332, 0), 3)));
+ Table.States (466).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (466), 87, (283, 1), 748);
+ Add_Action (Table.States (466), 93, (300, 0), 749);
+ Add_Action (Table.States (466), 95, (136, 1), 280);
+ Table.States (466).Kernel := To_Vector ((((136, 1), 136, 2,
(32767, 0), 0), ((283, 1), 136, 1, (32767,
+ 0), 0), ((300, 0), 136, 7, (32767, 0), 0), ((300, 1), 136,
5, (32767, 0), 0), ((300, 2), 136, 5,
+ (32767, 0), 0), ((300, 3), 136, 3, (32767, 0), 0), ((300, 4),
136, 6, (32767, 0), 0), ((300, 5),
+ 136, 4, (32767, 0), 0), ((300, 6), 136, 4, (32767, 0), 0),
((300, 7), 136, 2, (32767, 0), 0),
+ ((300, 8), 136, 5, (32767, 0), 0), ((300, 9), 136, 3, (32767,
0), 0)));
+ Table.States (466).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (283, 1), 87, 748)));
+ Table.States (467).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (467), 87, (299, 0), 750);
+ Add_Action (Table.States (467), 108, (298, 1), 751);
+ Table.States (467).Kernel := To_Vector ((((298, 1), 298, 4,
(32767, 0), 0), ((298, 2), 298, 4, (32767,
+ 0), 0), ((299, 0), 298, 1, (32767, 0), 0)));
+ Table.States (467).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (299, 0), 87, 750)));
+ Table.States (468).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (468), (87, 108), (298, 0), 1);
+ Table.States (468).Kernel := To_Vector ((0 => ((298, 0), 300, 0,
(298, 0), 1)));
+ Table.States (468).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (298, 0), 1)));
+ Table.States (469).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (469), 34, (278, 0), 752);
+ Add_Action (Table.States (469), 46, (233, 2), 167);
+ Add_Action (Table.States (469), 52, (187, 0), 356);
+ Add_Action (Table.States (469), 65, (234, 1), 169);
+ Add_Action (Table.States (469), 76, (256, 0), 170);
+ Add_Action (Table.States (469), 85, (205, 4), 171);
+ Add_Action (Table.States (469), 86, (213, 2), 172);
+ Add_Action (Table.States (469), 90, (268, 0), 34);
+ Add_Action (Table.States (469), 106, (237, 1), 173);
+ Add_Action (Table.States (469), 107, (237, 0), 174);
+ Add_Action (Table.States (469), 115, (234, 0), 175);
+ Add_Action (Table.States (469), 116, (196, 0), 146);
+ Add_Action (Table.States (469), 117, (196, 1), 37);
+ Add_Action (Table.States (469), 118, (195, 6), 38);
+ Table.States (469).Goto_List.Set_Capacity (33);
+ Add_Goto (Table.States (469), 131, 693);
+ Add_Goto (Table.States (469), 140, 694);
+ Add_Goto (Table.States (469), 160, 753);
+ Add_Goto (Table.States (469), 187, 365);
+ Add_Goto (Table.States (469), 195, 754);
+ Add_Goto (Table.States (469), 196, 148);
+ Add_Goto (Table.States (469), 197, 54);
+ Add_Goto (Table.States (469), 198, 55);
+ Add_Goto (Table.States (469), 199, 56);
+ Add_Goto (Table.States (469), 201, 57);
+ Add_Goto (Table.States (469), 203, 369);
+ Add_Goto (Table.States (469), 205, 177);
+ Add_Goto (Table.States (469), 206, 178);
+ Add_Goto (Table.States (469), 210, 179);
+ Add_Goto (Table.States (469), 211, 180);
+ Add_Goto (Table.States (469), 213, 181);
+ Add_Goto (Table.States (469), 214, 182);
+ Add_Goto (Table.States (469), 215, 183);
+ Add_Goto (Table.States (469), 218, 184);
+ Add_Goto (Table.States (469), 219, 185);
+ Add_Goto (Table.States (469), 220, 186);
+ Add_Goto (Table.States (469), 231, 696);
+ Add_Goto (Table.States (469), 232, 190);
+ Add_Goto (Table.States (469), 233, 191);
+ Add_Goto (Table.States (469), 234, 192);
+ Add_Goto (Table.States (469), 237, 193);
+ Add_Goto (Table.States (469), 251, 58);
+ Add_Goto (Table.States (469), 252, 59);
+ Add_Goto (Table.States (469), 255, 60);
+ Add_Goto (Table.States (469), 256, 194);
+ Add_Goto (Table.States (469), 268, 68);
+ Add_Goto (Table.States (469), 311, 83);
+ Add_Goto (Table.States (469), 465, 196);
+ Table.States (469).Kernel := To_Vector ((((278, 0), 47, 4,
(32767, 0), 0), ((278, 1), 47, 2, (32767,
+ 0), 0), ((278, 2), 47, 3, (32767, 0), 0), ((278, 3), 47, 1,
(32767, 0), 0), ((280, 4), 47, 4,
+ (32767, 0), 0), ((280, 5), 47, 2, (32767, 0), 0), ((280, 6),
47, 3, (32767, 0), 0), ((280, 7), 47,
+ 1, (32767, 0), 0)));
+ Table.States (469).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (470).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (470), 34, (280, 12), 755);
+ Add_Action (Table.States (470), 86, (252, 0), 33);
+ Add_Action (Table.States (470), 90, (268, 0), 34);
+ Add_Action (Table.States (470), 116, (196, 0), 146);
+ Add_Action (Table.States (470), 117, (196, 1), 37);
+ Add_Action (Table.States (470), 118, (195, 6), 38);
+ Table.States (470).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (470), 195, 756);
+ Add_Goto (Table.States (470), 196, 148);
+ Add_Goto (Table.States (470), 197, 54);
+ Add_Goto (Table.States (470), 198, 55);
+ Add_Goto (Table.States (470), 199, 56);
+ Add_Goto (Table.States (470), 201, 57);
+ Add_Goto (Table.States (470), 251, 58);
+ Add_Goto (Table.States (470), 252, 59);
+ Add_Goto (Table.States (470), 255, 60);
+ Add_Goto (Table.States (470), 268, 68);
+ Add_Goto (Table.States (470), 311, 83);
+ Table.States (470).Kernel := To_Vector ((((280, 12), 69, 4,
(32767, 0), 0), ((280, 13), 69, 2, (32767,
+ 0), 0), ((280, 14), 69, 3, (32767, 0), 0), ((280, 15), 69,
1, (32767, 0), 0)));
+ Table.States (470).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (471).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (471), 52, (187, 0), 347);
+ Add_Action (Table.States (471), 56, (188, 2), 514);
+ Add_Action (Table.States (471), 86, (252, 0), 33);
+ Add_Action (Table.States (471), 90, (268, 0), 34);
+ Add_Action (Table.States (471), 116, (196, 0), 146);
+ Add_Action (Table.States (471), 117, (196, 1), 37);
+ Add_Action (Table.States (471), 118, (195, 6), 38);
+ Table.States (471).Goto_List.Set_Capacity (15);
+ Add_Goto (Table.States (471), 131, 757);
+ Add_Goto (Table.States (471), 187, 526);
+ Add_Goto (Table.States (471), 188, 758);
+ Add_Goto (Table.States (471), 195, 528);
+ Add_Goto (Table.States (471), 196, 148);
+ Add_Goto (Table.States (471), 197, 54);
+ Add_Goto (Table.States (471), 198, 55);
+ Add_Goto (Table.States (471), 199, 56);
+ Add_Goto (Table.States (471), 201, 57);
+ Add_Goto (Table.States (471), 251, 58);
+ Add_Goto (Table.States (471), 252, 59);
+ Add_Goto (Table.States (471), 255, 60);
+ Add_Goto (Table.States (471), 268, 68);
+ Add_Goto (Table.States (471), 281, 759);
+ Add_Goto (Table.States (471), 311, 83);
+ Table.States (471).Kernel := To_Vector ((((280, 0), 93, 6,
(32767, 0), 0), ((280, 1), 93, 4, (32767,
+ 0), 0), ((280, 2), 93, 5, (32767, 0), 0), ((280, 3), 93, 3,
(32767, 0), 0), ((280, 8), 93, 6,
+ (32767, 0), 0), ((280, 9), 93, 4, (32767, 0), 0), ((280, 10),
93, 5, (32767, 0), 0), ((280, 11),
+ 93, 3, (32767, 0), 0)));
+ Table.States (471).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (472).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (472), 67, (440, 0), 760);
+ Add_Action (Table.States (472), 85, (213, 0), 761);
+ Add_Action (Table.States (472), 86, (213, 2), 762);
+ Table.States (472).Goto_List.Set_Capacity (5);
+ Add_Goto (Table.States (472), 211, 763);
+ Add_Goto (Table.States (472), 213, 181);
+ Add_Goto (Table.States (472), 214, 182);
+ Add_Goto (Table.States (472), 215, 183);
+ Add_Goto (Table.States (472), 439, 764);
+ Table.States (472).Kernel := To_Vector ((((438, 0), 50, 3,
(32767, 0), 0), ((440, 0), 50, 17, (32767,
+ 0), 0), ((440, 1), 50, 16, (32767, 0), 0), ((440, 2), 50, 9,
(32767, 0), 0), ((440, 3), 50, 8,
+ (32767, 0), 0), ((440, 4), 50, 13, (32767, 0), 0), ((440, 5),
50, 12, (32767, 0), 0), ((440, 6),
+ 50, 5, (32767, 0), 0), ((440, 7), 50, 4, (32767, 0), 0)));
+ Table.States (472).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (213, 2), 86, 762)));
+ end Subr_19;
+ procedure Subr_20
+ is begin
+ Table.States (473).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (473), 56, (202, 1), 548);
+ Add_Action (Table.States (473), 71, (202, 2), 549);
+ Add_Action (Table.States (473), 72, (202, 3), 550);
+ Add_Action (Table.States (473), 73, (202, 4), 551);
+ Add_Action (Table.States (473), 85, (205, 4), 171);
+ Add_Action (Table.States (473), 86, (213, 2), 552);
+ Add_Action (Table.States (473), 116, (202, 0), 553);
+ Table.States (473).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (473), 202, 765);
+ Add_Goto (Table.States (473), 205, 555);
+ Add_Goto (Table.States (473), 206, 178);
+ Add_Goto (Table.States (473), 210, 179);
+ Add_Goto (Table.States (473), 211, 180);
+ Add_Goto (Table.States (473), 213, 181);
+ Add_Goto (Table.States (473), 214, 182);
+ Add_Goto (Table.States (473), 215, 183);
+ Add_Goto (Table.States (473), 218, 184);
+ Add_Goto (Table.States (473), 219, 185);
+ Add_Goto (Table.States (473), 220, 186);
+ Table.States (473).Kernel := To_Vector ((((201, 0), 121, 1,
(32767, 0), 0), ((255, 0), 121, 2, (32767,
+ 0), 0), ((437, 0), 121, 4, (32767, 0), 0)));
+ Table.States (473).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (202, 0), 116, 553)));
+ Table.States (474).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (474), 11, (454, 0), 766);
+ Table.States (474).Kernel := To_Vector ((0 => ((454, 0), 50, 3,
(32767, 0), 0)));
+ Table.States (474).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (454, 0), 11, 766)));
+ Table.States (475).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (475), 86, (252, 0), 33);
+ Add_Action (Table.States (475), 90, (268, 0), 34);
+ Add_Action (Table.States (475), 116, (196, 0), 146);
+ Add_Action (Table.States (475), 117, (196, 1), 37);
+ Add_Action (Table.States (475), 118, (195, 6), 38);
+ Table.States (475).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (475), 195, 767);
+ Add_Goto (Table.States (475), 196, 148);
+ Add_Goto (Table.States (475), 197, 54);
+ Add_Goto (Table.States (475), 198, 55);
+ Add_Goto (Table.States (475), 199, 56);
+ Add_Goto (Table.States (475), 201, 57);
+ Add_Goto (Table.States (475), 251, 58);
+ Add_Goto (Table.States (475), 252, 59);
+ Add_Goto (Table.States (475), 255, 60);
+ Add_Goto (Table.States (475), 268, 68);
+ Add_Goto (Table.States (475), 311, 768);
+ Table.States (475).Kernel := To_Vector ((((282, 0), 69, 6,
(32767, 0), 0), ((282, 1), 69, 4, (32767,
+ 0), 0)));
+ Table.States (475).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (476).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (476), 52, (187, 0), 347);
+ Add_Action (Table.States (476), 56, (188, 2), 514);
+ Add_Action (Table.States (476), 86, (252, 0), 33);
+ Add_Action (Table.States (476), 90, (268, 0), 34);
+ Add_Action (Table.States (476), 116, (196, 0), 146);
+ Add_Action (Table.States (476), 117, (196, 1), 37);
+ Add_Action (Table.States (476), 118, (195, 6), 38);
+ Table.States (476).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (476), 187, 769);
+ Add_Goto (Table.States (476), 188, 770);
+ Add_Goto (Table.States (476), 195, 771);
+ Add_Goto (Table.States (476), 196, 148);
+ Add_Goto (Table.States (476), 197, 54);
+ Add_Goto (Table.States (476), 198, 55);
+ Add_Goto (Table.States (476), 199, 56);
+ Add_Goto (Table.States (476), 201, 57);
+ Add_Goto (Table.States (476), 251, 58);
+ Add_Goto (Table.States (476), 252, 59);
+ Add_Goto (Table.States (476), 255, 60);
+ Add_Goto (Table.States (476), 268, 68);
+ Add_Goto (Table.States (476), 311, 83);
+ Table.States (476).Kernel := To_Vector ((((296, 0), 30, 3,
(32767, 0), 0), ((296, 1), 30, 1, (32767,
+ 0), 0), ((296, 2), 30, 2, (32767, 0), 0)));
+ Table.States (476).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (477).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (477), 76, (408, 8), 772);
+ Table.States (477).Kernel := To_Vector ((((408, 8), 82, 5,
(32767, 0), 0), ((408, 9), 82, 3, (32767,
+ 0), 0)));
+ Table.States (477).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (408, 8), 76, 772)));
+ Table.States (478).Action_List.Set_Capacity (20);
+ Add_Action (Table.States (478), 12, (402, 0), 165);
+ Add_Action (Table.States (478), 39, (249, 0), 353);
+ Add_Action (Table.States (478), 42, (242, 0), 354);
+ Add_Action (Table.States (478), 46, (233, 2), 167);
+ Add_Action (Table.States (478), 51, (247, 0), 530);
+ Add_Action (Table.States (478), 52, (187, 0), 356);
+ Add_Action (Table.States (478), 62, (200, 2), 531);
+ Add_Action (Table.States (478), 64, (245, 0), 358);
+ Add_Action (Table.States (478), 65, (234, 1), 169);
+ Add_Action (Table.States (478), 76, (256, 0), 170);
+ Add_Action (Table.States (478), 85, (205, 4), 171);
+ Add_Action (Table.States (478), 86, (213, 2), 172);
+ Add_Action (Table.States (478), 90, (268, 0), 34);
+ Add_Action (Table.States (478), 92, (315, 2), 532);
+ Add_Action (Table.States (478), 106, (237, 1), 173);
+ Add_Action (Table.States (478), 107, (237, 0), 174);
+ Add_Action (Table.States (478), 115, (234, 0), 175);
+ Add_Action (Table.States (478), 116, (136, 0), 687);
+ Add_Action (Table.States (478), 117, (196, 1), 37);
+ Add_Action (Table.States (478), 118, (195, 6), 360);
+ Table.States (478).Goto_List.Set_Capacity (48);
+ Add_Goto (Table.States (478), 131, 533);
+ Add_Goto (Table.States (478), 136, 688);
+ Add_Goto (Table.States (478), 140, 534);
+ Add_Goto (Table.States (478), 163, 535);
+ Add_Goto (Table.States (478), 187, 365);
+ Add_Goto (Table.States (478), 195, 366);
+ Add_Goto (Table.States (478), 196, 367);
+ Add_Goto (Table.States (478), 197, 54);
+ Add_Goto (Table.States (478), 198, 55);
+ Add_Goto (Table.States (478), 199, 56);
+ Add_Goto (Table.States (478), 200, 368);
+ Add_Goto (Table.States (478), 201, 57);
+ Add_Goto (Table.States (478), 203, 369);
+ Add_Goto (Table.States (478), 205, 177);
+ Add_Goto (Table.States (478), 206, 178);
+ Add_Goto (Table.States (478), 209, 536);
+ Add_Goto (Table.States (478), 210, 179);
+ Add_Goto (Table.States (478), 211, 180);
+ Add_Goto (Table.States (478), 213, 181);
+ Add_Goto (Table.States (478), 214, 182);
+ Add_Goto (Table.States (478), 215, 183);
+ Add_Goto (Table.States (478), 218, 184);
+ Add_Goto (Table.States (478), 219, 185);
+ Add_Goto (Table.States (478), 220, 186);
+ Add_Goto (Table.States (478), 227, 537);
+ Add_Goto (Table.States (478), 228, 188);
+ Add_Goto (Table.States (478), 231, 378);
+ Add_Goto (Table.States (478), 232, 190);
+ Add_Goto (Table.States (478), 233, 191);
+ Add_Goto (Table.States (478), 234, 192);
+ Add_Goto (Table.States (478), 237, 193);
+ Add_Goto (Table.States (478), 239, 538);
+ Add_Goto (Table.States (478), 242, 380);
+ Add_Goto (Table.States (478), 245, 381);
+ Add_Goto (Table.States (478), 247, 539);
+ Add_Goto (Table.States (478), 249, 540);
+ Add_Goto (Table.States (478), 251, 58);
+ Add_Goto (Table.States (478), 252, 59);
+ Add_Goto (Table.States (478), 255, 60);
+ Add_Goto (Table.States (478), 256, 194);
+ Add_Goto (Table.States (478), 268, 68);
+ Add_Goto (Table.States (478), 298, 467);
+ Add_Goto (Table.States (478), 300, 468);
+ Add_Goto (Table.States (478), 311, 83);
+ Add_Goto (Table.States (478), 312, 541);
+ Add_Goto (Table.States (478), 315, 542);
+ Add_Goto (Table.States (478), 402, 195);
+ Add_Goto (Table.States (478), 465, 196);
+ Table.States (478).Kernel := To_Vector ((((198, 0), 85, 2,
(32767, 0), 0), ((299, 0), 85, 4, (32767,
+ 0), 0), ((313, 0), 85, 2, (32767, 0), 0), ((313, 1), 85, 5,
(32767, 0), 0), ((313, 2), 85, 8,
+ (32767, 0), 0), ((313, 3), 85, 4, (32767, 0), 0)));
+ Table.States (478).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (479).Action_List.Set_Capacity (10);
+ Add_Action (Table.States (479), (24, 33, 47, 49, 61, 69, 82, 87,
94, 108), (297, 1), 1);
+ Table.States (479).Kernel := To_Vector ((0 => ((297, 1), 296, 0,
(297, 1), 1)));
+ Table.States (479).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (297, 1), 1)));
+ Table.States (480).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (480), (24, 61, 82, 108), (294, 0), 3);
+ Table.States (480).Kernel := To_Vector ((0 => ((294, 0), 297, 0,
(294, 0), 3)));
+ Table.States (480).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (294, 0), 3)));
+ Table.States (481).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (481), 30, (296, 0), 476);
+ Table.States (481).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (481), 296, 773);
+ Table.States (481).Kernel := To_Vector ((0 => ((297, 0), 299, 2,
(32767, 0), 0)));
+ Table.States (481).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (296, 0), 30, 476)));
+ Table.States (482).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (482), 76, (408, 4), 774);
+ Table.States (482).Kernel := To_Vector ((((408, 4), 82, 5,
(32767, 0), 0), ((408, 5), 82, 3, (32767,
+ 0), 0)));
+ Table.States (482).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (408, 4), 76, 774)));
+ Table.States (483).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (483), (24, 61, 82, 108), (293, 0), 3);
+ Table.States (483).Kernel := To_Vector ((0 => ((293, 0), 295, 0,
(293, 0), 3)));
+ Table.States (483).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (293, 0), 3)));
+ Table.States (484).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (484), 61, (434, 0), 299);
+ Add_Action (Table.States (484), 82, (354, 2), 775);
+ Table.States (484).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (484), 434, 776);
+ Table.States (484).Kernel := To_Vector ((((354, 0), 116, 8,
(32767, 0), 0), ((354, 1), 116, 5, (32767,
+ 0), 0), ((354, 2), 116, 6, (32767, 0), 0), ((354, 3), 116,
3, (32767, 0), 0), ((392, 0), 116, 5,
+ (32767, 0), 0), ((392, 1), 116, 3, (32767, 0), 0)));
+ Table.States (484).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (354, 2), 82, 775)));
+ Table.States (485).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (485), 61, (434, 0), 299);
+ Add_Action (Table.States (485), 82, (346, 6), 777);
+ Add_Action (Table.States (485), 85, (167, 0), 778);
+ Table.States (485).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (485), 167, 779);
+ Add_Goto (Table.States (485), 434, 780);
+ Table.States (485).Kernel := To_Vector ((((346, 0), 116, 13,
(32767, 0), 0), ((346, 1), 116, 10,
+ (32767, 0), 0), ((346, 2), 116, 11, (32767, 0), 0), ((346, 3),
116, 8, (32767, 0), 0), ((346, 4),
+ 116, 8, (32767, 0), 0), ((346, 5), 116, 5, (32767, 0), 0),
((346, 6), 116, 6, (32767, 0), 0),
+ ((346, 7), 116, 3, (32767, 0), 0)));
+ Table.States (485).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (346, 6), 82, 777)));
+ Table.States (486).Action_List.Set_Capacity (10);
+ Add_Action (Table.States (486), 21, (356, 4), 8);
+ Add_Action (Table.States (486), 25, (329, 1), 10);
+ Add_Action (Table.States (486), 27, (350, 6), 781);
+ Add_Action (Table.States (486), 51, (437, 0), 221);
+ Add_Action (Table.States (486), 52, (329, 0), 21);
+ Add_Action (Table.States (486), 53, (294, 0), 314);
+ Add_Action (Table.States (486), 54, (293, 0), 315);
+ Add_Action (Table.States (486), 66, (350, 10), 782);
+ Add_Action (Table.States (486), 76, (347, 2), 783);
+ Add_Action (Table.States (486), 84, (124, 0), 32);
+ Table.States (486).Goto_List.Set_Capacity (15);
+ Add_Goto (Table.States (486), 124, 784);
+ Add_Goto (Table.States (486), 291, 785);
+ Add_Goto (Table.States (486), 292, 786);
+ Add_Goto (Table.States (486), 293, 317);
+ Add_Goto (Table.States (486), 294, 318);
+ Add_Goto (Table.States (486), 329, 787);
+ Add_Goto (Table.States (486), 348, 788);
+ Add_Goto (Table.States (486), 350, 789);
+ Add_Goto (Table.States (486), 351, 790);
+ Add_Goto (Table.States (486), 356, 791);
+ Add_Goto (Table.States (486), 431, 792);
+ Add_Goto (Table.States (486), 437, 140);
+ Add_Goto (Table.States (486), 438, 141);
+ Add_Goto (Table.States (486), 440, 142);
+ Add_Goto (Table.States (486), 454, 143);
+ Table.States (486).Kernel := To_Vector ((((347, 2), 82, 5,
(32767, 0), 0), ((347, 3), 82, 2, (32767,
+ 0), 0)));
+ Table.States (486).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (350, 10), 66, 782)));
+ Table.States (487).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (487), 82, (347, 0), 793);
+ Table.States (487).Kernel := To_Vector ((((347, 0), 434, 6,
(32767, 0), 0), ((347, 1), 434, 3, (32767,
+ 0), 0)));
+ Table.States (487).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (347, 0), 82, 793)));
+ Table.States (488).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (488), 61, (434, 0), 299);
+ Add_Action (Table.States (488), 82, (345, 1), 794);
+ Table.States (488).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (488), 434, 795);
+ Table.States (488).Kernel := To_Vector ((((345, 0), 116, 8,
(32767, 0), 0), ((345, 1), 116, 6, (32767,
+ 0), 0), ((391, 0), 116, 5, (32767, 0), 0), ((391, 1), 116,
3, (32767, 0), 0)));
+ Table.States (488).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (345, 1), 82, 794)));
+ Table.States (489).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (489), 61, (434, 0), 299);
+ Add_Action (Table.States (489), 82, (340, 9), 796);
+ Add_Action (Table.States (489), 85, (167, 0), 778);
+ Add_Action (Table.States (489), 108, (340, 11), 797);
+ Table.States (489).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (489), 167, 798);
+ Add_Goto (Table.States (489), 434, 799);
+ Table.States (489).Kernel := To_Vector ((((340, 0), 116, 16,
(32767, 0), 0), ((340, 1), 116, 13,
+ (32767, 0), 0), ((340, 2), 116, 8, (32767, 0), 0), ((340, 3),
116, 14, (32767, 0), 0), ((340, 4),
+ 116, 11, (32767, 0), 0), ((340, 5), 116, 6, (32767, 0), 0),
((340, 6), 116, 11, (32767, 0), 0),
+ ((340, 7), 116, 8, (32767, 0), 0), ((340, 8), 116, 3, (32767,
0), 0), ((340, 9), 116, 9, (32767,
+ 0), 0), ((340, 10), 116, 6, (32767, 0), 0), ((340, 11), 116,
1, (32767, 0), 0)));
+ Table.States (489).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (340, 11), 108, 797)));
+ Table.States (490).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (490), 21, (356, 4), 8);
+ Add_Action (Table.States (490), 25, (329, 1), 10);
+ Add_Action (Table.States (490), 51, (437, 0), 221);
+ Add_Action (Table.States (490), 52, (329, 0), 21);
+ Add_Action (Table.States (490), 76, (341, 3), 800);
+ Table.States (490).Goto_List.Set_Capacity (10);
+ Add_Goto (Table.States (490), 329, 801);
+ Add_Goto (Table.States (490), 342, 802);
+ Add_Goto (Table.States (490), 343, 803);
+ Add_Goto (Table.States (490), 344, 804);
+ Add_Goto (Table.States (490), 356, 805);
+ Add_Goto (Table.States (490), 431, 806);
+ Add_Goto (Table.States (490), 437, 140);
+ Add_Goto (Table.States (490), 438, 141);
+ Add_Goto (Table.States (490), 440, 142);
+ Add_Goto (Table.States (490), 454, 143);
+ Table.States (490).Kernel := To_Vector ((((341, 3), 82, 8,
(32767, 0), 0), ((341, 4), 82, 5, (32767,
+ 0), 0)));
+ Table.States (490).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (356, 4), 21, 8)));
+ Table.States (491).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (491), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (341, 5), 3);
+ Table.States (491).Kernel := To_Vector ((0 => ((341, 5), 108, 0,
(341, 5), 3)));
+ Table.States (491).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (341, 5), 3)));
+ Table.States (492).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (492), 82, (341, 0), 807);
+ Add_Action (Table.States (492), 108, (341, 2), 808);
+ Table.States (492).Kernel := To_Vector ((((341, 0), 434, 9,
(32767, 0), 0), ((341, 1), 434, 6, (32767,
+ 0), 0), ((341, 2), 434, 1, (32767, 0), 0)));
+ Table.States (492).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (341, 2), 108, 808)));
+ Table.States (493).Action_List.Set_Capacity (42);
+ Add_Action (Table.States (493), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (387,
+ 1), 3);
+ Table.States (493).Kernel := To_Vector ((0 => ((387, 1), 108, 0,
(387, 1), 3)));
+ Table.States (493).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (387, 1), 3)));
+ Table.States (494).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (494), 63, (274, 0), 809);
+ Table.States (494).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (494), 272, 810);
+ Add_Goto (Table.States (494), 274, 811);
+ Table.States (494).Kernel := To_Vector ((0 => ((273, 0), 82, 8,
(32767, 0), 0)));
+ Table.States (494).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (274, 0), 63, 809)));
+ Table.States (495).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (495), 86, (252, 0), 33);
+ Add_Action (Table.States (495), 90, (268, 0), 34);
+ Add_Action (Table.States (495), 116, (196, 0), 146);
+ Add_Action (Table.States (495), 117, (196, 1), 37);
+ Add_Action (Table.States (495), 118, (195, 6), 38);
+ Table.States (495).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (495), 195, 244);
+ Add_Goto (Table.States (495), 196, 148);
+ Add_Goto (Table.States (495), 197, 54);
+ Add_Goto (Table.States (495), 198, 55);
+ Add_Goto (Table.States (495), 199, 56);
+ Add_Goto (Table.States (495), 201, 57);
+ Add_Goto (Table.States (495), 251, 58);
+ Add_Goto (Table.States (495), 252, 59);
+ Add_Goto (Table.States (495), 255, 60);
+ Add_Goto (Table.States (495), 268, 68);
+ Add_Goto (Table.States (495), 311, 83);
+ Add_Goto (Table.States (495), 331, 812);
+ Table.States (495).Kernel := To_Vector ((0 => ((386, 0), 61, 2,
(32767, 0), 0)));
+ Table.States (495).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (496).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (496), 95, (331, 1), 464);
+ Add_Action (Table.States (496), 108, (386, 1), 813);
+ Table.States (496).Kernel := To_Vector ((((331, 1), 331, 2,
(32767, 0), 0), ((386, 1), 331, 1, (32767,
+ 0), 0)));
+ Table.States (496).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (386, 1), 108, 813)));
+ Table.States (497).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (497), 52, (187, 0), 347);
+ Add_Action (Table.States (497), 86, (252, 0), 33);
+ Add_Action (Table.States (497), 90, (268, 0), 34);
+ Add_Action (Table.States (497), 116, (196, 0), 146);
+ Add_Action (Table.States (497), 117, (196, 1), 37);
+ Add_Action (Table.States (497), 118, (195, 6), 38);
+ Table.States (497).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (497), 131, 814);
+ Add_Goto (Table.States (497), 187, 365);
+ Add_Goto (Table.States (497), 195, 528);
+ Add_Goto (Table.States (497), 196, 148);
+ Add_Goto (Table.States (497), 197, 54);
+ Add_Goto (Table.States (497), 198, 55);
+ Add_Goto (Table.States (497), 199, 56);
+ Add_Goto (Table.States (497), 201, 57);
+ Add_Goto (Table.States (497), 251, 58);
+ Add_Goto (Table.States (497), 252, 59);
+ Add_Goto (Table.States (497), 255, 60);
+ Add_Goto (Table.States (497), 268, 68);
+ Add_Goto (Table.States (497), 311, 83);
+ Table.States (497).Kernel := To_Vector ((((130, 0), 82, 4,
(32767, 0), 0), ((130, 1), 82, 2, (32767,
+ 0), 0)));
+ Table.States (497).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (498).Action_List.Set_Capacity (19);
+ Add_Action (Table.States (498), 27, (327, 22), 815);
+ Add_Action (Table.States (498), 52, (187, 0), 347);
+ Add_Action (Table.States (498), 56, (183, 4), 816);
+ Add_Action (Table.States (498), 57, (181, 8), 817);
+ Add_Action (Table.States (498), 58, (181, 6), 818);
+ Add_Action (Table.States (498), 59, (181, 4), 819);
+ Add_Action (Table.States (498), 60, (181, 2), 820);
+ Add_Action (Table.States (498), 65, (170, 2), 821);
+ Add_Action (Table.States (498), 67, (170, 0), 822);
+ Add_Action (Table.States (498), 68, (169, 2), 823);
+ Add_Action (Table.States (498), 70, (156, 0), 519);
+ Add_Action (Table.States (498), 71, (151, 0), 824);
+ Add_Action (Table.States (498), 72, (148, 0), 825);
+ Add_Action (Table.States (498), 73, (146, 0), 826);
+ Add_Action (Table.States (498), 74, (145, 0), 827);
+ Add_Action (Table.States (498), 76, (138, 9), 828);
+ Add_Action (Table.States (498), 77, (138, 6), 829);
+ Add_Action (Table.States (498), 78, (138, 0), 830);
+ Add_Action (Table.States (498), 85, (142, 0), 831);
+ Table.States (498).Goto_List.Set_Capacity (20);
+ Add_Goto (Table.States (498), 129, 832);
+ Add_Goto (Table.States (498), 138, 833);
+ Add_Goto (Table.States (498), 142, 834);
+ Add_Goto (Table.States (498), 144, 835);
+ Add_Goto (Table.States (498), 145, 836);
+ Add_Goto (Table.States (498), 146, 837);
+ Add_Goto (Table.States (498), 147, 838);
+ Add_Goto (Table.States (498), 148, 839);
+ Add_Goto (Table.States (498), 150, 840);
+ Add_Goto (Table.States (498), 151, 841);
+ Add_Goto (Table.States (498), 152, 842);
+ Add_Goto (Table.States (498), 154, 843);
+ Add_Goto (Table.States (498), 156, 524);
+ Add_Goto (Table.States (498), 159, 525);
+ Add_Goto (Table.States (498), 169, 844);
+ Add_Goto (Table.States (498), 170, 845);
+ Add_Goto (Table.States (498), 181, 846);
+ Add_Goto (Table.States (498), 183, 847);
+ Add_Goto (Table.States (498), 184, 848);
+ Add_Goto (Table.States (498), 187, 849);
+ Table.States (498).Kernel := To_Vector ((((128, 2), 82, 4,
(32767, 0), 0), ((128, 3), 82, 2, (32767,
+ 0), 0), ((189, 2), 82, 2, (32767, 0), 0), ((327, 12), 82, 7,
(32767, 0), 0), ((327, 13), 82, 5,
+ (32767, 0), 0), ((327, 14), 82, 6, (32767, 0), 0), ((327, 15),
82, 4, (32767, 0), 0), ((327, 16),
+ 82, 6, (32767, 0), 0), ((327, 17), 82, 4, (32767, 0), 0),
((327, 18), 82, 5, (32767, 0), 0), ((327,
+ 19), 82, 3, (32767, 0), 0), ((327, 20), 82, 5, (32767, 0),
0), ((327, 21), 82, 3, (32767, 0), 0),
+ ((327, 22), 82, 4, (32767, 0), 0), ((327, 23), 82, 2, (32767,
0), 0), ((328, 24), 82, 11, (32767,
+ 0), 0), ((328, 25), 82, 9, (32767, 0), 0), ((328, 26), 82,
9, (32767, 0), 0), ((328, 27), 82, 7,
+ (32767, 0), 0), ((328, 28), 82, 11, (32767, 0), 0), ((328,
29), 82, 9, (32767, 0), 0), ((328, 30),
+ 82, 9, (32767, 0), 0), ((328, 31), 82, 7, (32767, 0), 0),
((328, 32), 82, 10, (32767, 0), 0),
+ ((328, 33), 82, 8, (32767, 0), 0), ((328, 34), 82, 8, (32767,
0), 0), ((328, 35), 82, 6, (32767,
+ 0), 0), ((328, 36), 82, 10, (32767, 0), 0), ((328, 37), 82,
8, (32767, 0), 0), ((328, 38), 82, 8,
+ (32767, 0), 0), ((328, 39), 82, 6, (32767, 0), 0), ((328, 40),
82, 10, (32767, 0), 0), ((328, 41),
+ 82, 8, (32767, 0), 0), ((328, 42), 82, 8, (32767, 0), 0),
((328, 43), 82, 6, (32767, 0), 0), ((328,
+ 44), 82, 9, (32767, 0), 0), ((328, 45), 82, 7, (32767, 0),
0), ((328, 46), 82, 7, (32767, 0), 0),
+ ((328, 47), 82, 5, (32767, 0), 0)));
+ Table.States (498).Minimal_Complete_Actions := To_Vector (((Shift,
(181, 8), 57, 817), (Shift, (169, 2),
+ 68, 823), (Shift, (327, 22), 27, 815)));
+ end Subr_20;
+ procedure Subr_21
+ is begin
+ Table.States (499).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (499), 92, (165, 0), 850);
+ Add_Action (Table.States (499), 116, (136, 0), 207);
+ Table.States (499).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (499), 136, 851);
+ Add_Goto (Table.States (499), 166, 852);
+ Add_Goto (Table.States (499), 168, 853);
+ Table.States (499).Kernel := To_Vector ((((165, 0), 85, 2,
(32767, 0), 0), ((167, 0), 85, 4, (32767,
+ 0), 0)));
+ Table.States (499).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (165, 0), 92, 850)));
+ Table.States (500).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (500), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (189, 3), 3);
+ Table.States (500).Kernel := To_Vector ((0 => ((189, 3), 108, 0,
(189, 3), 3)));
+ Table.States (500).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (189, 3), 3)));
+ Table.States (501).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (501), 82, (189, 0), 854);
+ Add_Action (Table.States (501), 108, (189, 1), 855);
+ Table.States (501).Kernel := To_Vector ((((189, 0), 164, 3,
(32767, 0), 0), ((189, 1), 164, 1, (32767,
+ 0), 0), ((327, 0), 164, 8, (32767, 0), 0), ((327, 1), 164,
6, (32767, 0), 0), ((327, 2), 164, 7,
+ (32767, 0), 0), ((327, 3), 164, 5, (32767, 0), 0), ((327, 4),
164, 7, (32767, 0), 0), ((327, 5),
+ 164, 5, (32767, 0), 0), ((327, 6), 164, 6, (32767, 0), 0),
((327, 7), 164, 4, (32767, 0), 0),
+ ((327, 8), 164, 6, (32767, 0), 0), ((327, 9), 164, 4, (32767,
0), 0), ((327, 10), 164, 5, (32767,
+ 0), 0), ((327, 11), 164, 3, (32767, 0), 0), ((328, 0), 164,
12, (32767, 0), 0), ((328, 1), 164,
+ 10, (32767, 0), 0), ((328, 2), 164, 10, (32767, 0), 0), ((328,
3), 164, 8, (32767, 0), 0), ((328,
+ 4), 164, 12, (32767, 0), 0), ((328, 5), 164, 10, (32767, 0),
0), ((328, 6), 164, 10, (32767, 0),
+ 0), ((328, 7), 164, 8, (32767, 0), 0), ((328, 8), 164, 11,
(32767, 0), 0), ((328, 9), 164, 9,
+ (32767, 0), 0), ((328, 10), 164, 9, (32767, 0), 0), ((328,
11), 164, 7, (32767, 0), 0), ((328, 12),
+ 164, 11, (32767, 0), 0), ((328, 13), 164, 9, (32767, 0), 0),
((328, 14), 164, 9, (32767, 0), 0),
+ ((328, 15), 164, 7, (32767, 0), 0), ((328, 16), 164, 11,
(32767, 0), 0), ((328, 17), 164, 9,
+ (32767, 0), 0), ((328, 18), 164, 9, (32767, 0), 0), ((328,
19), 164, 7, (32767, 0), 0), ((328, 20),
+ 164, 10, (32767, 0), 0), ((328, 21), 164, 8, (32767, 0), 0),
((328, 22), 164, 8, (32767, 0), 0),
+ ((328, 23), 164, 6, (32767, 0), 0)));
+ Table.States (501).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (189, 1), 108, 855)));
+ Table.States (502).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (502), (49, 82, 108), (164, 0), 1);
+ Table.States (502).Kernel := To_Vector ((0 => ((164, 0), 165, 0,
(164, 0), 1)));
+ Table.States (502).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (164, 0), 1)));
+ Table.States (503).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (503), 82, (128, 0), 856);
+ Add_Conflict (Table.States (503), 82, (164, 1), 1);
+ Add_Action (Table.States (503), 108, Reduce, (164, 1), 1);
+ Table.States (503).Kernel := To_Vector ((((128, 0), 167, 5,
(32767, 0), 0), ((128, 1), 167, 3, (32767,
+ 0), 0), ((164, 1), 167, 0, (164, 1), 1)));
+ Table.States (503).Minimal_Complete_Actions := To_Vector (((Shift,
(128, 0), 82, 856), (Reduce, (164, 1),
+ 1)));
+ Table.States (504).Action_List.Set_Capacity (17);
+ Add_Action (Table.States (504), 12, (402, 0), 165);
+ Add_Action (Table.States (504), 42, (242, 0), 354);
+ Add_Action (Table.States (504), 46, (233, 2), 167);
+ Add_Action (Table.States (504), 51, (247, 0), 530);
+ Add_Action (Table.States (504), 52, (233, 3), 168);
+ Add_Action (Table.States (504), 64, (245, 0), 358);
+ Add_Action (Table.States (504), 65, (234, 1), 169);
+ Add_Action (Table.States (504), 76, (256, 0), 170);
+ Add_Action (Table.States (504), 85, (205, 4), 171);
+ Add_Action (Table.States (504), 86, (213, 2), 172);
+ Add_Action (Table.States (504), 90, (268, 0), 34);
+ Add_Action (Table.States (504), 106, (237, 1), 173);
+ Add_Action (Table.States (504), 107, (237, 0), 174);
+ Add_Action (Table.States (504), 115, (234, 0), 175);
+ Add_Action (Table.States (504), 116, (196, 0), 857);
+ Add_Action (Table.States (504), 117, (196, 1), 37);
+ Add_Action (Table.States (504), 118, (195, 6), 38);
+ Table.States (504).Goto_List.Set_Capacity (38);
+ Add_Goto (Table.States (504), 122, 858);
+ Add_Goto (Table.States (504), 123, 859);
+ Add_Goto (Table.States (504), 125, 860);
+ Add_Goto (Table.States (504), 195, 176);
+ Add_Goto (Table.States (504), 196, 148);
+ Add_Goto (Table.States (504), 197, 54);
+ Add_Goto (Table.States (504), 198, 55);
+ Add_Goto (Table.States (504), 199, 56);
+ Add_Goto (Table.States (504), 201, 57);
+ Add_Goto (Table.States (504), 205, 177);
+ Add_Goto (Table.States (504), 206, 178);
+ Add_Goto (Table.States (504), 210, 179);
+ Add_Goto (Table.States (504), 211, 180);
+ Add_Goto (Table.States (504), 213, 181);
+ Add_Goto (Table.States (504), 214, 182);
+ Add_Goto (Table.States (504), 215, 183);
+ Add_Goto (Table.States (504), 218, 184);
+ Add_Goto (Table.States (504), 219, 185);
+ Add_Goto (Table.States (504), 220, 186);
+ Add_Goto (Table.States (504), 227, 861);
+ Add_Goto (Table.States (504), 228, 188);
+ Add_Goto (Table.States (504), 231, 189);
+ Add_Goto (Table.States (504), 232, 190);
+ Add_Goto (Table.States (504), 233, 191);
+ Add_Goto (Table.States (504), 234, 192);
+ Add_Goto (Table.States (504), 237, 193);
+ Add_Goto (Table.States (504), 242, 862);
+ Add_Goto (Table.States (504), 245, 863);
+ Add_Goto (Table.States (504), 247, 864);
+ Add_Goto (Table.States (504), 251, 58);
+ Add_Goto (Table.States (504), 252, 59);
+ Add_Goto (Table.States (504), 255, 60);
+ Add_Goto (Table.States (504), 256, 194);
+ Add_Goto (Table.States (504), 268, 68);
+ Add_Goto (Table.States (504), 311, 83);
+ Add_Goto (Table.States (504), 402, 195);
+ Add_Goto (Table.States (504), 435, 865);
+ Add_Goto (Table.States (504), 465, 196);
+ Table.States (504).Kernel := To_Vector ((((124, 0), 85, 3,
(32767, 0), 0), ((124, 2), 85, 6, (32767,
+ 0), 0)));
+ Table.States (504).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (505).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (505), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (124, 1), 3);
+ Table.States (505).Kernel := To_Vector ((((124, 1), 108, 0,
(124, 1), 3), ((124, 3), 108, 0, (124, 3),
+ 3)));
+ Table.States (505).Minimal_Complete_Actions := To_Vector
(((Reduce, (124, 1), 3), (Reduce, (124, 3),
+ 3)));
+ Table.States (506).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (506), 46, (233, 2), 167);
+ Add_Action (Table.States (506), 52, (233, 3), 168);
+ Add_Action (Table.States (506), 65, (234, 1), 169);
+ Add_Action (Table.States (506), 76, (256, 0), 170);
+ Add_Action (Table.States (506), 85, (205, 4), 171);
+ Add_Action (Table.States (506), 86, (213, 2), 172);
+ Add_Action (Table.States (506), 90, (268, 0), 34);
+ Add_Action (Table.States (506), 106, (237, 1), 173);
+ Add_Action (Table.States (506), 107, (237, 0), 174);
+ Add_Action (Table.States (506), 115, (234, 0), 175);
+ Add_Action (Table.States (506), 116, (196, 0), 458);
+ Add_Action (Table.States (506), 117, (196, 1), 37);
+ Add_Action (Table.States (506), 118, (195, 6), 38);
+ Table.States (506).Goto_List.Set_Capacity (29);
+ Add_Goto (Table.States (506), 195, 176);
+ Add_Goto (Table.States (506), 196, 148);
+ Add_Goto (Table.States (506), 197, 54);
+ Add_Goto (Table.States (506), 198, 55);
+ Add_Goto (Table.States (506), 199, 56);
+ Add_Goto (Table.States (506), 201, 57);
+ Add_Goto (Table.States (506), 205, 177);
+ Add_Goto (Table.States (506), 206, 178);
+ Add_Goto (Table.States (506), 210, 179);
+ Add_Goto (Table.States (506), 211, 180);
+ Add_Goto (Table.States (506), 213, 181);
+ Add_Goto (Table.States (506), 214, 182);
+ Add_Goto (Table.States (506), 215, 183);
+ Add_Goto (Table.States (506), 218, 184);
+ Add_Goto (Table.States (506), 219, 185);
+ Add_Goto (Table.States (506), 220, 186);
+ Add_Goto (Table.States (506), 231, 459);
+ Add_Goto (Table.States (506), 232, 190);
+ Add_Goto (Table.States (506), 233, 191);
+ Add_Goto (Table.States (506), 234, 192);
+ Add_Goto (Table.States (506), 237, 193);
+ Add_Goto (Table.States (506), 251, 58);
+ Add_Goto (Table.States (506), 252, 59);
+ Add_Goto (Table.States (506), 255, 60);
+ Add_Goto (Table.States (506), 256, 194);
+ Add_Goto (Table.States (506), 268, 68);
+ Add_Goto (Table.States (506), 277, 866);
+ Add_Goto (Table.States (506), 311, 83);
+ Add_Goto (Table.States (506), 465, 196);
+ Table.States (506).Kernel := To_Vector ((0 => ((252, 0), 85, 9,
(32767, 0), 0)));
+ Table.States (506).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (507).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (507), 88, (252, 1), 867);
+ Table.States (507).Kernel := To_Vector ((0 => ((252, 1), 221, 1,
(32767, 0), 0)));
+ Table.States (507).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (252, 1), 88, 867)));
+ Table.States (508).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (508), 50, (221, 0), 868);
+ Add_Action (Table.States (508), 99, (314, 0), 632);
+ Table.States (508).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (508), 314, 869);
+ Table.States (508).Kernel := To_Vector ((((221, 0), 278, 4,
(32767, 0), 0), ((221, 1), 278, 2, (32767,
+ 0), 0)));
+ Table.States (508).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (314, 0), 99, 632)));
+ Table.States (509).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (509), 50, (221, 2), 870);
+ Add_Action (Table.States (509), 99, (314, 0), 632);
+ Table.States (509).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (509), 314, 871);
+ Table.States (509).Kernel := To_Vector ((((221, 2), 280, 4,
(32767, 0), 0), ((221, 3), 280, 2, (32767,
+ 0), 0)));
+ Table.States (509).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (314, 0), 99, 632)));
+ Table.States (510).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (510), (113, 114), (252, 2), 3);
+ Table.States (510).Kernel := To_Vector ((0 => ((252, 2), 88, 0,
(252, 2), 3)));
+ Table.States (510).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (252, 2), 3)));
+ Table.States (511).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (511), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (265, 0), 3);
+ Table.States (511).Kernel := To_Vector ((0 => ((265, 0), 102, 0,
(265, 0), 3)));
+ Table.States (511).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (265, 0), 3)));
+ Table.States (512).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (512), 61, (434, 0), 299);
+ Add_Action (Table.States (512), 85, (198, 0), 281);
+ Add_Action (Table.States (512), 96, (197, 0), 283);
+ Add_Action (Table.States (512), 108, (335, 5), 872);
+ Add_Action (Table.States (512), 113, (121, 0), 285);
+ Add_Action (Table.States (512), 114, (121, 1), 286);
+ Table.States (512).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (512), 121, 287);
+ Add_Goto (Table.States (512), 313, 289);
+ Add_Goto (Table.States (512), 434, 873);
+ Table.States (512).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0), ((335, 4),
195, 3, (32767, 0), 0), ((335, 5),
+ 195, 1, (32767, 0), 0)));
+ Table.States (512).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (335, 5), 108, 872)));
+ Table.States (513).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (513), 24, (336, 0), 874);
+ Table.States (513).Kernel := To_Vector ((((336, 0), 23, 5,
(32767, 0), 0), ((336, 1), 23, 3, (32767,
+ 0), 0)));
+ Table.States (513).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (336, 0), 24, 874)));
+ Table.States (514).Action_List.Set_Capacity (9);
+ Add_Action (Table.States (514), 53, (188, 11), 875);
+ Add_Action (Table.States (514), 54, (188, 7), 876);
+ Add_Action (Table.States (514), 59, (188, 6), 877);
+ Add_Action (Table.States (514), 79, (188, 2), 878);
+ Add_Action (Table.States (514), 86, (252, 0), 33);
+ Add_Action (Table.States (514), 90, (268, 0), 34);
+ Add_Action (Table.States (514), 116, (196, 0), 146);
+ Add_Action (Table.States (514), 117, (196, 1), 37);
+ Add_Action (Table.States (514), 118, (195, 6), 38);
+ Table.States (514).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (514), 195, 879);
+ Add_Goto (Table.States (514), 196, 148);
+ Add_Goto (Table.States (514), 197, 54);
+ Add_Goto (Table.States (514), 198, 55);
+ Add_Goto (Table.States (514), 199, 56);
+ Add_Goto (Table.States (514), 201, 57);
+ Add_Goto (Table.States (514), 251, 58);
+ Add_Goto (Table.States (514), 252, 59);
+ Add_Goto (Table.States (514), 255, 60);
+ Add_Goto (Table.States (514), 268, 68);
+ Add_Goto (Table.States (514), 311, 83);
+ Table.States (514).Kernel := To_Vector ((((188, 2), 56, 2,
(32767, 0), 0), ((188, 3), 56, 1, (32767,
+ 0), 0), ((188, 6), 56, 2, (32767, 0), 0), ((188, 7), 56, 1,
(32767, 0), 0), ((188, 10), 56, 4,
+ (32767, 0), 0), ((188, 11), 56, 3, (32767, 0), 0)));
+ Table.States (514).Minimal_Complete_Actions := To_Vector (((Shift,
(196, 0), 116, 146), (Shift, (188, 7),
+ 54, 876)));
+ Table.States (515).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (515), 56, (188, 0), 880);
+ Add_Action (Table.States (515), 86, (252, 0), 33);
+ Add_Action (Table.States (515), 90, (268, 0), 34);
+ Add_Action (Table.States (515), 116, (196, 0), 146);
+ Add_Action (Table.States (515), 117, (196, 1), 37);
+ Add_Action (Table.States (515), 118, (195, 6), 38);
+ Table.States (515).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (515), 195, 881);
+ Add_Goto (Table.States (515), 196, 148);
+ Add_Goto (Table.States (515), 197, 54);
+ Add_Goto (Table.States (515), 198, 55);
+ Add_Goto (Table.States (515), 199, 56);
+ Add_Goto (Table.States (515), 201, 57);
+ Add_Goto (Table.States (515), 251, 58);
+ Add_Goto (Table.States (515), 252, 59);
+ Add_Goto (Table.States (515), 255, 60);
+ Add_Goto (Table.States (515), 268, 68);
+ Add_Goto (Table.States (515), 311, 83);
+ Table.States (515).Kernel := To_Vector ((((188, 0), 187, 3,
(32767, 0), 0), ((188, 1), 187, 2, (32767,
+ 0), 0), ((188, 4), 187, 3, (32767, 0), 0), ((188, 5), 187,
2, (32767, 0), 0), ((188, 8), 187, 5,
+ (32767, 0), 0), ((188, 9), 187, 4, (32767, 0), 0), ((335, 0),
187, 6, (32767, 0), 0), ((335, 1),
+ 187, 4, (32767, 0), 0)));
+ Table.States (515).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (188, 0), 56, 880)));
+ Table.States (516).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (516), 24, (335, 6), 882);
+ Table.States (516).Kernel := To_Vector ((((335, 6), 188, 5,
(32767, 0), 0), ((335, 7), 188, 3, (32767,
+ 0), 0)));
+ Table.States (516).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (335, 6), 24, 882)));
+ Table.States (517).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (517), 24, (335, 2), 883);
+ Add_Action (Table.States (517), 85, (198, 0), 281);
+ Add_Action (Table.States (517), 96, (197, 0), 283);
+ Add_Action (Table.States (517), 113, (121, 0), 285);
+ Add_Action (Table.States (517), 114, (121, 1), 286);
+ Table.States (517).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (517), 121, 287);
+ Add_Goto (Table.States (517), 313, 289);
+ Table.States (517).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0), ((335, 2),
195, 5, (32767, 0), 0), ((335, 3),
+ 195, 3, (32767, 0), 0)));
+ Table.States (517).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (335, 2), 24, 883)));
+ Table.States (518).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (518), 61, (434, 0), 299);
+ Add_Action (Table.States (518), 108, (394, 1), 884);
+ Table.States (518).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (518), 434, 885);
+ Table.States (518).Kernel := To_Vector ((((394, 0), 23, 3,
(32767, 0), 0), ((394, 1), 23, 1, (32767,
+ 0), 0)));
+ Table.States (518).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (394, 1), 108, 884)));
+ Table.States (519).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (519), 85, (156, 0), 886);
+ Table.States (519).Kernel := To_Vector ((((156, 0), 70, 7,
(32767, 0), 0), ((159, 0), 70, 5, (32767,
+ 0), 0)));
+ Table.States (519).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (156, 0), 85, 886)));
+ Table.States (520).Action_List.Set_Capacity (9);
+ Add_Action (Table.States (520), 52, (187, 0), 347);
+ Add_Action (Table.States (520), 56, (188, 2), 514);
+ Add_Action (Table.States (520), 70, (156, 0), 519);
+ Add_Action (Table.States (520), 86, (252, 0), 33);
+ Add_Action (Table.States (520), 90, (268, 0), 34);
+ Add_Action (Table.States (520), 94, (134, 0), 282);
+ Add_Action (Table.States (520), 116, (196, 0), 146);
+ Add_Action (Table.States (520), 117, (196, 1), 37);
+ Add_Action (Table.States (520), 118, (195, 6), 38);
+ Table.States (520).Goto_List.Set_Capacity (18);
+ Add_Goto (Table.States (520), 131, 887);
+ Add_Goto (Table.States (520), 134, 888);
+ Add_Goto (Table.States (520), 154, 889);
+ Add_Goto (Table.States (520), 156, 524);
+ Add_Goto (Table.States (520), 159, 525);
+ Add_Goto (Table.States (520), 187, 526);
+ Add_Goto (Table.States (520), 188, 890);
+ Add_Goto (Table.States (520), 195, 528);
+ Add_Goto (Table.States (520), 196, 148);
+ Add_Goto (Table.States (520), 197, 54);
+ Add_Goto (Table.States (520), 198, 55);
+ Add_Goto (Table.States (520), 199, 56);
+ Add_Goto (Table.States (520), 201, 57);
+ Add_Goto (Table.States (520), 251, 58);
+ Add_Goto (Table.States (520), 252, 59);
+ Add_Goto (Table.States (520), 255, 60);
+ Add_Goto (Table.States (520), 268, 68);
+ Add_Goto (Table.States (520), 311, 83);
+ Table.States (520).Kernel := To_Vector ((((135, 8), 79, 6,
(32767, 0), 0), ((135, 9), 79, 4, (32767,
+ 0), 0), ((135, 10), 79, 4, (32767, 0), 0), ((135, 11), 79,
2, (32767, 0), 0), ((135, 24), 79, 7,
+ (32767, 0), 0), ((135, 25), 79, 5, (32767, 0), 0), ((135, 26),
79, 5, (32767, 0), 0), ((135, 27),
+ 79, 3, (32767, 0), 0), ((135, 40), 79, 12, (32767, 0), 0),
((135, 41), 79, 10, (32767, 0), 0),
+ ((135, 42), 79, 10, (32767, 0), 0), ((135, 43), 79, 8,
(32767, 0), 0), ((137, 0), 79, 3, (32767,
+ 0), 0)));
+ Table.States (520).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (521).Action_List.Set_Capacity (9);
+ Add_Action (Table.States (521), 52, (187, 0), 347);
+ Add_Action (Table.States (521), 56, (188, 2), 514);
+ Add_Action (Table.States (521), 70, (156, 0), 519);
+ Add_Action (Table.States (521), 79, (135, 0), 891);
+ Add_Action (Table.States (521), 86, (252, 0), 33);
+ Add_Action (Table.States (521), 90, (268, 0), 34);
+ Add_Action (Table.States (521), 116, (196, 0), 146);
+ Add_Action (Table.States (521), 117, (196, 1), 37);
+ Add_Action (Table.States (521), 118, (195, 6), 38);
+ Table.States (521).Goto_List.Set_Capacity (17);
+ Add_Goto (Table.States (521), 131, 892);
+ Add_Goto (Table.States (521), 154, 893);
+ Add_Goto (Table.States (521), 156, 524);
+ Add_Goto (Table.States (521), 159, 525);
+ Add_Goto (Table.States (521), 187, 526);
+ Add_Goto (Table.States (521), 188, 894);
+ Add_Goto (Table.States (521), 195, 528);
+ Add_Goto (Table.States (521), 196, 148);
+ Add_Goto (Table.States (521), 197, 54);
+ Add_Goto (Table.States (521), 198, 55);
+ Add_Goto (Table.States (521), 199, 56);
+ Add_Goto (Table.States (521), 201, 57);
+ Add_Goto (Table.States (521), 251, 58);
+ Add_Goto (Table.States (521), 252, 59);
+ Add_Goto (Table.States (521), 255, 60);
+ Add_Goto (Table.States (521), 268, 68);
+ Add_Goto (Table.States (521), 311, 83);
+ Table.States (521).Kernel := To_Vector ((((135, 0), 80, 7,
(32767, 0), 0), ((135, 1), 80, 5, (32767,
+ 0), 0), ((135, 2), 80, 5, (32767, 0), 0), ((135, 3), 80, 3,
(32767, 0), 0), ((135, 4), 80, 6,
+ (32767, 0), 0), ((135, 5), 80, 4, (32767, 0), 0), ((135, 6),
80, 4, (32767, 0), 0), ((135, 7), 80,
+ 2, (32767, 0), 0), ((135, 16), 80, 8, (32767, 0), 0), ((135,
17), 80, 6, (32767, 0), 0), ((135, 18),
+ 80, 6, (32767, 0), 0), ((135, 19), 80, 4, (32767, 0), 0),
((135, 20), 80, 7, (32767, 0), 0),
+ ((135, 21), 80, 5, (32767, 0), 0), ((135, 22), 80, 5, (32767,
0), 0), ((135, 23), 80, 3, (32767,
+ 0), 0), ((135, 32), 80, 13, (32767, 0), 0), ((135, 33), 80,
11, (32767, 0), 0), ((135, 34), 80,
+ 11, (32767, 0), 0), ((135, 35), 80, 9, (32767, 0), 0), ((135,
36), 80, 12, (32767, 0), 0), ((135,
+ 37), 80, 10, (32767, 0), 0), ((135, 38), 80, 10, (32767, 0),
0), ((135, 39), 80, 8, (32767, 0),
+ 0)));
+ Table.States (521).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (522).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (522), 61, (434, 0), 299);
+ Add_Action (Table.States (522), 94, (134, 0), 282);
+ Add_Action (Table.States (522), 108, (135, 15), 895);
+ Table.States (522).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (522), 134, 896);
+ Add_Goto (Table.States (522), 434, 897);
+ Table.States (522).Kernel := To_Vector ((((135, 12), 131, 5,
(32767, 0), 0), ((135, 13), 131, 3,
+ (32767, 0), 0), ((135, 14), 131, 3, (32767, 0), 0), ((135,
15), 131, 1, (32767, 0), 0)));
+ Table.States (522).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 15), 108, 895)));
+ Table.States (523).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (523), 61, (434, 0), 299);
+ Add_Action (Table.States (523), 94, (134, 0), 282);
+ Add_Action (Table.States (523), 108, (135, 47), 898);
+ Table.States (523).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (523), 134, 899);
+ Add_Goto (Table.States (523), 434, 900);
+ Table.States (523).Kernel := To_Vector ((((135, 44), 154, 5,
(32767, 0), 0), ((135, 45), 154, 3,
+ (32767, 0), 0), ((135, 46), 154, 3, (32767, 0), 0), ((135,
47), 154, 1, (32767, 0), 0)));
+ Table.States (523).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 47), 108, 898)));
+ Table.States (524).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (524), (49, 61, 94, 108), (154, 0), 1);
+ Table.States (524).Kernel := To_Vector ((0 => ((154, 0), 156, 0,
(154, 0), 1)));
+ Table.States (524).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (154, 0), 1)));
+ Table.States (525).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (525), (49, 61, 94, 108), (154, 1), 1);
+ Table.States (525).Kernel := To_Vector ((0 => ((154, 1), 159, 0,
(154, 1), 1)));
+ Table.States (525).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (154, 1), 1)));
+ end Subr_21;
+ procedure Subr_22
+ is begin
+ Table.States (526).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (526), 56, (188, 0), 880);
+ Add_Action (Table.States (526), 86, (252, 0), 33);
+ Add_Action (Table.States (526), 90, (268, 0), 34);
+ Add_Action (Table.States (526), 116, (196, 0), 146);
+ Add_Action (Table.States (526), 117, (196, 1), 37);
+ Add_Action (Table.States (526), 118, (195, 6), 38);
+ Table.States (526).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (526), 195, 634);
+ Add_Goto (Table.States (526), 196, 148);
+ Add_Goto (Table.States (526), 197, 54);
+ Add_Goto (Table.States (526), 198, 55);
+ Add_Goto (Table.States (526), 199, 56);
+ Add_Goto (Table.States (526), 201, 57);
+ Add_Goto (Table.States (526), 251, 58);
+ Add_Goto (Table.States (526), 252, 59);
+ Add_Goto (Table.States (526), 255, 60);
+ Add_Goto (Table.States (526), 268, 68);
+ Add_Goto (Table.States (526), 311, 83);
+ Table.States (526).Kernel := To_Vector ((((131, 0), 187, 3,
(32767, 0), 0), ((131, 1), 187, 1, (32767,
+ 0), 0), ((188, 0), 187, 3, (32767, 0), 0), ((188, 1), 187,
2, (32767, 0), 0), ((188, 4), 187, 3,
+ (32767, 0), 0), ((188, 5), 187, 2, (32767, 0), 0), ((188, 8),
187, 5, (32767, 0), 0), ((188, 9),
+ 187, 4, (32767, 0), 0)));
+ Table.States (526).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (527).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (527), 61, (434, 0), 299);
+ Add_Action (Table.States (527), 94, (134, 0), 282);
+ Add_Action (Table.States (527), 108, (135, 31), 901);
+ Table.States (527).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (527), 134, 902);
+ Add_Goto (Table.States (527), 434, 903);
+ Table.States (527).Kernel := To_Vector ((((135, 28), 188, 5,
(32767, 0), 0), ((135, 29), 188, 3,
+ (32767, 0), 0), ((135, 30), 188, 3, (32767, 0), 0), ((135,
31), 188, 1, (32767, 0), 0)));
+ Table.States (527).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 31), 108, 901)));
+ Table.States (528).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (528), 33, Reduce, (131, 3), 1);
+ Add_Action (Table.States (528), 47, Reduce, (131, 3), 1);
+ Add_Action (Table.States (528), 49, Reduce, (131, 3), 1);
+ Add_Action (Table.States (528), 61, Reduce, (131, 3), 1);
+ Add_Action (Table.States (528), 69, Reduce, (131, 3), 1);
+ Add_Action (Table.States (528), 71, (453, 0), 635);
+ Add_Action (Table.States (528), 72, (153, 0), 636);
+ Add_Action (Table.States (528), 74, (139, 0), 637);
+ Add_Action (Table.States (528), 75, Reduce, (131, 3), 1);
+ Add_Action (Table.States (528), 85, (162, 0), 612);
+ Add_Action (Table.States (528), 94, Reduce, (131, 3), 1);
+ Add_Action (Table.States (528), 96, (197, 0), 283);
+ Add_Action (Table.States (528), 108, Reduce, (131, 3), 1);
+ Add_Action (Table.States (528), 113, (121, 0), 285);
+ Add_Action (Table.States (528), 114, (121, 1), 286);
+ Table.States (528).Goto_List.Set_Capacity (8);
+ Add_Goto (Table.States (528), 121, 287);
+ Add_Goto (Table.States (528), 132, 639);
+ Add_Goto (Table.States (528), 133, 640);
+ Add_Goto (Table.States (528), 139, 641);
+ Add_Goto (Table.States (528), 153, 642);
+ Add_Goto (Table.States (528), 162, 643);
+ Add_Goto (Table.States (528), 313, 289);
+ Add_Goto (Table.States (528), 453, 644);
+ Table.States (528).Kernel := To_Vector ((((131, 2), 195, 2,
(32767, 0), 0), ((131, 3), 195, 0, (131,
+ 3), 1), ((197, 0), 195, 2, (32767, 0), 0), ((198, 0), 195,
3, (32767, 0), 0), ((199, 0), 195, 2,
+ (32767, 0), 0), ((201, 0), 195, 2, (32767, 0), 0), ((255, 0),
195, 3, (32767, 0), 0), ((311, 0),
+ 195, 3, (32767, 0), 0)));
+ Table.States (528).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (131, 3), 1)));
+ Table.States (529).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (529), (87, 93, 95), (136, 1), 3);
+ Table.States (529).Kernel := To_Vector ((0 => ((136, 1), 116, 0,
(136, 1), 3)));
+ Table.States (529).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (136, 1), 3)));
+ Table.States (530).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (530), 40, (248, 1), 625);
+ Add_Action (Table.States (530), 55, (248, 0), 626);
+ Table.States (530).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (530), 248, 627);
+ Table.States (530).Kernel := To_Vector ((((247, 0), 51, 6,
(32767, 0), 0), ((247, 1), 51, 6, (32767,
+ 0), 0)));
+ Table.States (530).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (248, 0), 55, 626)));
+ Table.States (531).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (531), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (200, 2), 1);
+ Table.States (531).Kernel := To_Vector ((0 => ((200, 2), 62, 0,
(200, 2), 1)));
+ Table.States (531).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (200, 2), 1)));
+ Table.States (532).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (532), (87, 95), (315, 2), 1);
+ Table.States (532).Kernel := To_Vector ((0 => ((315, 2), 92, 0,
(315, 2), 1)));
+ Table.States (532).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (315, 2), 1)));
+ Table.States (533).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (533), (87, 95), (163, 0), 1);
+ Table.States (533).Kernel := To_Vector ((0 => ((163, 0), 131, 0,
(163, 0), 1)));
+ Table.States (533).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (163, 0), 1)));
+ Table.States (534).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (534), (87, 95), (163, 1), 1);
+ Table.States (534).Kernel := To_Vector ((0 => ((163, 1), 140, 0,
(163, 1), 1)));
+ Table.States (534).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (163, 1), 1)));
+ Table.States (535).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (535), 87, (198, 0), 904);
+ Table.States (535).Kernel := To_Vector ((0 => ((198, 0), 163, 1,
(32767, 0), 0)));
+ Table.States (535).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (198, 0), 87, 904)));
+ Table.States (536).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (536), 91, (209, 1), 646);
+ Add_Action (Table.States (536), 99, (314, 0), 632);
+ Table.States (536).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (536), 314, 905);
+ Table.States (536).Kernel := To_Vector ((((209, 1), 209, 2,
(32767, 0), 0), ((315, 0), 209, 2, (32767,
+ 0), 0)));
+ Table.States (536).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (314, 0), 99, 632)));
+ Table.States (537).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (537), (87, 95), (315, 1), 1);
+ Table.States (537).Kernel := To_Vector ((0 => ((315, 1), 227, 0,
(315, 1), 1)));
+ Table.States (537).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (315, 1), 1)));
+ Table.States (538).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (538), 87, (313, 1), 906);
+ Table.States (538).Kernel := To_Vector ((0 => ((313, 1), 239, 1,
(32767, 0), 0)));
+ Table.States (538).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (313, 1), 87, 906)));
+ Table.States (539).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (539), 87, (313, 2), 907);
+ Table.States (539).Kernel := To_Vector ((0 => ((313, 2), 247, 1,
(32767, 0), 0)));
+ Table.States (539).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (313, 2), 87, 907)));
+ Table.States (540).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (540), 87, (313, 3), 908);
+ Table.States (540).Kernel := To_Vector ((0 => ((313, 3), 249, 1,
(32767, 0), 0)));
+ Table.States (540).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (313, 3), 87, 908)));
+ Table.States (541).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (541), 87, (313, 0), 909);
+ Add_Action (Table.States (541), 95, (312, 1), 910);
+ Table.States (541).Kernel := To_Vector ((((312, 1), 312, 2,
(32767, 0), 0), ((313, 0), 312, 1, (32767,
+ 0), 0)));
+ Table.States (541).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (313, 0), 87, 909)));
+ Table.States (542).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (542), (87, 95), (312, 0), 1);
+ Table.States (542).Kernel := To_Vector ((0 => ((312, 0), 315, 0,
(312, 0), 1)));
+ Table.States (542).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (312, 0), 1)));
+ Table.States (543).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (543), (33, 61, 87, 108), (134, 0), 2);
+ Table.States (543).Kernel := To_Vector ((0 => ((134, 0), 227, 0,
(134, 0), 2)));
+ Table.States (543).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (134, 0), 2)));
+ Table.States (544).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (544), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (197, 0), 3);
+ Table.States (544).Kernel := To_Vector ((0 => ((197, 0), 55, 0,
(197, 0), 3)));
+ Table.States (544).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (197, 0), 3)));
+ Table.States (545).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (545), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (200, 1), 1);
+ Table.States (545).Kernel := To_Vector ((0 => ((200, 1), 118, 0,
(200, 1), 1)));
+ Table.States (545).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (200, 1), 1)));
+ Table.States (546).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (546), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (200, 0), 1);
+ Table.States (546).Kernel := To_Vector ((0 => ((200, 0), 196, 0,
(200, 0), 1)));
+ Table.States (546).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (200, 0), 1)));
+ Table.States (547).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (547), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (199, 0), 3);
+ Table.States (547).Kernel := To_Vector ((0 => ((199, 0), 200, 0,
(199, 0), 3)));
+ Table.States (547).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (199, 0), 3)));
+ Table.States (548).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (548), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (202, 1), 1);
+ Table.States (548).Kernel := To_Vector ((0 => ((202, 1), 56, 0,
(202, 1), 1)));
+ Table.States (548).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (202, 1), 1)));
+ Table.States (549).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (549), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (202, 2), 1);
+ Table.States (549).Kernel := To_Vector ((0 => ((202, 2), 71, 0,
(202, 2), 1)));
+ Table.States (549).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (202, 2), 1)));
+ Table.States (550).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (550), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (202, 3), 1);
+ Table.States (550).Kernel := To_Vector ((0 => ((202, 3), 72, 0,
(202, 3), 1)));
+ Table.States (550).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (202, 3), 1)));
+ Table.States (551).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (551), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (202, 4), 1);
+ Table.States (551).Kernel := To_Vector ((0 => ((202, 4), 73, 0,
(202, 4), 1)));
+ Table.States (551).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (202, 4), 1)));
+ Table.States (552).Action_List.Set_Capacity (17);
+ Add_Action (Table.States (552), 12, (402, 0), 165);
+ Add_Action (Table.States (552), 46, (233, 2), 167);
+ Add_Action (Table.States (552), 51, (221, 0), 273);
+ Add_Action (Table.States (552), 52, (187, 0), 356);
+ Add_Action (Table.States (552), 62, (178, 3), 385);
+ Add_Action (Table.States (552), 65, (234, 1), 169);
+ Add_Action (Table.States (552), 76, (256, 0), 170);
+ Add_Action (Table.States (552), 85, (205, 4), 171);
+ Add_Action (Table.States (552), 86, (213, 2), 172);
+ Add_Action (Table.States (552), 88, (214, 0), 386);
+ Add_Action (Table.States (552), 90, (268, 0), 34);
+ Add_Action (Table.States (552), 106, (237, 1), 173);
+ Add_Action (Table.States (552), 107, (237, 0), 174);
+ Add_Action (Table.States (552), 115, (234, 0), 175);
+ Add_Action (Table.States (552), 116, (196, 0), 146);
+ Add_Action (Table.States (552), 117, (196, 1), 37);
+ Add_Action (Table.States (552), 118, (195, 6), 38);
+ Table.States (552).Goto_List.Set_Capacity (41);
+ Add_Goto (Table.States (552), 131, 361);
+ Add_Goto (Table.States (552), 140, 362);
+ Add_Goto (Table.States (552), 177, 363);
+ Add_Goto (Table.States (552), 178, 364);
+ Add_Goto (Table.States (552), 187, 365);
+ Add_Goto (Table.States (552), 195, 366);
+ Add_Goto (Table.States (552), 196, 148);
+ Add_Goto (Table.States (552), 197, 54);
+ Add_Goto (Table.States (552), 198, 55);
+ Add_Goto (Table.States (552), 199, 56);
+ Add_Goto (Table.States (552), 201, 57);
+ Add_Goto (Table.States (552), 203, 369);
+ Add_Goto (Table.States (552), 205, 177);
+ Add_Goto (Table.States (552), 206, 178);
+ Add_Goto (Table.States (552), 210, 179);
+ Add_Goto (Table.States (552), 211, 180);
+ Add_Goto (Table.States (552), 212, 387);
+ Add_Goto (Table.States (552), 213, 181);
+ Add_Goto (Table.States (552), 214, 182);
+ Add_Goto (Table.States (552), 215, 183);
+ Add_Goto (Table.States (552), 216, 388);
+ Add_Goto (Table.States (552), 217, 375);
+ Add_Goto (Table.States (552), 218, 184);
+ Add_Goto (Table.States (552), 219, 185);
+ Add_Goto (Table.States (552), 220, 186);
+ Add_Goto (Table.States (552), 221, 376);
+ Add_Goto (Table.States (552), 227, 390);
+ Add_Goto (Table.States (552), 228, 188);
+ Add_Goto (Table.States (552), 231, 378);
+ Add_Goto (Table.States (552), 232, 190);
+ Add_Goto (Table.States (552), 233, 191);
+ Add_Goto (Table.States (552), 234, 192);
+ Add_Goto (Table.States (552), 237, 193);
+ Add_Goto (Table.States (552), 251, 58);
+ Add_Goto (Table.States (552), 252, 59);
+ Add_Goto (Table.States (552), 255, 60);
+ Add_Goto (Table.States (552), 256, 194);
+ Add_Goto (Table.States (552), 268, 68);
+ Add_Goto (Table.States (552), 311, 83);
+ Add_Goto (Table.States (552), 402, 195);
+ Add_Goto (Table.States (552), 465, 196);
+ Table.States (552).Kernel := To_Vector ((((213, 2), 86, 6,
(32767, 0), 0), ((213, 3), 86, 2, (32767,
+ 0), 0), ((214, 0), 86, 1, (32767, 0), 0), ((215, 1), 86, 4,
(32767, 0), 0), ((220, 1), 86, 7,
+ (32767, 0), 0)));
+ Table.States (552).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (214, 0), 88, 386)));
+ Table.States (553).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (553), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (202, 0), 1);
+ Table.States (553).Kernel := To_Vector ((0 => ((202, 0), 116, 0,
(202, 0), 1)));
+ Table.States (553).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (202, 0), 1)));
+ Table.States (554).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (554), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (201, 0), 3);
+ Table.States (554).Kernel := To_Vector ((0 => ((201, 0), 202, 0,
(201, 0), 3)));
+ Table.States (554).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (201, 0), 3)));
+ Table.States (555).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (555), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (255, 0), 3);
+ Table.States (555).Kernel := To_Vector ((0 => ((255, 0), 205, 0,
(255, 0), 3)));
+ Table.States (555).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (255, 0), 3)));
+ Table.States (556).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (556), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (267, 0), 3);
+ Table.States (556).Kernel := To_Vector ((0 => ((267, 0), 108, 0,
(267, 0), 3)));
+ Table.States (556).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (267, 0), 3)));
+ Table.States (557).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (557), 85, (253, 0), 911);
+ Table.States (557).Kernel := To_Vector ((0 => ((253, 0), 116, 5,
(32767, 0), 0)));
+ Table.States (557).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (253, 0), 85, 911)));
+ Table.States (558).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (558), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (251, 0), 3);
+ Table.States (558).Kernel := To_Vector ((0 => ((251, 0), 253, 0,
(251, 0), 3)));
+ Table.States (558).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (251, 0), 3)));
+ Table.States (559).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (559), 66, (275, 1), 912);
+ Table.States (559).Kernel := To_Vector ((0 => ((275, 1), 259, 3,
(32767, 0), 0)));
+ Table.States (559).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (275, 1), 66, 912)));
+ Table.States (560).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (560), 66, (286, 1), 913);
+ Table.States (560).Kernel := To_Vector ((0 => ((286, 1), 396, 2,
(32767, 0), 0)));
+ Table.States (560).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (286, 1), 66, 913)));
+ Table.States (561).Action_List.Set_Capacity (16);
+ Add_Action (Table.States (561), (22, 25, 28, 38, 50, 51, 52, 53,
54, 59, 60, 66, 81, 83, 84, 116), (191,
+ 1), 1);
+ Table.States (561).Kernel := To_Vector ((0 => ((191, 1), 124, 0,
(191, 1), 1)));
+ Table.States (561).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (191, 1), 1)));
+ Table.States (562).Action_List.Set_Capacity (16);
+ Add_Action (Table.States (562), (22, 25, 28, 38, 50, 51, 52, 53,
54, 59, 60, 66, 81, 83, 84, 116), (191,
+ 0), 1);
+ Table.States (562).Kernel := To_Vector ((0 => ((191, 0), 190, 0,
(191, 0), 1)));
+ Table.States (562).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (191, 0), 1)));
+ Table.States (563).Action_List.Set_Capacity (16);
+ Add_Action (Table.States (563), (22, 25, 28, 38, 50, 51, 52, 53,
54, 59, 60, 66, 81, 83, 84, 116), (458,
+ 0), 1);
+ Table.States (563).Kernel := To_Vector ((0 => ((458, 0), 191, 0,
(458, 0), 1)));
+ Table.States (563).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (458, 0), 1)));
+ Table.States (564).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (564), 38, (286, 0), 914);
+ Table.States (564).Kernel := To_Vector ((0 => ((286, 0), 192, 5,
(32767, 0), 0)));
+ Table.States (564).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (286, 0), 38, 914)));
+ Table.States (565).Action_List.Set_Capacity (16);
+ Add_Action (Table.States (565), 22, (339, 0), 9);
+ Add_Action (Table.States (565), 25, (329, 1), 10);
+ Add_Action (Table.States (565), 28, (325, 0), 12);
+ Add_Action (Table.States (565), 38, Reduce, (192, 0), 1);
+ Add_Action (Table.States (565), 50, (332, 0), 19);
+ Add_Action (Table.States (565), 51, (437, 0), 221);
+ Add_Action (Table.States (565), 52, (329, 0), 21);
+ Add_Action (Table.States (565), 53, (294, 0), 22);
+ Add_Action (Table.States (565), 54, (293, 0), 23);
+ Add_Action (Table.States (565), 59, (346, 0), 24);
+ Add_Action (Table.States (565), 60, (340, 0), 25);
+ Add_Action (Table.States (565), 66, Reduce, (192, 0), 1);
+ Add_Action (Table.States (565), 81, (130, 0), 30);
+ Add_Action (Table.States (565), 83, (128, 0), 31);
+ Add_Action (Table.States (565), 84, (124, 0), 32);
+ Add_Action (Table.States (565), 116, (136, 0), 223);
+ Table.States (565).Goto_List.Set_Capacity (59);
+ Add_Goto (Table.States (565), 124, 561);
+ Add_Goto (Table.States (565), 126, 40);
+ Add_Goto (Table.States (565), 127, 41);
+ Add_Goto (Table.States (565), 128, 42);
+ Add_Goto (Table.States (565), 130, 43);
+ Add_Goto (Table.States (565), 135, 44);
+ Add_Goto (Table.States (565), 136, 45);
+ Add_Goto (Table.States (565), 137, 46);
+ Add_Goto (Table.States (565), 180, 47);
+ Add_Goto (Table.States (565), 189, 48);
+ Add_Goto (Table.States (565), 190, 562);
+ Add_Goto (Table.States (565), 191, 915);
+ Add_Goto (Table.States (565), 193, 50);
+ Add_Goto (Table.States (565), 194, 51);
+ Add_Goto (Table.States (565), 291, 77);
+ Add_Goto (Table.States (565), 292, 78);
+ Add_Goto (Table.States (565), 293, 79);
+ Add_Goto (Table.States (565), 294, 80);
+ Add_Goto (Table.States (565), 309, 81);
+ Add_Goto (Table.States (565), 320, 86);
+ Add_Goto (Table.States (565), 321, 87);
+ Add_Goto (Table.States (565), 322, 88);
+ Add_Goto (Table.States (565), 325, 89);
+ Add_Goto (Table.States (565), 326, 90);
+ Add_Goto (Table.States (565), 327, 91);
+ Add_Goto (Table.States (565), 328, 92);
+ Add_Goto (Table.States (565), 329, 225);
+ Add_Goto (Table.States (565), 330, 94);
+ Add_Goto (Table.States (565), 332, 95);
+ Add_Goto (Table.States (565), 333, 96);
+ Add_Goto (Table.States (565), 334, 97);
+ Add_Goto (Table.States (565), 335, 98);
+ Add_Goto (Table.States (565), 336, 99);
+ Add_Goto (Table.States (565), 337, 100);
+ Add_Goto (Table.States (565), 338, 101);
+ Add_Goto (Table.States (565), 339, 102);
+ Add_Goto (Table.States (565), 340, 103);
+ Add_Goto (Table.States (565), 341, 104);
+ Add_Goto (Table.States (565), 345, 105);
+ Add_Goto (Table.States (565), 346, 106);
+ Add_Goto (Table.States (565), 347, 107);
+ Add_Goto (Table.States (565), 354, 108);
+ Add_Goto (Table.States (565), 388, 126);
+ Add_Goto (Table.States (565), 389, 127);
+ Add_Goto (Table.States (565), 390, 128);
+ Add_Goto (Table.States (565), 391, 129);
+ Add_Goto (Table.States (565), 392, 130);
+ Add_Goto (Table.States (565), 394, 132);
+ Add_Goto (Table.States (565), 403, 134);
+ Add_Goto (Table.States (565), 404, 135);
+ Add_Goto (Table.States (565), 405, 136);
+ Add_Goto (Table.States (565), 406, 137);
+ Add_Goto (Table.States (565), 408, 138);
+ Add_Goto (Table.States (565), 431, 139);
+ Add_Goto (Table.States (565), 437, 140);
+ Add_Goto (Table.States (565), 438, 141);
+ Add_Goto (Table.States (565), 440, 142);
+ Add_Goto (Table.States (565), 454, 143);
+ Add_Goto (Table.States (565), 458, 916);
+ Table.States (565).Kernel := To_Vector ((((192, 0), 458, 0,
(192, 0), 1), ((458, 1), 458, 3, (32767,
+ 0), 0), ((458, 2), 458, 3, (32767, 0), 0)));
+ Table.States (565).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (192, 0), 1)));
+ Table.States (566).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (566), 12, (401, 0), 1);
+ Add_Action (Table.States (566), 15, (370, 0), 3);
+ Add_Action (Table.States (566), 17, (365, 0), 4);
+ Add_Action (Table.States (566), 18, (382, 0), 5);
+ Add_Action (Table.States (566), 19, (363, 0), 6);
+ Add_Action (Table.States (566), 20, (357, 0), 7);
+ Add_Action (Table.States (566), 30, (316, 0), 13);
+ Add_Action (Table.States (566), 31, (290, 0), 14);
+ Add_Action (Table.States (566), 32, (289, 0), 15);
+ Add_Action (Table.States (566), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (566), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (566), 37, (288, 0), 17);
+ Add_Conflict (Table.States (566), 37, (285, 1), 0);
+ Add_Action (Table.States (566), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (566), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (566), 42, (271, 0), 18);
+ Add_Action (Table.States (566), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (566), 64, (273, 0), 27);
+ Add_Action (Table.States (566), 65, (264, 0), 28);
+ Add_Action (Table.States (566), 84, (124, 0), 32);
+ Add_Action (Table.States (566), 86, (252, 0), 33);
+ Add_Action (Table.States (566), 90, (268, 0), 34);
+ Add_Action (Table.States (566), 105, (265, 0), 35);
+ Add_Action (Table.States (566), 116, (196, 0), 146);
+ Add_Action (Table.States (566), 117, (196, 1), 37);
+ Add_Action (Table.States (566), 118, (195, 6), 38);
+ Table.States (566).Goto_List.Set_Capacity (45);
+ Add_Goto (Table.States (566), 124, 39);
+ Add_Goto (Table.States (566), 195, 52);
+ Add_Goto (Table.States (566), 196, 53);
+ Add_Goto (Table.States (566), 197, 54);
+ Add_Goto (Table.States (566), 198, 55);
+ Add_Goto (Table.States (566), 199, 56);
+ Add_Goto (Table.States (566), 201, 57);
+ Add_Goto (Table.States (566), 251, 58);
+ Add_Goto (Table.States (566), 252, 59);
+ Add_Goto (Table.States (566), 255, 60);
+ Add_Goto (Table.States (566), 259, 917);
+ Add_Goto (Table.States (566), 261, 331);
+ Add_Goto (Table.States (566), 262, 62);
+ Add_Goto (Table.States (566), 263, 63);
+ Add_Goto (Table.States (566), 264, 64);
+ Add_Goto (Table.States (566), 265, 65);
+ Add_Goto (Table.States (566), 266, 66);
+ Add_Goto (Table.States (566), 267, 67);
+ Add_Goto (Table.States (566), 268, 68);
+ Add_Goto (Table.States (566), 271, 69);
+ Add_Goto (Table.States (566), 273, 70);
+ Add_Goto (Table.States (566), 275, 71);
+ Add_Goto (Table.States (566), 285, 72);
+ Add_Goto (Table.States (566), 286, 73);
+ Add_Goto (Table.States (566), 288, 74);
+ Add_Goto (Table.States (566), 289, 75);
+ Add_Goto (Table.States (566), 290, 76);
+ Add_Goto (Table.States (566), 310, 82);
+ Add_Goto (Table.States (566), 311, 83);
+ Add_Goto (Table.States (566), 316, 84);
+ Add_Goto (Table.States (566), 318, 85);
+ Add_Goto (Table.States (566), 357, 110);
+ Add_Goto (Table.States (566), 363, 111);
+ Add_Goto (Table.States (566), 364, 112);
+ Add_Goto (Table.States (566), 365, 113);
+ Add_Goto (Table.States (566), 366, 114);
+ Add_Goto (Table.States (566), 367, 115);
+ Add_Goto (Table.States (566), 370, 116);
+ Add_Goto (Table.States (566), 376, 117);
+ Add_Goto (Table.States (566), 378, 118);
+ Add_Goto (Table.States (566), 379, 119);
+ Add_Goto (Table.States (566), 382, 120);
+ Add_Goto (Table.States (566), 401, 133);
+ Add_Goto (Table.States (566), 461, 332);
+ Add_Goto (Table.States (566), 462, 144);
+ Table.States (566).Kernel := To_Vector ((0 => ((275, 0), 36, 5,
(32767, 0), 0)));
+ Table.States (566).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ end Subr_22;
+ procedure Subr_23
+ is begin
+ Table.States (567).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (567), 61, (434, 0), 299);
+ Add_Action (Table.States (567), 85, (198, 0), 281);
+ Add_Action (Table.States (567), 96, (197, 0), 283);
+ Add_Action (Table.States (567), 108, (338, 3), 918);
+ Add_Action (Table.States (567), 113, (121, 0), 285);
+ Add_Action (Table.States (567), 114, (121, 1), 286);
+ Table.States (567).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (567), 121, 287);
+ Add_Goto (Table.States (567), 313, 289);
+ Add_Goto (Table.States (567), 434, 919);
+ Table.States (567).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0), ((338, 2),
195, 3, (32767, 0), 0), ((338, 3),
+ 195, 1, (32767, 0), 0)));
+ Table.States (567).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (338, 3), 108, 918)));
+ Table.States (568).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (568), 63, Reduce, (435, 1), 1);
+ Add_Action (Table.States (568), 82, Reduce, (435, 1), 1);
+ Add_Action (Table.States (568), 95, Reduce, (435, 1), 1);
+ Add_Action (Table.States (568), 99, Reduce, (435, 1), 1);
+ Add_Action (Table.States (568), 108, Reduce, (435, 1), 1);
+ Add_Action (Table.States (568), 113, (121, 0), 285);
+ Add_Action (Table.States (568), 114, (121, 1), 286);
+ Table.States (568).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (568), 121, 920);
+ Table.States (568).Kernel := To_Vector ((((435, 0), 116, 2,
(32767, 0), 0), ((435, 1), 116, 0, (435,
+ 1), 1)));
+ Table.States (568).Minimal_Complete_Actions := To_Vector (((Shift,
(121, 0), 113, 285), (Reduce, (435, 1),
+ 1)));
+ Table.States (569).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (569), (63, 82, 95, 108), (433, 0), 1);
+ Table.States (569).Kernel := To_Vector ((0 => ((433, 0), 432, 0,
(433, 0), 1)));
+ Table.States (569).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (433, 0), 1)));
+ Table.States (570).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (570), 63, Reduce, (434, 0), 2);
+ Add_Action (Table.States (570), 82, Reduce, (434, 0), 2);
+ Add_Action (Table.States (570), 95, (433, 1), 921);
+ Add_Action (Table.States (570), 108, Reduce, (434, 0), 2);
+ Table.States (570).Kernel := To_Vector ((((433, 1), 433, 2,
(32767, 0), 0), ((434, 0), 433, 0, (434,
+ 0), 2)));
+ Table.States (570).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (434, 0), 2)));
+ Table.States (571).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (571), 63, Reduce, (432, 1), 1);
+ Add_Action (Table.States (571), 82, Reduce, (432, 1), 1);
+ Add_Action (Table.States (571), 95, Reduce, (432, 1), 1);
+ Add_Action (Table.States (571), 99, (432, 0), 922);
+ Add_Action (Table.States (571), 108, Reduce, (432, 1), 1);
+ Table.States (571).Kernel := To_Vector ((((432, 0), 435, 2,
(32767, 0), 0), ((432, 1), 435, 0, (432,
+ 1), 1)));
+ Table.States (571).Minimal_Complete_Actions := To_Vector (((Shift,
(432, 0), 99, 922), (Reduce, (432, 1),
+ 1)));
+ Table.States (572).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (572), 61, (434, 0), 299);
+ Add_Action (Table.States (572), 108, (389, 3), 923);
+ Table.States (572).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (572), 434, 924);
+ Table.States (572).Kernel := To_Vector ((((389, 2), 13, 3,
(32767, 0), 0), ((389, 3), 13, 1, (32767,
+ 0), 0)));
+ Table.States (572).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (389, 3), 108, 923)));
+ Table.States (573).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (573), 61, (434, 0), 299);
+ Add_Action (Table.States (573), 108, (180, 3), 925);
+ Table.States (573).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (573), 434, 926);
+ Table.States (573).Kernel := To_Vector ((((180, 2), 78, 3,
(32767, 0), 0), ((180, 3), 78, 1, (32767,
+ 0), 0)));
+ Table.States (573).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (180, 3), 108, 925)));
+ Table.States (574).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (574), 38, (309, 3), 927);
+ Table.States (574).Kernel := To_Vector ((0 => ((309, 3), 192, 5,
(32767, 0), 0)));
+ Table.States (574).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (309, 3), 38, 927)));
+ Table.States (575).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (575), 22, (339, 0), 9);
+ Add_Action (Table.States (575), 25, (329, 1), 10);
+ Add_Action (Table.States (575), 28, (325, 0), 12);
+ Add_Action (Table.States (575), 38, Reduce, (192, 1), 0);
+ Add_Action (Table.States (575), 50, (332, 0), 19);
+ Add_Action (Table.States (575), 51, (437, 0), 221);
+ Add_Action (Table.States (575), 52, (329, 0), 21);
+ Add_Action (Table.States (575), 53, (294, 0), 22);
+ Add_Action (Table.States (575), 54, (293, 0), 23);
+ Add_Action (Table.States (575), 59, (346, 0), 24);
+ Add_Action (Table.States (575), 60, (340, 0), 25);
+ Add_Action (Table.States (575), 81, (130, 0), 30);
+ Add_Action (Table.States (575), 83, (128, 0), 31);
+ Add_Action (Table.States (575), 84, (124, 0), 32);
+ Add_Action (Table.States (575), 116, (136, 0), 223);
+ Table.States (575).Goto_List.Set_Capacity (60);
+ Add_Goto (Table.States (575), 124, 561);
+ Add_Goto (Table.States (575), 126, 40);
+ Add_Goto (Table.States (575), 127, 41);
+ Add_Goto (Table.States (575), 128, 42);
+ Add_Goto (Table.States (575), 130, 43);
+ Add_Goto (Table.States (575), 135, 44);
+ Add_Goto (Table.States (575), 136, 45);
+ Add_Goto (Table.States (575), 137, 46);
+ Add_Goto (Table.States (575), 180, 47);
+ Add_Goto (Table.States (575), 189, 48);
+ Add_Goto (Table.States (575), 190, 562);
+ Add_Goto (Table.States (575), 191, 563);
+ Add_Goto (Table.States (575), 192, 928);
+ Add_Goto (Table.States (575), 193, 50);
+ Add_Goto (Table.States (575), 194, 51);
+ Add_Goto (Table.States (575), 291, 77);
+ Add_Goto (Table.States (575), 292, 78);
+ Add_Goto (Table.States (575), 293, 79);
+ Add_Goto (Table.States (575), 294, 80);
+ Add_Goto (Table.States (575), 309, 81);
+ Add_Goto (Table.States (575), 320, 86);
+ Add_Goto (Table.States (575), 321, 87);
+ Add_Goto (Table.States (575), 322, 88);
+ Add_Goto (Table.States (575), 325, 89);
+ Add_Goto (Table.States (575), 326, 90);
+ Add_Goto (Table.States (575), 327, 91);
+ Add_Goto (Table.States (575), 328, 92);
+ Add_Goto (Table.States (575), 329, 225);
+ Add_Goto (Table.States (575), 330, 94);
+ Add_Goto (Table.States (575), 332, 95);
+ Add_Goto (Table.States (575), 333, 96);
+ Add_Goto (Table.States (575), 334, 97);
+ Add_Goto (Table.States (575), 335, 98);
+ Add_Goto (Table.States (575), 336, 99);
+ Add_Goto (Table.States (575), 337, 100);
+ Add_Goto (Table.States (575), 338, 101);
+ Add_Goto (Table.States (575), 339, 102);
+ Add_Goto (Table.States (575), 340, 103);
+ Add_Goto (Table.States (575), 341, 104);
+ Add_Goto (Table.States (575), 345, 105);
+ Add_Goto (Table.States (575), 346, 106);
+ Add_Goto (Table.States (575), 347, 107);
+ Add_Goto (Table.States (575), 354, 108);
+ Add_Goto (Table.States (575), 388, 126);
+ Add_Goto (Table.States (575), 389, 127);
+ Add_Goto (Table.States (575), 390, 128);
+ Add_Goto (Table.States (575), 391, 129);
+ Add_Goto (Table.States (575), 392, 130);
+ Add_Goto (Table.States (575), 394, 132);
+ Add_Goto (Table.States (575), 403, 134);
+ Add_Goto (Table.States (575), 404, 135);
+ Add_Goto (Table.States (575), 405, 136);
+ Add_Goto (Table.States (575), 406, 137);
+ Add_Goto (Table.States (575), 408, 138);
+ Add_Goto (Table.States (575), 431, 139);
+ Add_Goto (Table.States (575), 437, 140);
+ Add_Goto (Table.States (575), 438, 141);
+ Add_Goto (Table.States (575), 440, 142);
+ Add_Goto (Table.States (575), 454, 143);
+ Add_Goto (Table.States (575), 458, 565);
+ Table.States (575).Kernel := To_Vector ((0 => ((309, 2), 82, 5,
(32767, 0), 0)));
+ Table.States (575).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (192, 1), 0)));
+ Table.States (576).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (576), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (291, 2), 3);
+ Table.States (576).Kernel := To_Vector ((0 => ((291, 2), 108, 0,
(291, 2), 3)));
+ Table.States (576).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (291, 2), 3)));
+ Table.States (577).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (577), 61, (434, 0), 299);
+ Add_Action (Table.States (577), 108, (320, 3), 929);
+ Table.States (577).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (577), 434, 930);
+ Table.States (577).Kernel := To_Vector ((((320, 2), 65, 3,
(32767, 0), 0), ((320, 3), 65, 1, (32767,
+ 0), 0)));
+ Table.States (577).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (320, 3), 108, 929)));
+ Table.States (578).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (578), 61, (434, 0), 299);
+ Add_Action (Table.States (578), 108, (321, 3), 931);
+ Table.States (578).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (578), 434, 932);
+ Table.States (578).Kernel := To_Vector ((((321, 2), 205, 3,
(32767, 0), 0), ((321, 3), 205, 1, (32767,
+ 0), 0)));
+ Table.States (578).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (321, 3), 108, 931)));
+ Table.States (579).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (579), 61, Reduce, (295, 1), 0);
+ Add_Action (Table.States (579), 85, (299, 0), 933);
+ Add_Action (Table.States (579), 108, Reduce, (295, 1), 0);
+ Table.States (579).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (579), 295, 934);
+ Add_Goto (Table.States (579), 299, 426);
+ Table.States (579).Kernel := To_Vector ((((356, 0), 116, 6,
(32767, 0), 0), ((356, 1), 116, 4, (32767,
+ 0), 0), ((356, 2), 116, 3, (32767, 0), 0), ((356, 3), 116,
1, (32767, 0), 0)));
+ Table.States (579).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (295, 1), 0)));
+ Table.States (580).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (580), 30, (296, 0), 476);
+ Add_Action (Table.States (580), 82, (408, 6), 935);
+ Add_Action (Table.States (580), 85, (198, 0), 478);
+ Add_Action (Table.States (580), 96, (197, 0), 283);
+ Add_Action (Table.States (580), 113, (121, 0), 285);
+ Add_Action (Table.States (580), 114, (121, 1), 286);
+ Table.States (580).Goto_List.Set_Capacity (5);
+ Add_Goto (Table.States (580), 121, 287);
+ Add_Goto (Table.States (580), 296, 479);
+ Add_Goto (Table.States (580), 297, 480);
+ Add_Goto (Table.States (580), 299, 481);
+ Add_Goto (Table.States (580), 313, 289);
+ Table.States (580).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((294, 0), 195, 2, (32767, 0), 0), ((311, 0),
195, 3, (32767, 0), 0), ((408, 6),
+ 195, 6, (32767, 0), 0), ((408, 7), 195, 4, (32767, 0), 0)));
+ Table.States (580).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (296, 0), 30, 476)));
+ Table.States (581).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (581), 24, Reduce, (295, 1), 0);
+ Add_Action (Table.States (581), 61, Reduce, (295, 1), 0);
+ Add_Action (Table.States (581), 82, (408, 2), 936);
+ Add_Conflict (Table.States (581), 82, (295, 1), 0);
+ Add_Action (Table.States (581), 85, (198, 0), 478);
+ Add_Action (Table.States (581), 96, (197, 0), 283);
+ Add_Action (Table.States (581), 108, Reduce, (295, 1), 0);
+ Add_Action (Table.States (581), 113, (121, 0), 285);
+ Add_Action (Table.States (581), 114, (121, 1), 286);
+ Table.States (581).Goto_List.Set_Capacity (4);
+ Add_Goto (Table.States (581), 121, 287);
+ Add_Goto (Table.States (581), 295, 483);
+ Add_Goto (Table.States (581), 299, 426);
+ Add_Goto (Table.States (581), 313, 289);
+ Table.States (581).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((293, 0), 195, 0, (295, 1), 0), ((311, 0),
195, 3, (32767, 0), 0), ((408, 2), 195,
+ 6, (32767, 0), 0), ((408, 3), 195, 4, (32767, 0), 0)));
+ Table.States (581).Minimal_Complete_Actions := To_Vector
(((Reduce, (295, 1), 0), (Shift, (408, 2), 82,
+ 936)));
+ Table.States (582).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (582), 86, (252, 0), 33);
+ Add_Action (Table.States (582), 90, (268, 0), 34);
+ Add_Action (Table.States (582), 116, (196, 0), 146);
+ Add_Action (Table.States (582), 117, (196, 1), 37);
+ Add_Action (Table.States (582), 118, (195, 6), 38);
+ Table.States (582).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (582), 195, 937);
+ Add_Goto (Table.States (582), 196, 148);
+ Add_Goto (Table.States (582), 197, 54);
+ Add_Goto (Table.States (582), 198, 55);
+ Add_Goto (Table.States (582), 199, 56);
+ Add_Goto (Table.States (582), 201, 57);
+ Add_Goto (Table.States (582), 251, 58);
+ Add_Goto (Table.States (582), 252, 59);
+ Add_Goto (Table.States (582), 255, 60);
+ Add_Goto (Table.States (582), 268, 68);
+ Add_Goto (Table.States (582), 311, 83);
+ Table.States (582).Kernel := To_Vector ((((338, 0), 24, 4,
(32767, 0), 0), ((338, 1), 24, 2, (32767,
+ 0), 0)));
+ Table.States (582).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (583).Action_List.Set_Capacity (17);
+ Add_Action (Table.States (583), 13, (389, 0), 938);
+ Add_Action (Table.States (583), 22, (339, 0), 9);
+ Add_Action (Table.States (583), 25, (329, 1), 10);
+ Add_Action (Table.States (583), 28, (325, 0), 12);
+ Add_Action (Table.States (583), 38, Reduce, (192, 1), 0);
+ Add_Action (Table.States (583), 50, (332, 0), 19);
+ Add_Action (Table.States (583), 51, (437, 0), 221);
+ Add_Action (Table.States (583), 52, (329, 0), 21);
+ Add_Action (Table.States (583), 53, (294, 0), 22);
+ Add_Action (Table.States (583), 54, (293, 0), 23);
+ Add_Action (Table.States (583), 59, (346, 0), 24);
+ Add_Action (Table.States (583), 60, (340, 0), 25);
+ Add_Action (Table.States (583), 78, (180, 0), 939);
+ Add_Action (Table.States (583), 81, (130, 0), 30);
+ Add_Action (Table.States (583), 83, (128, 0), 31);
+ Add_Action (Table.States (583), 84, (124, 0), 32);
+ Add_Action (Table.States (583), 116, (136, 0), 223);
+ Table.States (583).Goto_List.Set_Capacity (60);
+ Add_Goto (Table.States (583), 124, 561);
+ Add_Goto (Table.States (583), 126, 40);
+ Add_Goto (Table.States (583), 127, 41);
+ Add_Goto (Table.States (583), 128, 42);
+ Add_Goto (Table.States (583), 130, 43);
+ Add_Goto (Table.States (583), 135, 44);
+ Add_Goto (Table.States (583), 136, 45);
+ Add_Goto (Table.States (583), 137, 46);
+ Add_Goto (Table.States (583), 180, 47);
+ Add_Goto (Table.States (583), 189, 48);
+ Add_Goto (Table.States (583), 190, 562);
+ Add_Goto (Table.States (583), 191, 563);
+ Add_Goto (Table.States (583), 192, 940);
+ Add_Goto (Table.States (583), 193, 50);
+ Add_Goto (Table.States (583), 194, 51);
+ Add_Goto (Table.States (583), 291, 77);
+ Add_Goto (Table.States (583), 292, 78);
+ Add_Goto (Table.States (583), 293, 79);
+ Add_Goto (Table.States (583), 294, 80);
+ Add_Goto (Table.States (583), 309, 81);
+ Add_Goto (Table.States (583), 320, 86);
+ Add_Goto (Table.States (583), 321, 87);
+ Add_Goto (Table.States (583), 322, 88);
+ Add_Goto (Table.States (583), 325, 89);
+ Add_Goto (Table.States (583), 326, 90);
+ Add_Goto (Table.States (583), 327, 91);
+ Add_Goto (Table.States (583), 328, 92);
+ Add_Goto (Table.States (583), 329, 225);
+ Add_Goto (Table.States (583), 330, 94);
+ Add_Goto (Table.States (583), 332, 95);
+ Add_Goto (Table.States (583), 333, 96);
+ Add_Goto (Table.States (583), 334, 97);
+ Add_Goto (Table.States (583), 335, 98);
+ Add_Goto (Table.States (583), 336, 99);
+ Add_Goto (Table.States (583), 337, 100);
+ Add_Goto (Table.States (583), 338, 101);
+ Add_Goto (Table.States (583), 339, 102);
+ Add_Goto (Table.States (583), 340, 103);
+ Add_Goto (Table.States (583), 341, 104);
+ Add_Goto (Table.States (583), 345, 105);
+ Add_Goto (Table.States (583), 346, 106);
+ Add_Goto (Table.States (583), 347, 107);
+ Add_Goto (Table.States (583), 354, 108);
+ Add_Goto (Table.States (583), 388, 126);
+ Add_Goto (Table.States (583), 389, 127);
+ Add_Goto (Table.States (583), 390, 128);
+ Add_Goto (Table.States (583), 391, 129);
+ Add_Goto (Table.States (583), 392, 130);
+ Add_Goto (Table.States (583), 394, 132);
+ Add_Goto (Table.States (583), 403, 134);
+ Add_Goto (Table.States (583), 404, 135);
+ Add_Goto (Table.States (583), 405, 136);
+ Add_Goto (Table.States (583), 406, 137);
+ Add_Goto (Table.States (583), 408, 138);
+ Add_Goto (Table.States (583), 431, 139);
+ Add_Goto (Table.States (583), 437, 140);
+ Add_Goto (Table.States (583), 438, 141);
+ Add_Goto (Table.States (583), 440, 142);
+ Add_Goto (Table.States (583), 454, 143);
+ Add_Goto (Table.States (583), 458, 565);
+ Table.States (583).Kernel := To_Vector ((((180, 0), 82, 4,
(32767, 0), 0), ((180, 1), 82, 2, (32767,
+ 0), 0), ((309, 1), 82, 5, (32767, 0), 0), ((389, 0), 82, 4,
(32767, 0), 0), ((389, 1), 82, 2,
+ (32767, 0), 0)));
+ Table.States (583).Minimal_Complete_Actions := To_Vector (((Shift,
(180, 0), 78, 939), (Shift, (389, 0),
+ 13, 938)));
+ Table.States (584).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (584), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (291, 1), 3);
+ Table.States (584).Kernel := To_Vector ((0 => ((291, 1), 108, 0,
(291, 1), 3)));
+ Table.States (584).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (291, 1), 3)));
+ Table.States (585).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (585), 82, (309, 0), 941);
+ Add_Action (Table.States (585), 108, (291, 0), 942);
+ Table.States (585).Kernel := To_Vector ((((291, 0), 434, 1,
(32767, 0), 0), ((309, 0), 434, 6, (32767,
+ 0), 0)));
+ Table.States (585).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (291, 0), 108, 942)));
+ Table.States (586).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (586), 65, (320, 0), 943);
+ Table.States (586).Kernel := To_Vector ((((320, 0), 82, 4,
(32767, 0), 0), ((320, 1), 82, 2, (32767,
+ 0), 0)));
+ Table.States (586).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (320, 0), 65, 943)));
+ Table.States (587).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (587), 85, (205, 4), 171);
+ Add_Action (Table.States (587), 86, (213, 2), 552);
+ Table.States (587).Goto_List.Set_Capacity (10);
+ Add_Goto (Table.States (587), 205, 944);
+ Add_Goto (Table.States (587), 206, 178);
+ Add_Goto (Table.States (587), 210, 179);
+ Add_Goto (Table.States (587), 211, 180);
+ Add_Goto (Table.States (587), 213, 181);
+ Add_Goto (Table.States (587), 214, 182);
+ Add_Goto (Table.States (587), 215, 183);
+ Add_Goto (Table.States (587), 218, 184);
+ Add_Goto (Table.States (587), 219, 185);
+ Add_Goto (Table.States (587), 220, 186);
+ Table.States (587).Kernel := To_Vector ((((321, 0), 82, 5,
(32767, 0), 0), ((321, 1), 82, 3, (32767,
+ 0), 0)));
+ Table.States (587).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (213, 2), 86, 552)));
+ Table.States (588).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (588), 61, (434, 0), 299);
+ Add_Action (Table.States (588), 82, (325, 6), 945);
+ Add_Action (Table.States (588), 85, (198, 0), 281);
+ Add_Action (Table.States (588), 96, (197, 0), 283);
+ Add_Action (Table.States (588), 113, (121, 0), 285);
+ Add_Action (Table.States (588), 114, (121, 1), 286);
+ Table.States (588).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (588), 121, 287);
+ Add_Goto (Table.States (588), 313, 289);
+ Add_Goto (Table.States (588), 434, 443);
+ Table.States (588).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0), ((325, 0),
195, 11, (32767, 0), 0), ((325, 1),
+ 195, 8, (32767, 0), 0), ((325, 2), 195, 7, (32767, 0), 0),
((325, 3), 195, 8, (32767, 0), 0),
+ ((325, 4), 195, 5, (32767, 0), 0), ((325, 5), 195, 4, (32767,
0), 0), ((325, 6), 195, 9, (32767,
+ 0), 0), ((325, 7), 195, 6, (32767, 0), 0), ((325, 8), 195,
5, (32767, 0), 0), ((325, 9), 195, 6,
+ (32767, 0), 0), ((325, 10), 195, 3, (32767, 0), 0), ((325,
11), 195, 2, (32767, 0), 0)));
+ Table.States (588).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (325, 6), 82, 945)));
+ Table.States (589).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (589), 30, (296, 0), 476);
+ Add_Action (Table.States (589), 85, (198, 0), 478);
+ Add_Action (Table.States (589), 96, (197, 0), 283);
+ Add_Action (Table.States (589), 113, (121, 0), 285);
+ Add_Action (Table.States (589), 114, (121, 1), 286);
+ Table.States (589).Goto_List.Set_Capacity (5);
+ Add_Goto (Table.States (589), 121, 287);
+ Add_Goto (Table.States (589), 296, 479);
+ Add_Goto (Table.States (589), 297, 480);
+ Add_Goto (Table.States (589), 299, 481);
+ Add_Goto (Table.States (589), 313, 289);
+ Table.States (589).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((294, 0), 195, 2, (32767, 0), 0), ((311, 0),
195, 3, (32767, 0), 0)));
+ Table.States (589).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (296, 0), 30, 476)));
+ end Subr_23;
+ procedure Subr_24
+ is begin
+ Table.States (590).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (590), 61, Reduce, (295, 1), 0);
+ Add_Action (Table.States (590), 82, Reduce, (295, 1), 0);
+ Add_Action (Table.States (590), 85, (198, 0), 478);
+ Add_Action (Table.States (590), 96, (197, 0), 283);
+ Add_Action (Table.States (590), 108, Reduce, (295, 1), 0);
+ Add_Action (Table.States (590), 113, (121, 0), 285);
+ Add_Action (Table.States (590), 114, (121, 1), 286);
+ Table.States (590).Goto_List.Set_Capacity (4);
+ Add_Goto (Table.States (590), 121, 287);
+ Add_Goto (Table.States (590), 295, 483);
+ Add_Goto (Table.States (590), 299, 426);
+ Add_Goto (Table.States (590), 313, 289);
+ Table.States (590).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((293, 0), 195, 0, (295, 1), 0), ((311, 0),
195, 3, (32767, 0), 0)));
+ Table.States (590).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (295, 1), 0)));
+ Table.States (591).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (591), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (404, 1), 3);
+ Table.States (591).Kernel := To_Vector ((0 => ((404, 1), 108, 0,
(404, 1), 3)));
+ Table.States (591).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (404, 1), 3)));
+ Table.States (592).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (592), 108, (404, 0), 946);
+ Table.States (592).Kernel := To_Vector ((0 => ((404, 0), 434, 1,
(32767, 0), 0)));
+ Table.States (592).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (404, 0), 108, 946)));
+ Table.States (593).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (593), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (405, 0), 3);
+ Table.States (593).Kernel := To_Vector ((0 => ((405, 0), 108, 0,
(405, 0), 3)));
+ Table.States (593).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (405, 0), 3)));
+ Table.States (594).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (594), 108, (401, 1), 947);
+ Table.States (594).Kernel := To_Vector ((0 => ((401, 1), 227, 1,
(32767, 0), 0)));
+ Table.States (594).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (401, 1), 108, 947)));
+ Table.States (595).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (595), 25, (329, 1), 10);
+ Add_Action (Table.States (595), 28, (326, 0), 948);
+ Add_Action (Table.States (595), 52, (329, 0), 21);
+ Add_Action (Table.States (595), 53, (294, 0), 314);
+ Add_Action (Table.States (595), 54, (293, 0), 315);
+ Add_Action (Table.States (595), 59, (354, 0), 949);
+ Add_Action (Table.States (595), 60, (345, 0), 950);
+ Table.States (595).Goto_List.Set_Capacity (9);
+ Add_Goto (Table.States (595), 194, 951);
+ Add_Goto (Table.States (595), 292, 952);
+ Add_Goto (Table.States (595), 293, 317);
+ Add_Goto (Table.States (595), 294, 318);
+ Add_Goto (Table.States (595), 309, 81);
+ Add_Goto (Table.States (595), 326, 90);
+ Add_Goto (Table.States (595), 329, 953);
+ Add_Goto (Table.States (595), 345, 105);
+ Add_Goto (Table.States (595), 354, 108);
+ Table.States (595).Kernel := To_Vector ((0 => ((393, 0), 87, 6,
(32767, 0), 0)));
+ Table.States (595).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (326, 0), 28, 948)));
+ Table.States (596).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (596), (14, 17, 20), (371, 0), 3);
+ Table.States (596).Kernel := To_Vector ((0 => ((371, 0), 99, 0,
(371, 0), 3)));
+ Table.States (596).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (371, 0), 3)));
+ Table.States (597).Action_List.Set_Capacity (33);
+ Add_Action (Table.States (597), (12, 15, 17, 18, 19, 20, 23, 30,
31, 32, 35, 36, 37, 38, 39, 41, 42, 43,
+ 44, 49, 51, 63, 64, 65, 66, 75, 84, 86, 90, 105, 116, 117, 118),
(461, 1), 2);
+ Table.States (597).Kernel := To_Vector ((((461, 0), 261, 0,
(461, 0), 1), ((461, 1), 261, 0, (461, 1),
+ 2)));
+ Table.States (597).Minimal_Complete_Actions := To_Vector
(((Reduce, (461, 0), 1), (Reduce, (461, 1),
+ 2)));
+ Table.States (598).Action_List.Set_Capacity (33);
+ Add_Action (Table.States (598), (12, 15, 17, 18, 19, 20, 23, 30,
31, 32, 35, 36, 37, 38, 39, 41, 42, 43,
+ 44, 49, 51, 63, 64, 65, 66, 75, 84, 86, 90, 105, 116, 117, 118),
(461, 2), 2);
+ Table.States (598).Goto_List.Set_Capacity (44);
+ Add_Goto (Table.States (598), 124, 39);
+ Add_Goto (Table.States (598), 195, 52);
+ Add_Goto (Table.States (598), 196, 53);
+ Add_Goto (Table.States (598), 197, 54);
+ Add_Goto (Table.States (598), 198, 55);
+ Add_Goto (Table.States (598), 199, 56);
+ Add_Goto (Table.States (598), 201, 57);
+ Add_Goto (Table.States (598), 251, 58);
+ Add_Goto (Table.States (598), 252, 59);
+ Add_Goto (Table.States (598), 255, 60);
+ Add_Goto (Table.States (598), 261, 597);
+ Add_Goto (Table.States (598), 262, 62);
+ Add_Goto (Table.States (598), 263, 63);
+ Add_Goto (Table.States (598), 264, 64);
+ Add_Goto (Table.States (598), 265, 65);
+ Add_Goto (Table.States (598), 266, 66);
+ Add_Goto (Table.States (598), 267, 67);
+ Add_Goto (Table.States (598), 268, 68);
+ Add_Goto (Table.States (598), 271, 69);
+ Add_Goto (Table.States (598), 273, 70);
+ Add_Goto (Table.States (598), 275, 71);
+ Add_Goto (Table.States (598), 285, 72);
+ Add_Goto (Table.States (598), 286, 73);
+ Add_Goto (Table.States (598), 288, 74);
+ Add_Goto (Table.States (598), 289, 75);
+ Add_Goto (Table.States (598), 290, 76);
+ Add_Goto (Table.States (598), 310, 82);
+ Add_Goto (Table.States (598), 311, 83);
+ Add_Goto (Table.States (598), 316, 84);
+ Add_Goto (Table.States (598), 318, 85);
+ Add_Goto (Table.States (598), 357, 110);
+ Add_Goto (Table.States (598), 363, 111);
+ Add_Goto (Table.States (598), 364, 112);
+ Add_Goto (Table.States (598), 365, 113);
+ Add_Goto (Table.States (598), 366, 114);
+ Add_Goto (Table.States (598), 367, 115);
+ Add_Goto (Table.States (598), 370, 116);
+ Add_Goto (Table.States (598), 376, 117);
+ Add_Goto (Table.States (598), 378, 118);
+ Add_Goto (Table.States (598), 379, 119);
+ Add_Goto (Table.States (598), 382, 120);
+ Add_Goto (Table.States (598), 401, 133);
+ Add_Goto (Table.States (598), 461, 598);
+ Add_Goto (Table.States (598), 462, 144);
+ Table.States (598).Kernel := To_Vector ((((461, 1), 461, 2,
(32767, 0), 0), ((461, 2), 461, 0, (461,
+ 2), 2), ((461, 2), 461, 2, (32767, 0), 0)));
+ Table.States (598).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (461, 2), 2)));
+ Table.States (599).Action_List.Set_Capacity (33);
+ Add_Action (Table.States (599), 12, (401, 0), 1);
+ Add_Action (Table.States (599), 15, (370, 0), 3);
+ Add_Action (Table.States (599), 17, (365, 0), 4);
+ Add_Action (Table.States (599), 18, (382, 0), 5);
+ Add_Action (Table.States (599), 19, (363, 0), 6);
+ Add_Action (Table.States (599), 20, (357, 0), 7);
+ Add_Action (Table.States (599), 23, Reduce, (259, 0), 2);
+ Add_Action (Table.States (599), 30, (316, 0), 13);
+ Add_Action (Table.States (599), 31, (290, 0), 14);
+ Add_Action (Table.States (599), 32, (289, 0), 15);
+ Add_Action (Table.States (599), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (599), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (599), 37, (288, 0), 17);
+ Add_Conflict (Table.States (599), 37, (285, 1), 0);
+ Add_Action (Table.States (599), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (599), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (599), 41, Reduce, (259, 0), 2);
+ Add_Action (Table.States (599), 42, (271, 0), 18);
+ Add_Action (Table.States (599), 43, Reduce, (259, 0), 2);
+ Add_Action (Table.States (599), 44, Reduce, (259, 0), 2);
+ Add_Action (Table.States (599), 49, Reduce, (259, 0), 2);
+ Add_Action (Table.States (599), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (599), 63, Reduce, (259, 0), 2);
+ Add_Action (Table.States (599), 64, (273, 0), 27);
+ Add_Action (Table.States (599), 65, (264, 0), 28);
+ Add_Action (Table.States (599), 66, Reduce, (259, 0), 2);
+ Add_Action (Table.States (599), 75, Reduce, (259, 0), 2);
+ Add_Action (Table.States (599), 84, (124, 0), 32);
+ Add_Action (Table.States (599), 86, (252, 0), 33);
+ Add_Action (Table.States (599), 90, (268, 0), 34);
+ Add_Action (Table.States (599), 105, (265, 0), 35);
+ Add_Action (Table.States (599), 116, (196, 0), 146);
+ Add_Action (Table.States (599), 117, (196, 1), 37);
+ Add_Action (Table.States (599), 118, (195, 6), 38);
+ Table.States (599).Goto_List.Set_Capacity (42);
+ Add_Goto (Table.States (599), 124, 39);
+ Add_Goto (Table.States (599), 195, 52);
+ Add_Goto (Table.States (599), 196, 53);
+ Add_Goto (Table.States (599), 197, 54);
+ Add_Goto (Table.States (599), 198, 55);
+ Add_Goto (Table.States (599), 199, 56);
+ Add_Goto (Table.States (599), 201, 57);
+ Add_Goto (Table.States (599), 251, 58);
+ Add_Goto (Table.States (599), 252, 59);
+ Add_Goto (Table.States (599), 255, 60);
+ Add_Goto (Table.States (599), 262, 320);
+ Add_Goto (Table.States (599), 263, 321);
+ Add_Goto (Table.States (599), 264, 64);
+ Add_Goto (Table.States (599), 265, 322);
+ Add_Goto (Table.States (599), 266, 66);
+ Add_Goto (Table.States (599), 267, 67);
+ Add_Goto (Table.States (599), 268, 68);
+ Add_Goto (Table.States (599), 271, 69);
+ Add_Goto (Table.States (599), 273, 70);
+ Add_Goto (Table.States (599), 275, 71);
+ Add_Goto (Table.States (599), 285, 72);
+ Add_Goto (Table.States (599), 286, 73);
+ Add_Goto (Table.States (599), 288, 74);
+ Add_Goto (Table.States (599), 289, 75);
+ Add_Goto (Table.States (599), 290, 76);
+ Add_Goto (Table.States (599), 310, 82);
+ Add_Goto (Table.States (599), 311, 83);
+ Add_Goto (Table.States (599), 316, 84);
+ Add_Goto (Table.States (599), 318, 85);
+ Add_Goto (Table.States (599), 357, 110);
+ Add_Goto (Table.States (599), 363, 111);
+ Add_Goto (Table.States (599), 364, 112);
+ Add_Goto (Table.States (599), 365, 113);
+ Add_Goto (Table.States (599), 366, 114);
+ Add_Goto (Table.States (599), 367, 115);
+ Add_Goto (Table.States (599), 370, 116);
+ Add_Goto (Table.States (599), 376, 117);
+ Add_Goto (Table.States (599), 378, 118);
+ Add_Goto (Table.States (599), 379, 119);
+ Add_Goto (Table.States (599), 382, 120);
+ Add_Goto (Table.States (599), 401, 133);
+ Add_Goto (Table.States (599), 462, 323);
+ Table.States (599).Kernel := To_Vector ((((259, 0), 462, 0,
(259, 0), 2), ((261, 0), 462, 2, (32767,
+ 0), 0), ((261, 2), 462, 3, (32767, 0), 0), ((462, 1), 462,
3, (32767, 0), 0), ((462, 2), 462, 3,
+ (32767, 0), 0)));
+ Table.States (599).Minimal_Complete_Actions := To_Vector
(((Reduce, (259, 0), 2), (Shift, (264, 0), 65,
+ 28)));
+ Table.States (600).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (600), 66, (370, 0), 954);
+ Table.States (600).Kernel := To_Vector ((0 => ((370, 0), 259, 3,
(32767, 0), 0)));
+ Table.States (600).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (370, 0), 66, 954)));
+ Table.States (601).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (601), (41, 49, 66), (369, 1), 3);
+ Table.States (601).Kernel := To_Vector ((0 => ((369, 1), 368, 0,
(369, 1), 3)));
+ Table.States (601).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (369, 1), 3)));
+ Table.States (602).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (602), 108, (370, 1), 955);
+ Table.States (602).Kernel := To_Vector ((0 => ((370, 1), 15, 1,
(32767, 0), 0)));
+ Table.States (602).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (370, 1), 108, 955)));
+ Table.States (603).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (603), (41, 49, 66), (374, 0), 2);
+ Table.States (603).Kernel := To_Vector ((0 => ((374, 0), 260, 0,
(374, 0), 2)));
+ Table.States (603).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (374, 0), 2)));
+ Table.States (604).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (604), 66, (378, 0), 956);
+ Table.States (604).Kernel := To_Vector ((0 => ((378, 0), 259, 3,
(32767, 0), 0)));
+ Table.States (604).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (378, 0), 66, 956)));
+ Table.States (605).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (605), 66, (376, 0), 957);
+ Table.States (605).Kernel := To_Vector ((0 => ((376, 0), 374, 3,
(32767, 0), 0)));
+ Table.States (605).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (376, 0), 66, 957)));
+ Table.States (606).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (606), 12, (401, 0), 1);
+ Add_Action (Table.States (606), 15, (370, 0), 3);
+ Add_Action (Table.States (606), 17, (365, 0), 4);
+ Add_Action (Table.States (606), 18, (382, 0), 5);
+ Add_Action (Table.States (606), 19, (363, 0), 6);
+ Add_Action (Table.States (606), 20, (357, 0), 7);
+ Add_Action (Table.States (606), 30, (316, 0), 13);
+ Add_Action (Table.States (606), 31, (290, 0), 14);
+ Add_Action (Table.States (606), 32, (289, 0), 15);
+ Add_Action (Table.States (606), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (606), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (606), 37, (288, 0), 17);
+ Add_Conflict (Table.States (606), 37, (285, 1), 0);
+ Add_Action (Table.States (606), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (606), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (606), 42, (271, 0), 18);
+ Add_Action (Table.States (606), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (606), 64, (273, 0), 27);
+ Add_Action (Table.States (606), 65, (264, 0), 28);
+ Add_Action (Table.States (606), 84, (124, 0), 32);
+ Add_Action (Table.States (606), 86, (252, 0), 33);
+ Add_Action (Table.States (606), 90, (268, 0), 34);
+ Add_Action (Table.States (606), 105, (265, 0), 35);
+ Add_Action (Table.States (606), 116, (196, 0), 146);
+ Add_Action (Table.States (606), 117, (196, 1), 37);
+ Add_Action (Table.States (606), 118, (195, 6), 38);
+ Table.States (606).Goto_List.Set_Capacity (46);
+ Add_Goto (Table.States (606), 124, 39);
+ Add_Goto (Table.States (606), 195, 52);
+ Add_Goto (Table.States (606), 196, 53);
+ Add_Goto (Table.States (606), 197, 54);
+ Add_Goto (Table.States (606), 198, 55);
+ Add_Goto (Table.States (606), 199, 56);
+ Add_Goto (Table.States (606), 201, 57);
+ Add_Goto (Table.States (606), 251, 58);
+ Add_Goto (Table.States (606), 252, 59);
+ Add_Goto (Table.States (606), 255, 60);
+ Add_Goto (Table.States (606), 259, 958);
+ Add_Goto (Table.States (606), 261, 331);
+ Add_Goto (Table.States (606), 262, 62);
+ Add_Goto (Table.States (606), 263, 63);
+ Add_Goto (Table.States (606), 264, 64);
+ Add_Goto (Table.States (606), 265, 65);
+ Add_Goto (Table.States (606), 266, 66);
+ Add_Goto (Table.States (606), 267, 67);
+ Add_Goto (Table.States (606), 268, 68);
+ Add_Goto (Table.States (606), 271, 69);
+ Add_Goto (Table.States (606), 273, 70);
+ Add_Goto (Table.States (606), 275, 71);
+ Add_Goto (Table.States (606), 285, 72);
+ Add_Goto (Table.States (606), 286, 73);
+ Add_Goto (Table.States (606), 288, 74);
+ Add_Goto (Table.States (606), 289, 75);
+ Add_Goto (Table.States (606), 290, 76);
+ Add_Goto (Table.States (606), 310, 82);
+ Add_Goto (Table.States (606), 311, 83);
+ Add_Goto (Table.States (606), 316, 84);
+ Add_Goto (Table.States (606), 318, 85);
+ Add_Goto (Table.States (606), 357, 110);
+ Add_Goto (Table.States (606), 363, 111);
+ Add_Goto (Table.States (606), 364, 112);
+ Add_Goto (Table.States (606), 365, 113);
+ Add_Goto (Table.States (606), 366, 114);
+ Add_Goto (Table.States (606), 367, 115);
+ Add_Goto (Table.States (606), 370, 116);
+ Add_Goto (Table.States (606), 376, 117);
+ Add_Goto (Table.States (606), 378, 118);
+ Add_Goto (Table.States (606), 379, 119);
+ Add_Goto (Table.States (606), 381, 959);
+ Add_Goto (Table.States (606), 382, 120);
+ Add_Goto (Table.States (606), 401, 133);
+ Add_Goto (Table.States (606), 461, 332);
+ Add_Goto (Table.States (606), 462, 144);
+ Table.States (606).Kernel := To_Vector ((0 => ((379, 0), 18, 5,
(32767, 0), 0)));
+ Table.States (606).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ Table.States (607).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (607), 46, (233, 2), 167);
+ Add_Action (Table.States (607), 52, (233, 3), 168);
+ Add_Action (Table.States (607), 65, (234, 1), 169);
+ Add_Action (Table.States (607), 76, (256, 0), 170);
+ Add_Action (Table.States (607), 85, (205, 4), 171);
+ Add_Action (Table.States (607), 86, (213, 2), 172);
+ Add_Action (Table.States (607), 90, (268, 0), 34);
+ Add_Action (Table.States (607), 106, (237, 1), 173);
+ Add_Action (Table.States (607), 107, (237, 0), 174);
+ Add_Action (Table.States (607), 115, (234, 0), 175);
+ Add_Action (Table.States (607), 116, (196, 0), 146);
+ Add_Action (Table.States (607), 117, (196, 1), 37);
+ Add_Action (Table.States (607), 118, (195, 6), 38);
+ Table.States (607).Goto_List.Set_Capacity (28);
+ Add_Goto (Table.States (607), 195, 176);
+ Add_Goto (Table.States (607), 196, 148);
+ Add_Goto (Table.States (607), 197, 54);
+ Add_Goto (Table.States (607), 198, 55);
+ Add_Goto (Table.States (607), 199, 56);
+ Add_Goto (Table.States (607), 201, 57);
+ Add_Goto (Table.States (607), 205, 177);
+ Add_Goto (Table.States (607), 206, 178);
+ Add_Goto (Table.States (607), 210, 179);
+ Add_Goto (Table.States (607), 211, 180);
+ Add_Goto (Table.States (607), 213, 181);
+ Add_Goto (Table.States (607), 214, 182);
+ Add_Goto (Table.States (607), 215, 183);
+ Add_Goto (Table.States (607), 218, 184);
+ Add_Goto (Table.States (607), 219, 185);
+ Add_Goto (Table.States (607), 220, 186);
+ Add_Goto (Table.States (607), 231, 960);
+ Add_Goto (Table.States (607), 232, 190);
+ Add_Goto (Table.States (607), 233, 191);
+ Add_Goto (Table.States (607), 234, 192);
+ Add_Goto (Table.States (607), 237, 193);
+ Add_Goto (Table.States (607), 251, 58);
+ Add_Goto (Table.States (607), 252, 59);
+ Add_Goto (Table.States (607), 255, 60);
+ Add_Goto (Table.States (607), 256, 194);
+ Add_Goto (Table.States (607), 268, 68);
+ Add_Goto (Table.States (607), 311, 83);
+ Add_Goto (Table.States (607), 465, 196);
+ Table.States (607).Kernel := To_Vector ((0 => ((402, 0), 61, 1,
(32767, 0), 0)));
+ Table.States (607).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (608).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (608), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (365, 0), 4);
+ Table.States (608).Kernel := To_Vector ((0 => ((365, 0), 108, 0,
(365, 0), 4)));
+ Table.States (608).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (365, 0), 4)));
+ Table.States (609).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (609), (56, 86, 90, 116, 117, 118), (187,
0), 2);
+ Table.States (609).Kernel := To_Vector ((0 => ((187, 0), 65, 0,
(187, 0), 2)));
+ Table.States (609).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (187, 0), 2)));
+ Table.States (610).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (610), 85, (198, 0), 281);
+ Add_Action (Table.States (610), 87, (258, 0), 961);
+ Add_Action (Table.States (610), 96, (197, 0), 283);
+ Add_Action (Table.States (610), 113, (121, 0), 285);
+ Add_Action (Table.States (610), 114, (121, 1), 286);
+ Table.States (610).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (610), 121, 287);
+ Add_Goto (Table.States (610), 313, 289);
+ Table.States (610).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((258, 0), 195, 1, (32767, 0), 0), ((311, 0),
195, 3, (32767, 0), 0)));
+ Table.States (610).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (258, 0), 87, 961)));
+ Table.States (611).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (611), 33, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 36, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 41, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 43, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 44, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 45, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 47, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 48, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 49, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 50, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 52, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 61, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 63, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 69, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 72, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 73, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 74, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 75, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 82, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 85, (162, 0), 612);
+ Add_Action (Table.States (611), 87, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 88, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 89, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 91, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 94, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 95, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 96, (197, 0), 283);
+ Add_Action (Table.States (611), 97, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 98, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 99, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 100, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 101, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 103, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 104, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 106, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 107, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 108, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 109, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 110, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 111, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 112, Reduce, (257, 0), 2);
+ Add_Action (Table.States (611), 113, (121, 0), 285);
+ Add_Action (Table.States (611), 114, (121, 1), 286);
+ Table.States (611).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (611), 121, 287);
+ Add_Goto (Table.States (611), 162, 962);
+ Add_Goto (Table.States (611), 313, 289);
+ Table.States (611).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((257, 0), 195, 0, (257, 0), 2), ((257, 2),
195, 5, (32767, 0), 0), ((311, 0), 195,
+ 3, (32767, 0), 0)));
+ Table.States (611).Minimal_Complete_Actions := To_Vector
(((Reduce, (257, 0), 2), (Shift, (162, 0), 85,
+ 612)));
+ end Subr_24;
+ procedure Subr_25
+ is begin
+ Table.States (612).Action_List.Set_Capacity (20);
+ Add_Action (Table.States (612), 12, (402, 0), 165);
+ Add_Action (Table.States (612), 39, (249, 0), 353);
+ Add_Action (Table.States (612), 42, (242, 0), 354);
+ Add_Action (Table.States (612), 46, (233, 2), 167);
+ Add_Action (Table.States (612), 51, (247, 0), 530);
+ Add_Action (Table.States (612), 52, (187, 0), 356);
+ Add_Action (Table.States (612), 62, (200, 2), 531);
+ Add_Action (Table.States (612), 64, (245, 0), 358);
+ Add_Action (Table.States (612), 65, (234, 1), 169);
+ Add_Action (Table.States (612), 76, (256, 0), 170);
+ Add_Action (Table.States (612), 85, (205, 4), 171);
+ Add_Action (Table.States (612), 86, (213, 2), 172);
+ Add_Action (Table.States (612), 90, (268, 0), 34);
+ Add_Action (Table.States (612), 92, (315, 2), 532);
+ Add_Action (Table.States (612), 106, (237, 1), 173);
+ Add_Action (Table.States (612), 107, (237, 0), 174);
+ Add_Action (Table.States (612), 115, (234, 0), 175);
+ Add_Action (Table.States (612), 116, (196, 0), 146);
+ Add_Action (Table.States (612), 117, (196, 1), 37);
+ Add_Action (Table.States (612), 118, (195, 6), 360);
+ Table.States (612).Goto_List.Set_Capacity (45);
+ Add_Goto (Table.States (612), 131, 533);
+ Add_Goto (Table.States (612), 140, 534);
+ Add_Goto (Table.States (612), 163, 963);
+ Add_Goto (Table.States (612), 187, 365);
+ Add_Goto (Table.States (612), 195, 366);
+ Add_Goto (Table.States (612), 196, 367);
+ Add_Goto (Table.States (612), 197, 54);
+ Add_Goto (Table.States (612), 198, 55);
+ Add_Goto (Table.States (612), 199, 56);
+ Add_Goto (Table.States (612), 200, 368);
+ Add_Goto (Table.States (612), 201, 57);
+ Add_Goto (Table.States (612), 203, 369);
+ Add_Goto (Table.States (612), 205, 177);
+ Add_Goto (Table.States (612), 206, 178);
+ Add_Goto (Table.States (612), 209, 536);
+ Add_Goto (Table.States (612), 210, 179);
+ Add_Goto (Table.States (612), 211, 180);
+ Add_Goto (Table.States (612), 213, 181);
+ Add_Goto (Table.States (612), 214, 182);
+ Add_Goto (Table.States (612), 215, 183);
+ Add_Goto (Table.States (612), 218, 184);
+ Add_Goto (Table.States (612), 219, 185);
+ Add_Goto (Table.States (612), 220, 186);
+ Add_Goto (Table.States (612), 227, 537);
+ Add_Goto (Table.States (612), 228, 188);
+ Add_Goto (Table.States (612), 231, 378);
+ Add_Goto (Table.States (612), 232, 190);
+ Add_Goto (Table.States (612), 233, 191);
+ Add_Goto (Table.States (612), 234, 192);
+ Add_Goto (Table.States (612), 237, 193);
+ Add_Goto (Table.States (612), 239, 538);
+ Add_Goto (Table.States (612), 242, 380);
+ Add_Goto (Table.States (612), 245, 381);
+ Add_Goto (Table.States (612), 247, 539);
+ Add_Goto (Table.States (612), 249, 540);
+ Add_Goto (Table.States (612), 251, 58);
+ Add_Goto (Table.States (612), 252, 59);
+ Add_Goto (Table.States (612), 255, 60);
+ Add_Goto (Table.States (612), 256, 194);
+ Add_Goto (Table.States (612), 268, 68);
+ Add_Goto (Table.States (612), 311, 83);
+ Add_Goto (Table.States (612), 312, 541);
+ Add_Goto (Table.States (612), 315, 542);
+ Add_Goto (Table.States (612), 402, 195);
+ Add_Goto (Table.States (612), 465, 196);
+ Table.States (612).Kernel := To_Vector ((((162, 0), 85, 4,
(32767, 0), 0), ((198, 0), 85, 2, (32767,
+ 0), 0), ((313, 0), 85, 2, (32767, 0), 0), ((313, 1), 85, 5,
(32767, 0), 0), ((313, 2), 85, 8,
+ (32767, 0), 0), ((313, 3), 85, 4, (32767, 0), 0)));
+ Table.States (612).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (613).Action_List.Set_Capacity (39);
+ Add_Action (Table.States (613), (33, 36, 41, 43, 44, 45, 47, 48,
49, 50, 52, 61, 63, 69, 72, 73, 74, 75,
+ 82, 87, 88, 89, 91, 94, 95, 97, 98, 99, 100, 101, 103, 104, 106,
107, 108, 109, 110, 111, 112), (257, 3),
+ 2);
+ Table.States (613).Kernel := To_Vector ((0 => ((257, 3), 162, 0,
(257, 3), 2)));
+ Table.States (613).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (257, 3), 2)));
+ Table.States (614).Action_List.Set_Capacity (39);
+ Add_Action (Table.States (614), (33, 36, 41, 43, 44, 45, 47, 48,
49, 50, 52, 61, 63, 69, 72, 73, 74, 75,
+ 82, 87, 88, 89, 91, 94, 95, 97, 98, 99, 100, 101, 103, 104, 106,
107, 108, 109, 110, 111, 112), (256, 0),
+ 3);
+ Table.States (614).Kernel := To_Vector ((0 => ((256, 0), 257, 0,
(256, 0), 3)));
+ Table.States (614).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (256, 0), 3)));
+ Table.States (615).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (615), 12, (402, 0), 165);
+ Add_Action (Table.States (615), 46, (233, 2), 167);
+ Add_Action (Table.States (615), 52, (233, 3), 168);
+ Add_Action (Table.States (615), 65, (234, 1), 169);
+ Add_Action (Table.States (615), 76, (256, 0), 170);
+ Add_Action (Table.States (615), 85, (205, 4), 171);
+ Add_Action (Table.States (615), 86, (213, 2), 172);
+ Add_Action (Table.States (615), 90, (268, 0), 34);
+ Add_Action (Table.States (615), 106, (237, 1), 173);
+ Add_Action (Table.States (615), 107, (237, 0), 174);
+ Add_Action (Table.States (615), 115, (234, 0), 175);
+ Add_Action (Table.States (615), 116, (196, 0), 146);
+ Add_Action (Table.States (615), 117, (196, 1), 37);
+ Add_Action (Table.States (615), 118, (195, 6), 38);
+ Table.States (615).Goto_List.Set_Capacity (31);
+ Add_Goto (Table.States (615), 195, 176);
+ Add_Goto (Table.States (615), 196, 148);
+ Add_Goto (Table.States (615), 197, 54);
+ Add_Goto (Table.States (615), 198, 55);
+ Add_Goto (Table.States (615), 199, 56);
+ Add_Goto (Table.States (615), 201, 57);
+ Add_Goto (Table.States (615), 205, 177);
+ Add_Goto (Table.States (615), 206, 178);
+ Add_Goto (Table.States (615), 210, 179);
+ Add_Goto (Table.States (615), 211, 180);
+ Add_Goto (Table.States (615), 213, 181);
+ Add_Goto (Table.States (615), 214, 182);
+ Add_Goto (Table.States (615), 215, 183);
+ Add_Goto (Table.States (615), 218, 184);
+ Add_Goto (Table.States (615), 219, 185);
+ Add_Goto (Table.States (615), 220, 186);
+ Add_Goto (Table.States (615), 227, 964);
+ Add_Goto (Table.States (615), 228, 188);
+ Add_Goto (Table.States (615), 231, 189);
+ Add_Goto (Table.States (615), 232, 190);
+ Add_Goto (Table.States (615), 233, 191);
+ Add_Goto (Table.States (615), 234, 192);
+ Add_Goto (Table.States (615), 237, 193);
+ Add_Goto (Table.States (615), 251, 58);
+ Add_Goto (Table.States (615), 252, 59);
+ Add_Goto (Table.States (615), 255, 60);
+ Add_Goto (Table.States (615), 256, 194);
+ Add_Goto (Table.States (615), 268, 68);
+ Add_Goto (Table.States (615), 311, 83);
+ Add_Goto (Table.States (615), 402, 195);
+ Add_Goto (Table.States (615), 465, 196);
+ Table.States (615).Kernel := To_Vector ((0 => ((249, 1), 38, 1,
(32767, 0), 0)));
+ Table.States (615).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (616).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (616), 116, (347, 0), 260);
+ Table.States (616).Kernel := To_Vector ((((347, 0), 59, 9,
(32767, 0), 0), ((347, 1), 59, 6, (32767,
+ 0), 0), ((347, 2), 59, 7, (32767, 0), 0), ((347, 3), 59, 4,
(32767, 0), 0)));
+ Table.States (616).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (347, 0), 116, 260)));
+ Table.States (617).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (617), 116, (341, 0), 263);
+ Table.States (617).Kernel := To_Vector ((((341, 0), 60, 12,
(32767, 0), 0), ((341, 1), 60, 9, (32767,
+ 0), 0), ((341, 2), 60, 4, (32767, 0), 0), ((341, 3), 60, 10,
(32767, 0), 0), ((341, 4), 60, 7,
+ (32767, 0), 0), ((341, 5), 60, 2, (32767, 0), 0)));
+ Table.States (617).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (341, 0), 116, 263)));
+ Table.States (618).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (618), 24, (335, 4), 277);
+ Add_Action (Table.States (618), 93, (335, 0), 965);
+ Add_Conflict (Table.States (618), 93, (136, 0), 1);
+ Add_Action (Table.States (618), 95, Reduce, (136, 0), 1);
+ Table.States (618).Kernel := To_Vector ((((136, 0), 116, 0,
(136, 0), 1), ((335, 0), 116, 9, (32767,
+ 0), 0), ((335, 1), 116, 7, (32767, 0), 0), ((335, 2), 116,
7, (32767, 0), 0), ((335, 3), 116, 5,
+ (32767, 0), 0), ((335, 4), 116, 5, (32767, 0), 0), ((335, 5),
116, 3, (32767, 0), 0), ((335, 6),
+ 116, 8, (32767, 0), 0), ((335, 7), 116, 6, (32767, 0), 0)));
+ Table.States (618).Minimal_Complete_Actions := To_Vector
(((Reduce, (136, 0), 1), (Shift, (335, 4), 24,
+ 277)));
+ Table.States (619).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (619), (38, 59, 60, 116), (250, 0), 1);
+ Table.States (619).Kernel := To_Vector ((0 => ((250, 0), 135, 0,
(250, 0), 1)));
+ Table.States (619).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (250, 0), 1)));
+ Table.States (620).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (620), 93, (135, 0), 966);
+ Add_Action (Table.States (620), 95, (136, 1), 280);
+ Table.States (620).Kernel := To_Vector ((((135, 0), 136, 9,
(32767, 0), 0), ((135, 1), 136, 7, (32767,
+ 0), 0), ((135, 2), 136, 7, (32767, 0), 0), ((135, 3), 136,
5, (32767, 0), 0), ((135, 4), 136, 8,
+ (32767, 0), 0), ((135, 5), 136, 6, (32767, 0), 0), ((135, 6),
136, 6, (32767, 0), 0), ((135, 7),
+ 136, 4, (32767, 0), 0), ((135, 8), 136, 8, (32767, 0), 0),
((135, 9), 136, 6, (32767, 0), 0),
+ ((135, 10), 136, 6, (32767, 0), 0), ((135, 11), 136, 4,
(32767, 0), 0), ((135, 12), 136, 7, (32767,
+ 0), 0), ((135, 13), 136, 5, (32767, 0), 0), ((135, 14), 136,
5, (32767, 0), 0), ((135, 15), 136,
+ 3, (32767, 0), 0), ((135, 16), 136, 10, (32767, 0), 0), ((135,
17), 136, 8, (32767, 0), 0), ((135,
+ 18), 136, 8, (32767, 0), 0), ((135, 19), 136, 6, (32767, 0),
0), ((135, 20), 136, 9, (32767, 0),
+ 0), ((135, 21), 136, 7, (32767, 0), 0), ((135, 22), 136, 7,
(32767, 0), 0), ((135, 23), 136, 5,
+ (32767, 0), 0), ((135, 24), 136, 9, (32767, 0), 0), ((135,
25), 136, 7, (32767, 0), 0), ((135, 26),
+ 136, 7, (32767, 0), 0), ((135, 27), 136, 5, (32767, 0), 0),
((135, 28), 136, 8, (32767, 0), 0),
+ ((135, 29), 136, 6, (32767, 0), 0), ((135, 30), 136, 6,
(32767, 0), 0), ((135, 31), 136, 4, (32767,
+ 0), 0), ((135, 32), 136, 15, (32767, 0), 0), ((135, 33), 136,
13, (32767, 0), 0), ((135, 34), 136,
+ 13, (32767, 0), 0), ((135, 35), 136, 11, (32767, 0), 0),
((135, 36), 136, 14, (32767, 0), 0), ((135,
+ 37), 136, 12, (32767, 0), 0), ((135, 38), 136, 12, (32767,
0), 0), ((135, 39), 136, 10, (32767, 0),
+ 0), ((135, 40), 136, 14, (32767, 0), 0), ((135, 41), 136,
12, (32767, 0), 0), ((135, 42), 136, 12,
+ (32767, 0), 0), ((135, 43), 136, 10, (32767, 0), 0), ((135,
44), 136, 13, (32767, 0), 0), ((135,
+ 45), 136, 11, (32767, 0), 0), ((135, 46), 136, 11, (32767,
0), 0), ((135, 47), 136, 9, (32767, 0),
+ 0), ((136, 1), 136, 2, (32767, 0), 0)));
+ Table.States (620).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 0), 93, 966)));
+ Table.States (621).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (621), (38, 59, 60, 116), (460, 0), 1);
+ Table.States (621).Kernel := To_Vector ((0 => ((460, 0), 250, 0,
(460, 0), 1)));
+ Table.States (621).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (460, 0), 1)));
+ Table.States (622).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (622), (38, 59, 60, 116), (250, 1), 1);
+ Table.States (622).Kernel := To_Vector ((0 => ((250, 1), 335, 0,
(250, 1), 1)));
+ Table.States (622).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (250, 1), 1)));
+ Table.States (623).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (623), 38, (249, 0), 967);
+ Add_Action (Table.States (623), 59, (347, 0), 616);
+ Add_Action (Table.States (623), 60, (341, 0), 617);
+ Add_Action (Table.States (623), 116, (136, 0), 618);
+ Table.States (623).Goto_List.Set_Capacity (7);
+ Add_Goto (Table.States (623), 135, 619);
+ Add_Goto (Table.States (623), 136, 620);
+ Add_Goto (Table.States (623), 250, 968);
+ Add_Goto (Table.States (623), 335, 622);
+ Add_Goto (Table.States (623), 341, 104);
+ Add_Goto (Table.States (623), 347, 107);
+ Add_Goto (Table.States (623), 460, 969);
+ Table.States (623).Kernel := To_Vector ((((249, 0), 460, 2,
(32767, 0), 0), ((460, 1), 460, 3, (32767,
+ 0), 0), ((460, 2), 460, 3, (32767, 0), 0)));
+ Table.States (623).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (249, 0), 38, 967)));
+ Table.States (624).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (624), 43, (242, 0), 970);
+ Table.States (624).Kernel := To_Vector ((((242, 0), 243, 8,
(32767, 0), 0), ((242, 1), 243, 6, (32767,
+ 0), 0), ((242, 2), 243, 4, (32767, 0), 0), ((242, 3), 243,
2, (32767, 0), 0)));
+ Table.States (624).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 0), 43, 970)));
+ Table.States (625).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (625), (1 => 116), (248, 1), 1);
+ Table.States (625).Kernel := To_Vector ((0 => ((248, 1), 40, 0,
(248, 1), 1)));
+ Table.States (625).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (248, 1), 1)));
+ Table.States (626).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (626), (1 => 116), (248, 0), 1);
+ Table.States (626).Kernel := To_Vector ((0 => ((248, 0), 55, 0,
(248, 0), 1)));
+ Table.States (626).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (248, 0), 1)));
+ Table.States (627).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (627), 116, (278, 0), 454);
+ Table.States (627).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (627), 278, 971);
+ Add_Goto (Table.States (627), 280, 972);
+ Table.States (627).Kernel := To_Vector ((((247, 0), 248, 5,
(32767, 0), 0), ((247, 1), 248, 5, (32767,
+ 0), 0)));
+ Table.States (627).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (278, 0), 116, 454)));
+ Table.States (628).Action_List.Set_Capacity (30);
+ Add_Action (Table.States (628), 45, Reduce, (234, 1), 1);
+ Add_Action (Table.States (628), 47, Reduce, (234, 1), 1);
+ Add_Action (Table.States (628), 48, Reduce, (234, 1), 1);
+ Add_Action (Table.States (628), 49, Reduce, (234, 1), 1);
+ Add_Action (Table.States (628), 52, Reduce, (234, 1), 1);
+ Add_Action (Table.States (628), 61, Reduce, (234, 1), 1);
+ Add_Action (Table.States (628), 73, Reduce, (234, 1), 1);
+ Add_Action (Table.States (628), 75, Reduce, (234, 1), 1);
+ Add_Action (Table.States (628), 86, Reduce, (187, 0), 2);
+ Add_Action (Table.States (628), 87, Reduce, (234, 1), 1);
+ Add_Action (Table.States (628), 88, Reduce, (234, 1), 1);
+ Add_Action (Table.States (628), 89, Reduce, (234, 1), 1);
+ Add_Action (Table.States (628), 90, Reduce, (187, 0), 2);
+ Add_Action (Table.States (628), 91, Reduce, (234, 1), 1);
+ Add_Action (Table.States (628), 95, Reduce, (234, 1), 1);
+ Add_Action (Table.States (628), 97, Reduce, (234, 1), 1);
+ Add_Action (Table.States (628), 98, Reduce, (234, 1), 1);
+ Add_Action (Table.States (628), 99, Reduce, (234, 1), 1);
+ Add_Action (Table.States (628), 100, Reduce, (234, 1), 1);
+ Add_Action (Table.States (628), 101, Reduce, (234, 1), 1);
+ Add_Action (Table.States (628), 103, Reduce, (234, 1), 1);
+ Add_Action (Table.States (628), 104, Reduce, (234, 1), 1);
+ Add_Action (Table.States (628), 106, Reduce, (234, 1), 1);
+ Add_Action (Table.States (628), 107, Reduce, (234, 1), 1);
+ Add_Action (Table.States (628), 109, Reduce, (234, 1), 1);
+ Add_Action (Table.States (628), 110, Reduce, (234, 1), 1);
+ Add_Action (Table.States (628), 111, Reduce, (234, 1), 1);
+ Add_Action (Table.States (628), 116, Reduce, (187, 0), 2);
+ Add_Action (Table.States (628), 117, Reduce, (187, 0), 2);
+ Add_Action (Table.States (628), 118, Reduce, (187, 0), 2);
+ Table.States (628).Kernel := To_Vector ((((187, 0), 65, 0, (187,
0), 2), ((234, 1), 65, 0, (234, 1),
+ 1)));
+ Table.States (628).Minimal_Complete_Actions := To_Vector
(((Reduce, (187, 0), 2), (Reduce, (234, 1),
+ 1)));
+ Table.States (629).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (629), 82, (245, 0), 973);
+ Table.States (629).Kernel := To_Vector ((0 => ((245, 0), 227, 5,
(32767, 0), 0)));
+ Table.States (629).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (245, 0), 82, 973)));
+ Table.States (630).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (630), (1 => 87), (207, 1), 2);
+ Table.States (630).Kernel := To_Vector ((0 => ((207, 1), 67, 0,
(207, 1), 2)));
+ Table.States (630).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (207, 1), 2)));
+ Table.States (631).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (631), 12, (402, 0), 165);
+ Add_Action (Table.States (631), 46, (233, 2), 167);
+ Add_Action (Table.States (631), 52, (187, 0), 356);
+ Add_Action (Table.States (631), 62, (178, 3), 385);
+ Add_Action (Table.States (631), 65, (234, 1), 169);
+ Add_Action (Table.States (631), 76, (256, 0), 170);
+ Add_Action (Table.States (631), 85, (205, 4), 171);
+ Add_Action (Table.States (631), 86, (213, 2), 172);
+ Add_Action (Table.States (631), 90, (268, 0), 34);
+ Add_Action (Table.States (631), 106, (237, 1), 173);
+ Add_Action (Table.States (631), 107, (237, 0), 174);
+ Add_Action (Table.States (631), 115, (234, 0), 175);
+ Add_Action (Table.States (631), 116, (196, 0), 146);
+ Add_Action (Table.States (631), 117, (196, 1), 37);
+ Add_Action (Table.States (631), 118, (195, 6), 38);
+ Table.States (631).Goto_List.Set_Capacity (36);
+ Add_Goto (Table.States (631), 131, 361);
+ Add_Goto (Table.States (631), 140, 362);
+ Add_Goto (Table.States (631), 178, 974);
+ Add_Goto (Table.States (631), 187, 365);
+ Add_Goto (Table.States (631), 195, 366);
+ Add_Goto (Table.States (631), 196, 148);
+ Add_Goto (Table.States (631), 197, 54);
+ Add_Goto (Table.States (631), 198, 55);
+ Add_Goto (Table.States (631), 199, 56);
+ Add_Goto (Table.States (631), 201, 57);
+ Add_Goto (Table.States (631), 203, 369);
+ Add_Goto (Table.States (631), 205, 177);
+ Add_Goto (Table.States (631), 206, 178);
+ Add_Goto (Table.States (631), 210, 179);
+ Add_Goto (Table.States (631), 211, 180);
+ Add_Goto (Table.States (631), 213, 181);
+ Add_Goto (Table.States (631), 214, 182);
+ Add_Goto (Table.States (631), 215, 183);
+ Add_Goto (Table.States (631), 218, 184);
+ Add_Goto (Table.States (631), 219, 185);
+ Add_Goto (Table.States (631), 220, 186);
+ Add_Goto (Table.States (631), 227, 975);
+ Add_Goto (Table.States (631), 228, 188);
+ Add_Goto (Table.States (631), 231, 378);
+ Add_Goto (Table.States (631), 232, 190);
+ Add_Goto (Table.States (631), 233, 191);
+ Add_Goto (Table.States (631), 234, 192);
+ Add_Goto (Table.States (631), 237, 193);
+ Add_Goto (Table.States (631), 251, 58);
+ Add_Goto (Table.States (631), 252, 59);
+ Add_Goto (Table.States (631), 255, 60);
+ Add_Goto (Table.States (631), 256, 194);
+ Add_Goto (Table.States (631), 268, 68);
+ Add_Goto (Table.States (631), 311, 83);
+ Add_Goto (Table.States (631), 402, 195);
+ Add_Goto (Table.States (631), 465, 196);
+ Table.States (631).Kernel := To_Vector ((0 => ((177, 1), 91, 1,
(32767, 0), 0)));
+ Table.States (631).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (632).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (632), 12, (402, 0), 165);
+ Add_Action (Table.States (632), 46, (233, 2), 167);
+ Add_Action (Table.States (632), 52, (233, 3), 168);
+ Add_Action (Table.States (632), 65, (234, 1), 169);
+ Add_Action (Table.States (632), 76, (256, 0), 170);
+ Add_Action (Table.States (632), 85, (205, 4), 171);
+ Add_Action (Table.States (632), 86, (213, 2), 172);
+ Add_Action (Table.States (632), 90, (268, 0), 34);
+ Add_Action (Table.States (632), 92, (314, 1), 976);
+ Add_Action (Table.States (632), 106, (237, 1), 173);
+ Add_Action (Table.States (632), 107, (237, 0), 174);
+ Add_Action (Table.States (632), 115, (234, 0), 175);
+ Add_Action (Table.States (632), 116, (196, 0), 146);
+ Add_Action (Table.States (632), 117, (196, 1), 37);
+ Add_Action (Table.States (632), 118, (195, 6), 38);
+ Table.States (632).Goto_List.Set_Capacity (31);
+ Add_Goto (Table.States (632), 195, 176);
+ Add_Goto (Table.States (632), 196, 148);
+ Add_Goto (Table.States (632), 197, 54);
+ Add_Goto (Table.States (632), 198, 55);
+ Add_Goto (Table.States (632), 199, 56);
+ Add_Goto (Table.States (632), 201, 57);
+ Add_Goto (Table.States (632), 205, 177);
+ Add_Goto (Table.States (632), 206, 178);
+ Add_Goto (Table.States (632), 210, 179);
+ Add_Goto (Table.States (632), 211, 180);
+ Add_Goto (Table.States (632), 213, 181);
+ Add_Goto (Table.States (632), 214, 182);
+ Add_Goto (Table.States (632), 215, 183);
+ Add_Goto (Table.States (632), 218, 184);
+ Add_Goto (Table.States (632), 219, 185);
+ Add_Goto (Table.States (632), 220, 186);
+ Add_Goto (Table.States (632), 227, 977);
+ Add_Goto (Table.States (632), 228, 188);
+ Add_Goto (Table.States (632), 231, 189);
+ Add_Goto (Table.States (632), 232, 190);
+ Add_Goto (Table.States (632), 233, 191);
+ Add_Goto (Table.States (632), 234, 192);
+ Add_Goto (Table.States (632), 237, 193);
+ Add_Goto (Table.States (632), 251, 58);
+ Add_Goto (Table.States (632), 252, 59);
+ Add_Goto (Table.States (632), 255, 60);
+ Add_Goto (Table.States (632), 256, 194);
+ Add_Goto (Table.States (632), 268, 68);
+ Add_Goto (Table.States (632), 311, 83);
+ Add_Goto (Table.States (632), 402, 195);
+ Add_Goto (Table.States (632), 465, 196);
+ Table.States (632).Kernel := To_Vector ((((314, 0), 99, 1,
(32767, 0), 0), ((314, 1), 99, 1, (32767,
+ 0), 0)));
+ Table.States (632).Minimal_Complete_Actions := To_Vector (((Shift,
(234, 0), 115, 175), (Shift, (314, 1),
+ 92, 976)));
+ Table.States (633).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (633), (87, 88, 95), (217, 0), 2);
+ Table.States (633).Kernel := To_Vector ((0 => ((217, 0), 314, 0,
(217, 0), 2)));
+ Table.States (633).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (217, 0), 2)));
+ end Subr_25;
+ procedure Subr_26
+ is begin
+ Table.States (634).Action_List.Set_Capacity (22);
+ Add_Action (Table.States (634), 33, Reduce, (131, 1), 2);
+ Add_Action (Table.States (634), 36, Reduce, (131, 1), 2);
+ Add_Action (Table.States (634), 47, Reduce, (131, 1), 2);
+ Add_Action (Table.States (634), 49, Reduce, (131, 1), 2);
+ Add_Action (Table.States (634), 50, Reduce, (131, 1), 2);
+ Add_Action (Table.States (634), 61, Reduce, (131, 1), 2);
+ Add_Action (Table.States (634), 63, Reduce, (131, 1), 2);
+ Add_Action (Table.States (634), 69, Reduce, (131, 1), 2);
+ Add_Action (Table.States (634), 71, (453, 0), 635);
+ Add_Action (Table.States (634), 72, (153, 0), 636);
+ Add_Action (Table.States (634), 74, (139, 0), 637);
+ Add_Action (Table.States (634), 75, Reduce, (131, 1), 2);
+ Add_Action (Table.States (634), 85, (162, 0), 612);
+ Add_Action (Table.States (634), 87, Reduce, (131, 1), 2);
+ Add_Action (Table.States (634), 91, Reduce, (131, 1), 2);
+ Add_Action (Table.States (634), 94, Reduce, (131, 1), 2);
+ Add_Action (Table.States (634), 95, Reduce, (131, 1), 2);
+ Add_Action (Table.States (634), 96, (197, 0), 283);
+ Add_Action (Table.States (634), 99, Reduce, (131, 1), 2);
+ Add_Action (Table.States (634), 108, Reduce, (131, 1), 2);
+ Add_Action (Table.States (634), 113, (121, 0), 285);
+ Add_Action (Table.States (634), 114, (121, 1), 286);
+ Table.States (634).Goto_List.Set_Capacity (8);
+ Add_Goto (Table.States (634), 121, 287);
+ Add_Goto (Table.States (634), 132, 978);
+ Add_Goto (Table.States (634), 133, 640);
+ Add_Goto (Table.States (634), 139, 641);
+ Add_Goto (Table.States (634), 153, 642);
+ Add_Goto (Table.States (634), 162, 643);
+ Add_Goto (Table.States (634), 313, 289);
+ Add_Goto (Table.States (634), 453, 644);
+ Table.States (634).Kernel := To_Vector ((((131, 0), 195, 2,
(32767, 0), 0), ((131, 1), 195, 0, (131,
+ 1), 2), ((197, 0), 195, 2, (32767, 0), 0), ((198, 0), 195,
3, (32767, 0), 0), ((199, 0), 195, 2,
+ (32767, 0), 0), ((201, 0), 195, 2, (32767, 0), 0), ((255, 0),
195, 3, (32767, 0), 0), ((311, 0),
+ 195, 3, (32767, 0), 0)));
+ Table.States (634).Minimal_Complete_Actions := To_Vector (((Shift,
(153, 0), 72, 636), (Reduce, (131, 1),
+ 2)));
+ Table.States (635).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (635), 46, (233, 2), 167);
+ Add_Action (Table.States (635), 52, (233, 3), 168);
+ Add_Action (Table.States (635), 65, (234, 1), 169);
+ Add_Action (Table.States (635), 76, (256, 0), 170);
+ Add_Action (Table.States (635), 85, (205, 4), 171);
+ Add_Action (Table.States (635), 86, (213, 2), 172);
+ Add_Action (Table.States (635), 90, (268, 0), 34);
+ Add_Action (Table.States (635), 106, (237, 1), 173);
+ Add_Action (Table.States (635), 107, (237, 0), 174);
+ Add_Action (Table.States (635), 115, (234, 0), 175);
+ Add_Action (Table.States (635), 116, (196, 0), 146);
+ Add_Action (Table.States (635), 117, (196, 1), 37);
+ Add_Action (Table.States (635), 118, (195, 6), 38);
+ Table.States (635).Goto_List.Set_Capacity (28);
+ Add_Goto (Table.States (635), 195, 176);
+ Add_Goto (Table.States (635), 196, 148);
+ Add_Goto (Table.States (635), 197, 54);
+ Add_Goto (Table.States (635), 198, 55);
+ Add_Goto (Table.States (635), 199, 56);
+ Add_Goto (Table.States (635), 201, 57);
+ Add_Goto (Table.States (635), 205, 177);
+ Add_Goto (Table.States (635), 206, 178);
+ Add_Goto (Table.States (635), 210, 179);
+ Add_Goto (Table.States (635), 211, 180);
+ Add_Goto (Table.States (635), 213, 181);
+ Add_Goto (Table.States (635), 214, 182);
+ Add_Goto (Table.States (635), 215, 183);
+ Add_Goto (Table.States (635), 218, 184);
+ Add_Goto (Table.States (635), 219, 185);
+ Add_Goto (Table.States (635), 220, 186);
+ Add_Goto (Table.States (635), 231, 979);
+ Add_Goto (Table.States (635), 232, 190);
+ Add_Goto (Table.States (635), 233, 191);
+ Add_Goto (Table.States (635), 234, 192);
+ Add_Goto (Table.States (635), 237, 193);
+ Add_Goto (Table.States (635), 251, 58);
+ Add_Goto (Table.States (635), 252, 59);
+ Add_Goto (Table.States (635), 255, 60);
+ Add_Goto (Table.States (635), 256, 194);
+ Add_Goto (Table.States (635), 268, 68);
+ Add_Goto (Table.States (635), 311, 83);
+ Add_Goto (Table.States (635), 465, 196);
+ Table.States (635).Kernel := To_Vector ((((453, 0), 71, 5,
(32767, 0), 0), ((453, 1), 71, 1, (32767,
+ 0), 0)));
+ Table.States (635).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (636).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (636), 46, (233, 2), 167);
+ Add_Action (Table.States (636), 52, (233, 3), 168);
+ Add_Action (Table.States (636), 65, (234, 1), 169);
+ Add_Action (Table.States (636), 76, (256, 0), 170);
+ Add_Action (Table.States (636), 85, (205, 4), 171);
+ Add_Action (Table.States (636), 86, (213, 2), 172);
+ Add_Action (Table.States (636), 90, (268, 0), 34);
+ Add_Action (Table.States (636), 106, (237, 1), 173);
+ Add_Action (Table.States (636), 107, (237, 0), 174);
+ Add_Action (Table.States (636), 115, (234, 0), 175);
+ Add_Action (Table.States (636), 116, (196, 0), 146);
+ Add_Action (Table.States (636), 117, (196, 1), 37);
+ Add_Action (Table.States (636), 118, (195, 6), 38);
+ Table.States (636).Goto_List.Set_Capacity (28);
+ Add_Goto (Table.States (636), 195, 176);
+ Add_Goto (Table.States (636), 196, 148);
+ Add_Goto (Table.States (636), 197, 54);
+ Add_Goto (Table.States (636), 198, 55);
+ Add_Goto (Table.States (636), 199, 56);
+ Add_Goto (Table.States (636), 201, 57);
+ Add_Goto (Table.States (636), 205, 177);
+ Add_Goto (Table.States (636), 206, 178);
+ Add_Goto (Table.States (636), 210, 179);
+ Add_Goto (Table.States (636), 211, 180);
+ Add_Goto (Table.States (636), 213, 181);
+ Add_Goto (Table.States (636), 214, 182);
+ Add_Goto (Table.States (636), 215, 183);
+ Add_Goto (Table.States (636), 218, 184);
+ Add_Goto (Table.States (636), 219, 185);
+ Add_Goto (Table.States (636), 220, 186);
+ Add_Goto (Table.States (636), 231, 980);
+ Add_Goto (Table.States (636), 232, 190);
+ Add_Goto (Table.States (636), 233, 191);
+ Add_Goto (Table.States (636), 234, 192);
+ Add_Goto (Table.States (636), 237, 193);
+ Add_Goto (Table.States (636), 251, 58);
+ Add_Goto (Table.States (636), 252, 59);
+ Add_Goto (Table.States (636), 255, 60);
+ Add_Goto (Table.States (636), 256, 194);
+ Add_Goto (Table.States (636), 268, 68);
+ Add_Goto (Table.States (636), 311, 83);
+ Add_Goto (Table.States (636), 465, 196);
+ Table.States (636).Kernel := To_Vector ((((153, 0), 72, 5,
(32767, 0), 0), ((153, 1), 72, 1, (32767,
+ 0), 0)));
+ Table.States (636).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (637).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (637), 46, (233, 2), 167);
+ Add_Action (Table.States (637), 52, (233, 3), 168);
+ Add_Action (Table.States (637), 65, (234, 1), 169);
+ Add_Action (Table.States (637), 76, (256, 0), 170);
+ Add_Action (Table.States (637), 85, (205, 4), 171);
+ Add_Action (Table.States (637), 86, (213, 2), 172);
+ Add_Action (Table.States (637), 90, (268, 0), 34);
+ Add_Action (Table.States (637), 106, (237, 1), 173);
+ Add_Action (Table.States (637), 107, (237, 0), 174);
+ Add_Action (Table.States (637), 115, (234, 0), 175);
+ Add_Action (Table.States (637), 116, (196, 0), 146);
+ Add_Action (Table.States (637), 117, (196, 1), 37);
+ Add_Action (Table.States (637), 118, (195, 6), 38);
+ Table.States (637).Goto_List.Set_Capacity (30);
+ Add_Goto (Table.States (637), 140, 981);
+ Add_Goto (Table.States (637), 195, 673);
+ Add_Goto (Table.States (637), 196, 148);
+ Add_Goto (Table.States (637), 197, 54);
+ Add_Goto (Table.States (637), 198, 55);
+ Add_Goto (Table.States (637), 199, 56);
+ Add_Goto (Table.States (637), 201, 57);
+ Add_Goto (Table.States (637), 203, 369);
+ Add_Goto (Table.States (637), 205, 177);
+ Add_Goto (Table.States (637), 206, 178);
+ Add_Goto (Table.States (637), 210, 179);
+ Add_Goto (Table.States (637), 211, 180);
+ Add_Goto (Table.States (637), 213, 181);
+ Add_Goto (Table.States (637), 214, 182);
+ Add_Goto (Table.States (637), 215, 183);
+ Add_Goto (Table.States (637), 218, 184);
+ Add_Goto (Table.States (637), 219, 185);
+ Add_Goto (Table.States (637), 220, 186);
+ Add_Goto (Table.States (637), 231, 696);
+ Add_Goto (Table.States (637), 232, 190);
+ Add_Goto (Table.States (637), 233, 191);
+ Add_Goto (Table.States (637), 234, 192);
+ Add_Goto (Table.States (637), 237, 193);
+ Add_Goto (Table.States (637), 251, 58);
+ Add_Goto (Table.States (637), 252, 59);
+ Add_Goto (Table.States (637), 255, 60);
+ Add_Goto (Table.States (637), 256, 194);
+ Add_Goto (Table.States (637), 268, 68);
+ Add_Goto (Table.States (637), 311, 83);
+ Add_Goto (Table.States (637), 465, 196);
+ Table.States (637).Kernel := To_Vector ((0 => ((139, 0), 74, 3,
(32767, 0), 0)));
+ Table.States (637).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (638).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (638), 56, (202, 1), 548);
+ Add_Action (Table.States (638), 71, (202, 2), 549);
+ Add_Action (Table.States (638), 72, (202, 3), 550);
+ Add_Action (Table.States (638), 73, (202, 4), 551);
+ Add_Action (Table.States (638), 74, (204, 0), 982);
+ Add_Action (Table.States (638), 85, (205, 4), 171);
+ Add_Action (Table.States (638), 86, (213, 2), 552);
+ Add_Action (Table.States (638), 116, (202, 0), 553);
+ Table.States (638).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (638), 202, 554);
+ Add_Goto (Table.States (638), 204, 983);
+ Add_Goto (Table.States (638), 205, 555);
+ Add_Goto (Table.States (638), 206, 178);
+ Add_Goto (Table.States (638), 210, 179);
+ Add_Goto (Table.States (638), 211, 180);
+ Add_Goto (Table.States (638), 213, 181);
+ Add_Goto (Table.States (638), 214, 182);
+ Add_Goto (Table.States (638), 215, 183);
+ Add_Goto (Table.States (638), 218, 184);
+ Add_Goto (Table.States (638), 219, 185);
+ Add_Goto (Table.States (638), 220, 186);
+ Table.States (638).Kernel := To_Vector ((((201, 0), 121, 1,
(32767, 0), 0), ((203, 0), 121, 1, (32767,
+ 0), 0), ((255, 0), 121, 2, (32767, 0), 0)));
+ Table.States (639).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (639), (33, 36, 47, 49, 50, 61, 63, 69,
75, 87, 91, 94, 95, 99, 108), (131, 2),
+ 2);
+ Table.States (639).Kernel := To_Vector ((0 => ((131, 2), 132, 0,
(131, 2), 2)));
+ Table.States (639).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (131, 2), 2)));
+ Table.States (640).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (640), (33, 36, 47, 49, 50, 61, 63, 69,
75, 87, 91, 94, 95, 99, 108), (132, 0),
+ 1);
+ Table.States (640).Kernel := To_Vector ((0 => ((132, 0), 133, 0,
(132, 0), 1)));
+ Table.States (640).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (132, 0), 1)));
+ Table.States (641).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (641), (33, 36, 47, 49, 50, 61, 63, 69,
75, 87, 91, 94, 95, 99, 108), (133, 0),
+ 1);
+ Table.States (641).Kernel := To_Vector ((0 => ((133, 0), 139, 0,
(133, 0), 1)));
+ Table.States (641).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (133, 0), 1)));
+ Table.States (642).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (642), (33, 36, 47, 49, 50, 61, 63, 69,
75, 87, 91, 94, 95, 99, 108), (133, 1),
+ 1);
+ Table.States (642).Kernel := To_Vector ((0 => ((133, 1), 153, 0,
(133, 1), 1)));
+ Table.States (642).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (133, 1), 1)));
+ Table.States (643).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (643), (33, 36, 47, 49, 50, 61, 63, 69,
75, 87, 91, 94, 95, 99, 108), (132, 1),
+ 1);
+ Table.States (643).Kernel := To_Vector ((0 => ((132, 1), 162, 0,
(132, 1), 1)));
+ Table.States (643).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (132, 1), 1)));
+ Table.States (644).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (644), (33, 36, 47, 49, 50, 61, 63, 69,
75, 87, 91, 94, 95, 99, 108), (133, 2),
+ 1);
+ Table.States (644).Kernel := To_Vector ((0 => ((133, 2), 453, 0,
(133, 2), 1)));
+ Table.States (644).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (133, 2), 1)));
+ Table.States (645).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (645), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (206, 0), 3);
+ Table.States (645).Kernel := To_Vector ((0 => ((206, 0), 87, 0,
(206, 0), 3)));
+ Table.States (645).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (206, 0), 3)));
+ Table.States (646).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (646), 62, (200, 2), 531);
+ Add_Action (Table.States (646), 116, (196, 0), 146);
+ Add_Action (Table.States (646), 117, (196, 1), 37);
+ Add_Action (Table.States (646), 118, (200, 1), 545);
+ Table.States (646).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (646), 196, 546);
+ Add_Goto (Table.States (646), 200, 984);
+ Table.States (646).Kernel := To_Vector ((0 => ((209, 1), 91, 1,
(32767, 0), 0)));
+ Table.States (646).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (647).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (647), (87, 95), (208, 0), 2);
+ Table.States (647).Kernel := To_Vector ((0 => ((208, 0), 314, 0,
(208, 0), 2)));
+ Table.States (647).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (208, 0), 2)));
+ Table.States (648).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (648), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (213, 0), 3);
+ Table.States (648).Kernel := To_Vector ((0 => ((213, 0), 87, 0,
(213, 0), 3)));
+ Table.States (648).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (213, 0), 3)));
+ Table.States (649).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (649), 12, (402, 0), 165);
+ Add_Action (Table.States (649), 46, (233, 2), 167);
+ Add_Action (Table.States (649), 52, (233, 3), 168);
+ Add_Action (Table.States (649), 62, (213, 1), 985);
+ Add_Action (Table.States (649), 65, (234, 1), 169);
+ Add_Action (Table.States (649), 76, (256, 0), 170);
+ Add_Action (Table.States (649), 85, (205, 4), 171);
+ Add_Action (Table.States (649), 86, (213, 2), 172);
+ Add_Action (Table.States (649), 90, (268, 0), 34);
+ Add_Action (Table.States (649), 106, (237, 1), 173);
+ Add_Action (Table.States (649), 107, (237, 0), 174);
+ Add_Action (Table.States (649), 115, (234, 0), 175);
+ Add_Action (Table.States (649), 116, (196, 0), 146);
+ Add_Action (Table.States (649), 117, (196, 1), 37);
+ Add_Action (Table.States (649), 118, (195, 6), 38);
+ Table.States (649).Goto_List.Set_Capacity (31);
+ Add_Goto (Table.States (649), 195, 176);
+ Add_Goto (Table.States (649), 196, 148);
+ Add_Goto (Table.States (649), 197, 54);
+ Add_Goto (Table.States (649), 198, 55);
+ Add_Goto (Table.States (649), 199, 56);
+ Add_Goto (Table.States (649), 201, 57);
+ Add_Goto (Table.States (649), 205, 177);
+ Add_Goto (Table.States (649), 206, 178);
+ Add_Goto (Table.States (649), 210, 179);
+ Add_Goto (Table.States (649), 211, 180);
+ Add_Goto (Table.States (649), 213, 181);
+ Add_Goto (Table.States (649), 214, 182);
+ Add_Goto (Table.States (649), 215, 183);
+ Add_Goto (Table.States (649), 218, 184);
+ Add_Goto (Table.States (649), 219, 185);
+ Add_Goto (Table.States (649), 220, 186);
+ Add_Goto (Table.States (649), 227, 986);
+ Add_Goto (Table.States (649), 228, 188);
+ Add_Goto (Table.States (649), 231, 189);
+ Add_Goto (Table.States (649), 232, 190);
+ Add_Goto (Table.States (649), 233, 191);
+ Add_Goto (Table.States (649), 234, 192);
+ Add_Goto (Table.States (649), 237, 193);
+ Add_Goto (Table.States (649), 251, 58);
+ Add_Goto (Table.States (649), 252, 59);
+ Add_Goto (Table.States (649), 255, 60);
+ Add_Goto (Table.States (649), 256, 194);
+ Add_Goto (Table.States (649), 268, 68);
+ Add_Goto (Table.States (649), 311, 83);
+ Add_Goto (Table.States (649), 402, 195);
+ Add_Goto (Table.States (649), 465, 196);
+ Table.States (649).Kernel := To_Vector ((((212, 1), 95, 1,
(32767, 0), 0), ((213, 1), 95, 4, (32767,
+ 0), 0)));
+ Table.States (649).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (213, 1), 62, 985)));
+ Table.States (650).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (650), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (215, 0), 3);
+ Table.States (650).Kernel := To_Vector ((0 => ((215, 0), 87, 0,
(215, 0), 3)));
+ Table.States (650).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (215, 0), 3)));
+ Table.States (651).Action_List.Set_Capacity (16);
+ Add_Action (Table.States (651), 12, (402, 0), 165);
+ Add_Action (Table.States (651), 46, (233, 2), 167);
+ Add_Action (Table.States (651), 51, (221, 0), 273);
+ Add_Action (Table.States (651), 52, (187, 0), 356);
+ Add_Action (Table.States (651), 62, (178, 3), 385);
+ Add_Action (Table.States (651), 65, (234, 1), 169);
+ Add_Action (Table.States (651), 76, (256, 0), 170);
+ Add_Action (Table.States (651), 85, (205, 4), 171);
+ Add_Action (Table.States (651), 86, (213, 2), 172);
+ Add_Action (Table.States (651), 90, (268, 0), 34);
+ Add_Action (Table.States (651), 106, (237, 1), 173);
+ Add_Action (Table.States (651), 107, (237, 0), 174);
+ Add_Action (Table.States (651), 115, (234, 0), 175);
+ Add_Action (Table.States (651), 116, (196, 0), 146);
+ Add_Action (Table.States (651), 117, (196, 1), 37);
+ Add_Action (Table.States (651), 118, (195, 6), 38);
+ Table.States (651).Goto_List.Set_Capacity (40);
+ Add_Goto (Table.States (651), 131, 361);
+ Add_Goto (Table.States (651), 140, 362);
+ Add_Goto (Table.States (651), 177, 363);
+ Add_Goto (Table.States (651), 178, 364);
+ Add_Goto (Table.States (651), 187, 365);
+ Add_Goto (Table.States (651), 195, 366);
+ Add_Goto (Table.States (651), 196, 148);
+ Add_Goto (Table.States (651), 197, 54);
+ Add_Goto (Table.States (651), 198, 55);
+ Add_Goto (Table.States (651), 199, 56);
+ Add_Goto (Table.States (651), 201, 57);
+ Add_Goto (Table.States (651), 203, 369);
+ Add_Goto (Table.States (651), 205, 177);
+ Add_Goto (Table.States (651), 206, 178);
+ Add_Goto (Table.States (651), 210, 179);
+ Add_Goto (Table.States (651), 211, 180);
+ Add_Goto (Table.States (651), 213, 181);
+ Add_Goto (Table.States (651), 214, 182);
+ Add_Goto (Table.States (651), 215, 183);
+ Add_Goto (Table.States (651), 216, 987);
+ Add_Goto (Table.States (651), 217, 988);
+ Add_Goto (Table.States (651), 218, 184);
+ Add_Goto (Table.States (651), 219, 185);
+ Add_Goto (Table.States (651), 220, 186);
+ Add_Goto (Table.States (651), 221, 376);
+ Add_Goto (Table.States (651), 227, 975);
+ Add_Goto (Table.States (651), 228, 188);
+ Add_Goto (Table.States (651), 231, 378);
+ Add_Goto (Table.States (651), 232, 190);
+ Add_Goto (Table.States (651), 233, 191);
+ Add_Goto (Table.States (651), 234, 192);
+ Add_Goto (Table.States (651), 237, 193);
+ Add_Goto (Table.States (651), 251, 58);
+ Add_Goto (Table.States (651), 252, 59);
+ Add_Goto (Table.States (651), 255, 60);
+ Add_Goto (Table.States (651), 256, 194);
+ Add_Goto (Table.States (651), 268, 68);
+ Add_Goto (Table.States (651), 311, 83);
+ Add_Goto (Table.States (651), 402, 195);
+ Add_Goto (Table.States (651), 465, 196);
+ Table.States (651).Kernel := To_Vector ((((216, 1), 95, 3,
(32767, 0), 0), ((216, 2), 95, 3, (32767,
+ 0), 0)));
+ Table.States (652).Action_List.Set_Capacity (16);
+ Add_Action (Table.States (652), 12, (402, 0), 165);
+ Add_Action (Table.States (652), 46, (233, 2), 167);
+ Add_Action (Table.States (652), 52, (233, 3), 168);
+ Add_Action (Table.States (652), 62, (200, 2), 531);
+ Add_Action (Table.States (652), 65, (207, 1), 359);
+ Add_Action (Table.States (652), 71, (219, 0), 989);
+ Add_Action (Table.States (652), 76, (256, 0), 170);
+ Add_Action (Table.States (652), 85, (205, 4), 171);
+ Add_Action (Table.States (652), 86, (213, 2), 172);
+ Add_Action (Table.States (652), 90, (268, 0), 34);
+ Add_Action (Table.States (652), 106, (237, 1), 173);
+ Add_Action (Table.States (652), 107, (237, 0), 174);
+ Add_Action (Table.States (652), 115, (234, 0), 175);
+ Add_Action (Table.States (652), 116, (196, 0), 146);
+ Add_Action (Table.States (652), 117, (196, 1), 37);
+ Add_Action (Table.States (652), 118, (195, 6), 360);
+ Table.States (652).Goto_List.Set_Capacity (36);
+ Add_Goto (Table.States (652), 195, 176);
+ Add_Goto (Table.States (652), 196, 367);
+ Add_Goto (Table.States (652), 197, 54);
+ Add_Goto (Table.States (652), 198, 55);
+ Add_Goto (Table.States (652), 199, 56);
+ Add_Goto (Table.States (652), 200, 368);
+ Add_Goto (Table.States (652), 201, 57);
+ Add_Goto (Table.States (652), 205, 177);
+ Add_Goto (Table.States (652), 206, 178);
+ Add_Goto (Table.States (652), 207, 990);
+ Add_Goto (Table.States (652), 208, 371);
+ Add_Goto (Table.States (652), 209, 372);
+ Add_Goto (Table.States (652), 210, 179);
+ Add_Goto (Table.States (652), 211, 180);
+ Add_Goto (Table.States (652), 213, 181);
+ Add_Goto (Table.States (652), 214, 182);
+ Add_Goto (Table.States (652), 215, 183);
+ Add_Goto (Table.States (652), 218, 184);
+ Add_Goto (Table.States (652), 219, 185);
+ Add_Goto (Table.States (652), 220, 186);
+ Add_Goto (Table.States (652), 227, 991);
+ Add_Goto (Table.States (652), 228, 188);
+ Add_Goto (Table.States (652), 231, 189);
+ Add_Goto (Table.States (652), 232, 190);
+ Add_Goto (Table.States (652), 233, 191);
+ Add_Goto (Table.States (652), 234, 192);
+ Add_Goto (Table.States (652), 237, 193);
+ Add_Goto (Table.States (652), 251, 58);
+ Add_Goto (Table.States (652), 252, 59);
+ Add_Goto (Table.States (652), 255, 60);
+ Add_Goto (Table.States (652), 256, 194);
+ Add_Goto (Table.States (652), 268, 68);
+ Add_Goto (Table.States (652), 311, 83);
+ Add_Goto (Table.States (652), 402, 195);
+ Add_Goto (Table.States (652), 459, 384);
+ Add_Goto (Table.States (652), 465, 196);
+ Table.States (652).Kernel := To_Vector ((((210, 0), 61, 3,
(32767, 0), 0), ((219, 0), 61, 4, (32767,
+ 0), 0), ((220, 0), 61, 5, (32767, 0), 0)));
+ Table.States (652).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (207, 1), 65, 359)));
+ end Subr_26;
+ procedure Subr_27
+ is begin
+ Table.States (653).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (653), 46, (233, 2), 167);
+ Add_Action (Table.States (653), 52, (233, 3), 168);
+ Add_Action (Table.States (653), 65, (234, 1), 169);
+ Add_Action (Table.States (653), 76, (256, 0), 170);
+ Add_Action (Table.States (653), 85, (205, 4), 171);
+ Add_Action (Table.States (653), 86, (213, 2), 172);
+ Add_Action (Table.States (653), 90, (268, 0), 34);
+ Add_Action (Table.States (653), 106, (237, 1), 173);
+ Add_Action (Table.States (653), 107, (237, 0), 174);
+ Add_Action (Table.States (653), 115, (234, 0), 175);
+ Add_Action (Table.States (653), 116, (196, 0), 146);
+ Add_Action (Table.States (653), 117, (196, 1), 37);
+ Add_Action (Table.States (653), 118, (195, 6), 38);
+ Table.States (653).Goto_List.Set_Capacity (28);
+ Add_Goto (Table.States (653), 195, 176);
+ Add_Goto (Table.States (653), 196, 148);
+ Add_Goto (Table.States (653), 197, 54);
+ Add_Goto (Table.States (653), 198, 55);
+ Add_Goto (Table.States (653), 199, 56);
+ Add_Goto (Table.States (653), 201, 57);
+ Add_Goto (Table.States (653), 205, 177);
+ Add_Goto (Table.States (653), 206, 178);
+ Add_Goto (Table.States (653), 210, 179);
+ Add_Goto (Table.States (653), 211, 180);
+ Add_Goto (Table.States (653), 213, 181);
+ Add_Goto (Table.States (653), 214, 182);
+ Add_Goto (Table.States (653), 215, 183);
+ Add_Goto (Table.States (653), 218, 184);
+ Add_Goto (Table.States (653), 219, 185);
+ Add_Goto (Table.States (653), 220, 186);
+ Add_Goto (Table.States (653), 231, 992);
+ Add_Goto (Table.States (653), 232, 190);
+ Add_Goto (Table.States (653), 233, 191);
+ Add_Goto (Table.States (653), 234, 192);
+ Add_Goto (Table.States (653), 237, 193);
+ Add_Goto (Table.States (653), 251, 58);
+ Add_Goto (Table.States (653), 252, 59);
+ Add_Goto (Table.States (653), 255, 60);
+ Add_Goto (Table.States (653), 256, 194);
+ Add_Goto (Table.States (653), 268, 68);
+ Add_Goto (Table.States (653), 311, 83);
+ Add_Goto (Table.States (653), 465, 196);
+ Table.States (653).Kernel := To_Vector ((0 => ((140, 1), 97, 1,
(32767, 0), 0)));
+ Table.States (653).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (654).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (654), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (205, 4), 3);
+ Table.States (654).Kernel := To_Vector ((0 => ((205, 4), 87, 0,
(205, 4), 3)));
+ Table.States (654).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (205, 4), 3)));
+ Table.States (655).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (655), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (205, 5), 3);
+ Table.States (655).Kernel := To_Vector ((0 => ((205, 5), 87, 0,
(205, 5), 3)));
+ Table.States (655).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (205, 5), 3)));
+ Table.States (656).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (656), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (205, 6), 3);
+ Table.States (656).Kernel := To_Vector ((0 => ((205, 6), 87, 0,
(205, 6), 3)));
+ Table.States (656).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (205, 6), 3)));
+ Table.States (657).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (657), 12, (402, 0), 165);
+ Add_Action (Table.States (657), 46, (233, 2), 167);
+ Add_Action (Table.States (657), 52, (233, 3), 168);
+ Add_Action (Table.States (657), 62, (200, 2), 531);
+ Add_Action (Table.States (657), 65, (234, 1), 169);
+ Add_Action (Table.States (657), 76, (256, 0), 170);
+ Add_Action (Table.States (657), 85, (205, 4), 171);
+ Add_Action (Table.States (657), 86, (213, 2), 172);
+ Add_Action (Table.States (657), 90, (268, 0), 34);
+ Add_Action (Table.States (657), 106, (237, 1), 173);
+ Add_Action (Table.States (657), 107, (237, 0), 174);
+ Add_Action (Table.States (657), 115, (234, 0), 175);
+ Add_Action (Table.States (657), 116, (196, 0), 146);
+ Add_Action (Table.States (657), 117, (196, 1), 37);
+ Add_Action (Table.States (657), 118, (195, 6), 360);
+ Table.States (657).Goto_List.Set_Capacity (35);
+ Add_Goto (Table.States (657), 195, 176);
+ Add_Goto (Table.States (657), 196, 367);
+ Add_Goto (Table.States (657), 197, 54);
+ Add_Goto (Table.States (657), 198, 55);
+ Add_Goto (Table.States (657), 199, 56);
+ Add_Goto (Table.States (657), 200, 368);
+ Add_Goto (Table.States (657), 201, 57);
+ Add_Goto (Table.States (657), 205, 177);
+ Add_Goto (Table.States (657), 206, 178);
+ Add_Goto (Table.States (657), 208, 993);
+ Add_Goto (Table.States (657), 209, 372);
+ Add_Goto (Table.States (657), 210, 179);
+ Add_Goto (Table.States (657), 211, 180);
+ Add_Goto (Table.States (657), 213, 181);
+ Add_Goto (Table.States (657), 214, 182);
+ Add_Goto (Table.States (657), 215, 183);
+ Add_Goto (Table.States (657), 218, 184);
+ Add_Goto (Table.States (657), 219, 185);
+ Add_Goto (Table.States (657), 220, 186);
+ Add_Goto (Table.States (657), 227, 991);
+ Add_Goto (Table.States (657), 228, 188);
+ Add_Goto (Table.States (657), 231, 189);
+ Add_Goto (Table.States (657), 232, 190);
+ Add_Goto (Table.States (657), 233, 191);
+ Add_Goto (Table.States (657), 234, 192);
+ Add_Goto (Table.States (657), 237, 193);
+ Add_Goto (Table.States (657), 251, 58);
+ Add_Goto (Table.States (657), 252, 59);
+ Add_Goto (Table.States (657), 255, 60);
+ Add_Goto (Table.States (657), 256, 194);
+ Add_Goto (Table.States (657), 268, 68);
+ Add_Goto (Table.States (657), 311, 83);
+ Add_Goto (Table.States (657), 402, 195);
+ Add_Goto (Table.States (657), 459, 994);
+ Add_Goto (Table.States (657), 465, 196);
+ Table.States (657).Kernel := To_Vector ((((459, 1), 95, 1,
(32767, 0), 0), ((459, 2), 95, 3, (32767,
+ 0), 0)));
+ Table.States (658).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (658), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (213, 3), 3);
+ Table.States (658).Kernel := To_Vector ((0 => ((213, 3), 88, 0,
(213, 3), 3)));
+ Table.States (658).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (213, 3), 3)));
+ Table.States (659).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (659), 12, (402, 0), 165);
+ Add_Action (Table.States (659), 46, (233, 2), 167);
+ Add_Action (Table.States (659), 52, (233, 3), 168);
+ Add_Action (Table.States (659), 62, (213, 2), 995);
+ Add_Action (Table.States (659), 65, (234, 1), 169);
+ Add_Action (Table.States (659), 76, (256, 0), 170);
+ Add_Action (Table.States (659), 85, (205, 4), 171);
+ Add_Action (Table.States (659), 86, (213, 2), 172);
+ Add_Action (Table.States (659), 90, (268, 0), 34);
+ Add_Action (Table.States (659), 106, (237, 1), 173);
+ Add_Action (Table.States (659), 107, (237, 0), 174);
+ Add_Action (Table.States (659), 115, (234, 0), 175);
+ Add_Action (Table.States (659), 116, (196, 0), 146);
+ Add_Action (Table.States (659), 117, (196, 1), 37);
+ Add_Action (Table.States (659), 118, (195, 6), 38);
+ Table.States (659).Goto_List.Set_Capacity (31);
+ Add_Goto (Table.States (659), 195, 176);
+ Add_Goto (Table.States (659), 196, 148);
+ Add_Goto (Table.States (659), 197, 54);
+ Add_Goto (Table.States (659), 198, 55);
+ Add_Goto (Table.States (659), 199, 56);
+ Add_Goto (Table.States (659), 201, 57);
+ Add_Goto (Table.States (659), 205, 177);
+ Add_Goto (Table.States (659), 206, 178);
+ Add_Goto (Table.States (659), 210, 179);
+ Add_Goto (Table.States (659), 211, 180);
+ Add_Goto (Table.States (659), 213, 181);
+ Add_Goto (Table.States (659), 214, 182);
+ Add_Goto (Table.States (659), 215, 183);
+ Add_Goto (Table.States (659), 218, 184);
+ Add_Goto (Table.States (659), 219, 185);
+ Add_Goto (Table.States (659), 220, 186);
+ Add_Goto (Table.States (659), 227, 986);
+ Add_Goto (Table.States (659), 228, 188);
+ Add_Goto (Table.States (659), 231, 189);
+ Add_Goto (Table.States (659), 232, 190);
+ Add_Goto (Table.States (659), 233, 191);
+ Add_Goto (Table.States (659), 234, 192);
+ Add_Goto (Table.States (659), 237, 193);
+ Add_Goto (Table.States (659), 251, 58);
+ Add_Goto (Table.States (659), 252, 59);
+ Add_Goto (Table.States (659), 255, 60);
+ Add_Goto (Table.States (659), 256, 194);
+ Add_Goto (Table.States (659), 268, 68);
+ Add_Goto (Table.States (659), 311, 83);
+ Add_Goto (Table.States (659), 402, 195);
+ Add_Goto (Table.States (659), 465, 196);
+ Table.States (659).Kernel := To_Vector ((((212, 1), 95, 1,
(32767, 0), 0), ((213, 2), 95, 4, (32767,
+ 0), 0)));
+ Table.States (659).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (213, 2), 62, 995)));
+ Table.States (660).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (660), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (215, 1), 3);
+ Table.States (660).Kernel := To_Vector ((0 => ((215, 1), 88, 0,
(215, 1), 3)));
+ Table.States (660).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (215, 1), 3)));
+ Table.States (661).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (661), 71, (220, 1), 996);
+ Table.States (661).Kernel := To_Vector ((0 => ((220, 1), 61, 5,
(32767, 0), 0)));
+ Table.States (661).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (220, 1), 71, 996)));
+ Table.States (662).Action_List.Set_Capacity (18);
+ Add_Action (Table.States (662), (33, 36, 41, 43, 44, 48, 50, 61,
63, 72, 74, 82, 87, 88, 91, 95, 99, 108),
+ (226, 0), 2);
+ Table.States (662).Kernel := To_Vector ((0 => ((226, 0), 228, 0,
(226, 0), 2)));
+ Table.States (662).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (226, 0), 2)));
+ Table.States (663).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (663), 12, (402, 0), 165);
+ Add_Action (Table.States (663), 46, (233, 2), 167);
+ Add_Action (Table.States (663), 52, (233, 3), 168);
+ Add_Action (Table.States (663), 65, (234, 1), 169);
+ Add_Action (Table.States (663), 76, (256, 0), 170);
+ Add_Action (Table.States (663), 85, (205, 4), 171);
+ Add_Action (Table.States (663), 86, (213, 2), 172);
+ Add_Action (Table.States (663), 90, (268, 0), 34);
+ Add_Action (Table.States (663), 106, (237, 1), 173);
+ Add_Action (Table.States (663), 107, (237, 0), 174);
+ Add_Action (Table.States (663), 115, (234, 0), 175);
+ Add_Action (Table.States (663), 116, (196, 0), 146);
+ Add_Action (Table.States (663), 117, (196, 1), 37);
+ Add_Action (Table.States (663), 118, (195, 6), 38);
+ Table.States (663).Goto_List.Set_Capacity (30);
+ Add_Goto (Table.States (663), 195, 176);
+ Add_Goto (Table.States (663), 196, 148);
+ Add_Goto (Table.States (663), 197, 54);
+ Add_Goto (Table.States (663), 198, 55);
+ Add_Goto (Table.States (663), 199, 56);
+ Add_Goto (Table.States (663), 201, 57);
+ Add_Goto (Table.States (663), 205, 177);
+ Add_Goto (Table.States (663), 206, 178);
+ Add_Goto (Table.States (663), 210, 179);
+ Add_Goto (Table.States (663), 211, 180);
+ Add_Goto (Table.States (663), 213, 181);
+ Add_Goto (Table.States (663), 214, 182);
+ Add_Goto (Table.States (663), 215, 183);
+ Add_Goto (Table.States (663), 218, 184);
+ Add_Goto (Table.States (663), 219, 185);
+ Add_Goto (Table.States (663), 220, 186);
+ Add_Goto (Table.States (663), 228, 997);
+ Add_Goto (Table.States (663), 231, 189);
+ Add_Goto (Table.States (663), 232, 190);
+ Add_Goto (Table.States (663), 233, 191);
+ Add_Goto (Table.States (663), 234, 192);
+ Add_Goto (Table.States (663), 237, 193);
+ Add_Goto (Table.States (663), 251, 58);
+ Add_Goto (Table.States (663), 252, 59);
+ Add_Goto (Table.States (663), 255, 60);
+ Add_Goto (Table.States (663), 256, 194);
+ Add_Goto (Table.States (663), 268, 68);
+ Add_Goto (Table.States (663), 311, 83);
+ Add_Goto (Table.States (663), 402, 195);
+ Add_Goto (Table.States (663), 465, 196);
+ Table.States (663).Kernel := To_Vector ((0 => ((225, 0), 41, 1,
(32767, 0), 0)));
+ Table.States (663).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (664).Action_List.Set_Capacity (18);
+ Add_Action (Table.States (664), (33, 36, 41, 43, 44, 49, 50, 61,
63, 72, 74, 82, 87, 88, 91, 95, 99, 108),
+ (224, 0), 2);
+ Table.States (664).Kernel := To_Vector ((0 => ((224, 0), 228, 0,
(224, 0), 2)));
+ Table.States (664).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (224, 0), 2)));
+ Table.States (665).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (665), 12, (402, 0), 165);
+ Add_Action (Table.States (665), 46, (233, 2), 167);
+ Add_Action (Table.States (665), 52, (233, 3), 168);
+ Add_Action (Table.States (665), 65, (234, 1), 169);
+ Add_Action (Table.States (665), 76, (256, 0), 170);
+ Add_Action (Table.States (665), 85, (205, 4), 171);
+ Add_Action (Table.States (665), 86, (213, 2), 172);
+ Add_Action (Table.States (665), 90, (268, 0), 34);
+ Add_Action (Table.States (665), 106, (237, 1), 173);
+ Add_Action (Table.States (665), 107, (237, 0), 174);
+ Add_Action (Table.States (665), 115, (234, 0), 175);
+ Add_Action (Table.States (665), 116, (196, 0), 146);
+ Add_Action (Table.States (665), 117, (196, 1), 37);
+ Add_Action (Table.States (665), 118, (195, 6), 38);
+ Table.States (665).Goto_List.Set_Capacity (30);
+ Add_Goto (Table.States (665), 195, 176);
+ Add_Goto (Table.States (665), 196, 148);
+ Add_Goto (Table.States (665), 197, 54);
+ Add_Goto (Table.States (665), 198, 55);
+ Add_Goto (Table.States (665), 199, 56);
+ Add_Goto (Table.States (665), 201, 57);
+ Add_Goto (Table.States (665), 205, 177);
+ Add_Goto (Table.States (665), 206, 178);
+ Add_Goto (Table.States (665), 210, 179);
+ Add_Goto (Table.States (665), 211, 180);
+ Add_Goto (Table.States (665), 213, 181);
+ Add_Goto (Table.States (665), 214, 182);
+ Add_Goto (Table.States (665), 215, 183);
+ Add_Goto (Table.States (665), 218, 184);
+ Add_Goto (Table.States (665), 219, 185);
+ Add_Goto (Table.States (665), 220, 186);
+ Add_Goto (Table.States (665), 228, 998);
+ Add_Goto (Table.States (665), 231, 189);
+ Add_Goto (Table.States (665), 232, 190);
+ Add_Goto (Table.States (665), 233, 191);
+ Add_Goto (Table.States (665), 234, 192);
+ Add_Goto (Table.States (665), 237, 193);
+ Add_Goto (Table.States (665), 251, 58);
+ Add_Goto (Table.States (665), 252, 59);
+ Add_Goto (Table.States (665), 255, 60);
+ Add_Goto (Table.States (665), 256, 194);
+ Add_Goto (Table.States (665), 268, 68);
+ Add_Goto (Table.States (665), 311, 83);
+ Add_Goto (Table.States (665), 402, 195);
+ Add_Goto (Table.States (665), 465, 196);
+ Table.States (665).Kernel := To_Vector ((0 => ((223, 0), 43, 1,
(32767, 0), 0)));
+ Table.States (665).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (666).Action_List.Set_Capacity (18);
+ Add_Action (Table.States (666), (33, 36, 41, 43, 44, 50, 61, 63,
72, 74, 75, 82, 87, 88, 91, 95, 99, 108),
+ (222, 0), 2);
+ Table.States (666).Kernel := To_Vector ((0 => ((222, 0), 228, 0,
(222, 0), 2)));
+ Table.States (666).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (222, 0), 2)));
+ Table.States (667).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (667), 12, (402, 0), 165);
+ Add_Action (Table.States (667), 46, (233, 2), 167);
+ Add_Action (Table.States (667), 52, (233, 3), 168);
+ Add_Action (Table.States (667), 65, (234, 1), 169);
+ Add_Action (Table.States (667), 76, (256, 0), 170);
+ Add_Action (Table.States (667), 85, (205, 4), 171);
+ Add_Action (Table.States (667), 86, (213, 2), 172);
+ Add_Action (Table.States (667), 90, (268, 0), 34);
+ Add_Action (Table.States (667), 106, (237, 1), 173);
+ Add_Action (Table.States (667), 107, (237, 0), 174);
+ Add_Action (Table.States (667), 115, (234, 0), 175);
+ Add_Action (Table.States (667), 116, (196, 0), 146);
+ Add_Action (Table.States (667), 117, (196, 1), 37);
+ Add_Action (Table.States (667), 118, (195, 6), 38);
+ Table.States (667).Goto_List.Set_Capacity (30);
+ Add_Goto (Table.States (667), 195, 176);
+ Add_Goto (Table.States (667), 196, 148);
+ Add_Goto (Table.States (667), 197, 54);
+ Add_Goto (Table.States (667), 198, 55);
+ Add_Goto (Table.States (667), 199, 56);
+ Add_Goto (Table.States (667), 201, 57);
+ Add_Goto (Table.States (667), 205, 177);
+ Add_Goto (Table.States (667), 206, 178);
+ Add_Goto (Table.States (667), 210, 179);
+ Add_Goto (Table.States (667), 211, 180);
+ Add_Goto (Table.States (667), 213, 181);
+ Add_Goto (Table.States (667), 214, 182);
+ Add_Goto (Table.States (667), 215, 183);
+ Add_Goto (Table.States (667), 218, 184);
+ Add_Goto (Table.States (667), 219, 185);
+ Add_Goto (Table.States (667), 220, 186);
+ Add_Goto (Table.States (667), 228, 999);
+ Add_Goto (Table.States (667), 231, 189);
+ Add_Goto (Table.States (667), 232, 190);
+ Add_Goto (Table.States (667), 233, 191);
+ Add_Goto (Table.States (667), 234, 192);
+ Add_Goto (Table.States (667), 237, 193);
+ Add_Goto (Table.States (667), 251, 58);
+ Add_Goto (Table.States (667), 252, 59);
+ Add_Goto (Table.States (667), 255, 60);
+ Add_Goto (Table.States (667), 256, 194);
+ Add_Goto (Table.States (667), 268, 68);
+ Add_Goto (Table.States (667), 311, 83);
+ Add_Goto (Table.States (667), 402, 195);
+ Add_Goto (Table.States (667), 465, 196);
+ Table.States (667).Kernel := To_Vector ((0 => ((222, 1), 75, 1,
(32767, 0), 0)));
+ Table.States (667).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (668).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (668), 43, (223, 1), 1000);
+ Table.States (668).Kernel := To_Vector ((0 => ((223, 1), 75, 2,
(32767, 0), 0)));
+ Table.States (668).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (223, 1), 43, 1000)));
+ Table.States (669).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (669), 12, (402, 0), 165);
+ Add_Action (Table.States (669), 46, (233, 2), 167);
+ Add_Action (Table.States (669), 52, (233, 3), 168);
+ Add_Action (Table.States (669), 65, (234, 1), 169);
+ Add_Action (Table.States (669), 76, (256, 0), 170);
+ Add_Action (Table.States (669), 85, (205, 4), 171);
+ Add_Action (Table.States (669), 86, (213, 2), 172);
+ Add_Action (Table.States (669), 90, (268, 0), 34);
+ Add_Action (Table.States (669), 106, (237, 1), 173);
+ Add_Action (Table.States (669), 107, (237, 0), 174);
+ Add_Action (Table.States (669), 115, (234, 0), 175);
+ Add_Action (Table.States (669), 116, (196, 0), 146);
+ Add_Action (Table.States (669), 117, (196, 1), 37);
+ Add_Action (Table.States (669), 118, (195, 6), 38);
+ Table.States (669).Goto_List.Set_Capacity (30);
+ Add_Goto (Table.States (669), 195, 176);
+ Add_Goto (Table.States (669), 196, 148);
+ Add_Goto (Table.States (669), 197, 54);
+ Add_Goto (Table.States (669), 198, 55);
+ Add_Goto (Table.States (669), 199, 56);
+ Add_Goto (Table.States (669), 201, 57);
+ Add_Goto (Table.States (669), 205, 177);
+ Add_Goto (Table.States (669), 206, 178);
+ Add_Goto (Table.States (669), 210, 179);
+ Add_Goto (Table.States (669), 211, 180);
+ Add_Goto (Table.States (669), 213, 181);
+ Add_Goto (Table.States (669), 214, 182);
+ Add_Goto (Table.States (669), 215, 183);
+ Add_Goto (Table.States (669), 218, 184);
+ Add_Goto (Table.States (669), 219, 185);
+ Add_Goto (Table.States (669), 220, 186);
+ Add_Goto (Table.States (669), 228, 1001);
+ Add_Goto (Table.States (669), 231, 189);
+ Add_Goto (Table.States (669), 232, 190);
+ Add_Goto (Table.States (669), 233, 191);
+ Add_Goto (Table.States (669), 234, 192);
+ Add_Goto (Table.States (669), 237, 193);
+ Add_Goto (Table.States (669), 251, 58);
+ Add_Goto (Table.States (669), 252, 59);
+ Add_Goto (Table.States (669), 255, 60);
+ Add_Goto (Table.States (669), 256, 194);
+ Add_Goto (Table.States (669), 268, 68);
+ Add_Goto (Table.States (669), 311, 83);
+ Add_Goto (Table.States (669), 402, 195);
+ Add_Goto (Table.States (669), 465, 196);
+ Table.States (669).Kernel := To_Vector ((0 => ((224, 1), 49, 1,
(32767, 0), 0)));
+ Table.States (669).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ end Subr_27;
+ procedure Subr_28
+ is begin
+ Table.States (670).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (670), 41, (225, 1), 1002);
+ Table.States (670).Kernel := To_Vector ((0 => ((225, 1), 49, 2,
(32767, 0), 0)));
+ Table.States (670).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (225, 1), 41, 1002)));
+ Table.States (671).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (671), 12, (402, 0), 165);
+ Add_Action (Table.States (671), 46, (233, 2), 167);
+ Add_Action (Table.States (671), 52, (233, 3), 168);
+ Add_Action (Table.States (671), 65, (234, 1), 169);
+ Add_Action (Table.States (671), 76, (256, 0), 170);
+ Add_Action (Table.States (671), 85, (205, 4), 171);
+ Add_Action (Table.States (671), 86, (213, 2), 172);
+ Add_Action (Table.States (671), 90, (268, 0), 34);
+ Add_Action (Table.States (671), 106, (237, 1), 173);
+ Add_Action (Table.States (671), 107, (237, 0), 174);
+ Add_Action (Table.States (671), 115, (234, 0), 175);
+ Add_Action (Table.States (671), 116, (196, 0), 146);
+ Add_Action (Table.States (671), 117, (196, 1), 37);
+ Add_Action (Table.States (671), 118, (195, 6), 38);
+ Table.States (671).Goto_List.Set_Capacity (30);
+ Add_Goto (Table.States (671), 195, 176);
+ Add_Goto (Table.States (671), 196, 148);
+ Add_Goto (Table.States (671), 197, 54);
+ Add_Goto (Table.States (671), 198, 55);
+ Add_Goto (Table.States (671), 199, 56);
+ Add_Goto (Table.States (671), 201, 57);
+ Add_Goto (Table.States (671), 205, 177);
+ Add_Goto (Table.States (671), 206, 178);
+ Add_Goto (Table.States (671), 210, 179);
+ Add_Goto (Table.States (671), 211, 180);
+ Add_Goto (Table.States (671), 213, 181);
+ Add_Goto (Table.States (671), 214, 182);
+ Add_Goto (Table.States (671), 215, 183);
+ Add_Goto (Table.States (671), 218, 184);
+ Add_Goto (Table.States (671), 219, 185);
+ Add_Goto (Table.States (671), 220, 186);
+ Add_Goto (Table.States (671), 228, 1003);
+ Add_Goto (Table.States (671), 231, 189);
+ Add_Goto (Table.States (671), 232, 190);
+ Add_Goto (Table.States (671), 233, 191);
+ Add_Goto (Table.States (671), 234, 192);
+ Add_Goto (Table.States (671), 237, 193);
+ Add_Goto (Table.States (671), 251, 58);
+ Add_Goto (Table.States (671), 252, 59);
+ Add_Goto (Table.States (671), 255, 60);
+ Add_Goto (Table.States (671), 256, 194);
+ Add_Goto (Table.States (671), 268, 68);
+ Add_Goto (Table.States (671), 311, 83);
+ Add_Goto (Table.States (671), 402, 195);
+ Add_Goto (Table.States (671), 465, 196);
+ Table.States (671).Kernel := To_Vector ((0 => ((226, 1), 48, 1,
(32767, 0), 0)));
+ Table.States (671).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (672).Action_List.Set_Capacity (20);
+ Add_Action (Table.States (672), (33, 36, 41, 43, 44, 48, 49, 50,
61, 63, 72, 74, 75, 82, 87, 88, 91, 95,
+ 99, 108), (230, 1), 1);
+ Table.States (672).Kernel := To_Vector ((0 => ((230, 1), 140, 0,
(230, 1), 1)));
+ Table.States (672).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (230, 1), 1)));
+ Table.States (673).Action_List.Set_Capacity (33);
+ Add_Action (Table.States (673), 33, Reduce, (234, 3), 1);
+ Add_Action (Table.States (673), 36, Reduce, (234, 3), 1);
+ Add_Action (Table.States (673), 41, Reduce, (234, 3), 1);
+ Add_Action (Table.States (673), 43, Reduce, (234, 3), 1);
+ Add_Action (Table.States (673), 44, Reduce, (234, 3), 1);
+ Add_Action (Table.States (673), 45, Reduce, (234, 3), 1);
+ Add_Action (Table.States (673), 48, Reduce, (234, 3), 1);
+ Add_Action (Table.States (673), 49, Reduce, (234, 3), 1);
+ Add_Action (Table.States (673), 50, Reduce, (234, 3), 1);
+ Add_Action (Table.States (673), 61, Reduce, (234, 3), 1);
+ Add_Action (Table.States (673), 63, Reduce, (234, 3), 1);
+ Add_Action (Table.States (673), 72, Reduce, (234, 3), 1);
+ Add_Action (Table.States (673), 73, Reduce, (234, 3), 1);
+ Add_Action (Table.States (673), 74, Reduce, (234, 3), 1);
+ Add_Action (Table.States (673), 75, Reduce, (234, 3), 1);
+ Add_Action (Table.States (673), 82, Reduce, (234, 3), 1);
+ Add_Action (Table.States (673), 85, (198, 0), 281);
+ Add_Action (Table.States (673), 87, Reduce, (234, 3), 1);
+ Add_Action (Table.States (673), 88, Reduce, (234, 3), 1);
+ Add_Action (Table.States (673), 89, Reduce, (234, 3), 1);
+ Add_Action (Table.States (673), 91, Reduce, (234, 3), 1);
+ Add_Action (Table.States (673), 95, Reduce, (234, 3), 1);
+ Add_Action (Table.States (673), 96, (197, 0), 283);
+ Add_Action (Table.States (673), 97, Reduce, (234, 3), 1);
+ Add_Action (Table.States (673), 99, Reduce, (234, 3), 1);
+ Add_Action (Table.States (673), 106, Reduce, (234, 3), 1);
+ Add_Action (Table.States (673), 107, Reduce, (234, 3), 1);
+ Add_Action (Table.States (673), 108, Reduce, (234, 3), 1);
+ Add_Action (Table.States (673), 109, Reduce, (234, 3), 1);
+ Add_Action (Table.States (673), 111, Reduce, (234, 3), 1);
+ Add_Action (Table.States (673), 112, Reduce, (234, 3), 1);
+ Add_Action (Table.States (673), 113, (121, 0), 285);
+ Add_Action (Table.States (673), 114, (121, 1), 286);
+ Table.States (673).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (673), 121, 638);
+ Add_Goto (Table.States (673), 313, 289);
+ Table.States (673).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((203, 0), 195, 2,
+ (32767, 0), 0), ((234, 3), 195, 0, (234, 3), 1), ((255, 0),
195, 3, (32767, 0), 0), ((311, 0), 195,
+ 3, (32767, 0), 0)));
+ Table.States (673).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (234, 3), 1)));
+ Table.States (674).Action_List.Set_Capacity (20);
+ Add_Action (Table.States (674), 33, Reduce, (228, 3), 3);
+ Add_Action (Table.States (674), 36, Reduce, (228, 3), 3);
+ Add_Action (Table.States (674), 41, Reduce, (228, 3), 3);
+ Add_Action (Table.States (674), 43, Reduce, (228, 3), 3);
+ Add_Action (Table.States (674), 44, Reduce, (228, 3), 3);
+ Add_Action (Table.States (674), 48, Reduce, (228, 3), 3);
+ Add_Action (Table.States (674), 49, Reduce, (228, 3), 3);
+ Add_Action (Table.States (674), 50, Reduce, (228, 3), 3);
+ Add_Action (Table.States (674), 61, Reduce, (228, 3), 3);
+ Add_Action (Table.States (674), 63, Reduce, (228, 3), 3);
+ Add_Action (Table.States (674), 72, Reduce, (228, 3), 3);
+ Add_Action (Table.States (674), 74, Reduce, (228, 3), 3);
+ Add_Action (Table.States (674), 75, Reduce, (228, 3), 3);
+ Add_Action (Table.States (674), 82, Reduce, (228, 3), 3);
+ Add_Action (Table.States (674), 87, Reduce, (228, 3), 3);
+ Add_Action (Table.States (674), 88, Reduce, (228, 3), 3);
+ Add_Action (Table.States (674), 91, (229, 1), 1004);
+ Add_Conflict (Table.States (674), 91, (228, 3), 3);
+ Add_Action (Table.States (674), 95, Reduce, (228, 3), 3);
+ Add_Action (Table.States (674), 99, Reduce, (228, 3), 3);
+ Add_Action (Table.States (674), 108, Reduce, (228, 3), 3);
+ Table.States (674).Kernel := To_Vector ((((228, 3), 229, 0,
(228, 3), 3), ((229, 1), 229, 2, (32767,
+ 0), 0), ((229, 2), 229, 2, (32767, 0), 0)));
+ Table.States (674).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (228, 3), 3)));
+ Table.States (675).Action_List.Set_Capacity (20);
+ Add_Action (Table.States (675), (33, 36, 41, 43, 44, 48, 49, 50,
61, 63, 72, 74, 75, 82, 87, 88, 91, 95,
+ 99, 108), (229, 0), 1);
+ Table.States (675).Kernel := To_Vector ((0 => ((229, 0), 230, 0,
(229, 0), 1)));
+ Table.States (675).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (229, 0), 1)));
+ Table.States (676).Action_List.Set_Capacity (21);
+ Add_Action (Table.States (676), 33, Reduce, (230, 0), 1);
+ Add_Action (Table.States (676), 36, Reduce, (230, 0), 1);
+ Add_Action (Table.States (676), 41, Reduce, (230, 0), 1);
+ Add_Action (Table.States (676), 43, Reduce, (230, 0), 1);
+ Add_Action (Table.States (676), 44, Reduce, (230, 0), 1);
+ Add_Action (Table.States (676), 48, Reduce, (230, 0), 1);
+ Add_Action (Table.States (676), 49, Reduce, (230, 0), 1);
+ Add_Action (Table.States (676), 50, Reduce, (230, 0), 1);
+ Add_Action (Table.States (676), 61, Reduce, (230, 0), 1);
+ Add_Action (Table.States (676), 63, Reduce, (230, 0), 1);
+ Add_Action (Table.States (676), 72, Reduce, (230, 0), 1);
+ Add_Action (Table.States (676), 74, Reduce, (230, 0), 1);
+ Add_Action (Table.States (676), 75, Reduce, (230, 0), 1);
+ Add_Action (Table.States (676), 82, Reduce, (230, 0), 1);
+ Add_Action (Table.States (676), 87, Reduce, (230, 0), 1);
+ Add_Action (Table.States (676), 88, Reduce, (230, 0), 1);
+ Add_Action (Table.States (676), 91, Reduce, (230, 0), 1);
+ Add_Action (Table.States (676), 95, Reduce, (230, 0), 1);
+ Add_Action (Table.States (676), 97, (140, 1), 653);
+ Add_Action (Table.States (676), 99, Reduce, (230, 0), 1);
+ Add_Action (Table.States (676), 108, Reduce, (230, 0), 1);
+ Table.States (676).Kernel := To_Vector ((((140, 1), 231, 2,
(32767, 0), 0), ((230, 0), 231, 0, (230,
+ 0), 1)));
+ Table.States (676).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (230, 0), 1)));
+ Table.States (677).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (677), 46, (233, 2), 167);
+ Add_Action (Table.States (677), 52, (233, 3), 168);
+ Add_Action (Table.States (677), 65, (234, 1), 169);
+ Add_Action (Table.States (677), 76, (256, 0), 170);
+ Add_Action (Table.States (677), 85, (205, 4), 171);
+ Add_Action (Table.States (677), 86, (213, 2), 172);
+ Add_Action (Table.States (677), 90, (268, 0), 34);
+ Add_Action (Table.States (677), 106, (237, 1), 173);
+ Add_Action (Table.States (677), 107, (237, 0), 174);
+ Add_Action (Table.States (677), 115, (234, 0), 175);
+ Add_Action (Table.States (677), 116, (196, 0), 146);
+ Add_Action (Table.States (677), 117, (196, 1), 37);
+ Add_Action (Table.States (677), 118, (195, 6), 38);
+ Table.States (677).Goto_List.Set_Capacity (32);
+ Add_Goto (Table.States (677), 140, 672);
+ Add_Goto (Table.States (677), 195, 673);
+ Add_Goto (Table.States (677), 196, 148);
+ Add_Goto (Table.States (677), 197, 54);
+ Add_Goto (Table.States (677), 198, 55);
+ Add_Goto (Table.States (677), 199, 56);
+ Add_Goto (Table.States (677), 201, 57);
+ Add_Goto (Table.States (677), 203, 369);
+ Add_Goto (Table.States (677), 205, 177);
+ Add_Goto (Table.States (677), 206, 178);
+ Add_Goto (Table.States (677), 210, 179);
+ Add_Goto (Table.States (677), 211, 180);
+ Add_Goto (Table.States (677), 213, 181);
+ Add_Goto (Table.States (677), 214, 182);
+ Add_Goto (Table.States (677), 215, 183);
+ Add_Goto (Table.States (677), 218, 184);
+ Add_Goto (Table.States (677), 219, 185);
+ Add_Goto (Table.States (677), 220, 186);
+ Add_Goto (Table.States (677), 229, 1005);
+ Add_Goto (Table.States (677), 230, 675);
+ Add_Goto (Table.States (677), 231, 676);
+ Add_Goto (Table.States (677), 232, 190);
+ Add_Goto (Table.States (677), 233, 191);
+ Add_Goto (Table.States (677), 234, 192);
+ Add_Goto (Table.States (677), 237, 193);
+ Add_Goto (Table.States (677), 251, 58);
+ Add_Goto (Table.States (677), 252, 59);
+ Add_Goto (Table.States (677), 255, 60);
+ Add_Goto (Table.States (677), 256, 194);
+ Add_Goto (Table.States (677), 268, 68);
+ Add_Goto (Table.States (677), 311, 83);
+ Add_Goto (Table.States (677), 465, 196);
+ Table.States (677).Kernel := To_Vector ((0 => ((228, 2), 47, 1,
(32767, 0), 0)));
+ Table.States (677).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (678).Action_List.Set_Capacity (20);
+ Add_Action (Table.States (678), (33, 36, 41, 43, 44, 48, 49, 50,
61, 63, 72, 74, 75, 82, 87, 88, 91, 95,
+ 99, 108), (228, 0), 3);
+ Table.States (678).Kernel := To_Vector ((0 => ((228, 0), 231, 0,
(228, 0), 3)));
+ Table.States (678).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (228, 0), 3)));
+ Table.States (679).Action_List.Set_Capacity (38);
+ Add_Action (Table.States (679), (33, 36, 41, 43, 44, 45, 47, 48,
49, 50, 52, 61, 63, 69, 72, 73, 74, 75,
+ 82, 87, 88, 89, 91, 94, 95, 97, 98, 99, 100, 101, 103, 104, 106,
107, 108, 109, 110, 111), (232, 2), 3);
+ Table.States (679).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (679), 238, 413);
+ Table.States (679).Kernel := To_Vector ((((232, 1), 232, 2,
(32767, 0), 0), ((232, 2), 232, 0, (232,
+ 2), 3), ((232, 2), 232, 2, (32767, 0), 0)));
+ Table.States (679).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (232, 2), 3)));
+ Table.States (680).Action_List.Set_Capacity (38);
+ Add_Action (Table.States (680), (33, 36, 41, 43, 44, 45, 47, 48,
49, 50, 52, 61, 63, 69, 72, 73, 74, 75,
+ 82, 87, 88, 89, 91, 94, 95, 97, 98, 99, 100, 101, 103, 104, 106,
107, 108, 109, 110, 111), (232, 1), 3);
+ Table.States (680).Kernel := To_Vector ((((232, 0), 233, 0,
(232, 0), 1), ((232, 1), 233, 0, (232, 1),
+ 3)));
+ Table.States (680).Minimal_Complete_Actions := To_Vector
(((Reduce, (232, 0), 1), (Reduce, (232, 1),
+ 3)));
+ Table.States (681).Action_List.Set_Capacity (38);
+ Add_Action (Table.States (681), (33, 36, 41, 43, 44, 45, 47, 48,
49, 50, 52, 61, 63, 69, 72, 73, 74, 75,
+ 82, 87, 88, 89, 91, 94, 95, 97, 98, 99, 100, 101, 103, 104, 106,
107, 108, 109, 110, 111), (233, 0), 3);
+ Table.States (681).Kernel := To_Vector ((0 => ((233, 0), 234, 0,
(233, 0), 3)));
+ Table.States (681).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (233, 0), 3)));
+ Table.States (682).Action_List.Set_Capacity (38);
+ Add_Action (Table.States (682), 33, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 36, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 41, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 43, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 44, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 45, (238, 3), 409);
+ Add_Action (Table.States (682), 47, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 48, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 49, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 50, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 52, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 61, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 63, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 69, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 72, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 73, (238, 2), 410);
+ Add_Action (Table.States (682), 74, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 75, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 82, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 87, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 88, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 89, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 91, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 94, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 95, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 97, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 98, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 99, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 100, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 101, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 103, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 104, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 106, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 107, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 108, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 109, (238, 1), 411);
+ Add_Action (Table.States (682), 110, Reduce, (465, 1), 3);
+ Add_Action (Table.States (682), 111, (238, 0), 412);
+ Table.States (682).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (682), 238, 413);
+ Table.States (682).Kernel := To_Vector ((((232, 1), 232, 2,
(32767, 0), 0), ((232, 2), 232, 2, (32767,
+ 0), 0), ((465, 0), 232, 0, (465, 0), 1), ((465, 1), 232, 0,
(465, 1), 3)));
+ Table.States (682).Minimal_Complete_Actions := To_Vector
(((Reduce, (465, 0), 1), (Reduce, (465, 1),
+ 3)));
+ Table.States (683).Action_List.Set_Capacity (34);
+ Add_Action (Table.States (683), (33, 36, 41, 43, 44, 47, 48, 49,
50, 52, 61, 63, 69, 72, 74, 75, 82, 87,
+ 88, 89, 91, 94, 95, 97, 98, 99, 100, 101, 103, 104, 106, 107, 108,
110), (465, 2), 3);
+ Table.States (683).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (683), 236, 419);
+ Table.States (683).Kernel := To_Vector ((((465, 1), 465, 2,
(32767, 0), 0), ((465, 2), 465, 0, (465,
+ 2), 3), ((465, 2), 465, 2, (32767, 0), 0)));
+ Table.States (683).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (465, 2), 3)));
+ Table.States (684).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (684), 85, (198, 0), 281);
+ Add_Action (Table.States (684), 87, Reduce, (306, 1), 3);
+ Add_Action (Table.States (684), 95, Reduce, (306, 1), 3);
+ Add_Action (Table.States (684), 96, (197, 0), 283);
+ Add_Action (Table.States (684), 108, Reduce, (306, 1), 3);
+ Add_Action (Table.States (684), 113, (121, 0), 285);
+ Add_Action (Table.States (684), 114, (121, 1), 286);
+ Table.States (684).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (684), 121, 287);
+ Add_Goto (Table.States (684), 313, 289);
+ Table.States (684).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((306, 0), 195, 0, (306, 0), 1), ((306, 1),
195, 0, (306, 1), 3), ((311, 0), 195,
+ 3, (32767, 0), 0)));
+ Table.States (684).Minimal_Complete_Actions := To_Vector
(((Reduce, (306, 0), 1), (Reduce, (306, 1),
+ 3)));
+ Table.States (685).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (685), (87, 95, 108), (306, 2), 3);
+ Table.States (685).Kernel := To_Vector ((((306, 1), 306, 2,
(32767, 0), 0), ((306, 2), 306, 0, (306,
+ 2), 3), ((306, 2), 306, 2, (32767, 0), 0)));
+ Table.States (685).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (306, 2), 3)));
+ Table.States (686).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (686), 108, (363, 0), 1006);
+ Table.States (686).Kernel := To_Vector ((0 => ((363, 0), 18, 1,
(32767, 0), 0)));
+ Table.States (686).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (363, 0), 108, 1006)));
+ Table.States (687).Action_List.Set_Capacity (32);
+ Add_Action (Table.States (687), 45, Reduce, (196, 0), 1);
+ Add_Action (Table.States (687), 47, Reduce, (196, 0), 1);
+ Add_Action (Table.States (687), 48, Reduce, (196, 0), 1);
+ Add_Action (Table.States (687), 49, Reduce, (196, 0), 1);
+ Add_Action (Table.States (687), 52, Reduce, (196, 0), 1);
+ Add_Action (Table.States (687), 71, Reduce, (196, 0), 1);
+ Add_Action (Table.States (687), 72, Reduce, (196, 0), 1);
+ Add_Action (Table.States (687), 73, Reduce, (196, 0), 1);
+ Add_Action (Table.States (687), 74, Reduce, (196, 0), 1);
+ Add_Action (Table.States (687), 75, Reduce, (196, 0), 1);
+ Add_Action (Table.States (687), 85, Reduce, (196, 0), 1);
+ Add_Action (Table.States (687), 87, Reduce, (196, 0), 1);
+ Add_Action (Table.States (687), 89, Reduce, (196, 0), 1);
+ Add_Action (Table.States (687), 91, Reduce, (196, 0), 1);
+ Add_Action (Table.States (687), 93, Reduce, (136, 0), 1);
+ Add_Action (Table.States (687), 95, Reduce, (136, 0), 1);
+ Add_Conflict (Table.States (687), 95, (196, 0), 1);
+ Add_Action (Table.States (687), 96, Reduce, (196, 0), 1);
+ Add_Action (Table.States (687), 97, Reduce, (196, 0), 1);
+ Add_Action (Table.States (687), 98, Reduce, (196, 0), 1);
+ Add_Action (Table.States (687), 99, Reduce, (196, 0), 1);
+ Add_Action (Table.States (687), 100, Reduce, (196, 0), 1);
+ Add_Action (Table.States (687), 101, Reduce, (196, 0), 1);
+ Add_Action (Table.States (687), 103, Reduce, (196, 0), 1);
+ Add_Action (Table.States (687), 104, Reduce, (196, 0), 1);
+ Add_Action (Table.States (687), 106, Reduce, (196, 0), 1);
+ Add_Action (Table.States (687), 107, Reduce, (196, 0), 1);
+ Add_Action (Table.States (687), 109, Reduce, (196, 0), 1);
+ Add_Action (Table.States (687), 110, Reduce, (196, 0), 1);
+ Add_Action (Table.States (687), 111, Reduce, (196, 0), 1);
+ Add_Action (Table.States (687), 112, Reduce, (196, 0), 1);
+ Add_Action (Table.States (687), 113, Reduce, (196, 0), 1);
+ Add_Action (Table.States (687), 114, Reduce, (196, 0), 1);
+ Table.States (687).Kernel := To_Vector ((((136, 0), 116, 0,
(136, 0), 1), ((196, 0), 116, 0, (196, 0),
+ 1)));
+ Table.States (687).Minimal_Complete_Actions := To_Vector
(((Reduce, (136, 0), 1), (Reduce, (196, 0),
+ 1)));
+ end Subr_28;
+ procedure Subr_29
+ is begin
+ Table.States (688).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (688), 93, (300, 0), 749);
+ Add_Action (Table.States (688), 95, (136, 1), 280);
+ Table.States (688).Kernel := To_Vector ((((136, 1), 136, 2,
(32767, 0), 0), ((300, 0), 136, 7, (32767,
+ 0), 0), ((300, 1), 136, 5, (32767, 0), 0), ((300, 2), 136,
5, (32767, 0), 0), ((300, 3), 136, 3,
+ (32767, 0), 0), ((300, 4), 136, 6, (32767, 0), 0), ((300, 5),
136, 4, (32767, 0), 0), ((300, 6),
+ 136, 4, (32767, 0), 0), ((300, 7), 136, 2, (32767, 0), 0),
((300, 8), 136, 5, (32767, 0), 0),
+ ((300, 9), 136, 3, (32767, 0), 0)));
+ Table.States (688).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (300, 0), 93, 749)));
+ Table.States (689).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (689), (1 => 87), (358, 0), 1);
+ Table.States (689).Kernel := To_Vector ((0 => ((358, 0), 227, 0,
(358, 0), 1)));
+ Table.States (689).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (358, 0), 1)));
+ Table.States (690).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (690), 87, (357, 0), 1007);
+ Table.States (690).Kernel := To_Vector ((((357, 0), 358, 6,
(32767, 0), 0), ((357, 1), 358, 2, (32767,
+ 0), 0)));
+ Table.States (690).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (357, 0), 87, 1007)));
+ Table.States (691).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (691), 12, (401, 0), 1);
+ Add_Action (Table.States (691), 15, (370, 0), 3);
+ Add_Action (Table.States (691), 17, (365, 0), 4);
+ Add_Action (Table.States (691), 18, (382, 0), 5);
+ Add_Action (Table.States (691), 19, (363, 0), 6);
+ Add_Action (Table.States (691), 20, (357, 0), 7);
+ Add_Action (Table.States (691), 30, (316, 0), 13);
+ Add_Action (Table.States (691), 31, (290, 0), 14);
+ Add_Action (Table.States (691), 32, (289, 0), 15);
+ Add_Action (Table.States (691), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (691), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (691), 37, (288, 0), 17);
+ Add_Conflict (Table.States (691), 37, (285, 1), 0);
+ Add_Action (Table.States (691), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (691), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (691), 42, (271, 0), 18);
+ Add_Action (Table.States (691), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (691), 64, (273, 0), 27);
+ Add_Action (Table.States (691), 65, (264, 0), 28);
+ Add_Action (Table.States (691), 84, (124, 0), 32);
+ Add_Action (Table.States (691), 86, (252, 0), 33);
+ Add_Action (Table.States (691), 90, (268, 0), 34);
+ Add_Action (Table.States (691), 105, (265, 0), 35);
+ Add_Action (Table.States (691), 116, (196, 0), 146);
+ Add_Action (Table.States (691), 117, (196, 1), 37);
+ Add_Action (Table.States (691), 118, (195, 6), 38);
+ Table.States (691).Goto_List.Set_Capacity (46);
+ Add_Goto (Table.States (691), 124, 39);
+ Add_Goto (Table.States (691), 195, 52);
+ Add_Goto (Table.States (691), 196, 53);
+ Add_Goto (Table.States (691), 197, 54);
+ Add_Goto (Table.States (691), 198, 55);
+ Add_Goto (Table.States (691), 199, 56);
+ Add_Goto (Table.States (691), 201, 57);
+ Add_Goto (Table.States (691), 251, 58);
+ Add_Goto (Table.States (691), 252, 59);
+ Add_Goto (Table.States (691), 255, 60);
+ Add_Goto (Table.States (691), 259, 452);
+ Add_Goto (Table.States (691), 261, 331);
+ Add_Goto (Table.States (691), 262, 62);
+ Add_Goto (Table.States (691), 263, 63);
+ Add_Goto (Table.States (691), 264, 64);
+ Add_Goto (Table.States (691), 265, 65);
+ Add_Goto (Table.States (691), 266, 66);
+ Add_Goto (Table.States (691), 267, 67);
+ Add_Goto (Table.States (691), 268, 68);
+ Add_Goto (Table.States (691), 271, 69);
+ Add_Goto (Table.States (691), 273, 70);
+ Add_Goto (Table.States (691), 275, 71);
+ Add_Goto (Table.States (691), 285, 72);
+ Add_Goto (Table.States (691), 286, 73);
+ Add_Goto (Table.States (691), 288, 74);
+ Add_Goto (Table.States (691), 289, 75);
+ Add_Goto (Table.States (691), 290, 76);
+ Add_Goto (Table.States (691), 310, 82);
+ Add_Goto (Table.States (691), 311, 83);
+ Add_Goto (Table.States (691), 316, 84);
+ Add_Goto (Table.States (691), 318, 85);
+ Add_Goto (Table.States (691), 357, 110);
+ Add_Goto (Table.States (691), 363, 111);
+ Add_Goto (Table.States (691), 364, 112);
+ Add_Goto (Table.States (691), 365, 113);
+ Add_Goto (Table.States (691), 366, 114);
+ Add_Goto (Table.States (691), 367, 115);
+ Add_Goto (Table.States (691), 370, 116);
+ Add_Goto (Table.States (691), 376, 117);
+ Add_Goto (Table.States (691), 378, 118);
+ Add_Goto (Table.States (691), 379, 119);
+ Add_Goto (Table.States (691), 382, 120);
+ Add_Goto (Table.States (691), 396, 1008);
+ Add_Goto (Table.States (691), 401, 133);
+ Add_Goto (Table.States (691), 461, 332);
+ Add_Goto (Table.States (691), 462, 144);
+ Table.States (691).Kernel := To_Vector ((0 => ((357, 2), 33, 4,
(32767, 0), 0)));
+ Table.States (691).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ Table.States (692).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (692), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (357, 3), 4);
+ Table.States (692).Kernel := To_Vector ((0 => ((357, 3), 108, 0,
(357, 3), 4)));
+ Table.States (692).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (357, 3), 4)));
+ Table.States (693).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (693), (36, 50, 63, 87, 95, 99), (160,
0), 1);
+ Table.States (693).Kernel := To_Vector ((0 => ((160, 0), 131, 0,
(160, 0), 1)));
+ Table.States (693).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (160, 0), 1)));
+ Table.States (694).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (694), (36, 50, 63, 87, 95, 99), (160,
1), 1);
+ Table.States (694).Kernel := To_Vector ((0 => ((160, 1), 140, 0,
(160, 1), 1)));
+ Table.States (694).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (160, 1), 1)));
+ Table.States (695).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (695), 87, (356, 4), 1009);
+ Table.States (695).Kernel := To_Vector ((((356, 4), 160, 4,
(32767, 0), 0), ((356, 5), 160, 2, (32767,
+ 0), 0)));
+ Table.States (695).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (356, 4), 87, 1009)));
+ Table.States (696).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (696), 97, (140, 1), 653);
+ Table.States (696).Kernel := To_Vector ((0 => ((140, 1), 231, 2,
(32767, 0), 0)));
+ Table.States (696).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (140, 1), 97, 653)));
+ Table.States (697).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (697), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (356, 7), 4);
+ Table.States (697).Kernel := To_Vector ((0 => ((356, 7), 108, 0,
(356, 7), 4)));
+ Table.States (697).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (356, 7), 4)));
+ Table.States (698).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (698), 108, (356, 6), 1010);
+ Table.States (698).Kernel := To_Vector ((0 => ((356, 6), 434, 1,
(32767, 0), 0)));
+ Table.States (698).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (356, 6), 108, 1010)));
+ Table.States (699).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (699), 86, (252, 0), 33);
+ Add_Action (Table.States (699), 90, (268, 0), 34);
+ Add_Action (Table.States (699), 116, (196, 0), 146);
+ Add_Action (Table.States (699), 117, (196, 1), 37);
+ Add_Action (Table.States (699), 118, (195, 6), 38);
+ Table.States (699).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (699), 195, 1011);
+ Add_Goto (Table.States (699), 196, 148);
+ Add_Goto (Table.States (699), 197, 54);
+ Add_Goto (Table.States (699), 198, 55);
+ Add_Goto (Table.States (699), 199, 56);
+ Add_Goto (Table.States (699), 201, 57);
+ Add_Goto (Table.States (699), 251, 58);
+ Add_Goto (Table.States (699), 252, 59);
+ Add_Goto (Table.States (699), 255, 60);
+ Add_Goto (Table.States (699), 268, 68);
+ Add_Goto (Table.States (699), 311, 83);
+ Table.States (699).Kernel := To_Vector ((((339, 0), 24, 4,
(32767, 0), 0), ((339, 1), 24, 2, (32767,
+ 0), 0)));
+ Table.States (699).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (700).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (700), 86, (252, 0), 33);
+ Add_Action (Table.States (700), 90, (268, 0), 34);
+ Add_Action (Table.States (700), 116, (196, 0), 146);
+ Add_Action (Table.States (700), 117, (196, 1), 37);
+ Add_Action (Table.States (700), 118, (195, 6), 38);
+ Table.States (700).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (700), 195, 1012);
+ Add_Goto (Table.States (700), 196, 148);
+ Add_Goto (Table.States (700), 197, 54);
+ Add_Goto (Table.States (700), 198, 55);
+ Add_Goto (Table.States (700), 199, 56);
+ Add_Goto (Table.States (700), 201, 57);
+ Add_Goto (Table.States (700), 251, 58);
+ Add_Goto (Table.States (700), 252, 59);
+ Add_Goto (Table.States (700), 255, 60);
+ Add_Goto (Table.States (700), 268, 68);
+ Add_Goto (Table.States (700), 311, 83);
+ Table.States (700).Kernel := To_Vector ((((339, 4), 24, 4,
(32767, 0), 0), ((339, 5), 24, 2, (32767,
+ 0), 0)));
+ Table.States (700).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (701).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (701), 86, (252, 0), 33);
+ Add_Action (Table.States (701), 90, (268, 0), 34);
+ Add_Action (Table.States (701), 116, (196, 0), 146);
+ Add_Action (Table.States (701), 117, (196, 1), 37);
+ Add_Action (Table.States (701), 118, (195, 6), 38);
+ Table.States (701).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (701), 195, 1013);
+ Add_Goto (Table.States (701), 196, 148);
+ Add_Goto (Table.States (701), 197, 54);
+ Add_Goto (Table.States (701), 198, 55);
+ Add_Goto (Table.States (701), 199, 56);
+ Add_Goto (Table.States (701), 201, 57);
+ Add_Goto (Table.States (701), 251, 58);
+ Add_Goto (Table.States (701), 252, 59);
+ Add_Goto (Table.States (701), 255, 60);
+ Add_Goto (Table.States (701), 268, 68);
+ Add_Goto (Table.States (701), 311, 83);
+ Table.States (701).Kernel := To_Vector ((((339, 2), 24, 4,
(32767, 0), 0), ((339, 3), 24, 2, (32767,
+ 0), 0)));
+ Table.States (701).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (702).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (702), 82, (430, 0), 1014);
+ Table.States (702).Kernel := To_Vector ((((430, 0), 116, 6,
(32767, 0), 0), ((430, 1), 116, 4, (32767,
+ 0), 0)));
+ Table.States (702).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (430, 0), 82, 1014)));
+ Table.States (703).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (703), 65, (428, 2), 1015);
+ Add_Action (Table.States (703), 78, (427, 0), 1016);
+ Add_Action (Table.States (703), 86, (252, 0), 33);
+ Add_Action (Table.States (703), 90, (268, 0), 34);
+ Add_Action (Table.States (703), 92, (428, 1), 1017);
+ Add_Action (Table.States (703), 116, (196, 0), 146);
+ Add_Action (Table.States (703), 117, (196, 1), 37);
+ Add_Action (Table.States (703), 118, (195, 6), 38);
+ Table.States (703).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (703), 195, 1018);
+ Add_Goto (Table.States (703), 196, 148);
+ Add_Goto (Table.States (703), 197, 54);
+ Add_Goto (Table.States (703), 198, 55);
+ Add_Goto (Table.States (703), 199, 56);
+ Add_Goto (Table.States (703), 201, 57);
+ Add_Goto (Table.States (703), 251, 58);
+ Add_Goto (Table.States (703), 252, 59);
+ Add_Goto (Table.States (703), 255, 60);
+ Add_Goto (Table.States (703), 268, 68);
+ Add_Goto (Table.States (703), 311, 83);
+ Add_Goto (Table.States (703), 428, 1019);
+ Add_Goto (Table.States (703), 429, 1020);
+ Table.States (703).Kernel := To_Vector ((((426, 0), 82, 4,
(32767, 0), 0), ((426, 1), 82, 2, (32767,
+ 0), 0), ((427, 0), 82, 5, (32767, 0), 0), ((427, 1), 82, 3,
(32767, 0), 0), ((427, 2), 82, 4,
+ (32767, 0), 0), ((427, 3), 82, 2, (32767, 0), 0)));
+ Table.States (703).Minimal_Complete_Actions := To_Vector (((Shift,
(196, 0), 116, 146), (Shift, (427, 0),
+ 78, 1016)));
+ Table.States (704).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (704), (28, 50, 53, 54, 61, 83, 84, 116),
(426, 3), 3);
+ Table.States (704).Kernel := To_Vector ((0 => ((426, 3), 108, 0,
(426, 3), 3)));
+ Table.States (704).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (426, 3), 3)));
+ Table.States (705).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (705), 108, (426, 2), 1021);
+ Table.States (705).Kernel := To_Vector ((0 => ((426, 2), 434, 1,
(32767, 0), 0)));
+ Table.States (705).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (426, 2), 108, 1021)));
+ Table.States (706).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (706), 50, (412, 6), 1022);
+ Table.States (706).Kernel := To_Vector ((0 => ((412, 6), 49, 3,
(32767, 0), 0)));
+ Table.States (706).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (412, 6), 50, 1022)));
+ Table.States (707).Action_List.Set_Capacity (17);
+ Add_Action (Table.States (707), 27, (414, 5), 1023);
+ Add_Action (Table.States (707), 52, (187, 0), 347);
+ Add_Action (Table.States (707), 56, (183, 4), 816);
+ Add_Action (Table.States (707), 57, (181, 8), 817);
+ Add_Action (Table.States (707), 58, (181, 6), 1024);
+ Add_Action (Table.States (707), 59, (181, 4), 819);
+ Add_Action (Table.States (707), 60, (181, 2), 820);
+ Add_Action (Table.States (707), 68, (412, 4), 1025);
+ Add_Action (Table.States (707), 70, (156, 0), 519);
+ Add_Action (Table.States (707), 71, (420, 0), 1026);
+ Add_Action (Table.States (707), 72, (419, 0), 1027);
+ Add_Action (Table.States (707), 73, (418, 0), 1028);
+ Add_Action (Table.States (707), 74, (417, 0), 1029);
+ Add_Action (Table.States (707), 76, (415, 15), 1030);
+ Add_Action (Table.States (707), 77, (181, 0), 1031);
+ Add_Action (Table.States (707), 78, (414, 0), 1032);
+ Add_Action (Table.States (707), 85, (416, 0), 1033);
+ Table.States (707).Goto_List.Set_Capacity (19);
+ Add_Goto (Table.States (707), 154, 1034);
+ Add_Goto (Table.States (707), 156, 524);
+ Add_Goto (Table.States (707), 159, 525);
+ Add_Goto (Table.States (707), 181, 1035);
+ Add_Goto (Table.States (707), 183, 1036);
+ Add_Goto (Table.States (707), 184, 848);
+ Add_Goto (Table.States (707), 187, 849);
+ Add_Goto (Table.States (707), 413, 1037);
+ Add_Goto (Table.States (707), 414, 1038);
+ Add_Goto (Table.States (707), 415, 1039);
+ Add_Goto (Table.States (707), 416, 1040);
+ Add_Goto (Table.States (707), 417, 1041);
+ Add_Goto (Table.States (707), 418, 1042);
+ Add_Goto (Table.States (707), 419, 1043);
+ Add_Goto (Table.States (707), 420, 1044);
+ Add_Goto (Table.States (707), 421, 1045);
+ Add_Goto (Table.States (707), 422, 1046);
+ Add_Goto (Table.States (707), 423, 1047);
+ Add_Goto (Table.States (707), 424, 1048);
+ Table.States (707).Kernel := To_Vector ((((411, 4), 82, 7,
(32767, 0), 0), ((411, 5), 82, 5, (32767,
+ 0), 0), ((411, 6), 82, 4, (32767, 0), 0), ((411, 7), 82, 2,
(32767, 0), 0), ((412, 4), 82, 5,
+ (32767, 0), 0), ((412, 5), 82, 2, (32767, 0), 0)));
+ Table.States (707).Minimal_Complete_Actions := To_Vector (((Shift,
(414, 5), 27, 1023), (Shift, (412, 4),
+ 68, 1025)));
+ Table.States (708).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (708), (28, 50, 53, 54, 61, 83, 84, 116),
(412, 7), 3);
+ Table.States (708).Kernel := To_Vector ((0 => ((412, 7), 108, 0,
(412, 7), 3)));
+ Table.States (708).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (412, 7), 3)));
+ Table.States (709).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (709), 49, (412, 2), 1049);
+ Add_Action (Table.States (709), 82, (411, 0), 1050);
+ Add_Action (Table.States (709), 108, (412, 3), 1051);
+ Table.States (709).Kernel := To_Vector ((((411, 0), 164, 8,
(32767, 0), 0), ((411, 1), 164, 6, (32767,
+ 0), 0), ((411, 2), 164, 5, (32767, 0), 0), ((411, 3), 164,
3, (32767, 0), 0), ((412, 0), 164, 6,
+ (32767, 0), 0), ((412, 1), 164, 3, (32767, 0), 0), ((412, 2),
164, 4, (32767, 0), 0), ((412, 3),
+ 164, 1, (32767, 0), 0)));
+ Table.States (709).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (412, 3), 108, 1051)));
+ Table.States (710).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (710), (49, 82, 108), (164, 1), 1);
+ Table.States (710).Kernel := To_Vector ((0 => ((164, 1), 167, 0,
(164, 1), 1)));
+ Table.States (710).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (164, 1), 1)));
+ Table.States (711).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (711), (52, 56, 86, 90, 116, 117, 118),
(301, 3), 1);
+ Table.States (711).Kernel := To_Vector ((0 => ((301, 3), 29, 0,
(301, 3), 1)));
+ Table.States (711).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (301, 3), 1)));
+ Table.States (712).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (712), 29, (301, 2), 1052);
+ Add_Action (Table.States (712), 52, Reduce, (301, 0), 1);
+ Add_Action (Table.States (712), 56, Reduce, (301, 0), 1);
+ Add_Action (Table.States (712), 86, Reduce, (301, 0), 1);
+ Add_Action (Table.States (712), 90, Reduce, (301, 0), 1);
+ Add_Action (Table.States (712), 116, Reduce, (301, 0), 1);
+ Add_Action (Table.States (712), 117, Reduce, (301, 0), 1);
+ Add_Action (Table.States (712), 118, Reduce, (301, 0), 1);
+ Table.States (712).Kernel := To_Vector ((((301, 0), 47, 0, (301,
0), 1), ((301, 2), 47, 1, (32767, 0),
+ 0)));
+ Table.States (712).Minimal_Complete_Actions := To_Vector
(((Reduce, (301, 0), 1), (Shift, (301, 2), 29,
+ 1052)));
+ Table.States (713).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (713), 52, (187, 0), 347);
+ Add_Action (Table.States (713), 56, (188, 2), 514);
+ Add_Action (Table.States (713), 86, (252, 0), 33);
+ Add_Action (Table.States (713), 90, (268, 0), 34);
+ Add_Action (Table.States (713), 116, (196, 0), 146);
+ Add_Action (Table.States (713), 117, (196, 1), 37);
+ Add_Action (Table.States (713), 118, (195, 6), 38);
+ Table.States (713).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (713), 187, 1053);
+ Add_Goto (Table.States (713), 188, 1054);
+ Add_Goto (Table.States (713), 195, 1055);
+ Add_Goto (Table.States (713), 196, 148);
+ Add_Goto (Table.States (713), 197, 54);
+ Add_Goto (Table.States (713), 198, 55);
+ Add_Goto (Table.States (713), 199, 56);
+ Add_Goto (Table.States (713), 201, 57);
+ Add_Goto (Table.States (713), 251, 58);
+ Add_Goto (Table.States (713), 252, 59);
+ Add_Goto (Table.States (713), 255, 60);
+ Add_Goto (Table.States (713), 268, 68);
+ Add_Goto (Table.States (713), 311, 83);
+ Table.States (713).Kernel := To_Vector ((((409, 0), 301, 8,
(32767, 0), 0), ((409, 1), 301, 6, (32767,
+ 0), 0), ((409, 2), 301, 6, (32767, 0), 0), ((409, 3), 301,
4, (32767, 0), 0), ((409, 4), 301, 6,
+ (32767, 0), 0), ((409, 5), 301, 4, (32767, 0), 0), ((409, 6),
301, 4, (32767, 0), 0), ((409, 7),
+ 301, 2, (32767, 0), 0), ((409, 8), 301, 7, (32767, 0), 0),
((409, 9), 301, 5, (32767, 0), 0),
+ ((409, 10), 301, 5, (32767, 0), 0), ((409, 11), 301, 3,
(32767, 0), 0)));
+ Table.States (713).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (714).Action_List.Set_Capacity (42);
+ Add_Action (Table.States (714), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (387,
+ 0), 4);
+ Table.States (714).Kernel := To_Vector ((0 => ((387, 0), 108, 0,
(387, 0), 4)));
+ Table.States (714).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (387, 0), 4)));
+ Table.States (715).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (715), 13, (390, 0), 1056);
+ Table.States (715).Kernel := To_Vector ((((390, 0), 82, 4,
(32767, 0), 0), ((390, 1), 82, 2, (32767,
+ 0), 0)));
+ Table.States (715).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (390, 0), 13, 1056)));
+ Table.States (716).Action_List.Set_Capacity (16);
+ Add_Action (Table.States (716), 22, (339, 0), 9);
+ Add_Action (Table.States (716), 25, (329, 1), 10);
+ Add_Action (Table.States (716), 28, (325, 0), 12);
+ Add_Action (Table.States (716), 38, Reduce, (192, 1), 0);
+ Add_Action (Table.States (716), 50, (332, 0), 19);
+ Add_Action (Table.States (716), 51, (437, 0), 221);
+ Add_Action (Table.States (716), 52, (329, 0), 21);
+ Add_Action (Table.States (716), 53, (294, 0), 22);
+ Add_Action (Table.States (716), 54, (293, 0), 23);
+ Add_Action (Table.States (716), 59, (346, 0), 24);
+ Add_Action (Table.States (716), 60, (340, 0), 25);
+ Add_Action (Table.States (716), 66, Reduce, (192, 1), 0);
+ Add_Action (Table.States (716), 81, (130, 0), 30);
+ Add_Action (Table.States (716), 83, (128, 0), 31);
+ Add_Action (Table.States (716), 84, (124, 0), 32);
+ Add_Action (Table.States (716), 116, (136, 0), 223);
+ Table.States (716).Goto_List.Set_Capacity (60);
+ Add_Goto (Table.States (716), 124, 561);
+ Add_Goto (Table.States (716), 126, 40);
+ Add_Goto (Table.States (716), 127, 41);
+ Add_Goto (Table.States (716), 128, 42);
+ Add_Goto (Table.States (716), 130, 43);
+ Add_Goto (Table.States (716), 135, 44);
+ Add_Goto (Table.States (716), 136, 45);
+ Add_Goto (Table.States (716), 137, 46);
+ Add_Goto (Table.States (716), 180, 47);
+ Add_Goto (Table.States (716), 189, 48);
+ Add_Goto (Table.States (716), 190, 562);
+ Add_Goto (Table.States (716), 191, 563);
+ Add_Goto (Table.States (716), 192, 1057);
+ Add_Goto (Table.States (716), 193, 50);
+ Add_Goto (Table.States (716), 194, 51);
+ Add_Goto (Table.States (716), 291, 77);
+ Add_Goto (Table.States (716), 292, 78);
+ Add_Goto (Table.States (716), 293, 79);
+ Add_Goto (Table.States (716), 294, 80);
+ Add_Goto (Table.States (716), 309, 81);
+ Add_Goto (Table.States (716), 320, 86);
+ Add_Goto (Table.States (716), 321, 87);
+ Add_Goto (Table.States (716), 322, 88);
+ Add_Goto (Table.States (716), 325, 89);
+ Add_Goto (Table.States (716), 326, 90);
+ Add_Goto (Table.States (716), 327, 91);
+ Add_Goto (Table.States (716), 328, 92);
+ Add_Goto (Table.States (716), 329, 225);
+ Add_Goto (Table.States (716), 330, 94);
+ Add_Goto (Table.States (716), 332, 95);
+ Add_Goto (Table.States (716), 333, 96);
+ Add_Goto (Table.States (716), 334, 97);
+ Add_Goto (Table.States (716), 335, 98);
+ Add_Goto (Table.States (716), 336, 99);
+ Add_Goto (Table.States (716), 337, 100);
+ Add_Goto (Table.States (716), 338, 101);
+ Add_Goto (Table.States (716), 339, 102);
+ Add_Goto (Table.States (716), 340, 103);
+ Add_Goto (Table.States (716), 341, 104);
+ Add_Goto (Table.States (716), 345, 105);
+ Add_Goto (Table.States (716), 346, 106);
+ Add_Goto (Table.States (716), 347, 107);
+ Add_Goto (Table.States (716), 354, 108);
+ Add_Goto (Table.States (716), 388, 126);
+ Add_Goto (Table.States (716), 389, 127);
+ Add_Goto (Table.States (716), 390, 128);
+ Add_Goto (Table.States (716), 391, 129);
+ Add_Goto (Table.States (716), 392, 130);
+ Add_Goto (Table.States (716), 394, 132);
+ Add_Goto (Table.States (716), 403, 134);
+ Add_Goto (Table.States (716), 404, 135);
+ Add_Goto (Table.States (716), 405, 136);
+ Add_Goto (Table.States (716), 406, 137);
+ Add_Goto (Table.States (716), 408, 138);
+ Add_Goto (Table.States (716), 431, 139);
+ Add_Goto (Table.States (716), 437, 140);
+ Add_Goto (Table.States (716), 438, 141);
+ Add_Goto (Table.States (716), 440, 142);
+ Add_Goto (Table.States (716), 454, 143);
+ Add_Goto (Table.States (716), 458, 565);
+ Table.States (716).Kernel := To_Vector ((((326, 2), 82, 5,
(32767, 0), 0), ((326, 3), 82, 2, (32767,
+ 0), 0)));
+ Table.States (716).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (192, 1), 0)));
+ end Subr_29;
+ procedure Subr_30
+ is begin
+ Table.States (717).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (717), 82, (326, 0), 1058);
+ Table.States (717).Kernel := To_Vector ((((326, 0), 434, 6,
(32767, 0), 0), ((326, 1), 434, 3, (32767,
+ 0), 0)));
+ Table.States (717).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (326, 0), 82, 1058)));
+ Table.States (718).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (718), 61, (434, 0), 299);
+ Add_Action (Table.States (718), 85, (198, 0), 281);
+ Add_Action (Table.States (718), 96, (197, 0), 283);
+ Add_Action (Table.States (718), 108, (337, 1), 1059);
+ Add_Action (Table.States (718), 113, (121, 0), 285);
+ Add_Action (Table.States (718), 114, (121, 1), 286);
+ Table.States (718).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (718), 121, 287);
+ Add_Goto (Table.States (718), 313, 289);
+ Add_Goto (Table.States (718), 434, 1060);
+ Table.States (718).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0), ((337, 0),
195, 3, (32767, 0), 0), ((337, 1),
+ 195, 1, (32767, 0), 0)));
+ Table.States (718).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (337, 1), 108, 1059)));
+ Table.States (719).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (719), 22, (339, 0), 9);
+ Add_Action (Table.States (719), 25, (329, 1), 10);
+ Add_Action (Table.States (719), 28, (325, 0), 720);
+ Add_Action (Table.States (719), 50, (332, 0), 19);
+ Add_Action (Table.States (719), 51, (437, 0), 221);
+ Add_Action (Table.States (719), 52, (329, 0), 21);
+ Add_Action (Table.States (719), 53, (294, 0), 22);
+ Add_Action (Table.States (719), 54, (293, 0), 23);
+ Add_Action (Table.States (719), 59, (346, 0), 721);
+ Add_Action (Table.States (719), 60, (340, 0), 722);
+ Add_Action (Table.States (719), 66, (325, 10), 1061);
+ Add_Action (Table.States (719), 81, (130, 0), 30);
+ Add_Action (Table.States (719), 83, (128, 0), 31);
+ Add_Action (Table.States (719), 84, (124, 0), 32);
+ Add_Action (Table.States (719), 116, (136, 0), 223);
+ Table.States (719).Goto_List.Set_Capacity (48);
+ Add_Goto (Table.States (719), 124, 725);
+ Add_Goto (Table.States (719), 126, 40);
+ Add_Goto (Table.States (719), 127, 41);
+ Add_Goto (Table.States (719), 128, 42);
+ Add_Goto (Table.States (719), 130, 43);
+ Add_Goto (Table.States (719), 135, 44);
+ Add_Goto (Table.States (719), 136, 45);
+ Add_Goto (Table.States (719), 137, 46);
+ Add_Goto (Table.States (719), 180, 47);
+ Add_Goto (Table.States (719), 189, 48);
+ Add_Goto (Table.States (719), 193, 726);
+ Add_Goto (Table.States (719), 291, 77);
+ Add_Goto (Table.States (719), 292, 727);
+ Add_Goto (Table.States (719), 293, 79);
+ Add_Goto (Table.States (719), 294, 80);
+ Add_Goto (Table.States (719), 320, 86);
+ Add_Goto (Table.States (719), 321, 87);
+ Add_Goto (Table.States (719), 322, 88);
+ Add_Goto (Table.States (719), 323, 728);
+ Add_Goto (Table.States (719), 324, 1062);
+ Add_Goto (Table.States (719), 325, 89);
+ Add_Goto (Table.States (719), 327, 91);
+ Add_Goto (Table.States (719), 328, 92);
+ Add_Goto (Table.States (719), 329, 730);
+ Add_Goto (Table.States (719), 330, 94);
+ Add_Goto (Table.States (719), 332, 95);
+ Add_Goto (Table.States (719), 333, 96);
+ Add_Goto (Table.States (719), 334, 97);
+ Add_Goto (Table.States (719), 335, 98);
+ Add_Goto (Table.States (719), 336, 99);
+ Add_Goto (Table.States (719), 337, 100);
+ Add_Goto (Table.States (719), 338, 101);
+ Add_Goto (Table.States (719), 339, 102);
+ Add_Goto (Table.States (719), 340, 103);
+ Add_Goto (Table.States (719), 341, 104);
+ Add_Goto (Table.States (719), 346, 106);
+ Add_Goto (Table.States (719), 347, 107);
+ Add_Goto (Table.States (719), 394, 132);
+ Add_Goto (Table.States (719), 403, 134);
+ Add_Goto (Table.States (719), 404, 135);
+ Add_Goto (Table.States (719), 405, 136);
+ Add_Goto (Table.States (719), 406, 137);
+ Add_Goto (Table.States (719), 408, 138);
+ Add_Goto (Table.States (719), 431, 139);
+ Add_Goto (Table.States (719), 437, 140);
+ Add_Goto (Table.States (719), 438, 141);
+ Add_Goto (Table.States (719), 440, 142);
+ Add_Goto (Table.States (719), 454, 143);
+ Table.States (719).Kernel := To_Vector ((((325, 9), 27, 4,
(32767, 0), 0), ((325, 10), 27, 1, (32767,
+ 0), 0)));
+ Table.States (719).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (325, 10), 66, 1061)));
+ Table.States (720).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (720), 86, (252, 0), 33);
+ Add_Action (Table.States (720), 90, (268, 0), 34);
+ Add_Action (Table.States (720), 116, (196, 0), 146);
+ Add_Action (Table.States (720), 117, (196, 1), 37);
+ Add_Action (Table.States (720), 118, (195, 6), 38);
+ Table.States (720).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (720), 195, 227);
+ Add_Goto (Table.States (720), 196, 148);
+ Add_Goto (Table.States (720), 197, 54);
+ Add_Goto (Table.States (720), 198, 55);
+ Add_Goto (Table.States (720), 199, 56);
+ Add_Goto (Table.States (720), 201, 57);
+ Add_Goto (Table.States (720), 251, 58);
+ Add_Goto (Table.States (720), 252, 59);
+ Add_Goto (Table.States (720), 255, 60);
+ Add_Goto (Table.States (720), 268, 68);
+ Add_Goto (Table.States (720), 311, 83);
+ Table.States (720).Kernel := To_Vector ((((325, 0), 28, 12,
(32767, 0), 0), ((325, 1), 28, 9, (32767,
+ 0), 0), ((325, 2), 28, 8, (32767, 0), 0), ((325, 3), 28, 9,
(32767, 0), 0), ((325, 4), 28, 6,
+ (32767, 0), 0), ((325, 5), 28, 5, (32767, 0), 0), ((325, 6),
28, 10, (32767, 0), 0), ((325, 7), 28,
+ 7, (32767, 0), 0), ((325, 8), 28, 6, (32767, 0), 0), ((325,
9), 28, 7, (32767, 0), 0), ((325, 10),
+ 28, 4, (32767, 0), 0), ((325, 11), 28, 3, (32767, 0), 0),
((337, 0), 28, 6, (32767, 0), 0), ((337,
+ 1), 28, 4, (32767, 0), 0), ((408, 0), 28, 7, (32767, 0), 0),
((408, 1), 28, 5, (32767, 0), 0)));
+ Table.States (720).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (721).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (721), 83, (346, 0), 259);
+ Add_Action (Table.States (721), 116, (347, 0), 260);
+ Table.States (721).Kernel := To_Vector ((((346, 0), 59, 15,
(32767, 0), 0), ((346, 1), 59, 12, (32767,
+ 0), 0), ((346, 2), 59, 13, (32767, 0), 0), ((346, 3), 59,
10, (32767, 0), 0), ((346, 4), 59, 10,
+ (32767, 0), 0), ((346, 5), 59, 7, (32767, 0), 0), ((346, 6),
59, 8, (32767, 0), 0), ((346, 7), 59,
+ 5, (32767, 0), 0), ((347, 0), 59, 9, (32767, 0), 0), ((347,
1), 59, 6, (32767, 0), 0), ((347, 2),
+ 59, 7, (32767, 0), 0), ((347, 3), 59, 4, (32767, 0), 0)));
+ Table.States (721).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (347, 0), 116, 260)));
+ Table.States (722).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (722), 83, (340, 0), 262);
+ Add_Action (Table.States (722), 116, (341, 0), 263);
+ Table.States (722).Kernel := To_Vector ((((340, 0), 60, 18,
(32767, 0), 0), ((340, 1), 60, 15, (32767,
+ 0), 0), ((340, 2), 60, 10, (32767, 0), 0), ((340, 3), 60,
16, (32767, 0), 0), ((340, 4), 60, 13,
+ (32767, 0), 0), ((340, 5), 60, 8, (32767, 0), 0), ((340, 6),
60, 13, (32767, 0), 0), ((340, 7), 60,
+ 10, (32767, 0), 0), ((340, 8), 60, 5, (32767, 0), 0), ((340,
9), 60, 11, (32767, 0), 0), ((340,
+ 10), 60, 8, (32767, 0), 0), ((340, 11), 60, 3, (32767, 0),
0), ((341, 0), 60, 12, (32767, 0), 0),
+ ((341, 1), 60, 9, (32767, 0), 0), ((341, 2), 60, 4, (32767,
0), 0), ((341, 3), 60, 10, (32767, 0),
+ 0), ((341, 4), 60, 7, (32767, 0), 0), ((341, 5), 60, 2,
(32767, 0), 0)));
+ Table.States (722).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (341, 0), 116, 263)));
+ Table.States (723).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (723), 86, (252, 0), 33);
+ Add_Action (Table.States (723), 90, (268, 0), 34);
+ Add_Action (Table.States (723), 108, Reduce, (308, 1), 0);
+ Add_Action (Table.States (723), 116, (196, 0), 146);
+ Add_Action (Table.States (723), 117, (196, 1), 37);
+ Add_Action (Table.States (723), 118, (195, 6), 38);
+ Table.States (723).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (723), 195, 1063);
+ Add_Goto (Table.States (723), 196, 148);
+ Add_Goto (Table.States (723), 197, 54);
+ Add_Goto (Table.States (723), 198, 55);
+ Add_Goto (Table.States (723), 199, 56);
+ Add_Goto (Table.States (723), 201, 57);
+ Add_Goto (Table.States (723), 251, 58);
+ Add_Goto (Table.States (723), 252, 59);
+ Add_Goto (Table.States (723), 255, 60);
+ Add_Goto (Table.States (723), 268, 68);
+ Add_Goto (Table.States (723), 308, 1064);
+ Add_Goto (Table.States (723), 311, 83);
+ Table.States (723).Kernel := To_Vector ((0 => ((325, 11), 66, 0,
(308, 1), 0)));
+ Table.States (723).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (308, 1), 0)));
+ Table.States (724).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (724), 86, (252, 0), 33);
+ Add_Action (Table.States (724), 90, (268, 0), 34);
+ Add_Action (Table.States (724), 116, (196, 0), 146);
+ Add_Action (Table.States (724), 117, (196, 1), 37);
+ Add_Action (Table.States (724), 118, (195, 6), 38);
+ Table.States (724).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (724), 195, 1065);
+ Add_Goto (Table.States (724), 196, 148);
+ Add_Goto (Table.States (724), 197, 54);
+ Add_Goto (Table.States (724), 198, 55);
+ Add_Goto (Table.States (724), 199, 56);
+ Add_Goto (Table.States (724), 201, 57);
+ Add_Goto (Table.States (724), 251, 58);
+ Add_Goto (Table.States (724), 252, 59);
+ Add_Goto (Table.States (724), 255, 60);
+ Add_Goto (Table.States (724), 268, 68);
+ Add_Goto (Table.States (724), 311, 83);
+ Table.States (724).Kernel := To_Vector ((((408, 0), 76, 4,
(32767, 0), 0), ((408, 1), 76, 2, (32767,
+ 0), 0)));
+ Table.States (724).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (725).Action_List.Set_Capacity (16);
+ Add_Action (Table.States (725), (22, 25, 27, 28, 50, 51, 52, 53,
54, 59, 60, 66, 81, 83, 84, 116), (323,
+ 1), 1);
+ Table.States (725).Kernel := To_Vector ((0 => ((323, 1), 124, 0,
(323, 1), 1)));
+ Table.States (725).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (323, 1), 1)));
+ Table.States (726).Action_List.Set_Capacity (16);
+ Add_Action (Table.States (726), (22, 25, 27, 28, 50, 51, 52, 53,
54, 59, 60, 66, 81, 83, 84, 116), (323,
+ 0), 1);
+ Table.States (726).Kernel := To_Vector ((0 => ((323, 0), 193, 0,
(323, 0), 1)));
+ Table.States (726).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (323, 0), 1)));
+ Table.States (727).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (727), 24, (338, 2), 298);
+ Add_Action (Table.States (727), 61, (434, 0), 299);
+ Add_Action (Table.States (727), 82, (180, 2), 1066);
+ Add_Action (Table.States (727), 108, (291, 3), 301);
+ Table.States (727).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (727), 434, 1067);
+ Table.States (727).Kernel := To_Vector ((((180, 2), 292, 5,
(32767, 0), 0), ((180, 3), 292, 3, (32767,
+ 0), 0), ((291, 2), 292, 3, (32767, 0), 0), ((291, 3), 292,
1, (32767, 0), 0), ((338, 2), 292, 5,
+ (32767, 0), 0), ((338, 3), 292, 3, (32767, 0), 0)));
+ Table.States (727).Minimal_Complete_Actions := To_Vector (((Shift,
(180, 2), 82, 1066), (Shift, (338, 2),
+ 24, 298)));
+ Table.States (728).Action_List.Set_Capacity (16);
+ Add_Action (Table.States (728), (22, 25, 27, 28, 50, 51, 52, 53,
54, 59, 60, 66, 81, 83, 84, 116), (324,
+ 0), 1);
+ Table.States (728).Kernel := To_Vector ((0 => ((324, 0), 323, 0,
(324, 0), 1)));
+ Table.States (728).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (324, 0), 1)));
+ Table.States (729).Action_List.Set_Capacity (16);
+ Add_Action (Table.States (729), 22, (339, 0), 9);
+ Add_Action (Table.States (729), 25, (329, 1), 10);
+ Add_Action (Table.States (729), 27, (325, 6), 1068);
+ Add_Action (Table.States (729), 28, (325, 0), 720);
+ Add_Action (Table.States (729), 50, (332, 0), 19);
+ Add_Action (Table.States (729), 51, (437, 0), 221);
+ Add_Action (Table.States (729), 52, (329, 0), 21);
+ Add_Action (Table.States (729), 53, (294, 0), 22);
+ Add_Action (Table.States (729), 54, (293, 0), 23);
+ Add_Action (Table.States (729), 59, (346, 0), 721);
+ Add_Action (Table.States (729), 60, (340, 0), 722);
+ Add_Action (Table.States (729), 66, (325, 8), 1069);
+ Add_Action (Table.States (729), 81, (130, 0), 30);
+ Add_Action (Table.States (729), 83, (128, 0), 31);
+ Add_Action (Table.States (729), 84, (124, 0), 32);
+ Add_Action (Table.States (729), 116, (136, 0), 223);
+ Table.States (729).Goto_List.Set_Capacity (48);
+ Add_Goto (Table.States (729), 124, 725);
+ Add_Goto (Table.States (729), 126, 40);
+ Add_Goto (Table.States (729), 127, 41);
+ Add_Goto (Table.States (729), 128, 42);
+ Add_Goto (Table.States (729), 130, 43);
+ Add_Goto (Table.States (729), 135, 44);
+ Add_Goto (Table.States (729), 136, 45);
+ Add_Goto (Table.States (729), 137, 46);
+ Add_Goto (Table.States (729), 180, 47);
+ Add_Goto (Table.States (729), 189, 48);
+ Add_Goto (Table.States (729), 193, 726);
+ Add_Goto (Table.States (729), 291, 77);
+ Add_Goto (Table.States (729), 292, 727);
+ Add_Goto (Table.States (729), 293, 79);
+ Add_Goto (Table.States (729), 294, 80);
+ Add_Goto (Table.States (729), 320, 86);
+ Add_Goto (Table.States (729), 321, 87);
+ Add_Goto (Table.States (729), 322, 88);
+ Add_Goto (Table.States (729), 323, 1070);
+ Add_Goto (Table.States (729), 324, 1071);
+ Add_Goto (Table.States (729), 325, 89);
+ Add_Goto (Table.States (729), 327, 91);
+ Add_Goto (Table.States (729), 328, 92);
+ Add_Goto (Table.States (729), 329, 730);
+ Add_Goto (Table.States (729), 330, 94);
+ Add_Goto (Table.States (729), 332, 95);
+ Add_Goto (Table.States (729), 333, 96);
+ Add_Goto (Table.States (729), 334, 97);
+ Add_Goto (Table.States (729), 335, 98);
+ Add_Goto (Table.States (729), 336, 99);
+ Add_Goto (Table.States (729), 337, 100);
+ Add_Goto (Table.States (729), 338, 101);
+ Add_Goto (Table.States (729), 339, 102);
+ Add_Goto (Table.States (729), 340, 103);
+ Add_Goto (Table.States (729), 341, 104);
+ Add_Goto (Table.States (729), 346, 106);
+ Add_Goto (Table.States (729), 347, 107);
+ Add_Goto (Table.States (729), 394, 132);
+ Add_Goto (Table.States (729), 403, 134);
+ Add_Goto (Table.States (729), 404, 135);
+ Add_Goto (Table.States (729), 405, 136);
+ Add_Goto (Table.States (729), 406, 137);
+ Add_Goto (Table.States (729), 408, 138);
+ Add_Goto (Table.States (729), 431, 139);
+ Add_Goto (Table.States (729), 437, 140);
+ Add_Goto (Table.States (729), 438, 141);
+ Add_Goto (Table.States (729), 440, 142);
+ Add_Goto (Table.States (729), 454, 143);
+ Table.States (729).Kernel := To_Vector ((((324, 1), 324, 3,
(32767, 0), 0), ((324, 2), 324, 3, (32767,
+ 0), 0), ((325, 6), 324, 5, (32767, 0), 0), ((325, 7), 324,
2, (32767, 0), 0), ((325, 8), 324, 1,
+ (32767, 0), 0)));
+ Table.States (729).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (325, 8), 66, 1069)));
+ Table.States (730).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (730), 53, (294, 0), 307);
+ Add_Action (Table.States (730), 54, (293, 0), 308);
+ Table.States (730).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (730), 292, 1072);
+ Add_Goto (Table.States (730), 293, 310);
+ Add_Goto (Table.States (730), 294, 311);
+ Table.States (730).Kernel := To_Vector ((((180, 0), 329, 7,
(32767, 0), 0), ((180, 1), 329, 5, (32767,
+ 0), 0), ((291, 0), 329, 5, (32767, 0), 0), ((291, 1), 329,
3, (32767, 0), 0), ((320, 0), 329, 7,
+ (32767, 0), 0), ((320, 1), 329, 5, (32767, 0), 0), ((321, 0),
329, 10, (32767, 0), 0), ((321, 1),
+ 329, 8, (32767, 0), 0), ((338, 0), 329, 7, (32767, 0), 0),
((338, 1), 329, 5, (32767, 0), 0),
+ ((408, 2), 329, 8, (32767, 0), 0), ((408, 3), 329, 6, (32767,
0), 0), ((408, 6), 329, 8, (32767,
+ 0), 0), ((408, 7), 329, 6, (32767, 0), 0)));
+ Table.States (730).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (293, 0), 54, 308)));
+ Table.States (731).Action_List.Set_Capacity (16);
+ Add_Action (Table.States (731), 22, (339, 0), 9);
+ Add_Action (Table.States (731), 25, (329, 1), 10);
+ Add_Action (Table.States (731), 27, (325, 3), 1073);
+ Add_Action (Table.States (731), 28, (325, 0), 720);
+ Add_Action (Table.States (731), 50, (332, 0), 19);
+ Add_Action (Table.States (731), 51, (437, 0), 221);
+ Add_Action (Table.States (731), 52, (329, 0), 21);
+ Add_Action (Table.States (731), 53, (294, 0), 22);
+ Add_Action (Table.States (731), 54, (293, 0), 23);
+ Add_Action (Table.States (731), 59, (346, 0), 721);
+ Add_Action (Table.States (731), 60, (340, 0), 722);
+ Add_Action (Table.States (731), 66, (325, 5), 1074);
+ Add_Action (Table.States (731), 81, (130, 0), 30);
+ Add_Action (Table.States (731), 83, (128, 0), 31);
+ Add_Action (Table.States (731), 84, (124, 0), 32);
+ Add_Action (Table.States (731), 116, (136, 0), 223);
+ Table.States (731).Goto_List.Set_Capacity (48);
+ Add_Goto (Table.States (731), 124, 725);
+ Add_Goto (Table.States (731), 126, 40);
+ Add_Goto (Table.States (731), 127, 41);
+ Add_Goto (Table.States (731), 128, 42);
+ Add_Goto (Table.States (731), 130, 43);
+ Add_Goto (Table.States (731), 135, 44);
+ Add_Goto (Table.States (731), 136, 45);
+ Add_Goto (Table.States (731), 137, 46);
+ Add_Goto (Table.States (731), 180, 47);
+ Add_Goto (Table.States (731), 189, 48);
+ Add_Goto (Table.States (731), 193, 726);
+ Add_Goto (Table.States (731), 291, 77);
+ Add_Goto (Table.States (731), 292, 727);
+ Add_Goto (Table.States (731), 293, 79);
+ Add_Goto (Table.States (731), 294, 80);
+ Add_Goto (Table.States (731), 320, 86);
+ Add_Goto (Table.States (731), 321, 87);
+ Add_Goto (Table.States (731), 322, 88);
+ Add_Goto (Table.States (731), 323, 728);
+ Add_Goto (Table.States (731), 324, 1075);
+ Add_Goto (Table.States (731), 325, 89);
+ Add_Goto (Table.States (731), 327, 91);
+ Add_Goto (Table.States (731), 328, 92);
+ Add_Goto (Table.States (731), 329, 730);
+ Add_Goto (Table.States (731), 330, 94);
+ Add_Goto (Table.States (731), 332, 95);
+ Add_Goto (Table.States (731), 333, 96);
+ Add_Goto (Table.States (731), 334, 97);
+ Add_Goto (Table.States (731), 335, 98);
+ Add_Goto (Table.States (731), 336, 99);
+ Add_Goto (Table.States (731), 337, 100);
+ Add_Goto (Table.States (731), 338, 101);
+ Add_Goto (Table.States (731), 339, 102);
+ Add_Goto (Table.States (731), 340, 103);
+ Add_Goto (Table.States (731), 341, 104);
+ Add_Goto (Table.States (731), 346, 106);
+ Add_Goto (Table.States (731), 347, 107);
+ Add_Goto (Table.States (731), 394, 132);
+ Add_Goto (Table.States (731), 403, 134);
+ Add_Goto (Table.States (731), 404, 135);
+ Add_Goto (Table.States (731), 405, 136);
+ Add_Goto (Table.States (731), 406, 137);
+ Add_Goto (Table.States (731), 408, 138);
+ Add_Goto (Table.States (731), 431, 139);
+ Add_Goto (Table.States (731), 437, 140);
+ Add_Goto (Table.States (731), 438, 141);
+ Add_Goto (Table.States (731), 440, 142);
+ Add_Goto (Table.States (731), 454, 143);
+ Table.States (731).Kernel := To_Vector ((((325, 0), 82, 8,
(32767, 0), 0), ((325, 1), 82, 5, (32767,
+ 0), 0), ((325, 2), 82, 4, (32767, 0), 0), ((325, 3), 82, 5,
(32767, 0), 0), ((325, 4), 82, 2,
+ (32767, 0), 0), ((325, 5), 82, 1, (32767, 0), 0)));
+ Table.States (731).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (325, 5), 66, 1074)));
+ Table.States (732).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (732), 52, (187, 0), 347);
+ Add_Action (Table.States (732), 56, (188, 2), 514);
+ Add_Action (Table.States (732), 86, (252, 0), 33);
+ Add_Action (Table.States (732), 90, (268, 0), 34);
+ Add_Action (Table.States (732), 116, (196, 0), 146);
+ Add_Action (Table.States (732), 117, (196, 1), 37);
+ Add_Action (Table.States (732), 118, (195, 6), 38);
+ Table.States (732).Goto_List.Set_Capacity (15);
+ Add_Goto (Table.States (732), 131, 734);
+ Add_Goto (Table.States (732), 187, 526);
+ Add_Goto (Table.States (732), 188, 735);
+ Add_Goto (Table.States (732), 195, 528);
+ Add_Goto (Table.States (732), 196, 148);
+ Add_Goto (Table.States (732), 197, 54);
+ Add_Goto (Table.States (732), 198, 55);
+ Add_Goto (Table.States (732), 199, 56);
+ Add_Goto (Table.States (732), 201, 57);
+ Add_Goto (Table.States (732), 251, 58);
+ Add_Goto (Table.States (732), 252, 59);
+ Add_Goto (Table.States (732), 255, 60);
+ Add_Goto (Table.States (732), 268, 68);
+ Add_Goto (Table.States (732), 311, 83);
+ Add_Goto (Table.States (732), 319, 1076);
+ Table.States (732).Kernel := To_Vector ((((317, 4), 79, 3,
(32767, 0), 0), ((317, 5), 79, 1, (32767,
+ 0), 0)));
+ Table.States (732).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (733).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (733), 52, (187, 0), 347);
+ Add_Action (Table.States (733), 56, (188, 2), 514);
+ Add_Action (Table.States (733), 79, (317, 0), 1077);
+ Add_Action (Table.States (733), 86, (252, 0), 33);
+ Add_Action (Table.States (733), 90, (268, 0), 34);
+ Add_Action (Table.States (733), 116, (196, 0), 146);
+ Add_Action (Table.States (733), 117, (196, 1), 37);
+ Add_Action (Table.States (733), 118, (195, 6), 38);
+ Table.States (733).Goto_List.Set_Capacity (15);
+ Add_Goto (Table.States (733), 131, 734);
+ Add_Goto (Table.States (733), 187, 526);
+ Add_Goto (Table.States (733), 188, 735);
+ Add_Goto (Table.States (733), 195, 528);
+ Add_Goto (Table.States (733), 196, 148);
+ Add_Goto (Table.States (733), 197, 54);
+ Add_Goto (Table.States (733), 198, 55);
+ Add_Goto (Table.States (733), 199, 56);
+ Add_Goto (Table.States (733), 201, 57);
+ Add_Goto (Table.States (733), 251, 58);
+ Add_Goto (Table.States (733), 252, 59);
+ Add_Goto (Table.States (733), 255, 60);
+ Add_Goto (Table.States (733), 268, 68);
+ Add_Goto (Table.States (733), 311, 83);
+ Add_Goto (Table.States (733), 319, 1078);
+ Table.States (733).Kernel := To_Vector ((((317, 0), 80, 4,
(32767, 0), 0), ((317, 1), 80, 2, (32767,
+ 0), 0), ((317, 2), 80, 3, (32767, 0), 0), ((317, 3), 80, 1,
(32767, 0), 0)));
+ Table.States (733).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ end Subr_30;
+ procedure Subr_31
+ is begin
+ Table.States (734).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (734), (33, 94, 108), (319, 0), 1);
+ Table.States (734).Kernel := To_Vector ((0 => ((319, 0), 131, 0,
(319, 0), 1)));
+ Table.States (734).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (319, 0), 1)));
+ Table.States (735).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (735), (33, 94, 108), (319, 1), 1);
+ Table.States (735).Kernel := To_Vector ((0 => ((319, 1), 188, 0,
(319, 1), 1)));
+ Table.States (735).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (319, 1), 1)));
+ Table.States (736).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (736), 33, Reduce, (317, 7), 3);
+ Add_Action (Table.States (736), 94, (134, 0), 282);
+ Add_Action (Table.States (736), 108, Reduce, (317, 7), 3);
+ Table.States (736).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (736), 134, 1079);
+ Table.States (736).Kernel := To_Vector ((((317, 6), 319, 2,
(32767, 0), 0), ((317, 7), 319, 0, (317,
+ 7), 3)));
+ Table.States (736).Minimal_Complete_Actions := To_Vector (((Shift,
(134, 0), 94, 282), (Reduce, (317, 7),
+ 3)));
+ Table.States (737).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (737), 66, (318, 0), 1080);
+ Table.States (737).Kernel := To_Vector ((0 => ((318, 0), 396, 3,
(32767, 0), 0)));
+ Table.States (737).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (318, 0), 66, 1080)));
+ Table.States (738).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (738), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (289, 2), 4);
+ Table.States (738).Kernel := To_Vector ((0 => ((289, 2), 108, 0,
(289, 2), 4)));
+ Table.States (738).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (289, 2), 4)));
+ Table.States (739).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (739), 108, (289, 0), 1081);
+ Table.States (739).Kernel := To_Vector ((0 => ((289, 0), 243, 1,
(32767, 0), 0)));
+ Table.States (739).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (289, 0), 108, 1081)));
+ Table.States (740).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (740), 63, (398, 0), 1082);
+ Add_Action (Table.States (740), 84, (124, 0), 32);
+ Table.States (740).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (740), 124, 1083);
+ Add_Goto (Table.States (740), 395, 1084);
+ Add_Goto (Table.States (740), 398, 1085);
+ Table.States (740).Kernel := To_Vector ((0 => ((396, 0), 23, 3,
(32767, 0), 0)));
+ Table.States (740).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (124, 0), 84, 32)));
+ Table.States (741).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (741), 12, (401, 0), 1);
+ Add_Action (Table.States (741), 15, (370, 0), 3);
+ Add_Action (Table.States (741), 17, (365, 0), 4);
+ Add_Action (Table.States (741), 18, (382, 0), 5);
+ Add_Action (Table.States (741), 19, (363, 0), 6);
+ Add_Action (Table.States (741), 20, (357, 0), 7);
+ Add_Action (Table.States (741), 30, (316, 0), 13);
+ Add_Action (Table.States (741), 31, (290, 0), 14);
+ Add_Action (Table.States (741), 32, (289, 0), 15);
+ Add_Action (Table.States (741), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (741), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (741), 37, (288, 0), 17);
+ Add_Conflict (Table.States (741), 37, (285, 1), 0);
+ Add_Action (Table.States (741), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (741), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (741), 42, (271, 0), 18);
+ Add_Action (Table.States (741), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (741), 64, (273, 0), 27);
+ Add_Action (Table.States (741), 65, (264, 0), 28);
+ Add_Action (Table.States (741), 84, (124, 0), 32);
+ Add_Action (Table.States (741), 86, (252, 0), 33);
+ Add_Action (Table.States (741), 90, (268, 0), 34);
+ Add_Action (Table.States (741), 105, (265, 0), 35);
+ Add_Action (Table.States (741), 116, (196, 0), 146);
+ Add_Action (Table.States (741), 117, (196, 1), 37);
+ Add_Action (Table.States (741), 118, (195, 6), 38);
+ Table.States (741).Goto_List.Set_Capacity (47);
+ Add_Goto (Table.States (741), 124, 39);
+ Add_Goto (Table.States (741), 195, 52);
+ Add_Goto (Table.States (741), 196, 53);
+ Add_Goto (Table.States (741), 197, 54);
+ Add_Goto (Table.States (741), 198, 55);
+ Add_Goto (Table.States (741), 199, 56);
+ Add_Goto (Table.States (741), 201, 57);
+ Add_Goto (Table.States (741), 251, 58);
+ Add_Goto (Table.States (741), 252, 59);
+ Add_Goto (Table.States (741), 255, 60);
+ Add_Goto (Table.States (741), 259, 452);
+ Add_Goto (Table.States (741), 261, 331);
+ Add_Goto (Table.States (741), 262, 62);
+ Add_Goto (Table.States (741), 263, 63);
+ Add_Goto (Table.States (741), 264, 64);
+ Add_Goto (Table.States (741), 265, 65);
+ Add_Goto (Table.States (741), 266, 66);
+ Add_Goto (Table.States (741), 267, 67);
+ Add_Goto (Table.States (741), 268, 68);
+ Add_Goto (Table.States (741), 271, 69);
+ Add_Goto (Table.States (741), 273, 70);
+ Add_Goto (Table.States (741), 275, 71);
+ Add_Goto (Table.States (741), 285, 72);
+ Add_Goto (Table.States (741), 286, 73);
+ Add_Goto (Table.States (741), 287, 1086);
+ Add_Goto (Table.States (741), 288, 74);
+ Add_Goto (Table.States (741), 289, 75);
+ Add_Goto (Table.States (741), 290, 76);
+ Add_Goto (Table.States (741), 310, 82);
+ Add_Goto (Table.States (741), 311, 83);
+ Add_Goto (Table.States (741), 316, 84);
+ Add_Goto (Table.States (741), 318, 85);
+ Add_Goto (Table.States (741), 357, 110);
+ Add_Goto (Table.States (741), 363, 111);
+ Add_Goto (Table.States (741), 364, 112);
+ Add_Goto (Table.States (741), 365, 113);
+ Add_Goto (Table.States (741), 366, 114);
+ Add_Goto (Table.States (741), 367, 115);
+ Add_Goto (Table.States (741), 370, 116);
+ Add_Goto (Table.States (741), 376, 117);
+ Add_Goto (Table.States (741), 378, 118);
+ Add_Goto (Table.States (741), 379, 119);
+ Add_Goto (Table.States (741), 382, 120);
+ Add_Goto (Table.States (741), 396, 1087);
+ Add_Goto (Table.States (741), 401, 133);
+ Add_Goto (Table.States (741), 461, 332);
+ Add_Goto (Table.States (741), 462, 144);
+ Table.States (741).Kernel := To_Vector ((0 => ((288, 0), 75, 5,
(32767, 0), 0)));
+ Table.States (741).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ Table.States (742).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (742), 46, (233, 2), 167);
+ Add_Action (Table.States (742), 52, (187, 0), 356);
+ Add_Action (Table.States (742), 65, (234, 1), 169);
+ Add_Action (Table.States (742), 76, (256, 0), 170);
+ Add_Action (Table.States (742), 85, (205, 4), 171);
+ Add_Action (Table.States (742), 86, (213, 2), 172);
+ Add_Action (Table.States (742), 90, (268, 0), 34);
+ Add_Action (Table.States (742), 106, (237, 1), 173);
+ Add_Action (Table.States (742), 107, (237, 0), 174);
+ Add_Action (Table.States (742), 115, (234, 0), 175);
+ Add_Action (Table.States (742), 116, (196, 0), 146);
+ Add_Action (Table.States (742), 117, (196, 1), 37);
+ Add_Action (Table.States (742), 118, (195, 6), 38);
+ Table.States (742).Goto_List.Set_Capacity (33);
+ Add_Goto (Table.States (742), 131, 693);
+ Add_Goto (Table.States (742), 140, 694);
+ Add_Goto (Table.States (742), 160, 1088);
+ Add_Goto (Table.States (742), 187, 365);
+ Add_Goto (Table.States (742), 195, 366);
+ Add_Goto (Table.States (742), 196, 148);
+ Add_Goto (Table.States (742), 197, 54);
+ Add_Goto (Table.States (742), 198, 55);
+ Add_Goto (Table.States (742), 199, 56);
+ Add_Goto (Table.States (742), 201, 57);
+ Add_Goto (Table.States (742), 203, 369);
+ Add_Goto (Table.States (742), 205, 177);
+ Add_Goto (Table.States (742), 206, 178);
+ Add_Goto (Table.States (742), 210, 179);
+ Add_Goto (Table.States (742), 211, 180);
+ Add_Goto (Table.States (742), 213, 181);
+ Add_Goto (Table.States (742), 214, 182);
+ Add_Goto (Table.States (742), 215, 183);
+ Add_Goto (Table.States (742), 218, 184);
+ Add_Goto (Table.States (742), 219, 185);
+ Add_Goto (Table.States (742), 220, 186);
+ Add_Goto (Table.States (742), 231, 696);
+ Add_Goto (Table.States (742), 232, 190);
+ Add_Goto (Table.States (742), 233, 191);
+ Add_Goto (Table.States (742), 234, 192);
+ Add_Goto (Table.States (742), 237, 193);
+ Add_Goto (Table.States (742), 251, 58);
+ Add_Goto (Table.States (742), 252, 59);
+ Add_Goto (Table.States (742), 255, 60);
+ Add_Goto (Table.States (742), 256, 194);
+ Add_Goto (Table.States (742), 268, 68);
+ Add_Goto (Table.States (742), 311, 83);
+ Add_Goto (Table.States (742), 465, 196);
+ Table.States (742).Kernel := To_Vector ((0 => ((277, 1), 47, 1,
(32767, 0), 0)));
+ Table.States (742).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (743).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (743), 51, (276, 5), 1089);
+ Table.States (743).Kernel := To_Vector ((((276, 5), 87, 4,
(32767, 0), 0), ((276, 7), 87, 4, (32767,
+ 0), 0)));
+ Table.States (743).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (276, 5), 51, 1089)));
+ Table.States (744).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (744), 41, (271, 2), 1090);
+ Add_Action (Table.States (744), 44, (269, 0), 1091);
+ Add_Action (Table.States (744), 66, (271, 3), 1092);
+ Table.States (744).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (744), 269, 1093);
+ Add_Goto (Table.States (744), 270, 1094);
+ Table.States (744).Kernel := To_Vector ((((271, 0), 259, 11,
(32767, 0), 0), ((271, 1), 259, 8,
+ (32767, 0), 0), ((271, 2), 259, 6, (32767, 0), 0), ((271, 3),
259, 3, (32767, 0), 0)));
+ Table.States (744).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (271, 3), 66, 1092)));
+ Table.States (745).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (745), 95, (331, 1), 464);
+ Add_Action (Table.States (745), 108, (333, 0), 1095);
+ Table.States (745).Kernel := To_Vector ((((331, 1), 331, 2,
(32767, 0), 0), ((333, 0), 331, 1, (32767,
+ 0), 0)));
+ Table.States (745).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (333, 0), 108, 1095)));
+ Table.States (746).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (746), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (333, 1), 4);
+ Table.States (746).Kernel := To_Vector ((0 => ((333, 1), 108, 0,
(333, 1), 4)));
+ Table.States (746).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (333, 1), 4)));
+ Table.States (747).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (747), 85, (198, 0), 281);
+ Add_Action (Table.States (747), 95, Reduce, (331, 1), 3);
+ Add_Action (Table.States (747), 96, (197, 0), 283);
+ Add_Action (Table.States (747), 108, Reduce, (331, 1), 3);
+ Add_Action (Table.States (747), 113, (121, 0), 285);
+ Add_Action (Table.States (747), 114, (121, 1), 286);
+ Table.States (747).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (747), 121, 287);
+ Add_Goto (Table.States (747), 313, 289);
+ Table.States (747).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0), ((331, 1),
195, 0, (331, 1), 3)));
+ Table.States (747).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (331, 1), 3)));
+ Table.States (748).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (748), (1 => 69), (283, 1), 3);
+ Table.States (748).Kernel := To_Vector ((0 => ((283, 1), 87, 0,
(283, 1), 3)));
+ Table.States (748).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (283, 1), 3)));
+ Table.States (749).Action_List.Set_Capacity (10);
+ Add_Action (Table.States (749), 29, (301, 3), 711);
+ Add_Action (Table.States (749), 47, (301, 0), 712);
+ Add_Action (Table.States (749), 52, (187, 0), 347);
+ Add_Conflict (Table.States (749), 52, (301, 1), 0);
+ Add_Action (Table.States (749), 56, (188, 2), 514);
+ Add_Action (Table.States (749), 80, (300, 0), 1096);
+ Add_Action (Table.States (749), 86, Reduce, (301, 1), 0);
+ Add_Action (Table.States (749), 90, Reduce, (301, 1), 0);
+ Add_Action (Table.States (749), 116, Reduce, (301, 1), 0);
+ Add_Action (Table.States (749), 117, Reduce, (301, 1), 0);
+ Add_Action (Table.States (749), 118, Reduce, (301, 1), 0);
+ Table.States (749).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (749), 187, 1097);
+ Add_Goto (Table.States (749), 188, 1098);
+ Add_Goto (Table.States (749), 301, 1099);
+ Table.States (749).Kernel := To_Vector ((((300, 0), 93, 6,
(32767, 0), 0), ((300, 1), 93, 4, (32767,
+ 0), 0), ((300, 2), 93, 4, (32767, 0), 0), ((300, 3), 93, 2,
(32767, 0), 0), ((300, 4), 93, 5,
+ (32767, 0), 0), ((300, 5), 93, 3, (32767, 0), 0), ((300, 6),
93, 3, (32767, 0), 0), ((300, 7), 93,
+ 1, (32767, 0), 0), ((300, 8), 93, 4, (32767, 0), 0), ((300,
9), 93, 2, (32767, 0), 0)));
+ Table.States (749).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (301, 1), 0)));
+ Table.States (750).Action_List.Set_Capacity (12);
+ Add_Action (Table.States (750), (24, 30, 33, 47, 49, 61, 63, 69,
82, 87, 94, 108), (299, 0), 3);
+ Table.States (750).Kernel := To_Vector ((0 => ((299, 0), 87, 0,
(299, 0), 3)));
+ Table.States (750).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (299, 0), 3)));
+ Table.States (751).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (751), 116, (136, 0), 207);
+ Table.States (751).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (751), 136, 688);
+ Add_Goto (Table.States (751), 298, 1100);
+ Add_Goto (Table.States (751), 300, 1101);
+ Table.States (751).Kernel := To_Vector ((((298, 1), 108, 3,
(32767, 0), 0), ((298, 2), 108, 3, (32767,
+ 0), 0)));
+ Table.States (752).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (752), 46, (233, 2), 167);
+ Add_Action (Table.States (752), 52, (187, 0), 356);
+ Add_Action (Table.States (752), 65, (234, 1), 169);
+ Add_Action (Table.States (752), 76, (256, 0), 170);
+ Add_Action (Table.States (752), 85, (205, 4), 171);
+ Add_Action (Table.States (752), 86, (213, 2), 172);
+ Add_Action (Table.States (752), 90, (268, 0), 34);
+ Add_Action (Table.States (752), 106, (237, 1), 173);
+ Add_Action (Table.States (752), 107, (237, 0), 174);
+ Add_Action (Table.States (752), 115, (234, 0), 175);
+ Add_Action (Table.States (752), 116, (196, 0), 146);
+ Add_Action (Table.States (752), 117, (196, 1), 37);
+ Add_Action (Table.States (752), 118, (195, 6), 38);
+ Table.States (752).Goto_List.Set_Capacity (33);
+ Add_Goto (Table.States (752), 131, 693);
+ Add_Goto (Table.States (752), 140, 694);
+ Add_Goto (Table.States (752), 160, 1102);
+ Add_Goto (Table.States (752), 187, 365);
+ Add_Goto (Table.States (752), 195, 1103);
+ Add_Goto (Table.States (752), 196, 148);
+ Add_Goto (Table.States (752), 197, 54);
+ Add_Goto (Table.States (752), 198, 55);
+ Add_Goto (Table.States (752), 199, 56);
+ Add_Goto (Table.States (752), 201, 57);
+ Add_Goto (Table.States (752), 203, 369);
+ Add_Goto (Table.States (752), 205, 177);
+ Add_Goto (Table.States (752), 206, 178);
+ Add_Goto (Table.States (752), 210, 179);
+ Add_Goto (Table.States (752), 211, 180);
+ Add_Goto (Table.States (752), 213, 181);
+ Add_Goto (Table.States (752), 214, 182);
+ Add_Goto (Table.States (752), 215, 183);
+ Add_Goto (Table.States (752), 218, 184);
+ Add_Goto (Table.States (752), 219, 185);
+ Add_Goto (Table.States (752), 220, 186);
+ Add_Goto (Table.States (752), 231, 696);
+ Add_Goto (Table.States (752), 232, 190);
+ Add_Goto (Table.States (752), 233, 191);
+ Add_Goto (Table.States (752), 234, 192);
+ Add_Goto (Table.States (752), 237, 193);
+ Add_Goto (Table.States (752), 251, 58);
+ Add_Goto (Table.States (752), 252, 59);
+ Add_Goto (Table.States (752), 255, 60);
+ Add_Goto (Table.States (752), 256, 194);
+ Add_Goto (Table.States (752), 268, 68);
+ Add_Goto (Table.States (752), 311, 83);
+ Add_Goto (Table.States (752), 465, 196);
+ Table.States (752).Kernel := To_Vector ((((278, 0), 34, 3,
(32767, 0), 0), ((278, 1), 34, 1, (32767,
+ 0), 0), ((280, 4), 34, 3, (32767, 0), 0), ((280, 5), 34, 1,
(32767, 0), 0)));
+ Table.States (752).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (753).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (753), 36, Reduce, (278, 3), 3);
+ Add_Action (Table.States (753), 50, Reduce, (278, 3), 3);
+ Add_Action (Table.States (753), 63, (279, 0), 1104);
+ Add_Action (Table.States (753), 99, Reduce, (278, 3), 3);
+ Table.States (753).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (753), 279, 1105);
+ Table.States (753).Kernel := To_Vector ((((278, 2), 160, 2,
(32767, 0), 0), ((278, 3), 160, 0, (278,
+ 3), 3)));
+ Table.States (753).Minimal_Complete_Actions := To_Vector (((Shift,
(279, 0), 63, 1104), (Reduce, (278, 3),
+ 3)));
+ Table.States (754).Action_List.Set_Capacity (20);
+ Add_Action (Table.States (754), 36, Reduce, (131, 3), 1);
+ Add_Conflict (Table.States (754), 36, (280, 7), 3);
+ Add_Action (Table.States (754), 45, Reduce, (234, 3), 1);
+ Add_Action (Table.States (754), 50, Reduce, (131, 3), 1);
+ Add_Conflict (Table.States (754), 50, (280, 7), 3);
+ Add_Action (Table.States (754), 63, (279, 0), 1104);
+ Add_Conflict (Table.States (754), 63, (131, 3), 1);
+ Add_Action (Table.States (754), 71, (453, 0), 635);
+ Add_Action (Table.States (754), 72, (153, 0), 636);
+ Add_Action (Table.States (754), 73, Reduce, (234, 3), 1);
+ Add_Action (Table.States (754), 74, (139, 0), 637);
+ Add_Action (Table.States (754), 85, (162, 0), 612);
+ Add_Action (Table.States (754), 89, Reduce, (234, 3), 1);
+ Add_Action (Table.States (754), 96, (197, 0), 283);
+ Add_Action (Table.States (754), 97, Reduce, (234, 3), 1);
+ Add_Action (Table.States (754), 99, Reduce, (131, 3), 1);
+ Add_Conflict (Table.States (754), 99, (280, 7), 3);
+ Add_Action (Table.States (754), 106, Reduce, (234, 3), 1);
+ Add_Action (Table.States (754), 107, Reduce, (234, 3), 1);
+ Add_Action (Table.States (754), 109, Reduce, (234, 3), 1);
+ Add_Action (Table.States (754), 111, Reduce, (234, 3), 1);
+ Add_Action (Table.States (754), 112, Reduce, (234, 3), 1);
+ Add_Action (Table.States (754), 113, (121, 0), 285);
+ Add_Action (Table.States (754), 114, (121, 1), 286);
+ Table.States (754).Goto_List.Set_Capacity (9);
+ Add_Goto (Table.States (754), 121, 638);
+ Add_Goto (Table.States (754), 132, 639);
+ Add_Goto (Table.States (754), 133, 640);
+ Add_Goto (Table.States (754), 139, 641);
+ Add_Goto (Table.States (754), 153, 642);
+ Add_Goto (Table.States (754), 162, 643);
+ Add_Goto (Table.States (754), 279, 1106);
+ Add_Goto (Table.States (754), 313, 289);
+ Add_Goto (Table.States (754), 453, 644);
+ Table.States (754).Kernel := To_Vector ((((131, 2), 195, 2,
(32767, 0), 0), ((131, 3), 195, 0, (131,
+ 3), 1), ((197, 0), 195, 2, (32767, 0), 0), ((198, 0), 195,
3, (32767, 0), 0), ((199, 0), 195, 2,
+ (32767, 0), 0), ((201, 0), 195, 2, (32767, 0), 0), ((203, 0),
195, 2, (32767, 0), 0), ((234, 3),
+ 195, 0, (234, 3), 1), ((255, 0), 195, 3, (32767, 0), 0),
((280, 6), 195, 2, (32767, 0), 0), ((280,
+ 7), 195, 0, (280, 7), 3), ((311, 0), 195, 3, (32767, 0),
0)));
+ Table.States (754).Minimal_Complete_Actions := To_Vector
(((Reduce, (131, 3), 1), (Reduce, (234, 3), 1),
+ (Shift, (279, 0), 63, 1104), (Reduce, (280, 7), 3)));
+ Table.States (755).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (755), 86, (252, 0), 33);
+ Add_Action (Table.States (755), 90, (268, 0), 34);
+ Add_Action (Table.States (755), 116, (196, 0), 146);
+ Add_Action (Table.States (755), 117, (196, 1), 37);
+ Add_Action (Table.States (755), 118, (195, 6), 38);
+ Table.States (755).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (755), 195, 1107);
+ Add_Goto (Table.States (755), 196, 148);
+ Add_Goto (Table.States (755), 197, 54);
+ Add_Goto (Table.States (755), 198, 55);
+ Add_Goto (Table.States (755), 199, 56);
+ Add_Goto (Table.States (755), 201, 57);
+ Add_Goto (Table.States (755), 251, 58);
+ Add_Goto (Table.States (755), 252, 59);
+ Add_Goto (Table.States (755), 255, 60);
+ Add_Goto (Table.States (755), 268, 68);
+ Add_Goto (Table.States (755), 311, 83);
+ Table.States (755).Kernel := To_Vector ((((280, 12), 34, 3,
(32767, 0), 0), ((280, 13), 34, 1, (32767,
+ 0), 0)));
+ Table.States (755).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (756).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (756), 36, Reduce, (280, 15), 3);
+ Add_Action (Table.States (756), 50, Reduce, (280, 15), 3);
+ Add_Action (Table.States (756), 63, (279, 0), 1104);
+ Add_Action (Table.States (756), 85, (198, 0), 281);
+ Add_Action (Table.States (756), 96, (197, 0), 283);
+ Add_Action (Table.States (756), 99, Reduce, (280, 15), 3);
+ Add_Action (Table.States (756), 113, (121, 0), 285);
+ Add_Action (Table.States (756), 114, (121, 1), 286);
+ Table.States (756).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (756), 121, 287);
+ Add_Goto (Table.States (756), 279, 1108);
+ Add_Goto (Table.States (756), 313, 289);
+ Table.States (756).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((280, 14), 195, 2, (32767, 0), 0), ((280,
15), 195, 0, (280, 15), 3), ((311, 0),
+ 195, 3, (32767, 0), 0)));
+ Table.States (756).Minimal_Complete_Actions := To_Vector (((Shift,
(279, 0), 63, 1104), (Reduce, (280,
+ 15), 3)));
+ end Subr_31;
+ procedure Subr_32
+ is begin
+ Table.States (757).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (757), (47, 69), (281, 0), 1);
+ Table.States (757).Kernel := To_Vector ((0 => ((281, 0), 131, 0,
(281, 0), 1)));
+ Table.States (757).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (281, 0), 1)));
+ Table.States (758).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (758), (47, 69), (281, 1), 1);
+ Table.States (758).Kernel := To_Vector ((0 => ((281, 1), 188, 0,
(281, 1), 1)));
+ Table.States (758).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (281, 1), 1)));
+ Table.States (759).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (759), 47, (280, 0), 1109);
+ Add_Action (Table.States (759), 69, (280, 8), 1110);
+ Table.States (759).Kernel := To_Vector ((((280, 0), 281, 5,
(32767, 0), 0), ((280, 1), 281, 3, (32767,
+ 0), 0), ((280, 2), 281, 4, (32767, 0), 0), ((280, 3), 281,
2, (32767, 0), 0), ((280, 8), 281, 5,
+ (32767, 0), 0), ((280, 9), 281, 3, (32767, 0), 0), ((280, 10),
281, 4, (32767, 0), 0), ((280, 11),
+ 281, 2, (32767, 0), 0)));
+ Table.States (759).Minimal_Complete_Actions := To_Vector (((Shift,
(280, 0), 47, 1109), (Shift, (280, 8),
+ 69, 1110)));
+ Table.States (760).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (760), 11, (455, 0), 1111);
+ Add_Action (Table.States (760), 66, (440, 6), 1112);
+ Add_Action (Table.States (760), 86, (252, 0), 33);
+ Add_Action (Table.States (760), 90, (268, 0), 34);
+ Add_Action (Table.States (760), 116, (196, 0), 146);
+ Add_Action (Table.States (760), 117, (196, 1), 37);
+ Add_Action (Table.States (760), 118, (195, 6), 38);
+ Table.States (760).Goto_List.Set_Capacity (14);
+ Add_Goto (Table.States (760), 195, 1113);
+ Add_Goto (Table.States (760), 196, 148);
+ Add_Goto (Table.States (760), 197, 54);
+ Add_Goto (Table.States (760), 198, 55);
+ Add_Goto (Table.States (760), 199, 56);
+ Add_Goto (Table.States (760), 201, 57);
+ Add_Goto (Table.States (760), 251, 58);
+ Add_Goto (Table.States (760), 252, 59);
+ Add_Goto (Table.States (760), 255, 60);
+ Add_Goto (Table.States (760), 268, 68);
+ Add_Goto (Table.States (760), 311, 83);
+ Add_Goto (Table.States (760), 441, 1114);
+ Add_Goto (Table.States (760), 455, 1115);
+ Add_Goto (Table.States (760), 466, 1116);
+ Table.States (760).Kernel := To_Vector ((((440, 0), 67, 16,
(32767, 0), 0), ((440, 1), 67, 15, (32767,
+ 0), 0), ((440, 2), 67, 8, (32767, 0), 0), ((440, 3), 67, 7,
(32767, 0), 0), ((440, 4), 67, 12,
+ (32767, 0), 0), ((440, 5), 67, 11, (32767, 0), 0), ((440, 6),
67, 4, (32767, 0), 0), ((440, 7), 67,
+ 3, (32767, 0), 0)));
+ Table.States (760).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (440, 6), 66, 1112)));
+ Table.States (761).Action_List.Set_Capacity (16);
+ Add_Action (Table.States (761), 12, (402, 0), 165);
+ Add_Action (Table.States (761), 46, (233, 2), 167);
+ Add_Action (Table.States (761), 51, (221, 0), 273);
+ Add_Action (Table.States (761), 52, (187, 0), 356);
+ Add_Action (Table.States (761), 62, (178, 3), 385);
+ Add_Action (Table.States (761), 65, (234, 1), 169);
+ Add_Action (Table.States (761), 76, (256, 0), 170);
+ Add_Action (Table.States (761), 85, (205, 4), 171);
+ Add_Action (Table.States (761), 86, (213, 2), 172);
+ Add_Action (Table.States (761), 90, (268, 0), 34);
+ Add_Action (Table.States (761), 106, (237, 1), 173);
+ Add_Action (Table.States (761), 107, (237, 0), 174);
+ Add_Action (Table.States (761), 115, (234, 0), 175);
+ Add_Action (Table.States (761), 116, (196, 0), 146);
+ Add_Action (Table.States (761), 117, (196, 1), 37);
+ Add_Action (Table.States (761), 118, (195, 6), 38);
+ Table.States (761).Goto_List.Set_Capacity (41);
+ Add_Goto (Table.States (761), 131, 361);
+ Add_Goto (Table.States (761), 140, 362);
+ Add_Goto (Table.States (761), 177, 363);
+ Add_Goto (Table.States (761), 178, 364);
+ Add_Goto (Table.States (761), 187, 365);
+ Add_Goto (Table.States (761), 195, 366);
+ Add_Goto (Table.States (761), 196, 148);
+ Add_Goto (Table.States (761), 197, 54);
+ Add_Goto (Table.States (761), 198, 55);
+ Add_Goto (Table.States (761), 199, 56);
+ Add_Goto (Table.States (761), 201, 57);
+ Add_Goto (Table.States (761), 203, 369);
+ Add_Goto (Table.States (761), 205, 177);
+ Add_Goto (Table.States (761), 206, 178);
+ Add_Goto (Table.States (761), 210, 179);
+ Add_Goto (Table.States (761), 211, 180);
+ Add_Goto (Table.States (761), 212, 373);
+ Add_Goto (Table.States (761), 213, 181);
+ Add_Goto (Table.States (761), 214, 182);
+ Add_Goto (Table.States (761), 215, 183);
+ Add_Goto (Table.States (761), 216, 374);
+ Add_Goto (Table.States (761), 217, 375);
+ Add_Goto (Table.States (761), 218, 184);
+ Add_Goto (Table.States (761), 219, 185);
+ Add_Goto (Table.States (761), 220, 186);
+ Add_Goto (Table.States (761), 221, 376);
+ Add_Goto (Table.States (761), 227, 1117);
+ Add_Goto (Table.States (761), 228, 188);
+ Add_Goto (Table.States (761), 231, 378);
+ Add_Goto (Table.States (761), 232, 190);
+ Add_Goto (Table.States (761), 233, 191);
+ Add_Goto (Table.States (761), 234, 192);
+ Add_Goto (Table.States (761), 237, 193);
+ Add_Goto (Table.States (761), 251, 58);
+ Add_Goto (Table.States (761), 252, 59);
+ Add_Goto (Table.States (761), 255, 60);
+ Add_Goto (Table.States (761), 256, 194);
+ Add_Goto (Table.States (761), 268, 68);
+ Add_Goto (Table.States (761), 311, 83);
+ Add_Goto (Table.States (761), 402, 195);
+ Add_Goto (Table.States (761), 465, 196);
+ Table.States (761).Kernel := To_Vector ((((213, 0), 85, 2,
(32767, 0), 0), ((213, 1), 85, 6, (32767,
+ 0), 0), ((215, 0), 85, 4, (32767, 0), 0)));
+ Table.States (761).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (762).Action_List.Set_Capacity (17);
+ Add_Action (Table.States (762), 12, (402, 0), 165);
+ Add_Action (Table.States (762), 46, (233, 2), 167);
+ Add_Action (Table.States (762), 51, (221, 0), 273);
+ Add_Action (Table.States (762), 52, (187, 0), 356);
+ Add_Action (Table.States (762), 62, (178, 3), 385);
+ Add_Action (Table.States (762), 65, (234, 1), 169);
+ Add_Action (Table.States (762), 76, (256, 0), 170);
+ Add_Action (Table.States (762), 85, (205, 4), 171);
+ Add_Action (Table.States (762), 86, (213, 2), 172);
+ Add_Action (Table.States (762), 88, (214, 0), 386);
+ Add_Action (Table.States (762), 90, (268, 0), 34);
+ Add_Action (Table.States (762), 106, (237, 1), 173);
+ Add_Action (Table.States (762), 107, (237, 0), 174);
+ Add_Action (Table.States (762), 115, (234, 0), 175);
+ Add_Action (Table.States (762), 116, (196, 0), 146);
+ Add_Action (Table.States (762), 117, (196, 1), 37);
+ Add_Action (Table.States (762), 118, (195, 6), 38);
+ Table.States (762).Goto_List.Set_Capacity (41);
+ Add_Goto (Table.States (762), 131, 361);
+ Add_Goto (Table.States (762), 140, 362);
+ Add_Goto (Table.States (762), 177, 363);
+ Add_Goto (Table.States (762), 178, 364);
+ Add_Goto (Table.States (762), 187, 365);
+ Add_Goto (Table.States (762), 195, 366);
+ Add_Goto (Table.States (762), 196, 148);
+ Add_Goto (Table.States (762), 197, 54);
+ Add_Goto (Table.States (762), 198, 55);
+ Add_Goto (Table.States (762), 199, 56);
+ Add_Goto (Table.States (762), 201, 57);
+ Add_Goto (Table.States (762), 203, 369);
+ Add_Goto (Table.States (762), 205, 177);
+ Add_Goto (Table.States (762), 206, 178);
+ Add_Goto (Table.States (762), 210, 179);
+ Add_Goto (Table.States (762), 211, 180);
+ Add_Goto (Table.States (762), 212, 387);
+ Add_Goto (Table.States (762), 213, 181);
+ Add_Goto (Table.States (762), 214, 182);
+ Add_Goto (Table.States (762), 215, 183);
+ Add_Goto (Table.States (762), 216, 388);
+ Add_Goto (Table.States (762), 217, 375);
+ Add_Goto (Table.States (762), 218, 184);
+ Add_Goto (Table.States (762), 219, 185);
+ Add_Goto (Table.States (762), 220, 186);
+ Add_Goto (Table.States (762), 221, 376);
+ Add_Goto (Table.States (762), 227, 1117);
+ Add_Goto (Table.States (762), 228, 188);
+ Add_Goto (Table.States (762), 231, 378);
+ Add_Goto (Table.States (762), 232, 190);
+ Add_Goto (Table.States (762), 233, 191);
+ Add_Goto (Table.States (762), 234, 192);
+ Add_Goto (Table.States (762), 237, 193);
+ Add_Goto (Table.States (762), 251, 58);
+ Add_Goto (Table.States (762), 252, 59);
+ Add_Goto (Table.States (762), 255, 60);
+ Add_Goto (Table.States (762), 256, 194);
+ Add_Goto (Table.States (762), 268, 68);
+ Add_Goto (Table.States (762), 311, 83);
+ Add_Goto (Table.States (762), 402, 195);
+ Add_Goto (Table.States (762), 465, 196);
+ Table.States (762).Kernel := To_Vector ((((213, 2), 86, 6,
(32767, 0), 0), ((213, 3), 86, 2, (32767,
+ 0), 0), ((214, 0), 86, 1, (32767, 0), 0), ((215, 1), 86, 4,
(32767, 0), 0)));
+ Table.States (762).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (214, 0), 88, 386)));
+ Table.States (763).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (763), (1 => 108), (439, 0), 1);
+ Table.States (763).Kernel := To_Vector ((0 => ((439, 0), 211, 0,
(439, 0), 1)));
+ Table.States (763).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (439, 0), 1)));
+ Table.States (764).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (764), 108, (438, 0), 1118);
+ Table.States (764).Kernel := To_Vector ((0 => ((438, 0), 439, 1,
(32767, 0), 0)));
+ Table.States (764).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (438, 0), 108, 1118)));
+ Table.States (765).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (765), 50, (437, 0), 1119);
+ Add_Conflict (Table.States (765), 50, (201, 0), 3);
+ Add_Action (Table.States (765), 85, Reduce, (201, 0), 3);
+ Add_Action (Table.States (765), 96, Reduce, (201, 0), 3);
+ Add_Action (Table.States (765), 113, Reduce, (201, 0), 3);
+ Add_Action (Table.States (765), 114, Reduce, (201, 0), 3);
+ Table.States (765).Kernel := To_Vector ((((201, 0), 202, 0,
(201, 0), 3), ((437, 0), 202, 3, (32767,
+ 0), 0)));
+ Table.States (765).Minimal_Complete_Actions := To_Vector
(((Reduce, (201, 0), 3), (Shift, (437, 0), 50,
+ 1119)));
+ Table.States (766).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (766), 12, (402, 0), 165);
+ Add_Action (Table.States (766), 46, (233, 2), 167);
+ Add_Action (Table.States (766), 52, (233, 3), 168);
+ Add_Action (Table.States (766), 65, (234, 1), 169);
+ Add_Action (Table.States (766), 76, (256, 0), 170);
+ Add_Action (Table.States (766), 85, (205, 4), 171);
+ Add_Action (Table.States (766), 86, (213, 2), 172);
+ Add_Action (Table.States (766), 90, (268, 0), 34);
+ Add_Action (Table.States (766), 106, (237, 1), 173);
+ Add_Action (Table.States (766), 107, (237, 0), 174);
+ Add_Action (Table.States (766), 115, (234, 0), 175);
+ Add_Action (Table.States (766), 116, (196, 0), 146);
+ Add_Action (Table.States (766), 117, (196, 1), 37);
+ Add_Action (Table.States (766), 118, (195, 6), 38);
+ Table.States (766).Goto_List.Set_Capacity (31);
+ Add_Goto (Table.States (766), 195, 176);
+ Add_Goto (Table.States (766), 196, 148);
+ Add_Goto (Table.States (766), 197, 54);
+ Add_Goto (Table.States (766), 198, 55);
+ Add_Goto (Table.States (766), 199, 56);
+ Add_Goto (Table.States (766), 201, 57);
+ Add_Goto (Table.States (766), 205, 177);
+ Add_Goto (Table.States (766), 206, 178);
+ Add_Goto (Table.States (766), 210, 179);
+ Add_Goto (Table.States (766), 211, 180);
+ Add_Goto (Table.States (766), 213, 181);
+ Add_Goto (Table.States (766), 214, 182);
+ Add_Goto (Table.States (766), 215, 183);
+ Add_Goto (Table.States (766), 218, 184);
+ Add_Goto (Table.States (766), 219, 185);
+ Add_Goto (Table.States (766), 220, 186);
+ Add_Goto (Table.States (766), 227, 1120);
+ Add_Goto (Table.States (766), 228, 188);
+ Add_Goto (Table.States (766), 231, 189);
+ Add_Goto (Table.States (766), 232, 190);
+ Add_Goto (Table.States (766), 233, 191);
+ Add_Goto (Table.States (766), 234, 192);
+ Add_Goto (Table.States (766), 237, 193);
+ Add_Goto (Table.States (766), 251, 58);
+ Add_Goto (Table.States (766), 252, 59);
+ Add_Goto (Table.States (766), 255, 60);
+ Add_Goto (Table.States (766), 256, 194);
+ Add_Goto (Table.States (766), 268, 68);
+ Add_Goto (Table.States (766), 311, 83);
+ Add_Goto (Table.States (766), 402, 195);
+ Add_Goto (Table.States (766), 465, 196);
+ Table.States (766).Kernel := To_Vector ((0 => ((454, 0), 11, 2,
(32767, 0), 0)));
+ Table.States (766).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (767).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (767), 85, (198, 0), 281);
+ Add_Action (Table.States (767), 96, (197, 0), 283);
+ Add_Action (Table.States (767), 113, (121, 0), 285);
+ Add_Action (Table.States (767), 114, (121, 1), 286);
+ Table.States (767).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (767), 121, 287);
+ Add_Goto (Table.States (767), 313, 289);
+ Table.States (767).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0)));
+ Table.States (768).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (768), 36, Reduce, (282, 1), 3);
+ Add_Action (Table.States (768), 63, (279, 0), 1104);
+ Add_Action (Table.States (768), 85, Reduce, (195, 5), 1);
+ Add_Action (Table.States (768), 96, Reduce, (195, 5), 1);
+ Add_Action (Table.States (768), 113, Reduce, (195, 5), 1);
+ Add_Action (Table.States (768), 114, Reduce, (195, 5), 1);
+ Table.States (768).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (768), 279, 1121);
+ Table.States (768).Kernel := To_Vector ((((195, 5), 311, 0,
(195, 5), 1), ((282, 0), 311, 2, (32767,
+ 0), 0), ((282, 1), 311, 0, (282, 1), 3)));
+ Table.States (768).Minimal_Complete_Actions := To_Vector
(((Reduce, (195, 5), 1), (Shift, (279, 0), 63,
+ 1104), (Reduce, (282, 1), 3)));
+ Table.States (769).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (769), 56, (188, 0), 880);
+ Add_Action (Table.States (769), 86, (252, 0), 33);
+ Add_Action (Table.States (769), 90, (268, 0), 34);
+ Add_Action (Table.States (769), 116, (196, 0), 146);
+ Add_Action (Table.States (769), 117, (196, 1), 37);
+ Add_Action (Table.States (769), 118, (195, 6), 38);
+ Table.States (769).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (769), 195, 1122);
+ Add_Goto (Table.States (769), 196, 148);
+ Add_Goto (Table.States (769), 197, 54);
+ Add_Goto (Table.States (769), 198, 55);
+ Add_Goto (Table.States (769), 199, 56);
+ Add_Goto (Table.States (769), 201, 57);
+ Add_Goto (Table.States (769), 251, 58);
+ Add_Goto (Table.States (769), 252, 59);
+ Add_Goto (Table.States (769), 255, 60);
+ Add_Goto (Table.States (769), 268, 68);
+ Add_Goto (Table.States (769), 311, 83);
+ Table.States (769).Kernel := To_Vector ((((188, 0), 187, 3,
(32767, 0), 0), ((188, 1), 187, 2, (32767,
+ 0), 0), ((188, 4), 187, 3, (32767, 0), 0), ((188, 5), 187,
2, (32767, 0), 0), ((188, 8), 187, 5,
+ (32767, 0), 0), ((188, 9), 187, 4, (32767, 0), 0), ((296, 0),
187, 1, (32767, 0), 0)));
+ Table.States (769).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (770).Action_List.Set_Capacity (10);
+ Add_Action (Table.States (770), (24, 33, 47, 49, 61, 69, 82, 87,
94, 108), (296, 2), 2);
+ Table.States (770).Kernel := To_Vector ((0 => ((296, 2), 188, 0,
(296, 2), 2)));
+ Table.States (770).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (296, 2), 2)));
+ Table.States (771).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (771), 24, Reduce, (296, 1), 2);
+ Add_Action (Table.States (771), 33, Reduce, (296, 1), 2);
+ Add_Action (Table.States (771), 47, Reduce, (296, 1), 2);
+ Add_Action (Table.States (771), 49, Reduce, (296, 1), 2);
+ Add_Action (Table.States (771), 61, Reduce, (296, 1), 2);
+ Add_Action (Table.States (771), 69, Reduce, (296, 1), 2);
+ Add_Action (Table.States (771), 82, Reduce, (296, 1), 2);
+ Add_Action (Table.States (771), 85, (198, 0), 281);
+ Add_Action (Table.States (771), 87, Reduce, (296, 1), 2);
+ Add_Action (Table.States (771), 94, Reduce, (296, 1), 2);
+ Add_Action (Table.States (771), 96, (197, 0), 283);
+ Add_Action (Table.States (771), 108, Reduce, (296, 1), 2);
+ Add_Action (Table.States (771), 113, (121, 0), 285);
+ Add_Action (Table.States (771), 114, (121, 1), 286);
+ Table.States (771).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (771), 121, 287);
+ Add_Goto (Table.States (771), 313, 289);
+ Table.States (771).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((296, 1), 195, 0, (296, 1), 2), ((311, 0),
195, 3, (32767, 0), 0)));
+ Table.States (771).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (296, 1), 2)));
+ Table.States (772).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (772), 86, (252, 0), 33);
+ Add_Action (Table.States (772), 90, (268, 0), 34);
+ Add_Action (Table.States (772), 116, (196, 0), 146);
+ Add_Action (Table.States (772), 117, (196, 1), 37);
+ Add_Action (Table.States (772), 118, (195, 6), 38);
+ Table.States (772).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (772), 195, 1123);
+ Add_Goto (Table.States (772), 196, 148);
+ Add_Goto (Table.States (772), 197, 54);
+ Add_Goto (Table.States (772), 198, 55);
+ Add_Goto (Table.States (772), 199, 56);
+ Add_Goto (Table.States (772), 201, 57);
+ Add_Goto (Table.States (772), 251, 58);
+ Add_Goto (Table.States (772), 252, 59);
+ Add_Goto (Table.States (772), 255, 60);
+ Add_Goto (Table.States (772), 268, 68);
+ Add_Goto (Table.States (772), 311, 83);
+ Table.States (772).Kernel := To_Vector ((((408, 8), 76, 4,
(32767, 0), 0), ((408, 9), 76, 2, (32767,
+ 0), 0)));
+ Table.States (772).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (773).Action_List.Set_Capacity (10);
+ Add_Action (Table.States (773), (24, 33, 47, 49, 61, 69, 82, 87,
94, 108), (297, 0), 2);
+ Table.States (773).Kernel := To_Vector ((0 => ((297, 0), 296, 0,
(297, 0), 2)));
+ Table.States (773).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (297, 0), 2)));
+ Table.States (774).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (774), 86, (252, 0), 33);
+ Add_Action (Table.States (774), 90, (268, 0), 34);
+ Add_Action (Table.States (774), 116, (196, 0), 146);
+ Add_Action (Table.States (774), 117, (196, 1), 37);
+ Add_Action (Table.States (774), 118, (195, 6), 38);
+ Table.States (774).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (774), 195, 1124);
+ Add_Goto (Table.States (774), 196, 148);
+ Add_Goto (Table.States (774), 197, 54);
+ Add_Goto (Table.States (774), 198, 55);
+ Add_Goto (Table.States (774), 199, 56);
+ Add_Goto (Table.States (774), 201, 57);
+ Add_Goto (Table.States (774), 251, 58);
+ Add_Goto (Table.States (774), 252, 59);
+ Add_Goto (Table.States (774), 255, 60);
+ Add_Goto (Table.States (774), 268, 68);
+ Add_Goto (Table.States (774), 311, 83);
+ Table.States (774).Kernel := To_Vector ((((408, 4), 76, 4,
(32767, 0), 0), ((408, 5), 76, 2, (32767,
+ 0), 0)));
+ Table.States (774).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (775).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (775), 13, (392, 0), 1125);
+ Add_Action (Table.States (775), 21, (359, 0), 1126);
+ Add_Action (Table.States (775), 25, (329, 1), 10);
+ Add_Action (Table.States (775), 51, (437, 0), 221);
+ Add_Action (Table.States (775), 52, (329, 0), 21);
+ Add_Action (Table.States (775), 53, (294, 0), 314);
+ Add_Action (Table.States (775), 54, (293, 0), 315);
+ Add_Action (Table.States (775), 66, (354, 3), 1127);
+ Table.States (775).Goto_List.Set_Capacity (16);
+ Add_Goto (Table.States (775), 291, 1128);
+ Add_Goto (Table.States (775), 292, 1129);
+ Add_Goto (Table.States (775), 293, 79);
+ Add_Goto (Table.States (775), 294, 80);
+ Add_Goto (Table.States (775), 309, 1130);
+ Add_Goto (Table.States (775), 320, 1131);
+ Add_Goto (Table.States (775), 321, 1132);
+ Add_Goto (Table.States (775), 329, 1133);
+ Add_Goto (Table.States (775), 353, 1134);
+ Add_Goto (Table.States (775), 355, 1135);
+ Add_Goto (Table.States (775), 359, 1136);
+ Add_Goto (Table.States (775), 431, 1137);
+ Add_Goto (Table.States (775), 437, 140);
+ Add_Goto (Table.States (775), 438, 141);
+ Add_Goto (Table.States (775), 440, 142);
+ Add_Goto (Table.States (775), 454, 143);
+ Table.States (775).Kernel := To_Vector ((((354, 2), 82, 5,
(32767, 0), 0), ((354, 3), 82, 2, (32767,
+ 0), 0), ((392, 0), 82, 4, (32767, 0), 0), ((392, 1), 82, 2,
(32767, 0), 0)));
+ Table.States (775).Minimal_Complete_Actions := To_Vector (((Shift,
(354, 3), 66, 1127), (Shift, (392, 0),
+ 13, 1125)));
+ end Subr_32;
+ procedure Subr_33
+ is begin
+ Table.States (776).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (776), 82, (354, 0), 1138);
+ Table.States (776).Kernel := To_Vector ((((354, 0), 434, 6,
(32767, 0), 0), ((354, 1), 434, 3, (32767,
+ 0), 0)));
+ Table.States (776).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (354, 0), 82, 1138)));
+ Table.States (777).Action_List.Set_Capacity (10);
+ Add_Action (Table.States (777), 21, (356, 4), 8);
+ Add_Action (Table.States (777), 25, (329, 1), 10);
+ Add_Action (Table.States (777), 27, (350, 6), 781);
+ Add_Action (Table.States (777), 51, (437, 0), 221);
+ Add_Action (Table.States (777), 52, (329, 0), 21);
+ Add_Action (Table.States (777), 53, (294, 0), 314);
+ Add_Action (Table.States (777), 54, (293, 0), 315);
+ Add_Action (Table.States (777), 66, (350, 10), 782);
+ Add_Action (Table.States (777), 76, (346, 6), 1139);
+ Add_Action (Table.States (777), 84, (124, 0), 32);
+ Table.States (777).Goto_List.Set_Capacity (15);
+ Add_Goto (Table.States (777), 124, 784);
+ Add_Goto (Table.States (777), 291, 785);
+ Add_Goto (Table.States (777), 292, 786);
+ Add_Goto (Table.States (777), 293, 317);
+ Add_Goto (Table.States (777), 294, 318);
+ Add_Goto (Table.States (777), 329, 787);
+ Add_Goto (Table.States (777), 348, 788);
+ Add_Goto (Table.States (777), 350, 1140);
+ Add_Goto (Table.States (777), 351, 790);
+ Add_Goto (Table.States (777), 356, 791);
+ Add_Goto (Table.States (777), 431, 792);
+ Add_Goto (Table.States (777), 437, 140);
+ Add_Goto (Table.States (777), 438, 141);
+ Add_Goto (Table.States (777), 440, 142);
+ Add_Goto (Table.States (777), 454, 143);
+ Table.States (777).Kernel := To_Vector ((((346, 6), 82, 5,
(32767, 0), 0), ((346, 7), 82, 2, (32767,
+ 0), 0)));
+ Table.States (777).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (350, 10), 66, 782)));
+ Table.States (778).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (778), 116, (136, 0), 207);
+ Table.States (778).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (778), 136, 851);
+ Add_Goto (Table.States (778), 166, 852);
+ Add_Goto (Table.States (778), 168, 853);
+ Table.States (778).Kernel := To_Vector ((0 => ((167, 0), 85, 4,
(32767, 0), 0)));
+ Table.States (778).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (136, 0), 116, 207)));
+ Table.States (779).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (779), 61, (434, 0), 299);
+ Add_Action (Table.States (779), 82, (346, 2), 1141);
+ Table.States (779).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (779), 434, 1142);
+ Table.States (779).Kernel := To_Vector ((((346, 0), 167, 8,
(32767, 0), 0), ((346, 1), 167, 5, (32767,
+ 0), 0), ((346, 2), 167, 6, (32767, 0), 0), ((346, 3), 167,
3, (32767, 0), 0)));
+ Table.States (779).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (346, 2), 82, 1141)));
+ Table.States (780).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (780), 82, (346, 4), 1143);
+ Table.States (780).Kernel := To_Vector ((((346, 4), 434, 6,
(32767, 0), 0), ((346, 5), 434, 3, (32767,
+ 0), 0)));
+ Table.States (780).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (346, 4), 82, 1143)));
+ Table.States (781).Action_List.Set_Capacity (9);
+ Add_Action (Table.States (781), 21, (356, 4), 8);
+ Add_Action (Table.States (781), 25, (329, 1), 10);
+ Add_Action (Table.States (781), 51, (437, 0), 221);
+ Add_Action (Table.States (781), 52, (329, 0), 21);
+ Add_Action (Table.States (781), 53, (294, 0), 314);
+ Add_Action (Table.States (781), 54, (293, 0), 315);
+ Add_Action (Table.States (781), 66, (350, 8), 1144);
+ Add_Action (Table.States (781), 84, (124, 0), 32);
+ Add_Action (Table.States (781), 116, (136, 0), 207);
+ Table.States (781).Goto_List.Set_Capacity (17);
+ Add_Goto (Table.States (781), 124, 784);
+ Add_Goto (Table.States (781), 136, 1145);
+ Add_Goto (Table.States (781), 173, 1146);
+ Add_Goto (Table.States (781), 291, 785);
+ Add_Goto (Table.States (781), 292, 786);
+ Add_Goto (Table.States (781), 293, 317);
+ Add_Goto (Table.States (781), 294, 318);
+ Add_Goto (Table.States (781), 329, 787);
+ Add_Goto (Table.States (781), 349, 1147);
+ Add_Goto (Table.States (781), 351, 1148);
+ Add_Goto (Table.States (781), 352, 1149);
+ Add_Goto (Table.States (781), 356, 791);
+ Add_Goto (Table.States (781), 431, 792);
+ Add_Goto (Table.States (781), 437, 140);
+ Add_Goto (Table.States (781), 438, 141);
+ Add_Goto (Table.States (781), 440, 142);
+ Add_Goto (Table.States (781), 454, 143);
+ Table.States (781).Kernel := To_Vector ((((350, 6), 27, 5,
(32767, 0), 0), ((350, 7), 27, 4, (32767,
+ 0), 0), ((350, 8), 27, 2, (32767, 0), 0), ((350, 9), 27, 1,
(32767, 0), 0)));
+ Table.States (781).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (350, 8), 66, 1144)));
+ Table.States (782).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (782), 108, Reduce, (350, 11), 1);
+ Add_Action (Table.States (782), 116, (350, 10), 1150);
+ Table.States (782).Kernel := To_Vector ((((350, 10), 66, 1,
(32767, 0), 0), ((350, 11), 66, 0, (350,
+ 11), 1)));
+ Table.States (782).Minimal_Complete_Actions := To_Vector (((Shift,
(350, 10), 116, 1150), (Reduce, (350,
+ 11), 1)));
+ Table.States (783).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (783), 86, (252, 0), 33);
+ Add_Action (Table.States (783), 90, (268, 0), 34);
+ Add_Action (Table.States (783), 116, (196, 0), 146);
+ Add_Action (Table.States (783), 117, (196, 1), 37);
+ Add_Action (Table.States (783), 118, (195, 6), 38);
+ Table.States (783).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (783), 182, 1151);
+ Add_Goto (Table.States (783), 195, 1152);
+ Add_Goto (Table.States (783), 196, 148);
+ Add_Goto (Table.States (783), 197, 54);
+ Add_Goto (Table.States (783), 198, 55);
+ Add_Goto (Table.States (783), 199, 56);
+ Add_Goto (Table.States (783), 201, 57);
+ Add_Goto (Table.States (783), 251, 58);
+ Add_Goto (Table.States (783), 252, 59);
+ Add_Goto (Table.States (783), 255, 60);
+ Add_Goto (Table.States (783), 268, 68);
+ Add_Goto (Table.States (783), 311, 83);
+ Table.States (783).Kernel := To_Vector ((0 => ((347, 2), 76, 4,
(32767, 0), 0)));
+ Table.States (783).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (784).Action_List.Set_Capacity (10);
+ Add_Action (Table.States (784), (21, 25, 27, 51, 52, 53, 54, 66,
84, 116), (351, 1), 1);
+ Table.States (784).Kernel := To_Vector ((0 => ((351, 1), 124, 0,
(351, 1), 1)));
+ Table.States (784).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (351, 1), 1)));
+ Table.States (785).Action_List.Set_Capacity (10);
+ Add_Action (Table.States (785), (21, 25, 27, 51, 52, 53, 54, 66,
84, 116), (351, 0), 1);
+ Table.States (785).Kernel := To_Vector ((0 => ((351, 0), 291, 0,
(351, 0), 1)));
+ Table.States (785).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (351, 0), 1)));
+ Table.States (786).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (786), 61, (434, 0), 299);
+ Add_Action (Table.States (786), 108, (291, 3), 301);
+ Table.States (786).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (786), 434, 1067);
+ Table.States (786).Kernel := To_Vector ((((291, 2), 292, 3,
(32767, 0), 0), ((291, 3), 292, 1, (32767,
+ 0), 0)));
+ Table.States (787).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (787), 21, (356, 0), 306);
+ Add_Action (Table.States (787), 53, (294, 0), 314);
+ Add_Action (Table.States (787), 54, (293, 0), 315);
+ Table.States (787).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (787), 292, 1153);
+ Add_Goto (Table.States (787), 293, 317);
+ Add_Goto (Table.States (787), 294, 318);
+ Table.States (787).Kernel := To_Vector ((((291, 0), 329, 5,
(32767, 0), 0), ((291, 1), 329, 3, (32767,
+ 0), 0), ((356, 0), 329, 8, (32767, 0), 0), ((356, 1), 329,
6, (32767, 0), 0), ((356, 2), 329, 5,
+ (32767, 0), 0), ((356, 3), 329, 3, (32767, 0), 0)));
+ Table.States (787).Minimal_Complete_Actions := To_Vector (((Shift,
(293, 0), 54, 315), (Shift, (356, 0),
+ 21, 306)));
+ Table.States (788).Action_List.Set_Capacity (9);
+ Add_Action (Table.States (788), 21, (356, 4), 8);
+ Add_Action (Table.States (788), 25, (329, 1), 10);
+ Add_Action (Table.States (788), 27, (350, 0), 1154);
+ Add_Action (Table.States (788), 51, (437, 0), 221);
+ Add_Action (Table.States (788), 52, (329, 0), 21);
+ Add_Action (Table.States (788), 53, (294, 0), 314);
+ Add_Action (Table.States (788), 54, (293, 0), 315);
+ Add_Action (Table.States (788), 66, (350, 4), 1155);
+ Add_Action (Table.States (788), 84, (124, 0), 32);
+ Table.States (788).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (788), 124, 784);
+ Add_Goto (Table.States (788), 291, 785);
+ Add_Goto (Table.States (788), 292, 786);
+ Add_Goto (Table.States (788), 293, 317);
+ Add_Goto (Table.States (788), 294, 318);
+ Add_Goto (Table.States (788), 329, 787);
+ Add_Goto (Table.States (788), 351, 1156);
+ Add_Goto (Table.States (788), 356, 791);
+ Add_Goto (Table.States (788), 431, 792);
+ Add_Goto (Table.States (788), 437, 140);
+ Add_Goto (Table.States (788), 438, 141);
+ Add_Goto (Table.States (788), 440, 142);
+ Add_Goto (Table.States (788), 454, 143);
+ Table.States (788).Kernel := To_Vector ((((348, 1), 348, 3,
(32767, 0), 0), ((350, 0), 348, 6, (32767,
+ 0), 0), ((350, 1), 348, 5, (32767, 0), 0), ((350, 2), 348,
3, (32767, 0), 0), ((350, 3), 348, 2,
+ (32767, 0), 0), ((350, 4), 348, 2, (32767, 0), 0), ((350, 5),
348, 1, (32767, 0), 0)));
+ Table.States (789).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (789), 108, (347, 3), 1157);
+ Table.States (789).Kernel := To_Vector ((0 => ((347, 3), 350, 1,
(32767, 0), 0)));
+ Table.States (789).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (347, 3), 108, 1157)));
+ Table.States (790).Action_List.Set_Capacity (9);
+ Add_Action (Table.States (790), (21, 25, 27, 51, 52, 53, 54, 66,
84), (348, 0), 1);
+ Table.States (790).Kernel := To_Vector ((0 => ((348, 0), 351, 0,
(348, 0), 1)));
+ Table.States (790).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (348, 0), 1)));
+ Table.States (791).Action_List.Set_Capacity (10);
+ Add_Action (Table.States (791), (21, 25, 27, 51, 52, 53, 54, 66,
84, 116), (351, 2), 1);
+ Table.States (791).Kernel := To_Vector ((0 => ((351, 2), 356, 0,
(351, 2), 1)));
+ Table.States (791).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (351, 2), 1)));
+ Table.States (792).Action_List.Set_Capacity (10);
+ Add_Action (Table.States (792), (21, 25, 27, 51, 52, 53, 54, 66,
84, 116), (351, 3), 1);
+ Table.States (792).Kernel := To_Vector ((0 => ((351, 3), 431, 0,
(351, 3), 1)));
+ Table.States (792).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (351, 3), 1)));
+ Table.States (793).Action_List.Set_Capacity (10);
+ Add_Action (Table.States (793), 21, (356, 4), 8);
+ Add_Action (Table.States (793), 25, (329, 1), 10);
+ Add_Action (Table.States (793), 27, (350, 6), 781);
+ Add_Action (Table.States (793), 51, (437, 0), 221);
+ Add_Action (Table.States (793), 52, (329, 0), 21);
+ Add_Action (Table.States (793), 53, (294, 0), 314);
+ Add_Action (Table.States (793), 54, (293, 0), 315);
+ Add_Action (Table.States (793), 66, (350, 10), 782);
+ Add_Action (Table.States (793), 76, (347, 0), 1158);
+ Add_Action (Table.States (793), 84, (124, 0), 32);
+ Table.States (793).Goto_List.Set_Capacity (15);
+ Add_Goto (Table.States (793), 124, 784);
+ Add_Goto (Table.States (793), 291, 785);
+ Add_Goto (Table.States (793), 292, 786);
+ Add_Goto (Table.States (793), 293, 317);
+ Add_Goto (Table.States (793), 294, 318);
+ Add_Goto (Table.States (793), 329, 787);
+ Add_Goto (Table.States (793), 348, 788);
+ Add_Goto (Table.States (793), 350, 1159);
+ Add_Goto (Table.States (793), 351, 790);
+ Add_Goto (Table.States (793), 356, 791);
+ Add_Goto (Table.States (793), 431, 792);
+ Add_Goto (Table.States (793), 437, 140);
+ Add_Goto (Table.States (793), 438, 141);
+ Add_Goto (Table.States (793), 440, 142);
+ Add_Goto (Table.States (793), 454, 143);
+ Table.States (793).Kernel := To_Vector ((((347, 0), 82, 5,
(32767, 0), 0), ((347, 1), 82, 2, (32767,
+ 0), 0)));
+ Table.States (793).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (350, 10), 66, 782)));
+ Table.States (794).Action_List.Set_Capacity (16);
+ Add_Action (Table.States (794), 13, (391, 0), 1160);
+ Add_Action (Table.States (794), 22, (339, 0), 9);
+ Add_Action (Table.States (794), 25, (329, 1), 10);
+ Add_Action (Table.States (794), 28, (325, 0), 12);
+ Add_Action (Table.States (794), 38, Reduce, (192, 1), 0);
+ Add_Action (Table.States (794), 50, (332, 0), 19);
+ Add_Action (Table.States (794), 51, (437, 0), 221);
+ Add_Action (Table.States (794), 52, (329, 0), 21);
+ Add_Action (Table.States (794), 53, (294, 0), 22);
+ Add_Action (Table.States (794), 54, (293, 0), 23);
+ Add_Action (Table.States (794), 59, (346, 0), 24);
+ Add_Action (Table.States (794), 60, (340, 0), 25);
+ Add_Action (Table.States (794), 81, (130, 0), 30);
+ Add_Action (Table.States (794), 83, (128, 0), 31);
+ Add_Action (Table.States (794), 84, (124, 0), 32);
+ Add_Action (Table.States (794), 116, (136, 0), 223);
+ Table.States (794).Goto_List.Set_Capacity (60);
+ Add_Goto (Table.States (794), 124, 561);
+ Add_Goto (Table.States (794), 126, 40);
+ Add_Goto (Table.States (794), 127, 41);
+ Add_Goto (Table.States (794), 128, 42);
+ Add_Goto (Table.States (794), 130, 43);
+ Add_Goto (Table.States (794), 135, 44);
+ Add_Goto (Table.States (794), 136, 45);
+ Add_Goto (Table.States (794), 137, 46);
+ Add_Goto (Table.States (794), 180, 47);
+ Add_Goto (Table.States (794), 189, 48);
+ Add_Goto (Table.States (794), 190, 562);
+ Add_Goto (Table.States (794), 191, 563);
+ Add_Goto (Table.States (794), 192, 1161);
+ Add_Goto (Table.States (794), 193, 50);
+ Add_Goto (Table.States (794), 194, 51);
+ Add_Goto (Table.States (794), 291, 77);
+ Add_Goto (Table.States (794), 292, 78);
+ Add_Goto (Table.States (794), 293, 79);
+ Add_Goto (Table.States (794), 294, 80);
+ Add_Goto (Table.States (794), 309, 81);
+ Add_Goto (Table.States (794), 320, 86);
+ Add_Goto (Table.States (794), 321, 87);
+ Add_Goto (Table.States (794), 322, 88);
+ Add_Goto (Table.States (794), 325, 89);
+ Add_Goto (Table.States (794), 326, 90);
+ Add_Goto (Table.States (794), 327, 91);
+ Add_Goto (Table.States (794), 328, 92);
+ Add_Goto (Table.States (794), 329, 225);
+ Add_Goto (Table.States (794), 330, 94);
+ Add_Goto (Table.States (794), 332, 95);
+ Add_Goto (Table.States (794), 333, 96);
+ Add_Goto (Table.States (794), 334, 97);
+ Add_Goto (Table.States (794), 335, 98);
+ Add_Goto (Table.States (794), 336, 99);
+ Add_Goto (Table.States (794), 337, 100);
+ Add_Goto (Table.States (794), 338, 101);
+ Add_Goto (Table.States (794), 339, 102);
+ Add_Goto (Table.States (794), 340, 103);
+ Add_Goto (Table.States (794), 341, 104);
+ Add_Goto (Table.States (794), 345, 105);
+ Add_Goto (Table.States (794), 346, 106);
+ Add_Goto (Table.States (794), 347, 107);
+ Add_Goto (Table.States (794), 354, 108);
+ Add_Goto (Table.States (794), 388, 126);
+ Add_Goto (Table.States (794), 389, 127);
+ Add_Goto (Table.States (794), 390, 128);
+ Add_Goto (Table.States (794), 391, 129);
+ Add_Goto (Table.States (794), 392, 130);
+ Add_Goto (Table.States (794), 394, 132);
+ Add_Goto (Table.States (794), 403, 134);
+ Add_Goto (Table.States (794), 404, 135);
+ Add_Goto (Table.States (794), 405, 136);
+ Add_Goto (Table.States (794), 406, 137);
+ Add_Goto (Table.States (794), 408, 138);
+ Add_Goto (Table.States (794), 431, 139);
+ Add_Goto (Table.States (794), 437, 140);
+ Add_Goto (Table.States (794), 438, 141);
+ Add_Goto (Table.States (794), 440, 142);
+ Add_Goto (Table.States (794), 454, 143);
+ Add_Goto (Table.States (794), 458, 565);
+ Table.States (794).Kernel := To_Vector ((((345, 1), 82, 5,
(32767, 0), 0), ((391, 0), 82, 4, (32767,
+ 0), 0), ((391, 1), 82, 2, (32767, 0), 0)));
+ Table.States (794).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (391, 0), 13, 1160)));
+ Table.States (795).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (795), 82, (345, 0), 1162);
+ Table.States (795).Kernel := To_Vector ((0 => ((345, 0), 434, 6,
(32767, 0), 0)));
+ Table.States (795).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (345, 0), 82, 1162)));
+ Table.States (796).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (796), 21, (356, 4), 8);
+ Add_Action (Table.States (796), 25, (329, 1), 10);
+ Add_Action (Table.States (796), 51, (437, 0), 221);
+ Add_Action (Table.States (796), 52, (329, 0), 21);
+ Add_Action (Table.States (796), 76, (340, 9), 1163);
+ Table.States (796).Goto_List.Set_Capacity (10);
+ Add_Goto (Table.States (796), 329, 801);
+ Add_Goto (Table.States (796), 342, 802);
+ Add_Goto (Table.States (796), 343, 1164);
+ Add_Goto (Table.States (796), 344, 804);
+ Add_Goto (Table.States (796), 356, 805);
+ Add_Goto (Table.States (796), 431, 806);
+ Add_Goto (Table.States (796), 437, 140);
+ Add_Goto (Table.States (796), 438, 141);
+ Add_Goto (Table.States (796), 440, 142);
+ Add_Goto (Table.States (796), 454, 143);
+ Table.States (796).Kernel := To_Vector ((((340, 9), 82, 8,
(32767, 0), 0), ((340, 10), 82, 5, (32767,
+ 0), 0)));
+ Table.States (796).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (356, 4), 21, 8)));
+ Table.States (797).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (797), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (340, 11), 4);
+ Table.States (797).Kernel := To_Vector ((0 => ((340, 11), 108,
0, (340, 11), 4)));
+ Table.States (797).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (340, 11), 4)));
+ Table.States (798).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (798), 61, (434, 0), 299);
+ Add_Action (Table.States (798), 82, (340, 3), 1165);
+ Add_Action (Table.States (798), 108, (340, 5), 1166);
+ Table.States (798).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (798), 434, 1167);
+ Table.States (798).Kernel := To_Vector ((((340, 0), 167, 11,
(32767, 0), 0), ((340, 1), 167, 8,
+ (32767, 0), 0), ((340, 2), 167, 3, (32767, 0), 0), ((340, 3),
167, 9, (32767, 0), 0), ((340, 4),
+ 167, 6, (32767, 0), 0), ((340, 5), 167, 1, (32767, 0), 0)));
+ Table.States (798).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (340, 5), 108, 1166)));
+ Table.States (799).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (799), 82, (340, 6), 1168);
+ Add_Action (Table.States (799), 108, (340, 8), 1169);
+ Table.States (799).Kernel := To_Vector ((((340, 6), 434, 9,
(32767, 0), 0), ((340, 7), 434, 6, (32767,
+ 0), 0), ((340, 8), 434, 1, (32767, 0), 0)));
+ Table.States (799).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (340, 8), 108, 1169)));
+ Table.States (800).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (800), 86, (252, 0), 33);
+ Add_Action (Table.States (800), 90, (268, 0), 34);
+ Add_Action (Table.States (800), 116, (196, 0), 146);
+ Add_Action (Table.States (800), 117, (196, 1), 37);
+ Add_Action (Table.States (800), 118, (195, 6), 38);
+ Table.States (800).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (800), 182, 1170);
+ Add_Goto (Table.States (800), 195, 1152);
+ Add_Goto (Table.States (800), 196, 148);
+ Add_Goto (Table.States (800), 197, 54);
+ Add_Goto (Table.States (800), 198, 55);
+ Add_Goto (Table.States (800), 199, 56);
+ Add_Goto (Table.States (800), 201, 57);
+ Add_Goto (Table.States (800), 251, 58);
+ Add_Goto (Table.States (800), 252, 59);
+ Add_Goto (Table.States (800), 255, 60);
+ Add_Goto (Table.States (800), 268, 68);
+ Add_Goto (Table.States (800), 311, 83);
+ Table.States (800).Kernel := To_Vector ((0 => ((341, 3), 76, 7,
(32767, 0), 0)));
+ Table.States (800).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (801).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (801), 21, (356, 0), 306);
+ Table.States (801).Kernel := To_Vector ((((356, 0), 329, 8,
(32767, 0), 0), ((356, 1), 329, 6, (32767,
+ 0), 0), ((356, 2), 329, 5, (32767, 0), 0), ((356, 3), 329,
3, (32767, 0), 0)));
+ Table.States (801).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (356, 0), 21, 306)));
+ Table.States (802).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (802), 21, (356, 4), 8);
+ Add_Action (Table.States (802), 25, (329, 1), 10);
+ Add_Action (Table.States (802), 27, (343, 0), 1171);
+ Add_Action (Table.States (802), 51, (437, 0), 221);
+ Add_Action (Table.States (802), 52, (329, 0), 21);
+ Add_Action (Table.States (802), 66, (343, 1), 1172);
+ Table.States (802).Goto_List.Set_Capacity (8);
+ Add_Goto (Table.States (802), 329, 801);
+ Add_Goto (Table.States (802), 344, 1173);
+ Add_Goto (Table.States (802), 356, 805);
+ Add_Goto (Table.States (802), 431, 806);
+ Add_Goto (Table.States (802), 437, 140);
+ Add_Goto (Table.States (802), 438, 141);
+ Add_Goto (Table.States (802), 440, 142);
+ Add_Goto (Table.States (802), 454, 143);
+ Table.States (802).Kernel := To_Vector ((((342, 1), 342, 3,
(32767, 0), 0), ((343, 0), 342, 5, (32767,
+ 0), 0), ((343, 1), 342, 1, (32767, 0), 0)));
+ Table.States (803).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (803), 108, (341, 4), 1174);
+ Table.States (803).Kernel := To_Vector ((0 => ((341, 4), 343, 1,
(32767, 0), 0)));
+ Table.States (803).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (341, 4), 108, 1174)));
+ Table.States (804).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (804), (21, 25, 27, 51, 52, 66), (342,
0), 1);
+ Table.States (804).Kernel := To_Vector ((0 => ((342, 0), 344, 0,
(342, 0), 1)));
+ Table.States (804).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (342, 0), 1)));
+ end Subr_33;
+ procedure Subr_34
+ is begin
+ Table.States (805).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (805), (21, 25, 27, 51, 52, 66), (344,
0), 1);
+ Table.States (805).Kernel := To_Vector ((0 => ((344, 0), 356, 0,
(344, 0), 1)));
+ Table.States (805).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (344, 0), 1)));
+ Table.States (806).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (806), (21, 25, 27, 51, 52, 66), (344,
1), 1);
+ Table.States (806).Kernel := To_Vector ((0 => ((344, 1), 431, 0,
(344, 1), 1)));
+ Table.States (806).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (344, 1), 1)));
+ Table.States (807).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (807), 21, (356, 4), 8);
+ Add_Action (Table.States (807), 25, (329, 1), 10);
+ Add_Action (Table.States (807), 51, (437, 0), 221);
+ Add_Action (Table.States (807), 52, (329, 0), 21);
+ Add_Action (Table.States (807), 76, (341, 0), 1175);
+ Table.States (807).Goto_List.Set_Capacity (10);
+ Add_Goto (Table.States (807), 329, 801);
+ Add_Goto (Table.States (807), 342, 802);
+ Add_Goto (Table.States (807), 343, 1176);
+ Add_Goto (Table.States (807), 344, 804);
+ Add_Goto (Table.States (807), 356, 805);
+ Add_Goto (Table.States (807), 431, 806);
+ Add_Goto (Table.States (807), 437, 140);
+ Add_Goto (Table.States (807), 438, 141);
+ Add_Goto (Table.States (807), 440, 142);
+ Add_Goto (Table.States (807), 454, 143);
+ Table.States (807).Kernel := To_Vector ((((341, 0), 82, 8,
(32767, 0), 0), ((341, 1), 82, 5, (32767,
+ 0), 0)));
+ Table.States (807).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (356, 4), 21, 8)));
+ Table.States (808).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (808), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (341, 2), 4);
+ Table.States (808).Kernel := To_Vector ((0 => ((341, 2), 108, 0,
(341, 2), 4)));
+ Table.States (808).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (341, 2), 4)));
+ Table.States (809).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (809), 12, (402, 0), 165);
+ Add_Action (Table.States (809), 46, (233, 2), 167);
+ Add_Action (Table.States (809), 52, (187, 0), 356);
+ Add_Action (Table.States (809), 62, (178, 3), 385);
+ Add_Action (Table.States (809), 65, (234, 1), 169);
+ Add_Action (Table.States (809), 76, (256, 0), 170);
+ Add_Action (Table.States (809), 85, (205, 4), 171);
+ Add_Action (Table.States (809), 86, (213, 2), 172);
+ Add_Action (Table.States (809), 90, (268, 0), 34);
+ Add_Action (Table.States (809), 106, (237, 1), 173);
+ Add_Action (Table.States (809), 107, (237, 0), 174);
+ Add_Action (Table.States (809), 115, (234, 0), 175);
+ Add_Action (Table.States (809), 116, (196, 0), 146);
+ Add_Action (Table.States (809), 117, (196, 1), 37);
+ Add_Action (Table.States (809), 118, (195, 6), 38);
+ Table.States (809).Goto_List.Set_Capacity (37);
+ Add_Goto (Table.States (809), 131, 361);
+ Add_Goto (Table.States (809), 140, 362);
+ Add_Goto (Table.States (809), 177, 1177);
+ Add_Goto (Table.States (809), 178, 364);
+ Add_Goto (Table.States (809), 187, 365);
+ Add_Goto (Table.States (809), 195, 366);
+ Add_Goto (Table.States (809), 196, 148);
+ Add_Goto (Table.States (809), 197, 54);
+ Add_Goto (Table.States (809), 198, 55);
+ Add_Goto (Table.States (809), 199, 56);
+ Add_Goto (Table.States (809), 201, 57);
+ Add_Goto (Table.States (809), 203, 369);
+ Add_Goto (Table.States (809), 205, 177);
+ Add_Goto (Table.States (809), 206, 178);
+ Add_Goto (Table.States (809), 210, 179);
+ Add_Goto (Table.States (809), 211, 180);
+ Add_Goto (Table.States (809), 213, 181);
+ Add_Goto (Table.States (809), 214, 182);
+ Add_Goto (Table.States (809), 215, 183);
+ Add_Goto (Table.States (809), 218, 184);
+ Add_Goto (Table.States (809), 219, 185);
+ Add_Goto (Table.States (809), 220, 186);
+ Add_Goto (Table.States (809), 227, 975);
+ Add_Goto (Table.States (809), 228, 188);
+ Add_Goto (Table.States (809), 231, 378);
+ Add_Goto (Table.States (809), 232, 190);
+ Add_Goto (Table.States (809), 233, 191);
+ Add_Goto (Table.States (809), 234, 192);
+ Add_Goto (Table.States (809), 237, 193);
+ Add_Goto (Table.States (809), 251, 58);
+ Add_Goto (Table.States (809), 252, 59);
+ Add_Goto (Table.States (809), 255, 60);
+ Add_Goto (Table.States (809), 256, 194);
+ Add_Goto (Table.States (809), 268, 68);
+ Add_Goto (Table.States (809), 311, 83);
+ Add_Goto (Table.States (809), 402, 195);
+ Add_Goto (Table.States (809), 465, 196);
+ Table.States (809).Kernel := To_Vector ((0 => ((274, 0), 63, 4,
(32767, 0), 0)));
+ Table.States (809).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (178, 3), 62, 385)));
+ Table.States (810).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (810), 63, (274, 0), 809);
+ Add_Action (Table.States (810), 66, (273, 0), 1178);
+ Table.States (810).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (810), 274, 1179);
+ Table.States (810).Kernel := To_Vector ((((272, 1), 272, 5,
(32767, 0), 0), ((273, 0), 272, 3, (32767,
+ 0), 0)));
+ Table.States (810).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (273, 0), 66, 1178)));
+ Table.States (811).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (811), (63, 66), (272, 0), 1);
+ Table.States (811).Kernel := To_Vector ((0 => ((272, 0), 274, 0,
(272, 0), 1)));
+ Table.States (811).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (272, 0), 1)));
+ Table.States (812).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (812), 95, (331, 1), 464);
+ Add_Action (Table.States (812), 108, (386, 0), 1180);
+ Table.States (812).Kernel := To_Vector ((((331, 1), 331, 2,
(32767, 0), 0), ((386, 0), 331, 1, (32767,
+ 0), 0)));
+ Table.States (812).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (386, 0), 108, 1180)));
+ Table.States (813).Action_List.Set_Capacity (42);
+ Add_Action (Table.States (813), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (386,
+ 1), 4);
+ Table.States (813).Kernel := To_Vector ((0 => ((386, 1), 108, 0,
(386, 1), 4)));
+ Table.States (813).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (386, 1), 4)));
+ Table.States (814).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (814), 61, (434, 0), 299);
+ Add_Action (Table.States (814), 108, (130, 1), 1181);
+ Table.States (814).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (814), 434, 1182);
+ Table.States (814).Kernel := To_Vector ((((130, 0), 131, 3,
(32767, 0), 0), ((130, 1), 131, 1, (32767,
+ 0), 0)));
+ Table.States (814).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (130, 1), 108, 1181)));
+ Table.States (815).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (815), 61, (434, 0), 299);
+ Add_Action (Table.States (815), 108, (327, 23), 1183);
+ Table.States (815).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (815), 434, 1184);
+ Table.States (815).Kernel := To_Vector ((((327, 22), 27, 3,
(32767, 0), 0), ((327, 23), 27, 1, (32767,
+ 0), 0)));
+ Table.States (815).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (327, 23), 108, 1183)));
+ Table.States (816).Action_List.Set_Capacity (11);
+ Add_Action (Table.States (816), 52, (187, 0), 347);
+ Add_Action (Table.States (816), 53, (186, 1), 1185);
+ Add_Action (Table.States (816), 54, (186, 0), 1186);
+ Add_Action (Table.States (816), 55, (185, 0), 1187);
+ Add_Action (Table.States (816), 59, (183, 4), 1188);
+ Add_Action (Table.States (816), 79, (185, 1), 1189);
+ Add_Action (Table.States (816), 86, (252, 0), 33);
+ Add_Action (Table.States (816), 90, (268, 0), 34);
+ Add_Action (Table.States (816), 116, (196, 0), 146);
+ Add_Action (Table.States (816), 117, (196, 1), 37);
+ Add_Action (Table.States (816), 118, (195, 6), 38);
+ Table.States (816).Goto_List.Set_Capacity (15);
+ Add_Goto (Table.States (816), 131, 1190);
+ Add_Goto (Table.States (816), 185, 1191);
+ Add_Goto (Table.States (816), 186, 1192);
+ Add_Goto (Table.States (816), 187, 365);
+ Add_Goto (Table.States (816), 195, 528);
+ Add_Goto (Table.States (816), 196, 148);
+ Add_Goto (Table.States (816), 197, 54);
+ Add_Goto (Table.States (816), 198, 55);
+ Add_Goto (Table.States (816), 199, 56);
+ Add_Goto (Table.States (816), 201, 57);
+ Add_Goto (Table.States (816), 251, 58);
+ Add_Goto (Table.States (816), 252, 59);
+ Add_Goto (Table.States (816), 255, 60);
+ Add_Goto (Table.States (816), 268, 68);
+ Add_Goto (Table.States (816), 311, 83);
+ Table.States (816).Kernel := To_Vector ((((183, 4), 56, 2,
(32767, 0), 0), ((183, 5), 56, 1, (32767,
+ 0), 0), ((184, 0), 56, 2, (32767, 0), 0), ((184, 1), 56, 1,
(32767, 0), 0)));
+ Table.States (816).Minimal_Complete_Actions := To_Vector (((Shift,
(186, 0), 54, 1186), (Shift, (196, 0),
+ 116, 146)));
+ Table.States (817).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (817), 49, Reduce, (181, 9), 1);
+ Add_Action (Table.States (817), 61, Reduce, (181, 9), 1);
+ Add_Action (Table.States (817), 75, (181, 8), 1193);
+ Add_Action (Table.States (817), 108, Reduce, (181, 9), 1);
+ Table.States (817).Kernel := To_Vector ((((181, 8), 57, 2,
(32767, 0), 0), ((181, 9), 57, 0, (181, 9),
+ 1)));
+ Table.States (817).Minimal_Complete_Actions := To_Vector (((Shift,
(181, 8), 75, 1193), (Reduce, (181, 9),
+ 1)));
+ Table.States (818).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (818), 57, (181, 6), 1194);
+ Add_Action (Table.States (818), 76, (328, 40), 1195);
+ Table.States (818).Kernel := To_Vector ((((181, 6), 58, 3,
(32767, 0), 0), ((181, 7), 58, 1, (32767,
+ 0), 0), ((328, 40), 58, 9, (32767, 0), 0), ((328, 41), 58,
7, (32767, 0), 0), ((328, 42), 58, 7,
+ (32767, 0), 0), ((328, 43), 58, 5, (32767, 0), 0)));
+ Table.States (818).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (181, 6), 57, 1194)));
+ Table.States (819).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (819), 57, (181, 4), 1196);
+ Table.States (819).Kernel := To_Vector ((((181, 4), 59, 3,
(32767, 0), 0), ((181, 5), 59, 1, (32767,
+ 0), 0)));
+ Table.States (819).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (181, 4), 57, 1196)));
+ Table.States (820).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (820), 57, (181, 2), 1197);
+ Table.States (820).Kernel := To_Vector ((((181, 2), 60, 3,
(32767, 0), 0), ((181, 3), 60, 1, (32767,
+ 0), 0)));
+ Table.States (820).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (181, 2), 57, 1197)));
+ Table.States (821).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (821), 67, (170, 2), 1198);
+ Table.States (821).Kernel := To_Vector ((0 => ((170, 2), 65, 1,
(32767, 0), 0)));
+ Table.States (821).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (170, 2), 67, 1198)));
+ Table.States (822).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (822), 51, (437, 0), 221);
+ Add_Action (Table.States (822), 64, (175, 0), 1199);
+ Add_Action (Table.States (822), 65, (171, 3), 1200);
+ Add_Action (Table.States (822), 116, (136, 0), 207);
+ Table.States (822).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (822), 136, 1145);
+ Add_Goto (Table.States (822), 171, 1201);
+ Add_Goto (Table.States (822), 172, 1202);
+ Add_Goto (Table.States (822), 173, 1203);
+ Add_Goto (Table.States (822), 175, 1204);
+ Add_Goto (Table.States (822), 431, 1205);
+ Add_Goto (Table.States (822), 437, 140);
+ Add_Goto (Table.States (822), 438, 141);
+ Add_Goto (Table.States (822), 440, 142);
+ Add_Goto (Table.States (822), 454, 143);
+ Add_Goto (Table.States (822), 457, 1206);
+ Table.States (822).Kernel := To_Vector ((((170, 0), 67, 5,
(32767, 0), 0), ((170, 1), 67, 4, (32767,
+ 0), 0)));
+ Table.States (822).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (171, 3), 65, 1200)));
+ Table.States (823).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (823), 27, (327, 18), 1207);
+ Add_Action (Table.States (823), 65, (170, 2), 821);
+ Add_Action (Table.States (823), 67, (170, 0), 822);
+ Add_Action (Table.States (823), 77, (169, 2), 1208);
+ Add_Action (Table.States (823), 108, (189, 2), 1209);
+ Table.States (823).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (823), 170, 1210);
+ Table.States (823).Kernel := To_Vector ((((169, 2), 68, 3,
(32767, 0), 0), ((169, 3), 68, 2, (32767,
+ 0), 0), ((189, 2), 68, 1, (32767, 0), 0), ((327, 16), 68, 5,
(32767, 0), 0), ((327, 17), 68, 3,
+ (32767, 0), 0), ((327, 18), 68, 4, (32767, 0), 0), ((327, 19),
68, 2, (32767, 0), 0)));
+ Table.States (823).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (189, 2), 108, 1209)));
+ Table.States (824).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (824), 12, (402, 0), 165);
+ Add_Action (Table.States (824), 46, (233, 2), 167);
+ Add_Action (Table.States (824), 52, (233, 3), 168);
+ Add_Action (Table.States (824), 65, (234, 1), 169);
+ Add_Action (Table.States (824), 76, (256, 0), 170);
+ Add_Action (Table.States (824), 85, (205, 4), 171);
+ Add_Action (Table.States (824), 86, (213, 2), 172);
+ Add_Action (Table.States (824), 90, (268, 0), 34);
+ Add_Action (Table.States (824), 106, (237, 1), 173);
+ Add_Action (Table.States (824), 107, (237, 0), 174);
+ Add_Action (Table.States (824), 115, (234, 0), 175);
+ Add_Action (Table.States (824), 116, (196, 0), 146);
+ Add_Action (Table.States (824), 117, (196, 1), 37);
+ Add_Action (Table.States (824), 118, (195, 6), 38);
+ Table.States (824).Goto_List.Set_Capacity (31);
+ Add_Goto (Table.States (824), 195, 176);
+ Add_Goto (Table.States (824), 196, 148);
+ Add_Goto (Table.States (824), 197, 54);
+ Add_Goto (Table.States (824), 198, 55);
+ Add_Goto (Table.States (824), 199, 56);
+ Add_Goto (Table.States (824), 201, 57);
+ Add_Goto (Table.States (824), 205, 177);
+ Add_Goto (Table.States (824), 206, 178);
+ Add_Goto (Table.States (824), 210, 179);
+ Add_Goto (Table.States (824), 211, 180);
+ Add_Goto (Table.States (824), 213, 181);
+ Add_Goto (Table.States (824), 214, 182);
+ Add_Goto (Table.States (824), 215, 183);
+ Add_Goto (Table.States (824), 218, 184);
+ Add_Goto (Table.States (824), 219, 185);
+ Add_Goto (Table.States (824), 220, 186);
+ Add_Goto (Table.States (824), 227, 1211);
+ Add_Goto (Table.States (824), 228, 188);
+ Add_Goto (Table.States (824), 231, 189);
+ Add_Goto (Table.States (824), 232, 190);
+ Add_Goto (Table.States (824), 233, 191);
+ Add_Goto (Table.States (824), 234, 192);
+ Add_Goto (Table.States (824), 237, 193);
+ Add_Goto (Table.States (824), 251, 58);
+ Add_Goto (Table.States (824), 252, 59);
+ Add_Goto (Table.States (824), 255, 60);
+ Add_Goto (Table.States (824), 256, 194);
+ Add_Goto (Table.States (824), 268, 68);
+ Add_Goto (Table.States (824), 311, 83);
+ Add_Goto (Table.States (824), 402, 195);
+ Add_Goto (Table.States (824), 465, 196);
+ Table.States (824).Kernel := To_Vector ((((151, 0), 71, 5,
(32767, 0), 0), ((152, 0), 71, 7, (32767,
+ 0), 0), ((152, 1), 71, 3, (32767, 0), 0)));
+ Table.States (824).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (825).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (825), 12, (402, 0), 165);
+ Add_Action (Table.States (825), 46, (233, 2), 167);
+ Add_Action (Table.States (825), 52, (233, 3), 168);
+ Add_Action (Table.States (825), 65, (234, 1), 169);
+ Add_Action (Table.States (825), 76, (256, 0), 170);
+ Add_Action (Table.States (825), 85, (205, 4), 171);
+ Add_Action (Table.States (825), 86, (213, 2), 172);
+ Add_Action (Table.States (825), 90, (268, 0), 34);
+ Add_Action (Table.States (825), 106, (237, 1), 173);
+ Add_Action (Table.States (825), 107, (237, 0), 174);
+ Add_Action (Table.States (825), 115, (234, 0), 175);
+ Add_Action (Table.States (825), 116, (196, 0), 146);
+ Add_Action (Table.States (825), 117, (196, 1), 37);
+ Add_Action (Table.States (825), 118, (195, 6), 38);
+ Table.States (825).Goto_List.Set_Capacity (31);
+ Add_Goto (Table.States (825), 195, 176);
+ Add_Goto (Table.States (825), 196, 148);
+ Add_Goto (Table.States (825), 197, 54);
+ Add_Goto (Table.States (825), 198, 55);
+ Add_Goto (Table.States (825), 199, 56);
+ Add_Goto (Table.States (825), 201, 57);
+ Add_Goto (Table.States (825), 205, 177);
+ Add_Goto (Table.States (825), 206, 178);
+ Add_Goto (Table.States (825), 210, 179);
+ Add_Goto (Table.States (825), 211, 180);
+ Add_Goto (Table.States (825), 213, 181);
+ Add_Goto (Table.States (825), 214, 182);
+ Add_Goto (Table.States (825), 215, 183);
+ Add_Goto (Table.States (825), 218, 184);
+ Add_Goto (Table.States (825), 219, 185);
+ Add_Goto (Table.States (825), 220, 186);
+ Add_Goto (Table.States (825), 227, 1212);
+ Add_Goto (Table.States (825), 228, 188);
+ Add_Goto (Table.States (825), 231, 189);
+ Add_Goto (Table.States (825), 232, 190);
+ Add_Goto (Table.States (825), 233, 191);
+ Add_Goto (Table.States (825), 234, 192);
+ Add_Goto (Table.States (825), 237, 193);
+ Add_Goto (Table.States (825), 251, 58);
+ Add_Goto (Table.States (825), 252, 59);
+ Add_Goto (Table.States (825), 255, 60);
+ Add_Goto (Table.States (825), 256, 194);
+ Add_Goto (Table.States (825), 268, 68);
+ Add_Goto (Table.States (825), 311, 83);
+ Add_Goto (Table.States (825), 402, 195);
+ Add_Goto (Table.States (825), 465, 196);
+ Table.States (825).Kernel := To_Vector ((((148, 0), 72, 5,
(32767, 0), 0), ((148, 1), 72, 1, (32767,
+ 0), 0)));
+ Table.States (825).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (826).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (826), 12, (402, 0), 165);
+ Add_Action (Table.States (826), 46, (233, 2), 167);
+ Add_Action (Table.States (826), 52, (233, 3), 168);
+ Add_Action (Table.States (826), 65, (234, 1), 169);
+ Add_Action (Table.States (826), 76, (256, 0), 170);
+ Add_Action (Table.States (826), 85, (205, 4), 171);
+ Add_Action (Table.States (826), 86, (213, 2), 172);
+ Add_Action (Table.States (826), 90, (268, 0), 34);
+ Add_Action (Table.States (826), 106, (237, 1), 173);
+ Add_Action (Table.States (826), 107, (237, 0), 174);
+ Add_Action (Table.States (826), 115, (234, 0), 175);
+ Add_Action (Table.States (826), 116, (196, 0), 146);
+ Add_Action (Table.States (826), 117, (196, 1), 37);
+ Add_Action (Table.States (826), 118, (195, 6), 38);
+ Table.States (826).Goto_List.Set_Capacity (31);
+ Add_Goto (Table.States (826), 195, 176);
+ Add_Goto (Table.States (826), 196, 148);
+ Add_Goto (Table.States (826), 197, 54);
+ Add_Goto (Table.States (826), 198, 55);
+ Add_Goto (Table.States (826), 199, 56);
+ Add_Goto (Table.States (826), 201, 57);
+ Add_Goto (Table.States (826), 205, 177);
+ Add_Goto (Table.States (826), 206, 178);
+ Add_Goto (Table.States (826), 210, 179);
+ Add_Goto (Table.States (826), 211, 180);
+ Add_Goto (Table.States (826), 213, 181);
+ Add_Goto (Table.States (826), 214, 182);
+ Add_Goto (Table.States (826), 215, 183);
+ Add_Goto (Table.States (826), 218, 184);
+ Add_Goto (Table.States (826), 219, 185);
+ Add_Goto (Table.States (826), 220, 186);
+ Add_Goto (Table.States (826), 227, 1213);
+ Add_Goto (Table.States (826), 228, 188);
+ Add_Goto (Table.States (826), 231, 189);
+ Add_Goto (Table.States (826), 232, 190);
+ Add_Goto (Table.States (826), 233, 191);
+ Add_Goto (Table.States (826), 234, 192);
+ Add_Goto (Table.States (826), 237, 193);
+ Add_Goto (Table.States (826), 251, 58);
+ Add_Goto (Table.States (826), 252, 59);
+ Add_Goto (Table.States (826), 255, 60);
+ Add_Goto (Table.States (826), 256, 194);
+ Add_Goto (Table.States (826), 268, 68);
+ Add_Goto (Table.States (826), 311, 83);
+ Add_Goto (Table.States (826), 402, 195);
+ Add_Goto (Table.States (826), 465, 196);
+ Table.States (826).Kernel := To_Vector ((0 => ((146, 0), 73, 1,
(32767, 0), 0)));
+ Table.States (826).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (827).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (827), 46, (233, 2), 167);
+ Add_Action (Table.States (827), 52, (233, 3), 168);
+ Add_Action (Table.States (827), 65, (234, 1), 169);
+ Add_Action (Table.States (827), 76, (256, 0), 170);
+ Add_Action (Table.States (827), 85, (205, 4), 171);
+ Add_Action (Table.States (827), 86, (213, 2), 172);
+ Add_Action (Table.States (827), 90, (268, 0), 34);
+ Add_Action (Table.States (827), 106, (237, 1), 173);
+ Add_Action (Table.States (827), 107, (237, 0), 174);
+ Add_Action (Table.States (827), 115, (234, 0), 175);
+ Add_Action (Table.States (827), 116, (196, 0), 146);
+ Add_Action (Table.States (827), 117, (196, 1), 37);
+ Add_Action (Table.States (827), 118, (195, 6), 38);
+ Table.States (827).Goto_List.Set_Capacity (28);
+ Add_Goto (Table.States (827), 195, 176);
+ Add_Goto (Table.States (827), 196, 148);
+ Add_Goto (Table.States (827), 197, 54);
+ Add_Goto (Table.States (827), 198, 55);
+ Add_Goto (Table.States (827), 199, 56);
+ Add_Goto (Table.States (827), 201, 57);
+ Add_Goto (Table.States (827), 205, 177);
+ Add_Goto (Table.States (827), 206, 178);
+ Add_Goto (Table.States (827), 210, 179);
+ Add_Goto (Table.States (827), 211, 180);
+ Add_Goto (Table.States (827), 213, 181);
+ Add_Goto (Table.States (827), 214, 182);
+ Add_Goto (Table.States (827), 215, 183);
+ Add_Goto (Table.States (827), 218, 184);
+ Add_Goto (Table.States (827), 219, 185);
+ Add_Goto (Table.States (827), 220, 186);
+ Add_Goto (Table.States (827), 231, 1214);
+ Add_Goto (Table.States (827), 232, 190);
+ Add_Goto (Table.States (827), 233, 191);
+ Add_Goto (Table.States (827), 234, 192);
+ Add_Goto (Table.States (827), 237, 193);
+ Add_Goto (Table.States (827), 251, 58);
+ Add_Goto (Table.States (827), 252, 59);
+ Add_Goto (Table.States (827), 255, 60);
+ Add_Goto (Table.States (827), 256, 194);
+ Add_Goto (Table.States (827), 268, 68);
+ Add_Goto (Table.States (827), 311, 83);
+ Add_Goto (Table.States (827), 465, 196);
+ Table.States (827).Kernel := To_Vector ((0 => ((145, 0), 74, 3,
(32767, 0), 0)));
+ Table.States (827).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ end Subr_34;
+ procedure Subr_35
+ is begin
+ Table.States (828).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (828), 52, (187, 0), 347);
+ Add_Action (Table.States (828), 86, (252, 0), 33);
+ Add_Action (Table.States (828), 90, (268, 0), 34);
+ Add_Action (Table.States (828), 116, (196, 0), 146);
+ Add_Action (Table.States (828), 117, (196, 1), 37);
+ Add_Action (Table.States (828), 118, (195, 6), 38);
+ Table.States (828).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (828), 131, 1215);
+ Add_Goto (Table.States (828), 187, 365);
+ Add_Goto (Table.States (828), 195, 528);
+ Add_Goto (Table.States (828), 196, 148);
+ Add_Goto (Table.States (828), 197, 54);
+ Add_Goto (Table.States (828), 198, 55);
+ Add_Goto (Table.States (828), 199, 56);
+ Add_Goto (Table.States (828), 201, 57);
+ Add_Goto (Table.States (828), 251, 58);
+ Add_Goto (Table.States (828), 252, 59);
+ Add_Goto (Table.States (828), 255, 60);
+ Add_Goto (Table.States (828), 268, 68);
+ Add_Goto (Table.States (828), 311, 83);
+ Table.States (828).Kernel := To_Vector ((((138, 9), 76, 6,
(32767, 0), 0), ((138, 10), 76, 4, (32767,
+ 0), 0), ((138, 11), 76, 1, (32767, 0), 0), ((328, 44), 76,
8, (32767, 0), 0), ((328, 45), 76, 6,
+ (32767, 0), 0), ((328, 46), 76, 6, (32767, 0), 0), ((328, 47),
76, 4, (32767, 0), 0)));
+ Table.States (828).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (829).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (829), 27, (327, 20), 1216);
+ Add_Action (Table.States (829), 57, (181, 0), 1217);
+ Add_Action (Table.States (829), 65, (170, 2), 821);
+ Add_Action (Table.States (829), 67, (170, 0), 822);
+ Add_Action (Table.States (829), 76, (138, 6), 1218);
+ Table.States (829).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (829), 170, 1219);
+ Table.States (829).Kernel := To_Vector ((((138, 6), 77, 7,
(32767, 0), 0), ((138, 7), 77, 5, (32767,
+ 0), 0), ((138, 8), 77, 2, (32767, 0), 0), ((169, 4), 77, 2,
(32767, 0), 0), ((181, 0), 77, 3,
+ (32767, 0), 0), ((181, 1), 77, 1, (32767, 0), 0), ((327, 20),
77, 4, (32767, 0), 0), ((327, 21),
+ 77, 2, (32767, 0), 0), ((328, 36), 77, 9, (32767, 0), 0),
((328, 37), 77, 7, (32767, 0), 0), ((328,
+ 38), 77, 7, (32767, 0), 0), ((328, 39), 77, 5, (32767, 0),
0)));
+ Table.States (829).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (181, 0), 57, 1217)));
+ Table.States (830).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (830), 58, (328, 28), 1220);
+ Add_Action (Table.States (830), 68, (169, 0), 1221);
+ Add_Action (Table.States (830), 76, (138, 3), 1222);
+ Add_Action (Table.States (830), 77, (138, 0), 1223);
+ Table.States (830).Kernel := To_Vector ((((138, 0), 78, 8,
(32767, 0), 0), ((138, 1), 78, 6, (32767,
+ 0), 0), ((138, 2), 78, 3, (32767, 0), 0), ((138, 3), 78, 7,
(32767, 0), 0), ((138, 4), 78, 5,
+ (32767, 0), 0), ((138, 5), 78, 2, (32767, 0), 0), ((169, 0),
78, 4, (32767, 0), 0), ((169, 1), 78,
+ 3, (32767, 0), 0), ((327, 12), 78, 6, (32767, 0), 0), ((327,
13), 78, 4, (32767, 0), 0), ((327, 14),
+ 78, 5, (32767, 0), 0), ((327, 15), 78, 3, (32767, 0), 0),
((328, 24), 78, 10, (32767, 0), 0),
+ ((328, 25), 78, 8, (32767, 0), 0), ((328, 26), 78, 8, (32767,
0), 0), ((328, 27), 78, 6, (32767,
+ 0), 0), ((328, 28), 78, 10, (32767, 0), 0), ((328, 29), 78,
8, (32767, 0), 0), ((328, 30), 78, 8,
+ (32767, 0), 0), ((328, 31), 78, 6, (32767, 0), 0), ((328, 32),
78, 9, (32767, 0), 0), ((328, 33),
+ 78, 7, (32767, 0), 0), ((328, 34), 78, 7, (32767, 0), 0),
((328, 35), 78, 5, (32767, 0), 0)));
+ Table.States (830).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (138, 3), 76, 1222)));
+ Table.States (831).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (831), 116, (143, 0), 1224);
+ Add_Action (Table.States (831), 118, (143, 1), 1225);
+ Table.States (831).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (831), 141, 1226);
+ Add_Goto (Table.States (831), 143, 1227);
+ Table.States (831).Kernel := To_Vector ((0 => ((142, 0), 85, 2,
(32767, 0), 0)));
+ Table.States (831).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (143, 0), 116, 1224)));
+ Table.States (832).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (832), 61, (434, 0), 299);
+ Add_Action (Table.States (832), 108, (128, 3), 1228);
+ Table.States (832).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (832), 434, 1229);
+ Table.States (832).Kernel := To_Vector ((((128, 2), 129, 3,
(32767, 0), 0), ((128, 3), 129, 1, (32767,
+ 0), 0)));
+ Table.States (832).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (128, 3), 108, 1228)));
+ Table.States (833).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (833), (61, 108), (129, 6), 1);
+ Table.States (833).Kernel := To_Vector ((0 => ((129, 6), 138, 0,
(129, 6), 1)));
+ Table.States (833).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (129, 6), 1)));
+ Table.States (834).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (834), (61, 108), (129, 0), 1);
+ Table.States (834).Kernel := To_Vector ((0 => ((129, 0), 142, 0,
(129, 0), 1)));
+ Table.States (834).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (129, 0), 1)));
+ Table.States (835).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (835), (61, 108), (129, 1), 1);
+ Table.States (835).Kernel := To_Vector ((0 => ((129, 1), 144, 0,
(129, 1), 1)));
+ Table.States (835).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (129, 1), 1)));
+ Table.States (836).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (836), (61, 108), (144, 0), 1);
+ Table.States (836).Kernel := To_Vector ((0 => ((144, 0), 145, 0,
(144, 0), 1)));
+ Table.States (836).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (144, 0), 1)));
+ Table.States (837).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (837), (61, 108), (144, 1), 1);
+ Table.States (837).Kernel := To_Vector ((0 => ((144, 1), 146, 0,
(144, 1), 1)));
+ Table.States (837).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (144, 1), 1)));
+ Table.States (838).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (838), (61, 108), (129, 2), 1);
+ Table.States (838).Kernel := To_Vector ((0 => ((129, 2), 147, 0,
(129, 2), 1)));
+ Table.States (838).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (129, 2), 1)));
+ Table.States (839).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (839), (61, 108), (147, 0), 1);
+ Table.States (839).Kernel := To_Vector ((0 => ((147, 0), 148, 0,
(147, 0), 1)));
+ Table.States (839).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (147, 0), 1)));
+ Table.States (840).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (840), (61, 108), (147, 1), 1);
+ Table.States (840).Kernel := To_Vector ((0 => ((147, 1), 150, 0,
(147, 1), 1)));
+ Table.States (840).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (147, 1), 1)));
+ Table.States (841).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (841), (61, 108), (150, 0), 1);
+ Table.States (841).Kernel := To_Vector ((0 => ((150, 0), 151, 0,
(150, 0), 1)));
+ Table.States (841).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (150, 0), 1)));
+ Table.States (842).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (842), (61, 108), (150, 1), 1);
+ Table.States (842).Kernel := To_Vector ((0 => ((150, 1), 152, 0,
(150, 1), 1)));
+ Table.States (842).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (150, 1), 1)));
+ Table.States (843).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (843), (61, 108), (129, 3), 1);
+ Table.States (843).Kernel := To_Vector ((0 => ((129, 3), 154, 0,
(129, 3), 1)));
+ Table.States (843).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (129, 3), 1)));
+ Table.States (844).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (844), (61, 108), (129, 4), 1);
+ Table.States (844).Kernel := To_Vector ((0 => ((129, 4), 169, 0,
(129, 4), 1)));
+ Table.States (844).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (129, 4), 1)));
+ Table.States (845).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (845), (61, 108), (169, 5), 1);
+ Table.States (845).Kernel := To_Vector ((0 => ((169, 5), 170, 0,
(169, 5), 1)));
+ Table.States (845).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (169, 5), 1)));
+ Table.States (846).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (846), (61, 108), (129, 7), 1);
+ Table.States (846).Kernel := To_Vector ((0 => ((129, 7), 181, 0,
(129, 7), 1)));
+ Table.States (846).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (129, 7), 1)));
+ Table.States (847).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (847), (61, 108), (129, 5), 1);
+ Table.States (847).Kernel := To_Vector ((0 => ((129, 5), 183, 0,
(129, 5), 1)));
+ Table.States (847).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (129, 5), 1)));
+ Table.States (848).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (848), (49, 61, 108), (183, 1), 1);
+ Table.States (848).Kernel := To_Vector ((0 => ((183, 1), 184, 0,
(183, 1), 1)));
+ Table.States (848).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (183, 1), 1)));
+ Table.States (849).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (849), 56, (183, 2), 1230);
+ Table.States (849).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (849), 184, 1231);
+ Table.States (849).Kernel := To_Vector ((((183, 0), 187, 2,
(32767, 0), 0), ((183, 2), 187, 3, (32767,
+ 0), 0), ((183, 3), 187, 2, (32767, 0), 0)));
+ Table.States (849).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (183, 2), 56, 1230)));
+ Table.States (850).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (850), 87, (165, 0), 1232);
+ Table.States (850).Kernel := To_Vector ((0 => ((165, 0), 92, 1,
(32767, 0), 0)));
+ Table.States (850).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (165, 0), 87, 1232)));
+ Table.States (851).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (851), 93, (168, 0), 1233);
+ Add_Action (Table.States (851), 95, (136, 1), 280);
+ Table.States (851).Kernel := To_Vector ((((136, 1), 136, 2,
(32767, 0), 0), ((168, 0), 136, 6, (32767,
+ 0), 0), ((168, 1), 136, 4, (32767, 0), 0), ((168, 2), 136,
4, (32767, 0), 0), ((168, 3), 136, 2,
+ (32767, 0), 0), ((168, 4), 136, 5, (32767, 0), 0), ((168, 5),
136, 3, (32767, 0), 0)));
+ Table.States (851).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (168, 0), 93, 1233)));
+ Table.States (852).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (852), 87, (167, 0), 1234);
+ Add_Action (Table.States (852), 108, (166, 1), 1235);
+ Table.States (852).Kernel := To_Vector ((((166, 1), 166, 4,
(32767, 0), 0), ((166, 2), 166, 4, (32767,
+ 0), 0), ((167, 0), 166, 1, (32767, 0), 0)));
+ Table.States (852).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (167, 0), 87, 1234)));
+ Table.States (853).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (853), (87, 108), (166, 0), 1);
+ Table.States (853).Kernel := To_Vector ((0 => ((166, 0), 168, 0,
(166, 0), 1)));
+ Table.States (853).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (166, 0), 1)));
+ Table.States (854).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (854), 27, (327, 10), 1236);
+ Add_Action (Table.States (854), 58, (328, 16), 1237);
+ Add_Action (Table.States (854), 68, (189, 0), 1238);
+ Add_Action (Table.States (854), 76, (328, 20), 1239);
+ Add_Action (Table.States (854), 77, (327, 8), 1240);
+ Add_Action (Table.States (854), 78, (327, 0), 1241);
+ Table.States (854).Kernel := To_Vector ((((189, 0), 82, 2,
(32767, 0), 0), ((327, 0), 82, 7, (32767,
+ 0), 0), ((327, 1), 82, 5, (32767, 0), 0), ((327, 2), 82, 6,
(32767, 0), 0), ((327, 3), 82, 4,
+ (32767, 0), 0), ((327, 4), 82, 6, (32767, 0), 0), ((327, 5),
82, 4, (32767, 0), 0), ((327, 6), 82,
+ 5, (32767, 0), 0), ((327, 7), 82, 3, (32767, 0), 0), ((327,
8), 82, 5, (32767, 0), 0), ((327, 9),
+ 82, 3, (32767, 0), 0), ((327, 10), 82, 4, (32767, 0), 0),
((327, 11), 82, 2, (32767, 0), 0), ((328,
+ 0), 82, 11, (32767, 0), 0), ((328, 1), 82, 9, (32767, 0),
0), ((328, 2), 82, 9, (32767, 0), 0),
+ ((328, 3), 82, 7, (32767, 0), 0), ((328, 4), 82, 11, (32767,
0), 0), ((328, 5), 82, 9, (32767, 0),
+ 0), ((328, 6), 82, 9, (32767, 0), 0), ((328, 7), 82, 7,
(32767, 0), 0), ((328, 8), 82, 10, (32767,
+ 0), 0), ((328, 9), 82, 8, (32767, 0), 0), ((328, 10), 82, 8,
(32767, 0), 0), ((328, 11), 82, 6,
+ (32767, 0), 0), ((328, 12), 82, 10, (32767, 0), 0), ((328,
13), 82, 8, (32767, 0), 0), ((328, 14),
+ 82, 8, (32767, 0), 0), ((328, 15), 82, 6, (32767, 0), 0),
((328, 16), 82, 10, (32767, 0), 0),
+ ((328, 17), 82, 8, (32767, 0), 0), ((328, 18), 82, 8, (32767,
0), 0), ((328, 19), 82, 6, (32767,
+ 0), 0), ((328, 20), 82, 9, (32767, 0), 0), ((328, 21), 82,
7, (32767, 0), 0), ((328, 22), 82, 7,
+ (32767, 0), 0), ((328, 23), 82, 5, (32767, 0), 0)));
+ Table.States (854).Minimal_Complete_Actions := To_Vector (((Shift,
(189, 0), 68, 1238), (Shift, (327, 10),
+ 27, 1236)));
+ Table.States (855).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (855), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (189, 1), 4);
+ Table.States (855).Kernel := To_Vector ((0 => ((189, 1), 108, 0,
(189, 1), 4)));
+ Table.States (855).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (189, 1), 4)));
+ Table.States (856).Action_List.Set_Capacity (18);
+ Add_Action (Table.States (856), 52, (187, 0), 347);
+ Add_Action (Table.States (856), 56, (183, 4), 816);
+ Add_Action (Table.States (856), 57, (181, 8), 817);
+ Add_Action (Table.States (856), 58, (181, 6), 1242);
+ Add_Action (Table.States (856), 59, (181, 4), 819);
+ Add_Action (Table.States (856), 60, (181, 2), 820);
+ Add_Action (Table.States (856), 65, (170, 2), 821);
+ Add_Action (Table.States (856), 67, (170, 0), 822);
+ Add_Action (Table.States (856), 68, (169, 2), 1243);
+ Add_Action (Table.States (856), 70, (156, 0), 519);
+ Add_Action (Table.States (856), 71, (151, 0), 824);
+ Add_Action (Table.States (856), 72, (148, 0), 825);
+ Add_Action (Table.States (856), 73, (146, 0), 826);
+ Add_Action (Table.States (856), 74, (145, 0), 827);
+ Add_Action (Table.States (856), 76, (138, 9), 1244);
+ Add_Action (Table.States (856), 77, (138, 6), 1245);
+ Add_Action (Table.States (856), 78, (138, 0), 1246);
+ Add_Action (Table.States (856), 85, (142, 0), 831);
+ Table.States (856).Goto_List.Set_Capacity (20);
+ Add_Goto (Table.States (856), 129, 1247);
+ Add_Goto (Table.States (856), 138, 833);
+ Add_Goto (Table.States (856), 142, 834);
+ Add_Goto (Table.States (856), 144, 835);
+ Add_Goto (Table.States (856), 145, 836);
+ Add_Goto (Table.States (856), 146, 837);
+ Add_Goto (Table.States (856), 147, 838);
+ Add_Goto (Table.States (856), 148, 839);
+ Add_Goto (Table.States (856), 150, 840);
+ Add_Goto (Table.States (856), 151, 841);
+ Add_Goto (Table.States (856), 152, 842);
+ Add_Goto (Table.States (856), 154, 843);
+ Add_Goto (Table.States (856), 156, 524);
+ Add_Goto (Table.States (856), 159, 525);
+ Add_Goto (Table.States (856), 169, 844);
+ Add_Goto (Table.States (856), 170, 845);
+ Add_Goto (Table.States (856), 181, 846);
+ Add_Goto (Table.States (856), 183, 847);
+ Add_Goto (Table.States (856), 184, 848);
+ Add_Goto (Table.States (856), 187, 849);
+ Table.States (856).Kernel := To_Vector ((((128, 0), 82, 4,
(32767, 0), 0), ((128, 1), 82, 2, (32767,
+ 0), 0)));
+ Table.States (856).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (181, 8), 57, 817)));
+ Table.States (857).Action_List.Set_Capacity (26);
+ Add_Action (Table.States (857), 45, Reduce, (196, 0), 1);
+ Add_Action (Table.States (857), 47, Reduce, (196, 0), 1);
+ Add_Action (Table.States (857), 48, Reduce, (196, 0), 1);
+ Add_Action (Table.States (857), 49, Reduce, (196, 0), 1);
+ Add_Action (Table.States (857), 52, Reduce, (196, 0), 1);
+ Add_Action (Table.States (857), 73, Reduce, (196, 0), 1);
+ Add_Action (Table.States (857), 75, Reduce, (196, 0), 1);
+ Add_Action (Table.States (857), 85, Reduce, (196, 0), 1);
+ Add_Action (Table.States (857), 87, Reduce, (196, 0), 1);
+ Add_Action (Table.States (857), 89, Reduce, (196, 0), 1);
+ Add_Action (Table.States (857), 95, Reduce, (196, 0), 1);
+ Add_Action (Table.States (857), 96, Reduce, (196, 0), 1);
+ Add_Action (Table.States (857), 98, Reduce, (196, 0), 1);
+ Add_Action (Table.States (857), 99, Reduce, (435, 1), 1);
+ Add_Action (Table.States (857), 100, Reduce, (196, 0), 1);
+ Add_Action (Table.States (857), 101, Reduce, (196, 0), 1);
+ Add_Action (Table.States (857), 103, Reduce, (196, 0), 1);
+ Add_Action (Table.States (857), 104, Reduce, (196, 0), 1);
+ Add_Action (Table.States (857), 106, Reduce, (196, 0), 1);
+ Add_Action (Table.States (857), 107, Reduce, (196, 0), 1);
+ Add_Action (Table.States (857), 109, Reduce, (196, 0), 1);
+ Add_Action (Table.States (857), 110, Reduce, (196, 0), 1);
+ Add_Action (Table.States (857), 111, Reduce, (196, 0), 1);
+ Add_Action (Table.States (857), 112, Reduce, (196, 0), 1);
+ Add_Action (Table.States (857), 113, (121, 0), 285);
+ Add_Conflict (Table.States (857), 113, (196, 0), 1);
+ Add_Action (Table.States (857), 114, (121, 1), 286);
+ Add_Conflict (Table.States (857), 114, (196, 0), 1);
+ Table.States (857).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (857), 121, 920);
+ Table.States (857).Kernel := To_Vector ((((196, 0), 116, 0,
(196, 0), 1), ((435, 0), 116, 2, (32767,
+ 0), 0), ((435, 1), 116, 0, (435, 1), 1)));
+ Table.States (857).Minimal_Complete_Actions := To_Vector
(((Reduce, (196, 0), 1), (Shift, (121, 0), 113,
+ 285), (Reduce, (435, 1), 1)));
+ Table.States (858).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (858), 87, (124, 2), 1248);
+ Table.States (858).Kernel := To_Vector ((0 => ((124, 2), 122, 2,
(32767, 0), 0)));
+ Table.States (858).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (124, 2), 87, 1248)));
+ Table.States (859).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (859), 87, (124, 0), 1249);
+ Add_Action (Table.States (859), 95, (123, 1), 1250);
+ Table.States (859).Kernel := To_Vector ((((123, 1), 123, 2,
(32767, 0), 0), ((124, 0), 123, 2, (32767,
+ 0), 0)));
+ Table.States (859).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (124, 0), 87, 1249)));
+ Table.States (860).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (860), (87, 95), (123, 0), 1);
+ Table.States (860).Kernel := To_Vector ((0 => ((123, 0), 125, 0,
(123, 0), 1)));
+ Table.States (860).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (123, 0), 1)));
+ Table.States (861).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (861), (87, 95), (125, 1), 1);
+ Table.States (861).Kernel := To_Vector ((0 => ((125, 1), 227, 0,
(125, 1), 1)));
+ Table.States (861).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 1)));
+ Table.States (862).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (862), (1 => 87), (122, 0), 1);
+ Table.States (862).Kernel := To_Vector ((0 => ((122, 0), 242, 0,
(122, 0), 1)));
+ Table.States (862).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (122, 0), 1)));
+ Table.States (863).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (863), (1 => 87), (122, 1), 1);
+ Table.States (863).Kernel := To_Vector ((0 => ((122, 1), 245, 0,
(122, 1), 1)));
+ Table.States (863).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (122, 1), 1)));
+ Table.States (864).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (864), (1 => 87), (122, 2), 1);
+ Table.States (864).Kernel := To_Vector ((0 => ((122, 2), 247, 0,
(122, 2), 1)));
+ Table.States (864).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (122, 2), 1)));
+ Table.States (865).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (865), 99, (125, 0), 1251);
+ Table.States (865).Kernel := To_Vector ((0 => ((125, 0), 435, 2,
(32767, 0), 0)));
+ Table.States (865).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (125, 0), 99, 1251)));
+ Table.States (866).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (866), 87, (252, 0), 1252);
+ Table.States (866).Kernel := To_Vector ((0 => ((252, 0), 277, 8,
(32767, 0), 0)));
+ Table.States (866).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (252, 0), 87, 1252)));
+ Table.States (867).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (867), (113, 114), (252, 1), 4);
+ Table.States (867).Kernel := To_Vector ((0 => ((252, 1), 88, 0,
(252, 1), 4)));
+ Table.States (867).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (252, 1), 4)));
+ Table.States (868).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (868), 12, (402, 0), 165);
+ Add_Action (Table.States (868), 46, (233, 2), 167);
+ Add_Action (Table.States (868), 52, (233, 3), 168);
+ Add_Action (Table.States (868), 65, (234, 1), 169);
+ Add_Action (Table.States (868), 76, (256, 0), 170);
+ Add_Action (Table.States (868), 85, (205, 4), 171);
+ Add_Action (Table.States (868), 86, (213, 2), 172);
+ Add_Action (Table.States (868), 90, (268, 0), 34);
+ Add_Action (Table.States (868), 106, (237, 1), 173);
+ Add_Action (Table.States (868), 107, (237, 0), 174);
+ Add_Action (Table.States (868), 115, (234, 0), 175);
+ Add_Action (Table.States (868), 116, (196, 0), 146);
+ Add_Action (Table.States (868), 117, (196, 1), 37);
+ Add_Action (Table.States (868), 118, (195, 6), 38);
+ Table.States (868).Goto_List.Set_Capacity (31);
+ Add_Goto (Table.States (868), 195, 176);
+ Add_Goto (Table.States (868), 196, 148);
+ Add_Goto (Table.States (868), 197, 54);
+ Add_Goto (Table.States (868), 198, 55);
+ Add_Goto (Table.States (868), 199, 56);
+ Add_Goto (Table.States (868), 201, 57);
+ Add_Goto (Table.States (868), 205, 177);
+ Add_Goto (Table.States (868), 206, 178);
+ Add_Goto (Table.States (868), 210, 179);
+ Add_Goto (Table.States (868), 211, 180);
+ Add_Goto (Table.States (868), 213, 181);
+ Add_Goto (Table.States (868), 214, 182);
+ Add_Goto (Table.States (868), 215, 183);
+ Add_Goto (Table.States (868), 218, 184);
+ Add_Goto (Table.States (868), 219, 185);
+ Add_Goto (Table.States (868), 220, 186);
+ Add_Goto (Table.States (868), 227, 1253);
+ Add_Goto (Table.States (868), 228, 188);
+ Add_Goto (Table.States (868), 231, 189);
+ Add_Goto (Table.States (868), 232, 190);
+ Add_Goto (Table.States (868), 233, 191);
+ Add_Goto (Table.States (868), 234, 192);
+ Add_Goto (Table.States (868), 237, 193);
+ Add_Goto (Table.States (868), 251, 58);
+ Add_Goto (Table.States (868), 252, 59);
+ Add_Goto (Table.States (868), 255, 60);
+ Add_Goto (Table.States (868), 256, 194);
+ Add_Goto (Table.States (868), 268, 68);
+ Add_Goto (Table.States (868), 311, 83);
+ Add_Goto (Table.States (868), 402, 195);
+ Add_Goto (Table.States (868), 465, 196);
+ Table.States (868).Kernel := To_Vector ((0 => ((221, 0), 50, 3,
(32767, 0), 0)));
+ Table.States (868).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (869).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (869), (87, 88, 95), (221, 1), 3);
+ Table.States (869).Kernel := To_Vector ((0 => ((221, 1), 314, 0,
(221, 1), 3)));
+ Table.States (869).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (221, 1), 3)));
+ Table.States (870).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (870), 12, (402, 0), 165);
+ Add_Action (Table.States (870), 46, (233, 2), 167);
+ Add_Action (Table.States (870), 52, (233, 3), 168);
+ Add_Action (Table.States (870), 65, (234, 1), 169);
+ Add_Action (Table.States (870), 76, (256, 0), 170);
+ Add_Action (Table.States (870), 85, (205, 4), 171);
+ Add_Action (Table.States (870), 86, (213, 2), 172);
+ Add_Action (Table.States (870), 90, (268, 0), 34);
+ Add_Action (Table.States (870), 106, (237, 1), 173);
+ Add_Action (Table.States (870), 107, (237, 0), 174);
+ Add_Action (Table.States (870), 115, (234, 0), 175);
+ Add_Action (Table.States (870), 116, (196, 0), 146);
+ Add_Action (Table.States (870), 117, (196, 1), 37);
+ Add_Action (Table.States (870), 118, (195, 6), 38);
+ Table.States (870).Goto_List.Set_Capacity (31);
+ Add_Goto (Table.States (870), 195, 176);
+ Add_Goto (Table.States (870), 196, 148);
+ Add_Goto (Table.States (870), 197, 54);
+ Add_Goto (Table.States (870), 198, 55);
+ Add_Goto (Table.States (870), 199, 56);
+ Add_Goto (Table.States (870), 201, 57);
+ Add_Goto (Table.States (870), 205, 177);
+ Add_Goto (Table.States (870), 206, 178);
+ Add_Goto (Table.States (870), 210, 179);
+ Add_Goto (Table.States (870), 211, 180);
+ Add_Goto (Table.States (870), 213, 181);
+ Add_Goto (Table.States (870), 214, 182);
+ Add_Goto (Table.States (870), 215, 183);
+ Add_Goto (Table.States (870), 218, 184);
+ Add_Goto (Table.States (870), 219, 185);
+ Add_Goto (Table.States (870), 220, 186);
+ Add_Goto (Table.States (870), 227, 1254);
+ Add_Goto (Table.States (870), 228, 188);
+ Add_Goto (Table.States (870), 231, 189);
+ Add_Goto (Table.States (870), 232, 190);
+ Add_Goto (Table.States (870), 233, 191);
+ Add_Goto (Table.States (870), 234, 192);
+ Add_Goto (Table.States (870), 237, 193);
+ Add_Goto (Table.States (870), 251, 58);
+ Add_Goto (Table.States (870), 252, 59);
+ Add_Goto (Table.States (870), 255, 60);
+ Add_Goto (Table.States (870), 256, 194);
+ Add_Goto (Table.States (870), 268, 68);
+ Add_Goto (Table.States (870), 311, 83);
+ Add_Goto (Table.States (870), 402, 195);
+ Add_Goto (Table.States (870), 465, 196);
+ Table.States (870).Kernel := To_Vector ((0 => ((221, 2), 50, 3,
(32767, 0), 0)));
+ Table.States (870).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ end Subr_35;
+ procedure Subr_36
+ is begin
+ Table.States (871).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (871), (87, 88, 95), (221, 3), 3);
+ Table.States (871).Kernel := To_Vector ((0 => ((221, 3), 314, 0,
(221, 3), 3)));
+ Table.States (871).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (221, 3), 3)));
+ Table.States (872).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (872), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (335, 5), 4);
+ Table.States (872).Kernel := To_Vector ((0 => ((335, 5), 108, 0,
(335, 5), 4)));
+ Table.States (872).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (335, 5), 4)));
+ Table.States (873).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (873), 108, (335, 4), 1255);
+ Table.States (873).Kernel := To_Vector ((0 => ((335, 4), 434, 1,
(32767, 0), 0)));
+ Table.States (873).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (335, 4), 108, 1255)));
+ Table.States (874).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (874), 86, (252, 0), 33);
+ Add_Action (Table.States (874), 90, (268, 0), 34);
+ Add_Action (Table.States (874), 116, (196, 0), 146);
+ Add_Action (Table.States (874), 117, (196, 1), 37);
+ Add_Action (Table.States (874), 118, (195, 6), 38);
+ Table.States (874).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (874), 195, 1256);
+ Add_Goto (Table.States (874), 196, 148);
+ Add_Goto (Table.States (874), 197, 54);
+ Add_Goto (Table.States (874), 198, 55);
+ Add_Goto (Table.States (874), 199, 56);
+ Add_Goto (Table.States (874), 201, 57);
+ Add_Goto (Table.States (874), 251, 58);
+ Add_Goto (Table.States (874), 252, 59);
+ Add_Goto (Table.States (874), 255, 60);
+ Add_Goto (Table.States (874), 268, 68);
+ Add_Goto (Table.States (874), 311, 83);
+ Table.States (874).Kernel := To_Vector ((((336, 0), 24, 4,
(32767, 0), 0), ((336, 1), 24, 2, (32767,
+ 0), 0)));
+ Table.States (874).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (875).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (875), 30, (296, 0), 476);
+ Add_Action (Table.States (875), 85, (299, 0), 1257);
+ Table.States (875).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (875), 296, 479);
+ Add_Goto (Table.States (875), 297, 1258);
+ Add_Goto (Table.States (875), 299, 481);
+ Table.States (875).Kernel := To_Vector ((0 => ((188, 11), 53, 2,
(32767, 0), 0)));
+ Table.States (875).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (296, 0), 30, 476)));
+ Table.States (876).Action_List.Set_Capacity (11);
+ Add_Action (Table.States (876), 24, Reduce, (295, 1), 0);
+ Add_Action (Table.States (876), 33, Reduce, (295, 1), 0);
+ Add_Action (Table.States (876), 47, Reduce, (295, 1), 0);
+ Add_Action (Table.States (876), 49, Reduce, (295, 1), 0);
+ Add_Action (Table.States (876), 61, Reduce, (295, 1), 0);
+ Add_Action (Table.States (876), 69, Reduce, (295, 1), 0);
+ Add_Action (Table.States (876), 82, Reduce, (295, 1), 0);
+ Add_Action (Table.States (876), 85, (299, 0), 1257);
+ Add_Action (Table.States (876), 87, Reduce, (295, 1), 0);
+ Add_Action (Table.States (876), 94, Reduce, (295, 1), 0);
+ Add_Action (Table.States (876), 108, Reduce, (295, 1), 0);
+ Table.States (876).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (876), 295, 1259);
+ Add_Goto (Table.States (876), 299, 426);
+ Table.States (876).Kernel := To_Vector ((0 => ((188, 7), 54, 0,
(295, 1), 0)));
+ Table.States (876).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (295, 1), 0)));
+ Table.States (877).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (877), 53, (188, 10), 1260);
+ Add_Action (Table.States (877), 54, (188, 6), 1261);
+ Table.States (877).Kernel := To_Vector ((((188, 6), 59, 1,
(32767, 0), 0), ((188, 10), 59, 3, (32767,
+ 0), 0)));
+ Table.States (877).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (188, 6), 54, 1261)));
+ Table.States (878).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (878), 86, (252, 0), 33);
+ Add_Action (Table.States (878), 90, (268, 0), 34);
+ Add_Action (Table.States (878), 116, (196, 0), 146);
+ Add_Action (Table.States (878), 117, (196, 1), 37);
+ Add_Action (Table.States (878), 118, (195, 6), 38);
+ Table.States (878).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (878), 195, 1262);
+ Add_Goto (Table.States (878), 196, 148);
+ Add_Goto (Table.States (878), 197, 54);
+ Add_Goto (Table.States (878), 198, 55);
+ Add_Goto (Table.States (878), 199, 56);
+ Add_Goto (Table.States (878), 201, 57);
+ Add_Goto (Table.States (878), 251, 58);
+ Add_Goto (Table.States (878), 252, 59);
+ Add_Goto (Table.States (878), 255, 60);
+ Add_Goto (Table.States (878), 268, 68);
+ Add_Goto (Table.States (878), 311, 83);
+ Table.States (878).Kernel := To_Vector ((0 => ((188, 2), 79, 1,
(32767, 0), 0)));
+ Table.States (878).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (879).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (879), 24, Reduce, (188, 3), 2);
+ Add_Action (Table.States (879), 33, Reduce, (188, 3), 2);
+ Add_Action (Table.States (879), 47, Reduce, (188, 3), 2);
+ Add_Action (Table.States (879), 49, Reduce, (188, 3), 2);
+ Add_Action (Table.States (879), 61, Reduce, (188, 3), 2);
+ Add_Action (Table.States (879), 69, Reduce, (188, 3), 2);
+ Add_Action (Table.States (879), 82, Reduce, (188, 3), 2);
+ Add_Action (Table.States (879), 85, (198, 0), 281);
+ Add_Action (Table.States (879), 87, Reduce, (188, 3), 2);
+ Add_Action (Table.States (879), 94, Reduce, (188, 3), 2);
+ Add_Action (Table.States (879), 96, (197, 0), 283);
+ Add_Action (Table.States (879), 108, Reduce, (188, 3), 2);
+ Add_Action (Table.States (879), 113, (121, 0), 285);
+ Add_Action (Table.States (879), 114, (121, 1), 286);
+ Table.States (879).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (879), 121, 287);
+ Add_Goto (Table.States (879), 313, 289);
+ Table.States (879).Kernel := To_Vector ((((188, 3), 195, 0,
(188, 3), 2), ((197, 0), 195, 2, (32767,
+ 0), 0), ((198, 0), 195, 3, (32767, 0), 0), ((199, 0), 195,
2, (32767, 0), 0), ((201, 0), 195, 2,
+ (32767, 0), 0), ((255, 0), 195, 3, (32767, 0), 0), ((311, 0),
195, 3, (32767, 0), 0)));
+ Table.States (879).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (188, 3), 2)));
+ Table.States (880).Action_List.Set_Capacity (9);
+ Add_Action (Table.States (880), 53, (188, 9), 1263);
+ Add_Action (Table.States (880), 54, (188, 5), 1264);
+ Add_Action (Table.States (880), 59, (188, 4), 1265);
+ Add_Action (Table.States (880), 79, (188, 0), 1266);
+ Add_Action (Table.States (880), 86, (252, 0), 33);
+ Add_Action (Table.States (880), 90, (268, 0), 34);
+ Add_Action (Table.States (880), 116, (196, 0), 146);
+ Add_Action (Table.States (880), 117, (196, 1), 37);
+ Add_Action (Table.States (880), 118, (195, 6), 38);
+ Table.States (880).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (880), 195, 1267);
+ Add_Goto (Table.States (880), 196, 148);
+ Add_Goto (Table.States (880), 197, 54);
+ Add_Goto (Table.States (880), 198, 55);
+ Add_Goto (Table.States (880), 199, 56);
+ Add_Goto (Table.States (880), 201, 57);
+ Add_Goto (Table.States (880), 251, 58);
+ Add_Goto (Table.States (880), 252, 59);
+ Add_Goto (Table.States (880), 255, 60);
+ Add_Goto (Table.States (880), 268, 68);
+ Add_Goto (Table.States (880), 311, 83);
+ Table.States (880).Kernel := To_Vector ((((188, 0), 56, 2,
(32767, 0), 0), ((188, 1), 56, 1, (32767,
+ 0), 0), ((188, 4), 56, 2, (32767, 0), 0), ((188, 5), 56, 1,
(32767, 0), 0), ((188, 8), 56, 4,
+ (32767, 0), 0), ((188, 9), 56, 3, (32767, 0), 0)));
+ Table.States (880).Minimal_Complete_Actions := To_Vector (((Shift,
(196, 0), 116, 146), (Shift, (188, 5),
+ 54, 1264)));
+ Table.States (881).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (881), 24, (335, 0), 1268);
+ Add_Action (Table.States (881), 85, (198, 0), 281);
+ Add_Action (Table.States (881), 96, (197, 0), 283);
+ Add_Action (Table.States (881), 113, (121, 0), 285);
+ Add_Action (Table.States (881), 114, (121, 1), 286);
+ Table.States (881).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (881), 121, 287);
+ Add_Goto (Table.States (881), 313, 289);
+ Table.States (881).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0), ((335, 0),
195, 5, (32767, 0), 0), ((335, 1),
+ 195, 3, (32767, 0), 0)));
+ Table.States (881).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (335, 0), 24, 1268)));
+ Table.States (882).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (882), 86, (252, 0), 33);
+ Add_Action (Table.States (882), 90, (268, 0), 34);
+ Add_Action (Table.States (882), 116, (196, 0), 146);
+ Add_Action (Table.States (882), 117, (196, 1), 37);
+ Add_Action (Table.States (882), 118, (195, 6), 38);
+ Table.States (882).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (882), 195, 1269);
+ Add_Goto (Table.States (882), 196, 148);
+ Add_Goto (Table.States (882), 197, 54);
+ Add_Goto (Table.States (882), 198, 55);
+ Add_Goto (Table.States (882), 199, 56);
+ Add_Goto (Table.States (882), 201, 57);
+ Add_Goto (Table.States (882), 251, 58);
+ Add_Goto (Table.States (882), 252, 59);
+ Add_Goto (Table.States (882), 255, 60);
+ Add_Goto (Table.States (882), 268, 68);
+ Add_Goto (Table.States (882), 311, 83);
+ Table.States (882).Kernel := To_Vector ((((335, 6), 24, 4,
(32767, 0), 0), ((335, 7), 24, 2, (32767,
+ 0), 0)));
+ Table.States (882).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (883).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (883), 86, (252, 0), 33);
+ Add_Action (Table.States (883), 90, (268, 0), 34);
+ Add_Action (Table.States (883), 116, (196, 0), 146);
+ Add_Action (Table.States (883), 117, (196, 1), 37);
+ Add_Action (Table.States (883), 118, (195, 6), 38);
+ Table.States (883).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (883), 195, 1270);
+ Add_Goto (Table.States (883), 196, 148);
+ Add_Goto (Table.States (883), 197, 54);
+ Add_Goto (Table.States (883), 198, 55);
+ Add_Goto (Table.States (883), 199, 56);
+ Add_Goto (Table.States (883), 201, 57);
+ Add_Goto (Table.States (883), 251, 58);
+ Add_Goto (Table.States (883), 252, 59);
+ Add_Goto (Table.States (883), 255, 60);
+ Add_Goto (Table.States (883), 268, 68);
+ Add_Goto (Table.States (883), 311, 83);
+ Table.States (883).Kernel := To_Vector ((((335, 2), 24, 4,
(32767, 0), 0), ((335, 3), 24, 2, (32767,
+ 0), 0)));
+ Table.States (883).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (884).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (884), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (394, 1), 4);
+ Table.States (884).Kernel := To_Vector ((0 => ((394, 1), 108, 0,
(394, 1), 4)));
+ Table.States (884).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (394, 1), 4)));
+ Table.States (885).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (885), 108, (394, 0), 1271);
+ Table.States (885).Kernel := To_Vector ((0 => ((394, 0), 434, 1,
(32767, 0), 0)));
+ Table.States (885).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (394, 0), 108, 1271)));
+ Table.States (886).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (886), 46, (233, 2), 167);
+ Add_Action (Table.States (886), 52, (187, 0), 356);
+ Add_Action (Table.States (886), 65, (234, 1), 169);
+ Add_Action (Table.States (886), 76, (256, 0), 170);
+ Add_Action (Table.States (886), 85, (205, 4), 171);
+ Add_Action (Table.States (886), 86, (213, 2), 172);
+ Add_Action (Table.States (886), 90, (268, 0), 34);
+ Add_Action (Table.States (886), 106, (237, 1), 173);
+ Add_Action (Table.States (886), 107, (237, 0), 174);
+ Add_Action (Table.States (886), 115, (234, 0), 175);
+ Add_Action (Table.States (886), 116, (196, 0), 146);
+ Add_Action (Table.States (886), 117, (196, 1), 37);
+ Add_Action (Table.States (886), 118, (195, 6), 38);
+ Table.States (886).Goto_List.Set_Capacity (36);
+ Add_Goto (Table.States (886), 131, 693);
+ Add_Goto (Table.States (886), 140, 694);
+ Add_Goto (Table.States (886), 155, 1272);
+ Add_Goto (Table.States (886), 157, 1273);
+ Add_Goto (Table.States (886), 158, 1274);
+ Add_Goto (Table.States (886), 160, 1275);
+ Add_Goto (Table.States (886), 187, 365);
+ Add_Goto (Table.States (886), 195, 1276);
+ Add_Goto (Table.States (886), 196, 148);
+ Add_Goto (Table.States (886), 197, 54);
+ Add_Goto (Table.States (886), 198, 55);
+ Add_Goto (Table.States (886), 199, 56);
+ Add_Goto (Table.States (886), 201, 57);
+ Add_Goto (Table.States (886), 203, 369);
+ Add_Goto (Table.States (886), 205, 177);
+ Add_Goto (Table.States (886), 206, 178);
+ Add_Goto (Table.States (886), 210, 179);
+ Add_Goto (Table.States (886), 211, 180);
+ Add_Goto (Table.States (886), 213, 181);
+ Add_Goto (Table.States (886), 214, 182);
+ Add_Goto (Table.States (886), 215, 183);
+ Add_Goto (Table.States (886), 218, 184);
+ Add_Goto (Table.States (886), 219, 185);
+ Add_Goto (Table.States (886), 220, 186);
+ Add_Goto (Table.States (886), 231, 696);
+ Add_Goto (Table.States (886), 232, 190);
+ Add_Goto (Table.States (886), 233, 191);
+ Add_Goto (Table.States (886), 234, 192);
+ Add_Goto (Table.States (886), 237, 193);
+ Add_Goto (Table.States (886), 251, 58);
+ Add_Goto (Table.States (886), 252, 59);
+ Add_Goto (Table.States (886), 255, 60);
+ Add_Goto (Table.States (886), 256, 194);
+ Add_Goto (Table.States (886), 268, 68);
+ Add_Goto (Table.States (886), 311, 83);
+ Add_Goto (Table.States (886), 465, 196);
+ Table.States (886).Kernel := To_Vector ((((156, 0), 85, 6,
(32767, 0), 0), ((159, 0), 85, 4, (32767,
+ 0), 0)));
+ Table.States (886).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (887).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (887), 61, (434, 0), 299);
+ Add_Action (Table.States (887), 94, (134, 0), 282);
+ Add_Action (Table.States (887), 108, (135, 11), 1277);
+ Table.States (887).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (887), 134, 1278);
+ Add_Goto (Table.States (887), 434, 1279);
+ Table.States (887).Kernel := To_Vector ((((135, 8), 131, 5,
(32767, 0), 0), ((135, 9), 131, 3, (32767,
+ 0), 0), ((135, 10), 131, 3, (32767, 0), 0), ((135, 11), 131,
1, (32767, 0), 0)));
+ Table.States (887).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 11), 108, 1277)));
+ Table.States (888).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (888), 108, (137, 0), 1280);
+ Table.States (888).Kernel := To_Vector ((0 => ((137, 0), 134, 1,
(32767, 0), 0)));
+ Table.States (888).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (137, 0), 108, 1280)));
+ Table.States (889).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (889), 61, (434, 0), 299);
+ Add_Action (Table.States (889), 94, (134, 0), 282);
+ Add_Action (Table.States (889), 108, (135, 43), 1281);
+ Table.States (889).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (889), 134, 1282);
+ Add_Goto (Table.States (889), 434, 1283);
+ Table.States (889).Kernel := To_Vector ((((135, 40), 154, 5,
(32767, 0), 0), ((135, 41), 154, 3,
+ (32767, 0), 0), ((135, 42), 154, 3, (32767, 0), 0), ((135,
43), 154, 1, (32767, 0), 0)));
+ Table.States (889).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 43), 108, 1281)));
+ Table.States (890).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (890), 61, (434, 0), 299);
+ Add_Action (Table.States (890), 94, (134, 0), 282);
+ Add_Action (Table.States (890), 108, (135, 27), 1284);
+ Table.States (890).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (890), 134, 1285);
+ Add_Goto (Table.States (890), 434, 1286);
+ Table.States (890).Kernel := To_Vector ((((135, 24), 188, 5,
(32767, 0), 0), ((135, 25), 188, 3,
+ (32767, 0), 0), ((135, 26), 188, 3, (32767, 0), 0), ((135,
27), 188, 1, (32767, 0), 0)));
+ Table.States (890).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 27), 108, 1284)));
+ Table.States (891).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (891), 52, (187, 0), 347);
+ Add_Action (Table.States (891), 56, (188, 2), 514);
+ Add_Action (Table.States (891), 70, (156, 0), 519);
+ Add_Action (Table.States (891), 86, (252, 0), 33);
+ Add_Action (Table.States (891), 90, (268, 0), 34);
+ Add_Action (Table.States (891), 116, (196, 0), 146);
+ Add_Action (Table.States (891), 117, (196, 1), 37);
+ Add_Action (Table.States (891), 118, (195, 6), 38);
+ Table.States (891).Goto_List.Set_Capacity (17);
+ Add_Goto (Table.States (891), 131, 1287);
+ Add_Goto (Table.States (891), 154, 1288);
+ Add_Goto (Table.States (891), 156, 524);
+ Add_Goto (Table.States (891), 159, 525);
+ Add_Goto (Table.States (891), 187, 526);
+ Add_Goto (Table.States (891), 188, 1289);
+ Add_Goto (Table.States (891), 195, 528);
+ Add_Goto (Table.States (891), 196, 148);
+ Add_Goto (Table.States (891), 197, 54);
+ Add_Goto (Table.States (891), 198, 55);
+ Add_Goto (Table.States (891), 199, 56);
+ Add_Goto (Table.States (891), 201, 57);
+ Add_Goto (Table.States (891), 251, 58);
+ Add_Goto (Table.States (891), 252, 59);
+ Add_Goto (Table.States (891), 255, 60);
+ Add_Goto (Table.States (891), 268, 68);
+ Add_Goto (Table.States (891), 311, 83);
+ Table.States (891).Kernel := To_Vector ((((135, 0), 79, 6,
(32767, 0), 0), ((135, 1), 79, 4, (32767,
+ 0), 0), ((135, 2), 79, 4, (32767, 0), 0), ((135, 3), 79, 2,
(32767, 0), 0), ((135, 16), 79, 7,
+ (32767, 0), 0), ((135, 17), 79, 5, (32767, 0), 0), ((135, 18),
79, 5, (32767, 0), 0), ((135, 19),
+ 79, 3, (32767, 0), 0), ((135, 32), 79, 12, (32767, 0), 0),
((135, 33), 79, 10, (32767, 0), 0),
+ ((135, 34), 79, 10, (32767, 0), 0), ((135, 35), 79, 8,
(32767, 0), 0)));
+ Table.States (891).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (892).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (892), 61, (434, 0), 299);
+ Add_Action (Table.States (892), 94, (134, 0), 282);
+ Add_Action (Table.States (892), 108, (135, 7), 1290);
+ Table.States (892).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (892), 134, 1291);
+ Add_Goto (Table.States (892), 434, 1292);
+ Table.States (892).Kernel := To_Vector ((((135, 4), 131, 5,
(32767, 0), 0), ((135, 5), 131, 3, (32767,
+ 0), 0), ((135, 6), 131, 3, (32767, 0), 0), ((135, 7), 131,
1, (32767, 0), 0)));
+ Table.States (892).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 7), 108, 1290)));
+ Table.States (893).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (893), 61, (434, 0), 299);
+ Add_Action (Table.States (893), 94, (134, 0), 282);
+ Add_Action (Table.States (893), 108, (135, 39), 1293);
+ Table.States (893).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (893), 134, 1294);
+ Add_Goto (Table.States (893), 434, 1295);
+ Table.States (893).Kernel := To_Vector ((((135, 36), 154, 5,
(32767, 0), 0), ((135, 37), 154, 3,
+ (32767, 0), 0), ((135, 38), 154, 3, (32767, 0), 0), ((135,
39), 154, 1, (32767, 0), 0)));
+ Table.States (893).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 39), 108, 1293)));
+ Table.States (894).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (894), 61, (434, 0), 299);
+ Add_Action (Table.States (894), 94, (134, 0), 282);
+ Add_Action (Table.States (894), 108, (135, 23), 1296);
+ Table.States (894).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (894), 134, 1297);
+ Add_Goto (Table.States (894), 434, 1298);
+ Table.States (894).Kernel := To_Vector ((((135, 20), 188, 5,
(32767, 0), 0), ((135, 21), 188, 3,
+ (32767, 0), 0), ((135, 22), 188, 3, (32767, 0), 0), ((135,
23), 188, 1, (32767, 0), 0)));
+ Table.States (894).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 23), 108, 1296)));
+ Table.States (895).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (895), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 15), 4);
+ Table.States (895).Kernel := To_Vector ((0 => ((135, 15), 108,
0, (135, 15), 4)));
+ Table.States (895).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 15), 4)));
+ Table.States (896).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (896), 61, (434, 0), 299);
+ Add_Action (Table.States (896), 108, (135, 13), 1299);
+ Table.States (896).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (896), 434, 1300);
+ Table.States (896).Kernel := To_Vector ((((135, 12), 134, 3,
(32767, 0), 0), ((135, 13), 134, 1,
+ (32767, 0), 0)));
+ Table.States (896).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 13), 108, 1299)));
+ Table.States (897).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (897), 108, (135, 14), 1301);
+ Table.States (897).Kernel := To_Vector ((0 => ((135, 14), 434,
1, (32767, 0), 0)));
+ Table.States (897).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 14), 108, 1301)));
+ Table.States (898).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (898), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 47), 4);
+ Table.States (898).Kernel := To_Vector ((0 => ((135, 47), 108,
0, (135, 47), 4)));
+ Table.States (898).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 47), 4)));
+ Table.States (899).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (899), 61, (434, 0), 299);
+ Add_Action (Table.States (899), 108, (135, 45), 1302);
+ Table.States (899).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (899), 434, 1303);
+ Table.States (899).Kernel := To_Vector ((((135, 44), 134, 3,
(32767, 0), 0), ((135, 45), 134, 1,
+ (32767, 0), 0)));
+ Table.States (899).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 45), 108, 1302)));
+ end Subr_36;
+ procedure Subr_37
+ is begin
+ Table.States (900).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (900), 108, (135, 46), 1304);
+ Table.States (900).Kernel := To_Vector ((0 => ((135, 46), 434,
1, (32767, 0), 0)));
+ Table.States (900).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 46), 108, 1304)));
+ Table.States (901).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (901), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 31), 4);
+ Table.States (901).Kernel := To_Vector ((0 => ((135, 31), 108,
0, (135, 31), 4)));
+ Table.States (901).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 31), 4)));
+ Table.States (902).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (902), 61, (434, 0), 299);
+ Add_Action (Table.States (902), 108, (135, 29), 1305);
+ Table.States (902).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (902), 434, 1306);
+ Table.States (902).Kernel := To_Vector ((((135, 28), 134, 3,
(32767, 0), 0), ((135, 29), 134, 1,
+ (32767, 0), 0)));
+ Table.States (902).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 29), 108, 1305)));
+ Table.States (903).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (903), 108, (135, 30), 1307);
+ Table.States (903).Kernel := To_Vector ((0 => ((135, 30), 434,
1, (32767, 0), 0)));
+ Table.States (903).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 30), 108, 1307)));
+ Table.States (904).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (904), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (198, 0), 4);
+ Table.States (904).Kernel := To_Vector ((0 => ((198, 0), 87, 0,
(198, 0), 4)));
+ Table.States (904).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (198, 0), 4)));
+ Table.States (905).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (905), (87, 95), (315, 0), 2);
+ Table.States (905).Kernel := To_Vector ((0 => ((315, 0), 314, 0,
(315, 0), 2)));
+ Table.States (905).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (315, 0), 2)));
+ Table.States (906).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (906), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (313, 1), 3);
+ Table.States (906).Kernel := To_Vector ((0 => ((313, 1), 87, 0,
(313, 1), 3)));
+ Table.States (906).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (313, 1), 3)));
+ Table.States (907).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (907), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (313, 2), 3);
+ Table.States (907).Kernel := To_Vector ((0 => ((313, 2), 87, 0,
(313, 2), 3)));
+ Table.States (907).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (313, 2), 3)));
+ Table.States (908).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (908), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (313, 3), 3);
+ Table.States (908).Kernel := To_Vector ((0 => ((313, 3), 87, 0,
(313, 3), 3)));
+ Table.States (908).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (313, 3), 3)));
+ Table.States (909).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (909), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (313, 0), 3);
+ Table.States (909).Kernel := To_Vector ((0 => ((313, 0), 87, 0,
(313, 0), 3)));
+ Table.States (909).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (313, 0), 3)));
+ Table.States (910).Action_List.Set_Capacity (16);
+ Add_Action (Table.States (910), 12, (402, 0), 165);
+ Add_Action (Table.States (910), 46, (233, 2), 167);
+ Add_Action (Table.States (910), 52, (233, 3), 168);
+ Add_Action (Table.States (910), 62, (200, 2), 531);
+ Add_Action (Table.States (910), 65, (234, 1), 169);
+ Add_Action (Table.States (910), 76, (256, 0), 170);
+ Add_Action (Table.States (910), 85, (205, 4), 171);
+ Add_Action (Table.States (910), 86, (213, 2), 172);
+ Add_Action (Table.States (910), 90, (268, 0), 34);
+ Add_Action (Table.States (910), 92, (315, 2), 532);
+ Add_Action (Table.States (910), 106, (237, 1), 173);
+ Add_Action (Table.States (910), 107, (237, 0), 174);
+ Add_Action (Table.States (910), 115, (234, 0), 175);
+ Add_Action (Table.States (910), 116, (196, 0), 146);
+ Add_Action (Table.States (910), 117, (196, 1), 37);
+ Add_Action (Table.States (910), 118, (195, 6), 360);
+ Table.States (910).Goto_List.Set_Capacity (34);
+ Add_Goto (Table.States (910), 195, 176);
+ Add_Goto (Table.States (910), 196, 367);
+ Add_Goto (Table.States (910), 197, 54);
+ Add_Goto (Table.States (910), 198, 55);
+ Add_Goto (Table.States (910), 199, 56);
+ Add_Goto (Table.States (910), 200, 368);
+ Add_Goto (Table.States (910), 201, 57);
+ Add_Goto (Table.States (910), 205, 177);
+ Add_Goto (Table.States (910), 206, 178);
+ Add_Goto (Table.States (910), 209, 536);
+ Add_Goto (Table.States (910), 210, 179);
+ Add_Goto (Table.States (910), 211, 180);
+ Add_Goto (Table.States (910), 213, 181);
+ Add_Goto (Table.States (910), 214, 182);
+ Add_Goto (Table.States (910), 215, 183);
+ Add_Goto (Table.States (910), 218, 184);
+ Add_Goto (Table.States (910), 219, 185);
+ Add_Goto (Table.States (910), 220, 186);
+ Add_Goto (Table.States (910), 227, 537);
+ Add_Goto (Table.States (910), 228, 188);
+ Add_Goto (Table.States (910), 231, 189);
+ Add_Goto (Table.States (910), 232, 190);
+ Add_Goto (Table.States (910), 233, 191);
+ Add_Goto (Table.States (910), 234, 192);
+ Add_Goto (Table.States (910), 237, 193);
+ Add_Goto (Table.States (910), 251, 58);
+ Add_Goto (Table.States (910), 252, 59);
+ Add_Goto (Table.States (910), 255, 60);
+ Add_Goto (Table.States (910), 256, 194);
+ Add_Goto (Table.States (910), 268, 68);
+ Add_Goto (Table.States (910), 311, 83);
+ Add_Goto (Table.States (910), 315, 1308);
+ Add_Goto (Table.States (910), 402, 195);
+ Add_Goto (Table.States (910), 465, 196);
+ Table.States (910).Kernel := To_Vector ((0 => ((312, 1), 95, 1,
(32767, 0), 0)));
+ Table.States (910).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (911).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (911), 86, (252, 0), 33);
+ Add_Action (Table.States (911), 90, (268, 0), 34);
+ Add_Action (Table.States (911), 116, (196, 0), 146);
+ Add_Action (Table.States (911), 117, (196, 1), 37);
+ Add_Action (Table.States (911), 118, (195, 6), 38);
+ Table.States (911).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (911), 195, 1309);
+ Add_Goto (Table.States (911), 196, 148);
+ Add_Goto (Table.States (911), 197, 54);
+ Add_Goto (Table.States (911), 198, 55);
+ Add_Goto (Table.States (911), 199, 56);
+ Add_Goto (Table.States (911), 201, 57);
+ Add_Goto (Table.States (911), 251, 58);
+ Add_Goto (Table.States (911), 252, 59);
+ Add_Goto (Table.States (911), 254, 1310);
+ Add_Goto (Table.States (911), 255, 60);
+ Add_Goto (Table.States (911), 268, 68);
+ Add_Goto (Table.States (911), 311, 83);
+ Table.States (911).Kernel := To_Vector ((0 => ((253, 0), 85, 4,
(32767, 0), 0)));
+ Table.States (911).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (912).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (912), 36, (275, 1), 1311);
+ Table.States (912).Kernel := To_Vector ((0 => ((275, 1), 66, 2,
(32767, 0), 0)));
+ Table.States (912).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (275, 1), 36, 1311)));
+ Table.States (913).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (913), 108, Reduce, (284, 1), 0);
+ Add_Action (Table.States (913), 116, (284, 0), 1312);
+ Table.States (913).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (913), 284, 1313);
+ Table.States (913).Kernel := To_Vector ((0 => ((286, 1), 66, 1,
(32767, 0), 0)));
+ Table.States (913).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (284, 1), 0)));
+ Table.States (914).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (914), 12, (401, 0), 1);
+ Add_Action (Table.States (914), 15, (370, 0), 3);
+ Add_Action (Table.States (914), 17, (365, 0), 4);
+ Add_Action (Table.States (914), 18, (382, 0), 5);
+ Add_Action (Table.States (914), 19, (363, 0), 6);
+ Add_Action (Table.States (914), 20, (357, 0), 7);
+ Add_Action (Table.States (914), 30, (316, 0), 13);
+ Add_Action (Table.States (914), 31, (290, 0), 14);
+ Add_Action (Table.States (914), 32, (289, 0), 15);
+ Add_Action (Table.States (914), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (914), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (914), 37, (288, 0), 17);
+ Add_Conflict (Table.States (914), 37, (285, 1), 0);
+ Add_Action (Table.States (914), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (914), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (914), 42, (271, 0), 18);
+ Add_Action (Table.States (914), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (914), 64, (273, 0), 27);
+ Add_Action (Table.States (914), 65, (264, 0), 28);
+ Add_Action (Table.States (914), 84, (124, 0), 32);
+ Add_Action (Table.States (914), 86, (252, 0), 33);
+ Add_Action (Table.States (914), 90, (268, 0), 34);
+ Add_Action (Table.States (914), 105, (265, 0), 35);
+ Add_Action (Table.States (914), 116, (196, 0), 146);
+ Add_Action (Table.States (914), 117, (196, 1), 37);
+ Add_Action (Table.States (914), 118, (195, 6), 38);
+ Table.States (914).Goto_List.Set_Capacity (46);
+ Add_Goto (Table.States (914), 124, 39);
+ Add_Goto (Table.States (914), 195, 52);
+ Add_Goto (Table.States (914), 196, 53);
+ Add_Goto (Table.States (914), 197, 54);
+ Add_Goto (Table.States (914), 198, 55);
+ Add_Goto (Table.States (914), 199, 56);
+ Add_Goto (Table.States (914), 201, 57);
+ Add_Goto (Table.States (914), 251, 58);
+ Add_Goto (Table.States (914), 252, 59);
+ Add_Goto (Table.States (914), 255, 60);
+ Add_Goto (Table.States (914), 259, 452);
+ Add_Goto (Table.States (914), 261, 331);
+ Add_Goto (Table.States (914), 262, 62);
+ Add_Goto (Table.States (914), 263, 63);
+ Add_Goto (Table.States (914), 264, 64);
+ Add_Goto (Table.States (914), 265, 65);
+ Add_Goto (Table.States (914), 266, 66);
+ Add_Goto (Table.States (914), 267, 67);
+ Add_Goto (Table.States (914), 268, 68);
+ Add_Goto (Table.States (914), 271, 69);
+ Add_Goto (Table.States (914), 273, 70);
+ Add_Goto (Table.States (914), 275, 71);
+ Add_Goto (Table.States (914), 285, 72);
+ Add_Goto (Table.States (914), 286, 73);
+ Add_Goto (Table.States (914), 288, 74);
+ Add_Goto (Table.States (914), 289, 75);
+ Add_Goto (Table.States (914), 290, 76);
+ Add_Goto (Table.States (914), 310, 82);
+ Add_Goto (Table.States (914), 311, 83);
+ Add_Goto (Table.States (914), 316, 84);
+ Add_Goto (Table.States (914), 318, 85);
+ Add_Goto (Table.States (914), 357, 110);
+ Add_Goto (Table.States (914), 363, 111);
+ Add_Goto (Table.States (914), 364, 112);
+ Add_Goto (Table.States (914), 365, 113);
+ Add_Goto (Table.States (914), 366, 114);
+ Add_Goto (Table.States (914), 367, 115);
+ Add_Goto (Table.States (914), 370, 116);
+ Add_Goto (Table.States (914), 376, 117);
+ Add_Goto (Table.States (914), 378, 118);
+ Add_Goto (Table.States (914), 379, 119);
+ Add_Goto (Table.States (914), 382, 120);
+ Add_Goto (Table.States (914), 396, 1314);
+ Add_Goto (Table.States (914), 401, 133);
+ Add_Goto (Table.States (914), 461, 332);
+ Add_Goto (Table.States (914), 462, 144);
+ Table.States (914).Kernel := To_Vector ((0 => ((286, 0), 38, 4,
(32767, 0), 0)));
+ Table.States (914).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ Table.States (915).Action_List.Set_Capacity (16);
+ Add_Action (Table.States (915), (22, 25, 28, 38, 50, 51, 52, 53,
54, 59, 60, 66, 81, 83, 84, 116), (458,
+ 1), 2);
+ Table.States (915).Kernel := To_Vector ((((458, 0), 191, 0,
(458, 0), 1), ((458, 1), 191, 0, (458, 1),
+ 2)));
+ Table.States (915).Minimal_Complete_Actions := To_Vector
(((Reduce, (458, 0), 1), (Reduce, (458, 1),
+ 2)));
+ Table.States (916).Action_List.Set_Capacity (16);
+ Add_Action (Table.States (916), (22, 25, 28, 38, 50, 51, 52, 53,
54, 59, 60, 66, 81, 83, 84, 116), (458,
+ 2), 2);
+ Table.States (916).Goto_List.Set_Capacity (59);
+ Add_Goto (Table.States (916), 124, 561);
+ Add_Goto (Table.States (916), 126, 40);
+ Add_Goto (Table.States (916), 127, 41);
+ Add_Goto (Table.States (916), 128, 42);
+ Add_Goto (Table.States (916), 130, 43);
+ Add_Goto (Table.States (916), 135, 44);
+ Add_Goto (Table.States (916), 136, 45);
+ Add_Goto (Table.States (916), 137, 46);
+ Add_Goto (Table.States (916), 180, 47);
+ Add_Goto (Table.States (916), 189, 48);
+ Add_Goto (Table.States (916), 190, 562);
+ Add_Goto (Table.States (916), 191, 915);
+ Add_Goto (Table.States (916), 193, 50);
+ Add_Goto (Table.States (916), 194, 51);
+ Add_Goto (Table.States (916), 291, 77);
+ Add_Goto (Table.States (916), 292, 78);
+ Add_Goto (Table.States (916), 293, 79);
+ Add_Goto (Table.States (916), 294, 80);
+ Add_Goto (Table.States (916), 309, 81);
+ Add_Goto (Table.States (916), 320, 86);
+ Add_Goto (Table.States (916), 321, 87);
+ Add_Goto (Table.States (916), 322, 88);
+ Add_Goto (Table.States (916), 325, 89);
+ Add_Goto (Table.States (916), 326, 90);
+ Add_Goto (Table.States (916), 327, 91);
+ Add_Goto (Table.States (916), 328, 92);
+ Add_Goto (Table.States (916), 329, 225);
+ Add_Goto (Table.States (916), 330, 94);
+ Add_Goto (Table.States (916), 332, 95);
+ Add_Goto (Table.States (916), 333, 96);
+ Add_Goto (Table.States (916), 334, 97);
+ Add_Goto (Table.States (916), 335, 98);
+ Add_Goto (Table.States (916), 336, 99);
+ Add_Goto (Table.States (916), 337, 100);
+ Add_Goto (Table.States (916), 338, 101);
+ Add_Goto (Table.States (916), 339, 102);
+ Add_Goto (Table.States (916), 340, 103);
+ Add_Goto (Table.States (916), 341, 104);
+ Add_Goto (Table.States (916), 345, 105);
+ Add_Goto (Table.States (916), 346, 106);
+ Add_Goto (Table.States (916), 347, 107);
+ Add_Goto (Table.States (916), 354, 108);
+ Add_Goto (Table.States (916), 388, 126);
+ Add_Goto (Table.States (916), 389, 127);
+ Add_Goto (Table.States (916), 390, 128);
+ Add_Goto (Table.States (916), 391, 129);
+ Add_Goto (Table.States (916), 392, 130);
+ Add_Goto (Table.States (916), 394, 132);
+ Add_Goto (Table.States (916), 403, 134);
+ Add_Goto (Table.States (916), 404, 135);
+ Add_Goto (Table.States (916), 405, 136);
+ Add_Goto (Table.States (916), 406, 137);
+ Add_Goto (Table.States (916), 408, 138);
+ Add_Goto (Table.States (916), 431, 139);
+ Add_Goto (Table.States (916), 437, 140);
+ Add_Goto (Table.States (916), 438, 141);
+ Add_Goto (Table.States (916), 440, 142);
+ Add_Goto (Table.States (916), 454, 143);
+ Add_Goto (Table.States (916), 458, 916);
+ Table.States (916).Kernel := To_Vector ((((458, 1), 458, 3,
(32767, 0), 0), ((458, 2), 458, 0, (458,
+ 2), 2), ((458, 2), 458, 3, (32767, 0), 0)));
+ Table.States (916).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (458, 2), 2)));
+ Table.States (917).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (917), 66, (275, 0), 1315);
+ Table.States (917).Kernel := To_Vector ((0 => ((275, 0), 259, 3,
(32767, 0), 0)));
+ Table.States (917).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (275, 0), 66, 1315)));
+ Table.States (918).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (918), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (338, 3), 4);
+ Table.States (918).Kernel := To_Vector ((0 => ((338, 3), 108, 0,
(338, 3), 4)));
+ Table.States (918).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (338, 3), 4)));
+ Table.States (919).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (919), 108, (338, 2), 1316);
+ Table.States (919).Kernel := To_Vector ((0 => ((338, 2), 434, 1,
(32767, 0), 0)));
+ Table.States (919).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (338, 2), 108, 1316)));
+ Table.States (920).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (920), 116, (435, 0), 1317);
+ Table.States (920).Kernel := To_Vector ((0 => ((435, 0), 121, 1,
(32767, 0), 0)));
+ Table.States (920).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (435, 0), 116, 1317)));
+ Table.States (921).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (921), 116, (435, 0), 568);
+ Table.States (921).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (921), 432, 1318);
+ Add_Goto (Table.States (921), 435, 571);
+ Table.States (921).Kernel := To_Vector ((0 => ((433, 1), 95, 1,
(32767, 0), 0)));
+ Table.States (921).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (435, 0), 116, 568)));
+ Table.States (922).Action_List.Set_Capacity (19);
+ Add_Action (Table.States (922), 12, (402, 0), 165);
+ Add_Action (Table.States (922), 25, (447, 0), 1319);
+ Add_Action (Table.States (922), 29, (305, 2), 1320);
+ Add_Action (Table.States (922), 33, (445, 1), 1321);
+ Add_Action (Table.States (922), 46, (233, 2), 167);
+ Add_Action (Table.States (922), 47, (305, 0), 1322);
+ Add_Action (Table.States (922), 50, (445, 0), 1323);
+ Add_Action (Table.States (922), 52, (233, 3), 168);
+ Add_Action (Table.States (922), 65, (234, 1), 169);
+ Add_Action (Table.States (922), 76, (256, 0), 170);
+ Add_Action (Table.States (922), 85, (205, 4), 1324);
+ Add_Action (Table.States (922), 86, (213, 2), 172);
+ Add_Action (Table.States (922), 90, (268, 0), 34);
+ Add_Action (Table.States (922), 106, (237, 1), 173);
+ Add_Action (Table.States (922), 107, (237, 0), 174);
+ Add_Action (Table.States (922), 115, (234, 0), 175);
+ Add_Action (Table.States (922), 116, (196, 0), 146);
+ Add_Action (Table.States (922), 117, (196, 1), 37);
+ Add_Action (Table.States (922), 118, (195, 6), 38);
+ Table.States (922).Goto_List.Set_Capacity (37);
+ Add_Goto (Table.States (922), 195, 176);
+ Add_Goto (Table.States (922), 196, 148);
+ Add_Goto (Table.States (922), 197, 54);
+ Add_Goto (Table.States (922), 198, 55);
+ Add_Goto (Table.States (922), 199, 56);
+ Add_Goto (Table.States (922), 201, 57);
+ Add_Goto (Table.States (922), 205, 177);
+ Add_Goto (Table.States (922), 206, 178);
+ Add_Goto (Table.States (922), 210, 179);
+ Add_Goto (Table.States (922), 211, 180);
+ Add_Goto (Table.States (922), 213, 181);
+ Add_Goto (Table.States (922), 214, 182);
+ Add_Goto (Table.States (922), 215, 183);
+ Add_Goto (Table.States (922), 218, 184);
+ Add_Goto (Table.States (922), 219, 185);
+ Add_Goto (Table.States (922), 220, 186);
+ Add_Goto (Table.States (922), 227, 1325);
+ Add_Goto (Table.States (922), 228, 188);
+ Add_Goto (Table.States (922), 231, 189);
+ Add_Goto (Table.States (922), 232, 190);
+ Add_Goto (Table.States (922), 233, 191);
+ Add_Goto (Table.States (922), 234, 192);
+ Add_Goto (Table.States (922), 237, 193);
+ Add_Goto (Table.States (922), 251, 58);
+ Add_Goto (Table.States (922), 252, 59);
+ Add_Goto (Table.States (922), 255, 60);
+ Add_Goto (Table.States (922), 256, 194);
+ Add_Goto (Table.States (922), 268, 68);
+ Add_Goto (Table.States (922), 302, 1326);
+ Add_Goto (Table.States (922), 304, 1327);
+ Add_Goto (Table.States (922), 305, 1328);
+ Add_Goto (Table.States (922), 311, 83);
+ Add_Goto (Table.States (922), 402, 195);
+ Add_Goto (Table.States (922), 436, 1329);
+ Add_Goto (Table.States (922), 445, 1330);
+ Add_Goto (Table.States (922), 447, 1331);
+ Add_Goto (Table.States (922), 465, 196);
+ Table.States (922).Kernel := To_Vector ((0 => ((432, 0), 99, 1,
(32767, 0), 0)));
+ Table.States (922).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (923).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (923), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (389, 3), 4);
+ Table.States (923).Kernel := To_Vector ((0 => ((389, 3), 108, 0,
(389, 3), 4)));
+ Table.States (923).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (389, 3), 4)));
+ Table.States (924).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (924), 108, (389, 2), 1332);
+ Table.States (924).Kernel := To_Vector ((0 => ((389, 2), 434, 1,
(32767, 0), 0)));
+ Table.States (924).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (389, 2), 108, 1332)));
+ Table.States (925).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (925), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (180, 3), 4);
+ Table.States (925).Kernel := To_Vector ((0 => ((180, 3), 108, 0,
(180, 3), 4)));
+ Table.States (925).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (180, 3), 4)));
+ Table.States (926).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (926), 108, (180, 2), 1333);
+ Table.States (926).Kernel := To_Vector ((0 => ((180, 2), 434, 1,
(32767, 0), 0)));
+ Table.States (926).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (180, 2), 108, 1333)));
+ Table.States (927).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (927), 12, (401, 0), 1);
+ Add_Action (Table.States (927), 15, (370, 0), 3);
+ Add_Action (Table.States (927), 17, (365, 0), 4);
+ Add_Action (Table.States (927), 18, (382, 0), 5);
+ Add_Action (Table.States (927), 19, (363, 0), 6);
+ Add_Action (Table.States (927), 20, (357, 0), 7);
+ Add_Action (Table.States (927), 30, (316, 0), 13);
+ Add_Action (Table.States (927), 31, (290, 0), 14);
+ Add_Action (Table.States (927), 32, (289, 0), 15);
+ Add_Action (Table.States (927), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (927), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (927), 37, (288, 0), 17);
+ Add_Conflict (Table.States (927), 37, (285, 1), 0);
+ Add_Action (Table.States (927), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (927), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (927), 42, (271, 0), 18);
+ Add_Action (Table.States (927), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (927), 64, (273, 0), 27);
+ Add_Action (Table.States (927), 65, (264, 0), 28);
+ Add_Action (Table.States (927), 84, (124, 0), 32);
+ Add_Action (Table.States (927), 86, (252, 0), 33);
+ Add_Action (Table.States (927), 90, (268, 0), 34);
+ Add_Action (Table.States (927), 105, (265, 0), 35);
+ Add_Action (Table.States (927), 116, (196, 0), 146);
+ Add_Action (Table.States (927), 117, (196, 1), 37);
+ Add_Action (Table.States (927), 118, (195, 6), 38);
+ Table.States (927).Goto_List.Set_Capacity (46);
+ Add_Goto (Table.States (927), 124, 39);
+ Add_Goto (Table.States (927), 195, 52);
+ Add_Goto (Table.States (927), 196, 53);
+ Add_Goto (Table.States (927), 197, 54);
+ Add_Goto (Table.States (927), 198, 55);
+ Add_Goto (Table.States (927), 199, 56);
+ Add_Goto (Table.States (927), 201, 57);
+ Add_Goto (Table.States (927), 251, 58);
+ Add_Goto (Table.States (927), 252, 59);
+ Add_Goto (Table.States (927), 255, 60);
+ Add_Goto (Table.States (927), 259, 452);
+ Add_Goto (Table.States (927), 261, 331);
+ Add_Goto (Table.States (927), 262, 62);
+ Add_Goto (Table.States (927), 263, 63);
+ Add_Goto (Table.States (927), 264, 64);
+ Add_Goto (Table.States (927), 265, 65);
+ Add_Goto (Table.States (927), 266, 66);
+ Add_Goto (Table.States (927), 267, 67);
+ Add_Goto (Table.States (927), 268, 68);
+ Add_Goto (Table.States (927), 271, 69);
+ Add_Goto (Table.States (927), 273, 70);
+ Add_Goto (Table.States (927), 275, 71);
+ Add_Goto (Table.States (927), 285, 72);
+ Add_Goto (Table.States (927), 286, 73);
+ Add_Goto (Table.States (927), 288, 74);
+ Add_Goto (Table.States (927), 289, 75);
+ Add_Goto (Table.States (927), 290, 76);
+ Add_Goto (Table.States (927), 310, 82);
+ Add_Goto (Table.States (927), 311, 83);
+ Add_Goto (Table.States (927), 316, 84);
+ Add_Goto (Table.States (927), 318, 85);
+ Add_Goto (Table.States (927), 357, 110);
+ Add_Goto (Table.States (927), 363, 111);
+ Add_Goto (Table.States (927), 364, 112);
+ Add_Goto (Table.States (927), 365, 113);
+ Add_Goto (Table.States (927), 366, 114);
+ Add_Goto (Table.States (927), 367, 115);
+ Add_Goto (Table.States (927), 370, 116);
+ Add_Goto (Table.States (927), 376, 117);
+ Add_Goto (Table.States (927), 378, 118);
+ Add_Goto (Table.States (927), 379, 119);
+ Add_Goto (Table.States (927), 382, 120);
+ Add_Goto (Table.States (927), 396, 1334);
+ Add_Goto (Table.States (927), 401, 133);
+ Add_Goto (Table.States (927), 461, 332);
+ Add_Goto (Table.States (927), 462, 144);
+ Table.States (927).Kernel := To_Vector ((0 => ((309, 3), 38, 4,
(32767, 0), 0)));
+ Table.States (927).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ end Subr_37;
+ procedure Subr_38
+ is begin
+ Table.States (928).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (928), 38, (309, 2), 1335);
+ Table.States (928).Kernel := To_Vector ((0 => ((309, 2), 192, 5,
(32767, 0), 0)));
+ Table.States (928).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (309, 2), 38, 1335)));
+ Table.States (929).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (929), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (320, 3), 4);
+ Table.States (929).Kernel := To_Vector ((0 => ((320, 3), 108, 0,
(320, 3), 4)));
+ Table.States (929).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (320, 3), 4)));
+ Table.States (930).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (930), 108, (320, 2), 1336);
+ Table.States (930).Kernel := To_Vector ((0 => ((320, 2), 434, 1,
(32767, 0), 0)));
+ Table.States (930).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (320, 2), 108, 1336)));
+ Table.States (931).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (931), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (321, 3), 4);
+ Table.States (931).Kernel := To_Vector ((0 => ((321, 3), 108, 0,
(321, 3), 4)));
+ Table.States (931).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (321, 3), 4)));
+ Table.States (932).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (932), 108, (321, 2), 1337);
+ Table.States (932).Kernel := To_Vector ((0 => ((321, 2), 434, 1,
(32767, 0), 0)));
+ Table.States (932).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (321, 2), 108, 1337)));
+ Table.States (933).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (933), 46, (233, 2), 167);
+ Add_Action (Table.States (933), 52, (187, 0), 356);
+ Add_Action (Table.States (933), 65, (234, 1), 169);
+ Add_Action (Table.States (933), 76, (256, 0), 170);
+ Add_Action (Table.States (933), 85, (205, 4), 171);
+ Add_Action (Table.States (933), 86, (213, 2), 172);
+ Add_Action (Table.States (933), 90, (268, 0), 34);
+ Add_Action (Table.States (933), 106, (237, 1), 173);
+ Add_Action (Table.States (933), 107, (237, 0), 174);
+ Add_Action (Table.States (933), 115, (234, 0), 175);
+ Add_Action (Table.States (933), 116, (136, 0), 687);
+ Add_Action (Table.States (933), 117, (196, 1), 37);
+ Add_Action (Table.States (933), 118, (195, 6), 38);
+ Table.States (933).Goto_List.Set_Capacity (36);
+ Add_Goto (Table.States (933), 131, 693);
+ Add_Goto (Table.States (933), 136, 688);
+ Add_Goto (Table.States (933), 140, 694);
+ Add_Goto (Table.States (933), 160, 1338);
+ Add_Goto (Table.States (933), 187, 365);
+ Add_Goto (Table.States (933), 195, 366);
+ Add_Goto (Table.States (933), 196, 148);
+ Add_Goto (Table.States (933), 197, 54);
+ Add_Goto (Table.States (933), 198, 55);
+ Add_Goto (Table.States (933), 199, 56);
+ Add_Goto (Table.States (933), 201, 57);
+ Add_Goto (Table.States (933), 203, 369);
+ Add_Goto (Table.States (933), 205, 177);
+ Add_Goto (Table.States (933), 206, 178);
+ Add_Goto (Table.States (933), 210, 179);
+ Add_Goto (Table.States (933), 211, 180);
+ Add_Goto (Table.States (933), 213, 181);
+ Add_Goto (Table.States (933), 214, 182);
+ Add_Goto (Table.States (933), 215, 183);
+ Add_Goto (Table.States (933), 218, 184);
+ Add_Goto (Table.States (933), 219, 185);
+ Add_Goto (Table.States (933), 220, 186);
+ Add_Goto (Table.States (933), 231, 696);
+ Add_Goto (Table.States (933), 232, 190);
+ Add_Goto (Table.States (933), 233, 191);
+ Add_Goto (Table.States (933), 234, 192);
+ Add_Goto (Table.States (933), 237, 193);
+ Add_Goto (Table.States (933), 251, 58);
+ Add_Goto (Table.States (933), 252, 59);
+ Add_Goto (Table.States (933), 255, 60);
+ Add_Goto (Table.States (933), 256, 194);
+ Add_Goto (Table.States (933), 268, 68);
+ Add_Goto (Table.States (933), 298, 467);
+ Add_Goto (Table.States (933), 300, 468);
+ Add_Goto (Table.States (933), 311, 83);
+ Add_Goto (Table.States (933), 465, 196);
+ Table.States (933).Kernel := To_Vector ((((299, 0), 85, 4,
(32767, 0), 0), ((356, 0), 85, 5, (32767,
+ 0), 0), ((356, 1), 85, 3, (32767, 0), 0)));
+ Table.States (933).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (136, 0), 116, 687)));
+ Table.States (934).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (934), 61, (434, 0), 299);
+ Add_Action (Table.States (934), 108, (356, 3), 1339);
+ Table.States (934).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (934), 434, 1340);
+ Table.States (934).Kernel := To_Vector ((((356, 2), 295, 3,
(32767, 0), 0), ((356, 3), 295, 1, (32767,
+ 0), 0)));
+ Table.States (934).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (356, 3), 108, 1339)));
+ Table.States (935).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (935), 76, (408, 6), 1341);
+ Table.States (935).Kernel := To_Vector ((((408, 6), 82, 5,
(32767, 0), 0), ((408, 7), 82, 3, (32767,
+ 0), 0)));
+ Table.States (935).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (408, 6), 76, 1341)));
+ Table.States (936).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (936), 76, (408, 2), 1342);
+ Table.States (936).Kernel := To_Vector ((((408, 2), 82, 5,
(32767, 0), 0), ((408, 3), 82, 3, (32767,
+ 0), 0)));
+ Table.States (936).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (408, 2), 76, 1342)));
+ Table.States (937).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (937), 61, (434, 0), 299);
+ Add_Action (Table.States (937), 85, (198, 0), 281);
+ Add_Action (Table.States (937), 96, (197, 0), 283);
+ Add_Action (Table.States (937), 108, (338, 1), 1343);
+ Add_Action (Table.States (937), 113, (121, 0), 285);
+ Add_Action (Table.States (937), 114, (121, 1), 286);
+ Table.States (937).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (937), 121, 287);
+ Add_Goto (Table.States (937), 313, 289);
+ Add_Goto (Table.States (937), 434, 1344);
+ Table.States (937).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3, (32767,
+ 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0), 195,
2, (32767, 0), 0), ((255, 0), 195, 3,
+ (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0), ((338, 0),
195, 3, (32767, 0), 0), ((338, 1),
+ 195, 1, (32767, 0), 0)));
+ Table.States (937).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (338, 1), 108, 1343)));
+ Table.States (938).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (938), 61, (434, 0), 299);
+ Add_Action (Table.States (938), 108, (389, 1), 1345);
+ Table.States (938).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (938), 434, 1346);
+ Table.States (938).Kernel := To_Vector ((((389, 0), 13, 3,
(32767, 0), 0), ((389, 1), 13, 1, (32767,
+ 0), 0)));
+ Table.States (938).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (389, 1), 108, 1345)));
+ Table.States (939).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (939), 61, (434, 0), 299);
+ Add_Action (Table.States (939), 108, (180, 1), 1347);
+ Table.States (939).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (939), 434, 1348);
+ Table.States (939).Kernel := To_Vector ((((180, 0), 78, 3,
(32767, 0), 0), ((180, 1), 78, 1, (32767,
+ 0), 0)));
+ Table.States (939).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (180, 1), 108, 1347)));
+ Table.States (940).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (940), 38, (309, 1), 1349);
+ Table.States (940).Kernel := To_Vector ((0 => ((309, 1), 192, 5,
(32767, 0), 0)));
+ Table.States (940).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (309, 1), 38, 1349)));
+ Table.States (941).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (941), 22, (339, 0), 9);
+ Add_Action (Table.States (941), 25, (329, 1), 10);
+ Add_Action (Table.States (941), 28, (325, 0), 12);
+ Add_Action (Table.States (941), 38, Reduce, (192, 1), 0);
+ Add_Action (Table.States (941), 50, (332, 0), 19);
+ Add_Action (Table.States (941), 51, (437, 0), 221);
+ Add_Action (Table.States (941), 52, (329, 0), 21);
+ Add_Action (Table.States (941), 53, (294, 0), 22);
+ Add_Action (Table.States (941), 54, (293, 0), 23);
+ Add_Action (Table.States (941), 59, (346, 0), 24);
+ Add_Action (Table.States (941), 60, (340, 0), 25);
+ Add_Action (Table.States (941), 81, (130, 0), 30);
+ Add_Action (Table.States (941), 83, (128, 0), 31);
+ Add_Action (Table.States (941), 84, (124, 0), 32);
+ Add_Action (Table.States (941), 116, (136, 0), 223);
+ Table.States (941).Goto_List.Set_Capacity (60);
+ Add_Goto (Table.States (941), 124, 561);
+ Add_Goto (Table.States (941), 126, 40);
+ Add_Goto (Table.States (941), 127, 41);
+ Add_Goto (Table.States (941), 128, 42);
+ Add_Goto (Table.States (941), 130, 43);
+ Add_Goto (Table.States (941), 135, 44);
+ Add_Goto (Table.States (941), 136, 45);
+ Add_Goto (Table.States (941), 137, 46);
+ Add_Goto (Table.States (941), 180, 47);
+ Add_Goto (Table.States (941), 189, 48);
+ Add_Goto (Table.States (941), 190, 562);
+ Add_Goto (Table.States (941), 191, 563);
+ Add_Goto (Table.States (941), 192, 1350);
+ Add_Goto (Table.States (941), 193, 50);
+ Add_Goto (Table.States (941), 194, 51);
+ Add_Goto (Table.States (941), 291, 77);
+ Add_Goto (Table.States (941), 292, 78);
+ Add_Goto (Table.States (941), 293, 79);
+ Add_Goto (Table.States (941), 294, 80);
+ Add_Goto (Table.States (941), 309, 81);
+ Add_Goto (Table.States (941), 320, 86);
+ Add_Goto (Table.States (941), 321, 87);
+ Add_Goto (Table.States (941), 322, 88);
+ Add_Goto (Table.States (941), 325, 89);
+ Add_Goto (Table.States (941), 326, 90);
+ Add_Goto (Table.States (941), 327, 91);
+ Add_Goto (Table.States (941), 328, 92);
+ Add_Goto (Table.States (941), 329, 225);
+ Add_Goto (Table.States (941), 330, 94);
+ Add_Goto (Table.States (941), 332, 95);
+ Add_Goto (Table.States (941), 333, 96);
+ Add_Goto (Table.States (941), 334, 97);
+ Add_Goto (Table.States (941), 335, 98);
+ Add_Goto (Table.States (941), 336, 99);
+ Add_Goto (Table.States (941), 337, 100);
+ Add_Goto (Table.States (941), 338, 101);
+ Add_Goto (Table.States (941), 339, 102);
+ Add_Goto (Table.States (941), 340, 103);
+ Add_Goto (Table.States (941), 341, 104);
+ Add_Goto (Table.States (941), 345, 105);
+ Add_Goto (Table.States (941), 346, 106);
+ Add_Goto (Table.States (941), 347, 107);
+ Add_Goto (Table.States (941), 354, 108);
+ Add_Goto (Table.States (941), 388, 126);
+ Add_Goto (Table.States (941), 389, 127);
+ Add_Goto (Table.States (941), 390, 128);
+ Add_Goto (Table.States (941), 391, 129);
+ Add_Goto (Table.States (941), 392, 130);
+ Add_Goto (Table.States (941), 394, 132);
+ Add_Goto (Table.States (941), 403, 134);
+ Add_Goto (Table.States (941), 404, 135);
+ Add_Goto (Table.States (941), 405, 136);
+ Add_Goto (Table.States (941), 406, 137);
+ Add_Goto (Table.States (941), 408, 138);
+ Add_Goto (Table.States (941), 431, 139);
+ Add_Goto (Table.States (941), 437, 140);
+ Add_Goto (Table.States (941), 438, 141);
+ Add_Goto (Table.States (941), 440, 142);
+ Add_Goto (Table.States (941), 454, 143);
+ Add_Goto (Table.States (941), 458, 565);
+ Table.States (941).Kernel := To_Vector ((0 => ((309, 0), 82, 5,
(32767, 0), 0)));
+ Table.States (941).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (192, 1), 0)));
+ Table.States (942).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (942), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (291, 0), 4);
+ Table.States (942).Kernel := To_Vector ((0 => ((291, 0), 108, 0,
(291, 0), 4)));
+ Table.States (942).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (291, 0), 4)));
+ Table.States (943).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (943), 61, (434, 0), 299);
+ Add_Action (Table.States (943), 108, (320, 1), 1351);
+ Table.States (943).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (943), 434, 1352);
+ Table.States (943).Kernel := To_Vector ((((320, 0), 65, 3,
(32767, 0), 0), ((320, 1), 65, 1, (32767,
+ 0), 0)));
+ Table.States (943).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (320, 1), 108, 1351)));
+ Table.States (944).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (944), 61, (434, 0), 299);
+ Add_Action (Table.States (944), 108, (321, 1), 1353);
+ Table.States (944).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (944), 434, 1354);
+ Table.States (944).Kernel := To_Vector ((((321, 0), 205, 3,
(32767, 0), 0), ((321, 1), 205, 1, (32767,
+ 0), 0)));
+ Table.States (944).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (321, 1), 108, 1353)));
+ Table.States (945).Action_List.Set_Capacity (16);
+ Add_Action (Table.States (945), 22, (339, 0), 9);
+ Add_Action (Table.States (945), 25, (329, 1), 10);
+ Add_Action (Table.States (945), 27, (325, 9), 719);
+ Add_Action (Table.States (945), 28, (325, 0), 720);
+ Add_Action (Table.States (945), 50, (332, 0), 19);
+ Add_Action (Table.States (945), 51, (437, 0), 221);
+ Add_Action (Table.States (945), 52, (329, 0), 21);
+ Add_Action (Table.States (945), 53, (294, 0), 22);
+ Add_Action (Table.States (945), 54, (293, 0), 23);
+ Add_Action (Table.States (945), 59, (346, 0), 721);
+ Add_Action (Table.States (945), 60, (340, 0), 722);
+ Add_Action (Table.States (945), 66, (325, 11), 723);
+ Add_Action (Table.States (945), 81, (130, 0), 30);
+ Add_Action (Table.States (945), 83, (128, 0), 31);
+ Add_Action (Table.States (945), 84, (124, 0), 32);
+ Add_Action (Table.States (945), 116, (136, 0), 223);
+ Table.States (945).Goto_List.Set_Capacity (48);
+ Add_Goto (Table.States (945), 124, 725);
+ Add_Goto (Table.States (945), 126, 40);
+ Add_Goto (Table.States (945), 127, 41);
+ Add_Goto (Table.States (945), 128, 42);
+ Add_Goto (Table.States (945), 130, 43);
+ Add_Goto (Table.States (945), 135, 44);
+ Add_Goto (Table.States (945), 136, 45);
+ Add_Goto (Table.States (945), 137, 46);
+ Add_Goto (Table.States (945), 180, 47);
+ Add_Goto (Table.States (945), 189, 48);
+ Add_Goto (Table.States (945), 193, 726);
+ Add_Goto (Table.States (945), 291, 77);
+ Add_Goto (Table.States (945), 292, 727);
+ Add_Goto (Table.States (945), 293, 79);
+ Add_Goto (Table.States (945), 294, 80);
+ Add_Goto (Table.States (945), 320, 86);
+ Add_Goto (Table.States (945), 321, 87);
+ Add_Goto (Table.States (945), 322, 88);
+ Add_Goto (Table.States (945), 323, 728);
+ Add_Goto (Table.States (945), 324, 729);
+ Add_Goto (Table.States (945), 325, 89);
+ Add_Goto (Table.States (945), 327, 91);
+ Add_Goto (Table.States (945), 328, 92);
+ Add_Goto (Table.States (945), 329, 730);
+ Add_Goto (Table.States (945), 330, 94);
+ Add_Goto (Table.States (945), 332, 95);
+ Add_Goto (Table.States (945), 333, 96);
+ Add_Goto (Table.States (945), 334, 97);
+ Add_Goto (Table.States (945), 335, 98);
+ Add_Goto (Table.States (945), 336, 99);
+ Add_Goto (Table.States (945), 337, 100);
+ Add_Goto (Table.States (945), 338, 101);
+ Add_Goto (Table.States (945), 339, 102);
+ Add_Goto (Table.States (945), 340, 103);
+ Add_Goto (Table.States (945), 341, 104);
+ Add_Goto (Table.States (945), 346, 106);
+ Add_Goto (Table.States (945), 347, 107);
+ Add_Goto (Table.States (945), 394, 132);
+ Add_Goto (Table.States (945), 403, 134);
+ Add_Goto (Table.States (945), 404, 135);
+ Add_Goto (Table.States (945), 405, 136);
+ Add_Goto (Table.States (945), 406, 137);
+ Add_Goto (Table.States (945), 408, 138);
+ Add_Goto (Table.States (945), 431, 139);
+ Add_Goto (Table.States (945), 437, 140);
+ Add_Goto (Table.States (945), 438, 141);
+ Add_Goto (Table.States (945), 440, 142);
+ Add_Goto (Table.States (945), 454, 143);
+ Table.States (945).Kernel := To_Vector ((((325, 6), 82, 8,
(32767, 0), 0), ((325, 7), 82, 5, (32767,
+ 0), 0), ((325, 8), 82, 4, (32767, 0), 0), ((325, 9), 82, 5,
(32767, 0), 0), ((325, 10), 82, 2,
+ (32767, 0), 0), ((325, 11), 82, 1, (32767, 0), 0)));
+ Table.States (945).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (325, 11), 66, 723)));
+ Table.States (946).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (946), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (404, 0), 4);
+ Table.States (946).Kernel := To_Vector ((0 => ((404, 0), 108, 0,
(404, 0), 4)));
+ Table.States (946).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (404, 0), 4)));
+ Table.States (947).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (947), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (401, 1), 5);
+ Table.States (947).Kernel := To_Vector ((0 => ((401, 1), 108, 0,
(401, 1), 5)));
+ Table.States (947).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (401, 1), 5)));
+ Table.States (948).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (948), 26, (326, 0), 1355);
+ Table.States (948).Kernel := To_Vector ((((326, 0), 28, 10,
(32767, 0), 0), ((326, 1), 28, 7, (32767,
+ 0), 0), ((326, 2), 28, 8, (32767, 0), 0), ((326, 3), 28, 5,
(32767, 0), 0)));
+ Table.States (948).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (326, 0), 26, 1355)));
+ Table.States (949).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (949), 26, (354, 0), 1356);
+ Table.States (949).Kernel := To_Vector ((((354, 0), 59, 10,
(32767, 0), 0), ((354, 1), 59, 7, (32767,
+ 0), 0), ((354, 2), 59, 8, (32767, 0), 0), ((354, 3), 59, 5,
(32767, 0), 0)));
+ Table.States (949).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (354, 0), 26, 1356)));
+ Table.States (950).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (950), 26, (345, 0), 1357);
+ Table.States (950).Kernel := To_Vector ((((345, 0), 60, 10,
(32767, 0), 0), ((345, 1), 60, 8, (32767,
+ 0), 0)));
+ Table.States (950).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (345, 0), 26, 1357)));
+ Table.States (951).Action_List.Set_Capacity (42);
+ Add_Action (Table.States (951), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (393,
+ 0), 5);
+ Table.States (951).Kernel := To_Vector ((0 => ((393, 0), 194, 0,
(393, 0), 5)));
+ Table.States (951).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (393, 0), 5)));
+ Table.States (952).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (952), 61, (434, 0), 299);
+ Add_Action (Table.States (952), 82, (309, 3), 1358);
+ Table.States (952).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (952), 434, 1359);
+ Table.States (952).Kernel := To_Vector ((((309, 2), 292, 8,
(32767, 0), 0), ((309, 3), 292, 6, (32767,
+ 0), 0)));
+ Table.States (952).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (309, 3), 82, 1358)));
+ Table.States (953).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (953), 53, (294, 0), 314);
+ Add_Action (Table.States (953), 54, (293, 0), 315);
+ Table.States (953).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (953), 292, 1360);
+ Add_Goto (Table.States (953), 293, 317);
+ Add_Goto (Table.States (953), 294, 318);
+ Table.States (953).Kernel := To_Vector ((((309, 0), 329, 10,
(32767, 0), 0), ((309, 1), 329, 8,
+ (32767, 0), 0)));
+ Table.States (953).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (293, 0), 54, 315)));
+ Table.States (954).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (954), 15, (370, 0), 1361);
+ Table.States (954).Kernel := To_Vector ((0 => ((370, 0), 66, 2,
(32767, 0), 0)));
+ Table.States (954).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (370, 0), 15, 1361)));
+ Table.States (955).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (955), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (370, 1), 5);
+ Table.States (955).Kernel := To_Vector ((0 => ((370, 1), 108, 0,
(370, 1), 5)));
+ Table.States (955).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (370, 1), 5)));
+ Table.States (956).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (956), 15, (378, 0), 1362);
+ Table.States (956).Kernel := To_Vector ((0 => ((378, 0), 66, 2,
(32767, 0), 0)));
+ Table.States (956).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (378, 0), 15, 1362)));
+ Table.States (957).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (957), 15, (376, 0), 1363);
+ Table.States (957).Kernel := To_Vector ((0 => ((376, 0), 66, 2,
(32767, 0), 0)));
+ Table.States (957).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (376, 0), 15, 1363)));
+ Table.States (958).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (958), (1 => 66), (381, 0), 1);
+ Table.States (958).Kernel := To_Vector ((0 => ((381, 0), 259, 0,
(381, 0), 1)));
+ Table.States (958).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (381, 0), 1)));
+ Table.States (959).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (959), 66, (379, 0), 1364);
+ Table.States (959).Kernel := To_Vector ((0 => ((379, 0), 381, 3,
(32767, 0), 0)));
+ Table.States (959).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (379, 0), 66, 1364)));
+ Table.States (960).Action_List.Set_Capacity (20);
+ Add_Action (Table.States (960), (33, 36, 41, 43, 44, 48, 49, 50,
61, 63, 72, 74, 75, 82, 87, 88, 91, 95,
+ 99, 108), (402, 0), 4);
+ Table.States (960).Kernel := To_Vector ((0 => ((402, 0), 231, 0,
(402, 0), 4)));
+ Table.States (960).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (402, 0), 4)));
+ Table.States (961).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (961), (52, 86, 90, 116, 117, 118), (258,
0), 3);
+ Table.States (961).Kernel := To_Vector ((0 => ((258, 0), 87, 0,
(258, 0), 3)));
+ Table.States (961).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (258, 0), 3)));
+ Table.States (962).Action_List.Set_Capacity (39);
+ Add_Action (Table.States (962), (33, 36, 41, 43, 44, 45, 47, 48,
49, 50, 52, 61, 63, 69, 72, 73, 74, 75,
+ 82, 87, 88, 89, 91, 94, 95, 97, 98, 99, 100, 101, 103, 104, 106,
107, 108, 109, 110, 111, 112), (257, 2),
+ 3);
+ Table.States (962).Kernel := To_Vector ((0 => ((257, 2), 162, 0,
(257, 2), 3)));
+ Table.States (962).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (257, 2), 3)));
+ Table.States (963).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (963), 87, (198, 0), 904);
+ Add_Action (Table.States (963), 95, (162, 0), 1365);
+ Table.States (963).Kernel := To_Vector ((((162, 0), 163, 3,
(32767, 0), 0), ((198, 0), 163, 1, (32767,
+ 0), 0)));
+ Table.States (963).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (162, 0), 95, 1365)));
+ Table.States (964).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (964), (1 => 87), (249, 1), 3);
+ Table.States (964).Kernel := To_Vector ((0 => ((249, 1), 227, 0,
(249, 1), 3)));
+ Table.States (964).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (249, 1), 3)));
+ Table.States (965).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (965), 52, (187, 0), 347);
+ Add_Action (Table.States (965), 56, (188, 2), 514);
+ Add_Action (Table.States (965), 86, (252, 0), 33);
+ Add_Action (Table.States (965), 90, (268, 0), 34);
+ Add_Action (Table.States (965), 116, (196, 0), 146);
+ Add_Action (Table.States (965), 117, (196, 1), 37);
+ Add_Action (Table.States (965), 118, (195, 6), 38);
+ Table.States (965).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (965), 187, 515);
+ Add_Goto (Table.States (965), 188, 516);
+ Add_Goto (Table.States (965), 195, 517);
+ Add_Goto (Table.States (965), 196, 148);
+ Add_Goto (Table.States (965), 197, 54);
+ Add_Goto (Table.States (965), 198, 55);
+ Add_Goto (Table.States (965), 199, 56);
+ Add_Goto (Table.States (965), 201, 57);
+ Add_Goto (Table.States (965), 251, 58);
+ Add_Goto (Table.States (965), 252, 59);
+ Add_Goto (Table.States (965), 255, 60);
+ Add_Goto (Table.States (965), 268, 68);
+ Add_Goto (Table.States (965), 311, 83);
+ Table.States (965).Kernel := To_Vector ((((335, 0), 93, 8,
(32767, 0), 0), ((335, 1), 93, 6, (32767,
+ 0), 0), ((335, 2), 93, 6, (32767, 0), 0), ((335, 3), 93, 4,
(32767, 0), 0), ((335, 6), 93, 7,
+ (32767, 0), 0), ((335, 7), 93, 5, (32767, 0), 0)));
+ Table.States (965).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ end Subr_38;
+ procedure Subr_39
+ is begin
+ Table.States (966).Action_List.Set_Capacity (10);
+ Add_Action (Table.States (966), 52, (187, 0), 347);
+ Add_Action (Table.States (966), 56, (188, 2), 514);
+ Add_Action (Table.States (966), 70, (156, 0), 519);
+ Add_Action (Table.States (966), 79, (135, 8), 1366);
+ Add_Action (Table.States (966), 80, (135, 0), 521);
+ Add_Action (Table.States (966), 86, (252, 0), 33);
+ Add_Action (Table.States (966), 90, (268, 0), 34);
+ Add_Action (Table.States (966), 116, (196, 0), 146);
+ Add_Action (Table.States (966), 117, (196, 1), 37);
+ Add_Action (Table.States (966), 118, (195, 6), 38);
+ Table.States (966).Goto_List.Set_Capacity (17);
+ Add_Goto (Table.States (966), 131, 522);
+ Add_Goto (Table.States (966), 154, 523);
+ Add_Goto (Table.States (966), 156, 524);
+ Add_Goto (Table.States (966), 159, 525);
+ Add_Goto (Table.States (966), 187, 526);
+ Add_Goto (Table.States (966), 188, 527);
+ Add_Goto (Table.States (966), 195, 528);
+ Add_Goto (Table.States (966), 196, 148);
+ Add_Goto (Table.States (966), 197, 54);
+ Add_Goto (Table.States (966), 198, 55);
+ Add_Goto (Table.States (966), 199, 56);
+ Add_Goto (Table.States (966), 201, 57);
+ Add_Goto (Table.States (966), 251, 58);
+ Add_Goto (Table.States (966), 252, 59);
+ Add_Goto (Table.States (966), 255, 60);
+ Add_Goto (Table.States (966), 268, 68);
+ Add_Goto (Table.States (966), 311, 83);
+ Table.States (966).Kernel := To_Vector ((((135, 0), 93, 8,
(32767, 0), 0), ((135, 1), 93, 6, (32767,
+ 0), 0), ((135, 2), 93, 6, (32767, 0), 0), ((135, 3), 93, 4,
(32767, 0), 0), ((135, 4), 93, 7,
+ (32767, 0), 0), ((135, 5), 93, 5, (32767, 0), 0), ((135, 6),
93, 5, (32767, 0), 0), ((135, 7), 93,
+ 3, (32767, 0), 0), ((135, 8), 93, 7, (32767, 0), 0), ((135,
9), 93, 5, (32767, 0), 0), ((135, 10),
+ 93, 5, (32767, 0), 0), ((135, 11), 93, 3, (32767, 0), 0),
((135, 12), 93, 6, (32767, 0), 0), ((135,
+ 13), 93, 4, (32767, 0), 0), ((135, 14), 93, 4, (32767, 0),
0), ((135, 15), 93, 2, (32767, 0), 0),
+ ((135, 16), 93, 9, (32767, 0), 0), ((135, 17), 93, 7, (32767,
0), 0), ((135, 18), 93, 7, (32767,
+ 0), 0), ((135, 19), 93, 5, (32767, 0), 0), ((135, 20), 93,
8, (32767, 0), 0), ((135, 21), 93, 6,
+ (32767, 0), 0), ((135, 22), 93, 6, (32767, 0), 0), ((135, 23),
93, 4, (32767, 0), 0), ((135, 24),
+ 93, 8, (32767, 0), 0), ((135, 25), 93, 6, (32767, 0), 0),
((135, 26), 93, 6, (32767, 0), 0), ((135,
+ 27), 93, 4, (32767, 0), 0), ((135, 28), 93, 7, (32767, 0),
0), ((135, 29), 93, 5, (32767, 0), 0),
+ ((135, 30), 93, 5, (32767, 0), 0), ((135, 31), 93, 3, (32767,
0), 0), ((135, 32), 93, 14, (32767,
+ 0), 0), ((135, 33), 93, 12, (32767, 0), 0), ((135, 34), 93,
12, (32767, 0), 0), ((135, 35), 93,
+ 10, (32767, 0), 0), ((135, 36), 93, 13, (32767, 0), 0), ((135,
37), 93, 11, (32767, 0), 0), ((135,
+ 38), 93, 11, (32767, 0), 0), ((135, 39), 93, 9, (32767, 0),
0), ((135, 40), 93, 13, (32767, 0),
+ 0), ((135, 41), 93, 11, (32767, 0), 0), ((135, 42), 93, 11,
(32767, 0), 0), ((135, 43), 93, 9,
+ (32767, 0), 0), ((135, 44), 93, 12, (32767, 0), 0), ((135,
45), 93, 10, (32767, 0), 0), ((135, 46),
+ 93, 10, (32767, 0), 0), ((135, 47), 93, 8, (32767, 0), 0)));
+ Table.States (966).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (967).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (967), 12, (402, 0), 165);
+ Add_Action (Table.States (967), 46, (233, 2), 167);
+ Add_Action (Table.States (967), 52, (233, 3), 168);
+ Add_Action (Table.States (967), 65, (234, 1), 169);
+ Add_Action (Table.States (967), 76, (256, 0), 170);
+ Add_Action (Table.States (967), 85, (205, 4), 171);
+ Add_Action (Table.States (967), 86, (213, 2), 172);
+ Add_Action (Table.States (967), 90, (268, 0), 34);
+ Add_Action (Table.States (967), 106, (237, 1), 173);
+ Add_Action (Table.States (967), 107, (237, 0), 174);
+ Add_Action (Table.States (967), 115, (234, 0), 175);
+ Add_Action (Table.States (967), 116, (196, 0), 146);
+ Add_Action (Table.States (967), 117, (196, 1), 37);
+ Add_Action (Table.States (967), 118, (195, 6), 38);
+ Table.States (967).Goto_List.Set_Capacity (31);
+ Add_Goto (Table.States (967), 195, 176);
+ Add_Goto (Table.States (967), 196, 148);
+ Add_Goto (Table.States (967), 197, 54);
+ Add_Goto (Table.States (967), 198, 55);
+ Add_Goto (Table.States (967), 199, 56);
+ Add_Goto (Table.States (967), 201, 57);
+ Add_Goto (Table.States (967), 205, 177);
+ Add_Goto (Table.States (967), 206, 178);
+ Add_Goto (Table.States (967), 210, 179);
+ Add_Goto (Table.States (967), 211, 180);
+ Add_Goto (Table.States (967), 213, 181);
+ Add_Goto (Table.States (967), 214, 182);
+ Add_Goto (Table.States (967), 215, 183);
+ Add_Goto (Table.States (967), 218, 184);
+ Add_Goto (Table.States (967), 219, 185);
+ Add_Goto (Table.States (967), 220, 186);
+ Add_Goto (Table.States (967), 227, 1367);
+ Add_Goto (Table.States (967), 228, 188);
+ Add_Goto (Table.States (967), 231, 189);
+ Add_Goto (Table.States (967), 232, 190);
+ Add_Goto (Table.States (967), 233, 191);
+ Add_Goto (Table.States (967), 234, 192);
+ Add_Goto (Table.States (967), 237, 193);
+ Add_Goto (Table.States (967), 251, 58);
+ Add_Goto (Table.States (967), 252, 59);
+ Add_Goto (Table.States (967), 255, 60);
+ Add_Goto (Table.States (967), 256, 194);
+ Add_Goto (Table.States (967), 268, 68);
+ Add_Goto (Table.States (967), 311, 83);
+ Add_Goto (Table.States (967), 402, 195);
+ Add_Goto (Table.States (967), 465, 196);
+ Table.States (967).Kernel := To_Vector ((0 => ((249, 0), 38, 1,
(32767, 0), 0)));
+ Table.States (967).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (968).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (968), (38, 59, 60, 116), (460, 1), 2);
+ Table.States (968).Kernel := To_Vector ((((460, 0), 250, 0,
(460, 0), 1), ((460, 1), 250, 0, (460, 1),
+ 2)));
+ Table.States (968).Minimal_Complete_Actions := To_Vector
(((Reduce, (460, 0), 1), (Reduce, (460, 1),
+ 2)));
+ Table.States (969).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (969), (38, 59, 60, 116), (460, 2), 2);
+ Table.States (969).Goto_List.Set_Capacity (7);
+ Add_Goto (Table.States (969), 135, 619);
+ Add_Goto (Table.States (969), 136, 620);
+ Add_Goto (Table.States (969), 250, 968);
+ Add_Goto (Table.States (969), 335, 622);
+ Add_Goto (Table.States (969), 341, 104);
+ Add_Goto (Table.States (969), 347, 107);
+ Add_Goto (Table.States (969), 460, 969);
+ Table.States (969).Kernel := To_Vector ((((460, 1), 460, 3,
(32767, 0), 0), ((460, 2), 460, 0, (460,
+ 2), 2), ((460, 2), 460, 3, (32767, 0), 0)));
+ Table.States (969).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (460, 2), 2)));
+ Table.States (970).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (970), 12, (402, 0), 165);
+ Add_Action (Table.States (970), 46, (233, 2), 167);
+ Add_Action (Table.States (970), 52, (233, 3), 168);
+ Add_Action (Table.States (970), 65, (234, 1), 169);
+ Add_Action (Table.States (970), 76, (256, 0), 170);
+ Add_Action (Table.States (970), 85, (205, 4), 171);
+ Add_Action (Table.States (970), 86, (213, 2), 172);
+ Add_Action (Table.States (970), 90, (268, 0), 34);
+ Add_Action (Table.States (970), 106, (237, 1), 173);
+ Add_Action (Table.States (970), 107, (237, 0), 174);
+ Add_Action (Table.States (970), 115, (234, 0), 175);
+ Add_Action (Table.States (970), 116, (196, 0), 146);
+ Add_Action (Table.States (970), 117, (196, 1), 37);
+ Add_Action (Table.States (970), 118, (195, 6), 38);
+ Table.States (970).Goto_List.Set_Capacity (31);
+ Add_Goto (Table.States (970), 195, 176);
+ Add_Goto (Table.States (970), 196, 148);
+ Add_Goto (Table.States (970), 197, 54);
+ Add_Goto (Table.States (970), 198, 55);
+ Add_Goto (Table.States (970), 199, 56);
+ Add_Goto (Table.States (970), 201, 57);
+ Add_Goto (Table.States (970), 205, 177);
+ Add_Goto (Table.States (970), 206, 178);
+ Add_Goto (Table.States (970), 210, 179);
+ Add_Goto (Table.States (970), 211, 180);
+ Add_Goto (Table.States (970), 213, 181);
+ Add_Goto (Table.States (970), 214, 182);
+ Add_Goto (Table.States (970), 215, 183);
+ Add_Goto (Table.States (970), 218, 184);
+ Add_Goto (Table.States (970), 219, 185);
+ Add_Goto (Table.States (970), 220, 186);
+ Add_Goto (Table.States (970), 227, 1368);
+ Add_Goto (Table.States (970), 228, 188);
+ Add_Goto (Table.States (970), 231, 189);
+ Add_Goto (Table.States (970), 232, 190);
+ Add_Goto (Table.States (970), 233, 191);
+ Add_Goto (Table.States (970), 234, 192);
+ Add_Goto (Table.States (970), 237, 193);
+ Add_Goto (Table.States (970), 251, 58);
+ Add_Goto (Table.States (970), 252, 59);
+ Add_Goto (Table.States (970), 255, 60);
+ Add_Goto (Table.States (970), 256, 194);
+ Add_Goto (Table.States (970), 268, 68);
+ Add_Goto (Table.States (970), 311, 83);
+ Add_Goto (Table.States (970), 402, 195);
+ Add_Goto (Table.States (970), 465, 196);
+ Table.States (970).Kernel := To_Vector ((((242, 0), 43, 7,
(32767, 0), 0), ((242, 1), 43, 5, (32767,
+ 0), 0), ((242, 2), 43, 3, (32767, 0), 0), ((242, 3), 43, 1,
(32767, 0), 0)));
+ Table.States (970).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (971).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (971), 99, (314, 0), 632);
+ Table.States (971).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (971), 314, 1369);
+ Table.States (971).Kernel := To_Vector ((0 => ((247, 0), 278, 2,
(32767, 0), 0)));
+ Table.States (971).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (314, 0), 99, 632)));
+ Table.States (972).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (972), 99, (314, 0), 632);
+ Table.States (972).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (972), 314, 1370);
+ Table.States (972).Kernel := To_Vector ((0 => ((247, 1), 280, 2,
(32767, 0), 0)));
+ Table.States (972).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (314, 0), 99, 632)));
+ Table.States (973).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (973), 63, (246, 0), 1371);
+ Table.States (973).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (973), 244, 1372);
+ Add_Goto (Table.States (973), 246, 1373);
+ Table.States (973).Kernel := To_Vector ((0 => ((245, 0), 82, 4,
(32767, 0), 0)));
+ Table.States (973).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (246, 0), 63, 1371)));
+ Table.States (974).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (974), (91, 99), (177, 1), 3);
+ Table.States (974).Kernel := To_Vector ((0 => ((177, 1), 178, 0,
(177, 1), 3)));
+ Table.States (974).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (177, 1), 3)));
+ Table.States (975).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (975), (91, 99), (178, 0), 1);
+ Table.States (975).Kernel := To_Vector ((0 => ((178, 0), 227, 0,
(178, 0), 1)));
+ Table.States (975).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (178, 0), 1)));
+ Table.States (976).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (976), (87, 88, 95), (314, 1), 2);
+ Table.States (976).Kernel := To_Vector ((0 => ((314, 1), 92, 0,
(314, 1), 2)));
+ Table.States (976).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (314, 1), 2)));
+ Table.States (977).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (977), (87, 88, 95), (314, 0), 2);
+ Table.States (977).Kernel := To_Vector ((0 => ((314, 0), 227, 0,
(314, 0), 2)));
+ Table.States (977).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (314, 0), 2)));
+ Table.States (978).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (978), (33, 36, 47, 49, 50, 61, 63, 69,
75, 87, 91, 94, 95, 99, 108), (131, 0),
+ 3);
+ Table.States (978).Kernel := To_Vector ((0 => ((131, 0), 132, 0,
(131, 0), 3)));
+ Table.States (978).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (131, 0), 3)));
+ Table.States (979).Action_List.Set_Capacity (16);
+ Add_Action (Table.States (979), 33, Reduce, (453, 1), 2);
+ Add_Action (Table.States (979), 36, Reduce, (453, 1), 2);
+ Add_Action (Table.States (979), 47, Reduce, (453, 1), 2);
+ Add_Action (Table.States (979), 49, Reduce, (453, 1), 2);
+ Add_Action (Table.States (979), 50, Reduce, (453, 1), 2);
+ Add_Action (Table.States (979), 61, Reduce, (453, 1), 2);
+ Add_Action (Table.States (979), 63, Reduce, (453, 1), 2);
+ Add_Action (Table.States (979), 69, Reduce, (453, 1), 2);
+ Add_Action (Table.States (979), 74, (139, 0), 637);
+ Add_Action (Table.States (979), 75, Reduce, (453, 1), 2);
+ Add_Action (Table.States (979), 87, Reduce, (453, 1), 2);
+ Add_Action (Table.States (979), 91, Reduce, (453, 1), 2);
+ Add_Action (Table.States (979), 94, Reduce, (453, 1), 2);
+ Add_Action (Table.States (979), 95, Reduce, (453, 1), 2);
+ Add_Action (Table.States (979), 99, Reduce, (453, 1), 2);
+ Add_Action (Table.States (979), 108, Reduce, (453, 1), 2);
+ Table.States (979).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (979), 139, 1374);
+ Table.States (979).Kernel := To_Vector ((((453, 0), 231, 4,
(32767, 0), 0), ((453, 1), 231, 0, (453,
+ 1), 2)));
+ Table.States (979).Minimal_Complete_Actions := To_Vector (((Shift,
(139, 0), 74, 637), (Reduce, (453, 1),
+ 2)));
+ Table.States (980).Action_List.Set_Capacity (16);
+ Add_Action (Table.States (980), 33, Reduce, (153, 1), 2);
+ Add_Action (Table.States (980), 36, Reduce, (153, 1), 2);
+ Add_Action (Table.States (980), 47, Reduce, (153, 1), 2);
+ Add_Action (Table.States (980), 49, Reduce, (153, 1), 2);
+ Add_Action (Table.States (980), 50, Reduce, (153, 1), 2);
+ Add_Action (Table.States (980), 61, Reduce, (153, 1), 2);
+ Add_Action (Table.States (980), 63, Reduce, (153, 1), 2);
+ Add_Action (Table.States (980), 69, Reduce, (153, 1), 2);
+ Add_Action (Table.States (980), 74, (139, 0), 637);
+ Add_Action (Table.States (980), 75, Reduce, (153, 1), 2);
+ Add_Action (Table.States (980), 87, Reduce, (153, 1), 2);
+ Add_Action (Table.States (980), 91, Reduce, (153, 1), 2);
+ Add_Action (Table.States (980), 94, Reduce, (153, 1), 2);
+ Add_Action (Table.States (980), 95, Reduce, (153, 1), 2);
+ Add_Action (Table.States (980), 99, Reduce, (153, 1), 2);
+ Add_Action (Table.States (980), 108, Reduce, (153, 1), 2);
+ Table.States (980).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (980), 139, 1375);
+ Table.States (980).Kernel := To_Vector ((((153, 0), 231, 4,
(32767, 0), 0), ((153, 1), 231, 0, (153,
+ 1), 2)));
+ Table.States (980).Minimal_Complete_Actions := To_Vector (((Shift,
(139, 0), 74, 637), (Reduce, (153, 1),
+ 2)));
+ Table.States (981).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (981), (33, 36, 47, 49, 50, 61, 63, 69,
75, 87, 91, 94, 95, 99, 108), (139, 0),
+ 2);
+ Table.States (981).Kernel := To_Vector ((0 => ((139, 0), 140, 0,
(139, 0), 2)));
+ Table.States (981).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (139, 0), 2)));
+ Table.States (982).Action_List.Set_Capacity (24);
+ Add_Action (Table.States (982), 33, Reduce, (204, 1), 1);
+ Add_Action (Table.States (982), 36, Reduce, (204, 1), 1);
+ Add_Action (Table.States (982), 41, Reduce, (204, 1), 1);
+ Add_Action (Table.States (982), 43, Reduce, (204, 1), 1);
+ Add_Action (Table.States (982), 44, Reduce, (204, 1), 1);
+ Add_Action (Table.States (982), 47, Reduce, (204, 1), 1);
+ Add_Action (Table.States (982), 48, Reduce, (204, 1), 1);
+ Add_Action (Table.States (982), 49, Reduce, (204, 1), 1);
+ Add_Action (Table.States (982), 50, Reduce, (204, 1), 1);
+ Add_Action (Table.States (982), 61, Reduce, (204, 1), 1);
+ Add_Action (Table.States (982), 63, Reduce, (204, 1), 1);
+ Add_Action (Table.States (982), 69, Reduce, (204, 1), 1);
+ Add_Action (Table.States (982), 72, Reduce, (204, 1), 1);
+ Add_Action (Table.States (982), 74, Reduce, (204, 1), 1);
+ Add_Action (Table.States (982), 75, Reduce, (204, 1), 1);
+ Add_Action (Table.States (982), 82, Reduce, (204, 1), 1);
+ Add_Action (Table.States (982), 85, (204, 0), 1376);
+ Add_Action (Table.States (982), 87, Reduce, (204, 1), 1);
+ Add_Action (Table.States (982), 88, Reduce, (204, 1), 1);
+ Add_Action (Table.States (982), 91, Reduce, (204, 1), 1);
+ Add_Action (Table.States (982), 94, Reduce, (204, 1), 1);
+ Add_Action (Table.States (982), 95, Reduce, (204, 1), 1);
+ Add_Action (Table.States (982), 99, Reduce, (204, 1), 1);
+ Add_Action (Table.States (982), 108, Reduce, (204, 1), 1);
+ Table.States (982).Kernel := To_Vector ((((204, 0), 74, 3,
(32767, 0), 0), ((204, 1), 74, 0, (204, 1),
+ 1)));
+ Table.States (982).Minimal_Complete_Actions := To_Vector (((Shift,
(204, 0), 85, 1376), (Reduce, (204, 1),
+ 1)));
+ Table.States (983).Action_List.Set_Capacity (23);
+ Add_Action (Table.States (983), (33, 36, 41, 43, 44, 47, 48, 49,
50, 61, 63, 69, 72, 74, 75, 82, 87, 88,
+ 91, 94, 95, 99, 108), (203, 0), 3);
+ Table.States (983).Kernel := To_Vector ((0 => ((203, 0), 204, 0,
(203, 0), 3)));
+ Table.States (983).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (203, 0), 3)));
+ Table.States (984).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (984), (91, 99), (209, 1), 3);
+ Table.States (984).Kernel := To_Vector ((0 => ((209, 1), 200, 0,
(209, 1), 3)));
+ Table.States (984).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (209, 1), 3)));
+ Table.States (985).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (985), 99, (314, 0), 632);
+ Table.States (985).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (985), 314, 1377);
+ Table.States (985).Kernel := To_Vector ((0 => ((213, 1), 62, 3,
(32767, 0), 0)));
+ Table.States (985).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (314, 0), 99, 632)));
+ Table.States (986).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (986), (87, 88, 95), (212, 1), 3);
+ Table.States (986).Kernel := To_Vector ((0 => ((212, 1), 227, 0,
(212, 1), 3)));
+ Table.States (986).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (212, 1), 3)));
+ Table.States (987).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (987), (87, 88, 95), (216, 2), 3);
+ Table.States (987).Kernel := To_Vector ((((216, 1), 216, 4,
(32767, 0), 0), ((216, 2), 216, 0, (216,
+ 2), 3), ((216, 2), 216, 4, (32767, 0), 0)));
+ Table.States (987).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (216, 2), 3)));
+ Table.States (988).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (988), (87, 88, 95), (216, 1), 3);
+ Table.States (988).Kernel := To_Vector ((((216, 0), 217, 0,
(216, 0), 1), ((216, 1), 217, 0, (216, 1),
+ 3)));
+ Table.States (988).Minimal_Complete_Actions := To_Vector
(((Reduce, (216, 0), 1), (Reduce, (216, 1),
+ 3)));
+ Table.States (989).Action_List.Set_Capacity (16);
+ Add_Action (Table.States (989), 12, (402, 0), 165);
+ Add_Action (Table.States (989), 46, (233, 2), 167);
+ Add_Action (Table.States (989), 51, (221, 0), 273);
+ Add_Action (Table.States (989), 52, (187, 0), 356);
+ Add_Action (Table.States (989), 62, (178, 3), 357);
+ Add_Action (Table.States (989), 65, (207, 1), 359);
+ Add_Action (Table.States (989), 76, (256, 0), 170);
+ Add_Action (Table.States (989), 85, (205, 4), 171);
+ Add_Action (Table.States (989), 86, (213, 2), 172);
+ Add_Action (Table.States (989), 90, (268, 0), 34);
+ Add_Action (Table.States (989), 106, (237, 1), 173);
+ Add_Action (Table.States (989), 107, (237, 0), 174);
+ Add_Action (Table.States (989), 115, (234, 0), 175);
+ Add_Action (Table.States (989), 116, (196, 0), 146);
+ Add_Action (Table.States (989), 117, (196, 1), 37);
+ Add_Action (Table.States (989), 118, (195, 6), 360);
+ Table.States (989).Goto_List.Set_Capacity (45);
+ Add_Goto (Table.States (989), 131, 361);
+ Add_Goto (Table.States (989), 140, 362);
+ Add_Goto (Table.States (989), 177, 363);
+ Add_Goto (Table.States (989), 178, 364);
+ Add_Goto (Table.States (989), 187, 365);
+ Add_Goto (Table.States (989), 195, 366);
+ Add_Goto (Table.States (989), 196, 367);
+ Add_Goto (Table.States (989), 197, 54);
+ Add_Goto (Table.States (989), 198, 55);
+ Add_Goto (Table.States (989), 199, 56);
+ Add_Goto (Table.States (989), 200, 368);
+ Add_Goto (Table.States (989), 201, 57);
+ Add_Goto (Table.States (989), 203, 369);
+ Add_Goto (Table.States (989), 205, 177);
+ Add_Goto (Table.States (989), 206, 178);
+ Add_Goto (Table.States (989), 207, 1378);
+ Add_Goto (Table.States (989), 208, 371);
+ Add_Goto (Table.States (989), 209, 372);
+ Add_Goto (Table.States (989), 210, 179);
+ Add_Goto (Table.States (989), 211, 180);
+ Add_Goto (Table.States (989), 213, 181);
+ Add_Goto (Table.States (989), 214, 182);
+ Add_Goto (Table.States (989), 215, 183);
+ Add_Goto (Table.States (989), 216, 1379);
+ Add_Goto (Table.States (989), 217, 375);
+ Add_Goto (Table.States (989), 218, 184);
+ Add_Goto (Table.States (989), 219, 185);
+ Add_Goto (Table.States (989), 220, 186);
+ Add_Goto (Table.States (989), 221, 376);
+ Add_Goto (Table.States (989), 227, 1380);
+ Add_Goto (Table.States (989), 228, 188);
+ Add_Goto (Table.States (989), 231, 378);
+ Add_Goto (Table.States (989), 232, 190);
+ Add_Goto (Table.States (989), 233, 191);
+ Add_Goto (Table.States (989), 234, 192);
+ Add_Goto (Table.States (989), 237, 193);
+ Add_Goto (Table.States (989), 251, 58);
+ Add_Goto (Table.States (989), 252, 59);
+ Add_Goto (Table.States (989), 255, 60);
+ Add_Goto (Table.States (989), 256, 194);
+ Add_Goto (Table.States (989), 268, 68);
+ Add_Goto (Table.States (989), 311, 83);
+ Add_Goto (Table.States (989), 402, 195);
+ Add_Goto (Table.States (989), 459, 384);
+ Add_Goto (Table.States (989), 465, 196);
+ Table.States (989).Kernel := To_Vector ((((219, 0), 71, 3,
(32767, 0), 0), ((220, 0), 71, 4, (32767,
+ 0), 0)));
+ Table.States (989).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (207, 1), 65, 359)));
+ end Subr_39;
+ procedure Subr_40
+ is begin
+ Table.States (990).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (990), 87, (210, 0), 1381);
+ Table.States (990).Kernel := To_Vector ((0 => ((210, 0), 207, 1,
(32767, 0), 0)));
+ Table.States (990).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (210, 0), 87, 1381)));
+ Table.States (991).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (991), (87, 95), (208, 1), 1);
+ Table.States (991).Kernel := To_Vector ((0 => ((208, 1), 227, 0,
(208, 1), 1)));
+ Table.States (991).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (208, 1), 1)));
+ Table.States (992).Action_List.Set_Capacity (23);
+ Add_Action (Table.States (992), (33, 36, 41, 43, 44, 47, 48, 49,
50, 61, 63, 69, 72, 74, 75, 82, 87, 88,
+ 91, 94, 95, 99, 108), (140, 1), 3);
+ Table.States (992).Kernel := To_Vector ((0 => ((140, 1), 231, 0,
(140, 1), 3)));
+ Table.States (992).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (140, 1), 3)));
+ Table.States (993).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (993), (87, 95), (459, 1), 3);
+ Table.States (993).Kernel := To_Vector ((((459, 0), 208, 0,
(459, 0), 1), ((459, 1), 208, 0, (459, 1),
+ 3)));
+ Table.States (993).Minimal_Complete_Actions := To_Vector
(((Reduce, (459, 0), 1), (Reduce, (459, 1),
+ 3)));
+ Table.States (994).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (994), (87, 95), (459, 2), 3);
+ Table.States (994).Kernel := To_Vector ((((459, 1), 459, 2,
(32767, 0), 0), ((459, 2), 459, 0, (459,
+ 2), 3), ((459, 2), 459, 4, (32767, 0), 0)));
+ Table.States (994).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (459, 2), 3)));
+ Table.States (995).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (995), 99, (314, 0), 632);
+ Table.States (995).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (995), 314, 1382);
+ Table.States (995).Kernel := To_Vector ((0 => ((213, 2), 62, 3,
(32767, 0), 0)));
+ Table.States (995).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (314, 0), 99, 632)));
+ Table.States (996).Action_List.Set_Capacity (16);
+ Add_Action (Table.States (996), 12, (402, 0), 165);
+ Add_Action (Table.States (996), 46, (233, 2), 167);
+ Add_Action (Table.States (996), 51, (221, 0), 273);
+ Add_Action (Table.States (996), 52, (187, 0), 356);
+ Add_Action (Table.States (996), 62, (178, 3), 385);
+ Add_Action (Table.States (996), 65, (234, 1), 169);
+ Add_Action (Table.States (996), 76, (256, 0), 170);
+ Add_Action (Table.States (996), 85, (205, 4), 171);
+ Add_Action (Table.States (996), 86, (213, 2), 172);
+ Add_Action (Table.States (996), 90, (268, 0), 34);
+ Add_Action (Table.States (996), 106, (237, 1), 173);
+ Add_Action (Table.States (996), 107, (237, 0), 174);
+ Add_Action (Table.States (996), 115, (234, 0), 175);
+ Add_Action (Table.States (996), 116, (196, 0), 146);
+ Add_Action (Table.States (996), 117, (196, 1), 37);
+ Add_Action (Table.States (996), 118, (195, 6), 38);
+ Table.States (996).Goto_List.Set_Capacity (40);
+ Add_Goto (Table.States (996), 131, 361);
+ Add_Goto (Table.States (996), 140, 362);
+ Add_Goto (Table.States (996), 177, 363);
+ Add_Goto (Table.States (996), 178, 364);
+ Add_Goto (Table.States (996), 187, 365);
+ Add_Goto (Table.States (996), 195, 366);
+ Add_Goto (Table.States (996), 196, 148);
+ Add_Goto (Table.States (996), 197, 54);
+ Add_Goto (Table.States (996), 198, 55);
+ Add_Goto (Table.States (996), 199, 56);
+ Add_Goto (Table.States (996), 201, 57);
+ Add_Goto (Table.States (996), 203, 369);
+ Add_Goto (Table.States (996), 205, 177);
+ Add_Goto (Table.States (996), 206, 178);
+ Add_Goto (Table.States (996), 210, 179);
+ Add_Goto (Table.States (996), 211, 180);
+ Add_Goto (Table.States (996), 213, 181);
+ Add_Goto (Table.States (996), 214, 182);
+ Add_Goto (Table.States (996), 215, 183);
+ Add_Goto (Table.States (996), 216, 1383);
+ Add_Goto (Table.States (996), 217, 375);
+ Add_Goto (Table.States (996), 218, 184);
+ Add_Goto (Table.States (996), 219, 185);
+ Add_Goto (Table.States (996), 220, 186);
+ Add_Goto (Table.States (996), 221, 376);
+ Add_Goto (Table.States (996), 227, 975);
+ Add_Goto (Table.States (996), 228, 188);
+ Add_Goto (Table.States (996), 231, 378);
+ Add_Goto (Table.States (996), 232, 190);
+ Add_Goto (Table.States (996), 233, 191);
+ Add_Goto (Table.States (996), 234, 192);
+ Add_Goto (Table.States (996), 237, 193);
+ Add_Goto (Table.States (996), 251, 58);
+ Add_Goto (Table.States (996), 252, 59);
+ Add_Goto (Table.States (996), 255, 60);
+ Add_Goto (Table.States (996), 256, 194);
+ Add_Goto (Table.States (996), 268, 68);
+ Add_Goto (Table.States (996), 311, 83);
+ Add_Goto (Table.States (996), 402, 195);
+ Add_Goto (Table.States (996), 465, 196);
+ Table.States (996).Kernel := To_Vector ((0 => ((220, 1), 71, 4,
(32767, 0), 0)));
+ Table.States (996).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (178, 3), 62, 385)));
+ Table.States (997).Action_List.Set_Capacity (18);
+ Add_Action (Table.States (997), (33, 36, 41, 43, 44, 49, 50, 61,
63, 72, 74, 82, 87, 88, 91, 95, 99, 108),
+ (225, 0), 3);
+ Table.States (997).Kernel := To_Vector ((0 => ((225, 0), 228, 0,
(225, 0), 3)));
+ Table.States (997).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (225, 0), 3)));
+ Table.States (998).Action_List.Set_Capacity (18);
+ Add_Action (Table.States (998), (33, 36, 41, 43, 44, 50, 61, 63,
72, 74, 75, 82, 87, 88, 91, 95, 99, 108),
+ (223, 0), 3);
+ Table.States (998).Kernel := To_Vector ((0 => ((223, 0), 228, 0,
(223, 0), 3)));
+ Table.States (998).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (223, 0), 3)));
+ Table.States (999).Action_List.Set_Capacity (18);
+ Add_Action (Table.States (999), (33, 36, 41, 43, 44, 50, 61, 63,
72, 74, 75, 82, 87, 88, 91, 95, 99, 108),
+ (222, 1), 3);
+ Table.States (999).Kernel := To_Vector ((0 => ((222, 1), 228, 0,
(222, 1), 3)));
+ Table.States (999).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (222, 1), 3)));
+ Table.States (1000).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (1000), 12, (402, 0), 165);
+ Add_Action (Table.States (1000), 46, (233, 2), 167);
+ Add_Action (Table.States (1000), 52, (233, 3), 168);
+ Add_Action (Table.States (1000), 65, (234, 1), 169);
+ Add_Action (Table.States (1000), 76, (256, 0), 170);
+ Add_Action (Table.States (1000), 85, (205, 4), 171);
+ Add_Action (Table.States (1000), 86, (213, 2), 172);
+ Add_Action (Table.States (1000), 90, (268, 0), 34);
+ Add_Action (Table.States (1000), 106, (237, 1), 173);
+ Add_Action (Table.States (1000), 107, (237, 0), 174);
+ Add_Action (Table.States (1000), 115, (234, 0), 175);
+ Add_Action (Table.States (1000), 116, (196, 0), 146);
+ Add_Action (Table.States (1000), 117, (196, 1), 37);
+ Add_Action (Table.States (1000), 118, (195, 6), 38);
+ Table.States (1000).Goto_List.Set_Capacity (30);
+ Add_Goto (Table.States (1000), 195, 176);
+ Add_Goto (Table.States (1000), 196, 148);
+ Add_Goto (Table.States (1000), 197, 54);
+ Add_Goto (Table.States (1000), 198, 55);
+ Add_Goto (Table.States (1000), 199, 56);
+ Add_Goto (Table.States (1000), 201, 57);
+ Add_Goto (Table.States (1000), 205, 177);
+ Add_Goto (Table.States (1000), 206, 178);
+ Add_Goto (Table.States (1000), 210, 179);
+ Add_Goto (Table.States (1000), 211, 180);
+ Add_Goto (Table.States (1000), 213, 181);
+ Add_Goto (Table.States (1000), 214, 182);
+ Add_Goto (Table.States (1000), 215, 183);
+ Add_Goto (Table.States (1000), 218, 184);
+ Add_Goto (Table.States (1000), 219, 185);
+ Add_Goto (Table.States (1000), 220, 186);
+ Add_Goto (Table.States (1000), 228, 1384);
+ Add_Goto (Table.States (1000), 231, 189);
+ Add_Goto (Table.States (1000), 232, 190);
+ Add_Goto (Table.States (1000), 233, 191);
+ Add_Goto (Table.States (1000), 234, 192);
+ Add_Goto (Table.States (1000), 237, 193);
+ Add_Goto (Table.States (1000), 251, 58);
+ Add_Goto (Table.States (1000), 252, 59);
+ Add_Goto (Table.States (1000), 255, 60);
+ Add_Goto (Table.States (1000), 256, 194);
+ Add_Goto (Table.States (1000), 268, 68);
+ Add_Goto (Table.States (1000), 311, 83);
+ Add_Goto (Table.States (1000), 402, 195);
+ Add_Goto (Table.States (1000), 465, 196);
+ Table.States (1000).Kernel := To_Vector ((0 => ((223, 1), 43, 1,
(32767, 0), 0)));
+ Table.States (1000).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (1001).Action_List.Set_Capacity (18);
+ Add_Action (Table.States (1001), (33, 36, 41, 43, 44, 49, 50, 61,
63, 72, 74, 82, 87, 88, 91, 95, 99, 108),
+ (224, 1), 3);
+ Table.States (1001).Kernel := To_Vector ((0 => ((224, 1), 228,
0, (224, 1), 3)));
+ Table.States (1001).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (224, 1), 3)));
+ Table.States (1002).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (1002), 12, (402, 0), 165);
+ Add_Action (Table.States (1002), 46, (233, 2), 167);
+ Add_Action (Table.States (1002), 52, (233, 3), 168);
+ Add_Action (Table.States (1002), 65, (234, 1), 169);
+ Add_Action (Table.States (1002), 76, (256, 0), 170);
+ Add_Action (Table.States (1002), 85, (205, 4), 171);
+ Add_Action (Table.States (1002), 86, (213, 2), 172);
+ Add_Action (Table.States (1002), 90, (268, 0), 34);
+ Add_Action (Table.States (1002), 106, (237, 1), 173);
+ Add_Action (Table.States (1002), 107, (237, 0), 174);
+ Add_Action (Table.States (1002), 115, (234, 0), 175);
+ Add_Action (Table.States (1002), 116, (196, 0), 146);
+ Add_Action (Table.States (1002), 117, (196, 1), 37);
+ Add_Action (Table.States (1002), 118, (195, 6), 38);
+ Table.States (1002).Goto_List.Set_Capacity (30);
+ Add_Goto (Table.States (1002), 195, 176);
+ Add_Goto (Table.States (1002), 196, 148);
+ Add_Goto (Table.States (1002), 197, 54);
+ Add_Goto (Table.States (1002), 198, 55);
+ Add_Goto (Table.States (1002), 199, 56);
+ Add_Goto (Table.States (1002), 201, 57);
+ Add_Goto (Table.States (1002), 205, 177);
+ Add_Goto (Table.States (1002), 206, 178);
+ Add_Goto (Table.States (1002), 210, 179);
+ Add_Goto (Table.States (1002), 211, 180);
+ Add_Goto (Table.States (1002), 213, 181);
+ Add_Goto (Table.States (1002), 214, 182);
+ Add_Goto (Table.States (1002), 215, 183);
+ Add_Goto (Table.States (1002), 218, 184);
+ Add_Goto (Table.States (1002), 219, 185);
+ Add_Goto (Table.States (1002), 220, 186);
+ Add_Goto (Table.States (1002), 228, 1385);
+ Add_Goto (Table.States (1002), 231, 189);
+ Add_Goto (Table.States (1002), 232, 190);
+ Add_Goto (Table.States (1002), 233, 191);
+ Add_Goto (Table.States (1002), 234, 192);
+ Add_Goto (Table.States (1002), 237, 193);
+ Add_Goto (Table.States (1002), 251, 58);
+ Add_Goto (Table.States (1002), 252, 59);
+ Add_Goto (Table.States (1002), 255, 60);
+ Add_Goto (Table.States (1002), 256, 194);
+ Add_Goto (Table.States (1002), 268, 68);
+ Add_Goto (Table.States (1002), 311, 83);
+ Add_Goto (Table.States (1002), 402, 195);
+ Add_Goto (Table.States (1002), 465, 196);
+ Table.States (1002).Kernel := To_Vector ((0 => ((225, 1), 41, 1,
(32767, 0), 0)));
+ Table.States (1002).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (1003).Action_List.Set_Capacity (18);
+ Add_Action (Table.States (1003), (33, 36, 41, 43, 44, 48, 50, 61,
63, 72, 74, 82, 87, 88, 91, 95, 99, 108),
+ (226, 1), 3);
+ Table.States (1003).Kernel := To_Vector ((0 => ((226, 1), 228,
0, (226, 1), 3)));
+ Table.States (1003).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (226, 1), 3)));
+ Table.States (1004).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (1004), 46, (233, 2), 167);
+ Add_Action (Table.States (1004), 52, (233, 3), 168);
+ Add_Action (Table.States (1004), 65, (234, 1), 169);
+ Add_Action (Table.States (1004), 76, (256, 0), 170);
+ Add_Action (Table.States (1004), 85, (205, 4), 171);
+ Add_Action (Table.States (1004), 86, (213, 2), 172);
+ Add_Action (Table.States (1004), 90, (268, 0), 34);
+ Add_Action (Table.States (1004), 106, (237, 1), 173);
+ Add_Action (Table.States (1004), 107, (237, 0), 174);
+ Add_Action (Table.States (1004), 115, (234, 0), 175);
+ Add_Action (Table.States (1004), 116, (196, 0), 146);
+ Add_Action (Table.States (1004), 117, (196, 1), 37);
+ Add_Action (Table.States (1004), 118, (195, 6), 38);
+ Table.States (1004).Goto_List.Set_Capacity (32);
+ Add_Goto (Table.States (1004), 140, 672);
+ Add_Goto (Table.States (1004), 195, 673);
+ Add_Goto (Table.States (1004), 196, 148);
+ Add_Goto (Table.States (1004), 197, 54);
+ Add_Goto (Table.States (1004), 198, 55);
+ Add_Goto (Table.States (1004), 199, 56);
+ Add_Goto (Table.States (1004), 201, 57);
+ Add_Goto (Table.States (1004), 203, 369);
+ Add_Goto (Table.States (1004), 205, 177);
+ Add_Goto (Table.States (1004), 206, 178);
+ Add_Goto (Table.States (1004), 210, 179);
+ Add_Goto (Table.States (1004), 211, 180);
+ Add_Goto (Table.States (1004), 213, 181);
+ Add_Goto (Table.States (1004), 214, 182);
+ Add_Goto (Table.States (1004), 215, 183);
+ Add_Goto (Table.States (1004), 218, 184);
+ Add_Goto (Table.States (1004), 219, 185);
+ Add_Goto (Table.States (1004), 220, 186);
+ Add_Goto (Table.States (1004), 229, 1386);
+ Add_Goto (Table.States (1004), 230, 1387);
+ Add_Goto (Table.States (1004), 231, 676);
+ Add_Goto (Table.States (1004), 232, 190);
+ Add_Goto (Table.States (1004), 233, 191);
+ Add_Goto (Table.States (1004), 234, 192);
+ Add_Goto (Table.States (1004), 237, 193);
+ Add_Goto (Table.States (1004), 251, 58);
+ Add_Goto (Table.States (1004), 252, 59);
+ Add_Goto (Table.States (1004), 255, 60);
+ Add_Goto (Table.States (1004), 256, 194);
+ Add_Goto (Table.States (1004), 268, 68);
+ Add_Goto (Table.States (1004), 311, 83);
+ Add_Goto (Table.States (1004), 465, 196);
+ Table.States (1004).Kernel := To_Vector ((((229, 1), 91, 1,
(32767, 0), 0), ((229, 2), 91, 1, (32767,
+ 0), 0)));
+ Table.States (1005).Action_List.Set_Capacity (20);
+ Add_Action (Table.States (1005), 33, Reduce, (228, 2), 4);
+ Add_Action (Table.States (1005), 36, Reduce, (228, 2), 4);
+ Add_Action (Table.States (1005), 41, Reduce, (228, 2), 4);
+ Add_Action (Table.States (1005), 43, Reduce, (228, 2), 4);
+ Add_Action (Table.States (1005), 44, Reduce, (228, 2), 4);
+ Add_Action (Table.States (1005), 48, Reduce, (228, 2), 4);
+ Add_Action (Table.States (1005), 49, Reduce, (228, 2), 4);
+ Add_Action (Table.States (1005), 50, Reduce, (228, 2), 4);
+ Add_Action (Table.States (1005), 61, Reduce, (228, 2), 4);
+ Add_Action (Table.States (1005), 63, Reduce, (228, 2), 4);
+ Add_Action (Table.States (1005), 72, Reduce, (228, 2), 4);
+ Add_Action (Table.States (1005), 74, Reduce, (228, 2), 4);
+ Add_Action (Table.States (1005), 75, Reduce, (228, 2), 4);
+ Add_Action (Table.States (1005), 82, Reduce, (228, 2), 4);
+ Add_Action (Table.States (1005), 87, Reduce, (228, 2), 4);
+ Add_Action (Table.States (1005), 88, Reduce, (228, 2), 4);
+ Add_Action (Table.States (1005), 91, (229, 1), 1004);
+ Add_Conflict (Table.States (1005), 91, (228, 2), 4);
+ Add_Action (Table.States (1005), 95, Reduce, (228, 2), 4);
+ Add_Action (Table.States (1005), 99, Reduce, (228, 2), 4);
+ Add_Action (Table.States (1005), 108, Reduce, (228, 2), 4);
+ Table.States (1005).Kernel := To_Vector ((((228, 2), 229, 0,
(228, 2), 4), ((229, 1), 229, 2, (32767,
+ 0), 0), ((229, 2), 229, 2, (32767, 0), 0)));
+ Table.States (1005).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (228, 2), 4)));
+ Table.States (1006).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (1006), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (363, 0), 5);
+ Table.States (1006).Kernel := To_Vector ((0 => ((363, 0), 108,
0, (363, 0), 5)));
+ Table.States (1006).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (363, 0), 5)));
+ Table.States (1007).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1007), 33, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1007), 85, (299, 0), 1257);
+ Add_Action (Table.States (1007), 108, Reduce, (295, 1), 0);
+ Table.States (1007).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1007), 295, 1388);
+ Add_Goto (Table.States (1007), 299, 426);
+ Table.States (1007).Kernel := To_Vector ((((357, 0), 87, 5,
(32767, 0), 0), ((357, 1), 87, 1, (32767,
+ 0), 0)));
+ Table.States (1007).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (295, 1), 0)));
+ Table.States (1008).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1008), 66, (357, 2), 1389);
+ Table.States (1008).Kernel := To_Vector ((0 => ((357, 2), 396,
2, (32767, 0), 0)));
+ Table.States (1008).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (357, 2), 66, 1389)));
+ Table.States (1009).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1009), 61, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1009), 85, (299, 0), 1257);
+ Add_Action (Table.States (1009), 108, Reduce, (295, 1), 0);
+ Table.States (1009).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1009), 295, 1390);
+ Add_Goto (Table.States (1009), 299, 426);
+ Table.States (1009).Kernel := To_Vector ((((356, 4), 87, 3,
(32767, 0), 0), ((356, 5), 87, 1, (32767,
+ 0), 0)));
+ Table.States (1009).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (295, 1), 0)));
+ Table.States (1010).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1010), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (356, 6), 5);
+ Table.States (1010).Kernel := To_Vector ((0 => ((356, 6), 108,
0, (356, 6), 5)));
+ Table.States (1010).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (356, 6), 5)));
+ Table.States (1011).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1011), 61, (434, 0), 299);
+ Add_Action (Table.States (1011), 85, (198, 0), 281);
+ Add_Action (Table.States (1011), 96, (197, 0), 283);
+ Add_Action (Table.States (1011), 108, (339, 1), 1391);
+ Add_Action (Table.States (1011), 113, (121, 0), 285);
+ Add_Action (Table.States (1011), 114, (121, 1), 286);
+ Table.States (1011).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1011), 121, 287);
+ Add_Goto (Table.States (1011), 313, 289);
+ Add_Goto (Table.States (1011), 434, 1392);
+ Table.States (1011).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((339, 0), 195, 3, (32767, 0), 0),
+ ((339, 1), 195, 1, (32767, 0), 0)));
+ Table.States (1011).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (339, 1), 108, 1391)));
+ Table.States (1012).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1012), 61, (434, 0), 299);
+ Add_Action (Table.States (1012), 85, (198, 0), 281);
+ Add_Action (Table.States (1012), 96, (197, 0), 283);
+ Add_Action (Table.States (1012), 108, (339, 5), 1393);
+ Add_Action (Table.States (1012), 113, (121, 0), 285);
+ Add_Action (Table.States (1012), 114, (121, 1), 286);
+ Table.States (1012).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1012), 121, 287);
+ Add_Goto (Table.States (1012), 313, 289);
+ Add_Goto (Table.States (1012), 434, 1394);
+ Table.States (1012).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((339, 4), 195, 3, (32767, 0), 0),
+ ((339, 5), 195, 1, (32767, 0), 0)));
+ Table.States (1012).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (339, 5), 108, 1393)));
+ Table.States (1013).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1013), 61, (434, 0), 299);
+ Add_Action (Table.States (1013), 85, (198, 0), 281);
+ Add_Action (Table.States (1013), 96, (197, 0), 283);
+ Add_Action (Table.States (1013), 108, (339, 3), 1395);
+ Add_Action (Table.States (1013), 113, (121, 0), 285);
+ Add_Action (Table.States (1013), 114, (121, 1), 286);
+ Table.States (1013).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1013), 121, 287);
+ Add_Goto (Table.States (1013), 313, 289);
+ Add_Goto (Table.States (1013), 434, 1396);
+ Table.States (1013).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((339, 2), 195, 3, (32767, 0), 0),
+ ((339, 3), 195, 1, (32767, 0), 0)));
+ Table.States (1013).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (339, 3), 108, 1395)));
+ Table.States (1014).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1014), 76, (430, 0), 1397);
+ Table.States (1014).Kernel := To_Vector ((((430, 0), 82, 5,
(32767, 0), 0), ((430, 1), 82, 3, (32767,
+ 0), 0)));
+ Table.States (1014).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (430, 0), 76, 1397)));
+ Table.States (1015).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1015), (61, 108), (428, 2), 1);
+ Table.States (1015).Kernel := To_Vector ((0 => ((428, 2), 65, 0,
(428, 2), 1)));
+ Table.States (1015).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (428, 2), 1)));
+ Table.States (1016).Action_List.Set_Capacity (9);
+ Add_Action (Table.States (1016), 61, (434, 0), 299);
+ Add_Action (Table.States (1016), 65, (428, 2), 1015);
+ Add_Action (Table.States (1016), 86, (252, 0), 33);
+ Add_Action (Table.States (1016), 90, (268, 0), 34);
+ Add_Action (Table.States (1016), 92, (428, 1), 1017);
+ Add_Action (Table.States (1016), 108, (427, 3), 1398);
+ Add_Action (Table.States (1016), 116, (196, 0), 146);
+ Add_Action (Table.States (1016), 117, (196, 1), 37);
+ Add_Action (Table.States (1016), 118, (195, 6), 38);
+ Table.States (1016).Goto_List.Set_Capacity (14);
+ Add_Goto (Table.States (1016), 195, 1018);
+ Add_Goto (Table.States (1016), 196, 148);
+ Add_Goto (Table.States (1016), 197, 54);
+ Add_Goto (Table.States (1016), 198, 55);
+ Add_Goto (Table.States (1016), 199, 56);
+ Add_Goto (Table.States (1016), 201, 57);
+ Add_Goto (Table.States (1016), 251, 58);
+ Add_Goto (Table.States (1016), 252, 59);
+ Add_Goto (Table.States (1016), 255, 60);
+ Add_Goto (Table.States (1016), 268, 68);
+ Add_Goto (Table.States (1016), 311, 83);
+ Add_Goto (Table.States (1016), 428, 1399);
+ Add_Goto (Table.States (1016), 429, 1020);
+ Add_Goto (Table.States (1016), 434, 1400);
+ Table.States (1016).Kernel := To_Vector ((((427, 0), 78, 4,
(32767, 0), 0), ((427, 1), 78, 2, (32767,
+ 0), 0), ((427, 2), 78, 3, (32767, 0), 0), ((427, 3), 78, 1,
(32767, 0), 0)));
+ Table.States (1016).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (427, 3), 108, 1398)));
+ end Subr_40;
+ procedure Subr_41
+ is begin
+ Table.States (1017).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1017), (61, 108), (428, 1), 1);
+ Table.States (1017).Kernel := To_Vector ((0 => ((428, 1), 92, 0,
(428, 1), 1)));
+ Table.States (1017).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (428, 1), 1)));
+ Table.States (1018).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1018), 61, Reduce, (429, 0), 1);
+ Add_Action (Table.States (1018), 85, (198, 0), 281);
+ Add_Action (Table.States (1018), 96, (197, 0), 283);
+ Add_Action (Table.States (1018), 108, Reduce, (429, 0), 1);
+ Add_Action (Table.States (1018), 113, (121, 0), 285);
+ Add_Action (Table.States (1018), 114, (121, 1), 286);
+ Table.States (1018).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1018), 121, 287);
+ Add_Goto (Table.States (1018), 313, 289);
+ Table.States (1018).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((429, 0), 195, 0, (429, 0), 1)));
+ Table.States (1018).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (429, 0), 1)));
+ Table.States (1019).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1019), 61, (434, 0), 299);
+ Add_Action (Table.States (1019), 108, (426, 1), 1401);
+ Table.States (1019).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1019), 434, 1402);
+ Table.States (1019).Kernel := To_Vector ((((426, 0), 428, 3,
(32767, 0), 0), ((426, 1), 428, 1,
+ (32767, 0), 0)));
+ Table.States (1019).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (426, 1), 108, 1401)));
+ Table.States (1020).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1020), (61, 108), (428, 0), 1);
+ Table.States (1020).Kernel := To_Vector ((0 => ((428, 0), 429,
0, (428, 0), 1)));
+ Table.States (1020).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (428, 0), 1)));
+ Table.States (1021).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1021), (28, 50, 53, 54, 61, 83, 84,
116), (426, 2), 4);
+ Table.States (1021).Kernel := To_Vector ((0 => ((426, 2), 108,
0, (426, 2), 4)));
+ Table.States (1021).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (426, 2), 4)));
+ Table.States (1022).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1022), 86, (252, 0), 33);
+ Add_Action (Table.States (1022), 90, (268, 0), 34);
+ Add_Action (Table.States (1022), 116, (196, 0), 146);
+ Add_Action (Table.States (1022), 117, (196, 1), 37);
+ Add_Action (Table.States (1022), 118, (195, 6), 38);
+ Table.States (1022).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (1022), 195, 1403);
+ Add_Goto (Table.States (1022), 196, 148);
+ Add_Goto (Table.States (1022), 197, 54);
+ Add_Goto (Table.States (1022), 198, 55);
+ Add_Goto (Table.States (1022), 199, 56);
+ Add_Goto (Table.States (1022), 201, 57);
+ Add_Goto (Table.States (1022), 251, 58);
+ Add_Goto (Table.States (1022), 252, 59);
+ Add_Goto (Table.States (1022), 255, 60);
+ Add_Goto (Table.States (1022), 268, 68);
+ Add_Goto (Table.States (1022), 311, 83);
+ Table.States (1022).Kernel := To_Vector ((0 => ((412, 6), 50, 2,
(32767, 0), 0)));
+ Table.States (1022).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1023).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1023), (49, 61, 108), (414, 5), 1);
+ Table.States (1023).Kernel := To_Vector ((0 => ((414, 5), 27, 0,
(414, 5), 1)));
+ Table.States (1023).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (414, 5), 1)));
+ Table.States (1024).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1024), 57, (181, 6), 1194);
+ Add_Action (Table.States (1024), 76, (415, 12), 1404);
+ Table.States (1024).Kernel := To_Vector ((((181, 6), 58, 3,
(32767, 0), 0), ((181, 7), 58, 1, (32767,
+ 0), 0), ((415, 12), 58, 6, (32767, 0), 0), ((415, 13), 58,
4, (32767, 0), 0), ((415, 14), 58, 2,
+ (32767, 0), 0)));
+ Table.States (1024).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (181, 6), 57, 1194)));
+ Table.States (1025).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1025), 27, (414, 3), 1405);
+ Add_Action (Table.States (1025), 49, (412, 4), 1406);
+ Add_Action (Table.States (1025), 77, (414, 2), 1407);
+ Add_Action (Table.States (1025), 108, (412, 5), 1408);
+ Table.States (1025).Kernel := To_Vector ((((412, 4), 68, 4,
(32767, 0), 0), ((412, 5), 68, 1, (32767,
+ 0), 0), ((414, 2), 68, 2, (32767, 0), 0), ((414, 3), 68, 1,
(32767, 0), 0)));
+ Table.States (1025).Minimal_Complete_Actions := To_Vector
(((Shift, (412, 5), 108, 1408), (Shift, (414,
+ 3), 27, 1405)));
+ Table.States (1026).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1026), 92, (420, 0), 1409);
+ Table.States (1026).Kernel := To_Vector ((((420, 0), 71, 1,
(32767, 0), 0), ((421, 0), 71, 3, (32767,
+ 0), 0)));
+ Table.States (1026).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (420, 0), 92, 1409)));
+ Table.States (1027).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1027), 92, (419, 0), 1410);
+ Table.States (1027).Kernel := To_Vector ((0 => ((419, 0), 72, 1,
(32767, 0), 0)));
+ Table.States (1027).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (419, 0), 92, 1410)));
+ Table.States (1028).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1028), 92, (418, 0), 1411);
+ Table.States (1028).Kernel := To_Vector ((0 => ((418, 0), 73, 1,
(32767, 0), 0)));
+ Table.States (1028).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (418, 0), 92, 1411)));
+ Table.States (1029).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1029), 92, (417, 0), 1412);
+ Table.States (1029).Kernel := To_Vector ((0 => ((417, 0), 74, 1,
(32767, 0), 0)));
+ Table.States (1029).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (417, 0), 92, 1412)));
+ Table.States (1030).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1030), 86, (252, 0), 33);
+ Add_Action (Table.States (1030), 90, (268, 0), 34);
+ Add_Action (Table.States (1030), 116, (196, 0), 146);
+ Add_Action (Table.States (1030), 117, (196, 1), 37);
+ Add_Action (Table.States (1030), 118, (195, 6), 38);
+ Table.States (1030).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (1030), 195, 1413);
+ Add_Goto (Table.States (1030), 196, 148);
+ Add_Goto (Table.States (1030), 197, 54);
+ Add_Goto (Table.States (1030), 198, 55);
+ Add_Goto (Table.States (1030), 199, 56);
+ Add_Goto (Table.States (1030), 201, 57);
+ Add_Goto (Table.States (1030), 251, 58);
+ Add_Goto (Table.States (1030), 252, 59);
+ Add_Goto (Table.States (1030), 255, 60);
+ Add_Goto (Table.States (1030), 268, 68);
+ Add_Goto (Table.States (1030), 311, 83);
+ Table.States (1030).Kernel := To_Vector ((((415, 15), 76, 5,
(32767, 0), 0), ((415, 16), 76, 3,
+ (32767, 0), 0), ((415, 17), 76, 1, (32767, 0), 0)));
+ Table.States (1030).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1031).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1031), 27, (414, 4), 1414);
+ Add_Action (Table.States (1031), 57, (181, 0), 1217);
+ Add_Action (Table.States (1031), 76, (415, 9), 1415);
+ Table.States (1031).Kernel := To_Vector ((((181, 0), 77, 3,
(32767, 0), 0), ((181, 1), 77, 1, (32767,
+ 0), 0), ((414, 4), 77, 1, (32767, 0), 0), ((415, 9), 77, 6,
(32767, 0), 0), ((415, 10), 77, 4,
+ (32767, 0), 0), ((415, 11), 77, 2, (32767, 0), 0)));
+ Table.States (1031).Minimal_Complete_Actions := To_Vector
(((Shift, (181, 0), 57, 1217), (Shift, (414, 4),
+ 27, 1414)));
+ Table.States (1032).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1032), 58, (415, 3), 1416);
+ Add_Action (Table.States (1032), 68, (414, 0), 1417);
+ Add_Action (Table.States (1032), 76, (415, 6), 1418);
+ Add_Action (Table.States (1032), 77, (415, 0), 1419);
+ Table.States (1032).Kernel := To_Vector ((((414, 0), 78, 3,
(32767, 0), 0), ((414, 1), 78, 2, (32767,
+ 0), 0), ((415, 0), 78, 7, (32767, 0), 0), ((415, 1), 78, 5,
(32767, 0), 0), ((415, 2), 78, 3,
+ (32767, 0), 0), ((415, 3), 78, 7, (32767, 0), 0), ((415, 4),
78, 5, (32767, 0), 0), ((415, 5), 78,
+ 3, (32767, 0), 0), ((415, 6), 78, 6, (32767, 0), 0), ((415,
7), 78, 4, (32767, 0), 0), ((415, 8),
+ 78, 2, (32767, 0), 0)));
+ Table.States (1032).Minimal_Complete_Actions := To_Vector
(((Shift, (414, 0), 68, 1417), (Shift, (415, 6),
+ 76, 1418)));
+ Table.States (1033).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1033), 92, (416, 0), 1420);
+ Table.States (1033).Kernel := To_Vector ((0 => ((416, 0), 85, 2,
(32767, 0), 0)));
+ Table.States (1033).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (416, 0), 92, 1420)));
+ Table.States (1034).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1034), (49, 61, 108), (422, 0), 1);
+ Table.States (1034).Kernel := To_Vector ((0 => ((422, 0), 154,
0, (422, 0), 1)));
+ Table.States (1034).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (422, 0), 1)));
+ Table.States (1035).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1035), (49, 61, 108), (424, 0), 1);
+ Table.States (1035).Kernel := To_Vector ((0 => ((424, 0), 181,
0, (424, 0), 1)));
+ Table.States (1035).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (424, 0), 1)));
+ Table.States (1036).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1036), (49, 61, 108), (423, 0), 1);
+ Table.States (1036).Kernel := To_Vector ((0 => ((423, 0), 183,
0, (423, 0), 1)));
+ Table.States (1036).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (423, 0), 1)));
+ Table.States (1037).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1037), 49, (411, 4), 1421);
+ Add_Action (Table.States (1037), 61, (434, 0), 299);
+ Add_Action (Table.States (1037), 108, (411, 7), 1422);
+ Table.States (1037).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1037), 434, 1423);
+ Table.States (1037).Kernel := To_Vector ((((411, 4), 413, 6,
(32767, 0), 0), ((411, 5), 413, 4,
+ (32767, 0), 0), ((411, 6), 413, 3, (32767, 0), 0), ((411, 7),
413, 1, (32767, 0), 0)));
+ Table.States (1037).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (411, 7), 108, 1422)));
+ Table.States (1038).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1038), (49, 61, 108), (413, 0), 1);
+ Table.States (1038).Kernel := To_Vector ((0 => ((413, 0), 414,
0, (413, 0), 1)));
+ Table.States (1038).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (413, 0), 1)));
+ Table.States (1039).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1039), (49, 61, 108), (413, 1), 1);
+ Table.States (1039).Kernel := To_Vector ((0 => ((413, 1), 415,
0, (413, 1), 1)));
+ Table.States (1039).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (413, 1), 1)));
+ Table.States (1040).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1040), (49, 61, 108), (413, 2), 1);
+ Table.States (1040).Kernel := To_Vector ((0 => ((413, 2), 416,
0, (413, 2), 1)));
+ Table.States (1040).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (413, 2), 1)));
+ Table.States (1041).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1041), (49, 61, 108), (413, 3), 1);
+ Table.States (1041).Kernel := To_Vector ((0 => ((413, 3), 417,
0, (413, 3), 1)));
+ Table.States (1041).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (413, 3), 1)));
+ Table.States (1042).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1042), (49, 61, 108), (413, 4), 1);
+ Table.States (1042).Kernel := To_Vector ((0 => ((413, 4), 418,
0, (413, 4), 1)));
+ Table.States (1042).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (413, 4), 1)));
+ Table.States (1043).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1043), (49, 61, 108), (413, 5), 1);
+ Table.States (1043).Kernel := To_Vector ((0 => ((413, 5), 419,
0, (413, 5), 1)));
+ Table.States (1043).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (413, 5), 1)));
+ Table.States (1044).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1044), (49, 61, 108), (413, 6), 1);
+ Table.States (1044).Kernel := To_Vector ((0 => ((413, 6), 420,
0, (413, 6), 1)));
+ Table.States (1044).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (413, 6), 1)));
+ Table.States (1045).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1045), (49, 61, 108), (413, 7), 1);
+ Table.States (1045).Kernel := To_Vector ((0 => ((413, 7), 421,
0, (413, 7), 1)));
+ Table.States (1045).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (413, 7), 1)));
+ Table.States (1046).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1046), (49, 61, 108), (413, 8), 1);
+ Table.States (1046).Kernel := To_Vector ((0 => ((413, 8), 422,
0, (413, 8), 1)));
+ Table.States (1046).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (413, 8), 1)));
+ Table.States (1047).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1047), (49, 61, 108), (413, 9), 1);
+ Table.States (1047).Kernel := To_Vector ((0 => ((413, 9), 423,
0, (413, 9), 1)));
+ Table.States (1047).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (413, 9), 1)));
+ Table.States (1048).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1048), (49, 61, 108), (413, 10), 1);
+ Table.States (1048).Kernel := To_Vector ((0 => ((413, 10), 424,
0, (413, 10), 1)));
+ Table.States (1048).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (413, 10), 1)));
+ Table.States (1049).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1049), 50, (412, 2), 1424);
+ Table.States (1049).Kernel := To_Vector ((0 => ((412, 2), 49, 3,
(32767, 0), 0)));
+ Table.States (1049).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (412, 2), 50, 1424)));
+ Table.States (1050).Action_List.Set_Capacity (17);
+ Add_Action (Table.States (1050), 27, (414, 5), 1023);
+ Add_Action (Table.States (1050), 52, (187, 0), 347);
+ Add_Action (Table.States (1050), 56, (183, 4), 816);
+ Add_Action (Table.States (1050), 57, (181, 8), 817);
+ Add_Action (Table.States (1050), 58, (181, 6), 1024);
+ Add_Action (Table.States (1050), 59, (181, 4), 819);
+ Add_Action (Table.States (1050), 60, (181, 2), 820);
+ Add_Action (Table.States (1050), 68, (412, 0), 1425);
+ Add_Action (Table.States (1050), 70, (156, 0), 519);
+ Add_Action (Table.States (1050), 71, (420, 0), 1026);
+ Add_Action (Table.States (1050), 72, (419, 0), 1027);
+ Add_Action (Table.States (1050), 73, (418, 0), 1028);
+ Add_Action (Table.States (1050), 74, (417, 0), 1029);
+ Add_Action (Table.States (1050), 76, (415, 15), 1030);
+ Add_Action (Table.States (1050), 77, (181, 0), 1031);
+ Add_Action (Table.States (1050), 78, (414, 0), 1032);
+ Add_Action (Table.States (1050), 85, (416, 0), 1033);
+ Table.States (1050).Goto_List.Set_Capacity (19);
+ Add_Goto (Table.States (1050), 154, 1034);
+ Add_Goto (Table.States (1050), 156, 524);
+ Add_Goto (Table.States (1050), 159, 525);
+ Add_Goto (Table.States (1050), 181, 1035);
+ Add_Goto (Table.States (1050), 183, 1036);
+ Add_Goto (Table.States (1050), 184, 848);
+ Add_Goto (Table.States (1050), 187, 849);
+ Add_Goto (Table.States (1050), 413, 1426);
+ Add_Goto (Table.States (1050), 414, 1038);
+ Add_Goto (Table.States (1050), 415, 1039);
+ Add_Goto (Table.States (1050), 416, 1040);
+ Add_Goto (Table.States (1050), 417, 1041);
+ Add_Goto (Table.States (1050), 418, 1042);
+ Add_Goto (Table.States (1050), 419, 1043);
+ Add_Goto (Table.States (1050), 420, 1044);
+ Add_Goto (Table.States (1050), 421, 1045);
+ Add_Goto (Table.States (1050), 422, 1046);
+ Add_Goto (Table.States (1050), 423, 1047);
+ Add_Goto (Table.States (1050), 424, 1048);
+ Table.States (1050).Kernel := To_Vector ((((411, 0), 82, 7,
(32767, 0), 0), ((411, 1), 82, 5, (32767,
+ 0), 0), ((411, 2), 82, 4, (32767, 0), 0), ((411, 3), 82, 2,
(32767, 0), 0), ((412, 0), 82, 5,
+ (32767, 0), 0), ((412, 1), 82, 2, (32767, 0), 0)));
+ Table.States (1050).Minimal_Complete_Actions := To_Vector
(((Shift, (414, 5), 27, 1023), (Shift, (412, 0),
+ 68, 1425)));
+ Table.States (1051).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1051), (28, 50, 53, 54, 61, 83, 84,
116), (412, 3), 4);
+ Table.States (1051).Kernel := To_Vector ((0 => ((412, 3), 108,
0, (412, 3), 4)));
+ Table.States (1051).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (412, 3), 4)));
+ Table.States (1052).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1052), (52, 56, 86, 90, 116, 117, 118),
(301, 2), 2);
+ Table.States (1052).Kernel := To_Vector ((0 => ((301, 2), 29, 0,
(301, 2), 2)));
+ Table.States (1052).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (301, 2), 2)));
+ Table.States (1053).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1053), 56, (188, 0), 880);
+ Add_Action (Table.States (1053), 86, (252, 0), 33);
+ Add_Action (Table.States (1053), 90, (268, 0), 34);
+ Add_Action (Table.States (1053), 116, (196, 0), 146);
+ Add_Action (Table.States (1053), 117, (196, 1), 37);
+ Add_Action (Table.States (1053), 118, (195, 6), 38);
+ Table.States (1053).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (1053), 195, 1427);
+ Add_Goto (Table.States (1053), 196, 148);
+ Add_Goto (Table.States (1053), 197, 54);
+ Add_Goto (Table.States (1053), 198, 55);
+ Add_Goto (Table.States (1053), 199, 56);
+ Add_Goto (Table.States (1053), 201, 57);
+ Add_Goto (Table.States (1053), 251, 58);
+ Add_Goto (Table.States (1053), 252, 59);
+ Add_Goto (Table.States (1053), 255, 60);
+ Add_Goto (Table.States (1053), 268, 68);
+ Add_Goto (Table.States (1053), 311, 83);
+ Table.States (1053).Kernel := To_Vector ((((188, 0), 187, 3,
(32767, 0), 0), ((188, 1), 187, 2,
+ (32767, 0), 0), ((188, 4), 187, 3, (32767, 0), 0), ((188, 5),
187, 2, (32767, 0), 0), ((188, 8),
+ 187, 5, (32767, 0), 0), ((188, 9), 187, 4, (32767, 0), 0),
((409, 0), 187, 6, (32767, 0), 0),
+ ((409, 1), 187, 4, (32767, 0), 0), ((409, 2), 187, 4, (32767,
0), 0), ((409, 3), 187, 2, (32767,
+ 0), 0)));
+ Table.States (1053).Minimal_Complete_Actions := To_Vector
(((Shift, (188, 0), 56, 880), (Shift, (196, 0),
+ 116, 146)));
+ Table.States (1054).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1054), 61, (434, 0), 299);
+ Add_Action (Table.States (1054), 94, (134, 0), 282);
+ Add_Action (Table.States (1054), 108, (409, 11), 1428);
+ Table.States (1054).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1054), 134, 1429);
+ Add_Goto (Table.States (1054), 434, 1430);
+ Table.States (1054).Kernel := To_Vector ((((409, 8), 188, 5,
(32767, 0), 0), ((409, 9), 188, 3,
+ (32767, 0), 0), ((409, 10), 188, 3, (32767, 0), 0), ((409,
11), 188, 1, (32767, 0), 0)));
+ Table.States (1054).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (409, 11), 108, 1428)));
+ Table.States (1055).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1055), 61, (434, 0), 299);
+ Add_Action (Table.States (1055), 85, (198, 0), 281);
+ Add_Action (Table.States (1055), 94, (134, 0), 282);
+ Add_Action (Table.States (1055), 96, (197, 0), 283);
+ Add_Action (Table.States (1055), 108, (409, 7), 1431);
+ Add_Action (Table.States (1055), 113, (121, 0), 285);
+ Add_Action (Table.States (1055), 114, (121, 1), 286);
+ Table.States (1055).Goto_List.Set_Capacity (4);
+ Add_Goto (Table.States (1055), 121, 287);
+ Add_Goto (Table.States (1055), 134, 1432);
+ Add_Goto (Table.States (1055), 313, 289);
+ Add_Goto (Table.States (1055), 434, 1433);
+ Table.States (1055).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((409, 4), 195, 5, (32767, 0), 0),
+ ((409, 5), 195, 3, (32767, 0), 0), ((409, 6), 195, 3, (32767,
0), 0), ((409, 7), 195, 1, (32767,
+ 0), 0)));
+ Table.States (1055).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (409, 7), 108, 1431)));
+ Table.States (1056).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1056), 61, (434, 0), 299);
+ Add_Action (Table.States (1056), 108, (390, 1), 1434);
+ Table.States (1056).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1056), 434, 1435);
+ Table.States (1056).Kernel := To_Vector ((((390, 0), 13, 3,
(32767, 0), 0), ((390, 1), 13, 1, (32767,
+ 0), 0)));
+ Table.States (1056).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (390, 1), 108, 1434)));
+ Table.States (1057).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1057), 38, (326, 2), 1436);
+ Add_Action (Table.States (1057), 66, (326, 3), 1437);
+ Table.States (1057).Kernel := To_Vector ((((326, 2), 192, 5,
(32767, 0), 0), ((326, 3), 192, 2,
+ (32767, 0), 0)));
+ Table.States (1057).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (326, 3), 66, 1437)));
+ Table.States (1058).Action_List.Set_Capacity (16);
+ Add_Action (Table.States (1058), 22, (339, 0), 9);
+ Add_Action (Table.States (1058), 25, (329, 1), 10);
+ Add_Action (Table.States (1058), 28, (325, 0), 12);
+ Add_Action (Table.States (1058), 38, Reduce, (192, 1), 0);
+ Add_Action (Table.States (1058), 50, (332, 0), 19);
+ Add_Action (Table.States (1058), 51, (437, 0), 221);
+ Add_Action (Table.States (1058), 52, (329, 0), 21);
+ Add_Action (Table.States (1058), 53, (294, 0), 22);
+ Add_Action (Table.States (1058), 54, (293, 0), 23);
+ Add_Action (Table.States (1058), 59, (346, 0), 24);
+ Add_Action (Table.States (1058), 60, (340, 0), 25);
+ Add_Action (Table.States (1058), 66, Reduce, (192, 1), 0);
+ Add_Action (Table.States (1058), 81, (130, 0), 30);
+ Add_Action (Table.States (1058), 83, (128, 0), 31);
+ Add_Action (Table.States (1058), 84, (124, 0), 32);
+ Add_Action (Table.States (1058), 116, (136, 0), 223);
+ Table.States (1058).Goto_List.Set_Capacity (60);
+ Add_Goto (Table.States (1058), 124, 561);
+ Add_Goto (Table.States (1058), 126, 40);
+ Add_Goto (Table.States (1058), 127, 41);
+ Add_Goto (Table.States (1058), 128, 42);
+ Add_Goto (Table.States (1058), 130, 43);
+ Add_Goto (Table.States (1058), 135, 44);
+ Add_Goto (Table.States (1058), 136, 45);
+ Add_Goto (Table.States (1058), 137, 46);
+ Add_Goto (Table.States (1058), 180, 47);
+ Add_Goto (Table.States (1058), 189, 48);
+ Add_Goto (Table.States (1058), 190, 562);
+ Add_Goto (Table.States (1058), 191, 563);
+ Add_Goto (Table.States (1058), 192, 1438);
+ Add_Goto (Table.States (1058), 193, 50);
+ Add_Goto (Table.States (1058), 194, 51);
+ Add_Goto (Table.States (1058), 291, 77);
+ Add_Goto (Table.States (1058), 292, 78);
+ Add_Goto (Table.States (1058), 293, 79);
+ Add_Goto (Table.States (1058), 294, 80);
+ Add_Goto (Table.States (1058), 309, 81);
+ Add_Goto (Table.States (1058), 320, 86);
+ Add_Goto (Table.States (1058), 321, 87);
+ Add_Goto (Table.States (1058), 322, 88);
+ Add_Goto (Table.States (1058), 325, 89);
+ Add_Goto (Table.States (1058), 326, 90);
+ Add_Goto (Table.States (1058), 327, 91);
+ Add_Goto (Table.States (1058), 328, 92);
+ Add_Goto (Table.States (1058), 329, 225);
+ Add_Goto (Table.States (1058), 330, 94);
+ Add_Goto (Table.States (1058), 332, 95);
+ Add_Goto (Table.States (1058), 333, 96);
+ Add_Goto (Table.States (1058), 334, 97);
+ Add_Goto (Table.States (1058), 335, 98);
+ Add_Goto (Table.States (1058), 336, 99);
+ Add_Goto (Table.States (1058), 337, 100);
+ Add_Goto (Table.States (1058), 338, 101);
+ Add_Goto (Table.States (1058), 339, 102);
+ Add_Goto (Table.States (1058), 340, 103);
+ Add_Goto (Table.States (1058), 341, 104);
+ Add_Goto (Table.States (1058), 345, 105);
+ Add_Goto (Table.States (1058), 346, 106);
+ Add_Goto (Table.States (1058), 347, 107);
+ Add_Goto (Table.States (1058), 354, 108);
+ Add_Goto (Table.States (1058), 388, 126);
+ Add_Goto (Table.States (1058), 389, 127);
+ Add_Goto (Table.States (1058), 390, 128);
+ Add_Goto (Table.States (1058), 391, 129);
+ Add_Goto (Table.States (1058), 392, 130);
+ Add_Goto (Table.States (1058), 394, 132);
+ Add_Goto (Table.States (1058), 403, 134);
+ Add_Goto (Table.States (1058), 404, 135);
+ Add_Goto (Table.States (1058), 405, 136);
+ Add_Goto (Table.States (1058), 406, 137);
+ Add_Goto (Table.States (1058), 408, 138);
+ Add_Goto (Table.States (1058), 431, 139);
+ Add_Goto (Table.States (1058), 437, 140);
+ Add_Goto (Table.States (1058), 438, 141);
+ Add_Goto (Table.States (1058), 440, 142);
+ Add_Goto (Table.States (1058), 454, 143);
+ Add_Goto (Table.States (1058), 458, 565);
+ Table.States (1058).Kernel := To_Vector ((((326, 0), 82, 5,
(32767, 0), 0), ((326, 1), 82, 2, (32767,
+ 0), 0)));
+ Table.States (1058).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (192, 1), 0)));
+ end Subr_41;
+ procedure Subr_42
+ is begin
+ Table.States (1059).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1059), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (337, 1), 5);
+ Table.States (1059).Kernel := To_Vector ((0 => ((337, 1), 108,
0, (337, 1), 5)));
+ Table.States (1059).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (337, 1), 5)));
+ Table.States (1060).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1060), 108, (337, 0), 1439);
+ Table.States (1060).Kernel := To_Vector ((0 => ((337, 0), 434,
1, (32767, 0), 0)));
+ Table.States (1060).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (337, 0), 108, 1439)));
+ Table.States (1061).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1061), 86, (252, 0), 33);
+ Add_Action (Table.States (1061), 90, (268, 0), 34);
+ Add_Action (Table.States (1061), 108, Reduce, (308, 1), 0);
+ Add_Action (Table.States (1061), 116, (196, 0), 146);
+ Add_Action (Table.States (1061), 117, (196, 1), 37);
+ Add_Action (Table.States (1061), 118, (195, 6), 38);
+ Table.States (1061).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1061), 195, 1063);
+ Add_Goto (Table.States (1061), 196, 148);
+ Add_Goto (Table.States (1061), 197, 54);
+ Add_Goto (Table.States (1061), 198, 55);
+ Add_Goto (Table.States (1061), 199, 56);
+ Add_Goto (Table.States (1061), 201, 57);
+ Add_Goto (Table.States (1061), 251, 58);
+ Add_Goto (Table.States (1061), 252, 59);
+ Add_Goto (Table.States (1061), 255, 60);
+ Add_Goto (Table.States (1061), 268, 68);
+ Add_Goto (Table.States (1061), 308, 1440);
+ Add_Goto (Table.States (1061), 311, 83);
+ Table.States (1061).Kernel := To_Vector ((0 => ((325, 10), 66,
0, (308, 1), 0)));
+ Table.States (1061).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (308, 1), 0)));
+ Table.States (1062).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (1062), 22, (339, 0), 9);
+ Add_Action (Table.States (1062), 25, (329, 1), 10);
+ Add_Action (Table.States (1062), 28, (325, 0), 720);
+ Add_Action (Table.States (1062), 50, (332, 0), 19);
+ Add_Action (Table.States (1062), 51, (437, 0), 221);
+ Add_Action (Table.States (1062), 52, (329, 0), 21);
+ Add_Action (Table.States (1062), 53, (294, 0), 22);
+ Add_Action (Table.States (1062), 54, (293, 0), 23);
+ Add_Action (Table.States (1062), 59, (346, 0), 721);
+ Add_Action (Table.States (1062), 60, (340, 0), 722);
+ Add_Action (Table.States (1062), 66, (325, 9), 1441);
+ Add_Action (Table.States (1062), 81, (130, 0), 30);
+ Add_Action (Table.States (1062), 83, (128, 0), 31);
+ Add_Action (Table.States (1062), 84, (124, 0), 32);
+ Add_Action (Table.States (1062), 116, (136, 0), 223);
+ Table.States (1062).Goto_List.Set_Capacity (48);
+ Add_Goto (Table.States (1062), 124, 725);
+ Add_Goto (Table.States (1062), 126, 40);
+ Add_Goto (Table.States (1062), 127, 41);
+ Add_Goto (Table.States (1062), 128, 42);
+ Add_Goto (Table.States (1062), 130, 43);
+ Add_Goto (Table.States (1062), 135, 44);
+ Add_Goto (Table.States (1062), 136, 45);
+ Add_Goto (Table.States (1062), 137, 46);
+ Add_Goto (Table.States (1062), 180, 47);
+ Add_Goto (Table.States (1062), 189, 48);
+ Add_Goto (Table.States (1062), 193, 726);
+ Add_Goto (Table.States (1062), 291, 77);
+ Add_Goto (Table.States (1062), 292, 727);
+ Add_Goto (Table.States (1062), 293, 79);
+ Add_Goto (Table.States (1062), 294, 80);
+ Add_Goto (Table.States (1062), 320, 86);
+ Add_Goto (Table.States (1062), 321, 87);
+ Add_Goto (Table.States (1062), 322, 88);
+ Add_Goto (Table.States (1062), 323, 1070);
+ Add_Goto (Table.States (1062), 324, 1071);
+ Add_Goto (Table.States (1062), 325, 89);
+ Add_Goto (Table.States (1062), 327, 91);
+ Add_Goto (Table.States (1062), 328, 92);
+ Add_Goto (Table.States (1062), 329, 730);
+ Add_Goto (Table.States (1062), 330, 94);
+ Add_Goto (Table.States (1062), 332, 95);
+ Add_Goto (Table.States (1062), 333, 96);
+ Add_Goto (Table.States (1062), 334, 97);
+ Add_Goto (Table.States (1062), 335, 98);
+ Add_Goto (Table.States (1062), 336, 99);
+ Add_Goto (Table.States (1062), 337, 100);
+ Add_Goto (Table.States (1062), 338, 101);
+ Add_Goto (Table.States (1062), 339, 102);
+ Add_Goto (Table.States (1062), 340, 103);
+ Add_Goto (Table.States (1062), 341, 104);
+ Add_Goto (Table.States (1062), 346, 106);
+ Add_Goto (Table.States (1062), 347, 107);
+ Add_Goto (Table.States (1062), 394, 132);
+ Add_Goto (Table.States (1062), 403, 134);
+ Add_Goto (Table.States (1062), 404, 135);
+ Add_Goto (Table.States (1062), 405, 136);
+ Add_Goto (Table.States (1062), 406, 137);
+ Add_Goto (Table.States (1062), 408, 138);
+ Add_Goto (Table.States (1062), 431, 139);
+ Add_Goto (Table.States (1062), 437, 140);
+ Add_Goto (Table.States (1062), 438, 141);
+ Add_Goto (Table.States (1062), 440, 142);
+ Add_Goto (Table.States (1062), 454, 143);
+ Table.States (1062).Kernel := To_Vector ((((324, 1), 324, 3,
(32767, 0), 0), ((324, 2), 324, 3,
+ (32767, 0), 0), ((325, 9), 324, 1, (32767, 0), 0)));
+ Table.States (1062).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (325, 9), 66, 1441)));
+ Table.States (1063).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1063), 85, (198, 0), 281);
+ Add_Action (Table.States (1063), 96, (197, 0), 283);
+ Add_Action (Table.States (1063), 108, Reduce, (308, 0), 1);
+ Add_Action (Table.States (1063), 113, (121, 0), 285);
+ Add_Action (Table.States (1063), 114, (121, 1), 286);
+ Table.States (1063).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1063), 121, 287);
+ Add_Goto (Table.States (1063), 313, 289);
+ Table.States (1063).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((308, 0), 195, 0, (308, 0), 1),
((311, 0), 195, 3, (32767, 0), 0)));
+ Table.States (1063).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (308, 0), 1)));
+ Table.States (1064).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1064), (1 => 108), (325, 11), 5);
+ Table.States (1064).Kernel := To_Vector ((0 => ((325, 11), 308,
0, (325, 11), 5)));
+ Table.States (1064).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (325, 11), 5)));
+ Table.States (1065).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1065), 61, (434, 0), 299);
+ Add_Action (Table.States (1065), 85, (198, 0), 281);
+ Add_Action (Table.States (1065), 96, (197, 0), 283);
+ Add_Action (Table.States (1065), 108, (408, 1), 1442);
+ Add_Action (Table.States (1065), 113, (121, 0), 285);
+ Add_Action (Table.States (1065), 114, (121, 1), 286);
+ Table.States (1065).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1065), 121, 287);
+ Add_Goto (Table.States (1065), 313, 289);
+ Add_Goto (Table.States (1065), 434, 1443);
+ Table.States (1065).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((408, 0), 195, 3, (32767, 0), 0),
+ ((408, 1), 195, 1, (32767, 0), 0)));
+ Table.States (1065).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (408, 1), 108, 1442)));
+ Table.States (1066).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1066), 78, (180, 2), 573);
+ Table.States (1066).Kernel := To_Vector ((((180, 2), 82, 4,
(32767, 0), 0), ((180, 3), 82, 2, (32767,
+ 0), 0)));
+ Table.States (1066).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (180, 2), 78, 573)));
+ Table.States (1067).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1067), 108, (291, 2), 576);
+ Table.States (1067).Kernel := To_Vector ((0 => ((291, 2), 434,
1, (32767, 0), 0)));
+ Table.States (1067).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (291, 2), 108, 576)));
+ Table.States (1068).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (1068), 22, (339, 0), 9);
+ Add_Action (Table.States (1068), 25, (329, 1), 10);
+ Add_Action (Table.States (1068), 28, (325, 0), 720);
+ Add_Action (Table.States (1068), 50, (332, 0), 19);
+ Add_Action (Table.States (1068), 51, (437, 0), 221);
+ Add_Action (Table.States (1068), 52, (329, 0), 21);
+ Add_Action (Table.States (1068), 53, (294, 0), 22);
+ Add_Action (Table.States (1068), 54, (293, 0), 23);
+ Add_Action (Table.States (1068), 59, (346, 0), 721);
+ Add_Action (Table.States (1068), 60, (340, 0), 722);
+ Add_Action (Table.States (1068), 66, (325, 7), 1444);
+ Add_Action (Table.States (1068), 81, (130, 0), 30);
+ Add_Action (Table.States (1068), 83, (128, 0), 31);
+ Add_Action (Table.States (1068), 84, (124, 0), 32);
+ Add_Action (Table.States (1068), 116, (136, 0), 223);
+ Table.States (1068).Goto_List.Set_Capacity (48);
+ Add_Goto (Table.States (1068), 124, 725);
+ Add_Goto (Table.States (1068), 126, 40);
+ Add_Goto (Table.States (1068), 127, 41);
+ Add_Goto (Table.States (1068), 128, 42);
+ Add_Goto (Table.States (1068), 130, 43);
+ Add_Goto (Table.States (1068), 135, 44);
+ Add_Goto (Table.States (1068), 136, 45);
+ Add_Goto (Table.States (1068), 137, 46);
+ Add_Goto (Table.States (1068), 180, 47);
+ Add_Goto (Table.States (1068), 189, 48);
+ Add_Goto (Table.States (1068), 193, 726);
+ Add_Goto (Table.States (1068), 291, 77);
+ Add_Goto (Table.States (1068), 292, 727);
+ Add_Goto (Table.States (1068), 293, 79);
+ Add_Goto (Table.States (1068), 294, 80);
+ Add_Goto (Table.States (1068), 320, 86);
+ Add_Goto (Table.States (1068), 321, 87);
+ Add_Goto (Table.States (1068), 322, 88);
+ Add_Goto (Table.States (1068), 323, 728);
+ Add_Goto (Table.States (1068), 324, 1445);
+ Add_Goto (Table.States (1068), 325, 89);
+ Add_Goto (Table.States (1068), 327, 91);
+ Add_Goto (Table.States (1068), 328, 92);
+ Add_Goto (Table.States (1068), 329, 730);
+ Add_Goto (Table.States (1068), 330, 94);
+ Add_Goto (Table.States (1068), 332, 95);
+ Add_Goto (Table.States (1068), 333, 96);
+ Add_Goto (Table.States (1068), 334, 97);
+ Add_Goto (Table.States (1068), 335, 98);
+ Add_Goto (Table.States (1068), 336, 99);
+ Add_Goto (Table.States (1068), 337, 100);
+ Add_Goto (Table.States (1068), 338, 101);
+ Add_Goto (Table.States (1068), 339, 102);
+ Add_Goto (Table.States (1068), 340, 103);
+ Add_Goto (Table.States (1068), 341, 104);
+ Add_Goto (Table.States (1068), 346, 106);
+ Add_Goto (Table.States (1068), 347, 107);
+ Add_Goto (Table.States (1068), 394, 132);
+ Add_Goto (Table.States (1068), 403, 134);
+ Add_Goto (Table.States (1068), 404, 135);
+ Add_Goto (Table.States (1068), 405, 136);
+ Add_Goto (Table.States (1068), 406, 137);
+ Add_Goto (Table.States (1068), 408, 138);
+ Add_Goto (Table.States (1068), 431, 139);
+ Add_Goto (Table.States (1068), 437, 140);
+ Add_Goto (Table.States (1068), 438, 141);
+ Add_Goto (Table.States (1068), 440, 142);
+ Add_Goto (Table.States (1068), 454, 143);
+ Table.States (1068).Kernel := To_Vector ((((325, 6), 27, 4,
(32767, 0), 0), ((325, 7), 27, 1, (32767,
+ 0), 0)));
+ Table.States (1068).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (325, 7), 66, 1444)));
+ Table.States (1069).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1069), 86, (252, 0), 33);
+ Add_Action (Table.States (1069), 90, (268, 0), 34);
+ Add_Action (Table.States (1069), 108, Reduce, (308, 1), 0);
+ Add_Action (Table.States (1069), 116, (196, 0), 146);
+ Add_Action (Table.States (1069), 117, (196, 1), 37);
+ Add_Action (Table.States (1069), 118, (195, 6), 38);
+ Table.States (1069).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1069), 195, 1063);
+ Add_Goto (Table.States (1069), 196, 148);
+ Add_Goto (Table.States (1069), 197, 54);
+ Add_Goto (Table.States (1069), 198, 55);
+ Add_Goto (Table.States (1069), 199, 56);
+ Add_Goto (Table.States (1069), 201, 57);
+ Add_Goto (Table.States (1069), 251, 58);
+ Add_Goto (Table.States (1069), 252, 59);
+ Add_Goto (Table.States (1069), 255, 60);
+ Add_Goto (Table.States (1069), 268, 68);
+ Add_Goto (Table.States (1069), 308, 1446);
+ Add_Goto (Table.States (1069), 311, 83);
+ Table.States (1069).Kernel := To_Vector ((0 => ((325, 8), 66, 0,
(308, 1), 0)));
+ Table.States (1069).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (308, 1), 0)));
+ Table.States (1070).Action_List.Set_Capacity (16);
+ Add_Action (Table.States (1070), (22, 25, 27, 28, 50, 51, 52, 53,
54, 59, 60, 66, 81, 83, 84, 116), (324,
+ 1), 2);
+ Table.States (1070).Kernel := To_Vector ((((324, 0), 323, 0,
(324, 0), 1), ((324, 1), 323, 0, (324,
+ 1), 2)));
+ Table.States (1070).Minimal_Complete_Actions := To_Vector
(((Reduce, (324, 0), 1), (Reduce, (324, 1),
+ 2)));
+ Table.States (1071).Action_List.Set_Capacity (16);
+ Add_Action (Table.States (1071), (22, 25, 27, 28, 50, 51, 52, 53,
54, 59, 60, 66, 81, 83, 84, 116), (324,
+ 2), 2);
+ Table.States (1071).Goto_List.Set_Capacity (48);
+ Add_Goto (Table.States (1071), 124, 725);
+ Add_Goto (Table.States (1071), 126, 40);
+ Add_Goto (Table.States (1071), 127, 41);
+ Add_Goto (Table.States (1071), 128, 42);
+ Add_Goto (Table.States (1071), 130, 43);
+ Add_Goto (Table.States (1071), 135, 44);
+ Add_Goto (Table.States (1071), 136, 45);
+ Add_Goto (Table.States (1071), 137, 46);
+ Add_Goto (Table.States (1071), 180, 47);
+ Add_Goto (Table.States (1071), 189, 48);
+ Add_Goto (Table.States (1071), 193, 726);
+ Add_Goto (Table.States (1071), 291, 77);
+ Add_Goto (Table.States (1071), 292, 727);
+ Add_Goto (Table.States (1071), 293, 79);
+ Add_Goto (Table.States (1071), 294, 80);
+ Add_Goto (Table.States (1071), 320, 86);
+ Add_Goto (Table.States (1071), 321, 87);
+ Add_Goto (Table.States (1071), 322, 88);
+ Add_Goto (Table.States (1071), 323, 1070);
+ Add_Goto (Table.States (1071), 324, 1071);
+ Add_Goto (Table.States (1071), 325, 89);
+ Add_Goto (Table.States (1071), 327, 91);
+ Add_Goto (Table.States (1071), 328, 92);
+ Add_Goto (Table.States (1071), 329, 730);
+ Add_Goto (Table.States (1071), 330, 94);
+ Add_Goto (Table.States (1071), 332, 95);
+ Add_Goto (Table.States (1071), 333, 96);
+ Add_Goto (Table.States (1071), 334, 97);
+ Add_Goto (Table.States (1071), 335, 98);
+ Add_Goto (Table.States (1071), 336, 99);
+ Add_Goto (Table.States (1071), 337, 100);
+ Add_Goto (Table.States (1071), 338, 101);
+ Add_Goto (Table.States (1071), 339, 102);
+ Add_Goto (Table.States (1071), 340, 103);
+ Add_Goto (Table.States (1071), 341, 104);
+ Add_Goto (Table.States (1071), 346, 106);
+ Add_Goto (Table.States (1071), 347, 107);
+ Add_Goto (Table.States (1071), 394, 132);
+ Add_Goto (Table.States (1071), 403, 134);
+ Add_Goto (Table.States (1071), 404, 135);
+ Add_Goto (Table.States (1071), 405, 136);
+ Add_Goto (Table.States (1071), 406, 137);
+ Add_Goto (Table.States (1071), 408, 138);
+ Add_Goto (Table.States (1071), 431, 139);
+ Add_Goto (Table.States (1071), 437, 140);
+ Add_Goto (Table.States (1071), 438, 141);
+ Add_Goto (Table.States (1071), 440, 142);
+ Add_Goto (Table.States (1071), 454, 143);
+ Table.States (1071).Kernel := To_Vector ((((324, 1), 324, 3,
(32767, 0), 0), ((324, 2), 324, 0, (324,
+ 2), 2), ((324, 2), 324, 3, (32767, 0), 0)));
+ Table.States (1071).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (324, 2), 2)));
+ Table.States (1072).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1072), 24, (338, 0), 582);
+ Add_Action (Table.States (1072), 61, (434, 0), 299);
+ Add_Action (Table.States (1072), 82, (180, 0), 1447);
+ Add_Action (Table.States (1072), 108, (291, 1), 584);
+ Table.States (1072).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1072), 434, 1448);
+ Table.States (1072).Kernel := To_Vector ((((180, 0), 292, 5,
(32767, 0), 0), ((180, 1), 292, 3,
+ (32767, 0), 0), ((291, 0), 292, 3, (32767, 0), 0), ((291, 1),
292, 1, (32767, 0), 0), ((338, 0),
+ 292, 5, (32767, 0), 0), ((338, 1), 292, 3, (32767, 0), 0)));
+ Table.States (1072).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (291, 1), 108, 584)));
+ Table.States (1073).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (1073), 22, (339, 0), 9);
+ Add_Action (Table.States (1073), 25, (329, 1), 10);
+ Add_Action (Table.States (1073), 28, (325, 0), 720);
+ Add_Action (Table.States (1073), 50, (332, 0), 19);
+ Add_Action (Table.States (1073), 51, (437, 0), 221);
+ Add_Action (Table.States (1073), 52, (329, 0), 21);
+ Add_Action (Table.States (1073), 53, (294, 0), 22);
+ Add_Action (Table.States (1073), 54, (293, 0), 23);
+ Add_Action (Table.States (1073), 59, (346, 0), 721);
+ Add_Action (Table.States (1073), 60, (340, 0), 722);
+ Add_Action (Table.States (1073), 66, (325, 4), 1449);
+ Add_Action (Table.States (1073), 81, (130, 0), 30);
+ Add_Action (Table.States (1073), 83, (128, 0), 31);
+ Add_Action (Table.States (1073), 84, (124, 0), 32);
+ Add_Action (Table.States (1073), 116, (136, 0), 223);
+ Table.States (1073).Goto_List.Set_Capacity (48);
+ Add_Goto (Table.States (1073), 124, 725);
+ Add_Goto (Table.States (1073), 126, 40);
+ Add_Goto (Table.States (1073), 127, 41);
+ Add_Goto (Table.States (1073), 128, 42);
+ Add_Goto (Table.States (1073), 130, 43);
+ Add_Goto (Table.States (1073), 135, 44);
+ Add_Goto (Table.States (1073), 136, 45);
+ Add_Goto (Table.States (1073), 137, 46);
+ Add_Goto (Table.States (1073), 180, 47);
+ Add_Goto (Table.States (1073), 189, 48);
+ Add_Goto (Table.States (1073), 193, 726);
+ Add_Goto (Table.States (1073), 291, 77);
+ Add_Goto (Table.States (1073), 292, 727);
+ Add_Goto (Table.States (1073), 293, 79);
+ Add_Goto (Table.States (1073), 294, 80);
+ Add_Goto (Table.States (1073), 320, 86);
+ Add_Goto (Table.States (1073), 321, 87);
+ Add_Goto (Table.States (1073), 322, 88);
+ Add_Goto (Table.States (1073), 323, 728);
+ Add_Goto (Table.States (1073), 324, 1450);
+ Add_Goto (Table.States (1073), 325, 89);
+ Add_Goto (Table.States (1073), 327, 91);
+ Add_Goto (Table.States (1073), 328, 92);
+ Add_Goto (Table.States (1073), 329, 730);
+ Add_Goto (Table.States (1073), 330, 94);
+ Add_Goto (Table.States (1073), 332, 95);
+ Add_Goto (Table.States (1073), 333, 96);
+ Add_Goto (Table.States (1073), 334, 97);
+ Add_Goto (Table.States (1073), 335, 98);
+ Add_Goto (Table.States (1073), 336, 99);
+ Add_Goto (Table.States (1073), 337, 100);
+ Add_Goto (Table.States (1073), 338, 101);
+ Add_Goto (Table.States (1073), 339, 102);
+ Add_Goto (Table.States (1073), 340, 103);
+ Add_Goto (Table.States (1073), 341, 104);
+ Add_Goto (Table.States (1073), 346, 106);
+ Add_Goto (Table.States (1073), 347, 107);
+ Add_Goto (Table.States (1073), 394, 132);
+ Add_Goto (Table.States (1073), 403, 134);
+ Add_Goto (Table.States (1073), 404, 135);
+ Add_Goto (Table.States (1073), 405, 136);
+ Add_Goto (Table.States (1073), 406, 137);
+ Add_Goto (Table.States (1073), 408, 138);
+ Add_Goto (Table.States (1073), 431, 139);
+ Add_Goto (Table.States (1073), 437, 140);
+ Add_Goto (Table.States (1073), 438, 141);
+ Add_Goto (Table.States (1073), 440, 142);
+ Add_Goto (Table.States (1073), 454, 143);
+ Table.States (1073).Kernel := To_Vector ((((325, 3), 27, 4,
(32767, 0), 0), ((325, 4), 27, 1, (32767,
+ 0), 0)));
+ Table.States (1073).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (325, 4), 66, 1449)));
+ Table.States (1074).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1074), 86, (252, 0), 33);
+ Add_Action (Table.States (1074), 90, (268, 0), 34);
+ Add_Action (Table.States (1074), 108, Reduce, (308, 1), 0);
+ Add_Action (Table.States (1074), 116, (196, 0), 146);
+ Add_Action (Table.States (1074), 117, (196, 1), 37);
+ Add_Action (Table.States (1074), 118, (195, 6), 38);
+ Table.States (1074).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1074), 195, 1063);
+ Add_Goto (Table.States (1074), 196, 148);
+ Add_Goto (Table.States (1074), 197, 54);
+ Add_Goto (Table.States (1074), 198, 55);
+ Add_Goto (Table.States (1074), 199, 56);
+ Add_Goto (Table.States (1074), 201, 57);
+ Add_Goto (Table.States (1074), 251, 58);
+ Add_Goto (Table.States (1074), 252, 59);
+ Add_Goto (Table.States (1074), 255, 60);
+ Add_Goto (Table.States (1074), 268, 68);
+ Add_Goto (Table.States (1074), 308, 1451);
+ Add_Goto (Table.States (1074), 311, 83);
+ Table.States (1074).Kernel := To_Vector ((0 => ((325, 5), 66, 0,
(308, 1), 0)));
+ Table.States (1074).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (308, 1), 0)));
+ Table.States (1075).Action_List.Set_Capacity (16);
+ Add_Action (Table.States (1075), 22, (339, 0), 9);
+ Add_Action (Table.States (1075), 25, (329, 1), 10);
+ Add_Action (Table.States (1075), 27, (325, 0), 1452);
+ Add_Action (Table.States (1075), 28, (325, 0), 720);
+ Add_Action (Table.States (1075), 50, (332, 0), 19);
+ Add_Action (Table.States (1075), 51, (437, 0), 221);
+ Add_Action (Table.States (1075), 52, (329, 0), 21);
+ Add_Action (Table.States (1075), 53, (294, 0), 22);
+ Add_Action (Table.States (1075), 54, (293, 0), 23);
+ Add_Action (Table.States (1075), 59, (346, 0), 721);
+ Add_Action (Table.States (1075), 60, (340, 0), 722);
+ Add_Action (Table.States (1075), 66, (325, 2), 1453);
+ Add_Action (Table.States (1075), 81, (130, 0), 30);
+ Add_Action (Table.States (1075), 83, (128, 0), 31);
+ Add_Action (Table.States (1075), 84, (124, 0), 32);
+ Add_Action (Table.States (1075), 116, (136, 0), 223);
+ Table.States (1075).Goto_List.Set_Capacity (48);
+ Add_Goto (Table.States (1075), 124, 725);
+ Add_Goto (Table.States (1075), 126, 40);
+ Add_Goto (Table.States (1075), 127, 41);
+ Add_Goto (Table.States (1075), 128, 42);
+ Add_Goto (Table.States (1075), 130, 43);
+ Add_Goto (Table.States (1075), 135, 44);
+ Add_Goto (Table.States (1075), 136, 45);
+ Add_Goto (Table.States (1075), 137, 46);
+ Add_Goto (Table.States (1075), 180, 47);
+ Add_Goto (Table.States (1075), 189, 48);
+ Add_Goto (Table.States (1075), 193, 726);
+ Add_Goto (Table.States (1075), 291, 77);
+ Add_Goto (Table.States (1075), 292, 727);
+ Add_Goto (Table.States (1075), 293, 79);
+ Add_Goto (Table.States (1075), 294, 80);
+ Add_Goto (Table.States (1075), 320, 86);
+ Add_Goto (Table.States (1075), 321, 87);
+ Add_Goto (Table.States (1075), 322, 88);
+ Add_Goto (Table.States (1075), 323, 1070);
+ Add_Goto (Table.States (1075), 324, 1071);
+ Add_Goto (Table.States (1075), 325, 89);
+ Add_Goto (Table.States (1075), 327, 91);
+ Add_Goto (Table.States (1075), 328, 92);
+ Add_Goto (Table.States (1075), 329, 730);
+ Add_Goto (Table.States (1075), 330, 94);
+ Add_Goto (Table.States (1075), 332, 95);
+ Add_Goto (Table.States (1075), 333, 96);
+ Add_Goto (Table.States (1075), 334, 97);
+ Add_Goto (Table.States (1075), 335, 98);
+ Add_Goto (Table.States (1075), 336, 99);
+ Add_Goto (Table.States (1075), 337, 100);
+ Add_Goto (Table.States (1075), 338, 101);
+ Add_Goto (Table.States (1075), 339, 102);
+ Add_Goto (Table.States (1075), 340, 103);
+ Add_Goto (Table.States (1075), 341, 104);
+ Add_Goto (Table.States (1075), 346, 106);
+ Add_Goto (Table.States (1075), 347, 107);
+ Add_Goto (Table.States (1075), 394, 132);
+ Add_Goto (Table.States (1075), 403, 134);
+ Add_Goto (Table.States (1075), 404, 135);
+ Add_Goto (Table.States (1075), 405, 136);
+ Add_Goto (Table.States (1075), 406, 137);
+ Add_Goto (Table.States (1075), 408, 138);
+ Add_Goto (Table.States (1075), 431, 139);
+ Add_Goto (Table.States (1075), 437, 140);
+ Add_Goto (Table.States (1075), 438, 141);
+ Add_Goto (Table.States (1075), 440, 142);
+ Add_Goto (Table.States (1075), 454, 143);
+ Table.States (1075).Kernel := To_Vector ((((324, 1), 324, 3,
(32767, 0), 0), ((324, 2), 324, 3,
+ (32767, 0), 0), ((325, 0), 324, 5, (32767, 0), 0), ((325, 1),
324, 2, (32767, 0), 0), ((325, 2),
+ 324, 1, (32767, 0), 0)));
+ Table.States (1075).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (325, 2), 66, 1453)));
+ end Subr_42;
+ procedure Subr_43
+ is begin
+ Table.States (1076).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1076), 33, Reduce, (317, 5), 4);
+ Add_Action (Table.States (1076), 94, (134, 0), 282);
+ Add_Action (Table.States (1076), 108, Reduce, (317, 5), 4);
+ Table.States (1076).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1076), 134, 1454);
+ Table.States (1076).Kernel := To_Vector ((((317, 4), 319, 2,
(32767, 0), 0), ((317, 5), 319, 0, (317,
+ 5), 4)));
+ Table.States (1076).Minimal_Complete_Actions := To_Vector
(((Shift, (134, 0), 94, 282), (Reduce, (317, 5),
+ 4)));
+ Table.States (1077).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1077), 52, (187, 0), 347);
+ Add_Action (Table.States (1077), 56, (188, 2), 514);
+ Add_Action (Table.States (1077), 86, (252, 0), 33);
+ Add_Action (Table.States (1077), 90, (268, 0), 34);
+ Add_Action (Table.States (1077), 116, (196, 0), 146);
+ Add_Action (Table.States (1077), 117, (196, 1), 37);
+ Add_Action (Table.States (1077), 118, (195, 6), 38);
+ Table.States (1077).Goto_List.Set_Capacity (15);
+ Add_Goto (Table.States (1077), 131, 734);
+ Add_Goto (Table.States (1077), 187, 526);
+ Add_Goto (Table.States (1077), 188, 735);
+ Add_Goto (Table.States (1077), 195, 528);
+ Add_Goto (Table.States (1077), 196, 148);
+ Add_Goto (Table.States (1077), 197, 54);
+ Add_Goto (Table.States (1077), 198, 55);
+ Add_Goto (Table.States (1077), 199, 56);
+ Add_Goto (Table.States (1077), 201, 57);
+ Add_Goto (Table.States (1077), 251, 58);
+ Add_Goto (Table.States (1077), 252, 59);
+ Add_Goto (Table.States (1077), 255, 60);
+ Add_Goto (Table.States (1077), 268, 68);
+ Add_Goto (Table.States (1077), 311, 83);
+ Add_Goto (Table.States (1077), 319, 1455);
+ Table.States (1077).Kernel := To_Vector ((((317, 0), 79, 3,
(32767, 0), 0), ((317, 1), 79, 1, (32767,
+ 0), 0)));
+ Table.States (1077).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1078).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1078), 33, Reduce, (317, 3), 4);
+ Add_Action (Table.States (1078), 94, (134, 0), 282);
+ Add_Action (Table.States (1078), 108, Reduce, (317, 3), 4);
+ Table.States (1078).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1078), 134, 1456);
+ Table.States (1078).Kernel := To_Vector ((((317, 2), 319, 2,
(32767, 0), 0), ((317, 3), 319, 0, (317,
+ 3), 4)));
+ Table.States (1078).Minimal_Complete_Actions := To_Vector
(((Shift, (134, 0), 94, 282), (Reduce, (317, 3),
+ 4)));
+ Table.States (1079).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1079), (33, 108), (317, 6), 4);
+ Table.States (1079).Kernel := To_Vector ((0 => ((317, 6), 134,
0, (317, 6), 4)));
+ Table.States (1079).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (317, 6), 4)));
+ Table.States (1080).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1080), 30, (318, 0), 1457);
+ Table.States (1080).Kernel := To_Vector ((0 => ((318, 0), 66, 2,
(32767, 0), 0)));
+ Table.States (1080).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (318, 0), 30, 1457)));
+ Table.States (1081).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (1081), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (289, 0), 5);
+ Table.States (1081).Kernel := To_Vector ((0 => ((289, 0), 108,
0, (289, 0), 5)));
+ Table.States (1081).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (289, 0), 5)));
+ Table.States (1082).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1082), 62, (400, 1), 1458);
+ Add_Action (Table.States (1082), 86, (252, 0), 33);
+ Add_Action (Table.States (1082), 90, (268, 0), 34);
+ Add_Action (Table.States (1082), 116, (196, 0), 1459);
+ Add_Action (Table.States (1082), 117, (196, 1), 37);
+ Add_Action (Table.States (1082), 118, (195, 6), 38);
+ Table.States (1082).Goto_List.Set_Capacity (14);
+ Add_Goto (Table.States (1082), 195, 1460);
+ Add_Goto (Table.States (1082), 196, 148);
+ Add_Goto (Table.States (1082), 197, 54);
+ Add_Goto (Table.States (1082), 198, 55);
+ Add_Goto (Table.States (1082), 199, 56);
+ Add_Goto (Table.States (1082), 201, 57);
+ Add_Goto (Table.States (1082), 251, 58);
+ Add_Goto (Table.States (1082), 252, 59);
+ Add_Goto (Table.States (1082), 255, 60);
+ Add_Goto (Table.States (1082), 268, 68);
+ Add_Goto (Table.States (1082), 311, 83);
+ Add_Goto (Table.States (1082), 397, 1461);
+ Add_Goto (Table.States (1082), 399, 1462);
+ Add_Goto (Table.States (1082), 400, 1463);
+ Table.States (1082).Kernel := To_Vector ((((398, 0), 63, 6,
(32767, 0), 0), ((398, 1), 63, 4, (32767,
+ 0), 0)));
+ Table.States (1082).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 1459)));
+ Table.States (1083).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1083), (63, 66, 75), (395, 1), 1);
+ Table.States (1083).Kernel := To_Vector ((0 => ((395, 1), 124,
0, (395, 1), 1)));
+ Table.States (1083).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (395, 1), 1)));
+ Table.States (1084).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1084), 63, (398, 0), 1082);
+ Add_Action (Table.States (1084), 66, Reduce, (396, 0), 3);
+ Add_Action (Table.States (1084), 75, Reduce, (396, 0), 3);
+ Table.States (1084).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1084), 398, 1464);
+ Table.States (1084).Kernel := To_Vector ((((395, 2), 395, 5,
(32767, 0), 0), ((396, 0), 395, 0, (396,
+ 0), 3)));
+ Table.States (1084).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (396, 0), 3)));
+ Table.States (1085).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1085), (63, 66, 75), (395, 0), 1);
+ Table.States (1085).Kernel := To_Vector ((0 => ((395, 0), 398,
0, (395, 0), 1)));
+ Table.States (1085).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (395, 0), 1)));
+ Table.States (1086).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1086), 66, (288, 0), 1465);
+ Add_Action (Table.States (1086), 75, (287, 1), 1466);
+ Table.States (1086).Kernel := To_Vector ((((287, 1), 287, 3,
(32767, 0), 0), ((288, 0), 287, 3,
+ (32767, 0), 0)));
+ Table.States (1086).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (288, 0), 66, 1465)));
+ Table.States (1087).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1087), (66, 75), (287, 0), 1);
+ Table.States (1087).Kernel := To_Vector ((0 => ((287, 0), 396,
0, (287, 0), 1)));
+ Table.States (1087).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (287, 0), 1)));
+ Table.States (1088).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1088), (1 => 87), (277, 1), 3);
+ Table.States (1088).Kernel := To_Vector ((0 => ((277, 1), 160,
0, (277, 1), 3)));
+ Table.States (1088).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (277, 1), 3)));
+ Table.States (1089).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1089), 116, (278, 0), 454);
+ Table.States (1089).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1089), 278, 1467);
+ Add_Goto (Table.States (1089), 280, 1468);
+ Table.States (1089).Kernel := To_Vector ((((276, 5), 51, 3,
(32767, 0), 0), ((276, 7), 51, 3, (32767,
+ 0), 0)));
+ Table.States (1089).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (278, 0), 116, 454)));
+ Table.States (1090).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (1090), 12, (401, 0), 1);
+ Add_Action (Table.States (1090), 15, (370, 0), 3);
+ Add_Action (Table.States (1090), 17, (365, 0), 4);
+ Add_Action (Table.States (1090), 18, (382, 0), 5);
+ Add_Action (Table.States (1090), 19, (363, 0), 6);
+ Add_Action (Table.States (1090), 20, (357, 0), 7);
+ Add_Action (Table.States (1090), 30, (316, 0), 13);
+ Add_Action (Table.States (1090), 31, (290, 0), 14);
+ Add_Action (Table.States (1090), 32, (289, 0), 15);
+ Add_Action (Table.States (1090), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1090), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1090), 37, (288, 0), 17);
+ Add_Conflict (Table.States (1090), 37, (285, 1), 0);
+ Add_Action (Table.States (1090), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1090), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1090), 42, (271, 0), 18);
+ Add_Action (Table.States (1090), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1090), 64, (273, 0), 27);
+ Add_Action (Table.States (1090), 65, (264, 0), 28);
+ Add_Action (Table.States (1090), 84, (124, 0), 32);
+ Add_Action (Table.States (1090), 86, (252, 0), 33);
+ Add_Action (Table.States (1090), 90, (268, 0), 34);
+ Add_Action (Table.States (1090), 105, (265, 0), 35);
+ Add_Action (Table.States (1090), 116, (196, 0), 146);
+ Add_Action (Table.States (1090), 117, (196, 1), 37);
+ Add_Action (Table.States (1090), 118, (195, 6), 38);
+ Table.States (1090).Goto_List.Set_Capacity (45);
+ Add_Goto (Table.States (1090), 124, 39);
+ Add_Goto (Table.States (1090), 195, 52);
+ Add_Goto (Table.States (1090), 196, 53);
+ Add_Goto (Table.States (1090), 197, 54);
+ Add_Goto (Table.States (1090), 198, 55);
+ Add_Goto (Table.States (1090), 199, 56);
+ Add_Goto (Table.States (1090), 201, 57);
+ Add_Goto (Table.States (1090), 251, 58);
+ Add_Goto (Table.States (1090), 252, 59);
+ Add_Goto (Table.States (1090), 255, 60);
+ Add_Goto (Table.States (1090), 259, 1469);
+ Add_Goto (Table.States (1090), 261, 331);
+ Add_Goto (Table.States (1090), 262, 62);
+ Add_Goto (Table.States (1090), 263, 63);
+ Add_Goto (Table.States (1090), 264, 64);
+ Add_Goto (Table.States (1090), 265, 65);
+ Add_Goto (Table.States (1090), 266, 66);
+ Add_Goto (Table.States (1090), 267, 67);
+ Add_Goto (Table.States (1090), 268, 68);
+ Add_Goto (Table.States (1090), 271, 69);
+ Add_Goto (Table.States (1090), 273, 70);
+ Add_Goto (Table.States (1090), 275, 71);
+ Add_Goto (Table.States (1090), 285, 72);
+ Add_Goto (Table.States (1090), 286, 73);
+ Add_Goto (Table.States (1090), 288, 74);
+ Add_Goto (Table.States (1090), 289, 75);
+ Add_Goto (Table.States (1090), 290, 76);
+ Add_Goto (Table.States (1090), 310, 82);
+ Add_Goto (Table.States (1090), 311, 83);
+ Add_Goto (Table.States (1090), 316, 84);
+ Add_Goto (Table.States (1090), 318, 85);
+ Add_Goto (Table.States (1090), 357, 110);
+ Add_Goto (Table.States (1090), 363, 111);
+ Add_Goto (Table.States (1090), 364, 112);
+ Add_Goto (Table.States (1090), 365, 113);
+ Add_Goto (Table.States (1090), 366, 114);
+ Add_Goto (Table.States (1090), 367, 115);
+ Add_Goto (Table.States (1090), 370, 116);
+ Add_Goto (Table.States (1090), 376, 117);
+ Add_Goto (Table.States (1090), 378, 118);
+ Add_Goto (Table.States (1090), 379, 119);
+ Add_Goto (Table.States (1090), 382, 120);
+ Add_Goto (Table.States (1090), 401, 133);
+ Add_Goto (Table.States (1090), 461, 332);
+ Add_Goto (Table.States (1090), 462, 144);
+ Table.States (1090).Kernel := To_Vector ((0 => ((271, 2), 41, 5,
(32767, 0), 0)));
+ Table.States (1090).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ Table.States (1091).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (1091), 12, (402, 0), 165);
+ Add_Action (Table.States (1091), 46, (233, 2), 167);
+ Add_Action (Table.States (1091), 52, (233, 3), 168);
+ Add_Action (Table.States (1091), 65, (234, 1), 169);
+ Add_Action (Table.States (1091), 76, (256, 0), 170);
+ Add_Action (Table.States (1091), 85, (205, 4), 171);
+ Add_Action (Table.States (1091), 86, (213, 2), 172);
+ Add_Action (Table.States (1091), 90, (268, 0), 34);
+ Add_Action (Table.States (1091), 106, (237, 1), 173);
+ Add_Action (Table.States (1091), 107, (237, 0), 174);
+ Add_Action (Table.States (1091), 115, (234, 0), 175);
+ Add_Action (Table.States (1091), 116, (196, 0), 146);
+ Add_Action (Table.States (1091), 117, (196, 1), 37);
+ Add_Action (Table.States (1091), 118, (195, 6), 38);
+ Table.States (1091).Goto_List.Set_Capacity (32);
+ Add_Goto (Table.States (1091), 195, 176);
+ Add_Goto (Table.States (1091), 196, 148);
+ Add_Goto (Table.States (1091), 197, 54);
+ Add_Goto (Table.States (1091), 198, 55);
+ Add_Goto (Table.States (1091), 199, 56);
+ Add_Goto (Table.States (1091), 201, 57);
+ Add_Goto (Table.States (1091), 205, 177);
+ Add_Goto (Table.States (1091), 206, 178);
+ Add_Goto (Table.States (1091), 210, 179);
+ Add_Goto (Table.States (1091), 211, 180);
+ Add_Goto (Table.States (1091), 213, 181);
+ Add_Goto (Table.States (1091), 214, 182);
+ Add_Goto (Table.States (1091), 215, 183);
+ Add_Goto (Table.States (1091), 218, 184);
+ Add_Goto (Table.States (1091), 219, 185);
+ Add_Goto (Table.States (1091), 220, 186);
+ Add_Goto (Table.States (1091), 227, 236);
+ Add_Goto (Table.States (1091), 228, 188);
+ Add_Goto (Table.States (1091), 231, 189);
+ Add_Goto (Table.States (1091), 232, 190);
+ Add_Goto (Table.States (1091), 233, 191);
+ Add_Goto (Table.States (1091), 234, 192);
+ Add_Goto (Table.States (1091), 237, 193);
+ Add_Goto (Table.States (1091), 243, 1470);
+ Add_Goto (Table.States (1091), 251, 58);
+ Add_Goto (Table.States (1091), 252, 59);
+ Add_Goto (Table.States (1091), 255, 60);
+ Add_Goto (Table.States (1091), 256, 194);
+ Add_Goto (Table.States (1091), 268, 68);
+ Add_Goto (Table.States (1091), 311, 83);
+ Add_Goto (Table.States (1091), 402, 195);
+ Add_Goto (Table.States (1091), 465, 196);
+ Table.States (1091).Kernel := To_Vector ((0 => ((269, 0), 44, 4,
(32767, 0), 0)));
+ Table.States (1091).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (1092).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1092), 42, (271, 3), 1471);
+ Table.States (1092).Kernel := To_Vector ((0 => ((271, 3), 66, 2,
(32767, 0), 0)));
+ Table.States (1092).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (271, 3), 42, 1471)));
+ Table.States (1093).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1093), (41, 44, 66), (270, 0), 1);
+ Table.States (1093).Kernel := To_Vector ((0 => ((270, 0), 269,
0, (270, 0), 1)));
+ Table.States (1093).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (270, 0), 1)));
+ Table.States (1094).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1094), 41, (271, 0), 1472);
+ Add_Action (Table.States (1094), 44, (269, 0), 1091);
+ Add_Action (Table.States (1094), 66, (271, 1), 1473);
+ Table.States (1094).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1094), 269, 1474);
+ Table.States (1094).Kernel := To_Vector ((((270, 1), 270, 5,
(32767, 0), 0), ((271, 0), 270, 6,
+ (32767, 0), 0), ((271, 1), 270, 3, (32767, 0), 0)));
+ Table.States (1094).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (271, 1), 66, 1473)));
+ Table.States (1095).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1095), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (333, 0), 5);
+ Table.States (1095).Kernel := To_Vector ((0 => ((333, 0), 108,
0, (333, 0), 5)));
+ Table.States (1095).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (333, 0), 5)));
+ Table.States (1096).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1096), 29, (301, 3), 711);
+ Add_Action (Table.States (1096), 47, (301, 0), 712);
+ Add_Action (Table.States (1096), 52, Reduce, (301, 1), 0);
+ Add_Action (Table.States (1096), 86, Reduce, (301, 1), 0);
+ Add_Action (Table.States (1096), 90, Reduce, (301, 1), 0);
+ Add_Action (Table.States (1096), 116, Reduce, (301, 1), 0);
+ Add_Action (Table.States (1096), 117, Reduce, (301, 1), 0);
+ Add_Action (Table.States (1096), 118, Reduce, (301, 1), 0);
+ Table.States (1096).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1096), 301, 1475);
+ Table.States (1096).Kernel := To_Vector ((((300, 0), 80, 5,
(32767, 0), 0), ((300, 1), 80, 3, (32767,
+ 0), 0), ((300, 2), 80, 3, (32767, 0), 0), ((300, 3), 80, 1,
(32767, 0), 0)));
+ Table.States (1096).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (301, 1), 0)));
+ Table.States (1097).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1097), 56, (188, 0), 880);
+ Table.States (1097).Kernel := To_Vector ((((188, 0), 187, 3,
(32767, 0), 0), ((188, 1), 187, 2,
+ (32767, 0), 0), ((188, 4), 187, 3, (32767, 0), 0), ((188, 5),
187, 2, (32767, 0), 0), ((188, 8),
+ 187, 5, (32767, 0), 0), ((188, 9), 187, 4, (32767, 0), 0)));
+ Table.States (1097).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (188, 0), 56, 880)));
+ Table.States (1098).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1098), 87, Reduce, (300, 9), 3);
+ Add_Action (Table.States (1098), 94, (134, 0), 282);
+ Add_Action (Table.States (1098), 108, Reduce, (300, 9), 3);
+ Table.States (1098).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1098), 134, 1476);
+ Table.States (1098).Kernel := To_Vector ((((300, 8), 188, 2,
(32767, 0), 0), ((300, 9), 188, 0, (300,
+ 9), 3)));
+ Table.States (1098).Minimal_Complete_Actions := To_Vector
(((Shift, (134, 0), 94, 282), (Reduce, (300, 9),
+ 3)));
+ Table.States (1099).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1099), 52, (187, 0), 347);
+ Add_Action (Table.States (1099), 86, (252, 0), 33);
+ Add_Action (Table.States (1099), 90, (268, 0), 34);
+ Add_Action (Table.States (1099), 116, (196, 0), 146);
+ Add_Action (Table.States (1099), 117, (196, 1), 37);
+ Add_Action (Table.States (1099), 118, (195, 6), 38);
+ Table.States (1099).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1099), 187, 1477);
+ Add_Goto (Table.States (1099), 195, 1478);
+ Add_Goto (Table.States (1099), 196, 148);
+ Add_Goto (Table.States (1099), 197, 54);
+ Add_Goto (Table.States (1099), 198, 55);
+ Add_Goto (Table.States (1099), 199, 56);
+ Add_Goto (Table.States (1099), 201, 57);
+ Add_Goto (Table.States (1099), 251, 58);
+ Add_Goto (Table.States (1099), 252, 59);
+ Add_Goto (Table.States (1099), 255, 60);
+ Add_Goto (Table.States (1099), 268, 68);
+ Add_Goto (Table.States (1099), 311, 83);
+ Table.States (1099).Kernel := To_Vector ((((300, 4), 301, 5,
(32767, 0), 0), ((300, 5), 301, 3,
+ (32767, 0), 0), ((300, 6), 301, 3, (32767, 0), 0), ((300, 7),
301, 1, (32767, 0), 0)));
+ Table.States (1099).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1100).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1100), (87, 108), (298, 2), 3);
+ Table.States (1100).Kernel := To_Vector ((((298, 1), 298, 4,
(32767, 0), 0), ((298, 2), 298, 0, (298,
+ 2), 3), ((298, 2), 298, 4, (32767, 0), 0)));
+ Table.States (1100).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (298, 2), 3)));
+ Table.States (1101).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1101), (87, 108), (298, 1), 3);
+ Table.States (1101).Kernel := To_Vector ((((298, 0), 300, 0,
(298, 0), 1), ((298, 1), 300, 0, (298,
+ 1), 3)));
+ Table.States (1101).Minimal_Complete_Actions := To_Vector
(((Reduce, (298, 0), 1), (Reduce, (298, 1),
+ 3)));
+ Table.States (1102).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1102), 36, Reduce, (278, 1), 4);
+ Add_Action (Table.States (1102), 50, Reduce, (278, 1), 4);
+ Add_Action (Table.States (1102), 63, (279, 0), 1104);
+ Add_Action (Table.States (1102), 99, Reduce, (278, 1), 4);
+ Table.States (1102).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1102), 279, 1479);
+ Table.States (1102).Kernel := To_Vector ((((278, 0), 160, 2,
(32767, 0), 0), ((278, 1), 160, 0, (278,
+ 1), 4)));
+ Table.States (1102).Minimal_Complete_Actions := To_Vector
(((Shift, (279, 0), 63, 1104), (Reduce, (278,
+ 1), 4)));
+ Table.States (1103).Action_List.Set_Capacity (20);
+ Add_Action (Table.States (1103), 36, Reduce, (131, 3), 1);
+ Add_Conflict (Table.States (1103), 36, (280, 5), 4);
+ Add_Action (Table.States (1103), 45, Reduce, (234, 3), 1);
+ Add_Action (Table.States (1103), 50, Reduce, (131, 3), 1);
+ Add_Conflict (Table.States (1103), 50, (280, 5), 4);
+ Add_Action (Table.States (1103), 63, (279, 0), 1104);
+ Add_Conflict (Table.States (1103), 63, (131, 3), 1);
+ Add_Action (Table.States (1103), 71, (453, 0), 635);
+ Add_Action (Table.States (1103), 72, (153, 0), 636);
+ Add_Action (Table.States (1103), 73, Reduce, (234, 3), 1);
+ Add_Action (Table.States (1103), 74, (139, 0), 637);
+ Add_Action (Table.States (1103), 85, (162, 0), 612);
+ Add_Action (Table.States (1103), 89, Reduce, (234, 3), 1);
+ Add_Action (Table.States (1103), 96, (197, 0), 283);
+ Add_Action (Table.States (1103), 97, Reduce, (234, 3), 1);
+ Add_Action (Table.States (1103), 99, Reduce, (131, 3), 1);
+ Add_Conflict (Table.States (1103), 99, (280, 5), 4);
+ Add_Action (Table.States (1103), 106, Reduce, (234, 3), 1);
+ Add_Action (Table.States (1103), 107, Reduce, (234, 3), 1);
+ Add_Action (Table.States (1103), 109, Reduce, (234, 3), 1);
+ Add_Action (Table.States (1103), 111, Reduce, (234, 3), 1);
+ Add_Action (Table.States (1103), 112, Reduce, (234, 3), 1);
+ Add_Action (Table.States (1103), 113, (121, 0), 285);
+ Add_Action (Table.States (1103), 114, (121, 1), 286);
+ Table.States (1103).Goto_List.Set_Capacity (9);
+ Add_Goto (Table.States (1103), 121, 638);
+ Add_Goto (Table.States (1103), 132, 639);
+ Add_Goto (Table.States (1103), 133, 640);
+ Add_Goto (Table.States (1103), 139, 641);
+ Add_Goto (Table.States (1103), 153, 642);
+ Add_Goto (Table.States (1103), 162, 643);
+ Add_Goto (Table.States (1103), 279, 1480);
+ Add_Goto (Table.States (1103), 313, 289);
+ Add_Goto (Table.States (1103), 453, 644);
+ Table.States (1103).Kernel := To_Vector ((((131, 2), 195, 2,
(32767, 0), 0), ((131, 3), 195, 0, (131,
+ 3), 1), ((197, 0), 195, 2, (32767, 0), 0), ((198, 0), 195,
3, (32767, 0), 0), ((199, 0), 195, 2,
+ (32767, 0), 0), ((201, 0), 195, 2, (32767, 0), 0), ((203, 0),
195, 2, (32767, 0), 0), ((234, 3),
+ 195, 0, (234, 3), 1), ((255, 0), 195, 3, (32767, 0), 0),
((280, 4), 195, 2, (32767, 0), 0), ((280,
+ 5), 195, 0, (280, 5), 4), ((311, 0), 195, 3, (32767, 0),
0)));
+ Table.States (1103).Minimal_Complete_Actions := To_Vector
(((Reduce, (131, 3), 1), (Reduce, (234, 3), 1),
+ (Shift, (279, 0), 63, 1104), (Reduce, (280, 5), 4)));
+ end Subr_43;
+ procedure Subr_44
+ is begin
+ Table.States (1104).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (1104), 12, (402, 0), 165);
+ Add_Action (Table.States (1104), 46, (233, 2), 167);
+ Add_Action (Table.States (1104), 52, (233, 3), 168);
+ Add_Action (Table.States (1104), 65, (234, 1), 169);
+ Add_Action (Table.States (1104), 76, (256, 0), 170);
+ Add_Action (Table.States (1104), 85, (205, 4), 171);
+ Add_Action (Table.States (1104), 86, (213, 2), 172);
+ Add_Action (Table.States (1104), 90, (268, 0), 34);
+ Add_Action (Table.States (1104), 106, (237, 1), 173);
+ Add_Action (Table.States (1104), 107, (237, 0), 174);
+ Add_Action (Table.States (1104), 115, (234, 0), 175);
+ Add_Action (Table.States (1104), 116, (196, 0), 146);
+ Add_Action (Table.States (1104), 117, (196, 1), 37);
+ Add_Action (Table.States (1104), 118, (195, 6), 38);
+ Table.States (1104).Goto_List.Set_Capacity (32);
+ Add_Goto (Table.States (1104), 195, 176);
+ Add_Goto (Table.States (1104), 196, 148);
+ Add_Goto (Table.States (1104), 197, 54);
+ Add_Goto (Table.States (1104), 198, 55);
+ Add_Goto (Table.States (1104), 199, 56);
+ Add_Goto (Table.States (1104), 201, 57);
+ Add_Goto (Table.States (1104), 205, 177);
+ Add_Goto (Table.States (1104), 206, 178);
+ Add_Goto (Table.States (1104), 210, 179);
+ Add_Goto (Table.States (1104), 211, 180);
+ Add_Goto (Table.States (1104), 213, 181);
+ Add_Goto (Table.States (1104), 214, 182);
+ Add_Goto (Table.States (1104), 215, 183);
+ Add_Goto (Table.States (1104), 218, 184);
+ Add_Goto (Table.States (1104), 219, 185);
+ Add_Goto (Table.States (1104), 220, 186);
+ Add_Goto (Table.States (1104), 227, 236);
+ Add_Goto (Table.States (1104), 228, 188);
+ Add_Goto (Table.States (1104), 231, 189);
+ Add_Goto (Table.States (1104), 232, 190);
+ Add_Goto (Table.States (1104), 233, 191);
+ Add_Goto (Table.States (1104), 234, 192);
+ Add_Goto (Table.States (1104), 237, 193);
+ Add_Goto (Table.States (1104), 243, 1481);
+ Add_Goto (Table.States (1104), 251, 58);
+ Add_Goto (Table.States (1104), 252, 59);
+ Add_Goto (Table.States (1104), 255, 60);
+ Add_Goto (Table.States (1104), 256, 194);
+ Add_Goto (Table.States (1104), 268, 68);
+ Add_Goto (Table.States (1104), 311, 83);
+ Add_Goto (Table.States (1104), 402, 195);
+ Add_Goto (Table.States (1104), 465, 196);
+ Table.States (1104).Kernel := To_Vector ((0 => ((279, 0), 63, 1,
(32767, 0), 0)));
+ Table.States (1104).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (1105).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1105), (36, 50, 99), (278, 2), 4);
+ Table.States (1105).Kernel := To_Vector ((0 => ((278, 2), 279,
0, (278, 2), 4)));
+ Table.States (1105).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (278, 2), 4)));
+ Table.States (1106).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1106), (36, 50, 99), (280, 6), 4);
+ Table.States (1106).Kernel := To_Vector ((0 => ((280, 6), 279,
0, (280, 6), 4)));
+ Table.States (1106).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (280, 6), 4)));
+ Table.States (1107).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1107), 36, Reduce, (280, 13), 4);
+ Add_Action (Table.States (1107), 50, Reduce, (280, 13), 4);
+ Add_Action (Table.States (1107), 63, (279, 0), 1104);
+ Add_Action (Table.States (1107), 85, (198, 0), 281);
+ Add_Action (Table.States (1107), 96, (197, 0), 283);
+ Add_Action (Table.States (1107), 99, Reduce, (280, 13), 4);
+ Add_Action (Table.States (1107), 113, (121, 0), 285);
+ Add_Action (Table.States (1107), 114, (121, 1), 286);
+ Table.States (1107).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1107), 121, 287);
+ Add_Goto (Table.States (1107), 279, 1482);
+ Add_Goto (Table.States (1107), 313, 289);
+ Table.States (1107).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((280, 12), 195, 2, (32767, 0), 0),
((280, 13), 195, 0, (280, 13), 4),
+ ((311, 0), 195, 3, (32767, 0), 0)));
+ Table.States (1107).Minimal_Complete_Actions := To_Vector
(((Shift, (279, 0), 63, 1104), (Reduce, (280,
+ 13), 4)));
+ Table.States (1108).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1108), (36, 50, 99), (280, 14), 4);
+ Table.States (1108).Kernel := To_Vector ((0 => ((280, 14), 279,
0, (280, 14), 4)));
+ Table.States (1108).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (280, 14), 4)));
+ Table.States (1109).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1109), 34, (280, 0), 1483);
+ Add_Action (Table.States (1109), 86, (252, 0), 33);
+ Add_Action (Table.States (1109), 90, (268, 0), 34);
+ Add_Action (Table.States (1109), 116, (196, 0), 146);
+ Add_Action (Table.States (1109), 117, (196, 1), 37);
+ Add_Action (Table.States (1109), 118, (195, 6), 38);
+ Table.States (1109).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (1109), 195, 1484);
+ Add_Goto (Table.States (1109), 196, 148);
+ Add_Goto (Table.States (1109), 197, 54);
+ Add_Goto (Table.States (1109), 198, 55);
+ Add_Goto (Table.States (1109), 199, 56);
+ Add_Goto (Table.States (1109), 201, 57);
+ Add_Goto (Table.States (1109), 251, 58);
+ Add_Goto (Table.States (1109), 252, 59);
+ Add_Goto (Table.States (1109), 255, 60);
+ Add_Goto (Table.States (1109), 268, 68);
+ Add_Goto (Table.States (1109), 311, 83);
+ Table.States (1109).Kernel := To_Vector ((((280, 0), 47, 4,
(32767, 0), 0), ((280, 1), 47, 2, (32767,
+ 0), 0), ((280, 2), 47, 3, (32767, 0), 0), ((280, 3), 47, 1,
(32767, 0), 0)));
+ Table.States (1109).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1110).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1110), 34, (280, 8), 1485);
+ Add_Action (Table.States (1110), 86, (252, 0), 33);
+ Add_Action (Table.States (1110), 90, (268, 0), 34);
+ Add_Action (Table.States (1110), 116, (196, 0), 146);
+ Add_Action (Table.States (1110), 117, (196, 1), 37);
+ Add_Action (Table.States (1110), 118, (195, 6), 38);
+ Table.States (1110).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (1110), 195, 1486);
+ Add_Goto (Table.States (1110), 196, 148);
+ Add_Goto (Table.States (1110), 197, 54);
+ Add_Goto (Table.States (1110), 198, 55);
+ Add_Goto (Table.States (1110), 199, 56);
+ Add_Goto (Table.States (1110), 201, 57);
+ Add_Goto (Table.States (1110), 251, 58);
+ Add_Goto (Table.States (1110), 252, 59);
+ Add_Goto (Table.States (1110), 255, 60);
+ Add_Goto (Table.States (1110), 268, 68);
+ Add_Goto (Table.States (1110), 311, 83);
+ Table.States (1110).Kernel := To_Vector ((((280, 8), 69, 4,
(32767, 0), 0), ((280, 9), 69, 2, (32767,
+ 0), 0), ((280, 10), 69, 3, (32767, 0), 0), ((280, 11), 69,
1, (32767, 0), 0)));
+ Table.States (1110).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1111).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1111), 73, (455, 0), 1487);
+ Table.States (1111).Kernel := To_Vector ((0 => ((455, 0), 11, 3,
(32767, 0), 0)));
+ Table.States (1111).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (455, 0), 73, 1487)));
+ Table.States (1112).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1112), 67, (440, 6), 1488);
+ Table.States (1112).Kernel := To_Vector ((((440, 6), 66, 3,
(32767, 0), 0), ((440, 7), 66, 2, (32767,
+ 0), 0)));
+ Table.States (1112).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (440, 6), 67, 1488)));
+ Table.States (1113).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1113), 11, (441, 0), 1489);
+ Add_Action (Table.States (1113), 85, (198, 0), 281);
+ Add_Action (Table.States (1113), 96, (197, 0), 283);
+ Add_Action (Table.States (1113), 113, (121, 0), 285);
+ Add_Action (Table.States (1113), 114, (121, 1), 286);
+ Table.States (1113).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1113), 121, 287);
+ Add_Goto (Table.States (1113), 313, 289);
+ Table.States (1113).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((441, 0), 195, 7, (32767, 0), 0)));
+ Table.States (1114).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1114), (66, 86, 90, 116, 117, 118),
(466, 0), 1);
+ Table.States (1114).Kernel := To_Vector ((0 => ((466, 0), 441,
0, (466, 0), 1)));
+ Table.States (1114).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (466, 0), 1)));
+ Table.States (1115).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1115), 66, (440, 2), 1490);
+ Add_Action (Table.States (1115), 86, (252, 0), 33);
+ Add_Action (Table.States (1115), 90, (268, 0), 34);
+ Add_Action (Table.States (1115), 116, (196, 0), 146);
+ Add_Action (Table.States (1115), 117, (196, 1), 37);
+ Add_Action (Table.States (1115), 118, (195, 6), 38);
+ Table.States (1115).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (1115), 195, 1113);
+ Add_Goto (Table.States (1115), 196, 148);
+ Add_Goto (Table.States (1115), 197, 54);
+ Add_Goto (Table.States (1115), 198, 55);
+ Add_Goto (Table.States (1115), 199, 56);
+ Add_Goto (Table.States (1115), 201, 57);
+ Add_Goto (Table.States (1115), 251, 58);
+ Add_Goto (Table.States (1115), 252, 59);
+ Add_Goto (Table.States (1115), 255, 60);
+ Add_Goto (Table.States (1115), 268, 68);
+ Add_Goto (Table.States (1115), 311, 83);
+ Add_Goto (Table.States (1115), 441, 1114);
+ Add_Goto (Table.States (1115), 466, 1491);
+ Table.States (1115).Kernel := To_Vector ((((440, 0), 455, 12,
(32767, 0), 0), ((440, 1), 455, 11,
+ (32767, 0), 0), ((440, 2), 455, 4, (32767, 0), 0), ((440, 3),
455, 3, (32767, 0), 0)));
+ Table.States (1115).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (440, 2), 66, 1490)));
+ Table.States (1116).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1116), 66, (440, 4), 1492);
+ Add_Action (Table.States (1116), 86, (252, 0), 33);
+ Add_Action (Table.States (1116), 90, (268, 0), 34);
+ Add_Action (Table.States (1116), 116, (196, 0), 146);
+ Add_Action (Table.States (1116), 117, (196, 1), 37);
+ Add_Action (Table.States (1116), 118, (195, 6), 38);
+ Table.States (1116).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (1116), 195, 1113);
+ Add_Goto (Table.States (1116), 196, 148);
+ Add_Goto (Table.States (1116), 197, 54);
+ Add_Goto (Table.States (1116), 198, 55);
+ Add_Goto (Table.States (1116), 199, 56);
+ Add_Goto (Table.States (1116), 201, 57);
+ Add_Goto (Table.States (1116), 251, 58);
+ Add_Goto (Table.States (1116), 252, 59);
+ Add_Goto (Table.States (1116), 255, 60);
+ Add_Goto (Table.States (1116), 268, 68);
+ Add_Goto (Table.States (1116), 311, 83);
+ Add_Goto (Table.States (1116), 441, 1493);
+ Add_Goto (Table.States (1116), 466, 1494);
+ Table.States (1116).Kernel := To_Vector ((((440, 4), 466, 4,
(32767, 0), 0), ((440, 5), 466, 3,
+ (32767, 0), 0), ((466, 1), 466, 8, (32767, 0), 0), ((466, 2),
466, 8, (32767, 0), 0)));
+ Table.States (1116).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (440, 4), 66, 1492)));
+ Table.States (1117).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1117), 87, Reduce, (212, 0), 1);
+ Add_Action (Table.States (1117), 88, Reduce, (212, 0), 1);
+ Add_Action (Table.States (1117), 91, Reduce, (178, 0), 1);
+ Add_Action (Table.States (1117), 95, Reduce, (212, 0), 1);
+ Add_Action (Table.States (1117), 99, Reduce, (178, 0), 1);
+ Table.States (1117).Kernel := To_Vector ((((178, 0), 227, 0,
(178, 0), 1), ((212, 0), 227, 0, (212,
+ 0), 1)));
+ Table.States (1117).Minimal_Complete_Actions := To_Vector
(((Reduce, (178, 0), 1), (Reduce, (212, 0),
+ 1)));
+ Table.States (1118).Action_List.Set_Capacity (44);
+ Add_Action (Table.States (1118), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 63, 64, 65, 66, 77,
81, 83, 84, 86, 90, 105, 116, 117, 118,
+ 119), (438, 0), 5);
+ Table.States (1118).Kernel := To_Vector ((0 => ((438, 0), 108,
0, (438, 0), 5)));
+ Table.States (1118).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (438, 0), 5)));
+ Table.States (1119).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (1119), 12, (402, 0), 165);
+ Add_Action (Table.States (1119), 46, (233, 2), 167);
+ Add_Action (Table.States (1119), 52, (233, 3), 168);
+ Add_Action (Table.States (1119), 65, (234, 1), 169);
+ Add_Action (Table.States (1119), 76, (256, 0), 170);
+ Add_Action (Table.States (1119), 85, (205, 4), 171);
+ Add_Action (Table.States (1119), 86, (213, 2), 172);
+ Add_Action (Table.States (1119), 90, (268, 0), 34);
+ Add_Action (Table.States (1119), 106, (237, 1), 173);
+ Add_Action (Table.States (1119), 107, (237, 0), 174);
+ Add_Action (Table.States (1119), 115, (234, 0), 175);
+ Add_Action (Table.States (1119), 116, (196, 0), 146);
+ Add_Action (Table.States (1119), 117, (196, 1), 37);
+ Add_Action (Table.States (1119), 118, (195, 6), 38);
+ Table.States (1119).Goto_List.Set_Capacity (31);
+ Add_Goto (Table.States (1119), 195, 176);
+ Add_Goto (Table.States (1119), 196, 148);
+ Add_Goto (Table.States (1119), 197, 54);
+ Add_Goto (Table.States (1119), 198, 55);
+ Add_Goto (Table.States (1119), 199, 56);
+ Add_Goto (Table.States (1119), 201, 57);
+ Add_Goto (Table.States (1119), 205, 177);
+ Add_Goto (Table.States (1119), 206, 178);
+ Add_Goto (Table.States (1119), 210, 179);
+ Add_Goto (Table.States (1119), 211, 180);
+ Add_Goto (Table.States (1119), 213, 181);
+ Add_Goto (Table.States (1119), 214, 182);
+ Add_Goto (Table.States (1119), 215, 183);
+ Add_Goto (Table.States (1119), 218, 184);
+ Add_Goto (Table.States (1119), 219, 185);
+ Add_Goto (Table.States (1119), 220, 186);
+ Add_Goto (Table.States (1119), 227, 1495);
+ Add_Goto (Table.States (1119), 228, 188);
+ Add_Goto (Table.States (1119), 231, 189);
+ Add_Goto (Table.States (1119), 232, 190);
+ Add_Goto (Table.States (1119), 233, 191);
+ Add_Goto (Table.States (1119), 234, 192);
+ Add_Goto (Table.States (1119), 237, 193);
+ Add_Goto (Table.States (1119), 251, 58);
+ Add_Goto (Table.States (1119), 252, 59);
+ Add_Goto (Table.States (1119), 255, 60);
+ Add_Goto (Table.States (1119), 256, 194);
+ Add_Goto (Table.States (1119), 268, 68);
+ Add_Goto (Table.States (1119), 311, 83);
+ Add_Goto (Table.States (1119), 402, 195);
+ Add_Goto (Table.States (1119), 465, 196);
+ Table.States (1119).Kernel := To_Vector ((0 => ((437, 0), 50, 2,
(32767, 0), 0)));
+ Table.States (1119).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (1120).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1120), 108, (454, 0), 1496);
+ Table.States (1120).Kernel := To_Vector ((0 => ((454, 0), 227,
1, (32767, 0), 0)));
+ Table.States (1120).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (454, 0), 108, 1496)));
+ Table.States (1121).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1121), (1 => 36), (282, 0), 4);
+ Table.States (1121).Kernel := To_Vector ((0 => ((282, 0), 279,
0, (282, 0), 4)));
+ Table.States (1121).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (282, 0), 4)));
+ Table.States (1122).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (1122), 24, Reduce, (296, 0), 3);
+ Add_Action (Table.States (1122), 33, Reduce, (296, 0), 3);
+ Add_Action (Table.States (1122), 47, Reduce, (296, 0), 3);
+ Add_Action (Table.States (1122), 49, Reduce, (296, 0), 3);
+ Add_Action (Table.States (1122), 61, Reduce, (296, 0), 3);
+ Add_Action (Table.States (1122), 69, Reduce, (296, 0), 3);
+ Add_Action (Table.States (1122), 82, Reduce, (296, 0), 3);
+ Add_Action (Table.States (1122), 85, (198, 0), 281);
+ Add_Action (Table.States (1122), 87, Reduce, (296, 0), 3);
+ Add_Action (Table.States (1122), 94, Reduce, (296, 0), 3);
+ Add_Action (Table.States (1122), 96, (197, 0), 283);
+ Add_Action (Table.States (1122), 108, Reduce, (296, 0), 3);
+ Add_Action (Table.States (1122), 113, (121, 0), 285);
+ Add_Action (Table.States (1122), 114, (121, 1), 286);
+ Table.States (1122).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1122), 121, 287);
+ Add_Goto (Table.States (1122), 313, 289);
+ Table.States (1122).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((296, 0), 195, 0, (296, 0), 3),
((311, 0), 195, 3, (32767, 0), 0)));
+ Table.States (1122).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (296, 0), 3)));
+ Table.States (1123).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1123), 61, (434, 0), 299);
+ Add_Action (Table.States (1123), 85, (198, 0), 281);
+ Add_Action (Table.States (1123), 96, (197, 0), 283);
+ Add_Action (Table.States (1123), 108, (408, 9), 1497);
+ Add_Action (Table.States (1123), 113, (121, 0), 285);
+ Add_Action (Table.States (1123), 114, (121, 1), 286);
+ Table.States (1123).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1123), 121, 287);
+ Add_Goto (Table.States (1123), 313, 289);
+ Add_Goto (Table.States (1123), 434, 1498);
+ Table.States (1123).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((408, 8), 195, 3, (32767, 0), 0),
+ ((408, 9), 195, 1, (32767, 0), 0)));
+ Table.States (1123).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (408, 9), 108, 1497)));
+ Table.States (1124).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1124), 61, (434, 0), 299);
+ Add_Action (Table.States (1124), 85, (198, 0), 281);
+ Add_Action (Table.States (1124), 96, (197, 0), 283);
+ Add_Action (Table.States (1124), 108, (408, 5), 1499);
+ Add_Action (Table.States (1124), 113, (121, 0), 285);
+ Add_Action (Table.States (1124), 114, (121, 1), 286);
+ Table.States (1124).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1124), 121, 287);
+ Add_Goto (Table.States (1124), 313, 289);
+ Add_Goto (Table.States (1124), 434, 1500);
+ Table.States (1124).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((408, 4), 195, 3, (32767, 0), 0),
+ ((408, 5), 195, 1, (32767, 0), 0)));
+ Table.States (1124).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (408, 5), 108, 1499)));
+ Table.States (1125).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1125), 61, (434, 0), 299);
+ Add_Action (Table.States (1125), 108, (392, 1), 1501);
+ Table.States (1125).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1125), 434, 1502);
+ Table.States (1125).Kernel := To_Vector ((((392, 0), 13, 3,
(32767, 0), 0), ((392, 1), 13, 1, (32767,
+ 0), 0)));
+ Table.States (1125).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (392, 1), 108, 1501)));
+ Table.States (1126).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1126), 116, (359, 0), 1503);
+ Table.States (1126).Kernel := To_Vector ((((359, 0), 21, 11,
(32767, 0), 0), ((359, 1), 21, 9, (32767,
+ 0), 0)));
+ Table.States (1126).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (359, 0), 116, 1503)));
+ Table.States (1127).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1127), 108, Reduce, (284, 1), 0);
+ Add_Action (Table.States (1127), 116, (284, 0), 1312);
+ Table.States (1127).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1127), 284, 1504);
+ Table.States (1127).Kernel := To_Vector ((0 => ((354, 3), 66, 1,
(32767, 0), 0)));
+ Table.States (1127).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (284, 1), 0)));
+ Table.States (1128).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1128), (21, 25, 51, 52, 53, 54, 66),
(355, 0), 1);
+ Table.States (1128).Kernel := To_Vector ((0 => ((355, 0), 291,
0, (355, 0), 1)));
+ Table.States (1128).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (355, 0), 1)));
+ Table.States (1129).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1129), 61, (434, 0), 299);
+ Add_Action (Table.States (1129), 82, (309, 3), 1358);
+ Add_Action (Table.States (1129), 108, (291, 3), 301);
+ Table.States (1129).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1129), 434, 302);
+ Table.States (1129).Kernel := To_Vector ((((291, 2), 292, 3,
(32767, 0), 0), ((291, 3), 292, 1,
+ (32767, 0), 0), ((309, 2), 292, 8, (32767, 0), 0), ((309, 3),
292, 6, (32767, 0), 0)));
+ Table.States (1129).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (309, 3), 82, 1358)));
+ Table.States (1130).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1130), (21, 25, 51, 52, 53, 54, 66),
(355, 1), 1);
+ Table.States (1130).Kernel := To_Vector ((0 => ((355, 1), 309,
0, (355, 1), 1)));
+ Table.States (1130).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (355, 1), 1)));
+ Table.States (1131).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1131), (21, 25, 51, 52, 53, 54, 66),
(355, 2), 1);
+ Table.States (1131).Kernel := To_Vector ((0 => ((355, 2), 320,
0, (355, 2), 1)));
+ Table.States (1131).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (355, 2), 1)));
+ Table.States (1132).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1132), (21, 25, 51, 52, 53, 54, 66),
(355, 3), 1);
+ Table.States (1132).Kernel := To_Vector ((0 => ((355, 3), 321,
0, (355, 3), 1)));
+ Table.States (1132).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (355, 3), 1)));
+ Table.States (1133).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1133), 53, (294, 0), 314);
+ Add_Action (Table.States (1133), 54, (293, 0), 315);
+ Table.States (1133).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1133), 292, 1505);
+ Add_Goto (Table.States (1133), 293, 310);
+ Add_Goto (Table.States (1133), 294, 311);
+ Table.States (1133).Kernel := To_Vector ((((291, 0), 329, 5,
(32767, 0), 0), ((291, 1), 329, 3,
+ (32767, 0), 0), ((309, 0), 329, 10, (32767, 0), 0), ((309, 1),
329, 8, (32767, 0), 0), ((320, 0),
+ 329, 7, (32767, 0), 0), ((320, 1), 329, 5, (32767, 0), 0),
((321, 0), 329, 10, (32767, 0), 0),
+ ((321, 1), 329, 8, (32767, 0), 0)));
+ Table.States (1133).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (293, 0), 54, 315)));
+ end Subr_44;
+ procedure Subr_45
+ is begin
+ Table.States (1134).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1134), 21, (359, 0), 1126);
+ Add_Action (Table.States (1134), 25, (329, 1), 10);
+ Add_Action (Table.States (1134), 51, (437, 0), 221);
+ Add_Action (Table.States (1134), 52, (329, 0), 21);
+ Add_Action (Table.States (1134), 53, (294, 0), 314);
+ Add_Action (Table.States (1134), 54, (293, 0), 315);
+ Add_Action (Table.States (1134), 66, (354, 2), 1506);
+ Table.States (1134).Goto_List.Set_Capacity (15);
+ Add_Goto (Table.States (1134), 291, 1128);
+ Add_Goto (Table.States (1134), 292, 1129);
+ Add_Goto (Table.States (1134), 293, 79);
+ Add_Goto (Table.States (1134), 294, 80);
+ Add_Goto (Table.States (1134), 309, 1130);
+ Add_Goto (Table.States (1134), 320, 1131);
+ Add_Goto (Table.States (1134), 321, 1132);
+ Add_Goto (Table.States (1134), 329, 1133);
+ Add_Goto (Table.States (1134), 355, 1507);
+ Add_Goto (Table.States (1134), 359, 1136);
+ Add_Goto (Table.States (1134), 431, 1137);
+ Add_Goto (Table.States (1134), 437, 140);
+ Add_Goto (Table.States (1134), 438, 141);
+ Add_Goto (Table.States (1134), 440, 142);
+ Add_Goto (Table.States (1134), 454, 143);
+ Table.States (1134).Kernel := To_Vector ((((353, 1), 353, 3,
(32767, 0), 0), ((354, 2), 353, 2,
+ (32767, 0), 0)));
+ Table.States (1134).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (354, 2), 66, 1506)));
+ Table.States (1135).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1135), (21, 25, 51, 52, 53, 54, 66),
(353, 0), 1);
+ Table.States (1135).Kernel := To_Vector ((0 => ((353, 0), 355,
0, (353, 0), 1)));
+ Table.States (1135).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (353, 0), 1)));
+ Table.States (1136).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1136), (21, 25, 51, 52, 53, 54, 66),
(355, 4), 1);
+ Table.States (1136).Kernel := To_Vector ((0 => ((355, 4), 359,
0, (355, 4), 1)));
+ Table.States (1136).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (355, 4), 1)));
+ Table.States (1137).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1137), (21, 25, 51, 52, 53, 54, 66),
(355, 5), 1);
+ Table.States (1137).Kernel := To_Vector ((0 => ((355, 5), 431,
0, (355, 5), 1)));
+ Table.States (1137).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (355, 5), 1)));
+ Table.States (1138).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1138), 21, (359, 0), 1126);
+ Add_Action (Table.States (1138), 25, (329, 1), 10);
+ Add_Action (Table.States (1138), 51, (437, 0), 221);
+ Add_Action (Table.States (1138), 52, (329, 0), 21);
+ Add_Action (Table.States (1138), 53, (294, 0), 314);
+ Add_Action (Table.States (1138), 54, (293, 0), 315);
+ Add_Action (Table.States (1138), 66, (354, 1), 1508);
+ Table.States (1138).Goto_List.Set_Capacity (16);
+ Add_Goto (Table.States (1138), 291, 1128);
+ Add_Goto (Table.States (1138), 292, 1129);
+ Add_Goto (Table.States (1138), 293, 79);
+ Add_Goto (Table.States (1138), 294, 80);
+ Add_Goto (Table.States (1138), 309, 1130);
+ Add_Goto (Table.States (1138), 320, 1131);
+ Add_Goto (Table.States (1138), 321, 1132);
+ Add_Goto (Table.States (1138), 329, 1133);
+ Add_Goto (Table.States (1138), 353, 1509);
+ Add_Goto (Table.States (1138), 355, 1135);
+ Add_Goto (Table.States (1138), 359, 1136);
+ Add_Goto (Table.States (1138), 431, 1137);
+ Add_Goto (Table.States (1138), 437, 140);
+ Add_Goto (Table.States (1138), 438, 141);
+ Add_Goto (Table.States (1138), 440, 142);
+ Add_Goto (Table.States (1138), 454, 143);
+ Table.States (1138).Kernel := To_Vector ((((354, 0), 82, 5,
(32767, 0), 0), ((354, 1), 82, 2, (32767,
+ 0), 0)));
+ Table.States (1138).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (354, 1), 66, 1508)));
+ Table.States (1139).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1139), 86, (252, 0), 33);
+ Add_Action (Table.States (1139), 90, (268, 0), 34);
+ Add_Action (Table.States (1139), 116, (196, 0), 146);
+ Add_Action (Table.States (1139), 117, (196, 1), 37);
+ Add_Action (Table.States (1139), 118, (195, 6), 38);
+ Table.States (1139).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1139), 182, 1510);
+ Add_Goto (Table.States (1139), 195, 1152);
+ Add_Goto (Table.States (1139), 196, 148);
+ Add_Goto (Table.States (1139), 197, 54);
+ Add_Goto (Table.States (1139), 198, 55);
+ Add_Goto (Table.States (1139), 199, 56);
+ Add_Goto (Table.States (1139), 201, 57);
+ Add_Goto (Table.States (1139), 251, 58);
+ Add_Goto (Table.States (1139), 252, 59);
+ Add_Goto (Table.States (1139), 255, 60);
+ Add_Goto (Table.States (1139), 268, 68);
+ Add_Goto (Table.States (1139), 311, 83);
+ Table.States (1139).Kernel := To_Vector ((0 => ((346, 6), 76, 4,
(32767, 0), 0)));
+ Table.States (1139).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1140).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1140), 108, (346, 7), 1511);
+ Table.States (1140).Kernel := To_Vector ((0 => ((346, 7), 350,
1, (32767, 0), 0)));
+ Table.States (1140).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (346, 7), 108, 1511)));
+ Table.States (1141).Action_List.Set_Capacity (10);
+ Add_Action (Table.States (1141), 21, (356, 4), 8);
+ Add_Action (Table.States (1141), 25, (329, 1), 10);
+ Add_Action (Table.States (1141), 27, (350, 6), 781);
+ Add_Action (Table.States (1141), 51, (437, 0), 221);
+ Add_Action (Table.States (1141), 52, (329, 0), 21);
+ Add_Action (Table.States (1141), 53, (294, 0), 314);
+ Add_Action (Table.States (1141), 54, (293, 0), 315);
+ Add_Action (Table.States (1141), 66, (350, 10), 782);
+ Add_Action (Table.States (1141), 76, (346, 2), 1512);
+ Add_Action (Table.States (1141), 84, (124, 0), 32);
+ Table.States (1141).Goto_List.Set_Capacity (15);
+ Add_Goto (Table.States (1141), 124, 784);
+ Add_Goto (Table.States (1141), 291, 785);
+ Add_Goto (Table.States (1141), 292, 786);
+ Add_Goto (Table.States (1141), 293, 317);
+ Add_Goto (Table.States (1141), 294, 318);
+ Add_Goto (Table.States (1141), 329, 787);
+ Add_Goto (Table.States (1141), 348, 788);
+ Add_Goto (Table.States (1141), 350, 1513);
+ Add_Goto (Table.States (1141), 351, 790);
+ Add_Goto (Table.States (1141), 356, 791);
+ Add_Goto (Table.States (1141), 431, 792);
+ Add_Goto (Table.States (1141), 437, 140);
+ Add_Goto (Table.States (1141), 438, 141);
+ Add_Goto (Table.States (1141), 440, 142);
+ Add_Goto (Table.States (1141), 454, 143);
+ Table.States (1141).Kernel := To_Vector ((((346, 2), 82, 5,
(32767, 0), 0), ((346, 3), 82, 2, (32767,
+ 0), 0)));
+ Table.States (1141).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (350, 10), 66, 782)));
+ Table.States (1142).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1142), 82, (346, 0), 1514);
+ Table.States (1142).Kernel := To_Vector ((((346, 0), 434, 6,
(32767, 0), 0), ((346, 1), 434, 3,
+ (32767, 0), 0)));
+ Table.States (1142).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (346, 0), 82, 1514)));
+ Table.States (1143).Action_List.Set_Capacity (10);
+ Add_Action (Table.States (1143), 21, (356, 4), 8);
+ Add_Action (Table.States (1143), 25, (329, 1), 10);
+ Add_Action (Table.States (1143), 27, (350, 6), 781);
+ Add_Action (Table.States (1143), 51, (437, 0), 221);
+ Add_Action (Table.States (1143), 52, (329, 0), 21);
+ Add_Action (Table.States (1143), 53, (294, 0), 314);
+ Add_Action (Table.States (1143), 54, (293, 0), 315);
+ Add_Action (Table.States (1143), 66, (350, 10), 782);
+ Add_Action (Table.States (1143), 76, (346, 4), 1515);
+ Add_Action (Table.States (1143), 84, (124, 0), 32);
+ Table.States (1143).Goto_List.Set_Capacity (15);
+ Add_Goto (Table.States (1143), 124, 784);
+ Add_Goto (Table.States (1143), 291, 785);
+ Add_Goto (Table.States (1143), 292, 786);
+ Add_Goto (Table.States (1143), 293, 317);
+ Add_Goto (Table.States (1143), 294, 318);
+ Add_Goto (Table.States (1143), 329, 787);
+ Add_Goto (Table.States (1143), 348, 788);
+ Add_Goto (Table.States (1143), 350, 1516);
+ Add_Goto (Table.States (1143), 351, 790);
+ Add_Goto (Table.States (1143), 356, 791);
+ Add_Goto (Table.States (1143), 431, 792);
+ Add_Goto (Table.States (1143), 437, 140);
+ Add_Goto (Table.States (1143), 438, 141);
+ Add_Goto (Table.States (1143), 440, 142);
+ Add_Goto (Table.States (1143), 454, 143);
+ Table.States (1143).Kernel := To_Vector ((((346, 4), 82, 5,
(32767, 0), 0), ((346, 5), 82, 2, (32767,
+ 0), 0)));
+ Table.States (1143).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (350, 10), 66, 782)));
+ Table.States (1144).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1144), 108, Reduce, (350, 9), 2);
+ Add_Action (Table.States (1144), 116, (350, 8), 1517);
+ Table.States (1144).Kernel := To_Vector ((((350, 8), 66, 1,
(32767, 0), 0), ((350, 9), 66, 0, (350,
+ 9), 2)));
+ Table.States (1144).Minimal_Complete_Actions := To_Vector
(((Shift, (350, 8), 116, 1517), (Reduce, (350,
+ 9), 2)));
+ Table.States (1145).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1145), 93, (173, 0), 1518);
+ Add_Action (Table.States (1145), 95, (136, 1), 280);
+ Table.States (1145).Kernel := To_Vector ((((136, 1), 136, 2,
(32767, 0), 0), ((173, 0), 136, 7,
+ (32767, 0), 0), ((173, 1), 136, 5, (32767, 0), 0), ((173, 2),
136, 5, (32767, 0), 0), ((173, 3),
+ 136, 3, (32767, 0), 0)));
+ Table.States (1145).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (173, 0), 93, 1518)));
+ Table.States (1146).Action_List.Set_Capacity (9);
+ Add_Action (Table.States (1146), (21, 25, 51, 52, 53, 54, 66, 84,
116), (352, 1), 1);
+ Table.States (1146).Kernel := To_Vector ((0 => ((352, 1), 173,
0, (352, 1), 1)));
+ Table.States (1146).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (352, 1), 1)));
+ Table.States (1147).Action_List.Set_Capacity (9);
+ Add_Action (Table.States (1147), 21, (356, 4), 8);
+ Add_Action (Table.States (1147), 25, (329, 1), 10);
+ Add_Action (Table.States (1147), 51, (437, 0), 221);
+ Add_Action (Table.States (1147), 52, (329, 0), 21);
+ Add_Action (Table.States (1147), 53, (294, 0), 314);
+ Add_Action (Table.States (1147), 54, (293, 0), 315);
+ Add_Action (Table.States (1147), 66, (350, 6), 1519);
+ Add_Action (Table.States (1147), 84, (124, 0), 32);
+ Add_Action (Table.States (1147), 116, (136, 0), 207);
+ Table.States (1147).Goto_List.Set_Capacity (16);
+ Add_Goto (Table.States (1147), 124, 784);
+ Add_Goto (Table.States (1147), 136, 1145);
+ Add_Goto (Table.States (1147), 173, 1146);
+ Add_Goto (Table.States (1147), 291, 785);
+ Add_Goto (Table.States (1147), 292, 786);
+ Add_Goto (Table.States (1147), 293, 317);
+ Add_Goto (Table.States (1147), 294, 318);
+ Add_Goto (Table.States (1147), 329, 787);
+ Add_Goto (Table.States (1147), 351, 1148);
+ Add_Goto (Table.States (1147), 352, 1520);
+ Add_Goto (Table.States (1147), 356, 791);
+ Add_Goto (Table.States (1147), 431, 792);
+ Add_Goto (Table.States (1147), 437, 140);
+ Add_Goto (Table.States (1147), 438, 141);
+ Add_Goto (Table.States (1147), 440, 142);
+ Add_Goto (Table.States (1147), 454, 143);
+ Table.States (1147).Kernel := To_Vector ((((349, 1), 349, 3,
(32767, 0), 0), ((350, 6), 349, 2,
+ (32767, 0), 0), ((350, 7), 349, 1, (32767, 0), 0)));
+ Table.States (1147).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (350, 6), 66, 1519)));
+ Table.States (1148).Action_List.Set_Capacity (9);
+ Add_Action (Table.States (1148), (21, 25, 51, 52, 53, 54, 66, 84,
116), (352, 0), 1);
+ Table.States (1148).Kernel := To_Vector ((0 => ((352, 0), 351,
0, (352, 0), 1)));
+ Table.States (1148).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (352, 0), 1)));
+ Table.States (1149).Action_List.Set_Capacity (9);
+ Add_Action (Table.States (1149), (21, 25, 51, 52, 53, 54, 66, 84,
116), (349, 0), 1);
+ Table.States (1149).Kernel := To_Vector ((0 => ((349, 0), 352,
0, (349, 0), 1)));
+ Table.States (1149).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (349, 0), 1)));
+ Table.States (1150).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1150), (1 => 108), (350, 10), 2);
+ Table.States (1150).Kernel := To_Vector ((0 => ((350, 10), 116,
0, (350, 10), 2)));
+ Table.States (1150).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (350, 10), 2)));
+ Table.States (1151).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1151), 61, (347, 2), 1521);
+ Add_Action (Table.States (1151), 75, (182, 1), 1522);
+ Table.States (1151).Kernel := To_Vector ((((182, 1), 182, 2,
(32767, 0), 0), ((347, 2), 182, 3,
+ (32767, 0), 0)));
+ Table.States (1151).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (347, 2), 61, 1521)));
+ Table.States (1152).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1152), 49, Reduce, (182, 0), 1);
+ Add_Action (Table.States (1152), 61, Reduce, (182, 0), 1);
+ Add_Action (Table.States (1152), 75, Reduce, (182, 0), 1);
+ Add_Action (Table.States (1152), 85, (198, 0), 281);
+ Add_Action (Table.States (1152), 96, (197, 0), 283);
+ Add_Action (Table.States (1152), 108, Reduce, (182, 0), 1);
+ Add_Action (Table.States (1152), 113, (121, 0), 285);
+ Add_Action (Table.States (1152), 114, (121, 1), 286);
+ Table.States (1152).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1152), 121, 287);
+ Add_Goto (Table.States (1152), 313, 289);
+ Table.States (1152).Kernel := To_Vector ((((182, 0), 195, 0,
(182, 0), 1), ((197, 0), 195, 2, (32767,
+ 0), 0), ((198, 0), 195, 3, (32767, 0), 0), ((199, 0), 195,
2, (32767, 0), 0), ((201, 0), 195, 2,
+ (32767, 0), 0), ((255, 0), 195, 3, (32767, 0), 0), ((311, 0),
195, 3, (32767, 0), 0)));
+ Table.States (1152).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (182, 0), 1)));
+ Table.States (1153).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1153), 61, (434, 0), 299);
+ Add_Action (Table.States (1153), 108, (291, 1), 584);
+ Table.States (1153).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1153), 434, 1448);
+ Table.States (1153).Kernel := To_Vector ((((291, 0), 292, 3,
(32767, 0), 0), ((291, 1), 292, 1,
+ (32767, 0), 0)));
+ Table.States (1153).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (291, 1), 108, 584)));
+ Table.States (1154).Action_List.Set_Capacity (9);
+ Add_Action (Table.States (1154), 21, (356, 4), 8);
+ Add_Action (Table.States (1154), 25, (329, 1), 10);
+ Add_Action (Table.States (1154), 51, (437, 0), 221);
+ Add_Action (Table.States (1154), 52, (329, 0), 21);
+ Add_Action (Table.States (1154), 53, (294, 0), 314);
+ Add_Action (Table.States (1154), 54, (293, 0), 315);
+ Add_Action (Table.States (1154), 66, (350, 2), 1523);
+ Add_Action (Table.States (1154), 84, (124, 0), 32);
+ Add_Action (Table.States (1154), 116, (136, 0), 207);
+ Table.States (1154).Goto_List.Set_Capacity (17);
+ Add_Goto (Table.States (1154), 124, 784);
+ Add_Goto (Table.States (1154), 136, 1145);
+ Add_Goto (Table.States (1154), 173, 1146);
+ Add_Goto (Table.States (1154), 291, 785);
+ Add_Goto (Table.States (1154), 292, 786);
+ Add_Goto (Table.States (1154), 293, 317);
+ Add_Goto (Table.States (1154), 294, 318);
+ Add_Goto (Table.States (1154), 329, 787);
+ Add_Goto (Table.States (1154), 349, 1524);
+ Add_Goto (Table.States (1154), 351, 1148);
+ Add_Goto (Table.States (1154), 352, 1149);
+ Add_Goto (Table.States (1154), 356, 791);
+ Add_Goto (Table.States (1154), 431, 792);
+ Add_Goto (Table.States (1154), 437, 140);
+ Add_Goto (Table.States (1154), 438, 141);
+ Add_Goto (Table.States (1154), 440, 142);
+ Add_Goto (Table.States (1154), 454, 143);
+ Table.States (1154).Kernel := To_Vector ((((350, 0), 27, 5,
(32767, 0), 0), ((350, 1), 27, 4, (32767,
+ 0), 0), ((350, 2), 27, 2, (32767, 0), 0), ((350, 3), 27, 1,
(32767, 0), 0)));
+ Table.States (1155).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1155), 108, Reduce, (350, 5), 2);
+ Add_Action (Table.States (1155), 116, (350, 4), 1525);
+ Table.States (1155).Kernel := To_Vector ((((350, 4), 66, 1,
(32767, 0), 0), ((350, 5), 66, 0, (350,
+ 5), 2)));
+ Table.States (1155).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (350, 5), 2)));
+ Table.States (1156).Action_List.Set_Capacity (9);
+ Add_Action (Table.States (1156), (21, 25, 27, 51, 52, 53, 54, 66,
84), (348, 1), 2);
+ Table.States (1156).Kernel := To_Vector ((0 => ((348, 1), 351,
0, (348, 1), 2)));
+ Table.States (1156).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (348, 1), 2)));
+ Table.States (1157).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1157), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (347, 3), 5);
+ Table.States (1157).Kernel := To_Vector ((0 => ((347, 3), 108,
0, (347, 3), 5)));
+ Table.States (1157).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (347, 3), 5)));
+ Table.States (1158).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1158), 86, (252, 0), 33);
+ Add_Action (Table.States (1158), 90, (268, 0), 34);
+ Add_Action (Table.States (1158), 116, (196, 0), 146);
+ Add_Action (Table.States (1158), 117, (196, 1), 37);
+ Add_Action (Table.States (1158), 118, (195, 6), 38);
+ Table.States (1158).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1158), 182, 1526);
+ Add_Goto (Table.States (1158), 195, 1152);
+ Add_Goto (Table.States (1158), 196, 148);
+ Add_Goto (Table.States (1158), 197, 54);
+ Add_Goto (Table.States (1158), 198, 55);
+ Add_Goto (Table.States (1158), 199, 56);
+ Add_Goto (Table.States (1158), 201, 57);
+ Add_Goto (Table.States (1158), 251, 58);
+ Add_Goto (Table.States (1158), 252, 59);
+ Add_Goto (Table.States (1158), 255, 60);
+ Add_Goto (Table.States (1158), 268, 68);
+ Add_Goto (Table.States (1158), 311, 83);
+ Table.States (1158).Kernel := To_Vector ((0 => ((347, 0), 76, 4,
(32767, 0), 0)));
+ Table.States (1158).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1159).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1159), 108, (347, 1), 1527);
+ Table.States (1159).Kernel := To_Vector ((0 => ((347, 1), 350,
1, (32767, 0), 0)));
+ Table.States (1159).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (347, 1), 108, 1527)));
+ Table.States (1160).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1160), 61, (434, 0), 299);
+ Add_Action (Table.States (1160), 108, (391, 1), 1528);
+ Table.States (1160).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1160), 434, 1529);
+ Table.States (1160).Kernel := To_Vector ((((391, 0), 13, 3,
(32767, 0), 0), ((391, 1), 13, 1, (32767,
+ 0), 0)));
+ Table.States (1160).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (391, 1), 108, 1528)));
+ Table.States (1161).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1161), 38, (345, 1), 1530);
+ Table.States (1161).Kernel := To_Vector ((0 => ((345, 1), 192,
5, (32767, 0), 0)));
+ Table.States (1161).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (345, 1), 38, 1530)));
+ Table.States (1162).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (1162), 22, (339, 0), 9);
+ Add_Action (Table.States (1162), 25, (329, 1), 10);
+ Add_Action (Table.States (1162), 28, (325, 0), 12);
+ Add_Action (Table.States (1162), 38, Reduce, (192, 1), 0);
+ Add_Action (Table.States (1162), 50, (332, 0), 19);
+ Add_Action (Table.States (1162), 51, (437, 0), 221);
+ Add_Action (Table.States (1162), 52, (329, 0), 21);
+ Add_Action (Table.States (1162), 53, (294, 0), 22);
+ Add_Action (Table.States (1162), 54, (293, 0), 23);
+ Add_Action (Table.States (1162), 59, (346, 0), 24);
+ Add_Action (Table.States (1162), 60, (340, 0), 25);
+ Add_Action (Table.States (1162), 81, (130, 0), 30);
+ Add_Action (Table.States (1162), 83, (128, 0), 31);
+ Add_Action (Table.States (1162), 84, (124, 0), 32);
+ Add_Action (Table.States (1162), 116, (136, 0), 223);
+ Table.States (1162).Goto_List.Set_Capacity (60);
+ Add_Goto (Table.States (1162), 124, 561);
+ Add_Goto (Table.States (1162), 126, 40);
+ Add_Goto (Table.States (1162), 127, 41);
+ Add_Goto (Table.States (1162), 128, 42);
+ Add_Goto (Table.States (1162), 130, 43);
+ Add_Goto (Table.States (1162), 135, 44);
+ Add_Goto (Table.States (1162), 136, 45);
+ Add_Goto (Table.States (1162), 137, 46);
+ Add_Goto (Table.States (1162), 180, 47);
+ Add_Goto (Table.States (1162), 189, 48);
+ Add_Goto (Table.States (1162), 190, 562);
+ Add_Goto (Table.States (1162), 191, 563);
+ Add_Goto (Table.States (1162), 192, 1531);
+ Add_Goto (Table.States (1162), 193, 50);
+ Add_Goto (Table.States (1162), 194, 51);
+ Add_Goto (Table.States (1162), 291, 77);
+ Add_Goto (Table.States (1162), 292, 78);
+ Add_Goto (Table.States (1162), 293, 79);
+ Add_Goto (Table.States (1162), 294, 80);
+ Add_Goto (Table.States (1162), 309, 81);
+ Add_Goto (Table.States (1162), 320, 86);
+ Add_Goto (Table.States (1162), 321, 87);
+ Add_Goto (Table.States (1162), 322, 88);
+ Add_Goto (Table.States (1162), 325, 89);
+ Add_Goto (Table.States (1162), 326, 90);
+ Add_Goto (Table.States (1162), 327, 91);
+ Add_Goto (Table.States (1162), 328, 92);
+ Add_Goto (Table.States (1162), 329, 225);
+ Add_Goto (Table.States (1162), 330, 94);
+ Add_Goto (Table.States (1162), 332, 95);
+ Add_Goto (Table.States (1162), 333, 96);
+ Add_Goto (Table.States (1162), 334, 97);
+ Add_Goto (Table.States (1162), 335, 98);
+ Add_Goto (Table.States (1162), 336, 99);
+ Add_Goto (Table.States (1162), 337, 100);
+ Add_Goto (Table.States (1162), 338, 101);
+ Add_Goto (Table.States (1162), 339, 102);
+ Add_Goto (Table.States (1162), 340, 103);
+ Add_Goto (Table.States (1162), 341, 104);
+ Add_Goto (Table.States (1162), 345, 105);
+ Add_Goto (Table.States (1162), 346, 106);
+ Add_Goto (Table.States (1162), 347, 107);
+ Add_Goto (Table.States (1162), 354, 108);
+ Add_Goto (Table.States (1162), 388, 126);
+ Add_Goto (Table.States (1162), 389, 127);
+ Add_Goto (Table.States (1162), 390, 128);
+ Add_Goto (Table.States (1162), 391, 129);
+ Add_Goto (Table.States (1162), 392, 130);
+ Add_Goto (Table.States (1162), 394, 132);
+ Add_Goto (Table.States (1162), 403, 134);
+ Add_Goto (Table.States (1162), 404, 135);
+ Add_Goto (Table.States (1162), 405, 136);
+ Add_Goto (Table.States (1162), 406, 137);
+ Add_Goto (Table.States (1162), 408, 138);
+ Add_Goto (Table.States (1162), 431, 139);
+ Add_Goto (Table.States (1162), 437, 140);
+ Add_Goto (Table.States (1162), 438, 141);
+ Add_Goto (Table.States (1162), 440, 142);
+ Add_Goto (Table.States (1162), 454, 143);
+ Add_Goto (Table.States (1162), 458, 565);
+ Table.States (1162).Kernel := To_Vector ((0 => ((345, 0), 82, 5,
(32767, 0), 0)));
+ Table.States (1162).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (192, 1), 0)));
+ end Subr_45;
+ procedure Subr_46
+ is begin
+ Table.States (1163).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1163), 86, (252, 0), 33);
+ Add_Action (Table.States (1163), 90, (268, 0), 34);
+ Add_Action (Table.States (1163), 116, (196, 0), 146);
+ Add_Action (Table.States (1163), 117, (196, 1), 37);
+ Add_Action (Table.States (1163), 118, (195, 6), 38);
+ Table.States (1163).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1163), 182, 1532);
+ Add_Goto (Table.States (1163), 195, 1152);
+ Add_Goto (Table.States (1163), 196, 148);
+ Add_Goto (Table.States (1163), 197, 54);
+ Add_Goto (Table.States (1163), 198, 55);
+ Add_Goto (Table.States (1163), 199, 56);
+ Add_Goto (Table.States (1163), 201, 57);
+ Add_Goto (Table.States (1163), 251, 58);
+ Add_Goto (Table.States (1163), 252, 59);
+ Add_Goto (Table.States (1163), 255, 60);
+ Add_Goto (Table.States (1163), 268, 68);
+ Add_Goto (Table.States (1163), 311, 83);
+ Table.States (1163).Kernel := To_Vector ((0 => ((340, 9), 76, 7,
(32767, 0), 0)));
+ Table.States (1163).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1164).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1164), 108, (340, 10), 1533);
+ Table.States (1164).Kernel := To_Vector ((0 => ((340, 10), 343,
1, (32767, 0), 0)));
+ Table.States (1164).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (340, 10), 108, 1533)));
+ Table.States (1165).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1165), 21, (356, 4), 8);
+ Add_Action (Table.States (1165), 25, (329, 1), 10);
+ Add_Action (Table.States (1165), 51, (437, 0), 221);
+ Add_Action (Table.States (1165), 52, (329, 0), 21);
+ Add_Action (Table.States (1165), 76, (340, 3), 1534);
+ Table.States (1165).Goto_List.Set_Capacity (10);
+ Add_Goto (Table.States (1165), 329, 801);
+ Add_Goto (Table.States (1165), 342, 802);
+ Add_Goto (Table.States (1165), 343, 1535);
+ Add_Goto (Table.States (1165), 344, 804);
+ Add_Goto (Table.States (1165), 356, 805);
+ Add_Goto (Table.States (1165), 431, 806);
+ Add_Goto (Table.States (1165), 437, 140);
+ Add_Goto (Table.States (1165), 438, 141);
+ Add_Goto (Table.States (1165), 440, 142);
+ Add_Goto (Table.States (1165), 454, 143);
+ Table.States (1165).Kernel := To_Vector ((((340, 3), 82, 8,
(32767, 0), 0), ((340, 4), 82, 5, (32767,
+ 0), 0)));
+ Table.States (1165).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (356, 4), 21, 8)));
+ Table.States (1166).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1166), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (340, 5), 5);
+ Table.States (1166).Kernel := To_Vector ((0 => ((340, 5), 108,
0, (340, 5), 5)));
+ Table.States (1166).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (340, 5), 5)));
+ Table.States (1167).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1167), 82, (340, 0), 1536);
+ Add_Action (Table.States (1167), 108, (340, 2), 1537);
+ Table.States (1167).Kernel := To_Vector ((((340, 0), 434, 9,
(32767, 0), 0), ((340, 1), 434, 6,
+ (32767, 0), 0), ((340, 2), 434, 1, (32767, 0), 0)));
+ Table.States (1167).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (340, 2), 108, 1537)));
+ Table.States (1168).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1168), 21, (356, 4), 8);
+ Add_Action (Table.States (1168), 25, (329, 1), 10);
+ Add_Action (Table.States (1168), 51, (437, 0), 221);
+ Add_Action (Table.States (1168), 52, (329, 0), 21);
+ Add_Action (Table.States (1168), 76, (340, 6), 1538);
+ Table.States (1168).Goto_List.Set_Capacity (10);
+ Add_Goto (Table.States (1168), 329, 801);
+ Add_Goto (Table.States (1168), 342, 802);
+ Add_Goto (Table.States (1168), 343, 1539);
+ Add_Goto (Table.States (1168), 344, 804);
+ Add_Goto (Table.States (1168), 356, 805);
+ Add_Goto (Table.States (1168), 431, 806);
+ Add_Goto (Table.States (1168), 437, 140);
+ Add_Goto (Table.States (1168), 438, 141);
+ Add_Goto (Table.States (1168), 440, 142);
+ Add_Goto (Table.States (1168), 454, 143);
+ Table.States (1168).Kernel := To_Vector ((((340, 6), 82, 8,
(32767, 0), 0), ((340, 7), 82, 5, (32767,
+ 0), 0)));
+ Table.States (1168).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (356, 4), 21, 8)));
+ Table.States (1169).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1169), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (340, 8), 5);
+ Table.States (1169).Kernel := To_Vector ((0 => ((340, 8), 108,
0, (340, 8), 5)));
+ Table.States (1169).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (340, 8), 5)));
+ Table.States (1170).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1170), 61, (341, 3), 1540);
+ Add_Action (Table.States (1170), 75, (182, 1), 1522);
+ Table.States (1170).Kernel := To_Vector ((((182, 1), 182, 2,
(32767, 0), 0), ((341, 3), 182, 6,
+ (32767, 0), 0)));
+ Table.States (1170).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (341, 3), 61, 1540)));
+ Table.States (1171).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1171), 21, (356, 4), 8);
+ Add_Action (Table.States (1171), 25, (329, 1), 10);
+ Add_Action (Table.States (1171), 51, (437, 0), 221);
+ Add_Action (Table.States (1171), 52, (329, 0), 21);
+ Table.States (1171).Goto_List.Set_Capacity (9);
+ Add_Goto (Table.States (1171), 329, 801);
+ Add_Goto (Table.States (1171), 342, 1541);
+ Add_Goto (Table.States (1171), 344, 804);
+ Add_Goto (Table.States (1171), 356, 805);
+ Add_Goto (Table.States (1171), 431, 806);
+ Add_Goto (Table.States (1171), 437, 140);
+ Add_Goto (Table.States (1171), 438, 141);
+ Add_Goto (Table.States (1171), 440, 142);
+ Add_Goto (Table.States (1171), 454, 143);
+ Table.States (1171).Kernel := To_Vector ((0 => ((343, 0), 27, 4,
(32767, 0), 0)));
+ Table.States (1171).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (356, 4), 21, 8)));
+ Table.States (1172).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1172), 108, Reduce, (284, 1), 0);
+ Add_Action (Table.States (1172), 116, (284, 0), 1312);
+ Table.States (1172).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1172), 284, 1542);
+ Table.States (1172).Kernel := To_Vector ((0 => ((343, 1), 66, 0,
(284, 1), 0)));
+ Table.States (1172).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (284, 1), 0)));
+ Table.States (1173).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1173), (21, 25, 27, 51, 52, 66), (342,
1), 2);
+ Table.States (1173).Kernel := To_Vector ((0 => ((342, 1), 344,
0, (342, 1), 2)));
+ Table.States (1173).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (342, 1), 2)));
+ Table.States (1174).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1174), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (341, 4), 5);
+ Table.States (1174).Kernel := To_Vector ((0 => ((341, 4), 108,
0, (341, 4), 5)));
+ Table.States (1174).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (341, 4), 5)));
+ Table.States (1175).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1175), 86, (252, 0), 33);
+ Add_Action (Table.States (1175), 90, (268, 0), 34);
+ Add_Action (Table.States (1175), 116, (196, 0), 146);
+ Add_Action (Table.States (1175), 117, (196, 1), 37);
+ Add_Action (Table.States (1175), 118, (195, 6), 38);
+ Table.States (1175).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1175), 182, 1543);
+ Add_Goto (Table.States (1175), 195, 1152);
+ Add_Goto (Table.States (1175), 196, 148);
+ Add_Goto (Table.States (1175), 197, 54);
+ Add_Goto (Table.States (1175), 198, 55);
+ Add_Goto (Table.States (1175), 199, 56);
+ Add_Goto (Table.States (1175), 201, 57);
+ Add_Goto (Table.States (1175), 251, 58);
+ Add_Goto (Table.States (1175), 252, 59);
+ Add_Goto (Table.States (1175), 255, 60);
+ Add_Goto (Table.States (1175), 268, 68);
+ Add_Goto (Table.States (1175), 311, 83);
+ Table.States (1175).Kernel := To_Vector ((0 => ((341, 0), 76, 7,
(32767, 0), 0)));
+ Table.States (1175).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1176).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1176), 108, (341, 1), 1544);
+ Table.States (1176).Kernel := To_Vector ((0 => ((341, 1), 343,
1, (32767, 0), 0)));
+ Table.States (1176).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (341, 1), 108, 1544)));
+ Table.States (1177).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1177), 91, (177, 1), 631);
+ Add_Action (Table.States (1177), 99, (274, 0), 1545);
+ Table.States (1177).Kernel := To_Vector ((((177, 1), 177, 2,
(32767, 0), 0), ((274, 0), 177, 3,
+ (32767, 0), 0)));
+ Table.States (1177).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (274, 0), 99, 1545)));
+ Table.States (1178).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1178), 64, (273, 0), 1546);
+ Table.States (1178).Kernel := To_Vector ((0 => ((273, 0), 66, 2,
(32767, 0), 0)));
+ Table.States (1178).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (273, 0), 64, 1546)));
+ Table.States (1179).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1179), (63, 66), (272, 1), 2);
+ Table.States (1179).Kernel := To_Vector ((0 => ((272, 1), 274,
0, (272, 1), 2)));
+ Table.States (1179).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (272, 1), 2)));
+ Table.States (1180).Action_List.Set_Capacity (42);
+ Add_Action (Table.States (1180), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 77, 81, 83,
84, 86, 90, 105, 116, 117, 118, 119), (386,
+ 0), 5);
+ Table.States (1180).Kernel := To_Vector ((0 => ((386, 0), 108,
0, (386, 0), 5)));
+ Table.States (1180).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (386, 0), 5)));
+ Table.States (1181).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1181), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (130, 1), 5);
+ Table.States (1181).Kernel := To_Vector ((0 => ((130, 1), 108,
0, (130, 1), 5)));
+ Table.States (1181).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (130, 1), 5)));
+ Table.States (1182).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1182), 108, (130, 0), 1547);
+ Table.States (1182).Kernel := To_Vector ((0 => ((130, 0), 434,
1, (32767, 0), 0)));
+ Table.States (1182).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (130, 0), 108, 1547)));
+ Table.States (1183).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1183), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (327, 23), 5);
+ Table.States (1183).Kernel := To_Vector ((0 => ((327, 23), 108,
0, (327, 23), 5)));
+ Table.States (1183).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (327, 23), 5)));
+ Table.States (1184).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1184), 108, (327, 22), 1548);
+ Table.States (1184).Kernel := To_Vector ((0 => ((327, 22), 434,
1, (32767, 0), 0)));
+ Table.States (1184).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (327, 22), 108, 1548)));
+ Table.States (1185).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1185), 30, (296, 0), 476);
+ Add_Action (Table.States (1185), 85, (299, 0), 1257);
+ Table.States (1185).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1185), 296, 479);
+ Add_Goto (Table.States (1185), 297, 1549);
+ Add_Goto (Table.States (1185), 299, 481);
+ Table.States (1185).Kernel := To_Vector ((0 => ((186, 1), 53, 2,
(32767, 0), 0)));
+ Table.States (1185).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (296, 0), 30, 476)));
+ Table.States (1186).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1186), 49, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1186), 61, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1186), 85, (299, 0), 1257);
+ Add_Action (Table.States (1186), 108, Reduce, (295, 1), 0);
+ Table.States (1186).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1186), 295, 1550);
+ Add_Goto (Table.States (1186), 299, 426);
+ Table.States (1186).Kernel := To_Vector ((0 => ((186, 0), 54, 0,
(295, 1), 0)));
+ Table.States (1186).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (295, 1), 0)));
+ Table.States (1187).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1187), (52, 86, 90, 116, 117, 118),
(185, 0), 1);
+ Table.States (1187).Kernel := To_Vector ((0 => ((185, 0), 55, 0,
(185, 0), 1)));
+ Table.States (1187).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (185, 0), 1)));
+ Table.States (1188).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1188), 53, (186, 1), 1185);
+ Add_Action (Table.States (1188), 54, (186, 0), 1186);
+ Table.States (1188).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1188), 186, 1551);
+ Table.States (1188).Kernel := To_Vector ((0 => ((183, 4), 59, 1,
(32767, 0), 0)));
+ Table.States (1188).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (186, 0), 54, 1186)));
+ Table.States (1189).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1189), (52, 86, 90, 116, 117, 118),
(185, 1), 1);
+ Table.States (1189).Kernel := To_Vector ((0 => ((185, 1), 79, 0,
(185, 1), 1)));
+ Table.States (1189).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (185, 1), 1)));
+ Table.States (1190).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1190), (49, 61, 108), (184, 1), 2);
+ Table.States (1190).Kernel := To_Vector ((0 => ((184, 1), 131,
0, (184, 1), 2)));
+ Table.States (1190).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (184, 1), 2)));
+ Table.States (1191).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1191), 52, (187, 0), 347);
+ Add_Action (Table.States (1191), 86, (252, 0), 33);
+ Add_Action (Table.States (1191), 90, (268, 0), 34);
+ Add_Action (Table.States (1191), 116, (196, 0), 146);
+ Add_Action (Table.States (1191), 117, (196, 1), 37);
+ Add_Action (Table.States (1191), 118, (195, 6), 38);
+ Table.States (1191).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (1191), 131, 1552);
+ Add_Goto (Table.States (1191), 187, 365);
+ Add_Goto (Table.States (1191), 195, 528);
+ Add_Goto (Table.States (1191), 196, 148);
+ Add_Goto (Table.States (1191), 197, 54);
+ Add_Goto (Table.States (1191), 198, 55);
+ Add_Goto (Table.States (1191), 199, 56);
+ Add_Goto (Table.States (1191), 201, 57);
+ Add_Goto (Table.States (1191), 251, 58);
+ Add_Goto (Table.States (1191), 252, 59);
+ Add_Goto (Table.States (1191), 255, 60);
+ Add_Goto (Table.States (1191), 268, 68);
+ Add_Goto (Table.States (1191), 311, 83);
+ Table.States (1191).Kernel := To_Vector ((0 => ((184, 0), 185,
1, (32767, 0), 0)));
+ Table.States (1191).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1192).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1192), (49, 61, 108), (183, 5), 2);
+ Table.States (1192).Kernel := To_Vector ((0 => ((183, 5), 186,
0, (183, 5), 2)));
+ Table.States (1192).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (183, 5), 2)));
+ Table.States (1193).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1193), 86, (252, 0), 33);
+ Add_Action (Table.States (1193), 90, (268, 0), 34);
+ Add_Action (Table.States (1193), 116, (196, 0), 146);
+ Add_Action (Table.States (1193), 117, (196, 1), 37);
+ Add_Action (Table.States (1193), 118, (195, 6), 38);
+ Table.States (1193).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1193), 182, 1553);
+ Add_Goto (Table.States (1193), 195, 1152);
+ Add_Goto (Table.States (1193), 196, 148);
+ Add_Goto (Table.States (1193), 197, 54);
+ Add_Goto (Table.States (1193), 198, 55);
+ Add_Goto (Table.States (1193), 199, 56);
+ Add_Goto (Table.States (1193), 201, 57);
+ Add_Goto (Table.States (1193), 251, 58);
+ Add_Goto (Table.States (1193), 252, 59);
+ Add_Goto (Table.States (1193), 255, 60);
+ Add_Goto (Table.States (1193), 268, 68);
+ Add_Goto (Table.States (1193), 311, 83);
+ Table.States (1193).Kernel := To_Vector ((0 => ((181, 8), 75, 1,
(32767, 0), 0)));
+ Table.States (1193).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1194).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1194), 49, Reduce, (181, 7), 2);
+ Add_Action (Table.States (1194), 61, Reduce, (181, 7), 2);
+ Add_Action (Table.States (1194), 75, (181, 6), 1554);
+ Add_Action (Table.States (1194), 108, Reduce, (181, 7), 2);
+ Table.States (1194).Kernel := To_Vector ((((181, 6), 57, 2,
(32767, 0), 0), ((181, 7), 57, 0, (181,
+ 7), 2)));
+ Table.States (1194).Minimal_Complete_Actions := To_Vector
(((Shift, (181, 6), 75, 1554), (Reduce, (181,
+ 7), 2)));
+ Table.States (1195).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1195), 52, (187, 0), 347);
+ Add_Action (Table.States (1195), 86, (252, 0), 33);
+ Add_Action (Table.States (1195), 90, (268, 0), 34);
+ Add_Action (Table.States (1195), 116, (196, 0), 146);
+ Add_Action (Table.States (1195), 117, (196, 1), 37);
+ Add_Action (Table.States (1195), 118, (195, 6), 38);
+ Table.States (1195).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (1195), 131, 1555);
+ Add_Goto (Table.States (1195), 187, 365);
+ Add_Goto (Table.States (1195), 195, 528);
+ Add_Goto (Table.States (1195), 196, 148);
+ Add_Goto (Table.States (1195), 197, 54);
+ Add_Goto (Table.States (1195), 198, 55);
+ Add_Goto (Table.States (1195), 199, 56);
+ Add_Goto (Table.States (1195), 201, 57);
+ Add_Goto (Table.States (1195), 251, 58);
+ Add_Goto (Table.States (1195), 252, 59);
+ Add_Goto (Table.States (1195), 255, 60);
+ Add_Goto (Table.States (1195), 268, 68);
+ Add_Goto (Table.States (1195), 311, 83);
+ Table.States (1195).Kernel := To_Vector ((((328, 40), 76, 8,
(32767, 0), 0), ((328, 41), 76, 6,
+ (32767, 0), 0), ((328, 42), 76, 6, (32767, 0), 0), ((328, 43),
76, 4, (32767, 0), 0)));
+ Table.States (1195).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1196).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1196), 49, Reduce, (181, 5), 2);
+ Add_Action (Table.States (1196), 61, Reduce, (181, 5), 2);
+ Add_Action (Table.States (1196), 75, (181, 4), 1556);
+ Add_Action (Table.States (1196), 108, Reduce, (181, 5), 2);
+ Table.States (1196).Kernel := To_Vector ((((181, 4), 57, 2,
(32767, 0), 0), ((181, 5), 57, 0, (181,
+ 5), 2)));
+ Table.States (1196).Minimal_Complete_Actions := To_Vector
(((Shift, (181, 4), 75, 1556), (Reduce, (181,
+ 5), 2)));
+ Table.States (1197).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1197), 49, Reduce, (181, 3), 2);
+ Add_Action (Table.States (1197), 61, Reduce, (181, 3), 2);
+ Add_Action (Table.States (1197), 75, (181, 2), 1557);
+ Add_Action (Table.States (1197), 108, Reduce, (181, 3), 2);
+ Table.States (1197).Kernel := To_Vector ((((181, 2), 57, 2,
(32767, 0), 0), ((181, 3), 57, 0, (181,
+ 3), 2)));
+ Table.States (1197).Minimal_Complete_Actions := To_Vector
(((Shift, (181, 2), 75, 1557), (Reduce, (181,
+ 3), 2)));
+ Table.States (1198).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1198), (61, 108), (170, 2), 2);
+ Table.States (1198).Kernel := To_Vector ((0 => ((170, 2), 67, 0,
(170, 2), 2)));
+ Table.States (1198).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (170, 2), 2)));
+ Table.States (1199).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1199), 116, (196, 0), 146);
+ Add_Action (Table.States (1199), 117, (196, 1), 37);
+ Table.States (1199).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1199), 196, 1558);
+ Table.States (1199).Kernel := To_Vector ((0 => ((175, 0), 64,
13, (32767, 0), 0)));
+ Table.States (1199).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1200).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1200), 108, (171, 3), 1559);
+ Table.States (1200).Kernel := To_Vector ((0 => ((171, 3), 65, 1,
(32767, 0), 0)));
+ Table.States (1200).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (171, 3), 108, 1559)));
+ Table.States (1201).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1201), 66, (170, 0), 1560);
+ Table.States (1201).Kernel := To_Vector ((((170, 0), 171, 3,
(32767, 0), 0), ((170, 1), 171, 2,
+ (32767, 0), 0)));
+ Table.States (1201).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (170, 0), 66, 1560)));
+ Table.States (1202).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1202), (51, 63, 64, 66, 116), (457, 0),
1);
+ Table.States (1202).Kernel := To_Vector ((0 => ((457, 0), 172,
0, (457, 0), 1)));
+ Table.States (1202).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (457, 0), 1)));
+ Table.States (1203).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1203), (51, 63, 64, 66, 116), (172, 0),
1);
+ Table.States (1203).Kernel := To_Vector ((0 => ((172, 0), 173,
0, (172, 0), 1)));
+ Table.States (1203).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (172, 0), 1)));
+ Table.States (1204).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1204), (63, 66), (171, 2), 1);
+ Table.States (1204).Kernel := To_Vector ((0 => ((171, 2), 175,
0, (171, 2), 1)));
+ Table.States (1204).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (171, 2), 1)));
+ Table.States (1205).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1205), (51, 63, 64, 66, 116), (172, 1),
1);
+ Table.States (1205).Kernel := To_Vector ((0 => ((172, 1), 431,
0, (172, 1), 1)));
+ Table.States (1205).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (172, 1), 1)));
+ Table.States (1206).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1206), 51, (437, 0), 221);
+ Add_Action (Table.States (1206), 63, Reduce, (171, 0), 1);
+ Add_Action (Table.States (1206), 64, (175, 0), 1199);
+ Add_Action (Table.States (1206), 66, Reduce, (171, 0), 1);
+ Add_Action (Table.States (1206), 116, (136, 0), 207);
+ Table.States (1206).Goto_List.Set_Capacity (10);
+ Add_Goto (Table.States (1206), 136, 1145);
+ Add_Goto (Table.States (1206), 172, 1561);
+ Add_Goto (Table.States (1206), 173, 1203);
+ Add_Goto (Table.States (1206), 175, 1562);
+ Add_Goto (Table.States (1206), 431, 1205);
+ Add_Goto (Table.States (1206), 437, 140);
+ Add_Goto (Table.States (1206), 438, 141);
+ Add_Goto (Table.States (1206), 440, 142);
+ Add_Goto (Table.States (1206), 454, 143);
+ Add_Goto (Table.States (1206), 457, 1563);
+ Table.States (1206).Kernel := To_Vector ((((171, 0), 457, 0,
(171, 0), 1), ((171, 1), 457, 14, (32767,
+ 0), 0), ((457, 1), 457, 5, (32767, 0), 0), ((457, 2), 457,
5, (32767, 0), 0)));
+ Table.States (1206).Minimal_Complete_Actions := To_Vector
(((Reduce, (171, 0), 1), (Shift, (175, 0), 64,
+ 1199)));
+ Table.States (1207).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1207), 61, (434, 0), 299);
+ Add_Action (Table.States (1207), 108, (327, 19), 1564);
+ Table.States (1207).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1207), 434, 1565);
+ Table.States (1207).Kernel := To_Vector ((((327, 18), 27, 3,
(32767, 0), 0), ((327, 19), 27, 1,
+ (32767, 0), 0)));
+ Table.States (1207).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (327, 19), 108, 1564)));
+ Table.States (1208).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1208), 27, (327, 16), 1566);
+ Add_Action (Table.States (1208), 65, (170, 2), 821);
+ Add_Action (Table.States (1208), 67, (170, 0), 822);
+ Table.States (1208).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1208), 170, 1567);
+ Table.States (1208).Kernel := To_Vector ((((169, 2), 77, 2,
(32767, 0), 0), ((327, 16), 77, 4, (32767,
+ 0), 0), ((327, 17), 77, 2, (32767, 0), 0)));
+ Table.States (1208).Minimal_Complete_Actions := To_Vector
(((Shift, (170, 2), 65, 821), (Shift, (327, 16),
+ 27, 1566)));
+ end Subr_46;
+ procedure Subr_47
+ is begin
+ Table.States (1209).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1209), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (189, 2), 5);
+ Table.States (1209).Kernel := To_Vector ((0 => ((189, 2), 108,
0, (189, 2), 5)));
+ Table.States (1209).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (189, 2), 5)));
+ Table.States (1210).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1210), (61, 108), (169, 3), 2);
+ Table.States (1210).Kernel := To_Vector ((0 => ((169, 3), 170,
0, (169, 3), 2)));
+ Table.States (1210).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (169, 3), 2)));
+ Table.States (1211).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1211), 72, (152, 0), 1568);
+ Add_Action (Table.States (1211), 74, (149, 0), 1569);
+ Table.States (1211).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1211), 149, 1570);
+ Table.States (1211).Kernel := To_Vector ((((151, 0), 227, 4,
(32767, 0), 0), ((152, 0), 227, 6,
+ (32767, 0), 0), ((152, 1), 227, 2, (32767, 0), 0)));
+ Table.States (1211).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (152, 0), 72, 1568)));
+ Table.States (1212).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1212), 61, Reduce, (148, 1), 2);
+ Add_Action (Table.States (1212), 74, (149, 0), 1569);
+ Add_Action (Table.States (1212), 108, Reduce, (148, 1), 2);
+ Table.States (1212).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1212), 149, 1571);
+ Table.States (1212).Kernel := To_Vector ((((148, 0), 227, 4,
(32767, 0), 0), ((148, 1), 227, 0, (148,
+ 1), 2)));
+ Table.States (1212).Minimal_Complete_Actions := To_Vector
(((Shift, (149, 0), 74, 1569), (Reduce, (148,
+ 1), 2)));
+ Table.States (1213).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1213), (61, 108), (146, 0), 2);
+ Table.States (1213).Kernel := To_Vector ((0 => ((146, 0), 227,
0, (146, 0), 2)));
+ Table.States (1213).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (146, 0), 2)));
+ Table.States (1214).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1214), 97, (145, 0), 1572);
+ Table.States (1214).Kernel := To_Vector ((0 => ((145, 0), 231,
2, (32767, 0), 0)));
+ Table.States (1214).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (145, 0), 97, 1572)));
+ Table.States (1215).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1215), 61, (179, 0), 1573);
+ Add_Conflict (Table.States (1215), 61, (138, 11), 2);
+ Add_Action (Table.States (1215), 75, (138, 9), 1574);
+ Add_Action (Table.States (1215), 108, Reduce, (138, 11), 2);
+ Table.States (1215).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1215), 179, 1575);
+ Table.States (1215).Kernel := To_Vector ((((138, 9), 131, 5,
(32767, 0), 0), ((138, 10), 131, 3,
+ (32767, 0), 0), ((138, 11), 131, 0, (138, 11), 2), ((328, 44),
131, 7, (32767, 0), 0), ((328, 45),
+ 131, 5, (32767, 0), 0), ((328, 46), 131, 5, (32767, 0), 0),
((328, 47), 131, 3, (32767, 0), 0)));
+ Table.States (1215).Minimal_Complete_Actions := To_Vector
(((Shift, (179, 0), 61, 1573), (Reduce, (138,
+ 11), 2)));
+ Table.States (1216).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1216), 61, (434, 0), 299);
+ Add_Action (Table.States (1216), 108, (327, 21), 1576);
+ Table.States (1216).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1216), 434, 1577);
+ Table.States (1216).Kernel := To_Vector ((((327, 20), 27, 3,
(32767, 0), 0), ((327, 21), 27, 1,
+ (32767, 0), 0)));
+ Table.States (1216).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (327, 21), 108, 1576)));
+ Table.States (1217).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1217), 49, Reduce, (181, 1), 2);
+ Add_Action (Table.States (1217), 61, Reduce, (181, 1), 2);
+ Add_Action (Table.States (1217), 75, (181, 0), 1578);
+ Add_Action (Table.States (1217), 108, Reduce, (181, 1), 2);
+ Table.States (1217).Kernel := To_Vector ((((181, 0), 57, 2,
(32767, 0), 0), ((181, 1), 57, 0, (181,
+ 1), 2)));
+ Table.States (1217).Minimal_Complete_Actions := To_Vector
(((Shift, (181, 0), 75, 1578), (Reduce, (181,
+ 1), 2)));
+ Table.States (1218).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1218), 52, (187, 0), 347);
+ Add_Action (Table.States (1218), 86, (252, 0), 33);
+ Add_Action (Table.States (1218), 90, (268, 0), 34);
+ Add_Action (Table.States (1218), 116, (196, 0), 146);
+ Add_Action (Table.States (1218), 117, (196, 1), 37);
+ Add_Action (Table.States (1218), 118, (195, 6), 38);
+ Table.States (1218).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (1218), 131, 1579);
+ Add_Goto (Table.States (1218), 187, 365);
+ Add_Goto (Table.States (1218), 195, 528);
+ Add_Goto (Table.States (1218), 196, 148);
+ Add_Goto (Table.States (1218), 197, 54);
+ Add_Goto (Table.States (1218), 198, 55);
+ Add_Goto (Table.States (1218), 199, 56);
+ Add_Goto (Table.States (1218), 201, 57);
+ Add_Goto (Table.States (1218), 251, 58);
+ Add_Goto (Table.States (1218), 252, 59);
+ Add_Goto (Table.States (1218), 255, 60);
+ Add_Goto (Table.States (1218), 268, 68);
+ Add_Goto (Table.States (1218), 311, 83);
+ Table.States (1218).Kernel := To_Vector ((((138, 6), 76, 6,
(32767, 0), 0), ((138, 7), 76, 4, (32767,
+ 0), 0), ((138, 8), 76, 1, (32767, 0), 0), ((328, 36), 76, 8,
(32767, 0), 0), ((328, 37), 76, 6,
+ (32767, 0), 0), ((328, 38), 76, 6, (32767, 0), 0), ((328, 39),
76, 4, (32767, 0), 0)));
+ Table.States (1218).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1219).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1219), (61, 108), (169, 4), 2);
+ Table.States (1219).Kernel := To_Vector ((0 => ((169, 4), 170,
0, (169, 4), 2)));
+ Table.States (1219).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (169, 4), 2)));
+ Table.States (1220).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1220), 76, (328, 28), 1580);
+ Table.States (1220).Kernel := To_Vector ((((328, 28), 58, 9,
(32767, 0), 0), ((328, 29), 58, 7,
+ (32767, 0), 0), ((328, 30), 58, 7, (32767, 0), 0), ((328, 31),
58, 5, (32767, 0), 0)));
+ Table.States (1220).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 28), 76, 1580)));
+ Table.States (1221).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1221), 27, (327, 14), 1581);
+ Add_Action (Table.States (1221), 65, (170, 2), 821);
+ Add_Action (Table.States (1221), 67, (170, 0), 822);
+ Add_Action (Table.States (1221), 77, (169, 0), 1582);
+ Table.States (1221).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1221), 170, 1583);
+ Table.States (1221).Kernel := To_Vector ((((169, 0), 68, 3,
(32767, 0), 0), ((169, 1), 68, 2, (32767,
+ 0), 0), ((327, 12), 68, 5, (32767, 0), 0), ((327, 13), 68,
3, (32767, 0), 0), ((327, 14), 68, 4,
+ (32767, 0), 0), ((327, 15), 68, 2, (32767, 0), 0)));
+ Table.States (1221).Minimal_Complete_Actions := To_Vector
(((Shift, (170, 2), 65, 821), (Shift, (327, 14),
+ 27, 1581)));
+ Table.States (1222).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1222), 52, (187, 0), 347);
+ Add_Action (Table.States (1222), 86, (252, 0), 33);
+ Add_Action (Table.States (1222), 90, (268, 0), 34);
+ Add_Action (Table.States (1222), 116, (196, 0), 146);
+ Add_Action (Table.States (1222), 117, (196, 1), 37);
+ Add_Action (Table.States (1222), 118, (195, 6), 38);
+ Table.States (1222).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (1222), 131, 1584);
+ Add_Goto (Table.States (1222), 187, 365);
+ Add_Goto (Table.States (1222), 195, 528);
+ Add_Goto (Table.States (1222), 196, 148);
+ Add_Goto (Table.States (1222), 197, 54);
+ Add_Goto (Table.States (1222), 198, 55);
+ Add_Goto (Table.States (1222), 199, 56);
+ Add_Goto (Table.States (1222), 201, 57);
+ Add_Goto (Table.States (1222), 251, 58);
+ Add_Goto (Table.States (1222), 252, 59);
+ Add_Goto (Table.States (1222), 255, 60);
+ Add_Goto (Table.States (1222), 268, 68);
+ Add_Goto (Table.States (1222), 311, 83);
+ Table.States (1222).Kernel := To_Vector ((((138, 3), 76, 6,
(32767, 0), 0), ((138, 4), 76, 4, (32767,
+ 0), 0), ((138, 5), 76, 1, (32767, 0), 0), ((328, 32), 76, 8,
(32767, 0), 0), ((328, 33), 76, 6,
+ (32767, 0), 0), ((328, 34), 76, 6, (32767, 0), 0), ((328, 35),
76, 4, (32767, 0), 0)));
+ Table.States (1222).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1223).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1223), 76, (138, 0), 1585);
+ Table.States (1223).Kernel := To_Vector ((((138, 0), 77, 7,
(32767, 0), 0), ((138, 1), 77, 5, (32767,
+ 0), 0), ((138, 2), 77, 2, (32767, 0), 0), ((328, 24), 77, 9,
(32767, 0), 0), ((328, 25), 77, 7,
+ (32767, 0), 0), ((328, 26), 77, 7, (32767, 0), 0), ((328, 27),
77, 5, (32767, 0), 0)));
+ Table.States (1223).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (138, 0), 76, 1585)));
+ Table.States (1224).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1224), (87, 95), (143, 0), 1);
+ Table.States (1224).Kernel := To_Vector ((0 => ((143, 0), 116,
0, (143, 0), 1)));
+ Table.States (1224).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (143, 0), 1)));
+ Table.States (1225).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1225), (87, 95), (143, 1), 1);
+ Table.States (1225).Kernel := To_Vector ((0 => ((143, 1), 118,
0, (143, 1), 1)));
+ Table.States (1225).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (143, 1), 1)));
+ Table.States (1226).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1226), 87, (142, 0), 1586);
+ Add_Action (Table.States (1226), 95, (141, 1), 1587);
+ Table.States (1226).Kernel := To_Vector ((((141, 1), 141, 2,
(32767, 0), 0), ((141, 2), 141, 2,
+ (32767, 0), 0), ((142, 0), 141, 1, (32767, 0), 0)));
+ Table.States (1226).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (142, 0), 87, 1586)));
+ Table.States (1227).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1227), (87, 95), (141, 0), 1);
+ Table.States (1227).Kernel := To_Vector ((0 => ((141, 0), 143,
0, (141, 0), 1)));
+ Table.States (1227).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (141, 0), 1)));
+ Table.States (1228).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1228), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (128, 3), 5);
+ Table.States (1228).Kernel := To_Vector ((0 => ((128, 3), 108,
0, (128, 3), 5)));
+ Table.States (1228).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (128, 3), 5)));
+ Table.States (1229).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1229), 108, (128, 2), 1588);
+ Table.States (1229).Kernel := To_Vector ((0 => ((128, 2), 434,
1, (32767, 0), 0)));
+ Table.States (1229).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (128, 2), 108, 1588)));
+ Table.States (1230).Action_List.Set_Capacity (11);
+ Add_Action (Table.States (1230), 52, (187, 0), 347);
+ Add_Action (Table.States (1230), 53, (186, 1), 1185);
+ Add_Action (Table.States (1230), 54, (186, 0), 1186);
+ Add_Action (Table.States (1230), 55, (185, 0), 1187);
+ Add_Action (Table.States (1230), 59, (183, 2), 1589);
+ Add_Action (Table.States (1230), 79, (185, 1), 1189);
+ Add_Action (Table.States (1230), 86, (252, 0), 33);
+ Add_Action (Table.States (1230), 90, (268, 0), 34);
+ Add_Action (Table.States (1230), 116, (196, 0), 146);
+ Add_Action (Table.States (1230), 117, (196, 1), 37);
+ Add_Action (Table.States (1230), 118, (195, 6), 38);
+ Table.States (1230).Goto_List.Set_Capacity (15);
+ Add_Goto (Table.States (1230), 131, 1190);
+ Add_Goto (Table.States (1230), 185, 1191);
+ Add_Goto (Table.States (1230), 186, 1590);
+ Add_Goto (Table.States (1230), 187, 365);
+ Add_Goto (Table.States (1230), 195, 528);
+ Add_Goto (Table.States (1230), 196, 148);
+ Add_Goto (Table.States (1230), 197, 54);
+ Add_Goto (Table.States (1230), 198, 55);
+ Add_Goto (Table.States (1230), 199, 56);
+ Add_Goto (Table.States (1230), 201, 57);
+ Add_Goto (Table.States (1230), 251, 58);
+ Add_Goto (Table.States (1230), 252, 59);
+ Add_Goto (Table.States (1230), 255, 60);
+ Add_Goto (Table.States (1230), 268, 68);
+ Add_Goto (Table.States (1230), 311, 83);
+ Table.States (1230).Kernel := To_Vector ((((183, 2), 56, 2,
(32767, 0), 0), ((183, 3), 56, 1, (32767,
+ 0), 0), ((184, 0), 56, 2, (32767, 0), 0), ((184, 1), 56, 1,
(32767, 0), 0)));
+ Table.States (1230).Minimal_Complete_Actions := To_Vector
(((Shift, (186, 0), 54, 1186), (Shift, (196, 0),
+ 116, 146)));
+ Table.States (1231).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1231), (49, 61, 108), (183, 0), 2);
+ Table.States (1231).Kernel := To_Vector ((0 => ((183, 0), 184,
0, (183, 0), 2)));
+ Table.States (1231).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (183, 0), 2)));
+ Table.States (1232).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1232), (49, 82, 108), (165, 0), 3);
+ Table.States (1232).Kernel := To_Vector ((0 => ((165, 0), 87, 0,
(165, 0), 3)));
+ Table.States (1232).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (165, 0), 3)));
+ Table.States (1233).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1233), 52, (187, 0), 347);
+ Add_Action (Table.States (1233), 56, (188, 2), 514);
+ Add_Action (Table.States (1233), 86, (252, 0), 33);
+ Add_Action (Table.States (1233), 90, (268, 0), 34);
+ Add_Action (Table.States (1233), 116, (196, 0), 146);
+ Add_Action (Table.States (1233), 117, (196, 1), 37);
+ Add_Action (Table.States (1233), 118, (195, 6), 38);
+ Table.States (1233).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (1233), 187, 1591);
+ Add_Goto (Table.States (1233), 188, 1592);
+ Add_Goto (Table.States (1233), 195, 1593);
+ Add_Goto (Table.States (1233), 196, 148);
+ Add_Goto (Table.States (1233), 197, 54);
+ Add_Goto (Table.States (1233), 198, 55);
+ Add_Goto (Table.States (1233), 199, 56);
+ Add_Goto (Table.States (1233), 201, 57);
+ Add_Goto (Table.States (1233), 251, 58);
+ Add_Goto (Table.States (1233), 252, 59);
+ Add_Goto (Table.States (1233), 255, 60);
+ Add_Goto (Table.States (1233), 268, 68);
+ Add_Goto (Table.States (1233), 311, 83);
+ Table.States (1233).Kernel := To_Vector ((((168, 0), 93, 5,
(32767, 0), 0), ((168, 1), 93, 3, (32767,
+ 0), 0), ((168, 2), 93, 3, (32767, 0), 0), ((168, 3), 93, 1,
(32767, 0), 0), ((168, 4), 93, 4,
+ (32767, 0), 0), ((168, 5), 93, 2, (32767, 0), 0)));
+ Table.States (1233).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1234).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1234), (49, 61, 82, 108), (167, 0), 3);
+ Table.States (1234).Kernel := To_Vector ((0 => ((167, 0), 87, 0,
(167, 0), 3)));
+ Table.States (1234).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (167, 0), 3)));
+ Table.States (1235).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1235), 116, (136, 0), 207);
+ Table.States (1235).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1235), 136, 851);
+ Add_Goto (Table.States (1235), 166, 1594);
+ Add_Goto (Table.States (1235), 168, 1595);
+ Table.States (1235).Kernel := To_Vector ((((166, 1), 108, 3,
(32767, 0), 0), ((166, 2), 108, 3,
+ (32767, 0), 0)));
+ Table.States (1236).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1236), 61, (434, 0), 299);
+ Add_Action (Table.States (1236), 108, (327, 11), 1596);
+ Table.States (1236).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1236), 434, 1597);
+ Table.States (1236).Kernel := To_Vector ((((327, 10), 27, 3,
(32767, 0), 0), ((327, 11), 27, 1,
+ (32767, 0), 0)));
+ Table.States (1236).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (327, 11), 108, 1596)));
+ Table.States (1237).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1237), 76, (328, 16), 1598);
+ Table.States (1237).Kernel := To_Vector ((((328, 16), 58, 9,
(32767, 0), 0), ((328, 17), 58, 7,
+ (32767, 0), 0), ((328, 18), 58, 7, (32767, 0), 0), ((328, 19),
58, 5, (32767, 0), 0)));
+ Table.States (1237).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 16), 76, 1598)));
+ Table.States (1238).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1238), 27, (327, 6), 1599);
+ Add_Action (Table.States (1238), 77, (327, 4), 1600);
+ Add_Action (Table.States (1238), 108, (189, 0), 1601);
+ Table.States (1238).Kernel := To_Vector ((((189, 0), 68, 1,
(32767, 0), 0), ((327, 4), 68, 5, (32767,
+ 0), 0), ((327, 5), 68, 3, (32767, 0), 0), ((327, 6), 68, 4,
(32767, 0), 0), ((327, 7), 68, 2,
+ (32767, 0), 0)));
+ Table.States (1238).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (189, 0), 108, 1601)));
+ Table.States (1239).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1239), 52, (187, 0), 347);
+ Add_Action (Table.States (1239), 86, (252, 0), 33);
+ Add_Action (Table.States (1239), 90, (268, 0), 34);
+ Add_Action (Table.States (1239), 116, (196, 0), 146);
+ Add_Action (Table.States (1239), 117, (196, 1), 37);
+ Add_Action (Table.States (1239), 118, (195, 6), 38);
+ Table.States (1239).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (1239), 131, 1602);
+ Add_Goto (Table.States (1239), 187, 365);
+ Add_Goto (Table.States (1239), 195, 528);
+ Add_Goto (Table.States (1239), 196, 148);
+ Add_Goto (Table.States (1239), 197, 54);
+ Add_Goto (Table.States (1239), 198, 55);
+ Add_Goto (Table.States (1239), 199, 56);
+ Add_Goto (Table.States (1239), 201, 57);
+ Add_Goto (Table.States (1239), 251, 58);
+ Add_Goto (Table.States (1239), 252, 59);
+ Add_Goto (Table.States (1239), 255, 60);
+ Add_Goto (Table.States (1239), 268, 68);
+ Add_Goto (Table.States (1239), 311, 83);
+ Table.States (1239).Kernel := To_Vector ((((328, 20), 76, 8,
(32767, 0), 0), ((328, 21), 76, 6,
+ (32767, 0), 0), ((328, 22), 76, 6, (32767, 0), 0), ((328, 23),
76, 4, (32767, 0), 0)));
+ Table.States (1239).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1240).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1240), 27, (327, 8), 1603);
+ Add_Action (Table.States (1240), 76, (328, 12), 1604);
+ Table.States (1240).Kernel := To_Vector ((((327, 8), 77, 4,
(32767, 0), 0), ((327, 9), 77, 2, (32767,
+ 0), 0), ((328, 12), 77, 9, (32767, 0), 0), ((328, 13), 77,
7, (32767, 0), 0), ((328, 14), 77, 7,
+ (32767, 0), 0), ((328, 15), 77, 5, (32767, 0), 0)));
+ Table.States (1240).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (327, 8), 27, 1603)));
+ Table.States (1241).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1241), 58, (328, 4), 1605);
+ Add_Action (Table.States (1241), 68, (327, 0), 1606);
+ Add_Action (Table.States (1241), 76, (328, 8), 1607);
+ Add_Action (Table.States (1241), 77, (328, 0), 1608);
+ Table.States (1241).Kernel := To_Vector ((((327, 0), 78, 6,
(32767, 0), 0), ((327, 1), 78, 4, (32767,
+ 0), 0), ((327, 2), 78, 5, (32767, 0), 0), ((327, 3), 78, 3,
(32767, 0), 0), ((328, 0), 78, 10,
+ (32767, 0), 0), ((328, 1), 78, 8, (32767, 0), 0), ((328, 2),
78, 8, (32767, 0), 0), ((328, 3), 78,
+ 6, (32767, 0), 0), ((328, 4), 78, 10, (32767, 0), 0), ((328,
5), 78, 8, (32767, 0), 0), ((328, 6),
+ 78, 8, (32767, 0), 0), ((328, 7), 78, 6, (32767, 0), 0),
((328, 8), 78, 9, (32767, 0), 0), ((328,
+ 9), 78, 7, (32767, 0), 0), ((328, 10), 78, 7, (32767, 0),
0), ((328, 11), 78, 5, (32767, 0), 0)));
+ Table.States (1241).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (327, 0), 68, 1606)));
+ Table.States (1242).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1242), 57, (181, 6), 1194);
+ Table.States (1242).Kernel := To_Vector ((((181, 6), 58, 3,
(32767, 0), 0), ((181, 7), 58, 1, (32767,
+ 0), 0)));
+ Table.States (1242).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (181, 6), 57, 1194)));
+ Table.States (1243).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1243), 65, (170, 2), 821);
+ Add_Action (Table.States (1243), 67, (170, 0), 822);
+ Add_Action (Table.States (1243), 77, (169, 2), 1609);
+ Table.States (1243).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1243), 170, 1210);
+ Table.States (1243).Kernel := To_Vector ((((169, 2), 68, 3,
(32767, 0), 0), ((169, 3), 68, 2, (32767,
+ 0), 0)));
+ Table.States (1243).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (170, 2), 65, 821)));
+ Table.States (1244).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1244), 52, (187, 0), 347);
+ Add_Action (Table.States (1244), 86, (252, 0), 33);
+ Add_Action (Table.States (1244), 90, (268, 0), 34);
+ Add_Action (Table.States (1244), 116, (196, 0), 146);
+ Add_Action (Table.States (1244), 117, (196, 1), 37);
+ Add_Action (Table.States (1244), 118, (195, 6), 38);
+ Table.States (1244).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (1244), 131, 1610);
+ Add_Goto (Table.States (1244), 187, 365);
+ Add_Goto (Table.States (1244), 195, 528);
+ Add_Goto (Table.States (1244), 196, 148);
+ Add_Goto (Table.States (1244), 197, 54);
+ Add_Goto (Table.States (1244), 198, 55);
+ Add_Goto (Table.States (1244), 199, 56);
+ Add_Goto (Table.States (1244), 201, 57);
+ Add_Goto (Table.States (1244), 251, 58);
+ Add_Goto (Table.States (1244), 252, 59);
+ Add_Goto (Table.States (1244), 255, 60);
+ Add_Goto (Table.States (1244), 268, 68);
+ Add_Goto (Table.States (1244), 311, 83);
+ Table.States (1244).Kernel := To_Vector ((((138, 9), 76, 6,
(32767, 0), 0), ((138, 10), 76, 4, (32767,
+ 0), 0), ((138, 11), 76, 1, (32767, 0), 0)));
+ Table.States (1244).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1245).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1245), 57, (181, 0), 1217);
+ Add_Action (Table.States (1245), 65, (170, 2), 821);
+ Add_Action (Table.States (1245), 67, (170, 0), 822);
+ Add_Action (Table.States (1245), 76, (138, 6), 1611);
+ Table.States (1245).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1245), 170, 1219);
+ Table.States (1245).Kernel := To_Vector ((((138, 6), 77, 7,
(32767, 0), 0), ((138, 7), 77, 5, (32767,
+ 0), 0), ((138, 8), 77, 2, (32767, 0), 0), ((169, 4), 77, 2,
(32767, 0), 0), ((181, 0), 77, 3,
+ (32767, 0), 0), ((181, 1), 77, 1, (32767, 0), 0)));
+ Table.States (1245).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (181, 0), 57, 1217)));
+ Table.States (1246).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1246), 68, (169, 0), 1612);
+ Add_Action (Table.States (1246), 76, (138, 3), 1613);
+ Add_Action (Table.States (1246), 77, (138, 0), 1614);
+ Table.States (1246).Kernel := To_Vector ((((138, 0), 78, 8,
(32767, 0), 0), ((138, 1), 78, 6, (32767,
+ 0), 0), ((138, 2), 78, 3, (32767, 0), 0), ((138, 3), 78, 7,
(32767, 0), 0), ((138, 4), 78, 5,
+ (32767, 0), 0), ((138, 5), 78, 2, (32767, 0), 0), ((169, 0),
78, 4, (32767, 0), 0), ((169, 1), 78,
+ 3, (32767, 0), 0)));
+ Table.States (1246).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (138, 3), 76, 1613)));
+ Table.States (1247).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1247), 61, (434, 0), 299);
+ Add_Action (Table.States (1247), 108, (128, 1), 1615);
+ Table.States (1247).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1247), 434, 1616);
+ Table.States (1247).Kernel := To_Vector ((((128, 0), 129, 3,
(32767, 0), 0), ((128, 1), 129, 1,
+ (32767, 0), 0)));
+ Table.States (1247).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (128, 1), 108, 1615)));
+ Table.States (1248).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1248), 108, (124, 2), 1617);
+ Table.States (1248).Kernel := To_Vector ((0 => ((124, 2), 87, 1,
(32767, 0), 0)));
+ Table.States (1248).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (124, 2), 108, 1617)));
+ Table.States (1249).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1249), 108, (124, 0), 1618);
+ Table.States (1249).Kernel := To_Vector ((0 => ((124, 0), 87, 1,
(32767, 0), 0)));
+ Table.States (1249).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (124, 0), 108, 1618)));
+ Table.States (1250).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (1250), 12, (402, 0), 165);
+ Add_Action (Table.States (1250), 46, (233, 2), 167);
+ Add_Action (Table.States (1250), 52, (233, 3), 168);
+ Add_Action (Table.States (1250), 65, (234, 1), 169);
+ Add_Action (Table.States (1250), 76, (256, 0), 170);
+ Add_Action (Table.States (1250), 85, (205, 4), 171);
+ Add_Action (Table.States (1250), 86, (213, 2), 172);
+ Add_Action (Table.States (1250), 90, (268, 0), 34);
+ Add_Action (Table.States (1250), 106, (237, 1), 173);
+ Add_Action (Table.States (1250), 107, (237, 0), 174);
+ Add_Action (Table.States (1250), 115, (234, 0), 175);
+ Add_Action (Table.States (1250), 116, (196, 0), 857);
+ Add_Action (Table.States (1250), 117, (196, 1), 37);
+ Add_Action (Table.States (1250), 118, (195, 6), 38);
+ Table.States (1250).Goto_List.Set_Capacity (33);
+ Add_Goto (Table.States (1250), 125, 1619);
+ Add_Goto (Table.States (1250), 195, 176);
+ Add_Goto (Table.States (1250), 196, 148);
+ Add_Goto (Table.States (1250), 197, 54);
+ Add_Goto (Table.States (1250), 198, 55);
+ Add_Goto (Table.States (1250), 199, 56);
+ Add_Goto (Table.States (1250), 201, 57);
+ Add_Goto (Table.States (1250), 205, 177);
+ Add_Goto (Table.States (1250), 206, 178);
+ Add_Goto (Table.States (1250), 210, 179);
+ Add_Goto (Table.States (1250), 211, 180);
+ Add_Goto (Table.States (1250), 213, 181);
+ Add_Goto (Table.States (1250), 214, 182);
+ Add_Goto (Table.States (1250), 215, 183);
+ Add_Goto (Table.States (1250), 218, 184);
+ Add_Goto (Table.States (1250), 219, 185);
+ Add_Goto (Table.States (1250), 220, 186);
+ Add_Goto (Table.States (1250), 227, 861);
+ Add_Goto (Table.States (1250), 228, 188);
+ Add_Goto (Table.States (1250), 231, 189);
+ Add_Goto (Table.States (1250), 232, 190);
+ Add_Goto (Table.States (1250), 233, 191);
+ Add_Goto (Table.States (1250), 234, 192);
+ Add_Goto (Table.States (1250), 237, 193);
+ Add_Goto (Table.States (1250), 251, 58);
+ Add_Goto (Table.States (1250), 252, 59);
+ Add_Goto (Table.States (1250), 255, 60);
+ Add_Goto (Table.States (1250), 256, 194);
+ Add_Goto (Table.States (1250), 268, 68);
+ Add_Goto (Table.States (1250), 311, 83);
+ Add_Goto (Table.States (1250), 402, 195);
+ Add_Goto (Table.States (1250), 435, 865);
+ Add_Goto (Table.States (1250), 465, 196);
+ Table.States (1250).Kernel := To_Vector ((0 => ((123, 1), 95, 1,
(32767, 0), 0)));
+ Table.States (1250).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ end Subr_47;
+ procedure Subr_48
+ is begin
+ Table.States (1251).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (1251), 12, (402, 0), 165);
+ Add_Action (Table.States (1251), 46, (233, 2), 167);
+ Add_Action (Table.States (1251), 52, (233, 3), 168);
+ Add_Action (Table.States (1251), 65, (234, 1), 169);
+ Add_Action (Table.States (1251), 76, (256, 0), 170);
+ Add_Action (Table.States (1251), 85, (205, 4), 171);
+ Add_Action (Table.States (1251), 86, (213, 2), 172);
+ Add_Action (Table.States (1251), 90, (268, 0), 34);
+ Add_Action (Table.States (1251), 106, (237, 1), 173);
+ Add_Action (Table.States (1251), 107, (237, 0), 174);
+ Add_Action (Table.States (1251), 115, (234, 0), 175);
+ Add_Action (Table.States (1251), 116, (196, 0), 146);
+ Add_Action (Table.States (1251), 117, (196, 1), 37);
+ Add_Action (Table.States (1251), 118, (195, 6), 38);
+ Table.States (1251).Goto_List.Set_Capacity (31);
+ Add_Goto (Table.States (1251), 195, 176);
+ Add_Goto (Table.States (1251), 196, 148);
+ Add_Goto (Table.States (1251), 197, 54);
+ Add_Goto (Table.States (1251), 198, 55);
+ Add_Goto (Table.States (1251), 199, 56);
+ Add_Goto (Table.States (1251), 201, 57);
+ Add_Goto (Table.States (1251), 205, 177);
+ Add_Goto (Table.States (1251), 206, 178);
+ Add_Goto (Table.States (1251), 210, 179);
+ Add_Goto (Table.States (1251), 211, 180);
+ Add_Goto (Table.States (1251), 213, 181);
+ Add_Goto (Table.States (1251), 214, 182);
+ Add_Goto (Table.States (1251), 215, 183);
+ Add_Goto (Table.States (1251), 218, 184);
+ Add_Goto (Table.States (1251), 219, 185);
+ Add_Goto (Table.States (1251), 220, 186);
+ Add_Goto (Table.States (1251), 227, 1620);
+ Add_Goto (Table.States (1251), 228, 188);
+ Add_Goto (Table.States (1251), 231, 189);
+ Add_Goto (Table.States (1251), 232, 190);
+ Add_Goto (Table.States (1251), 233, 191);
+ Add_Goto (Table.States (1251), 234, 192);
+ Add_Goto (Table.States (1251), 237, 193);
+ Add_Goto (Table.States (1251), 251, 58);
+ Add_Goto (Table.States (1251), 252, 59);
+ Add_Goto (Table.States (1251), 255, 60);
+ Add_Goto (Table.States (1251), 256, 194);
+ Add_Goto (Table.States (1251), 268, 68);
+ Add_Goto (Table.States (1251), 311, 83);
+ Add_Goto (Table.States (1251), 402, 195);
+ Add_Goto (Table.States (1251), 465, 196);
+ Table.States (1251).Kernel := To_Vector ((0 => ((125, 0), 99, 1,
(32767, 0), 0)));
+ Table.States (1251).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (1252).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1252), 51, (221, 0), 273);
+ Table.States (1252).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1252), 221, 1621);
+ Table.States (1252).Kernel := To_Vector ((0 => ((252, 0), 87, 7,
(32767, 0), 0)));
+ Table.States (1252).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (221, 0), 51, 273)));
+ Table.States (1253).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1253), 99, (314, 0), 632);
+ Table.States (1253).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1253), 314, 1622);
+ Table.States (1253).Kernel := To_Vector ((0 => ((221, 0), 227,
2, (32767, 0), 0)));
+ Table.States (1253).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (314, 0), 99, 632)));
+ Table.States (1254).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1254), 99, (314, 0), 632);
+ Table.States (1254).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1254), 314, 1623);
+ Table.States (1254).Kernel := To_Vector ((0 => ((221, 2), 227,
2, (32767, 0), 0)));
+ Table.States (1254).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (314, 0), 99, 632)));
+ Table.States (1255).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1255), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (335, 4), 5);
+ Table.States (1255).Kernel := To_Vector ((0 => ((335, 4), 108,
0, (335, 4), 5)));
+ Table.States (1255).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (335, 4), 5)));
+ Table.States (1256).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1256), 61, (434, 0), 299);
+ Add_Action (Table.States (1256), 85, (198, 0), 281);
+ Add_Action (Table.States (1256), 96, (197, 0), 283);
+ Add_Action (Table.States (1256), 108, (336, 1), 1624);
+ Add_Action (Table.States (1256), 113, (121, 0), 285);
+ Add_Action (Table.States (1256), 114, (121, 1), 286);
+ Table.States (1256).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1256), 121, 287);
+ Add_Goto (Table.States (1256), 313, 289);
+ Add_Goto (Table.States (1256), 434, 1625);
+ Table.States (1256).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((336, 0), 195, 3, (32767, 0), 0),
+ ((336, 1), 195, 1, (32767, 0), 0)));
+ Table.States (1256).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (336, 1), 108, 1624)));
+ Table.States (1257).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1257), 116, (136, 0), 207);
+ Table.States (1257).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1257), 136, 688);
+ Add_Goto (Table.States (1257), 298, 467);
+ Add_Goto (Table.States (1257), 300, 468);
+ Table.States (1257).Kernel := To_Vector ((0 => ((299, 0), 85, 4,
(32767, 0), 0)));
+ Table.States (1257).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (136, 0), 116, 207)));
+ Table.States (1258).Action_List.Set_Capacity (10);
+ Add_Action (Table.States (1258), (24, 33, 47, 49, 61, 69, 82, 87,
94, 108), (188, 11), 3);
+ Table.States (1258).Kernel := To_Vector ((0 => ((188, 11), 297,
0, (188, 11), 3)));
+ Table.States (1258).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (188, 11), 3)));
+ Table.States (1259).Action_List.Set_Capacity (10);
+ Add_Action (Table.States (1259), (24, 33, 47, 49, 61, 69, 82, 87,
94, 108), (188, 7), 3);
+ Table.States (1259).Kernel := To_Vector ((0 => ((188, 7), 295,
0, (188, 7), 3)));
+ Table.States (1259).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (188, 7), 3)));
+ Table.States (1260).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1260), 30, (296, 0), 476);
+ Add_Action (Table.States (1260), 85, (299, 0), 1257);
+ Table.States (1260).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1260), 296, 479);
+ Add_Goto (Table.States (1260), 297, 1626);
+ Add_Goto (Table.States (1260), 299, 481);
+ Table.States (1260).Kernel := To_Vector ((0 => ((188, 10), 53,
2, (32767, 0), 0)));
+ Table.States (1260).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (296, 0), 30, 476)));
+ Table.States (1261).Action_List.Set_Capacity (11);
+ Add_Action (Table.States (1261), 24, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1261), 33, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1261), 47, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1261), 49, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1261), 61, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1261), 69, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1261), 82, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1261), 85, (299, 0), 1257);
+ Add_Action (Table.States (1261), 87, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1261), 94, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1261), 108, Reduce, (295, 1), 0);
+ Table.States (1261).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1261), 295, 1627);
+ Add_Goto (Table.States (1261), 299, 426);
+ Table.States (1261).Kernel := To_Vector ((0 => ((188, 6), 54, 0,
(295, 1), 0)));
+ Table.States (1261).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (295, 1), 0)));
+ Table.States (1262).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (1262), 24, Reduce, (188, 2), 3);
+ Add_Action (Table.States (1262), 33, Reduce, (188, 2), 3);
+ Add_Action (Table.States (1262), 47, Reduce, (188, 2), 3);
+ Add_Action (Table.States (1262), 49, Reduce, (188, 2), 3);
+ Add_Action (Table.States (1262), 61, Reduce, (188, 2), 3);
+ Add_Action (Table.States (1262), 69, Reduce, (188, 2), 3);
+ Add_Action (Table.States (1262), 82, Reduce, (188, 2), 3);
+ Add_Action (Table.States (1262), 85, (198, 0), 281);
+ Add_Action (Table.States (1262), 87, Reduce, (188, 2), 3);
+ Add_Action (Table.States (1262), 94, Reduce, (188, 2), 3);
+ Add_Action (Table.States (1262), 96, (197, 0), 283);
+ Add_Action (Table.States (1262), 108, Reduce, (188, 2), 3);
+ Add_Action (Table.States (1262), 113, (121, 0), 285);
+ Add_Action (Table.States (1262), 114, (121, 1), 286);
+ Table.States (1262).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1262), 121, 287);
+ Add_Goto (Table.States (1262), 313, 289);
+ Table.States (1262).Kernel := To_Vector ((((188, 2), 195, 0,
(188, 2), 3), ((197, 0), 195, 2, (32767,
+ 0), 0), ((198, 0), 195, 3, (32767, 0), 0), ((199, 0), 195,
2, (32767, 0), 0), ((201, 0), 195, 2,
+ (32767, 0), 0), ((255, 0), 195, 3, (32767, 0), 0), ((311, 0),
195, 3, (32767, 0), 0)));
+ Table.States (1262).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (188, 2), 3)));
+ Table.States (1263).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1263), 30, (296, 0), 476);
+ Add_Action (Table.States (1263), 85, (299, 0), 1257);
+ Table.States (1263).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1263), 296, 479);
+ Add_Goto (Table.States (1263), 297, 1628);
+ Add_Goto (Table.States (1263), 299, 481);
+ Table.States (1263).Kernel := To_Vector ((0 => ((188, 9), 53, 2,
(32767, 0), 0)));
+ Table.States (1263).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (296, 0), 30, 476)));
+ Table.States (1264).Action_List.Set_Capacity (11);
+ Add_Action (Table.States (1264), 24, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1264), 33, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1264), 47, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1264), 49, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1264), 61, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1264), 69, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1264), 82, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1264), 85, (299, 0), 1257);
+ Add_Action (Table.States (1264), 87, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1264), 94, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1264), 108, Reduce, (295, 1), 0);
+ Table.States (1264).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1264), 295, 1629);
+ Add_Goto (Table.States (1264), 299, 426);
+ Table.States (1264).Kernel := To_Vector ((0 => ((188, 5), 54, 0,
(295, 1), 0)));
+ Table.States (1264).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (295, 1), 0)));
+ Table.States (1265).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1265), 53, (188, 8), 1630);
+ Add_Action (Table.States (1265), 54, (188, 4), 1631);
+ Table.States (1265).Kernel := To_Vector ((((188, 4), 59, 1,
(32767, 0), 0), ((188, 8), 59, 3, (32767,
+ 0), 0)));
+ Table.States (1265).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (188, 4), 54, 1631)));
+ Table.States (1266).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1266), 86, (252, 0), 33);
+ Add_Action (Table.States (1266), 90, (268, 0), 34);
+ Add_Action (Table.States (1266), 116, (196, 0), 146);
+ Add_Action (Table.States (1266), 117, (196, 1), 37);
+ Add_Action (Table.States (1266), 118, (195, 6), 38);
+ Table.States (1266).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (1266), 195, 1632);
+ Add_Goto (Table.States (1266), 196, 148);
+ Add_Goto (Table.States (1266), 197, 54);
+ Add_Goto (Table.States (1266), 198, 55);
+ Add_Goto (Table.States (1266), 199, 56);
+ Add_Goto (Table.States (1266), 201, 57);
+ Add_Goto (Table.States (1266), 251, 58);
+ Add_Goto (Table.States (1266), 252, 59);
+ Add_Goto (Table.States (1266), 255, 60);
+ Add_Goto (Table.States (1266), 268, 68);
+ Add_Goto (Table.States (1266), 311, 83);
+ Table.States (1266).Kernel := To_Vector ((0 => ((188, 0), 79, 1,
(32767, 0), 0)));
+ Table.States (1266).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1267).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (1267), 24, Reduce, (188, 1), 3);
+ Add_Action (Table.States (1267), 33, Reduce, (188, 1), 3);
+ Add_Action (Table.States (1267), 47, Reduce, (188, 1), 3);
+ Add_Action (Table.States (1267), 49, Reduce, (188, 1), 3);
+ Add_Action (Table.States (1267), 61, Reduce, (188, 1), 3);
+ Add_Action (Table.States (1267), 69, Reduce, (188, 1), 3);
+ Add_Action (Table.States (1267), 82, Reduce, (188, 1), 3);
+ Add_Action (Table.States (1267), 85, (198, 0), 281);
+ Add_Action (Table.States (1267), 87, Reduce, (188, 1), 3);
+ Add_Action (Table.States (1267), 94, Reduce, (188, 1), 3);
+ Add_Action (Table.States (1267), 96, (197, 0), 283);
+ Add_Action (Table.States (1267), 108, Reduce, (188, 1), 3);
+ Add_Action (Table.States (1267), 113, (121, 0), 285);
+ Add_Action (Table.States (1267), 114, (121, 1), 286);
+ Table.States (1267).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1267), 121, 287);
+ Add_Goto (Table.States (1267), 313, 289);
+ Table.States (1267).Kernel := To_Vector ((((188, 1), 195, 0,
(188, 1), 3), ((197, 0), 195, 2, (32767,
+ 0), 0), ((198, 0), 195, 3, (32767, 0), 0), ((199, 0), 195,
2, (32767, 0), 0), ((201, 0), 195, 2,
+ (32767, 0), 0), ((255, 0), 195, 3, (32767, 0), 0), ((311, 0),
195, 3, (32767, 0), 0)));
+ Table.States (1267).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (188, 1), 3)));
+ Table.States (1268).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1268), 86, (252, 0), 33);
+ Add_Action (Table.States (1268), 90, (268, 0), 34);
+ Add_Action (Table.States (1268), 116, (196, 0), 146);
+ Add_Action (Table.States (1268), 117, (196, 1), 37);
+ Add_Action (Table.States (1268), 118, (195, 6), 38);
+ Table.States (1268).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (1268), 195, 1633);
+ Add_Goto (Table.States (1268), 196, 148);
+ Add_Goto (Table.States (1268), 197, 54);
+ Add_Goto (Table.States (1268), 198, 55);
+ Add_Goto (Table.States (1268), 199, 56);
+ Add_Goto (Table.States (1268), 201, 57);
+ Add_Goto (Table.States (1268), 251, 58);
+ Add_Goto (Table.States (1268), 252, 59);
+ Add_Goto (Table.States (1268), 255, 60);
+ Add_Goto (Table.States (1268), 268, 68);
+ Add_Goto (Table.States (1268), 311, 83);
+ Table.States (1268).Kernel := To_Vector ((((335, 0), 24, 4,
(32767, 0), 0), ((335, 1), 24, 2, (32767,
+ 0), 0)));
+ Table.States (1268).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1269).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1269), 61, (434, 0), 299);
+ Add_Action (Table.States (1269), 85, (198, 0), 281);
+ Add_Action (Table.States (1269), 96, (197, 0), 283);
+ Add_Action (Table.States (1269), 108, (335, 7), 1634);
+ Add_Action (Table.States (1269), 113, (121, 0), 285);
+ Add_Action (Table.States (1269), 114, (121, 1), 286);
+ Table.States (1269).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1269), 121, 287);
+ Add_Goto (Table.States (1269), 313, 289);
+ Add_Goto (Table.States (1269), 434, 1635);
+ Table.States (1269).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((335, 6), 195, 3, (32767, 0), 0),
+ ((335, 7), 195, 1, (32767, 0), 0)));
+ Table.States (1269).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (335, 7), 108, 1634)));
+ Table.States (1270).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1270), 61, (434, 0), 299);
+ Add_Action (Table.States (1270), 85, (198, 0), 281);
+ Add_Action (Table.States (1270), 96, (197, 0), 283);
+ Add_Action (Table.States (1270), 108, (335, 3), 1636);
+ Add_Action (Table.States (1270), 113, (121, 0), 285);
+ Add_Action (Table.States (1270), 114, (121, 1), 286);
+ Table.States (1270).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1270), 121, 287);
+ Add_Goto (Table.States (1270), 313, 289);
+ Add_Goto (Table.States (1270), 434, 1637);
+ Table.States (1270).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((335, 2), 195, 3, (32767, 0), 0),
+ ((335, 3), 195, 1, (32767, 0), 0)));
+ Table.States (1270).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (335, 3), 108, 1636)));
+ Table.States (1271).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1271), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (394, 0), 5);
+ Table.States (1271).Kernel := To_Vector ((0 => ((394, 0), 108,
0, (394, 0), 5)));
+ Table.States (1271).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (394, 0), 5)));
+ Table.States (1272).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1272), 87, (156, 0), 1638);
+ Add_Action (Table.States (1272), 95, (155, 1), 1639);
+ Table.States (1272).Kernel := To_Vector ((((155, 1), 155, 4,
(32767, 0), 0), ((155, 2), 155, 4,
+ (32767, 0), 0), ((156, 0), 155, 3, (32767, 0), 0)));
+ Table.States (1272).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (156, 0), 87, 1638)));
+ Table.States (1273).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1273), (87, 95), (155, 0), 1);
+ Table.States (1273).Kernel := To_Vector ((0 => ((155, 0), 157,
0, (155, 0), 1)));
+ Table.States (1273).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (155, 0), 1)));
+ Table.States (1274).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1274), 87, (159, 0), 1640);
+ Add_Action (Table.States (1274), 95, (158, 1), 1641);
+ Table.States (1274).Kernel := To_Vector ((((158, 1), 158, 2,
(32767, 0), 0), ((158, 2), 158, 2,
+ (32767, 0), 0), ((159, 0), 158, 3, (32767, 0), 0)));
+ Table.States (1274).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (159, 0), 87, 1640)));
+ Table.States (1275).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1275), (87, 95), (158, 0), 1);
+ Table.States (1275).Kernel := To_Vector ((0 => ((158, 0), 160,
0, (158, 0), 1)));
+ Table.States (1275).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (158, 0), 1)));
+ Table.States (1276).Action_List.Set_Capacity (18);
+ Add_Action (Table.States (1276), 45, Reduce, (234, 3), 1);
+ Add_Action (Table.States (1276), 71, (453, 0), 635);
+ Add_Action (Table.States (1276), 72, (153, 0), 636);
+ Add_Action (Table.States (1276), 73, Reduce, (234, 3), 1);
+ Add_Action (Table.States (1276), 74, (139, 0), 1642);
+ Add_Action (Table.States (1276), 85, (162, 0), 612);
+ Add_Action (Table.States (1276), 87, Reduce, (131, 3), 1);
+ Add_Action (Table.States (1276), 89, Reduce, (234, 3), 1);
+ Add_Action (Table.States (1276), 95, Reduce, (131, 3), 1);
+ Add_Action (Table.States (1276), 96, (197, 0), 283);
+ Add_Action (Table.States (1276), 97, Reduce, (234, 3), 1);
+ Add_Action (Table.States (1276), 106, Reduce, (234, 3), 1);
+ Add_Action (Table.States (1276), 107, Reduce, (234, 3), 1);
+ Add_Action (Table.States (1276), 109, Reduce, (234, 3), 1);
+ Add_Action (Table.States (1276), 111, Reduce, (234, 3), 1);
+ Add_Action (Table.States (1276), 112, Reduce, (234, 3), 1);
+ Add_Action (Table.States (1276), 113, (121, 0), 285);
+ Add_Action (Table.States (1276), 114, (121, 1), 286);
+ Table.States (1276).Goto_List.Set_Capacity (8);
+ Add_Goto (Table.States (1276), 121, 638);
+ Add_Goto (Table.States (1276), 132, 639);
+ Add_Goto (Table.States (1276), 133, 640);
+ Add_Goto (Table.States (1276), 139, 641);
+ Add_Goto (Table.States (1276), 153, 642);
+ Add_Goto (Table.States (1276), 162, 643);
+ Add_Goto (Table.States (1276), 313, 289);
+ Add_Goto (Table.States (1276), 453, 644);
+ Table.States (1276).Kernel := To_Vector ((((131, 2), 195, 2,
(32767, 0), 0), ((131, 3), 195, 0, (131,
+ 3), 1), ((157, 0), 195, 2, (32767, 0), 0), ((197, 0), 195,
2, (32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((203, 0),
+ 195, 2, (32767, 0), 0), ((234, 3), 195, 0, (234, 3), 1),
((255, 0), 195, 3, (32767, 0), 0), ((311,
+ 0), 195, 3, (32767, 0), 0)));
+ Table.States (1276).Minimal_Complete_Actions := To_Vector
(((Reduce, (131, 3), 1), (Reduce, (234, 3),
+ 1)));
+ Table.States (1277).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1277), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 11), 5);
+ Table.States (1277).Kernel := To_Vector ((0 => ((135, 11), 108,
0, (135, 11), 5)));
+ Table.States (1277).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 11), 5)));
+ Table.States (1278).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1278), 61, (434, 0), 299);
+ Add_Action (Table.States (1278), 108, (135, 9), 1643);
+ Table.States (1278).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1278), 434, 1644);
+ Table.States (1278).Kernel := To_Vector ((((135, 8), 134, 3,
(32767, 0), 0), ((135, 9), 134, 1,
+ (32767, 0), 0)));
+ Table.States (1278).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 9), 108, 1643)));
+ Table.States (1279).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1279), 108, (135, 10), 1645);
+ Table.States (1279).Kernel := To_Vector ((0 => ((135, 10), 434,
1, (32767, 0), 0)));
+ Table.States (1279).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 10), 108, 1645)));
+ Table.States (1280).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1280), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (137, 0), 5);
+ Table.States (1280).Kernel := To_Vector ((0 => ((137, 0), 108,
0, (137, 0), 5)));
+ Table.States (1280).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (137, 0), 5)));
+ end Subr_48;
+ procedure Subr_49
+ is begin
+ Table.States (1281).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1281), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 43), 5);
+ Table.States (1281).Kernel := To_Vector ((0 => ((135, 43), 108,
0, (135, 43), 5)));
+ Table.States (1281).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 43), 5)));
+ Table.States (1282).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1282), 61, (434, 0), 299);
+ Add_Action (Table.States (1282), 108, (135, 41), 1646);
+ Table.States (1282).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1282), 434, 1647);
+ Table.States (1282).Kernel := To_Vector ((((135, 40), 134, 3,
(32767, 0), 0), ((135, 41), 134, 1,
+ (32767, 0), 0)));
+ Table.States (1282).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 41), 108, 1646)));
+ Table.States (1283).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1283), 108, (135, 42), 1648);
+ Table.States (1283).Kernel := To_Vector ((0 => ((135, 42), 434,
1, (32767, 0), 0)));
+ Table.States (1283).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 42), 108, 1648)));
+ Table.States (1284).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1284), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 27), 5);
+ Table.States (1284).Kernel := To_Vector ((0 => ((135, 27), 108,
0, (135, 27), 5)));
+ Table.States (1284).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 27), 5)));
+ Table.States (1285).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1285), 61, (434, 0), 299);
+ Add_Action (Table.States (1285), 108, (135, 25), 1649);
+ Table.States (1285).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1285), 434, 1650);
+ Table.States (1285).Kernel := To_Vector ((((135, 24), 134, 3,
(32767, 0), 0), ((135, 25), 134, 1,
+ (32767, 0), 0)));
+ Table.States (1285).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 25), 108, 1649)));
+ Table.States (1286).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1286), 108, (135, 26), 1651);
+ Table.States (1286).Kernel := To_Vector ((0 => ((135, 26), 434,
1, (32767, 0), 0)));
+ Table.States (1286).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 26), 108, 1651)));
+ Table.States (1287).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1287), 61, (434, 0), 299);
+ Add_Action (Table.States (1287), 94, (134, 0), 282);
+ Add_Action (Table.States (1287), 108, (135, 3), 1652);
+ Table.States (1287).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1287), 134, 1653);
+ Add_Goto (Table.States (1287), 434, 1654);
+ Table.States (1287).Kernel := To_Vector ((((135, 0), 131, 5,
(32767, 0), 0), ((135, 1), 131, 3,
+ (32767, 0), 0), ((135, 2), 131, 3, (32767, 0), 0), ((135, 3),
131, 1, (32767, 0), 0)));
+ Table.States (1287).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 3), 108, 1652)));
+ Table.States (1288).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1288), 61, (434, 0), 299);
+ Add_Action (Table.States (1288), 94, (134, 0), 282);
+ Add_Action (Table.States (1288), 108, (135, 35), 1655);
+ Table.States (1288).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1288), 134, 1656);
+ Add_Goto (Table.States (1288), 434, 1657);
+ Table.States (1288).Kernel := To_Vector ((((135, 32), 154, 5,
(32767, 0), 0), ((135, 33), 154, 3,
+ (32767, 0), 0), ((135, 34), 154, 3, (32767, 0), 0), ((135,
35), 154, 1, (32767, 0), 0)));
+ Table.States (1288).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 35), 108, 1655)));
+ Table.States (1289).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1289), 61, (434, 0), 299);
+ Add_Action (Table.States (1289), 94, (134, 0), 282);
+ Add_Action (Table.States (1289), 108, (135, 19), 1658);
+ Table.States (1289).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1289), 134, 1659);
+ Add_Goto (Table.States (1289), 434, 1660);
+ Table.States (1289).Kernel := To_Vector ((((135, 16), 188, 5,
(32767, 0), 0), ((135, 17), 188, 3,
+ (32767, 0), 0), ((135, 18), 188, 3, (32767, 0), 0), ((135,
19), 188, 1, (32767, 0), 0)));
+ Table.States (1289).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 19), 108, 1658)));
+ Table.States (1290).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1290), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 7), 5);
+ Table.States (1290).Kernel := To_Vector ((0 => ((135, 7), 108,
0, (135, 7), 5)));
+ Table.States (1290).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 7), 5)));
+ Table.States (1291).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1291), 61, (434, 0), 299);
+ Add_Action (Table.States (1291), 108, (135, 5), 1661);
+ Table.States (1291).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1291), 434, 1662);
+ Table.States (1291).Kernel := To_Vector ((((135, 4), 134, 3,
(32767, 0), 0), ((135, 5), 134, 1,
+ (32767, 0), 0)));
+ Table.States (1291).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 5), 108, 1661)));
+ Table.States (1292).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1292), 108, (135, 6), 1663);
+ Table.States (1292).Kernel := To_Vector ((0 => ((135, 6), 434,
1, (32767, 0), 0)));
+ Table.States (1292).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 6), 108, 1663)));
+ Table.States (1293).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1293), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 39), 5);
+ Table.States (1293).Kernel := To_Vector ((0 => ((135, 39), 108,
0, (135, 39), 5)));
+ Table.States (1293).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 39), 5)));
+ Table.States (1294).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1294), 61, (434, 0), 299);
+ Add_Action (Table.States (1294), 108, (135, 37), 1664);
+ Table.States (1294).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1294), 434, 1665);
+ Table.States (1294).Kernel := To_Vector ((((135, 36), 134, 3,
(32767, 0), 0), ((135, 37), 134, 1,
+ (32767, 0), 0)));
+ Table.States (1294).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 37), 108, 1664)));
+ Table.States (1295).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1295), 108, (135, 38), 1666);
+ Table.States (1295).Kernel := To_Vector ((0 => ((135, 38), 434,
1, (32767, 0), 0)));
+ Table.States (1295).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 38), 108, 1666)));
+ Table.States (1296).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1296), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 23), 5);
+ Table.States (1296).Kernel := To_Vector ((0 => ((135, 23), 108,
0, (135, 23), 5)));
+ Table.States (1296).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 23), 5)));
+ Table.States (1297).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1297), 61, (434, 0), 299);
+ Add_Action (Table.States (1297), 108, (135, 21), 1667);
+ Table.States (1297).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1297), 434, 1668);
+ Table.States (1297).Kernel := To_Vector ((((135, 20), 134, 3,
(32767, 0), 0), ((135, 21), 134, 1,
+ (32767, 0), 0)));
+ Table.States (1297).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 21), 108, 1667)));
+ Table.States (1298).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1298), 108, (135, 22), 1669);
+ Table.States (1298).Kernel := To_Vector ((0 => ((135, 22), 434,
1, (32767, 0), 0)));
+ Table.States (1298).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 22), 108, 1669)));
+ Table.States (1299).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1299), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 13), 5);
+ Table.States (1299).Kernel := To_Vector ((0 => ((135, 13), 108,
0, (135, 13), 5)));
+ Table.States (1299).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 13), 5)));
+ Table.States (1300).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1300), 108, (135, 12), 1670);
+ Table.States (1300).Kernel := To_Vector ((0 => ((135, 12), 434,
1, (32767, 0), 0)));
+ Table.States (1300).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 12), 108, 1670)));
+ Table.States (1301).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1301), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 14), 5);
+ Table.States (1301).Kernel := To_Vector ((0 => ((135, 14), 108,
0, (135, 14), 5)));
+ Table.States (1301).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 14), 5)));
+ Table.States (1302).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1302), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 45), 5);
+ Table.States (1302).Kernel := To_Vector ((0 => ((135, 45), 108,
0, (135, 45), 5)));
+ Table.States (1302).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 45), 5)));
+ Table.States (1303).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1303), 108, (135, 44), 1671);
+ Table.States (1303).Kernel := To_Vector ((0 => ((135, 44), 434,
1, (32767, 0), 0)));
+ Table.States (1303).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 44), 108, 1671)));
+ Table.States (1304).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1304), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 46), 5);
+ Table.States (1304).Kernel := To_Vector ((0 => ((135, 46), 108,
0, (135, 46), 5)));
+ Table.States (1304).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 46), 5)));
+ Table.States (1305).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1305), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 29), 5);
+ Table.States (1305).Kernel := To_Vector ((0 => ((135, 29), 108,
0, (135, 29), 5)));
+ Table.States (1305).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 29), 5)));
+ Table.States (1306).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1306), 108, (135, 28), 1672);
+ Table.States (1306).Kernel := To_Vector ((0 => ((135, 28), 434,
1, (32767, 0), 0)));
+ Table.States (1306).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 28), 108, 1672)));
+ Table.States (1307).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1307), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 30), 5);
+ Table.States (1307).Kernel := To_Vector ((0 => ((135, 30), 108,
0, (135, 30), 5)));
+ Table.States (1307).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 30), 5)));
+ Table.States (1308).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1308), (87, 95), (312, 1), 3);
+ Table.States (1308).Kernel := To_Vector ((0 => ((312, 1), 315,
0, (312, 1), 3)));
+ Table.States (1308).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (312, 1), 3)));
+ Table.States (1309).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1309), 85, (198, 0), 281);
+ Add_Action (Table.States (1309), 95, (254, 0), 1673);
+ Add_Action (Table.States (1309), 96, (197, 0), 283);
+ Add_Action (Table.States (1309), 113, (121, 0), 285);
+ Add_Action (Table.States (1309), 114, (121, 1), 286);
+ Table.States (1309).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1309), 121, 287);
+ Add_Goto (Table.States (1309), 313, 289);
+ Table.States (1309).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((254, 0),
+ 195, 2, (32767, 0), 0), ((255, 0), 195, 3, (32767, 0), 0),
((311, 0), 195, 3, (32767, 0), 0)));
+ Table.States (1310).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1310), 87, (253, 0), 1674);
+ Table.States (1310).Kernel := To_Vector ((0 => ((253, 0), 254,
1, (32767, 0), 0)));
+ Table.States (1310).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (253, 0), 87, 1674)));
+ Table.States (1311).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1311), 108, Reduce, (284, 1), 0);
+ Add_Action (Table.States (1311), 116, (284, 0), 1312);
+ Table.States (1311).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1311), 284, 1675);
+ Table.States (1311).Kernel := To_Vector ((0 => ((275, 1), 36, 1,
(32767, 0), 0)));
+ Table.States (1311).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (284, 1), 0)));
+ Table.States (1312).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1312), (1 => 108), (284, 0), 1);
+ Table.States (1312).Kernel := To_Vector ((0 => ((284, 0), 116,
0, (284, 0), 1)));
+ Table.States (1312).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (284, 0), 1)));
+ Table.States (1313).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1313), 108, (286, 1), 1676);
+ Table.States (1313).Kernel := To_Vector ((0 => ((286, 1), 284,
1, (32767, 0), 0)));
+ Table.States (1313).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (286, 1), 108, 1676)));
+ Table.States (1314).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1314), 66, (286, 0), 1677);
+ Table.States (1314).Kernel := To_Vector ((0 => ((286, 0), 396,
2, (32767, 0), 0)));
+ Table.States (1314).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (286, 0), 66, 1677)));
+ Table.States (1315).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1315), 36, (275, 0), 1678);
+ Table.States (1315).Kernel := To_Vector ((0 => ((275, 0), 66, 2,
(32767, 0), 0)));
+ Table.States (1315).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (275, 0), 36, 1678)));
+ Table.States (1316).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1316), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (338, 2), 5);
+ Table.States (1316).Kernel := To_Vector ((0 => ((338, 2), 108,
0, (338, 2), 5)));
+ Table.States (1316).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (338, 2), 5)));
+ Table.States (1317).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1317), (63, 82, 95, 99, 108), (435, 0),
3);
+ Table.States (1317).Kernel := To_Vector ((0 => ((435, 0), 116,
0, (435, 0), 3)));
+ Table.States (1317).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (435, 0), 3)));
+ Table.States (1318).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1318), (63, 82, 95, 108), (433, 1), 3);
+ Table.States (1318).Kernel := To_Vector ((0 => ((433, 1), 432,
0, (433, 1), 3)));
+ Table.States (1318).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (433, 1), 3)));
+ Table.States (1319).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1319), 29, (305, 2), 1320);
+ Add_Action (Table.States (1319), 47, (305, 0), 1322);
+ Table.States (1319).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1319), 305, 1679);
+ Table.States (1319).Kernel := To_Vector ((0 => ((447, 0), 25, 1,
(32767, 0), 0)));
+ Table.States (1319).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (305, 0), 47, 1322)));
+ Table.States (1320).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1320), (55, 58, 86, 90, 116, 117, 118),
(305, 2), 1);
+ Table.States (1320).Kernel := To_Vector ((0 => ((305, 2), 29, 0,
(305, 2), 1)));
+ Table.States (1320).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (305, 2), 1)));
+ Table.States (1321).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1321), 86, (252, 0), 33);
+ Add_Action (Table.States (1321), 90, (268, 0), 34);
+ Add_Action (Table.States (1321), 116, (196, 0), 146);
+ Add_Action (Table.States (1321), 117, (196, 1), 37);
+ Add_Action (Table.States (1321), 118, (195, 6), 38);
+ Table.States (1321).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1321), 195, 1680);
+ Add_Goto (Table.States (1321), 196, 148);
+ Add_Goto (Table.States (1321), 197, 54);
+ Add_Goto (Table.States (1321), 198, 55);
+ Add_Goto (Table.States (1321), 199, 56);
+ Add_Goto (Table.States (1321), 201, 57);
+ Add_Goto (Table.States (1321), 251, 58);
+ Add_Goto (Table.States (1321), 252, 59);
+ Add_Goto (Table.States (1321), 255, 60);
+ Add_Goto (Table.States (1321), 268, 68);
+ Add_Goto (Table.States (1321), 311, 83);
+ Add_Goto (Table.States (1321), 452, 1681);
+ Table.States (1321).Kernel := To_Vector ((0 => ((445, 1), 33, 4,
(32767, 0), 0)));
+ Table.States (1321).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1322).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1322), 29, (305, 1), 1682);
+ Add_Action (Table.States (1322), 55, Reduce, (305, 0), 1);
+ Add_Action (Table.States (1322), 58, Reduce, (305, 0), 1);
+ Add_Action (Table.States (1322), 86, Reduce, (305, 0), 1);
+ Add_Action (Table.States (1322), 90, Reduce, (305, 0), 1);
+ Add_Action (Table.States (1322), 116, Reduce, (305, 0), 1);
+ Add_Action (Table.States (1322), 117, Reduce, (305, 0), 1);
+ Add_Action (Table.States (1322), 118, Reduce, (305, 0), 1);
+ Table.States (1322).Kernel := To_Vector ((((305, 0), 47, 0,
(305, 0), 1), ((305, 1), 47, 1, (32767,
+ 0), 0)));
+ Table.States (1322).Minimal_Complete_Actions := To_Vector
(((Reduce, (305, 0), 1), (Shift, (305, 1), 29,
+ 1682)));
+ Table.States (1323).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1323), 55, (450, 1), 1683);
+ Add_Action (Table.States (1323), 65, (450, 0), 1684);
+ Add_Action (Table.States (1323), 86, (252, 0), 33);
+ Add_Action (Table.States (1323), 90, (268, 0), 34);
+ Add_Action (Table.States (1323), 116, (196, 0), 146);
+ Add_Action (Table.States (1323), 117, (196, 1), 37);
+ Add_Action (Table.States (1323), 118, (195, 6), 38);
+ Table.States (1323).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (1323), 195, 1685);
+ Add_Goto (Table.States (1323), 196, 148);
+ Add_Goto (Table.States (1323), 197, 54);
+ Add_Goto (Table.States (1323), 198, 55);
+ Add_Goto (Table.States (1323), 199, 56);
+ Add_Goto (Table.States (1323), 201, 57);
+ Add_Goto (Table.States (1323), 251, 58);
+ Add_Goto (Table.States (1323), 252, 59);
+ Add_Goto (Table.States (1323), 255, 60);
+ Add_Goto (Table.States (1323), 268, 68);
+ Add_Goto (Table.States (1323), 311, 83);
+ Add_Goto (Table.States (1323), 448, 1686);
+ Add_Goto (Table.States (1323), 450, 1687);
+ Table.States (1323).Kernel := To_Vector ((0 => ((445, 0), 50, 1,
(32767, 0), 0)));
+ Table.States (1323).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (450, 0), 65, 1684)));
+ Table.States (1324).Action_List.Set_Capacity (24);
+ Add_Action (Table.States (1324), 12, (402, 0), 165);
+ Add_Action (Table.States (1324), 25, (447, 0), 1319);
+ Add_Action (Table.States (1324), 29, (305, 2), 1320);
+ Add_Action (Table.States (1324), 33, (446, 1), 1688);
+ Add_Action (Table.States (1324), 39, (249, 0), 353);
+ Add_Action (Table.States (1324), 42, (242, 0), 354);
+ Add_Action (Table.States (1324), 46, (233, 2), 167);
+ Add_Action (Table.States (1324), 47, (305, 0), 1322);
+ Add_Action (Table.States (1324), 50, (446, 0), 1689);
+ Add_Action (Table.States (1324), 51, (221, 0), 355);
+ Add_Action (Table.States (1324), 52, (187, 0), 356);
+ Add_Action (Table.States (1324), 62, (178, 3), 357);
+ Add_Action (Table.States (1324), 64, (245, 0), 358);
+ Add_Action (Table.States (1324), 65, (207, 1), 359);
+ Add_Action (Table.States (1324), 76, (256, 0), 170);
+ Add_Action (Table.States (1324), 85, (205, 4), 171);
+ Add_Action (Table.States (1324), 86, (213, 2), 172);
+ Add_Action (Table.States (1324), 90, (268, 0), 34);
+ Add_Action (Table.States (1324), 106, (237, 1), 173);
+ Add_Action (Table.States (1324), 107, (237, 0), 174);
+ Add_Action (Table.States (1324), 115, (234, 0), 175);
+ Add_Action (Table.States (1324), 116, (196, 0), 146);
+ Add_Action (Table.States (1324), 117, (196, 1), 37);
+ Add_Action (Table.States (1324), 118, (195, 6), 360);
+ Table.States (1324).Goto_List.Set_Capacity (57);
+ Add_Goto (Table.States (1324), 131, 361);
+ Add_Goto (Table.States (1324), 140, 362);
+ Add_Goto (Table.States (1324), 177, 363);
+ Add_Goto (Table.States (1324), 178, 364);
+ Add_Goto (Table.States (1324), 187, 365);
+ Add_Goto (Table.States (1324), 195, 366);
+ Add_Goto (Table.States (1324), 196, 367);
+ Add_Goto (Table.States (1324), 197, 54);
+ Add_Goto (Table.States (1324), 198, 55);
+ Add_Goto (Table.States (1324), 199, 56);
+ Add_Goto (Table.States (1324), 200, 368);
+ Add_Goto (Table.States (1324), 201, 57);
+ Add_Goto (Table.States (1324), 203, 369);
+ Add_Goto (Table.States (1324), 205, 177);
+ Add_Goto (Table.States (1324), 206, 178);
+ Add_Goto (Table.States (1324), 207, 370);
+ Add_Goto (Table.States (1324), 208, 371);
+ Add_Goto (Table.States (1324), 209, 372);
+ Add_Goto (Table.States (1324), 210, 179);
+ Add_Goto (Table.States (1324), 211, 180);
+ Add_Goto (Table.States (1324), 212, 373);
+ Add_Goto (Table.States (1324), 213, 181);
+ Add_Goto (Table.States (1324), 214, 182);
+ Add_Goto (Table.States (1324), 215, 183);
+ Add_Goto (Table.States (1324), 216, 374);
+ Add_Goto (Table.States (1324), 217, 375);
+ Add_Goto (Table.States (1324), 218, 184);
+ Add_Goto (Table.States (1324), 219, 185);
+ Add_Goto (Table.States (1324), 220, 186);
+ Add_Goto (Table.States (1324), 221, 376);
+ Add_Goto (Table.States (1324), 227, 377);
+ Add_Goto (Table.States (1324), 228, 188);
+ Add_Goto (Table.States (1324), 231, 378);
+ Add_Goto (Table.States (1324), 232, 190);
+ Add_Goto (Table.States (1324), 233, 191);
+ Add_Goto (Table.States (1324), 234, 192);
+ Add_Goto (Table.States (1324), 237, 193);
+ Add_Goto (Table.States (1324), 239, 379);
+ Add_Goto (Table.States (1324), 242, 380);
+ Add_Goto (Table.States (1324), 245, 381);
+ Add_Goto (Table.States (1324), 247, 382);
+ Add_Goto (Table.States (1324), 249, 383);
+ Add_Goto (Table.States (1324), 251, 58);
+ Add_Goto (Table.States (1324), 252, 59);
+ Add_Goto (Table.States (1324), 255, 60);
+ Add_Goto (Table.States (1324), 256, 194);
+ Add_Goto (Table.States (1324), 268, 68);
+ Add_Goto (Table.States (1324), 303, 1690);
+ Add_Goto (Table.States (1324), 304, 1691);
+ Add_Goto (Table.States (1324), 305, 1328);
+ Add_Goto (Table.States (1324), 311, 83);
+ Add_Goto (Table.States (1324), 402, 195);
+ Add_Goto (Table.States (1324), 446, 1692);
+ Add_Goto (Table.States (1324), 447, 1331);
+ Add_Goto (Table.States (1324), 459, 384);
+ Add_Goto (Table.States (1324), 463, 1693);
+ Add_Goto (Table.States (1324), 465, 196);
+ Table.States (1324).Kernel := To_Vector ((((205, 4), 85, 5,
(32767, 0), 0), ((205, 5), 85, 8, (32767,
+ 0), 0), ((205, 6), 85, 4, (32767, 0), 0), ((206, 0), 85, 3,
(32767, 0), 0), ((210, 0), 85, 5,
+ (32767, 0), 0), ((213, 0), 85, 2, (32767, 0), 0), ((213, 1),
85, 6, (32767, 0), 0), ((215, 0), 85,
+ 4, (32767, 0), 0), ((219, 0), 85, 6, (32767, 0), 0), ((220,
0), 85, 7, (32767, 0), 0), ((302, 1),
+ 85, 3, (32767, 0), 0)));
+ Table.States (1324).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (1325).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1325), (63, 82, 95, 108), (436, 0), 1);
+ Table.States (1325).Kernel := To_Vector ((0 => ((436, 0), 227,
0, (436, 0), 1)));
+ Table.States (1325).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (436, 0), 1)));
+ Table.States (1326).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1326), (63, 82, 95, 108), (436, 1), 1);
+ Table.States (1326).Kernel := To_Vector ((0 => ((436, 1), 302,
0, (436, 1), 1)));
+ Table.States (1326).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (436, 1), 1)));
+ Table.States (1327).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1327), 55, (307, 0), 1694);
+ Add_Action (Table.States (1327), 58, (307, 1), 1695);
+ Add_Action (Table.States (1327), 86, (252, 0), 33);
+ Add_Action (Table.States (1327), 90, (268, 0), 34);
+ Add_Action (Table.States (1327), 116, (196, 0), 146);
+ Add_Action (Table.States (1327), 117, (196, 1), 37);
+ Add_Action (Table.States (1327), 118, (195, 6), 38);
+ Table.States (1327).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1327), 195, 1696);
+ Add_Goto (Table.States (1327), 196, 148);
+ Add_Goto (Table.States (1327), 197, 54);
+ Add_Goto (Table.States (1327), 198, 55);
+ Add_Goto (Table.States (1327), 199, 56);
+ Add_Goto (Table.States (1327), 201, 57);
+ Add_Goto (Table.States (1327), 251, 58);
+ Add_Goto (Table.States (1327), 252, 59);
+ Add_Goto (Table.States (1327), 255, 60);
+ Add_Goto (Table.States (1327), 268, 68);
+ Add_Goto (Table.States (1327), 307, 1697);
+ Add_Goto (Table.States (1327), 311, 83);
+ Table.States (1327).Kernel := To_Vector ((0 => ((302, 0), 304,
1, (32767, 0), 0)));
+ Table.States (1327).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (307, 0), 55, 1694)));
+ end Subr_49;
+ procedure Subr_50
+ is begin
+ Table.States (1328).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1328), (55, 58, 86, 90, 116, 117, 118),
(304, 0), 1);
+ Table.States (1328).Kernel := To_Vector ((0 => ((304, 0), 305,
0, (304, 0), 1)));
+ Table.States (1328).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (304, 0), 1)));
+ Table.States (1329).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1329), (63, 82, 95, 108), (432, 0), 3);
+ Table.States (1329).Kernel := To_Vector ((0 => ((432, 0), 436,
0, (432, 0), 3)));
+ Table.States (1329).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (432, 0), 3)));
+ Table.States (1330).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1330), (63, 82, 95, 108), (302, 2), 1);
+ Table.States (1330).Kernel := To_Vector ((0 => ((302, 2), 445,
0, (302, 2), 1)));
+ Table.States (1330).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (302, 2), 1)));
+ Table.States (1331).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1331), (55, 58, 86, 90, 116, 117, 118),
(304, 1), 1);
+ Table.States (1331).Kernel := To_Vector ((0 => ((304, 1), 447,
0, (304, 1), 1)));
+ Table.States (1331).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (304, 1), 1)));
+ Table.States (1332).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1332), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (389, 2), 5);
+ Table.States (1332).Kernel := To_Vector ((0 => ((389, 2), 108,
0, (389, 2), 5)));
+ Table.States (1332).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (389, 2), 5)));
+ Table.States (1333).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1333), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (180, 2), 5);
+ Table.States (1333).Kernel := To_Vector ((0 => ((180, 2), 108,
0, (180, 2), 5)));
+ Table.States (1333).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (180, 2), 5)));
+ Table.States (1334).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1334), 66, (309, 3), 1698);
+ Table.States (1334).Kernel := To_Vector ((0 => ((309, 3), 396,
2, (32767, 0), 0)));
+ Table.States (1334).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (309, 3), 66, 1698)));
+ Table.States (1335).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (1335), 12, (401, 0), 1);
+ Add_Action (Table.States (1335), 15, (370, 0), 3);
+ Add_Action (Table.States (1335), 17, (365, 0), 4);
+ Add_Action (Table.States (1335), 18, (382, 0), 5);
+ Add_Action (Table.States (1335), 19, (363, 0), 6);
+ Add_Action (Table.States (1335), 20, (357, 0), 7);
+ Add_Action (Table.States (1335), 30, (316, 0), 13);
+ Add_Action (Table.States (1335), 31, (290, 0), 14);
+ Add_Action (Table.States (1335), 32, (289, 0), 15);
+ Add_Action (Table.States (1335), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1335), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1335), 37, (288, 0), 17);
+ Add_Conflict (Table.States (1335), 37, (285, 1), 0);
+ Add_Action (Table.States (1335), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1335), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1335), 42, (271, 0), 18);
+ Add_Action (Table.States (1335), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1335), 64, (273, 0), 27);
+ Add_Action (Table.States (1335), 65, (264, 0), 28);
+ Add_Action (Table.States (1335), 84, (124, 0), 32);
+ Add_Action (Table.States (1335), 86, (252, 0), 33);
+ Add_Action (Table.States (1335), 90, (268, 0), 34);
+ Add_Action (Table.States (1335), 105, (265, 0), 35);
+ Add_Action (Table.States (1335), 116, (196, 0), 146);
+ Add_Action (Table.States (1335), 117, (196, 1), 37);
+ Add_Action (Table.States (1335), 118, (195, 6), 38);
+ Table.States (1335).Goto_List.Set_Capacity (46);
+ Add_Goto (Table.States (1335), 124, 39);
+ Add_Goto (Table.States (1335), 195, 52);
+ Add_Goto (Table.States (1335), 196, 53);
+ Add_Goto (Table.States (1335), 197, 54);
+ Add_Goto (Table.States (1335), 198, 55);
+ Add_Goto (Table.States (1335), 199, 56);
+ Add_Goto (Table.States (1335), 201, 57);
+ Add_Goto (Table.States (1335), 251, 58);
+ Add_Goto (Table.States (1335), 252, 59);
+ Add_Goto (Table.States (1335), 255, 60);
+ Add_Goto (Table.States (1335), 259, 452);
+ Add_Goto (Table.States (1335), 261, 331);
+ Add_Goto (Table.States (1335), 262, 62);
+ Add_Goto (Table.States (1335), 263, 63);
+ Add_Goto (Table.States (1335), 264, 64);
+ Add_Goto (Table.States (1335), 265, 65);
+ Add_Goto (Table.States (1335), 266, 66);
+ Add_Goto (Table.States (1335), 267, 67);
+ Add_Goto (Table.States (1335), 268, 68);
+ Add_Goto (Table.States (1335), 271, 69);
+ Add_Goto (Table.States (1335), 273, 70);
+ Add_Goto (Table.States (1335), 275, 71);
+ Add_Goto (Table.States (1335), 285, 72);
+ Add_Goto (Table.States (1335), 286, 73);
+ Add_Goto (Table.States (1335), 288, 74);
+ Add_Goto (Table.States (1335), 289, 75);
+ Add_Goto (Table.States (1335), 290, 76);
+ Add_Goto (Table.States (1335), 310, 82);
+ Add_Goto (Table.States (1335), 311, 83);
+ Add_Goto (Table.States (1335), 316, 84);
+ Add_Goto (Table.States (1335), 318, 85);
+ Add_Goto (Table.States (1335), 357, 110);
+ Add_Goto (Table.States (1335), 363, 111);
+ Add_Goto (Table.States (1335), 364, 112);
+ Add_Goto (Table.States (1335), 365, 113);
+ Add_Goto (Table.States (1335), 366, 114);
+ Add_Goto (Table.States (1335), 367, 115);
+ Add_Goto (Table.States (1335), 370, 116);
+ Add_Goto (Table.States (1335), 376, 117);
+ Add_Goto (Table.States (1335), 378, 118);
+ Add_Goto (Table.States (1335), 379, 119);
+ Add_Goto (Table.States (1335), 382, 120);
+ Add_Goto (Table.States (1335), 396, 1699);
+ Add_Goto (Table.States (1335), 401, 133);
+ Add_Goto (Table.States (1335), 461, 332);
+ Add_Goto (Table.States (1335), 462, 144);
+ Table.States (1335).Kernel := To_Vector ((0 => ((309, 2), 38, 4,
(32767, 0), 0)));
+ Table.States (1335).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ Table.States (1336).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1336), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (320, 2), 5);
+ Table.States (1336).Kernel := To_Vector ((0 => ((320, 2), 108,
0, (320, 2), 5)));
+ Table.States (1336).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (320, 2), 5)));
+ Table.States (1337).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1337), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (321, 2), 5);
+ Table.States (1337).Kernel := To_Vector ((0 => ((321, 2), 108,
0, (321, 2), 5)));
+ Table.States (1337).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (321, 2), 5)));
+ Table.States (1338).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1338), 87, (356, 0), 1700);
+ Table.States (1338).Kernel := To_Vector ((((356, 0), 160, 4,
(32767, 0), 0), ((356, 1), 160, 2,
+ (32767, 0), 0)));
+ Table.States (1338).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (356, 0), 87, 1700)));
+ Table.States (1339).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1339), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (356, 3), 5);
+ Table.States (1339).Kernel := To_Vector ((0 => ((356, 3), 108,
0, (356, 3), 5)));
+ Table.States (1339).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (356, 3), 5)));
+ Table.States (1340).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1340), 108, (356, 2), 1701);
+ Table.States (1340).Kernel := To_Vector ((0 => ((356, 2), 434,
1, (32767, 0), 0)));
+ Table.States (1340).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (356, 2), 108, 1701)));
+ Table.States (1341).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1341), 86, (252, 0), 33);
+ Add_Action (Table.States (1341), 90, (268, 0), 34);
+ Add_Action (Table.States (1341), 116, (196, 0), 146);
+ Add_Action (Table.States (1341), 117, (196, 1), 37);
+ Add_Action (Table.States (1341), 118, (195, 6), 38);
+ Table.States (1341).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (1341), 195, 1702);
+ Add_Goto (Table.States (1341), 196, 148);
+ Add_Goto (Table.States (1341), 197, 54);
+ Add_Goto (Table.States (1341), 198, 55);
+ Add_Goto (Table.States (1341), 199, 56);
+ Add_Goto (Table.States (1341), 201, 57);
+ Add_Goto (Table.States (1341), 251, 58);
+ Add_Goto (Table.States (1341), 252, 59);
+ Add_Goto (Table.States (1341), 255, 60);
+ Add_Goto (Table.States (1341), 268, 68);
+ Add_Goto (Table.States (1341), 311, 83);
+ Table.States (1341).Kernel := To_Vector ((((408, 6), 76, 4,
(32767, 0), 0), ((408, 7), 76, 2, (32767,
+ 0), 0)));
+ Table.States (1341).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1342).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1342), 86, (252, 0), 33);
+ Add_Action (Table.States (1342), 90, (268, 0), 34);
+ Add_Action (Table.States (1342), 116, (196, 0), 146);
+ Add_Action (Table.States (1342), 117, (196, 1), 37);
+ Add_Action (Table.States (1342), 118, (195, 6), 38);
+ Table.States (1342).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (1342), 195, 1703);
+ Add_Goto (Table.States (1342), 196, 148);
+ Add_Goto (Table.States (1342), 197, 54);
+ Add_Goto (Table.States (1342), 198, 55);
+ Add_Goto (Table.States (1342), 199, 56);
+ Add_Goto (Table.States (1342), 201, 57);
+ Add_Goto (Table.States (1342), 251, 58);
+ Add_Goto (Table.States (1342), 252, 59);
+ Add_Goto (Table.States (1342), 255, 60);
+ Add_Goto (Table.States (1342), 268, 68);
+ Add_Goto (Table.States (1342), 311, 83);
+ Table.States (1342).Kernel := To_Vector ((((408, 2), 76, 4,
(32767, 0), 0), ((408, 3), 76, 2, (32767,
+ 0), 0)));
+ Table.States (1342).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1343).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1343), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (338, 1), 5);
+ Table.States (1343).Kernel := To_Vector ((0 => ((338, 1), 108,
0, (338, 1), 5)));
+ Table.States (1343).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (338, 1), 5)));
+ Table.States (1344).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1344), 108, (338, 0), 1704);
+ Table.States (1344).Kernel := To_Vector ((0 => ((338, 0), 434,
1, (32767, 0), 0)));
+ Table.States (1344).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (338, 0), 108, 1704)));
+ Table.States (1345).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1345), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (389, 1), 5);
+ Table.States (1345).Kernel := To_Vector ((0 => ((389, 1), 108,
0, (389, 1), 5)));
+ Table.States (1345).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (389, 1), 5)));
+ Table.States (1346).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1346), 108, (389, 0), 1705);
+ Table.States (1346).Kernel := To_Vector ((0 => ((389, 0), 434,
1, (32767, 0), 0)));
+ Table.States (1346).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (389, 0), 108, 1705)));
+ Table.States (1347).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1347), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (180, 1), 5);
+ Table.States (1347).Kernel := To_Vector ((0 => ((180, 1), 108,
0, (180, 1), 5)));
+ Table.States (1347).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (180, 1), 5)));
+ Table.States (1348).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1348), 108, (180, 0), 1706);
+ Table.States (1348).Kernel := To_Vector ((0 => ((180, 0), 434,
1, (32767, 0), 0)));
+ Table.States (1348).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (180, 0), 108, 1706)));
+ Table.States (1349).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (1349), 12, (401, 0), 1);
+ Add_Action (Table.States (1349), 15, (370, 0), 3);
+ Add_Action (Table.States (1349), 17, (365, 0), 4);
+ Add_Action (Table.States (1349), 18, (382, 0), 5);
+ Add_Action (Table.States (1349), 19, (363, 0), 6);
+ Add_Action (Table.States (1349), 20, (357, 0), 7);
+ Add_Action (Table.States (1349), 30, (316, 0), 13);
+ Add_Action (Table.States (1349), 31, (290, 0), 14);
+ Add_Action (Table.States (1349), 32, (289, 0), 15);
+ Add_Action (Table.States (1349), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1349), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1349), 37, (288, 0), 17);
+ Add_Conflict (Table.States (1349), 37, (285, 1), 0);
+ Add_Action (Table.States (1349), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1349), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1349), 42, (271, 0), 18);
+ Add_Action (Table.States (1349), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1349), 64, (273, 0), 27);
+ Add_Action (Table.States (1349), 65, (264, 0), 28);
+ Add_Action (Table.States (1349), 84, (124, 0), 32);
+ Add_Action (Table.States (1349), 86, (252, 0), 33);
+ Add_Action (Table.States (1349), 90, (268, 0), 34);
+ Add_Action (Table.States (1349), 105, (265, 0), 35);
+ Add_Action (Table.States (1349), 116, (196, 0), 146);
+ Add_Action (Table.States (1349), 117, (196, 1), 37);
+ Add_Action (Table.States (1349), 118, (195, 6), 38);
+ Table.States (1349).Goto_List.Set_Capacity (46);
+ Add_Goto (Table.States (1349), 124, 39);
+ Add_Goto (Table.States (1349), 195, 52);
+ Add_Goto (Table.States (1349), 196, 53);
+ Add_Goto (Table.States (1349), 197, 54);
+ Add_Goto (Table.States (1349), 198, 55);
+ Add_Goto (Table.States (1349), 199, 56);
+ Add_Goto (Table.States (1349), 201, 57);
+ Add_Goto (Table.States (1349), 251, 58);
+ Add_Goto (Table.States (1349), 252, 59);
+ Add_Goto (Table.States (1349), 255, 60);
+ Add_Goto (Table.States (1349), 259, 452);
+ Add_Goto (Table.States (1349), 261, 331);
+ Add_Goto (Table.States (1349), 262, 62);
+ Add_Goto (Table.States (1349), 263, 63);
+ Add_Goto (Table.States (1349), 264, 64);
+ Add_Goto (Table.States (1349), 265, 65);
+ Add_Goto (Table.States (1349), 266, 66);
+ Add_Goto (Table.States (1349), 267, 67);
+ Add_Goto (Table.States (1349), 268, 68);
+ Add_Goto (Table.States (1349), 271, 69);
+ Add_Goto (Table.States (1349), 273, 70);
+ Add_Goto (Table.States (1349), 275, 71);
+ Add_Goto (Table.States (1349), 285, 72);
+ Add_Goto (Table.States (1349), 286, 73);
+ Add_Goto (Table.States (1349), 288, 74);
+ Add_Goto (Table.States (1349), 289, 75);
+ Add_Goto (Table.States (1349), 290, 76);
+ Add_Goto (Table.States (1349), 310, 82);
+ Add_Goto (Table.States (1349), 311, 83);
+ Add_Goto (Table.States (1349), 316, 84);
+ Add_Goto (Table.States (1349), 318, 85);
+ Add_Goto (Table.States (1349), 357, 110);
+ Add_Goto (Table.States (1349), 363, 111);
+ Add_Goto (Table.States (1349), 364, 112);
+ Add_Goto (Table.States (1349), 365, 113);
+ Add_Goto (Table.States (1349), 366, 114);
+ Add_Goto (Table.States (1349), 367, 115);
+ Add_Goto (Table.States (1349), 370, 116);
+ Add_Goto (Table.States (1349), 376, 117);
+ Add_Goto (Table.States (1349), 378, 118);
+ Add_Goto (Table.States (1349), 379, 119);
+ Add_Goto (Table.States (1349), 382, 120);
+ Add_Goto (Table.States (1349), 396, 1707);
+ Add_Goto (Table.States (1349), 401, 133);
+ Add_Goto (Table.States (1349), 461, 332);
+ Add_Goto (Table.States (1349), 462, 144);
+ Table.States (1349).Kernel := To_Vector ((0 => ((309, 1), 38, 4,
(32767, 0), 0)));
+ Table.States (1349).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ Table.States (1350).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1350), 38, (309, 0), 1708);
+ Table.States (1350).Kernel := To_Vector ((0 => ((309, 0), 192,
5, (32767, 0), 0)));
+ Table.States (1350).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (309, 0), 38, 1708)));
+ Table.States (1351).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1351), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (320, 1), 5);
+ Table.States (1351).Kernel := To_Vector ((0 => ((320, 1), 108,
0, (320, 1), 5)));
+ Table.States (1351).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (320, 1), 5)));
+ Table.States (1352).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1352), 108, (320, 0), 1709);
+ Table.States (1352).Kernel := To_Vector ((0 => ((320, 0), 434,
1, (32767, 0), 0)));
+ Table.States (1352).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (320, 0), 108, 1709)));
+ Table.States (1353).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1353), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (321, 1), 5);
+ Table.States (1353).Kernel := To_Vector ((0 => ((321, 1), 108,
0, (321, 1), 5)));
+ Table.States (1353).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (321, 1), 5)));
+ Table.States (1354).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1354), 108, (321, 0), 1710);
+ Table.States (1354).Kernel := To_Vector ((0 => ((321, 0), 434,
1, (32767, 0), 0)));
+ Table.States (1354).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (321, 0), 108, 1710)));
+ Table.States (1355).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1355), 86, (252, 0), 33);
+ Add_Action (Table.States (1355), 90, (268, 0), 34);
+ Add_Action (Table.States (1355), 116, (196, 0), 146);
+ Add_Action (Table.States (1355), 117, (196, 1), 37);
+ Add_Action (Table.States (1355), 118, (195, 6), 38);
+ Table.States (1355).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (1355), 195, 440);
+ Add_Goto (Table.States (1355), 196, 148);
+ Add_Goto (Table.States (1355), 197, 54);
+ Add_Goto (Table.States (1355), 198, 55);
+ Add_Goto (Table.States (1355), 199, 56);
+ Add_Goto (Table.States (1355), 201, 57);
+ Add_Goto (Table.States (1355), 251, 58);
+ Add_Goto (Table.States (1355), 252, 59);
+ Add_Goto (Table.States (1355), 255, 60);
+ Add_Goto (Table.States (1355), 268, 68);
+ Add_Goto (Table.States (1355), 311, 83);
+ Table.States (1355).Kernel := To_Vector ((((326, 0), 26, 9,
(32767, 0), 0), ((326, 1), 26, 6, (32767,
+ 0), 0), ((326, 2), 26, 7, (32767, 0), 0), ((326, 3), 26, 4,
(32767, 0), 0)));
+ Table.States (1355).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1356).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1356), 116, (354, 0), 1711);
+ Table.States (1356).Kernel := To_Vector ((((354, 0), 26, 9,
(32767, 0), 0), ((354, 1), 26, 6, (32767,
+ 0), 0), ((354, 2), 26, 7, (32767, 0), 0), ((354, 3), 26, 4,
(32767, 0), 0)));
+ Table.States (1356).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (354, 0), 116, 1711)));
+ Table.States (1357).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1357), 116, (345, 0), 1712);
+ Table.States (1357).Kernel := To_Vector ((((345, 0), 26, 9,
(32767, 0), 0), ((345, 1), 26, 7, (32767,
+ 0), 0)));
+ Table.States (1357).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (345, 0), 116, 1712)));
+ Table.States (1358).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (1358), 22, (339, 0), 9);
+ Add_Action (Table.States (1358), 25, (329, 1), 10);
+ Add_Action (Table.States (1358), 28, (325, 0), 12);
+ Add_Action (Table.States (1358), 38, Reduce, (192, 1), 0);
+ Add_Action (Table.States (1358), 50, (332, 0), 19);
+ Add_Action (Table.States (1358), 51, (437, 0), 221);
+ Add_Action (Table.States (1358), 52, (329, 0), 21);
+ Add_Action (Table.States (1358), 53, (294, 0), 22);
+ Add_Action (Table.States (1358), 54, (293, 0), 23);
+ Add_Action (Table.States (1358), 59, (346, 0), 24);
+ Add_Action (Table.States (1358), 60, (340, 0), 25);
+ Add_Action (Table.States (1358), 81, (130, 0), 30);
+ Add_Action (Table.States (1358), 83, (128, 0), 31);
+ Add_Action (Table.States (1358), 84, (124, 0), 32);
+ Add_Action (Table.States (1358), 116, (136, 0), 223);
+ Table.States (1358).Goto_List.Set_Capacity (60);
+ Add_Goto (Table.States (1358), 124, 561);
+ Add_Goto (Table.States (1358), 126, 40);
+ Add_Goto (Table.States (1358), 127, 41);
+ Add_Goto (Table.States (1358), 128, 42);
+ Add_Goto (Table.States (1358), 130, 43);
+ Add_Goto (Table.States (1358), 135, 44);
+ Add_Goto (Table.States (1358), 136, 45);
+ Add_Goto (Table.States (1358), 137, 46);
+ Add_Goto (Table.States (1358), 180, 47);
+ Add_Goto (Table.States (1358), 189, 48);
+ Add_Goto (Table.States (1358), 190, 562);
+ Add_Goto (Table.States (1358), 191, 563);
+ Add_Goto (Table.States (1358), 192, 574);
+ Add_Goto (Table.States (1358), 193, 50);
+ Add_Goto (Table.States (1358), 194, 51);
+ Add_Goto (Table.States (1358), 291, 77);
+ Add_Goto (Table.States (1358), 292, 78);
+ Add_Goto (Table.States (1358), 293, 79);
+ Add_Goto (Table.States (1358), 294, 80);
+ Add_Goto (Table.States (1358), 309, 81);
+ Add_Goto (Table.States (1358), 320, 86);
+ Add_Goto (Table.States (1358), 321, 87);
+ Add_Goto (Table.States (1358), 322, 88);
+ Add_Goto (Table.States (1358), 325, 89);
+ Add_Goto (Table.States (1358), 326, 90);
+ Add_Goto (Table.States (1358), 327, 91);
+ Add_Goto (Table.States (1358), 328, 92);
+ Add_Goto (Table.States (1358), 329, 225);
+ Add_Goto (Table.States (1358), 330, 94);
+ Add_Goto (Table.States (1358), 332, 95);
+ Add_Goto (Table.States (1358), 333, 96);
+ Add_Goto (Table.States (1358), 334, 97);
+ Add_Goto (Table.States (1358), 335, 98);
+ Add_Goto (Table.States (1358), 336, 99);
+ Add_Goto (Table.States (1358), 337, 100);
+ Add_Goto (Table.States (1358), 338, 101);
+ Add_Goto (Table.States (1358), 339, 102);
+ Add_Goto (Table.States (1358), 340, 103);
+ Add_Goto (Table.States (1358), 341, 104);
+ Add_Goto (Table.States (1358), 345, 105);
+ Add_Goto (Table.States (1358), 346, 106);
+ Add_Goto (Table.States (1358), 347, 107);
+ Add_Goto (Table.States (1358), 354, 108);
+ Add_Goto (Table.States (1358), 388, 126);
+ Add_Goto (Table.States (1358), 389, 127);
+ Add_Goto (Table.States (1358), 390, 128);
+ Add_Goto (Table.States (1358), 391, 129);
+ Add_Goto (Table.States (1358), 392, 130);
+ Add_Goto (Table.States (1358), 394, 132);
+ Add_Goto (Table.States (1358), 403, 134);
+ Add_Goto (Table.States (1358), 404, 135);
+ Add_Goto (Table.States (1358), 405, 136);
+ Add_Goto (Table.States (1358), 406, 137);
+ Add_Goto (Table.States (1358), 408, 138);
+ Add_Goto (Table.States (1358), 431, 139);
+ Add_Goto (Table.States (1358), 437, 140);
+ Add_Goto (Table.States (1358), 438, 141);
+ Add_Goto (Table.States (1358), 440, 142);
+ Add_Goto (Table.States (1358), 454, 143);
+ Add_Goto (Table.States (1358), 458, 565);
+ Table.States (1358).Kernel := To_Vector ((0 => ((309, 3), 82, 5,
(32767, 0), 0)));
+ Table.States (1358).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (192, 1), 0)));
+ end Subr_50;
+ procedure Subr_51
+ is begin
+ Table.States (1359).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1359), 82, (309, 2), 575);
+ Table.States (1359).Kernel := To_Vector ((0 => ((309, 2), 434,
6, (32767, 0), 0)));
+ Table.States (1359).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (309, 2), 82, 575)));
+ Table.States (1360).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1360), 61, (434, 0), 299);
+ Add_Action (Table.States (1360), 82, (309, 1), 1713);
+ Table.States (1360).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1360), 434, 1714);
+ Table.States (1360).Kernel := To_Vector ((((309, 0), 292, 8,
(32767, 0), 0), ((309, 1), 292, 6,
+ (32767, 0), 0)));
+ Table.States (1360).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (309, 1), 82, 1713)));
+ Table.States (1361).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1361), 108, (370, 0), 1715);
+ Table.States (1361).Kernel := To_Vector ((0 => ((370, 0), 15, 1,
(32767, 0), 0)));
+ Table.States (1361).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (370, 0), 108, 1715)));
+ Table.States (1362).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1362), 108, (378, 0), 1716);
+ Table.States (1362).Kernel := To_Vector ((0 => ((378, 0), 15, 1,
(32767, 0), 0)));
+ Table.States (1362).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (378, 0), 108, 1716)));
+ Table.States (1363).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1363), 108, (376, 0), 1717);
+ Table.States (1363).Kernel := To_Vector ((0 => ((376, 0), 15, 1,
(32767, 0), 0)));
+ Table.States (1363).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (376, 0), 108, 1717)));
+ Table.States (1364).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1364), 15, (379, 0), 1718);
+ Table.States (1364).Kernel := To_Vector ((0 => ((379, 0), 66, 2,
(32767, 0), 0)));
+ Table.States (1364).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (379, 0), 15, 1718)));
+ Table.States (1365).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (1365), 46, (233, 2), 167);
+ Add_Action (Table.States (1365), 52, (187, 0), 356);
+ Add_Action (Table.States (1365), 65, (234, 1), 169);
+ Add_Action (Table.States (1365), 76, (256, 0), 170);
+ Add_Action (Table.States (1365), 85, (205, 4), 171);
+ Add_Action (Table.States (1365), 86, (213, 2), 172);
+ Add_Action (Table.States (1365), 90, (268, 0), 34);
+ Add_Action (Table.States (1365), 106, (237, 1), 173);
+ Add_Action (Table.States (1365), 107, (237, 0), 174);
+ Add_Action (Table.States (1365), 115, (234, 0), 175);
+ Add_Action (Table.States (1365), 116, (196, 0), 146);
+ Add_Action (Table.States (1365), 117, (196, 1), 37);
+ Add_Action (Table.States (1365), 118, (195, 6), 38);
+ Table.States (1365).Goto_List.Set_Capacity (34);
+ Add_Goto (Table.States (1365), 131, 533);
+ Add_Goto (Table.States (1365), 140, 534);
+ Add_Goto (Table.States (1365), 163, 1719);
+ Add_Goto (Table.States (1365), 187, 365);
+ Add_Goto (Table.States (1365), 195, 366);
+ Add_Goto (Table.States (1365), 196, 148);
+ Add_Goto (Table.States (1365), 197, 54);
+ Add_Goto (Table.States (1365), 198, 55);
+ Add_Goto (Table.States (1365), 199, 56);
+ Add_Goto (Table.States (1365), 201, 57);
+ Add_Goto (Table.States (1365), 203, 369);
+ Add_Goto (Table.States (1365), 205, 177);
+ Add_Goto (Table.States (1365), 206, 178);
+ Add_Goto (Table.States (1365), 210, 179);
+ Add_Goto (Table.States (1365), 211, 180);
+ Add_Goto (Table.States (1365), 213, 181);
+ Add_Goto (Table.States (1365), 214, 182);
+ Add_Goto (Table.States (1365), 215, 183);
+ Add_Goto (Table.States (1365), 218, 184);
+ Add_Goto (Table.States (1365), 219, 185);
+ Add_Goto (Table.States (1365), 220, 186);
+ Add_Goto (Table.States (1365), 231, 696);
+ Add_Goto (Table.States (1365), 232, 190);
+ Add_Goto (Table.States (1365), 233, 191);
+ Add_Goto (Table.States (1365), 234, 192);
+ Add_Goto (Table.States (1365), 237, 193);
+ Add_Goto (Table.States (1365), 251, 58);
+ Add_Goto (Table.States (1365), 252, 59);
+ Add_Goto (Table.States (1365), 255, 60);
+ Add_Goto (Table.States (1365), 256, 194);
+ Add_Goto (Table.States (1365), 268, 68);
+ Add_Goto (Table.States (1365), 311, 83);
+ Add_Goto (Table.States (1365), 456, 1720);
+ Add_Goto (Table.States (1365), 465, 196);
+ Table.States (1365).Kernel := To_Vector ((0 => ((162, 0), 95, 2,
(32767, 0), 0)));
+ Table.States (1365).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1366).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1366), 52, (187, 0), 347);
+ Add_Action (Table.States (1366), 56, (188, 2), 514);
+ Add_Action (Table.States (1366), 70, (156, 0), 519);
+ Add_Action (Table.States (1366), 86, (252, 0), 33);
+ Add_Action (Table.States (1366), 90, (268, 0), 34);
+ Add_Action (Table.States (1366), 116, (196, 0), 146);
+ Add_Action (Table.States (1366), 117, (196, 1), 37);
+ Add_Action (Table.States (1366), 118, (195, 6), 38);
+ Table.States (1366).Goto_List.Set_Capacity (17);
+ Add_Goto (Table.States (1366), 131, 887);
+ Add_Goto (Table.States (1366), 154, 889);
+ Add_Goto (Table.States (1366), 156, 524);
+ Add_Goto (Table.States (1366), 159, 525);
+ Add_Goto (Table.States (1366), 187, 526);
+ Add_Goto (Table.States (1366), 188, 890);
+ Add_Goto (Table.States (1366), 195, 528);
+ Add_Goto (Table.States (1366), 196, 148);
+ Add_Goto (Table.States (1366), 197, 54);
+ Add_Goto (Table.States (1366), 198, 55);
+ Add_Goto (Table.States (1366), 199, 56);
+ Add_Goto (Table.States (1366), 201, 57);
+ Add_Goto (Table.States (1366), 251, 58);
+ Add_Goto (Table.States (1366), 252, 59);
+ Add_Goto (Table.States (1366), 255, 60);
+ Add_Goto (Table.States (1366), 268, 68);
+ Add_Goto (Table.States (1366), 311, 83);
+ Table.States (1366).Kernel := To_Vector ((((135, 8), 79, 6,
(32767, 0), 0), ((135, 9), 79, 4, (32767,
+ 0), 0), ((135, 10), 79, 4, (32767, 0), 0), ((135, 11), 79,
2, (32767, 0), 0), ((135, 24), 79, 7,
+ (32767, 0), 0), ((135, 25), 79, 5, (32767, 0), 0), ((135, 26),
79, 5, (32767, 0), 0), ((135, 27),
+ 79, 3, (32767, 0), 0), ((135, 40), 79, 12, (32767, 0), 0),
((135, 41), 79, 10, (32767, 0), 0),
+ ((135, 42), 79, 10, (32767, 0), 0), ((135, 43), 79, 8,
(32767, 0), 0)));
+ Table.States (1366).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1367).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1367), (1 => 87), (249, 0), 4);
+ Table.States (1367).Kernel := To_Vector ((0 => ((249, 0), 227,
0, (249, 0), 4)));
+ Table.States (1367).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (249, 0), 4)));
+ Table.States (1368).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1368), 41, (242, 2), 1721);
+ Add_Action (Table.States (1368), 44, (240, 0), 1722);
+ Add_Action (Table.States (1368), 87, Reduce, (242, 3), 4);
+ Table.States (1368).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1368), 240, 1723);
+ Add_Goto (Table.States (1368), 241, 1724);
+ Table.States (1368).Kernel := To_Vector ((((242, 0), 227, 6,
(32767, 0), 0), ((242, 1), 227, 4,
+ (32767, 0), 0), ((242, 2), 227, 2, (32767, 0), 0), ((242, 3),
227, 0, (242, 3), 4)));
+ Table.States (1368).Minimal_Complete_Actions := To_Vector
(((Shift, (242, 2), 41, 1721), (Reduce, (242,
+ 3), 4)));
+ Table.States (1369).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1369), (1 => 87), (247, 0), 4);
+ Table.States (1369).Kernel := To_Vector ((0 => ((247, 0), 314,
0, (247, 0), 4)));
+ Table.States (1369).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (247, 0), 4)));
+ Table.States (1370).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1370), (1 => 87), (247, 1), 4);
+ Table.States (1370).Kernel := To_Vector ((0 => ((247, 1), 314,
0, (247, 1), 4)));
+ Table.States (1370).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (247, 1), 4)));
+ Table.States (1371).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (1371), 12, (402, 0), 165);
+ Add_Action (Table.States (1371), 46, (233, 2), 167);
+ Add_Action (Table.States (1371), 52, (187, 0), 356);
+ Add_Action (Table.States (1371), 62, (178, 3), 385);
+ Add_Action (Table.States (1371), 65, (234, 1), 169);
+ Add_Action (Table.States (1371), 76, (256, 0), 170);
+ Add_Action (Table.States (1371), 85, (205, 4), 171);
+ Add_Action (Table.States (1371), 86, (213, 2), 172);
+ Add_Action (Table.States (1371), 90, (268, 0), 34);
+ Add_Action (Table.States (1371), 106, (237, 1), 173);
+ Add_Action (Table.States (1371), 107, (237, 0), 174);
+ Add_Action (Table.States (1371), 115, (234, 0), 175);
+ Add_Action (Table.States (1371), 116, (196, 0), 146);
+ Add_Action (Table.States (1371), 117, (196, 1), 37);
+ Add_Action (Table.States (1371), 118, (195, 6), 38);
+ Table.States (1371).Goto_List.Set_Capacity (37);
+ Add_Goto (Table.States (1371), 131, 361);
+ Add_Goto (Table.States (1371), 140, 362);
+ Add_Goto (Table.States (1371), 177, 1725);
+ Add_Goto (Table.States (1371), 178, 364);
+ Add_Goto (Table.States (1371), 187, 365);
+ Add_Goto (Table.States (1371), 195, 366);
+ Add_Goto (Table.States (1371), 196, 148);
+ Add_Goto (Table.States (1371), 197, 54);
+ Add_Goto (Table.States (1371), 198, 55);
+ Add_Goto (Table.States (1371), 199, 56);
+ Add_Goto (Table.States (1371), 201, 57);
+ Add_Goto (Table.States (1371), 203, 369);
+ Add_Goto (Table.States (1371), 205, 177);
+ Add_Goto (Table.States (1371), 206, 178);
+ Add_Goto (Table.States (1371), 210, 179);
+ Add_Goto (Table.States (1371), 211, 180);
+ Add_Goto (Table.States (1371), 213, 181);
+ Add_Goto (Table.States (1371), 214, 182);
+ Add_Goto (Table.States (1371), 215, 183);
+ Add_Goto (Table.States (1371), 218, 184);
+ Add_Goto (Table.States (1371), 219, 185);
+ Add_Goto (Table.States (1371), 220, 186);
+ Add_Goto (Table.States (1371), 227, 975);
+ Add_Goto (Table.States (1371), 228, 188);
+ Add_Goto (Table.States (1371), 231, 378);
+ Add_Goto (Table.States (1371), 232, 190);
+ Add_Goto (Table.States (1371), 233, 191);
+ Add_Goto (Table.States (1371), 234, 192);
+ Add_Goto (Table.States (1371), 237, 193);
+ Add_Goto (Table.States (1371), 251, 58);
+ Add_Goto (Table.States (1371), 252, 59);
+ Add_Goto (Table.States (1371), 255, 60);
+ Add_Goto (Table.States (1371), 256, 194);
+ Add_Goto (Table.States (1371), 268, 68);
+ Add_Goto (Table.States (1371), 311, 83);
+ Add_Goto (Table.States (1371), 402, 195);
+ Add_Goto (Table.States (1371), 465, 196);
+ Table.States (1371).Kernel := To_Vector ((0 => ((246, 0), 63, 3,
(32767, 0), 0)));
+ Table.States (1371).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (178, 3), 62, 385)));
+ Table.States (1372).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1372), 87, Reduce, (245, 0), 4);
+ Add_Action (Table.States (1372), 95, (244, 1), 1726);
+ Table.States (1372).Kernel := To_Vector ((((244, 1), 244, 5,
(32767, 0), 0), ((245, 0), 244, 0, (245,
+ 0), 4)));
+ Table.States (1372).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (245, 0), 4)));
+ Table.States (1373).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1373), (87, 95), (244, 0), 1);
+ Table.States (1373).Kernel := To_Vector ((0 => ((244, 0), 246,
0, (244, 0), 1)));
+ Table.States (1373).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (244, 0), 1)));
+ Table.States (1374).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (1374), (33, 36, 47, 49, 50, 61, 63, 69,
75, 87, 91, 94, 95, 99, 108), (453, 0),
+ 3);
+ Table.States (1374).Kernel := To_Vector ((0 => ((453, 0), 139,
0, (453, 0), 3)));
+ Table.States (1374).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (453, 0), 3)));
+ Table.States (1375).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (1375), (33, 36, 47, 49, 50, 61, 63, 69,
75, 87, 91, 94, 95, 99, 108), (153, 0),
+ 3);
+ Table.States (1375).Kernel := To_Vector ((0 => ((153, 0), 139,
0, (153, 0), 3)));
+ Table.States (1375).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (153, 0), 3)));
+ Table.States (1376).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (1376), 12, (402, 0), 165);
+ Add_Action (Table.States (1376), 46, (233, 2), 167);
+ Add_Action (Table.States (1376), 52, (233, 3), 168);
+ Add_Action (Table.States (1376), 65, (234, 1), 169);
+ Add_Action (Table.States (1376), 76, (256, 0), 170);
+ Add_Action (Table.States (1376), 85, (205, 4), 171);
+ Add_Action (Table.States (1376), 86, (213, 2), 172);
+ Add_Action (Table.States (1376), 90, (268, 0), 34);
+ Add_Action (Table.States (1376), 106, (237, 1), 173);
+ Add_Action (Table.States (1376), 107, (237, 0), 174);
+ Add_Action (Table.States (1376), 115, (234, 0), 175);
+ Add_Action (Table.States (1376), 116, (196, 0), 146);
+ Add_Action (Table.States (1376), 117, (196, 1), 37);
+ Add_Action (Table.States (1376), 118, (195, 6), 38);
+ Table.States (1376).Goto_List.Set_Capacity (31);
+ Add_Goto (Table.States (1376), 195, 176);
+ Add_Goto (Table.States (1376), 196, 148);
+ Add_Goto (Table.States (1376), 197, 54);
+ Add_Goto (Table.States (1376), 198, 55);
+ Add_Goto (Table.States (1376), 199, 56);
+ Add_Goto (Table.States (1376), 201, 57);
+ Add_Goto (Table.States (1376), 205, 177);
+ Add_Goto (Table.States (1376), 206, 178);
+ Add_Goto (Table.States (1376), 210, 179);
+ Add_Goto (Table.States (1376), 211, 180);
+ Add_Goto (Table.States (1376), 213, 181);
+ Add_Goto (Table.States (1376), 214, 182);
+ Add_Goto (Table.States (1376), 215, 183);
+ Add_Goto (Table.States (1376), 218, 184);
+ Add_Goto (Table.States (1376), 219, 185);
+ Add_Goto (Table.States (1376), 220, 186);
+ Add_Goto (Table.States (1376), 227, 1727);
+ Add_Goto (Table.States (1376), 228, 188);
+ Add_Goto (Table.States (1376), 231, 189);
+ Add_Goto (Table.States (1376), 232, 190);
+ Add_Goto (Table.States (1376), 233, 191);
+ Add_Goto (Table.States (1376), 234, 192);
+ Add_Goto (Table.States (1376), 237, 193);
+ Add_Goto (Table.States (1376), 251, 58);
+ Add_Goto (Table.States (1376), 252, 59);
+ Add_Goto (Table.States (1376), 255, 60);
+ Add_Goto (Table.States (1376), 256, 194);
+ Add_Goto (Table.States (1376), 268, 68);
+ Add_Goto (Table.States (1376), 311, 83);
+ Add_Goto (Table.States (1376), 402, 195);
+ Add_Goto (Table.States (1376), 465, 196);
+ Table.States (1376).Kernel := To_Vector ((0 => ((204, 0), 85, 2,
(32767, 0), 0)));
+ Table.States (1376).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (1377).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1377), 87, (213, 1), 1728);
+ Table.States (1377).Kernel := To_Vector ((0 => ((213, 1), 314,
1, (32767, 0), 0)));
+ Table.States (1377).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (213, 1), 87, 1728)));
+ Table.States (1378).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1378), 87, (219, 0), 1729);
+ Table.States (1378).Kernel := To_Vector ((0 => ((219, 0), 207,
1, (32767, 0), 0)));
+ Table.States (1378).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (219, 0), 87, 1729)));
+ Table.States (1379).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1379), 87, (220, 0), 1730);
+ Add_Action (Table.States (1379), 95, (216, 1), 651);
+ Table.States (1379).Kernel := To_Vector ((((216, 1), 216, 4,
(32767, 0), 0), ((216, 2), 216, 4,
+ (32767, 0), 0), ((220, 0), 216, 1, (32767, 0), 0)));
+ Table.States (1379).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (220, 0), 87, 1730)));
+ Table.States (1380).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1380), 87, Reduce, (208, 1), 1);
+ Add_Action (Table.States (1380), 91, Reduce, (178, 0), 1);
+ Add_Action (Table.States (1380), 95, Reduce, (208, 1), 1);
+ Add_Action (Table.States (1380), 99, Reduce, (178, 0), 1);
+ Table.States (1380).Kernel := To_Vector ((((178, 0), 227, 0,
(178, 0), 1), ((208, 1), 227, 0, (208,
+ 1), 1)));
+ Table.States (1380).Minimal_Complete_Actions := To_Vector
(((Reduce, (178, 0), 1), (Reduce, (208, 1),
+ 1)));
+ Table.States (1381).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (1381), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (210, 0), 5);
+ Table.States (1381).Kernel := To_Vector ((0 => ((210, 0), 87, 0,
(210, 0), 5)));
+ Table.States (1381).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (210, 0), 5)));
+ Table.States (1382).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1382), 88, (213, 2), 1731);
+ Table.States (1382).Kernel := To_Vector ((0 => ((213, 2), 314,
1, (32767, 0), 0)));
+ Table.States (1382).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (213, 2), 88, 1731)));
+ Table.States (1383).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1383), 88, (220, 1), 1732);
+ Add_Action (Table.States (1383), 95, (216, 1), 651);
+ Table.States (1383).Kernel := To_Vector ((((216, 1), 216, 4,
(32767, 0), 0), ((216, 2), 216, 4,
+ (32767, 0), 0), ((220, 1), 216, 1, (32767, 0), 0)));
+ Table.States (1383).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (220, 1), 88, 1732)));
+ Table.States (1384).Action_List.Set_Capacity (18);
+ Add_Action (Table.States (1384), (33, 36, 41, 43, 44, 50, 61, 63,
72, 74, 75, 82, 87, 88, 91, 95, 99, 108),
+ (223, 1), 4);
+ Table.States (1384).Kernel := To_Vector ((0 => ((223, 1), 228,
0, (223, 1), 4)));
+ Table.States (1384).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (223, 1), 4)));
+ Table.States (1385).Action_List.Set_Capacity (18);
+ Add_Action (Table.States (1385), (33, 36, 41, 43, 44, 49, 50, 61,
63, 72, 74, 82, 87, 88, 91, 95, 99, 108),
+ (225, 1), 4);
+ Table.States (1385).Kernel := To_Vector ((0 => ((225, 1), 228,
0, (225, 1), 4)));
+ Table.States (1385).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (225, 1), 4)));
+ Table.States (1386).Action_List.Set_Capacity (20);
+ Add_Action (Table.States (1386), (33, 36, 41, 43, 44, 48, 49, 50,
61, 63, 72, 74, 75, 82, 87, 88, 91, 95,
+ 99, 108), (229, 2), 3);
+ Table.States (1386).Kernel := To_Vector ((((229, 1), 229, 2,
(32767, 0), 0), ((229, 2), 229, 0, (229,
+ 2), 3), ((229, 2), 229, 2, (32767, 0), 0)));
+ Table.States (1386).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (229, 2), 3)));
+ Table.States (1387).Action_List.Set_Capacity (20);
+ Add_Action (Table.States (1387), (33, 36, 41, 43, 44, 48, 49, 50,
61, 63, 72, 74, 75, 82, 87, 88, 91, 95,
+ 99, 108), (229, 1), 3);
+ Table.States (1387).Kernel := To_Vector ((((229, 0), 230, 0,
(229, 0), 1), ((229, 1), 230, 0, (229,
+ 1), 3)));
+ Table.States (1387).Minimal_Complete_Actions := To_Vector
(((Reduce, (229, 0), 1), (Reduce, (229, 1),
+ 3)));
+ Table.States (1388).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1388), 33, (357, 0), 1733);
+ Add_Action (Table.States (1388), 108, (357, 1), 1734);
+ Table.States (1388).Kernel := To_Vector ((((357, 0), 295, 5,
(32767, 0), 0), ((357, 1), 295, 1,
+ (32767, 0), 0)));
+ Table.States (1388).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (357, 1), 108, 1734)));
+ Table.States (1389).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1389), 108, Reduce, (284, 1), 0);
+ Add_Action (Table.States (1389), 116, (284, 0), 1312);
+ Table.States (1389).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1389), 284, 1735);
+ Table.States (1389).Kernel := To_Vector ((0 => ((357, 2), 66, 1,
(32767, 0), 0)));
+ Table.States (1389).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (284, 1), 0)));
+ Table.States (1390).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1390), 61, (434, 0), 299);
+ Add_Action (Table.States (1390), 108, (356, 5), 1736);
+ Table.States (1390).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1390), 434, 1737);
+ Table.States (1390).Kernel := To_Vector ((((356, 4), 295, 3,
(32767, 0), 0), ((356, 5), 295, 1,
+ (32767, 0), 0)));
+ Table.States (1390).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (356, 5), 108, 1736)));
+ Table.States (1391).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1391), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (339, 1), 6);
+ Table.States (1391).Kernel := To_Vector ((0 => ((339, 1), 108,
0, (339, 1), 6)));
+ Table.States (1391).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (339, 1), 6)));
+ Table.States (1392).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1392), 108, (339, 0), 1738);
+ Table.States (1392).Kernel := To_Vector ((0 => ((339, 0), 434,
1, (32767, 0), 0)));
+ Table.States (1392).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (339, 0), 108, 1738)));
+ Table.States (1393).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1393), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (339, 5), 6);
+ Table.States (1393).Kernel := To_Vector ((0 => ((339, 5), 108,
0, (339, 5), 6)));
+ Table.States (1393).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (339, 5), 6)));
+ Table.States (1394).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1394), 108, (339, 4), 1739);
+ Table.States (1394).Kernel := To_Vector ((0 => ((339, 4), 434,
1, (32767, 0), 0)));
+ Table.States (1394).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (339, 4), 108, 1739)));
+ Table.States (1395).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1395), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (339, 3), 6);
+ Table.States (1395).Kernel := To_Vector ((0 => ((339, 3), 108,
0, (339, 3), 6)));
+ Table.States (1395).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (339, 3), 6)));
+ Table.States (1396).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1396), 108, (339, 2), 1740);
+ Table.States (1396).Kernel := To_Vector ((0 => ((339, 2), 434,
1, (32767, 0), 0)));
+ Table.States (1396).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (339, 2), 108, 1740)));
+ Table.States (1397).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1397), 86, (252, 0), 33);
+ Add_Action (Table.States (1397), 90, (268, 0), 34);
+ Add_Action (Table.States (1397), 116, (196, 0), 146);
+ Add_Action (Table.States (1397), 117, (196, 1), 37);
+ Add_Action (Table.States (1397), 118, (195, 6), 38);
+ Table.States (1397).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (1397), 195, 1741);
+ Add_Goto (Table.States (1397), 196, 148);
+ Add_Goto (Table.States (1397), 197, 54);
+ Add_Goto (Table.States (1397), 198, 55);
+ Add_Goto (Table.States (1397), 199, 56);
+ Add_Goto (Table.States (1397), 201, 57);
+ Add_Goto (Table.States (1397), 251, 58);
+ Add_Goto (Table.States (1397), 252, 59);
+ Add_Goto (Table.States (1397), 255, 60);
+ Add_Goto (Table.States (1397), 268, 68);
+ Add_Goto (Table.States (1397), 311, 83);
+ Table.States (1397).Kernel := To_Vector ((((430, 0), 76, 4,
(32767, 0), 0), ((430, 1), 76, 2, (32767,
+ 0), 0)));
+ Table.States (1397).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1398).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1398), (28, 50, 53, 54, 61, 83, 84,
116), (427, 3), 5);
+ Table.States (1398).Kernel := To_Vector ((0 => ((427, 3), 108,
0, (427, 3), 5)));
+ Table.States (1398).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (427, 3), 5)));
+ end Subr_51;
+ procedure Subr_52
+ is begin
+ Table.States (1399).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1399), 61, (434, 0), 299);
+ Add_Action (Table.States (1399), 108, (427, 1), 1742);
+ Table.States (1399).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1399), 434, 1743);
+ Table.States (1399).Kernel := To_Vector ((((427, 0), 428, 3,
(32767, 0), 0), ((427, 1), 428, 1,
+ (32767, 0), 0)));
+ Table.States (1399).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (427, 1), 108, 1742)));
+ Table.States (1400).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1400), 108, (427, 2), 1744);
+ Table.States (1400).Kernel := To_Vector ((0 => ((427, 2), 434,
1, (32767, 0), 0)));
+ Table.States (1400).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (427, 2), 108, 1744)));
+ Table.States (1401).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1401), (28, 50, 53, 54, 61, 83, 84,
116), (426, 1), 5);
+ Table.States (1401).Kernel := To_Vector ((0 => ((426, 1), 108,
0, (426, 1), 5)));
+ Table.States (1401).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (426, 1), 5)));
+ Table.States (1402).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1402), 108, (426, 0), 1745);
+ Table.States (1402).Kernel := To_Vector ((0 => ((426, 0), 434,
1, (32767, 0), 0)));
+ Table.States (1402).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (426, 0), 108, 1745)));
+ Table.States (1403).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1403), 85, (198, 0), 281);
+ Add_Action (Table.States (1403), 96, (197, 0), 283);
+ Add_Action (Table.States (1403), 108, (412, 6), 1746);
+ Add_Action (Table.States (1403), 113, (121, 0), 285);
+ Add_Action (Table.States (1403), 114, (121, 1), 286);
+ Table.States (1403).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1403), 121, 287);
+ Add_Goto (Table.States (1403), 313, 289);
+ Table.States (1403).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((412, 6), 195, 1, (32767, 0), 0)));
+ Table.States (1403).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (412, 6), 108, 1746)));
+ Table.States (1404).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1404), 86, (252, 0), 33);
+ Add_Action (Table.States (1404), 90, (268, 0), 34);
+ Add_Action (Table.States (1404), 116, (196, 0), 146);
+ Add_Action (Table.States (1404), 117, (196, 1), 37);
+ Add_Action (Table.States (1404), 118, (195, 6), 38);
+ Table.States (1404).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (1404), 195, 1747);
+ Add_Goto (Table.States (1404), 196, 148);
+ Add_Goto (Table.States (1404), 197, 54);
+ Add_Goto (Table.States (1404), 198, 55);
+ Add_Goto (Table.States (1404), 199, 56);
+ Add_Goto (Table.States (1404), 201, 57);
+ Add_Goto (Table.States (1404), 251, 58);
+ Add_Goto (Table.States (1404), 252, 59);
+ Add_Goto (Table.States (1404), 255, 60);
+ Add_Goto (Table.States (1404), 268, 68);
+ Add_Goto (Table.States (1404), 311, 83);
+ Table.States (1404).Kernel := To_Vector ((((415, 12), 76, 5,
(32767, 0), 0), ((415, 13), 76, 3,
+ (32767, 0), 0), ((415, 14), 76, 1, (32767, 0), 0)));
+ Table.States (1404).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1405).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1405), (49, 61, 108), (414, 3), 2);
+ Table.States (1405).Kernel := To_Vector ((0 => ((414, 3), 27, 0,
(414, 3), 2)));
+ Table.States (1405).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (414, 3), 2)));
+ Table.States (1406).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1406), 50, (412, 4), 1748);
+ Table.States (1406).Kernel := To_Vector ((0 => ((412, 4), 49, 3,
(32767, 0), 0)));
+ Table.States (1406).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (412, 4), 50, 1748)));
+ Table.States (1407).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1407), 27, (414, 2), 1749);
+ Table.States (1407).Kernel := To_Vector ((0 => ((414, 2), 77, 1,
(32767, 0), 0)));
+ Table.States (1407).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (414, 2), 27, 1749)));
+ Table.States (1408).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1408), (28, 50, 53, 54, 61, 83, 84,
116), (412, 5), 5);
+ Table.States (1408).Kernel := To_Vector ((0 => ((412, 5), 108,
0, (412, 5), 5)));
+ Table.States (1408).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (412, 5), 5)));
+ Table.States (1409).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1409), 49, Reduce, (420, 0), 2);
+ Add_Action (Table.States (1409), 61, Reduce, (420, 0), 2);
+ Add_Action (Table.States (1409), 72, (421, 0), 1750);
+ Add_Action (Table.States (1409), 108, Reduce, (420, 0), 2);
+ Table.States (1409).Kernel := To_Vector ((((420, 0), 92, 0,
(420, 0), 2), ((421, 0), 92, 2, (32767,
+ 0), 0)));
+ Table.States (1409).Minimal_Complete_Actions := To_Vector
(((Reduce, (420, 0), 2), (Shift, (421, 0), 72,
+ 1750)));
+ Table.States (1410).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1410), (49, 61, 108), (419, 0), 2);
+ Table.States (1410).Kernel := To_Vector ((0 => ((419, 0), 92, 0,
(419, 0), 2)));
+ Table.States (1410).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (419, 0), 2)));
+ Table.States (1411).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1411), (49, 61, 108), (418, 0), 2);
+ Table.States (1411).Kernel := To_Vector ((0 => ((418, 0), 92, 0,
(418, 0), 2)));
+ Table.States (1411).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (418, 0), 2)));
+ Table.States (1412).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1412), (49, 61, 108), (417, 0), 2);
+ Table.States (1412).Kernel := To_Vector ((0 => ((417, 0), 92, 0,
(417, 0), 2)));
+ Table.States (1412).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (417, 0), 2)));
+ Table.States (1413).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1413), 49, Reduce, (415, 17), 2);
+ Add_Action (Table.States (1413), 61, (415, 16), 1751);
+ Add_Conflict (Table.States (1413), 61, (415, 17), 2);
+ Add_Action (Table.States (1413), 75, (415, 15), 1752);
+ Add_Action (Table.States (1413), 85, (198, 0), 281);
+ Add_Action (Table.States (1413), 96, (197, 0), 283);
+ Add_Action (Table.States (1413), 108, Reduce, (415, 17), 2);
+ Add_Action (Table.States (1413), 113, (121, 0), 285);
+ Add_Action (Table.States (1413), 114, (121, 1), 286);
+ Table.States (1413).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1413), 121, 287);
+ Add_Goto (Table.States (1413), 313, 289);
+ Table.States (1413).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((415, 15), 195, 4, (32767, 0), 0),
+ ((415, 16), 195, 2, (32767, 0), 0), ((415, 17), 195, 0, (415,
17), 2)));
+ Table.States (1413).Minimal_Complete_Actions := To_Vector
(((Shift, (415, 16), 61, 1751), (Reduce, (415,
+ 17), 2)));
+ Table.States (1414).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1414), (49, 61, 108), (414, 4), 2);
+ Table.States (1414).Kernel := To_Vector ((0 => ((414, 4), 27, 0,
(414, 4), 2)));
+ Table.States (1414).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (414, 4), 2)));
+ Table.States (1415).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1415), 86, (252, 0), 33);
+ Add_Action (Table.States (1415), 90, (268, 0), 34);
+ Add_Action (Table.States (1415), 116, (196, 0), 146);
+ Add_Action (Table.States (1415), 117, (196, 1), 37);
+ Add_Action (Table.States (1415), 118, (195, 6), 38);
+ Table.States (1415).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (1415), 195, 1753);
+ Add_Goto (Table.States (1415), 196, 148);
+ Add_Goto (Table.States (1415), 197, 54);
+ Add_Goto (Table.States (1415), 198, 55);
+ Add_Goto (Table.States (1415), 199, 56);
+ Add_Goto (Table.States (1415), 201, 57);
+ Add_Goto (Table.States (1415), 251, 58);
+ Add_Goto (Table.States (1415), 252, 59);
+ Add_Goto (Table.States (1415), 255, 60);
+ Add_Goto (Table.States (1415), 268, 68);
+ Add_Goto (Table.States (1415), 311, 83);
+ Table.States (1415).Kernel := To_Vector ((((415, 9), 76, 5,
(32767, 0), 0), ((415, 10), 76, 3, (32767,
+ 0), 0), ((415, 11), 76, 1, (32767, 0), 0)));
+ Table.States (1415).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1416).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1416), 76, (415, 3), 1754);
+ Table.States (1416).Kernel := To_Vector ((((415, 3), 58, 6,
(32767, 0), 0), ((415, 4), 58, 4, (32767,
+ 0), 0), ((415, 5), 58, 2, (32767, 0), 0)));
+ Table.States (1416).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (415, 3), 76, 1754)));
+ Table.States (1417).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1417), 27, (414, 1), 1755);
+ Add_Action (Table.States (1417), 77, (414, 0), 1756);
+ Table.States (1417).Kernel := To_Vector ((((414, 0), 68, 2,
(32767, 0), 0), ((414, 1), 68, 1, (32767,
+ 0), 0)));
+ Table.States (1417).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (414, 1), 27, 1755)));
+ Table.States (1418).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1418), 86, (252, 0), 33);
+ Add_Action (Table.States (1418), 90, (268, 0), 34);
+ Add_Action (Table.States (1418), 116, (196, 0), 146);
+ Add_Action (Table.States (1418), 117, (196, 1), 37);
+ Add_Action (Table.States (1418), 118, (195, 6), 38);
+ Table.States (1418).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (1418), 195, 1757);
+ Add_Goto (Table.States (1418), 196, 148);
+ Add_Goto (Table.States (1418), 197, 54);
+ Add_Goto (Table.States (1418), 198, 55);
+ Add_Goto (Table.States (1418), 199, 56);
+ Add_Goto (Table.States (1418), 201, 57);
+ Add_Goto (Table.States (1418), 251, 58);
+ Add_Goto (Table.States (1418), 252, 59);
+ Add_Goto (Table.States (1418), 255, 60);
+ Add_Goto (Table.States (1418), 268, 68);
+ Add_Goto (Table.States (1418), 311, 83);
+ Table.States (1418).Kernel := To_Vector ((((415, 6), 76, 5,
(32767, 0), 0), ((415, 7), 76, 3, (32767,
+ 0), 0), ((415, 8), 76, 1, (32767, 0), 0)));
+ Table.States (1418).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1419).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1419), 76, (415, 0), 1758);
+ Table.States (1419).Kernel := To_Vector ((((415, 0), 77, 6,
(32767, 0), 0), ((415, 1), 77, 4, (32767,
+ 0), 0), ((415, 2), 77, 2, (32767, 0), 0)));
+ Table.States (1419).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (415, 0), 76, 1758)));
+ Table.States (1420).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1420), 87, (416, 0), 1759);
+ Table.States (1420).Kernel := To_Vector ((0 => ((416, 0), 92, 1,
(32767, 0), 0)));
+ Table.States (1420).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (416, 0), 87, 1759)));
+ Table.States (1421).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1421), 50, (411, 4), 1760);
+ Table.States (1421).Kernel := To_Vector ((((411, 4), 49, 5,
(32767, 0), 0), ((411, 5), 49, 3, (32767,
+ 0), 0)));
+ Table.States (1421).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (411, 4), 50, 1760)));
+ Table.States (1422).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1422), (28, 50, 53, 54, 61, 83, 84,
116), (411, 7), 5);
+ Table.States (1422).Kernel := To_Vector ((0 => ((411, 7), 108,
0, (411, 7), 5)));
+ Table.States (1422).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (411, 7), 5)));
+ Table.States (1423).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1423), 108, (411, 6), 1761);
+ Table.States (1423).Kernel := To_Vector ((0 => ((411, 6), 434,
1, (32767, 0), 0)));
+ Table.States (1423).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (411, 6), 108, 1761)));
+ Table.States (1424).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1424), 86, (252, 0), 33);
+ Add_Action (Table.States (1424), 90, (268, 0), 34);
+ Add_Action (Table.States (1424), 116, (196, 0), 146);
+ Add_Action (Table.States (1424), 117, (196, 1), 37);
+ Add_Action (Table.States (1424), 118, (195, 6), 38);
+ Table.States (1424).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (1424), 195, 1762);
+ Add_Goto (Table.States (1424), 196, 148);
+ Add_Goto (Table.States (1424), 197, 54);
+ Add_Goto (Table.States (1424), 198, 55);
+ Add_Goto (Table.States (1424), 199, 56);
+ Add_Goto (Table.States (1424), 201, 57);
+ Add_Goto (Table.States (1424), 251, 58);
+ Add_Goto (Table.States (1424), 252, 59);
+ Add_Goto (Table.States (1424), 255, 60);
+ Add_Goto (Table.States (1424), 268, 68);
+ Add_Goto (Table.States (1424), 311, 83);
+ Table.States (1424).Kernel := To_Vector ((0 => ((412, 2), 50, 2,
(32767, 0), 0)));
+ Table.States (1424).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1425).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1425), 27, (414, 3), 1405);
+ Add_Action (Table.States (1425), 49, (412, 0), 1763);
+ Add_Action (Table.States (1425), 77, (414, 2), 1407);
+ Add_Action (Table.States (1425), 108, (412, 1), 1764);
+ Table.States (1425).Kernel := To_Vector ((((412, 0), 68, 4,
(32767, 0), 0), ((412, 1), 68, 1, (32767,
+ 0), 0), ((414, 2), 68, 2, (32767, 0), 0), ((414, 3), 68, 1,
(32767, 0), 0)));
+ Table.States (1425).Minimal_Complete_Actions := To_Vector
(((Shift, (412, 1), 108, 1764), (Shift, (414,
+ 3), 27, 1405)));
+ Table.States (1426).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1426), 49, (411, 0), 1765);
+ Add_Action (Table.States (1426), 61, (434, 0), 299);
+ Add_Action (Table.States (1426), 108, (411, 3), 1766);
+ Table.States (1426).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1426), 434, 1767);
+ Table.States (1426).Kernel := To_Vector ((((411, 0), 413, 6,
(32767, 0), 0), ((411, 1), 413, 4,
+ (32767, 0), 0), ((411, 2), 413, 3, (32767, 0), 0), ((411, 3),
413, 1, (32767, 0), 0)));
+ Table.States (1426).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (411, 3), 108, 1766)));
+ Table.States (1427).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1427), 61, (434, 0), 299);
+ Add_Action (Table.States (1427), 85, (198, 0), 281);
+ Add_Action (Table.States (1427), 94, (134, 0), 282);
+ Add_Action (Table.States (1427), 96, (197, 0), 283);
+ Add_Action (Table.States (1427), 108, (409, 3), 1768);
+ Add_Action (Table.States (1427), 113, (121, 0), 285);
+ Add_Action (Table.States (1427), 114, (121, 1), 286);
+ Table.States (1427).Goto_List.Set_Capacity (4);
+ Add_Goto (Table.States (1427), 121, 287);
+ Add_Goto (Table.States (1427), 134, 1769);
+ Add_Goto (Table.States (1427), 313, 289);
+ Add_Goto (Table.States (1427), 434, 1770);
+ Table.States (1427).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((409, 0), 195, 5, (32767, 0), 0),
+ ((409, 1), 195, 3, (32767, 0), 0), ((409, 2), 195, 3, (32767,
0), 0), ((409, 3), 195, 1, (32767,
+ 0), 0)));
+ Table.States (1427).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (409, 3), 108, 1768)));
+ Table.States (1428).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1428), (28, 50, 53, 54, 61, 83, 84,
116), (409, 11), 5);
+ Table.States (1428).Kernel := To_Vector ((0 => ((409, 11), 108,
0, (409, 11), 5)));
+ Table.States (1428).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (409, 11), 5)));
+ Table.States (1429).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1429), 61, (434, 0), 299);
+ Add_Action (Table.States (1429), 108, (409, 9), 1771);
+ Table.States (1429).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1429), 434, 1772);
+ Table.States (1429).Kernel := To_Vector ((((409, 8), 134, 3,
(32767, 0), 0), ((409, 9), 134, 1,
+ (32767, 0), 0)));
+ Table.States (1429).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (409, 9), 108, 1771)));
+ Table.States (1430).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1430), 108, (409, 10), 1773);
+ Table.States (1430).Kernel := To_Vector ((0 => ((409, 10), 434,
1, (32767, 0), 0)));
+ Table.States (1430).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (409, 10), 108, 1773)));
+ Table.States (1431).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1431), (28, 50, 53, 54, 61, 83, 84,
116), (409, 7), 5);
+ Table.States (1431).Kernel := To_Vector ((0 => ((409, 7), 108,
0, (409, 7), 5)));
+ Table.States (1431).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (409, 7), 5)));
+ Table.States (1432).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1432), 61, (434, 0), 299);
+ Add_Action (Table.States (1432), 108, (409, 5), 1774);
+ Table.States (1432).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1432), 434, 1775);
+ Table.States (1432).Kernel := To_Vector ((((409, 4), 134, 3,
(32767, 0), 0), ((409, 5), 134, 1,
+ (32767, 0), 0)));
+ Table.States (1432).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (409, 5), 108, 1774)));
+ Table.States (1433).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1433), 108, (409, 6), 1776);
+ Table.States (1433).Kernel := To_Vector ((0 => ((409, 6), 434,
1, (32767, 0), 0)));
+ Table.States (1433).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (409, 6), 108, 1776)));
+ Table.States (1434).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1434), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (390, 1), 6);
+ Table.States (1434).Kernel := To_Vector ((0 => ((390, 1), 108,
0, (390, 1), 6)));
+ Table.States (1434).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (390, 1), 6)));
+ Table.States (1435).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1435), 108, (390, 0), 1777);
+ Table.States (1435).Kernel := To_Vector ((0 => ((390, 0), 434,
1, (32767, 0), 0)));
+ Table.States (1435).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (390, 0), 108, 1777)));
+ Table.States (1436).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (1436), 12, (401, 0), 1);
+ Add_Action (Table.States (1436), 15, (370, 0), 3);
+ Add_Action (Table.States (1436), 17, (365, 0), 4);
+ Add_Action (Table.States (1436), 18, (382, 0), 5);
+ Add_Action (Table.States (1436), 19, (363, 0), 6);
+ Add_Action (Table.States (1436), 20, (357, 0), 7);
+ Add_Action (Table.States (1436), 30, (316, 0), 13);
+ Add_Action (Table.States (1436), 31, (290, 0), 14);
+ Add_Action (Table.States (1436), 32, (289, 0), 15);
+ Add_Action (Table.States (1436), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1436), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1436), 37, (288, 0), 17);
+ Add_Conflict (Table.States (1436), 37, (285, 1), 0);
+ Add_Action (Table.States (1436), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1436), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1436), 42, (271, 0), 18);
+ Add_Action (Table.States (1436), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1436), 64, (273, 0), 27);
+ Add_Action (Table.States (1436), 65, (264, 0), 28);
+ Add_Action (Table.States (1436), 84, (124, 0), 32);
+ Add_Action (Table.States (1436), 86, (252, 0), 33);
+ Add_Action (Table.States (1436), 90, (268, 0), 34);
+ Add_Action (Table.States (1436), 105, (265, 0), 35);
+ Add_Action (Table.States (1436), 116, (196, 0), 146);
+ Add_Action (Table.States (1436), 117, (196, 1), 37);
+ Add_Action (Table.States (1436), 118, (195, 6), 38);
+ Table.States (1436).Goto_List.Set_Capacity (46);
+ Add_Goto (Table.States (1436), 124, 39);
+ Add_Goto (Table.States (1436), 195, 52);
+ Add_Goto (Table.States (1436), 196, 53);
+ Add_Goto (Table.States (1436), 197, 54);
+ Add_Goto (Table.States (1436), 198, 55);
+ Add_Goto (Table.States (1436), 199, 56);
+ Add_Goto (Table.States (1436), 201, 57);
+ Add_Goto (Table.States (1436), 251, 58);
+ Add_Goto (Table.States (1436), 252, 59);
+ Add_Goto (Table.States (1436), 255, 60);
+ Add_Goto (Table.States (1436), 259, 452);
+ Add_Goto (Table.States (1436), 261, 331);
+ Add_Goto (Table.States (1436), 262, 62);
+ Add_Goto (Table.States (1436), 263, 63);
+ Add_Goto (Table.States (1436), 264, 64);
+ Add_Goto (Table.States (1436), 265, 65);
+ Add_Goto (Table.States (1436), 266, 66);
+ Add_Goto (Table.States (1436), 267, 67);
+ Add_Goto (Table.States (1436), 268, 68);
+ Add_Goto (Table.States (1436), 271, 69);
+ Add_Goto (Table.States (1436), 273, 70);
+ Add_Goto (Table.States (1436), 275, 71);
+ Add_Goto (Table.States (1436), 285, 72);
+ Add_Goto (Table.States (1436), 286, 73);
+ Add_Goto (Table.States (1436), 288, 74);
+ Add_Goto (Table.States (1436), 289, 75);
+ Add_Goto (Table.States (1436), 290, 76);
+ Add_Goto (Table.States (1436), 310, 82);
+ Add_Goto (Table.States (1436), 311, 83);
+ Add_Goto (Table.States (1436), 316, 84);
+ Add_Goto (Table.States (1436), 318, 85);
+ Add_Goto (Table.States (1436), 357, 110);
+ Add_Goto (Table.States (1436), 363, 111);
+ Add_Goto (Table.States (1436), 364, 112);
+ Add_Goto (Table.States (1436), 365, 113);
+ Add_Goto (Table.States (1436), 366, 114);
+ Add_Goto (Table.States (1436), 367, 115);
+ Add_Goto (Table.States (1436), 370, 116);
+ Add_Goto (Table.States (1436), 376, 117);
+ Add_Goto (Table.States (1436), 378, 118);
+ Add_Goto (Table.States (1436), 379, 119);
+ Add_Goto (Table.States (1436), 382, 120);
+ Add_Goto (Table.States (1436), 396, 1778);
+ Add_Goto (Table.States (1436), 401, 133);
+ Add_Goto (Table.States (1436), 461, 332);
+ Add_Goto (Table.States (1436), 462, 144);
+ Table.States (1436).Kernel := To_Vector ((0 => ((326, 2), 38, 4,
(32767, 0), 0)));
+ Table.States (1436).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ Table.States (1437).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1437), 86, (252, 0), 33);
+ Add_Action (Table.States (1437), 90, (268, 0), 34);
+ Add_Action (Table.States (1437), 108, Reduce, (308, 1), 0);
+ Add_Action (Table.States (1437), 116, (196, 0), 146);
+ Add_Action (Table.States (1437), 117, (196, 1), 37);
+ Add_Action (Table.States (1437), 118, (195, 6), 38);
+ Table.States (1437).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1437), 195, 1063);
+ Add_Goto (Table.States (1437), 196, 148);
+ Add_Goto (Table.States (1437), 197, 54);
+ Add_Goto (Table.States (1437), 198, 55);
+ Add_Goto (Table.States (1437), 199, 56);
+ Add_Goto (Table.States (1437), 201, 57);
+ Add_Goto (Table.States (1437), 251, 58);
+ Add_Goto (Table.States (1437), 252, 59);
+ Add_Goto (Table.States (1437), 255, 60);
+ Add_Goto (Table.States (1437), 268, 68);
+ Add_Goto (Table.States (1437), 308, 1779);
+ Add_Goto (Table.States (1437), 311, 83);
+ Table.States (1437).Kernel := To_Vector ((0 => ((326, 3), 66, 1,
(32767, 0), 0)));
+ Table.States (1437).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (308, 1), 0)));
+ end Subr_52;
+ procedure Subr_53
+ is begin
+ Table.States (1438).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1438), 38, (326, 0), 1780);
+ Add_Action (Table.States (1438), 66, (326, 1), 1781);
+ Table.States (1438).Kernel := To_Vector ((((326, 0), 192, 5,
(32767, 0), 0), ((326, 1), 192, 2,
+ (32767, 0), 0)));
+ Table.States (1438).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (326, 1), 66, 1781)));
+ Table.States (1439).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1439), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (337, 0), 6);
+ Table.States (1439).Kernel := To_Vector ((0 => ((337, 0), 108,
0, (337, 0), 6)));
+ Table.States (1439).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (337, 0), 6)));
+ Table.States (1440).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1440), (1 => 108), (325, 10), 6);
+ Table.States (1440).Kernel := To_Vector ((0 => ((325, 10), 308,
0, (325, 10), 6)));
+ Table.States (1440).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (325, 10), 6)));
+ Table.States (1441).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1441), 86, (252, 0), 33);
+ Add_Action (Table.States (1441), 90, (268, 0), 34);
+ Add_Action (Table.States (1441), 108, Reduce, (308, 1), 0);
+ Add_Action (Table.States (1441), 116, (196, 0), 146);
+ Add_Action (Table.States (1441), 117, (196, 1), 37);
+ Add_Action (Table.States (1441), 118, (195, 6), 38);
+ Table.States (1441).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1441), 195, 1063);
+ Add_Goto (Table.States (1441), 196, 148);
+ Add_Goto (Table.States (1441), 197, 54);
+ Add_Goto (Table.States (1441), 198, 55);
+ Add_Goto (Table.States (1441), 199, 56);
+ Add_Goto (Table.States (1441), 201, 57);
+ Add_Goto (Table.States (1441), 251, 58);
+ Add_Goto (Table.States (1441), 252, 59);
+ Add_Goto (Table.States (1441), 255, 60);
+ Add_Goto (Table.States (1441), 268, 68);
+ Add_Goto (Table.States (1441), 308, 1782);
+ Add_Goto (Table.States (1441), 311, 83);
+ Table.States (1441).Kernel := To_Vector ((0 => ((325, 9), 66, 0,
(308, 1), 0)));
+ Table.States (1441).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (308, 1), 0)));
+ Table.States (1442).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1442), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (408, 1), 6);
+ Table.States (1442).Kernel := To_Vector ((0 => ((408, 1), 108,
0, (408, 1), 6)));
+ Table.States (1442).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (408, 1), 6)));
+ Table.States (1443).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1443), 108, (408, 0), 1783);
+ Table.States (1443).Kernel := To_Vector ((0 => ((408, 0), 434,
1, (32767, 0), 0)));
+ Table.States (1443).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (408, 0), 108, 1783)));
+ Table.States (1444).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1444), 86, (252, 0), 33);
+ Add_Action (Table.States (1444), 90, (268, 0), 34);
+ Add_Action (Table.States (1444), 108, Reduce, (308, 1), 0);
+ Add_Action (Table.States (1444), 116, (196, 0), 146);
+ Add_Action (Table.States (1444), 117, (196, 1), 37);
+ Add_Action (Table.States (1444), 118, (195, 6), 38);
+ Table.States (1444).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1444), 195, 1063);
+ Add_Goto (Table.States (1444), 196, 148);
+ Add_Goto (Table.States (1444), 197, 54);
+ Add_Goto (Table.States (1444), 198, 55);
+ Add_Goto (Table.States (1444), 199, 56);
+ Add_Goto (Table.States (1444), 201, 57);
+ Add_Goto (Table.States (1444), 251, 58);
+ Add_Goto (Table.States (1444), 252, 59);
+ Add_Goto (Table.States (1444), 255, 60);
+ Add_Goto (Table.States (1444), 268, 68);
+ Add_Goto (Table.States (1444), 308, 1784);
+ Add_Goto (Table.States (1444), 311, 83);
+ Table.States (1444).Kernel := To_Vector ((0 => ((325, 7), 66, 0,
(308, 1), 0)));
+ Table.States (1444).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (308, 1), 0)));
+ Table.States (1445).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (1445), 22, (339, 0), 9);
+ Add_Action (Table.States (1445), 25, (329, 1), 10);
+ Add_Action (Table.States (1445), 28, (325, 0), 720);
+ Add_Action (Table.States (1445), 50, (332, 0), 19);
+ Add_Action (Table.States (1445), 51, (437, 0), 221);
+ Add_Action (Table.States (1445), 52, (329, 0), 21);
+ Add_Action (Table.States (1445), 53, (294, 0), 22);
+ Add_Action (Table.States (1445), 54, (293, 0), 23);
+ Add_Action (Table.States (1445), 59, (346, 0), 721);
+ Add_Action (Table.States (1445), 60, (340, 0), 722);
+ Add_Action (Table.States (1445), 66, (325, 6), 1785);
+ Add_Action (Table.States (1445), 81, (130, 0), 30);
+ Add_Action (Table.States (1445), 83, (128, 0), 31);
+ Add_Action (Table.States (1445), 84, (124, 0), 32);
+ Add_Action (Table.States (1445), 116, (136, 0), 223);
+ Table.States (1445).Goto_List.Set_Capacity (48);
+ Add_Goto (Table.States (1445), 124, 725);
+ Add_Goto (Table.States (1445), 126, 40);
+ Add_Goto (Table.States (1445), 127, 41);
+ Add_Goto (Table.States (1445), 128, 42);
+ Add_Goto (Table.States (1445), 130, 43);
+ Add_Goto (Table.States (1445), 135, 44);
+ Add_Goto (Table.States (1445), 136, 45);
+ Add_Goto (Table.States (1445), 137, 46);
+ Add_Goto (Table.States (1445), 180, 47);
+ Add_Goto (Table.States (1445), 189, 48);
+ Add_Goto (Table.States (1445), 193, 726);
+ Add_Goto (Table.States (1445), 291, 77);
+ Add_Goto (Table.States (1445), 292, 727);
+ Add_Goto (Table.States (1445), 293, 79);
+ Add_Goto (Table.States (1445), 294, 80);
+ Add_Goto (Table.States (1445), 320, 86);
+ Add_Goto (Table.States (1445), 321, 87);
+ Add_Goto (Table.States (1445), 322, 88);
+ Add_Goto (Table.States (1445), 323, 1070);
+ Add_Goto (Table.States (1445), 324, 1071);
+ Add_Goto (Table.States (1445), 325, 89);
+ Add_Goto (Table.States (1445), 327, 91);
+ Add_Goto (Table.States (1445), 328, 92);
+ Add_Goto (Table.States (1445), 329, 730);
+ Add_Goto (Table.States (1445), 330, 94);
+ Add_Goto (Table.States (1445), 332, 95);
+ Add_Goto (Table.States (1445), 333, 96);
+ Add_Goto (Table.States (1445), 334, 97);
+ Add_Goto (Table.States (1445), 335, 98);
+ Add_Goto (Table.States (1445), 336, 99);
+ Add_Goto (Table.States (1445), 337, 100);
+ Add_Goto (Table.States (1445), 338, 101);
+ Add_Goto (Table.States (1445), 339, 102);
+ Add_Goto (Table.States (1445), 340, 103);
+ Add_Goto (Table.States (1445), 341, 104);
+ Add_Goto (Table.States (1445), 346, 106);
+ Add_Goto (Table.States (1445), 347, 107);
+ Add_Goto (Table.States (1445), 394, 132);
+ Add_Goto (Table.States (1445), 403, 134);
+ Add_Goto (Table.States (1445), 404, 135);
+ Add_Goto (Table.States (1445), 405, 136);
+ Add_Goto (Table.States (1445), 406, 137);
+ Add_Goto (Table.States (1445), 408, 138);
+ Add_Goto (Table.States (1445), 431, 139);
+ Add_Goto (Table.States (1445), 437, 140);
+ Add_Goto (Table.States (1445), 438, 141);
+ Add_Goto (Table.States (1445), 440, 142);
+ Add_Goto (Table.States (1445), 454, 143);
+ Table.States (1445).Kernel := To_Vector ((((324, 1), 324, 3,
(32767, 0), 0), ((324, 2), 324, 3,
+ (32767, 0), 0), ((325, 6), 324, 1, (32767, 0), 0)));
+ Table.States (1445).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (325, 6), 66, 1785)));
+ Table.States (1446).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1446), (1 => 108), (325, 8), 6);
+ Table.States (1446).Kernel := To_Vector ((0 => ((325, 8), 308,
0, (325, 8), 6)));
+ Table.States (1446).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (325, 8), 6)));
+ Table.States (1447).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1447), 78, (180, 0), 939);
+ Table.States (1447).Kernel := To_Vector ((((180, 0), 82, 4,
(32767, 0), 0), ((180, 1), 82, 2, (32767,
+ 0), 0)));
+ Table.States (1447).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (180, 0), 78, 939)));
+ Table.States (1448).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1448), 108, (291, 0), 942);
+ Table.States (1448).Kernel := To_Vector ((0 => ((291, 0), 434,
1, (32767, 0), 0)));
+ Table.States (1448).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (291, 0), 108, 942)));
+ Table.States (1449).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1449), 86, (252, 0), 33);
+ Add_Action (Table.States (1449), 90, (268, 0), 34);
+ Add_Action (Table.States (1449), 108, Reduce, (308, 1), 0);
+ Add_Action (Table.States (1449), 116, (196, 0), 146);
+ Add_Action (Table.States (1449), 117, (196, 1), 37);
+ Add_Action (Table.States (1449), 118, (195, 6), 38);
+ Table.States (1449).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1449), 195, 1063);
+ Add_Goto (Table.States (1449), 196, 148);
+ Add_Goto (Table.States (1449), 197, 54);
+ Add_Goto (Table.States (1449), 198, 55);
+ Add_Goto (Table.States (1449), 199, 56);
+ Add_Goto (Table.States (1449), 201, 57);
+ Add_Goto (Table.States (1449), 251, 58);
+ Add_Goto (Table.States (1449), 252, 59);
+ Add_Goto (Table.States (1449), 255, 60);
+ Add_Goto (Table.States (1449), 268, 68);
+ Add_Goto (Table.States (1449), 308, 1786);
+ Add_Goto (Table.States (1449), 311, 83);
+ Table.States (1449).Kernel := To_Vector ((0 => ((325, 4), 66, 0,
(308, 1), 0)));
+ Table.States (1449).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (308, 1), 0)));
+ Table.States (1450).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (1450), 22, (339, 0), 9);
+ Add_Action (Table.States (1450), 25, (329, 1), 10);
+ Add_Action (Table.States (1450), 28, (325, 0), 720);
+ Add_Action (Table.States (1450), 50, (332, 0), 19);
+ Add_Action (Table.States (1450), 51, (437, 0), 221);
+ Add_Action (Table.States (1450), 52, (329, 0), 21);
+ Add_Action (Table.States (1450), 53, (294, 0), 22);
+ Add_Action (Table.States (1450), 54, (293, 0), 23);
+ Add_Action (Table.States (1450), 59, (346, 0), 721);
+ Add_Action (Table.States (1450), 60, (340, 0), 722);
+ Add_Action (Table.States (1450), 66, (325, 3), 1787);
+ Add_Action (Table.States (1450), 81, (130, 0), 30);
+ Add_Action (Table.States (1450), 83, (128, 0), 31);
+ Add_Action (Table.States (1450), 84, (124, 0), 32);
+ Add_Action (Table.States (1450), 116, (136, 0), 223);
+ Table.States (1450).Goto_List.Set_Capacity (48);
+ Add_Goto (Table.States (1450), 124, 725);
+ Add_Goto (Table.States (1450), 126, 40);
+ Add_Goto (Table.States (1450), 127, 41);
+ Add_Goto (Table.States (1450), 128, 42);
+ Add_Goto (Table.States (1450), 130, 43);
+ Add_Goto (Table.States (1450), 135, 44);
+ Add_Goto (Table.States (1450), 136, 45);
+ Add_Goto (Table.States (1450), 137, 46);
+ Add_Goto (Table.States (1450), 180, 47);
+ Add_Goto (Table.States (1450), 189, 48);
+ Add_Goto (Table.States (1450), 193, 726);
+ Add_Goto (Table.States (1450), 291, 77);
+ Add_Goto (Table.States (1450), 292, 727);
+ Add_Goto (Table.States (1450), 293, 79);
+ Add_Goto (Table.States (1450), 294, 80);
+ Add_Goto (Table.States (1450), 320, 86);
+ Add_Goto (Table.States (1450), 321, 87);
+ Add_Goto (Table.States (1450), 322, 88);
+ Add_Goto (Table.States (1450), 323, 1070);
+ Add_Goto (Table.States (1450), 324, 1071);
+ Add_Goto (Table.States (1450), 325, 89);
+ Add_Goto (Table.States (1450), 327, 91);
+ Add_Goto (Table.States (1450), 328, 92);
+ Add_Goto (Table.States (1450), 329, 730);
+ Add_Goto (Table.States (1450), 330, 94);
+ Add_Goto (Table.States (1450), 332, 95);
+ Add_Goto (Table.States (1450), 333, 96);
+ Add_Goto (Table.States (1450), 334, 97);
+ Add_Goto (Table.States (1450), 335, 98);
+ Add_Goto (Table.States (1450), 336, 99);
+ Add_Goto (Table.States (1450), 337, 100);
+ Add_Goto (Table.States (1450), 338, 101);
+ Add_Goto (Table.States (1450), 339, 102);
+ Add_Goto (Table.States (1450), 340, 103);
+ Add_Goto (Table.States (1450), 341, 104);
+ Add_Goto (Table.States (1450), 346, 106);
+ Add_Goto (Table.States (1450), 347, 107);
+ Add_Goto (Table.States (1450), 394, 132);
+ Add_Goto (Table.States (1450), 403, 134);
+ Add_Goto (Table.States (1450), 404, 135);
+ Add_Goto (Table.States (1450), 405, 136);
+ Add_Goto (Table.States (1450), 406, 137);
+ Add_Goto (Table.States (1450), 408, 138);
+ Add_Goto (Table.States (1450), 431, 139);
+ Add_Goto (Table.States (1450), 437, 140);
+ Add_Goto (Table.States (1450), 438, 141);
+ Add_Goto (Table.States (1450), 440, 142);
+ Add_Goto (Table.States (1450), 454, 143);
+ Table.States (1450).Kernel := To_Vector ((((324, 1), 324, 3,
(32767, 0), 0), ((324, 2), 324, 3,
+ (32767, 0), 0), ((325, 3), 324, 1, (32767, 0), 0)));
+ Table.States (1450).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (325, 3), 66, 1787)));
+ Table.States (1451).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1451), (1 => 108), (325, 5), 6);
+ Table.States (1451).Kernel := To_Vector ((0 => ((325, 5), 308,
0, (325, 5), 6)));
+ Table.States (1451).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (325, 5), 6)));
+ Table.States (1452).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (1452), 22, (339, 0), 9);
+ Add_Action (Table.States (1452), 25, (329, 1), 10);
+ Add_Action (Table.States (1452), 28, (325, 0), 720);
+ Add_Action (Table.States (1452), 50, (332, 0), 19);
+ Add_Action (Table.States (1452), 51, (437, 0), 221);
+ Add_Action (Table.States (1452), 52, (329, 0), 21);
+ Add_Action (Table.States (1452), 53, (294, 0), 22);
+ Add_Action (Table.States (1452), 54, (293, 0), 23);
+ Add_Action (Table.States (1452), 59, (346, 0), 721);
+ Add_Action (Table.States (1452), 60, (340, 0), 722);
+ Add_Action (Table.States (1452), 66, (325, 1), 1788);
+ Add_Action (Table.States (1452), 81, (130, 0), 30);
+ Add_Action (Table.States (1452), 83, (128, 0), 31);
+ Add_Action (Table.States (1452), 84, (124, 0), 32);
+ Add_Action (Table.States (1452), 116, (136, 0), 223);
+ Table.States (1452).Goto_List.Set_Capacity (48);
+ Add_Goto (Table.States (1452), 124, 725);
+ Add_Goto (Table.States (1452), 126, 40);
+ Add_Goto (Table.States (1452), 127, 41);
+ Add_Goto (Table.States (1452), 128, 42);
+ Add_Goto (Table.States (1452), 130, 43);
+ Add_Goto (Table.States (1452), 135, 44);
+ Add_Goto (Table.States (1452), 136, 45);
+ Add_Goto (Table.States (1452), 137, 46);
+ Add_Goto (Table.States (1452), 180, 47);
+ Add_Goto (Table.States (1452), 189, 48);
+ Add_Goto (Table.States (1452), 193, 726);
+ Add_Goto (Table.States (1452), 291, 77);
+ Add_Goto (Table.States (1452), 292, 727);
+ Add_Goto (Table.States (1452), 293, 79);
+ Add_Goto (Table.States (1452), 294, 80);
+ Add_Goto (Table.States (1452), 320, 86);
+ Add_Goto (Table.States (1452), 321, 87);
+ Add_Goto (Table.States (1452), 322, 88);
+ Add_Goto (Table.States (1452), 323, 728);
+ Add_Goto (Table.States (1452), 324, 1789);
+ Add_Goto (Table.States (1452), 325, 89);
+ Add_Goto (Table.States (1452), 327, 91);
+ Add_Goto (Table.States (1452), 328, 92);
+ Add_Goto (Table.States (1452), 329, 730);
+ Add_Goto (Table.States (1452), 330, 94);
+ Add_Goto (Table.States (1452), 332, 95);
+ Add_Goto (Table.States (1452), 333, 96);
+ Add_Goto (Table.States (1452), 334, 97);
+ Add_Goto (Table.States (1452), 335, 98);
+ Add_Goto (Table.States (1452), 336, 99);
+ Add_Goto (Table.States (1452), 337, 100);
+ Add_Goto (Table.States (1452), 338, 101);
+ Add_Goto (Table.States (1452), 339, 102);
+ Add_Goto (Table.States (1452), 340, 103);
+ Add_Goto (Table.States (1452), 341, 104);
+ Add_Goto (Table.States (1452), 346, 106);
+ Add_Goto (Table.States (1452), 347, 107);
+ Add_Goto (Table.States (1452), 394, 132);
+ Add_Goto (Table.States (1452), 403, 134);
+ Add_Goto (Table.States (1452), 404, 135);
+ Add_Goto (Table.States (1452), 405, 136);
+ Add_Goto (Table.States (1452), 406, 137);
+ Add_Goto (Table.States (1452), 408, 138);
+ Add_Goto (Table.States (1452), 431, 139);
+ Add_Goto (Table.States (1452), 437, 140);
+ Add_Goto (Table.States (1452), 438, 141);
+ Add_Goto (Table.States (1452), 440, 142);
+ Add_Goto (Table.States (1452), 454, 143);
+ Table.States (1452).Kernel := To_Vector ((((325, 0), 27, 4,
(32767, 0), 0), ((325, 1), 27, 1, (32767,
+ 0), 0)));
+ Table.States (1452).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (325, 1), 66, 1788)));
+ Table.States (1453).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1453), 86, (252, 0), 33);
+ Add_Action (Table.States (1453), 90, (268, 0), 34);
+ Add_Action (Table.States (1453), 108, Reduce, (308, 1), 0);
+ Add_Action (Table.States (1453), 116, (196, 0), 146);
+ Add_Action (Table.States (1453), 117, (196, 1), 37);
+ Add_Action (Table.States (1453), 118, (195, 6), 38);
+ Table.States (1453).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1453), 195, 1063);
+ Add_Goto (Table.States (1453), 196, 148);
+ Add_Goto (Table.States (1453), 197, 54);
+ Add_Goto (Table.States (1453), 198, 55);
+ Add_Goto (Table.States (1453), 199, 56);
+ Add_Goto (Table.States (1453), 201, 57);
+ Add_Goto (Table.States (1453), 251, 58);
+ Add_Goto (Table.States (1453), 252, 59);
+ Add_Goto (Table.States (1453), 255, 60);
+ Add_Goto (Table.States (1453), 268, 68);
+ Add_Goto (Table.States (1453), 308, 1790);
+ Add_Goto (Table.States (1453), 311, 83);
+ Table.States (1453).Kernel := To_Vector ((0 => ((325, 2), 66, 0,
(308, 1), 0)));
+ Table.States (1453).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (308, 1), 0)));
+ Table.States (1454).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1454), (33, 108), (317, 4), 5);
+ Table.States (1454).Kernel := To_Vector ((0 => ((317, 4), 134,
0, (317, 4), 5)));
+ Table.States (1454).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (317, 4), 5)));
+ Table.States (1455).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1455), 33, Reduce, (317, 1), 5);
+ Add_Action (Table.States (1455), 94, (134, 0), 282);
+ Add_Action (Table.States (1455), 108, Reduce, (317, 1), 5);
+ Table.States (1455).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1455), 134, 1791);
+ Table.States (1455).Kernel := To_Vector ((((317, 0), 319, 2,
(32767, 0), 0), ((317, 1), 319, 0, (317,
+ 1), 5)));
+ Table.States (1455).Minimal_Complete_Actions := To_Vector
(((Shift, (134, 0), 94, 282), (Reduce, (317, 1),
+ 5)));
+ Table.States (1456).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1456), (33, 108), (317, 2), 5);
+ Table.States (1456).Kernel := To_Vector ((0 => ((317, 2), 134,
0, (317, 2), 5)));
+ Table.States (1456).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (317, 2), 5)));
+ Table.States (1457).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1457), 108, (318, 0), 1792);
+ Table.States (1457).Kernel := To_Vector ((0 => ((318, 0), 30, 1,
(32767, 0), 0)));
+ Table.States (1457).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (318, 0), 108, 1792)));
+ Table.States (1458).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1458), (91, 99), (400, 1), 1);
+ Table.States (1458).Kernel := To_Vector ((0 => ((400, 1), 62, 0,
(400, 1), 1)));
+ Table.States (1458).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (400, 1), 1)));
+ Table.States (1459).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1459), 85, Reduce, (196, 0), 1);
+ Add_Action (Table.States (1459), 91, Reduce, (196, 0), 1);
+ Add_Action (Table.States (1459), 93, Reduce, (399, 0), 1);
+ Add_Action (Table.States (1459), 96, Reduce, (196, 0), 1);
+ Add_Action (Table.States (1459), 99, Reduce, (196, 0), 1);
+ Add_Action (Table.States (1459), 113, Reduce, (196, 0), 1);
+ Add_Action (Table.States (1459), 114, Reduce, (196, 0), 1);
+ Table.States (1459).Kernel := To_Vector ((((196, 0), 116, 0,
(196, 0), 1), ((399, 0), 116, 0, (399,
+ 0), 1)));
+ Table.States (1459).Minimal_Complete_Actions := To_Vector
(((Reduce, (196, 0), 1), (Reduce, (399, 0),
+ 1)));
+ Table.States (1460).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1460), 85, (198, 0), 281);
+ Add_Action (Table.States (1460), 91, Reduce, (400, 0), 1);
+ Add_Action (Table.States (1460), 96, (197, 0), 283);
+ Add_Action (Table.States (1460), 99, Reduce, (400, 0), 1);
+ Add_Action (Table.States (1460), 113, (121, 0), 285);
+ Add_Action (Table.States (1460), 114, (121, 1), 286);
+ Table.States (1460).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1460), 121, 287);
+ Add_Goto (Table.States (1460), 313, 289);
+ Table.States (1460).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((400, 0), 195, 0, (400, 0), 1)));
+ Table.States (1460).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (400, 0), 1)));
+ Table.States (1461).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1461), 91, (397, 1), 1793);
+ Add_Action (Table.States (1461), 99, (398, 1), 1794);
+ Table.States (1461).Kernel := To_Vector ((((397, 1), 397, 2,
(32767, 0), 0), ((397, 2), 397, 2,
+ (32767, 0), 0), ((398, 1), 397, 3, (32767, 0), 0)));
+ Table.States (1461).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (398, 1), 99, 1794)));
+ Table.States (1462).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1462), 93, (398, 0), 1795);
+ Table.States (1462).Kernel := To_Vector ((0 => ((398, 0), 399,
5, (32767, 0), 0)));
+ Table.States (1462).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (398, 0), 93, 1795)));
+ end Subr_53;
+ procedure Subr_54
+ is begin
+ Table.States (1463).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1463), (91, 99), (397, 0), 1);
+ Table.States (1463).Kernel := To_Vector ((0 => ((397, 0), 400,
0, (397, 0), 1)));
+ Table.States (1463).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (397, 0), 1)));
+ Table.States (1464).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1464), (63, 66, 75), (395, 2), 2);
+ Table.States (1464).Kernel := To_Vector ((0 => ((395, 2), 398,
0, (395, 2), 2)));
+ Table.States (1464).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (395, 2), 2)));
+ Table.States (1465).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1465), 33, (288, 0), 1796);
+ Table.States (1465).Kernel := To_Vector ((0 => ((288, 0), 66, 2,
(32767, 0), 0)));
+ Table.States (1465).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (288, 0), 33, 1796)));
+ Table.States (1466).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (1466), 12, (401, 0), 1);
+ Add_Action (Table.States (1466), 15, (370, 0), 3);
+ Add_Action (Table.States (1466), 17, (365, 0), 4);
+ Add_Action (Table.States (1466), 18, (382, 0), 5);
+ Add_Action (Table.States (1466), 19, (363, 0), 6);
+ Add_Action (Table.States (1466), 20, (357, 0), 7);
+ Add_Action (Table.States (1466), 30, (316, 0), 13);
+ Add_Action (Table.States (1466), 31, (290, 0), 14);
+ Add_Action (Table.States (1466), 32, (289, 0), 15);
+ Add_Action (Table.States (1466), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1466), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1466), 37, (288, 0), 17);
+ Add_Conflict (Table.States (1466), 37, (285, 1), 0);
+ Add_Action (Table.States (1466), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1466), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1466), 42, (271, 0), 18);
+ Add_Action (Table.States (1466), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1466), 64, (273, 0), 27);
+ Add_Action (Table.States (1466), 65, (264, 0), 28);
+ Add_Action (Table.States (1466), 84, (124, 0), 32);
+ Add_Action (Table.States (1466), 86, (252, 0), 33);
+ Add_Action (Table.States (1466), 90, (268, 0), 34);
+ Add_Action (Table.States (1466), 105, (265, 0), 35);
+ Add_Action (Table.States (1466), 116, (196, 0), 146);
+ Add_Action (Table.States (1466), 117, (196, 1), 37);
+ Add_Action (Table.States (1466), 118, (195, 6), 38);
+ Table.States (1466).Goto_List.Set_Capacity (46);
+ Add_Goto (Table.States (1466), 124, 39);
+ Add_Goto (Table.States (1466), 195, 52);
+ Add_Goto (Table.States (1466), 196, 53);
+ Add_Goto (Table.States (1466), 197, 54);
+ Add_Goto (Table.States (1466), 198, 55);
+ Add_Goto (Table.States (1466), 199, 56);
+ Add_Goto (Table.States (1466), 201, 57);
+ Add_Goto (Table.States (1466), 251, 58);
+ Add_Goto (Table.States (1466), 252, 59);
+ Add_Goto (Table.States (1466), 255, 60);
+ Add_Goto (Table.States (1466), 259, 452);
+ Add_Goto (Table.States (1466), 261, 331);
+ Add_Goto (Table.States (1466), 262, 62);
+ Add_Goto (Table.States (1466), 263, 63);
+ Add_Goto (Table.States (1466), 264, 64);
+ Add_Goto (Table.States (1466), 265, 65);
+ Add_Goto (Table.States (1466), 266, 66);
+ Add_Goto (Table.States (1466), 267, 67);
+ Add_Goto (Table.States (1466), 268, 68);
+ Add_Goto (Table.States (1466), 271, 69);
+ Add_Goto (Table.States (1466), 273, 70);
+ Add_Goto (Table.States (1466), 275, 71);
+ Add_Goto (Table.States (1466), 285, 72);
+ Add_Goto (Table.States (1466), 286, 73);
+ Add_Goto (Table.States (1466), 288, 74);
+ Add_Goto (Table.States (1466), 289, 75);
+ Add_Goto (Table.States (1466), 290, 76);
+ Add_Goto (Table.States (1466), 310, 82);
+ Add_Goto (Table.States (1466), 311, 83);
+ Add_Goto (Table.States (1466), 316, 84);
+ Add_Goto (Table.States (1466), 318, 85);
+ Add_Goto (Table.States (1466), 357, 110);
+ Add_Goto (Table.States (1466), 363, 111);
+ Add_Goto (Table.States (1466), 364, 112);
+ Add_Goto (Table.States (1466), 365, 113);
+ Add_Goto (Table.States (1466), 366, 114);
+ Add_Goto (Table.States (1466), 367, 115);
+ Add_Goto (Table.States (1466), 370, 116);
+ Add_Goto (Table.States (1466), 376, 117);
+ Add_Goto (Table.States (1466), 378, 118);
+ Add_Goto (Table.States (1466), 379, 119);
+ Add_Goto (Table.States (1466), 382, 120);
+ Add_Goto (Table.States (1466), 396, 1797);
+ Add_Goto (Table.States (1466), 401, 133);
+ Add_Goto (Table.States (1466), 461, 332);
+ Add_Goto (Table.States (1466), 462, 144);
+ Table.States (1466).Kernel := To_Vector ((0 => ((287, 1), 75, 2,
(32767, 0), 0)));
+ Table.States (1466).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ Table.States (1467).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1467), (1 => 36), (276, 5), 6);
+ Table.States (1467).Kernel := To_Vector ((0 => ((276, 5), 278,
0, (276, 5), 6)));
+ Table.States (1467).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (276, 5), 6)));
+ Table.States (1468).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1468), (1 => 36), (276, 7), 6);
+ Table.States (1468).Kernel := To_Vector ((0 => ((276, 7), 280,
0, (276, 7), 6)));
+ Table.States (1468).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (276, 7), 6)));
+ Table.States (1469).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1469), 66, (271, 2), 1798);
+ Table.States (1469).Kernel := To_Vector ((0 => ((271, 2), 259,
3, (32767, 0), 0)));
+ Table.States (1469).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (271, 2), 66, 1798)));
+ Table.States (1470).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1470), 43, (269, 0), 1799);
+ Table.States (1470).Kernel := To_Vector ((0 => ((269, 0), 243,
3, (32767, 0), 0)));
+ Table.States (1470).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (269, 0), 43, 1799)));
+ Table.States (1471).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1471), 108, (271, 3), 1800);
+ Table.States (1471).Kernel := To_Vector ((0 => ((271, 3), 42, 1,
(32767, 0), 0)));
+ Table.States (1471).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (271, 3), 108, 1800)));
+ Table.States (1472).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (1472), 12, (401, 0), 1);
+ Add_Action (Table.States (1472), 15, (370, 0), 3);
+ Add_Action (Table.States (1472), 17, (365, 0), 4);
+ Add_Action (Table.States (1472), 18, (382, 0), 5);
+ Add_Action (Table.States (1472), 19, (363, 0), 6);
+ Add_Action (Table.States (1472), 20, (357, 0), 7);
+ Add_Action (Table.States (1472), 30, (316, 0), 13);
+ Add_Action (Table.States (1472), 31, (290, 0), 14);
+ Add_Action (Table.States (1472), 32, (289, 0), 15);
+ Add_Action (Table.States (1472), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1472), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1472), 37, (288, 0), 17);
+ Add_Conflict (Table.States (1472), 37, (285, 1), 0);
+ Add_Action (Table.States (1472), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1472), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1472), 42, (271, 0), 18);
+ Add_Action (Table.States (1472), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1472), 64, (273, 0), 27);
+ Add_Action (Table.States (1472), 65, (264, 0), 28);
+ Add_Action (Table.States (1472), 84, (124, 0), 32);
+ Add_Action (Table.States (1472), 86, (252, 0), 33);
+ Add_Action (Table.States (1472), 90, (268, 0), 34);
+ Add_Action (Table.States (1472), 105, (265, 0), 35);
+ Add_Action (Table.States (1472), 116, (196, 0), 146);
+ Add_Action (Table.States (1472), 117, (196, 1), 37);
+ Add_Action (Table.States (1472), 118, (195, 6), 38);
+ Table.States (1472).Goto_List.Set_Capacity (45);
+ Add_Goto (Table.States (1472), 124, 39);
+ Add_Goto (Table.States (1472), 195, 52);
+ Add_Goto (Table.States (1472), 196, 53);
+ Add_Goto (Table.States (1472), 197, 54);
+ Add_Goto (Table.States (1472), 198, 55);
+ Add_Goto (Table.States (1472), 199, 56);
+ Add_Goto (Table.States (1472), 201, 57);
+ Add_Goto (Table.States (1472), 251, 58);
+ Add_Goto (Table.States (1472), 252, 59);
+ Add_Goto (Table.States (1472), 255, 60);
+ Add_Goto (Table.States (1472), 259, 1801);
+ Add_Goto (Table.States (1472), 261, 331);
+ Add_Goto (Table.States (1472), 262, 62);
+ Add_Goto (Table.States (1472), 263, 63);
+ Add_Goto (Table.States (1472), 264, 64);
+ Add_Goto (Table.States (1472), 265, 65);
+ Add_Goto (Table.States (1472), 266, 66);
+ Add_Goto (Table.States (1472), 267, 67);
+ Add_Goto (Table.States (1472), 268, 68);
+ Add_Goto (Table.States (1472), 271, 69);
+ Add_Goto (Table.States (1472), 273, 70);
+ Add_Goto (Table.States (1472), 275, 71);
+ Add_Goto (Table.States (1472), 285, 72);
+ Add_Goto (Table.States (1472), 286, 73);
+ Add_Goto (Table.States (1472), 288, 74);
+ Add_Goto (Table.States (1472), 289, 75);
+ Add_Goto (Table.States (1472), 290, 76);
+ Add_Goto (Table.States (1472), 310, 82);
+ Add_Goto (Table.States (1472), 311, 83);
+ Add_Goto (Table.States (1472), 316, 84);
+ Add_Goto (Table.States (1472), 318, 85);
+ Add_Goto (Table.States (1472), 357, 110);
+ Add_Goto (Table.States (1472), 363, 111);
+ Add_Goto (Table.States (1472), 364, 112);
+ Add_Goto (Table.States (1472), 365, 113);
+ Add_Goto (Table.States (1472), 366, 114);
+ Add_Goto (Table.States (1472), 367, 115);
+ Add_Goto (Table.States (1472), 370, 116);
+ Add_Goto (Table.States (1472), 376, 117);
+ Add_Goto (Table.States (1472), 378, 118);
+ Add_Goto (Table.States (1472), 379, 119);
+ Add_Goto (Table.States (1472), 382, 120);
+ Add_Goto (Table.States (1472), 401, 133);
+ Add_Goto (Table.States (1472), 461, 332);
+ Add_Goto (Table.States (1472), 462, 144);
+ Table.States (1472).Kernel := To_Vector ((0 => ((271, 0), 41, 5,
(32767, 0), 0)));
+ Table.States (1472).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ Table.States (1473).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1473), 42, (271, 1), 1802);
+ Table.States (1473).Kernel := To_Vector ((0 => ((271, 1), 66, 2,
(32767, 0), 0)));
+ Table.States (1473).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (271, 1), 42, 1802)));
+ Table.States (1474).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1474), (41, 44, 66), (270, 1), 2);
+ Table.States (1474).Kernel := To_Vector ((0 => ((270, 1), 269,
0, (270, 1), 2)));
+ Table.States (1474).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (270, 1), 2)));
+ Table.States (1475).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1475), 52, (187, 0), 347);
+ Add_Action (Table.States (1475), 86, (252, 0), 33);
+ Add_Action (Table.States (1475), 90, (268, 0), 34);
+ Add_Action (Table.States (1475), 116, (196, 0), 146);
+ Add_Action (Table.States (1475), 117, (196, 1), 37);
+ Add_Action (Table.States (1475), 118, (195, 6), 38);
+ Table.States (1475).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1475), 187, 1803);
+ Add_Goto (Table.States (1475), 195, 1804);
+ Add_Goto (Table.States (1475), 196, 148);
+ Add_Goto (Table.States (1475), 197, 54);
+ Add_Goto (Table.States (1475), 198, 55);
+ Add_Goto (Table.States (1475), 199, 56);
+ Add_Goto (Table.States (1475), 201, 57);
+ Add_Goto (Table.States (1475), 251, 58);
+ Add_Goto (Table.States (1475), 252, 59);
+ Add_Goto (Table.States (1475), 255, 60);
+ Add_Goto (Table.States (1475), 268, 68);
+ Add_Goto (Table.States (1475), 311, 83);
+ Table.States (1475).Kernel := To_Vector ((((300, 0), 301, 5,
(32767, 0), 0), ((300, 1), 301, 3,
+ (32767, 0), 0), ((300, 2), 301, 3, (32767, 0), 0), ((300, 3),
301, 1, (32767, 0), 0)));
+ Table.States (1475).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1476).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1476), (87, 108), (300, 8), 4);
+ Table.States (1476).Kernel := To_Vector ((0 => ((300, 8), 134,
0, (300, 8), 4)));
+ Table.States (1476).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (300, 8), 4)));
+ Table.States (1477).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1477), 86, (252, 0), 33);
+ Add_Action (Table.States (1477), 90, (268, 0), 34);
+ Add_Action (Table.States (1477), 116, (196, 0), 146);
+ Add_Action (Table.States (1477), 117, (196, 1), 37);
+ Add_Action (Table.States (1477), 118, (195, 6), 38);
+ Table.States (1477).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (1477), 195, 1805);
+ Add_Goto (Table.States (1477), 196, 148);
+ Add_Goto (Table.States (1477), 197, 54);
+ Add_Goto (Table.States (1477), 198, 55);
+ Add_Goto (Table.States (1477), 199, 56);
+ Add_Goto (Table.States (1477), 201, 57);
+ Add_Goto (Table.States (1477), 251, 58);
+ Add_Goto (Table.States (1477), 252, 59);
+ Add_Goto (Table.States (1477), 255, 60);
+ Add_Goto (Table.States (1477), 268, 68);
+ Add_Goto (Table.States (1477), 311, 83);
+ Table.States (1477).Kernel := To_Vector ((((300, 4), 187, 3,
(32767, 0), 0), ((300, 5), 187, 1,
+ (32767, 0), 0)));
+ Table.States (1477).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1478).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1478), 85, (198, 0), 281);
+ Add_Action (Table.States (1478), 87, Reduce, (300, 7), 4);
+ Add_Action (Table.States (1478), 94, (134, 0), 282);
+ Add_Action (Table.States (1478), 96, (197, 0), 283);
+ Add_Action (Table.States (1478), 108, Reduce, (300, 7), 4);
+ Add_Action (Table.States (1478), 113, (121, 0), 285);
+ Add_Action (Table.States (1478), 114, (121, 1), 286);
+ Table.States (1478).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1478), 121, 287);
+ Add_Goto (Table.States (1478), 134, 1806);
+ Add_Goto (Table.States (1478), 313, 289);
+ Table.States (1478).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((300, 6), 195, 2, (32767, 0), 0),
((300, 7), 195, 0, (300, 7), 4), ((311,
+ 0), 195, 3, (32767, 0), 0)));
+ Table.States (1478).Minimal_Complete_Actions := To_Vector
(((Shift, (134, 0), 94, 282), (Reduce, (300, 7),
+ 4)));
+ Table.States (1479).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1479), (36, 50, 99), (278, 0), 5);
+ Table.States (1479).Kernel := To_Vector ((0 => ((278, 0), 279,
0, (278, 0), 5)));
+ Table.States (1479).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (278, 0), 5)));
+ Table.States (1480).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1480), (36, 50, 99), (280, 4), 5);
+ Table.States (1480).Kernel := To_Vector ((0 => ((280, 4), 279,
0, (280, 4), 5)));
+ Table.States (1480).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (280, 4), 5)));
+ Table.States (1481).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1481), (36, 50, 99), (279, 0), 2);
+ Table.States (1481).Kernel := To_Vector ((0 => ((279, 0), 243,
0, (279, 0), 2)));
+ Table.States (1481).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (279, 0), 2)));
+ Table.States (1482).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1482), (36, 50, 99), (280, 12), 5);
+ Table.States (1482).Kernel := To_Vector ((0 => ((280, 12), 279,
0, (280, 12), 5)));
+ Table.States (1482).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (280, 12), 5)));
+ Table.States (1483).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1483), 86, (252, 0), 33);
+ Add_Action (Table.States (1483), 90, (268, 0), 34);
+ Add_Action (Table.States (1483), 116, (196, 0), 146);
+ Add_Action (Table.States (1483), 117, (196, 1), 37);
+ Add_Action (Table.States (1483), 118, (195, 6), 38);
+ Table.States (1483).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (1483), 195, 1807);
+ Add_Goto (Table.States (1483), 196, 148);
+ Add_Goto (Table.States (1483), 197, 54);
+ Add_Goto (Table.States (1483), 198, 55);
+ Add_Goto (Table.States (1483), 199, 56);
+ Add_Goto (Table.States (1483), 201, 57);
+ Add_Goto (Table.States (1483), 251, 58);
+ Add_Goto (Table.States (1483), 252, 59);
+ Add_Goto (Table.States (1483), 255, 60);
+ Add_Goto (Table.States (1483), 268, 68);
+ Add_Goto (Table.States (1483), 311, 83);
+ Table.States (1483).Kernel := To_Vector ((((280, 0), 34, 3,
(32767, 0), 0), ((280, 1), 34, 1, (32767,
+ 0), 0)));
+ Table.States (1483).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1484).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1484), 36, Reduce, (280, 3), 5);
+ Add_Action (Table.States (1484), 50, Reduce, (280, 3), 5);
+ Add_Action (Table.States (1484), 63, (279, 0), 1104);
+ Add_Action (Table.States (1484), 85, (198, 0), 281);
+ Add_Action (Table.States (1484), 96, (197, 0), 283);
+ Add_Action (Table.States (1484), 99, Reduce, (280, 3), 5);
+ Add_Action (Table.States (1484), 113, (121, 0), 285);
+ Add_Action (Table.States (1484), 114, (121, 1), 286);
+ Table.States (1484).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1484), 121, 287);
+ Add_Goto (Table.States (1484), 279, 1808);
+ Add_Goto (Table.States (1484), 313, 289);
+ Table.States (1484).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((280, 2), 195, 2, (32767, 0), 0),
((280, 3), 195, 0, (280, 3), 5), ((311,
+ 0), 195, 3, (32767, 0), 0)));
+ Table.States (1484).Minimal_Complete_Actions := To_Vector
(((Shift, (279, 0), 63, 1104), (Reduce, (280,
+ 3), 5)));
+ Table.States (1485).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1485), 86, (252, 0), 33);
+ Add_Action (Table.States (1485), 90, (268, 0), 34);
+ Add_Action (Table.States (1485), 116, (196, 0), 146);
+ Add_Action (Table.States (1485), 117, (196, 1), 37);
+ Add_Action (Table.States (1485), 118, (195, 6), 38);
+ Table.States (1485).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (1485), 195, 1809);
+ Add_Goto (Table.States (1485), 196, 148);
+ Add_Goto (Table.States (1485), 197, 54);
+ Add_Goto (Table.States (1485), 198, 55);
+ Add_Goto (Table.States (1485), 199, 56);
+ Add_Goto (Table.States (1485), 201, 57);
+ Add_Goto (Table.States (1485), 251, 58);
+ Add_Goto (Table.States (1485), 252, 59);
+ Add_Goto (Table.States (1485), 255, 60);
+ Add_Goto (Table.States (1485), 268, 68);
+ Add_Goto (Table.States (1485), 311, 83);
+ Table.States (1485).Kernel := To_Vector ((((280, 8), 34, 3,
(32767, 0), 0), ((280, 9), 34, 1, (32767,
+ 0), 0)));
+ Table.States (1485).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1486).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1486), 36, Reduce, (280, 11), 5);
+ Add_Action (Table.States (1486), 50, Reduce, (280, 11), 5);
+ Add_Action (Table.States (1486), 63, (279, 0), 1104);
+ Add_Action (Table.States (1486), 85, (198, 0), 281);
+ Add_Action (Table.States (1486), 96, (197, 0), 283);
+ Add_Action (Table.States (1486), 99, Reduce, (280, 11), 5);
+ Add_Action (Table.States (1486), 113, (121, 0), 285);
+ Add_Action (Table.States (1486), 114, (121, 1), 286);
+ Table.States (1486).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1486), 121, 287);
+ Add_Goto (Table.States (1486), 279, 1810);
+ Add_Goto (Table.States (1486), 313, 289);
+ Table.States (1486).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((280, 10), 195, 2, (32767, 0), 0),
((280, 11), 195, 0, (280, 11), 5),
+ ((311, 0), 195, 3, (32767, 0), 0)));
+ Table.States (1486).Minimal_Complete_Actions := To_Vector
(((Shift, (279, 0), 63, 1104), (Reduce, (280,
+ 11), 5)));
+ Table.States (1487).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (1487), 12, (402, 0), 165);
+ Add_Action (Table.States (1487), 46, (233, 2), 167);
+ Add_Action (Table.States (1487), 52, (233, 3), 168);
+ Add_Action (Table.States (1487), 65, (234, 1), 169);
+ Add_Action (Table.States (1487), 76, (256, 0), 170);
+ Add_Action (Table.States (1487), 85, (205, 4), 171);
+ Add_Action (Table.States (1487), 86, (213, 2), 172);
+ Add_Action (Table.States (1487), 90, (268, 0), 34);
+ Add_Action (Table.States (1487), 106, (237, 1), 173);
+ Add_Action (Table.States (1487), 107, (237, 0), 174);
+ Add_Action (Table.States (1487), 115, (234, 0), 175);
+ Add_Action (Table.States (1487), 116, (196, 0), 146);
+ Add_Action (Table.States (1487), 117, (196, 1), 37);
+ Add_Action (Table.States (1487), 118, (195, 6), 38);
+ Table.States (1487).Goto_List.Set_Capacity (31);
+ Add_Goto (Table.States (1487), 195, 176);
+ Add_Goto (Table.States (1487), 196, 148);
+ Add_Goto (Table.States (1487), 197, 54);
+ Add_Goto (Table.States (1487), 198, 55);
+ Add_Goto (Table.States (1487), 199, 56);
+ Add_Goto (Table.States (1487), 201, 57);
+ Add_Goto (Table.States (1487), 205, 177);
+ Add_Goto (Table.States (1487), 206, 178);
+ Add_Goto (Table.States (1487), 210, 179);
+ Add_Goto (Table.States (1487), 211, 180);
+ Add_Goto (Table.States (1487), 213, 181);
+ Add_Goto (Table.States (1487), 214, 182);
+ Add_Goto (Table.States (1487), 215, 183);
+ Add_Goto (Table.States (1487), 218, 184);
+ Add_Goto (Table.States (1487), 219, 185);
+ Add_Goto (Table.States (1487), 220, 186);
+ Add_Goto (Table.States (1487), 227, 1811);
+ Add_Goto (Table.States (1487), 228, 188);
+ Add_Goto (Table.States (1487), 231, 189);
+ Add_Goto (Table.States (1487), 232, 190);
+ Add_Goto (Table.States (1487), 233, 191);
+ Add_Goto (Table.States (1487), 234, 192);
+ Add_Goto (Table.States (1487), 237, 193);
+ Add_Goto (Table.States (1487), 251, 58);
+ Add_Goto (Table.States (1487), 252, 59);
+ Add_Goto (Table.States (1487), 255, 60);
+ Add_Goto (Table.States (1487), 256, 194);
+ Add_Goto (Table.States (1487), 268, 68);
+ Add_Goto (Table.States (1487), 311, 83);
+ Add_Goto (Table.States (1487), 402, 195);
+ Add_Goto (Table.States (1487), 465, 196);
+ Table.States (1487).Kernel := To_Vector ((0 => ((455, 0), 73, 2,
(32767, 0), 0)));
+ Table.States (1487).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ end Subr_54;
+ procedure Subr_55
+ is begin
+ Table.States (1488).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1488), 86, (252, 0), 33);
+ Add_Action (Table.States (1488), 90, (268, 0), 34);
+ Add_Action (Table.States (1488), 108, (440, 7), 1812);
+ Add_Action (Table.States (1488), 116, (196, 0), 146);
+ Add_Action (Table.States (1488), 117, (196, 1), 37);
+ Add_Action (Table.States (1488), 118, (195, 6), 38);
+ Table.States (1488).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (1488), 195, 1813);
+ Add_Goto (Table.States (1488), 196, 148);
+ Add_Goto (Table.States (1488), 197, 54);
+ Add_Goto (Table.States (1488), 198, 55);
+ Add_Goto (Table.States (1488), 199, 56);
+ Add_Goto (Table.States (1488), 201, 57);
+ Add_Goto (Table.States (1488), 251, 58);
+ Add_Goto (Table.States (1488), 252, 59);
+ Add_Goto (Table.States (1488), 255, 60);
+ Add_Goto (Table.States (1488), 268, 68);
+ Add_Goto (Table.States (1488), 311, 83);
+ Table.States (1488).Kernel := To_Vector ((((440, 6), 67, 2,
(32767, 0), 0), ((440, 7), 67, 1, (32767,
+ 0), 0)));
+ Table.States (1488).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (440, 7), 108, 1812)));
+ Table.States (1489).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (1489), 12, (402, 0), 165);
+ Add_Action (Table.States (1489), 46, (233, 2), 167);
+ Add_Action (Table.States (1489), 52, (233, 3), 168);
+ Add_Action (Table.States (1489), 65, (234, 1), 169);
+ Add_Action (Table.States (1489), 76, (256, 0), 170);
+ Add_Action (Table.States (1489), 85, (205, 4), 171);
+ Add_Action (Table.States (1489), 86, (213, 2), 172);
+ Add_Action (Table.States (1489), 90, (268, 0), 34);
+ Add_Action (Table.States (1489), 106, (237, 1), 173);
+ Add_Action (Table.States (1489), 107, (237, 0), 174);
+ Add_Action (Table.States (1489), 115, (234, 0), 175);
+ Add_Action (Table.States (1489), 116, (196, 0), 146);
+ Add_Action (Table.States (1489), 117, (196, 1), 37);
+ Add_Action (Table.States (1489), 118, (195, 6), 38);
+ Table.States (1489).Goto_List.Set_Capacity (32);
+ Add_Goto (Table.States (1489), 195, 176);
+ Add_Goto (Table.States (1489), 196, 148);
+ Add_Goto (Table.States (1489), 197, 54);
+ Add_Goto (Table.States (1489), 198, 55);
+ Add_Goto (Table.States (1489), 199, 56);
+ Add_Goto (Table.States (1489), 201, 57);
+ Add_Goto (Table.States (1489), 205, 177);
+ Add_Goto (Table.States (1489), 206, 178);
+ Add_Goto (Table.States (1489), 210, 179);
+ Add_Goto (Table.States (1489), 211, 180);
+ Add_Goto (Table.States (1489), 213, 181);
+ Add_Goto (Table.States (1489), 214, 182);
+ Add_Goto (Table.States (1489), 215, 183);
+ Add_Goto (Table.States (1489), 218, 184);
+ Add_Goto (Table.States (1489), 219, 185);
+ Add_Goto (Table.States (1489), 220, 186);
+ Add_Goto (Table.States (1489), 227, 1814);
+ Add_Goto (Table.States (1489), 228, 188);
+ Add_Goto (Table.States (1489), 231, 189);
+ Add_Goto (Table.States (1489), 232, 190);
+ Add_Goto (Table.States (1489), 233, 191);
+ Add_Goto (Table.States (1489), 234, 192);
+ Add_Goto (Table.States (1489), 237, 193);
+ Add_Goto (Table.States (1489), 251, 58);
+ Add_Goto (Table.States (1489), 252, 59);
+ Add_Goto (Table.States (1489), 255, 60);
+ Add_Goto (Table.States (1489), 256, 194);
+ Add_Goto (Table.States (1489), 268, 68);
+ Add_Goto (Table.States (1489), 311, 83);
+ Add_Goto (Table.States (1489), 402, 195);
+ Add_Goto (Table.States (1489), 442, 1815);
+ Add_Goto (Table.States (1489), 465, 196);
+ Table.States (1489).Kernel := To_Vector ((0 => ((441, 0), 11, 6,
(32767, 0), 0)));
+ Table.States (1489).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (1490).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1490), 67, (440, 2), 1816);
+ Table.States (1490).Kernel := To_Vector ((((440, 2), 66, 3,
(32767, 0), 0), ((440, 3), 66, 2, (32767,
+ 0), 0)));
+ Table.States (1490).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (440, 2), 67, 1816)));
+ Table.States (1491).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1491), 66, (440, 0), 1817);
+ Add_Action (Table.States (1491), 86, (252, 0), 33);
+ Add_Action (Table.States (1491), 90, (268, 0), 34);
+ Add_Action (Table.States (1491), 116, (196, 0), 146);
+ Add_Action (Table.States (1491), 117, (196, 1), 37);
+ Add_Action (Table.States (1491), 118, (195, 6), 38);
+ Table.States (1491).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (1491), 195, 1113);
+ Add_Goto (Table.States (1491), 196, 148);
+ Add_Goto (Table.States (1491), 197, 54);
+ Add_Goto (Table.States (1491), 198, 55);
+ Add_Goto (Table.States (1491), 199, 56);
+ Add_Goto (Table.States (1491), 201, 57);
+ Add_Goto (Table.States (1491), 251, 58);
+ Add_Goto (Table.States (1491), 252, 59);
+ Add_Goto (Table.States (1491), 255, 60);
+ Add_Goto (Table.States (1491), 268, 68);
+ Add_Goto (Table.States (1491), 311, 83);
+ Add_Goto (Table.States (1491), 441, 1493);
+ Add_Goto (Table.States (1491), 466, 1494);
+ Table.States (1491).Kernel := To_Vector ((((440, 0), 466, 4,
(32767, 0), 0), ((440, 1), 466, 3,
+ (32767, 0), 0), ((466, 1), 466, 8, (32767, 0), 0), ((466, 2),
466, 8, (32767, 0), 0)));
+ Table.States (1491).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (440, 0), 66, 1817)));
+ Table.States (1492).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1492), 67, (440, 4), 1818);
+ Table.States (1492).Kernel := To_Vector ((((440, 4), 66, 3,
(32767, 0), 0), ((440, 5), 66, 2, (32767,
+ 0), 0)));
+ Table.States (1492).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (440, 4), 67, 1818)));
+ Table.States (1493).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1493), (66, 86, 90, 116, 117, 118),
(466, 1), 2);
+ Table.States (1493).Kernel := To_Vector ((((466, 0), 441, 0,
(466, 0), 1), ((466, 1), 441, 0, (466,
+ 1), 2)));
+ Table.States (1493).Minimal_Complete_Actions := To_Vector
(((Reduce, (466, 0), 1), (Reduce, (466, 1),
+ 2)));
+ Table.States (1494).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1494), (66, 86, 90, 116, 117, 118),
(466, 2), 2);
+ Table.States (1494).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (1494), 195, 1113);
+ Add_Goto (Table.States (1494), 196, 148);
+ Add_Goto (Table.States (1494), 197, 54);
+ Add_Goto (Table.States (1494), 198, 55);
+ Add_Goto (Table.States (1494), 199, 56);
+ Add_Goto (Table.States (1494), 201, 57);
+ Add_Goto (Table.States (1494), 251, 58);
+ Add_Goto (Table.States (1494), 252, 59);
+ Add_Goto (Table.States (1494), 255, 60);
+ Add_Goto (Table.States (1494), 268, 68);
+ Add_Goto (Table.States (1494), 311, 83);
+ Add_Goto (Table.States (1494), 441, 1493);
+ Add_Goto (Table.States (1494), 466, 1494);
+ Table.States (1494).Kernel := To_Vector ((((466, 1), 466, 8,
(32767, 0), 0), ((466, 2), 466, 0, (466,
+ 2), 2), ((466, 2), 466, 8, (32767, 0), 0)));
+ Table.States (1494).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (466, 2), 2)));
+ Table.States (1495).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1495), 108, (437, 0), 1819);
+ Table.States (1495).Kernel := To_Vector ((0 => ((437, 0), 227,
1, (32767, 0), 0)));
+ Table.States (1495).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (437, 0), 108, 1819)));
+ Table.States (1496).Action_List.Set_Capacity (44);
+ Add_Action (Table.States (1496), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 63, 64, 65, 66, 77,
81, 83, 84, 86, 90, 105, 116, 117, 118,
+ 119), (454, 0), 6);
+ Table.States (1496).Kernel := To_Vector ((0 => ((454, 0), 108,
0, (454, 0), 6)));
+ Table.States (1496).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (454, 0), 6)));
+ Table.States (1497).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1497), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (408, 9), 6);
+ Table.States (1497).Kernel := To_Vector ((0 => ((408, 9), 108,
0, (408, 9), 6)));
+ Table.States (1497).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (408, 9), 6)));
+ Table.States (1498).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1498), 108, (408, 8), 1820);
+ Table.States (1498).Kernel := To_Vector ((0 => ((408, 8), 434,
1, (32767, 0), 0)));
+ Table.States (1498).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (408, 8), 108, 1820)));
+ Table.States (1499).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1499), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (408, 5), 6);
+ Table.States (1499).Kernel := To_Vector ((0 => ((408, 5), 108,
0, (408, 5), 6)));
+ Table.States (1499).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (408, 5), 6)));
+ Table.States (1500).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1500), 108, (408, 4), 1821);
+ Table.States (1500).Kernel := To_Vector ((0 => ((408, 4), 434,
1, (32767, 0), 0)));
+ Table.States (1500).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (408, 4), 108, 1821)));
+ Table.States (1501).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1501), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (392, 1), 6);
+ Table.States (1501).Kernel := To_Vector ((0 => ((392, 1), 108,
0, (392, 1), 6)));
+ Table.States (1501).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (392, 1), 6)));
+ Table.States (1502).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1502), 108, (392, 0), 1822);
+ Table.States (1502).Kernel := To_Vector ((0 => ((392, 0), 434,
1, (32767, 0), 0)));
+ Table.States (1502).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (392, 0), 108, 1822)));
+ Table.States (1503).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1503), 61, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1503), 63, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1503), 85, (299, 0), 1823);
+ Table.States (1503).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1503), 295, 1824);
+ Add_Goto (Table.States (1503), 299, 426);
+ Add_Goto (Table.States (1503), 360, 1825);
+ Table.States (1503).Kernel := To_Vector ((((359, 0), 116, 10,
(32767, 0), 0), ((359, 1), 116, 8,
+ (32767, 0), 0)));
+ Table.States (1503).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (360, 1), 0)));
+ Table.States (1504).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1504), 108, (354, 3), 1826);
+ Table.States (1504).Kernel := To_Vector ((0 => ((354, 3), 284,
1, (32767, 0), 0)));
+ Table.States (1504).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (354, 3), 108, 1826)));
+ Table.States (1505).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1505), 61, (434, 0), 299);
+ Add_Action (Table.States (1505), 82, (309, 1), 1713);
+ Add_Action (Table.States (1505), 108, (291, 1), 584);
+ Table.States (1505).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1505), 434, 585);
+ Table.States (1505).Kernel := To_Vector ((((291, 0), 292, 3,
(32767, 0), 0), ((291, 1), 292, 1,
+ (32767, 0), 0), ((309, 0), 292, 8, (32767, 0), 0), ((309, 1),
292, 6, (32767, 0), 0)));
+ Table.States (1505).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (291, 1), 108, 584)));
+ Table.States (1506).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1506), 108, Reduce, (284, 1), 0);
+ Add_Action (Table.States (1506), 116, (284, 0), 1312);
+ Table.States (1506).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1506), 284, 1827);
+ Table.States (1506).Kernel := To_Vector ((0 => ((354, 2), 66, 1,
(32767, 0), 0)));
+ Table.States (1506).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (284, 1), 0)));
+ Table.States (1507).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1507), (21, 25, 51, 52, 53, 54, 66),
(353, 1), 2);
+ Table.States (1507).Kernel := To_Vector ((0 => ((353, 1), 355,
0, (353, 1), 2)));
+ Table.States (1507).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (353, 1), 2)));
+ Table.States (1508).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1508), 108, Reduce, (284, 1), 0);
+ Add_Action (Table.States (1508), 116, (284, 0), 1312);
+ Table.States (1508).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1508), 284, 1828);
+ Table.States (1508).Kernel := To_Vector ((0 => ((354, 1), 66, 1,
(32767, 0), 0)));
+ Table.States (1508).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (284, 1), 0)));
+ Table.States (1509).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1509), 21, (359, 0), 1126);
+ Add_Action (Table.States (1509), 25, (329, 1), 10);
+ Add_Action (Table.States (1509), 51, (437, 0), 221);
+ Add_Action (Table.States (1509), 52, (329, 0), 21);
+ Add_Action (Table.States (1509), 53, (294, 0), 314);
+ Add_Action (Table.States (1509), 54, (293, 0), 315);
+ Add_Action (Table.States (1509), 66, (354, 0), 1829);
+ Table.States (1509).Goto_List.Set_Capacity (15);
+ Add_Goto (Table.States (1509), 291, 1128);
+ Add_Goto (Table.States (1509), 292, 1129);
+ Add_Goto (Table.States (1509), 293, 79);
+ Add_Goto (Table.States (1509), 294, 80);
+ Add_Goto (Table.States (1509), 309, 1130);
+ Add_Goto (Table.States (1509), 320, 1131);
+ Add_Goto (Table.States (1509), 321, 1132);
+ Add_Goto (Table.States (1509), 329, 1133);
+ Add_Goto (Table.States (1509), 355, 1507);
+ Add_Goto (Table.States (1509), 359, 1136);
+ Add_Goto (Table.States (1509), 431, 1137);
+ Add_Goto (Table.States (1509), 437, 140);
+ Add_Goto (Table.States (1509), 438, 141);
+ Add_Goto (Table.States (1509), 440, 142);
+ Add_Goto (Table.States (1509), 454, 143);
+ Table.States (1509).Kernel := To_Vector ((((353, 1), 353, 3,
(32767, 0), 0), ((354, 0), 353, 2,
+ (32767, 0), 0)));
+ Table.States (1509).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (354, 0), 66, 1829)));
+ Table.States (1510).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1510), 61, (346, 6), 1830);
+ Add_Action (Table.States (1510), 75, (182, 1), 1522);
+ Table.States (1510).Kernel := To_Vector ((((182, 1), 182, 2,
(32767, 0), 0), ((346, 6), 182, 3,
+ (32767, 0), 0)));
+ Table.States (1510).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (346, 6), 61, 1830)));
+ Table.States (1511).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1511), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (346, 7), 6);
+ Table.States (1511).Kernel := To_Vector ((0 => ((346, 7), 108,
0, (346, 7), 6)));
+ Table.States (1511).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (346, 7), 6)));
+ Table.States (1512).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1512), 86, (252, 0), 33);
+ Add_Action (Table.States (1512), 90, (268, 0), 34);
+ Add_Action (Table.States (1512), 116, (196, 0), 146);
+ Add_Action (Table.States (1512), 117, (196, 1), 37);
+ Add_Action (Table.States (1512), 118, (195, 6), 38);
+ Table.States (1512).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1512), 182, 1831);
+ Add_Goto (Table.States (1512), 195, 1152);
+ Add_Goto (Table.States (1512), 196, 148);
+ Add_Goto (Table.States (1512), 197, 54);
+ Add_Goto (Table.States (1512), 198, 55);
+ Add_Goto (Table.States (1512), 199, 56);
+ Add_Goto (Table.States (1512), 201, 57);
+ Add_Goto (Table.States (1512), 251, 58);
+ Add_Goto (Table.States (1512), 252, 59);
+ Add_Goto (Table.States (1512), 255, 60);
+ Add_Goto (Table.States (1512), 268, 68);
+ Add_Goto (Table.States (1512), 311, 83);
+ Table.States (1512).Kernel := To_Vector ((0 => ((346, 2), 76, 4,
(32767, 0), 0)));
+ Table.States (1512).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1513).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1513), 108, (346, 3), 1832);
+ Table.States (1513).Kernel := To_Vector ((0 => ((346, 3), 350,
1, (32767, 0), 0)));
+ Table.States (1513).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (346, 3), 108, 1832)));
+ Table.States (1514).Action_List.Set_Capacity (10);
+ Add_Action (Table.States (1514), 21, (356, 4), 8);
+ Add_Action (Table.States (1514), 25, (329, 1), 10);
+ Add_Action (Table.States (1514), 27, (350, 6), 781);
+ Add_Action (Table.States (1514), 51, (437, 0), 221);
+ Add_Action (Table.States (1514), 52, (329, 0), 21);
+ Add_Action (Table.States (1514), 53, (294, 0), 314);
+ Add_Action (Table.States (1514), 54, (293, 0), 315);
+ Add_Action (Table.States (1514), 66, (350, 10), 782);
+ Add_Action (Table.States (1514), 76, (346, 0), 1833);
+ Add_Action (Table.States (1514), 84, (124, 0), 32);
+ Table.States (1514).Goto_List.Set_Capacity (15);
+ Add_Goto (Table.States (1514), 124, 784);
+ Add_Goto (Table.States (1514), 291, 785);
+ Add_Goto (Table.States (1514), 292, 786);
+ Add_Goto (Table.States (1514), 293, 317);
+ Add_Goto (Table.States (1514), 294, 318);
+ Add_Goto (Table.States (1514), 329, 787);
+ Add_Goto (Table.States (1514), 348, 788);
+ Add_Goto (Table.States (1514), 350, 1834);
+ Add_Goto (Table.States (1514), 351, 790);
+ Add_Goto (Table.States (1514), 356, 791);
+ Add_Goto (Table.States (1514), 431, 792);
+ Add_Goto (Table.States (1514), 437, 140);
+ Add_Goto (Table.States (1514), 438, 141);
+ Add_Goto (Table.States (1514), 440, 142);
+ Add_Goto (Table.States (1514), 454, 143);
+ Table.States (1514).Kernel := To_Vector ((((346, 0), 82, 5,
(32767, 0), 0), ((346, 1), 82, 2, (32767,
+ 0), 0)));
+ Table.States (1514).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (350, 10), 66, 782)));
+ Table.States (1515).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1515), 86, (252, 0), 33);
+ Add_Action (Table.States (1515), 90, (268, 0), 34);
+ Add_Action (Table.States (1515), 116, (196, 0), 146);
+ Add_Action (Table.States (1515), 117, (196, 1), 37);
+ Add_Action (Table.States (1515), 118, (195, 6), 38);
+ Table.States (1515).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1515), 182, 1835);
+ Add_Goto (Table.States (1515), 195, 1152);
+ Add_Goto (Table.States (1515), 196, 148);
+ Add_Goto (Table.States (1515), 197, 54);
+ Add_Goto (Table.States (1515), 198, 55);
+ Add_Goto (Table.States (1515), 199, 56);
+ Add_Goto (Table.States (1515), 201, 57);
+ Add_Goto (Table.States (1515), 251, 58);
+ Add_Goto (Table.States (1515), 252, 59);
+ Add_Goto (Table.States (1515), 255, 60);
+ Add_Goto (Table.States (1515), 268, 68);
+ Add_Goto (Table.States (1515), 311, 83);
+ Table.States (1515).Kernel := To_Vector ((0 => ((346, 4), 76, 4,
(32767, 0), 0)));
+ Table.States (1515).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1516).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1516), 108, (346, 5), 1836);
+ Table.States (1516).Kernel := To_Vector ((0 => ((346, 5), 350,
1, (32767, 0), 0)));
+ Table.States (1516).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (346, 5), 108, 1836)));
+ Table.States (1517).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1517), (1 => 108), (350, 8), 3);
+ Table.States (1517).Kernel := To_Vector ((0 => ((350, 8), 116,
0, (350, 8), 3)));
+ Table.States (1517).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (350, 8), 3)));
+ Table.States (1518).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1518), 52, (187, 0), 347);
+ Add_Action (Table.States (1518), 56, (188, 2), 514);
+ Add_Action (Table.States (1518), 80, (161, 0), 1837);
+ Add_Action (Table.States (1518), 86, (252, 0), 33);
+ Add_Action (Table.States (1518), 90, (268, 0), 34);
+ Add_Action (Table.States (1518), 116, (196, 0), 146);
+ Add_Action (Table.States (1518), 117, (196, 1), 37);
+ Add_Action (Table.States (1518), 118, (195, 6), 38);
+ Table.States (1518).Goto_List.Set_Capacity (15);
+ Add_Goto (Table.States (1518), 131, 1838);
+ Add_Goto (Table.States (1518), 161, 1839);
+ Add_Goto (Table.States (1518), 187, 526);
+ Add_Goto (Table.States (1518), 188, 1840);
+ Add_Goto (Table.States (1518), 195, 528);
+ Add_Goto (Table.States (1518), 196, 148);
+ Add_Goto (Table.States (1518), 197, 54);
+ Add_Goto (Table.States (1518), 198, 55);
+ Add_Goto (Table.States (1518), 199, 56);
+ Add_Goto (Table.States (1518), 201, 57);
+ Add_Goto (Table.States (1518), 251, 58);
+ Add_Goto (Table.States (1518), 252, 59);
+ Add_Goto (Table.States (1518), 255, 60);
+ Add_Goto (Table.States (1518), 268, 68);
+ Add_Goto (Table.States (1518), 311, 83);
+ Table.States (1518).Kernel := To_Vector ((((173, 0), 93, 6,
(32767, 0), 0), ((173, 1), 93, 4, (32767,
+ 0), 0), ((173, 2), 93, 4, (32767, 0), 0), ((173, 3), 93, 2,
(32767, 0), 0)));
+ Table.States (1518).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1519).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1519), 108, Reduce, (350, 7), 3);
+ Add_Action (Table.States (1519), 116, (350, 6), 1841);
+ Table.States (1519).Kernel := To_Vector ((((350, 6), 66, 1,
(32767, 0), 0), ((350, 7), 66, 0, (350,
+ 7), 3)));
+ Table.States (1519).Minimal_Complete_Actions := To_Vector
(((Shift, (350, 6), 116, 1841), (Reduce, (350,
+ 7), 3)));
+ Table.States (1520).Action_List.Set_Capacity (9);
+ Add_Action (Table.States (1520), (21, 25, 51, 52, 53, 54, 66, 84,
116), (349, 1), 2);
+ Table.States (1520).Kernel := To_Vector ((0 => ((349, 1), 352,
0, (349, 1), 2)));
+ Table.States (1520).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (349, 1), 2)));
+ Table.States (1521).Action_List.Set_Capacity (9);
+ Add_Action (Table.States (1521), 21, (356, 4), 8);
+ Add_Action (Table.States (1521), 25, (329, 1), 10);
+ Add_Action (Table.States (1521), 27, (350, 6), 781);
+ Add_Action (Table.States (1521), 51, (437, 0), 221);
+ Add_Action (Table.States (1521), 52, (329, 0), 21);
+ Add_Action (Table.States (1521), 53, (294, 0), 314);
+ Add_Action (Table.States (1521), 54, (293, 0), 315);
+ Add_Action (Table.States (1521), 66, (350, 10), 782);
+ Add_Action (Table.States (1521), 84, (124, 0), 32);
+ Table.States (1521).Goto_List.Set_Capacity (15);
+ Add_Goto (Table.States (1521), 124, 784);
+ Add_Goto (Table.States (1521), 291, 785);
+ Add_Goto (Table.States (1521), 292, 786);
+ Add_Goto (Table.States (1521), 293, 317);
+ Add_Goto (Table.States (1521), 294, 318);
+ Add_Goto (Table.States (1521), 329, 787);
+ Add_Goto (Table.States (1521), 348, 788);
+ Add_Goto (Table.States (1521), 350, 1842);
+ Add_Goto (Table.States (1521), 351, 790);
+ Add_Goto (Table.States (1521), 356, 791);
+ Add_Goto (Table.States (1521), 431, 792);
+ Add_Goto (Table.States (1521), 437, 140);
+ Add_Goto (Table.States (1521), 438, 141);
+ Add_Goto (Table.States (1521), 440, 142);
+ Add_Goto (Table.States (1521), 454, 143);
+ Table.States (1521).Kernel := To_Vector ((0 => ((347, 2), 61, 2,
(32767, 0), 0)));
+ Table.States (1521).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (350, 10), 66, 782)));
+ end Subr_55;
+ procedure Subr_56
+ is begin
+ Table.States (1522).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1522), 86, (252, 0), 33);
+ Add_Action (Table.States (1522), 90, (268, 0), 34);
+ Add_Action (Table.States (1522), 116, (196, 0), 146);
+ Add_Action (Table.States (1522), 117, (196, 1), 37);
+ Add_Action (Table.States (1522), 118, (195, 6), 38);
+ Table.States (1522).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (1522), 195, 1843);
+ Add_Goto (Table.States (1522), 196, 148);
+ Add_Goto (Table.States (1522), 197, 54);
+ Add_Goto (Table.States (1522), 198, 55);
+ Add_Goto (Table.States (1522), 199, 56);
+ Add_Goto (Table.States (1522), 201, 57);
+ Add_Goto (Table.States (1522), 251, 58);
+ Add_Goto (Table.States (1522), 252, 59);
+ Add_Goto (Table.States (1522), 255, 60);
+ Add_Goto (Table.States (1522), 268, 68);
+ Add_Goto (Table.States (1522), 311, 83);
+ Table.States (1522).Kernel := To_Vector ((0 => ((182, 1), 75, 1,
(32767, 0), 0)));
+ Table.States (1522).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1523).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1523), 108, Reduce, (350, 3), 3);
+ Add_Action (Table.States (1523), 116, (350, 2), 1844);
+ Table.States (1523).Kernel := To_Vector ((((350, 2), 66, 1,
(32767, 0), 0), ((350, 3), 66, 0, (350,
+ 3), 3)));
+ Table.States (1523).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (350, 3), 3)));
+ Table.States (1524).Action_List.Set_Capacity (9);
+ Add_Action (Table.States (1524), 21, (356, 4), 8);
+ Add_Action (Table.States (1524), 25, (329, 1), 10);
+ Add_Action (Table.States (1524), 51, (437, 0), 221);
+ Add_Action (Table.States (1524), 52, (329, 0), 21);
+ Add_Action (Table.States (1524), 53, (294, 0), 314);
+ Add_Action (Table.States (1524), 54, (293, 0), 315);
+ Add_Action (Table.States (1524), 66, (350, 0), 1845);
+ Add_Action (Table.States (1524), 84, (124, 0), 32);
+ Add_Action (Table.States (1524), 116, (136, 0), 207);
+ Table.States (1524).Goto_List.Set_Capacity (16);
+ Add_Goto (Table.States (1524), 124, 784);
+ Add_Goto (Table.States (1524), 136, 1145);
+ Add_Goto (Table.States (1524), 173, 1146);
+ Add_Goto (Table.States (1524), 291, 785);
+ Add_Goto (Table.States (1524), 292, 786);
+ Add_Goto (Table.States (1524), 293, 317);
+ Add_Goto (Table.States (1524), 294, 318);
+ Add_Goto (Table.States (1524), 329, 787);
+ Add_Goto (Table.States (1524), 351, 1148);
+ Add_Goto (Table.States (1524), 352, 1520);
+ Add_Goto (Table.States (1524), 356, 791);
+ Add_Goto (Table.States (1524), 431, 792);
+ Add_Goto (Table.States (1524), 437, 140);
+ Add_Goto (Table.States (1524), 438, 141);
+ Add_Goto (Table.States (1524), 440, 142);
+ Add_Goto (Table.States (1524), 454, 143);
+ Table.States (1524).Kernel := To_Vector ((((349, 1), 349, 3,
(32767, 0), 0), ((350, 0), 349, 2,
+ (32767, 0), 0), ((350, 1), 349, 1, (32767, 0), 0)));
+ Table.States (1525).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1525), (1 => 108), (350, 4), 3);
+ Table.States (1525).Kernel := To_Vector ((0 => ((350, 4), 116,
0, (350, 4), 3)));
+ Table.States (1525).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (350, 4), 3)));
+ Table.States (1526).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1526), 61, (347, 0), 1846);
+ Add_Action (Table.States (1526), 75, (182, 1), 1522);
+ Table.States (1526).Kernel := To_Vector ((((182, 1), 182, 2,
(32767, 0), 0), ((347, 0), 182, 3,
+ (32767, 0), 0)));
+ Table.States (1526).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (347, 0), 61, 1846)));
+ Table.States (1527).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1527), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (347, 1), 6);
+ Table.States (1527).Kernel := To_Vector ((0 => ((347, 1), 108,
0, (347, 1), 6)));
+ Table.States (1527).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (347, 1), 6)));
+ Table.States (1528).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1528), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (391, 1), 6);
+ Table.States (1528).Kernel := To_Vector ((0 => ((391, 1), 108,
0, (391, 1), 6)));
+ Table.States (1528).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (391, 1), 6)));
+ Table.States (1529).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1529), 108, (391, 0), 1847);
+ Table.States (1529).Kernel := To_Vector ((0 => ((391, 0), 434,
1, (32767, 0), 0)));
+ Table.States (1529).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (391, 0), 108, 1847)));
+ Table.States (1530).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (1530), 12, (401, 0), 1);
+ Add_Action (Table.States (1530), 15, (370, 0), 3);
+ Add_Action (Table.States (1530), 17, (365, 0), 4);
+ Add_Action (Table.States (1530), 18, (382, 0), 5);
+ Add_Action (Table.States (1530), 19, (363, 0), 6);
+ Add_Action (Table.States (1530), 20, (357, 0), 7);
+ Add_Action (Table.States (1530), 30, (316, 0), 13);
+ Add_Action (Table.States (1530), 31, (290, 0), 14);
+ Add_Action (Table.States (1530), 32, (289, 0), 15);
+ Add_Action (Table.States (1530), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1530), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1530), 37, (288, 0), 17);
+ Add_Conflict (Table.States (1530), 37, (285, 1), 0);
+ Add_Action (Table.States (1530), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1530), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1530), 42, (271, 0), 18);
+ Add_Action (Table.States (1530), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1530), 64, (273, 0), 27);
+ Add_Action (Table.States (1530), 65, (264, 0), 28);
+ Add_Action (Table.States (1530), 84, (124, 0), 32);
+ Add_Action (Table.States (1530), 86, (252, 0), 33);
+ Add_Action (Table.States (1530), 90, (268, 0), 34);
+ Add_Action (Table.States (1530), 105, (265, 0), 35);
+ Add_Action (Table.States (1530), 116, (196, 0), 146);
+ Add_Action (Table.States (1530), 117, (196, 1), 37);
+ Add_Action (Table.States (1530), 118, (195, 6), 38);
+ Table.States (1530).Goto_List.Set_Capacity (46);
+ Add_Goto (Table.States (1530), 124, 39);
+ Add_Goto (Table.States (1530), 195, 52);
+ Add_Goto (Table.States (1530), 196, 53);
+ Add_Goto (Table.States (1530), 197, 54);
+ Add_Goto (Table.States (1530), 198, 55);
+ Add_Goto (Table.States (1530), 199, 56);
+ Add_Goto (Table.States (1530), 201, 57);
+ Add_Goto (Table.States (1530), 251, 58);
+ Add_Goto (Table.States (1530), 252, 59);
+ Add_Goto (Table.States (1530), 255, 60);
+ Add_Goto (Table.States (1530), 259, 452);
+ Add_Goto (Table.States (1530), 261, 331);
+ Add_Goto (Table.States (1530), 262, 62);
+ Add_Goto (Table.States (1530), 263, 63);
+ Add_Goto (Table.States (1530), 264, 64);
+ Add_Goto (Table.States (1530), 265, 65);
+ Add_Goto (Table.States (1530), 266, 66);
+ Add_Goto (Table.States (1530), 267, 67);
+ Add_Goto (Table.States (1530), 268, 68);
+ Add_Goto (Table.States (1530), 271, 69);
+ Add_Goto (Table.States (1530), 273, 70);
+ Add_Goto (Table.States (1530), 275, 71);
+ Add_Goto (Table.States (1530), 285, 72);
+ Add_Goto (Table.States (1530), 286, 73);
+ Add_Goto (Table.States (1530), 288, 74);
+ Add_Goto (Table.States (1530), 289, 75);
+ Add_Goto (Table.States (1530), 290, 76);
+ Add_Goto (Table.States (1530), 310, 82);
+ Add_Goto (Table.States (1530), 311, 83);
+ Add_Goto (Table.States (1530), 316, 84);
+ Add_Goto (Table.States (1530), 318, 85);
+ Add_Goto (Table.States (1530), 357, 110);
+ Add_Goto (Table.States (1530), 363, 111);
+ Add_Goto (Table.States (1530), 364, 112);
+ Add_Goto (Table.States (1530), 365, 113);
+ Add_Goto (Table.States (1530), 366, 114);
+ Add_Goto (Table.States (1530), 367, 115);
+ Add_Goto (Table.States (1530), 370, 116);
+ Add_Goto (Table.States (1530), 376, 117);
+ Add_Goto (Table.States (1530), 378, 118);
+ Add_Goto (Table.States (1530), 379, 119);
+ Add_Goto (Table.States (1530), 382, 120);
+ Add_Goto (Table.States (1530), 396, 1848);
+ Add_Goto (Table.States (1530), 401, 133);
+ Add_Goto (Table.States (1530), 461, 332);
+ Add_Goto (Table.States (1530), 462, 144);
+ Table.States (1530).Kernel := To_Vector ((0 => ((345, 1), 38, 4,
(32767, 0), 0)));
+ Table.States (1530).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ Table.States (1531).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1531), 38, (345, 0), 1849);
+ Table.States (1531).Kernel := To_Vector ((0 => ((345, 0), 192,
5, (32767, 0), 0)));
+ Table.States (1531).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (345, 0), 38, 1849)));
+ Table.States (1532).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1532), 61, (340, 9), 1850);
+ Add_Action (Table.States (1532), 75, (182, 1), 1522);
+ Table.States (1532).Kernel := To_Vector ((((182, 1), 182, 2,
(32767, 0), 0), ((340, 9), 182, 6,
+ (32767, 0), 0)));
+ Table.States (1532).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (340, 9), 61, 1850)));
+ Table.States (1533).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1533), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (340, 10), 6);
+ Table.States (1533).Kernel := To_Vector ((0 => ((340, 10), 108,
0, (340, 10), 6)));
+ Table.States (1533).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (340, 10), 6)));
+ Table.States (1534).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1534), 86, (252, 0), 33);
+ Add_Action (Table.States (1534), 90, (268, 0), 34);
+ Add_Action (Table.States (1534), 116, (196, 0), 146);
+ Add_Action (Table.States (1534), 117, (196, 1), 37);
+ Add_Action (Table.States (1534), 118, (195, 6), 38);
+ Table.States (1534).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1534), 182, 1851);
+ Add_Goto (Table.States (1534), 195, 1152);
+ Add_Goto (Table.States (1534), 196, 148);
+ Add_Goto (Table.States (1534), 197, 54);
+ Add_Goto (Table.States (1534), 198, 55);
+ Add_Goto (Table.States (1534), 199, 56);
+ Add_Goto (Table.States (1534), 201, 57);
+ Add_Goto (Table.States (1534), 251, 58);
+ Add_Goto (Table.States (1534), 252, 59);
+ Add_Goto (Table.States (1534), 255, 60);
+ Add_Goto (Table.States (1534), 268, 68);
+ Add_Goto (Table.States (1534), 311, 83);
+ Table.States (1534).Kernel := To_Vector ((0 => ((340, 3), 76, 7,
(32767, 0), 0)));
+ Table.States (1534).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1535).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1535), 108, (340, 4), 1852);
+ Table.States (1535).Kernel := To_Vector ((0 => ((340, 4), 343,
1, (32767, 0), 0)));
+ Table.States (1535).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (340, 4), 108, 1852)));
+ Table.States (1536).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1536), 21, (356, 4), 8);
+ Add_Action (Table.States (1536), 25, (329, 1), 10);
+ Add_Action (Table.States (1536), 51, (437, 0), 221);
+ Add_Action (Table.States (1536), 52, (329, 0), 21);
+ Add_Action (Table.States (1536), 76, (340, 0), 1853);
+ Table.States (1536).Goto_List.Set_Capacity (10);
+ Add_Goto (Table.States (1536), 329, 801);
+ Add_Goto (Table.States (1536), 342, 802);
+ Add_Goto (Table.States (1536), 343, 1854);
+ Add_Goto (Table.States (1536), 344, 804);
+ Add_Goto (Table.States (1536), 356, 805);
+ Add_Goto (Table.States (1536), 431, 806);
+ Add_Goto (Table.States (1536), 437, 140);
+ Add_Goto (Table.States (1536), 438, 141);
+ Add_Goto (Table.States (1536), 440, 142);
+ Add_Goto (Table.States (1536), 454, 143);
+ Table.States (1536).Kernel := To_Vector ((((340, 0), 82, 8,
(32767, 0), 0), ((340, 1), 82, 5, (32767,
+ 0), 0)));
+ Table.States (1536).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (356, 4), 21, 8)));
+ Table.States (1537).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1537), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (340, 2), 6);
+ Table.States (1537).Kernel := To_Vector ((0 => ((340, 2), 108,
0, (340, 2), 6)));
+ Table.States (1537).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (340, 2), 6)));
+ Table.States (1538).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1538), 86, (252, 0), 33);
+ Add_Action (Table.States (1538), 90, (268, 0), 34);
+ Add_Action (Table.States (1538), 116, (196, 0), 146);
+ Add_Action (Table.States (1538), 117, (196, 1), 37);
+ Add_Action (Table.States (1538), 118, (195, 6), 38);
+ Table.States (1538).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1538), 182, 1855);
+ Add_Goto (Table.States (1538), 195, 1152);
+ Add_Goto (Table.States (1538), 196, 148);
+ Add_Goto (Table.States (1538), 197, 54);
+ Add_Goto (Table.States (1538), 198, 55);
+ Add_Goto (Table.States (1538), 199, 56);
+ Add_Goto (Table.States (1538), 201, 57);
+ Add_Goto (Table.States (1538), 251, 58);
+ Add_Goto (Table.States (1538), 252, 59);
+ Add_Goto (Table.States (1538), 255, 60);
+ Add_Goto (Table.States (1538), 268, 68);
+ Add_Goto (Table.States (1538), 311, 83);
+ Table.States (1538).Kernel := To_Vector ((0 => ((340, 6), 76, 7,
(32767, 0), 0)));
+ Table.States (1538).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1539).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1539), 108, (340, 7), 1856);
+ Table.States (1539).Kernel := To_Vector ((0 => ((340, 7), 343,
1, (32767, 0), 0)));
+ Table.States (1539).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (340, 7), 108, 1856)));
+ Table.States (1540).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1540), 21, (356, 4), 8);
+ Add_Action (Table.States (1540), 25, (329, 1), 10);
+ Add_Action (Table.States (1540), 51, (437, 0), 221);
+ Add_Action (Table.States (1540), 52, (329, 0), 21);
+ Table.States (1540).Goto_List.Set_Capacity (10);
+ Add_Goto (Table.States (1540), 329, 801);
+ Add_Goto (Table.States (1540), 342, 802);
+ Add_Goto (Table.States (1540), 343, 1857);
+ Add_Goto (Table.States (1540), 344, 804);
+ Add_Goto (Table.States (1540), 356, 805);
+ Add_Goto (Table.States (1540), 431, 806);
+ Add_Goto (Table.States (1540), 437, 140);
+ Add_Goto (Table.States (1540), 438, 141);
+ Add_Goto (Table.States (1540), 440, 142);
+ Add_Goto (Table.States (1540), 454, 143);
+ Table.States (1540).Kernel := To_Vector ((0 => ((341, 3), 61, 5,
(32767, 0), 0)));
+ Table.States (1540).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (356, 4), 21, 8)));
+ Table.States (1541).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1541), 21, (356, 4), 8);
+ Add_Action (Table.States (1541), 25, (329, 1), 10);
+ Add_Action (Table.States (1541), 51, (437, 0), 221);
+ Add_Action (Table.States (1541), 52, (329, 0), 21);
+ Add_Action (Table.States (1541), 66, (343, 0), 1858);
+ Table.States (1541).Goto_List.Set_Capacity (8);
+ Add_Goto (Table.States (1541), 329, 801);
+ Add_Goto (Table.States (1541), 344, 1173);
+ Add_Goto (Table.States (1541), 356, 805);
+ Add_Goto (Table.States (1541), 431, 806);
+ Add_Goto (Table.States (1541), 437, 140);
+ Add_Goto (Table.States (1541), 438, 141);
+ Add_Goto (Table.States (1541), 440, 142);
+ Add_Goto (Table.States (1541), 454, 143);
+ Table.States (1541).Kernel := To_Vector ((((342, 1), 342, 3,
(32767, 0), 0), ((343, 0), 342, 1,
+ (32767, 0), 0)));
+ Table.States (1542).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1542), (1 => 108), (343, 1), 3);
+ Table.States (1542).Kernel := To_Vector ((0 => ((343, 1), 284,
0, (343, 1), 3)));
+ Table.States (1542).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (343, 1), 3)));
+ Table.States (1543).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1543), 61, (341, 0), 1859);
+ Add_Action (Table.States (1543), 75, (182, 1), 1522);
+ Table.States (1543).Kernel := To_Vector ((((182, 1), 182, 2,
(32767, 0), 0), ((341, 0), 182, 6,
+ (32767, 0), 0)));
+ Table.States (1543).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (341, 0), 61, 1859)));
+ Table.States (1544).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1544), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (341, 1), 6);
+ Table.States (1544).Kernel := To_Vector ((0 => ((341, 1), 108,
0, (341, 1), 6)));
+ Table.States (1544).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (341, 1), 6)));
+ Table.States (1545).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (1545), 12, (401, 0), 1);
+ Add_Action (Table.States (1545), 15, (370, 0), 3);
+ Add_Action (Table.States (1545), 17, (365, 0), 4);
+ Add_Action (Table.States (1545), 18, (382, 0), 5);
+ Add_Action (Table.States (1545), 19, (363, 0), 6);
+ Add_Action (Table.States (1545), 20, (357, 0), 7);
+ Add_Action (Table.States (1545), 30, (316, 0), 13);
+ Add_Action (Table.States (1545), 31, (290, 0), 14);
+ Add_Action (Table.States (1545), 32, (289, 0), 15);
+ Add_Action (Table.States (1545), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1545), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1545), 37, (288, 0), 17);
+ Add_Conflict (Table.States (1545), 37, (285, 1), 0);
+ Add_Action (Table.States (1545), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1545), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1545), 42, (271, 0), 18);
+ Add_Action (Table.States (1545), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1545), 64, (273, 0), 27);
+ Add_Action (Table.States (1545), 65, (264, 0), 28);
+ Add_Action (Table.States (1545), 84, (124, 0), 32);
+ Add_Action (Table.States (1545), 86, (252, 0), 33);
+ Add_Action (Table.States (1545), 90, (268, 0), 34);
+ Add_Action (Table.States (1545), 105, (265, 0), 35);
+ Add_Action (Table.States (1545), 116, (196, 0), 146);
+ Add_Action (Table.States (1545), 117, (196, 1), 37);
+ Add_Action (Table.States (1545), 118, (195, 6), 38);
+ Table.States (1545).Goto_List.Set_Capacity (45);
+ Add_Goto (Table.States (1545), 124, 39);
+ Add_Goto (Table.States (1545), 195, 52);
+ Add_Goto (Table.States (1545), 196, 53);
+ Add_Goto (Table.States (1545), 197, 54);
+ Add_Goto (Table.States (1545), 198, 55);
+ Add_Goto (Table.States (1545), 199, 56);
+ Add_Goto (Table.States (1545), 201, 57);
+ Add_Goto (Table.States (1545), 251, 58);
+ Add_Goto (Table.States (1545), 252, 59);
+ Add_Goto (Table.States (1545), 255, 60);
+ Add_Goto (Table.States (1545), 259, 1860);
+ Add_Goto (Table.States (1545), 261, 331);
+ Add_Goto (Table.States (1545), 262, 62);
+ Add_Goto (Table.States (1545), 263, 63);
+ Add_Goto (Table.States (1545), 264, 64);
+ Add_Goto (Table.States (1545), 265, 65);
+ Add_Goto (Table.States (1545), 266, 66);
+ Add_Goto (Table.States (1545), 267, 67);
+ Add_Goto (Table.States (1545), 268, 68);
+ Add_Goto (Table.States (1545), 271, 69);
+ Add_Goto (Table.States (1545), 273, 70);
+ Add_Goto (Table.States (1545), 275, 71);
+ Add_Goto (Table.States (1545), 285, 72);
+ Add_Goto (Table.States (1545), 286, 73);
+ Add_Goto (Table.States (1545), 288, 74);
+ Add_Goto (Table.States (1545), 289, 75);
+ Add_Goto (Table.States (1545), 290, 76);
+ Add_Goto (Table.States (1545), 310, 82);
+ Add_Goto (Table.States (1545), 311, 83);
+ Add_Goto (Table.States (1545), 316, 84);
+ Add_Goto (Table.States (1545), 318, 85);
+ Add_Goto (Table.States (1545), 357, 110);
+ Add_Goto (Table.States (1545), 363, 111);
+ Add_Goto (Table.States (1545), 364, 112);
+ Add_Goto (Table.States (1545), 365, 113);
+ Add_Goto (Table.States (1545), 366, 114);
+ Add_Goto (Table.States (1545), 367, 115);
+ Add_Goto (Table.States (1545), 370, 116);
+ Add_Goto (Table.States (1545), 376, 117);
+ Add_Goto (Table.States (1545), 378, 118);
+ Add_Goto (Table.States (1545), 379, 119);
+ Add_Goto (Table.States (1545), 382, 120);
+ Add_Goto (Table.States (1545), 401, 133);
+ Add_Goto (Table.States (1545), 461, 332);
+ Add_Goto (Table.States (1545), 462, 144);
+ Table.States (1545).Kernel := To_Vector ((0 => ((274, 0), 99, 2,
(32767, 0), 0)));
+ Table.States (1545).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ Table.States (1546).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1546), 108, (273, 0), 1861);
+ Table.States (1546).Kernel := To_Vector ((0 => ((273, 0), 64, 1,
(32767, 0), 0)));
+ Table.States (1546).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (273, 0), 108, 1861)));
+ Table.States (1547).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1547), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (130, 0), 6);
+ Table.States (1547).Kernel := To_Vector ((0 => ((130, 0), 108,
0, (130, 0), 6)));
+ Table.States (1547).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (130, 0), 6)));
+ Table.States (1548).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1548), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (327, 22), 6);
+ Table.States (1548).Kernel := To_Vector ((0 => ((327, 22), 108,
0, (327, 22), 6)));
+ Table.States (1548).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (327, 22), 6)));
+ end Subr_56;
+ procedure Subr_57
+ is begin
+ Table.States (1549).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1549), (49, 61, 108), (186, 1), 2);
+ Table.States (1549).Kernel := To_Vector ((0 => ((186, 1), 297,
0, (186, 1), 2)));
+ Table.States (1549).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (186, 1), 2)));
+ Table.States (1550).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1550), (49, 61, 108), (186, 0), 2);
+ Table.States (1550).Kernel := To_Vector ((0 => ((186, 0), 295,
0, (186, 0), 2)));
+ Table.States (1550).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (186, 0), 2)));
+ Table.States (1551).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1551), (49, 61, 108), (183, 4), 3);
+ Table.States (1551).Kernel := To_Vector ((0 => ((183, 4), 186,
0, (183, 4), 3)));
+ Table.States (1551).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (183, 4), 3)));
+ Table.States (1552).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1552), (49, 61, 108), (184, 0), 3);
+ Table.States (1552).Kernel := To_Vector ((0 => ((184, 0), 131,
0, (184, 0), 3)));
+ Table.States (1552).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (184, 0), 3)));
+ Table.States (1553).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1553), 49, Reduce, (181, 8), 3);
+ Add_Action (Table.States (1553), 61, Reduce, (181, 8), 3);
+ Add_Action (Table.States (1553), 75, (182, 1), 1522);
+ Add_Action (Table.States (1553), 108, Reduce, (181, 8), 3);
+ Table.States (1553).Kernel := To_Vector ((((181, 8), 182, 0,
(181, 8), 3), ((182, 1), 182, 2, (32767,
+ 0), 0)));
+ Table.States (1553).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (181, 8), 3)));
+ Table.States (1554).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1554), 86, (252, 0), 33);
+ Add_Action (Table.States (1554), 90, (268, 0), 34);
+ Add_Action (Table.States (1554), 116, (196, 0), 146);
+ Add_Action (Table.States (1554), 117, (196, 1), 37);
+ Add_Action (Table.States (1554), 118, (195, 6), 38);
+ Table.States (1554).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1554), 182, 1862);
+ Add_Goto (Table.States (1554), 195, 1152);
+ Add_Goto (Table.States (1554), 196, 148);
+ Add_Goto (Table.States (1554), 197, 54);
+ Add_Goto (Table.States (1554), 198, 55);
+ Add_Goto (Table.States (1554), 199, 56);
+ Add_Goto (Table.States (1554), 201, 57);
+ Add_Goto (Table.States (1554), 251, 58);
+ Add_Goto (Table.States (1554), 252, 59);
+ Add_Goto (Table.States (1554), 255, 60);
+ Add_Goto (Table.States (1554), 268, 68);
+ Add_Goto (Table.States (1554), 311, 83);
+ Table.States (1554).Kernel := To_Vector ((0 => ((181, 6), 75, 1,
(32767, 0), 0)));
+ Table.States (1554).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1555).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1555), 61, (328, 42), 1863);
+ Add_Action (Table.States (1555), 75, (328, 40), 1864);
+ Table.States (1555).Kernel := To_Vector ((((328, 40), 131, 7,
(32767, 0), 0), ((328, 41), 131, 5,
+ (32767, 0), 0), ((328, 42), 131, 5, (32767, 0), 0), ((328,
43), 131, 3, (32767, 0), 0)));
+ Table.States (1555).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 42), 61, 1863)));
+ Table.States (1556).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1556), 86, (252, 0), 33);
+ Add_Action (Table.States (1556), 90, (268, 0), 34);
+ Add_Action (Table.States (1556), 116, (196, 0), 146);
+ Add_Action (Table.States (1556), 117, (196, 1), 37);
+ Add_Action (Table.States (1556), 118, (195, 6), 38);
+ Table.States (1556).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1556), 182, 1865);
+ Add_Goto (Table.States (1556), 195, 1152);
+ Add_Goto (Table.States (1556), 196, 148);
+ Add_Goto (Table.States (1556), 197, 54);
+ Add_Goto (Table.States (1556), 198, 55);
+ Add_Goto (Table.States (1556), 199, 56);
+ Add_Goto (Table.States (1556), 201, 57);
+ Add_Goto (Table.States (1556), 251, 58);
+ Add_Goto (Table.States (1556), 252, 59);
+ Add_Goto (Table.States (1556), 255, 60);
+ Add_Goto (Table.States (1556), 268, 68);
+ Add_Goto (Table.States (1556), 311, 83);
+ Table.States (1556).Kernel := To_Vector ((0 => ((181, 4), 75, 1,
(32767, 0), 0)));
+ Table.States (1556).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1557).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1557), 86, (252, 0), 33);
+ Add_Action (Table.States (1557), 90, (268, 0), 34);
+ Add_Action (Table.States (1557), 116, (196, 0), 146);
+ Add_Action (Table.States (1557), 117, (196, 1), 37);
+ Add_Action (Table.States (1557), 118, (195, 6), 38);
+ Table.States (1557).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1557), 182, 1866);
+ Add_Goto (Table.States (1557), 195, 1152);
+ Add_Goto (Table.States (1557), 196, 148);
+ Add_Goto (Table.States (1557), 197, 54);
+ Add_Goto (Table.States (1557), 198, 55);
+ Add_Goto (Table.States (1557), 199, 56);
+ Add_Goto (Table.States (1557), 201, 57);
+ Add_Goto (Table.States (1557), 251, 58);
+ Add_Goto (Table.States (1557), 252, 59);
+ Add_Goto (Table.States (1557), 255, 60);
+ Add_Goto (Table.States (1557), 268, 68);
+ Add_Goto (Table.States (1557), 311, 83);
+ Table.States (1557).Kernel := To_Vector ((0 => ((181, 2), 75, 1,
(32767, 0), 0)));
+ Table.States (1557).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1558).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1558), 82, (175, 0), 1867);
+ Table.States (1558).Kernel := To_Vector ((0 => ((175, 0), 196,
12, (32767, 0), 0)));
+ Table.States (1558).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (175, 0), 82, 1867)));
+ Table.States (1559).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1559), (63, 66), (171, 3), 2);
+ Table.States (1559).Kernel := To_Vector ((0 => ((171, 3), 108,
0, (171, 3), 2)));
+ Table.States (1559).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (171, 3), 2)));
+ Table.States (1560).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1560), 67, (170, 0), 1868);
+ Table.States (1560).Kernel := To_Vector ((((170, 0), 66, 2,
(32767, 0), 0), ((170, 1), 66, 1, (32767,
+ 0), 0)));
+ Table.States (1560).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (170, 0), 67, 1868)));
+ Table.States (1561).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1561), (51, 63, 64, 66, 116), (457, 1),
2);
+ Table.States (1561).Kernel := To_Vector ((((457, 0), 172, 0,
(457, 0), 1), ((457, 1), 172, 0, (457,
+ 1), 2)));
+ Table.States (1561).Minimal_Complete_Actions := To_Vector
(((Reduce, (457, 0), 1), (Reduce, (457, 1),
+ 2)));
+ Table.States (1562).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1562), (63, 66), (171, 1), 2);
+ Table.States (1562).Kernel := To_Vector ((0 => ((171, 1), 175,
0, (171, 1), 2)));
+ Table.States (1562).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (171, 1), 2)));
+ Table.States (1563).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1563), (51, 63, 64, 66, 116), (457, 2),
2);
+ Table.States (1563).Goto_List.Set_Capacity (9);
+ Add_Goto (Table.States (1563), 136, 1145);
+ Add_Goto (Table.States (1563), 172, 1561);
+ Add_Goto (Table.States (1563), 173, 1203);
+ Add_Goto (Table.States (1563), 431, 1205);
+ Add_Goto (Table.States (1563), 437, 140);
+ Add_Goto (Table.States (1563), 438, 141);
+ Add_Goto (Table.States (1563), 440, 142);
+ Add_Goto (Table.States (1563), 454, 143);
+ Add_Goto (Table.States (1563), 457, 1563);
+ Table.States (1563).Kernel := To_Vector ((((457, 1), 457, 5,
(32767, 0), 0), ((457, 2), 457, 0, (457,
+ 2), 2), ((457, 2), 457, 5, (32767, 0), 0)));
+ Table.States (1563).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (457, 2), 2)));
+ Table.States (1564).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1564), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (327, 19), 6);
+ Table.States (1564).Kernel := To_Vector ((0 => ((327, 19), 108,
0, (327, 19), 6)));
+ Table.States (1564).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (327, 19), 6)));
+ Table.States (1565).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1565), 108, (327, 18), 1869);
+ Table.States (1565).Kernel := To_Vector ((0 => ((327, 18), 434,
1, (32767, 0), 0)));
+ Table.States (1565).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (327, 18), 108, 1869)));
+ Table.States (1566).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1566), 61, (434, 0), 299);
+ Add_Action (Table.States (1566), 108, (327, 17), 1870);
+ Table.States (1566).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1566), 434, 1871);
+ Table.States (1566).Kernel := To_Vector ((((327, 16), 27, 3,
(32767, 0), 0), ((327, 17), 27, 1,
+ (32767, 0), 0)));
+ Table.States (1566).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (327, 17), 108, 1870)));
+ Table.States (1567).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1567), (61, 108), (169, 2), 3);
+ Table.States (1567).Kernel := To_Vector ((0 => ((169, 2), 170,
0, (169, 2), 3)));
+ Table.States (1567).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (169, 2), 3)));
+ Table.States (1568).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (1568), 12, (402, 0), 165);
+ Add_Action (Table.States (1568), 46, (233, 2), 167);
+ Add_Action (Table.States (1568), 52, (233, 3), 168);
+ Add_Action (Table.States (1568), 65, (234, 1), 169);
+ Add_Action (Table.States (1568), 76, (256, 0), 170);
+ Add_Action (Table.States (1568), 85, (205, 4), 171);
+ Add_Action (Table.States (1568), 86, (213, 2), 172);
+ Add_Action (Table.States (1568), 90, (268, 0), 34);
+ Add_Action (Table.States (1568), 106, (237, 1), 173);
+ Add_Action (Table.States (1568), 107, (237, 0), 174);
+ Add_Action (Table.States (1568), 115, (234, 0), 175);
+ Add_Action (Table.States (1568), 116, (196, 0), 146);
+ Add_Action (Table.States (1568), 117, (196, 1), 37);
+ Add_Action (Table.States (1568), 118, (195, 6), 38);
+ Table.States (1568).Goto_List.Set_Capacity (31);
+ Add_Goto (Table.States (1568), 195, 176);
+ Add_Goto (Table.States (1568), 196, 148);
+ Add_Goto (Table.States (1568), 197, 54);
+ Add_Goto (Table.States (1568), 198, 55);
+ Add_Goto (Table.States (1568), 199, 56);
+ Add_Goto (Table.States (1568), 201, 57);
+ Add_Goto (Table.States (1568), 205, 177);
+ Add_Goto (Table.States (1568), 206, 178);
+ Add_Goto (Table.States (1568), 210, 179);
+ Add_Goto (Table.States (1568), 211, 180);
+ Add_Goto (Table.States (1568), 213, 181);
+ Add_Goto (Table.States (1568), 214, 182);
+ Add_Goto (Table.States (1568), 215, 183);
+ Add_Goto (Table.States (1568), 218, 184);
+ Add_Goto (Table.States (1568), 219, 185);
+ Add_Goto (Table.States (1568), 220, 186);
+ Add_Goto (Table.States (1568), 227, 1872);
+ Add_Goto (Table.States (1568), 228, 188);
+ Add_Goto (Table.States (1568), 231, 189);
+ Add_Goto (Table.States (1568), 232, 190);
+ Add_Goto (Table.States (1568), 233, 191);
+ Add_Goto (Table.States (1568), 234, 192);
+ Add_Goto (Table.States (1568), 237, 193);
+ Add_Goto (Table.States (1568), 251, 58);
+ Add_Goto (Table.States (1568), 252, 59);
+ Add_Goto (Table.States (1568), 255, 60);
+ Add_Goto (Table.States (1568), 256, 194);
+ Add_Goto (Table.States (1568), 268, 68);
+ Add_Goto (Table.States (1568), 311, 83);
+ Add_Goto (Table.States (1568), 402, 195);
+ Add_Goto (Table.States (1568), 465, 196);
+ Table.States (1568).Kernel := To_Vector ((((152, 0), 72, 5,
(32767, 0), 0), ((152, 1), 72, 1, (32767,
+ 0), 0)));
+ Table.States (1568).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (1569).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (1569), 46, (233, 2), 167);
+ Add_Action (Table.States (1569), 52, (233, 3), 168);
+ Add_Action (Table.States (1569), 65, (234, 1), 169);
+ Add_Action (Table.States (1569), 76, (256, 0), 170);
+ Add_Action (Table.States (1569), 85, (205, 4), 171);
+ Add_Action (Table.States (1569), 86, (213, 2), 172);
+ Add_Action (Table.States (1569), 90, (268, 0), 34);
+ Add_Action (Table.States (1569), 106, (237, 1), 173);
+ Add_Action (Table.States (1569), 107, (237, 0), 174);
+ Add_Action (Table.States (1569), 115, (234, 0), 175);
+ Add_Action (Table.States (1569), 116, (196, 0), 146);
+ Add_Action (Table.States (1569), 117, (196, 1), 37);
+ Add_Action (Table.States (1569), 118, (195, 6), 38);
+ Table.States (1569).Goto_List.Set_Capacity (28);
+ Add_Goto (Table.States (1569), 195, 176);
+ Add_Goto (Table.States (1569), 196, 148);
+ Add_Goto (Table.States (1569), 197, 54);
+ Add_Goto (Table.States (1569), 198, 55);
+ Add_Goto (Table.States (1569), 199, 56);
+ Add_Goto (Table.States (1569), 201, 57);
+ Add_Goto (Table.States (1569), 205, 177);
+ Add_Goto (Table.States (1569), 206, 178);
+ Add_Goto (Table.States (1569), 210, 179);
+ Add_Goto (Table.States (1569), 211, 180);
+ Add_Goto (Table.States (1569), 213, 181);
+ Add_Goto (Table.States (1569), 214, 182);
+ Add_Goto (Table.States (1569), 215, 183);
+ Add_Goto (Table.States (1569), 218, 184);
+ Add_Goto (Table.States (1569), 219, 185);
+ Add_Goto (Table.States (1569), 220, 186);
+ Add_Goto (Table.States (1569), 231, 1873);
+ Add_Goto (Table.States (1569), 232, 190);
+ Add_Goto (Table.States (1569), 233, 191);
+ Add_Goto (Table.States (1569), 234, 192);
+ Add_Goto (Table.States (1569), 237, 193);
+ Add_Goto (Table.States (1569), 251, 58);
+ Add_Goto (Table.States (1569), 252, 59);
+ Add_Goto (Table.States (1569), 255, 60);
+ Add_Goto (Table.States (1569), 256, 194);
+ Add_Goto (Table.States (1569), 268, 68);
+ Add_Goto (Table.States (1569), 311, 83);
+ Add_Goto (Table.States (1569), 465, 196);
+ Table.States (1569).Kernel := To_Vector ((0 => ((149, 0), 74, 3,
(32767, 0), 0)));
+ Table.States (1569).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (1570).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1570), (61, 108), (151, 0), 3);
+ Table.States (1570).Kernel := To_Vector ((0 => ((151, 0), 149,
0, (151, 0), 3)));
+ Table.States (1570).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (151, 0), 3)));
+ Table.States (1571).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1571), (61, 108), (148, 0), 3);
+ Table.States (1571).Kernel := To_Vector ((0 => ((148, 0), 149,
0, (148, 0), 3)));
+ Table.States (1571).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (148, 0), 3)));
+ Table.States (1572).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (1572), 46, (233, 2), 167);
+ Add_Action (Table.States (1572), 52, (233, 3), 168);
+ Add_Action (Table.States (1572), 65, (234, 1), 169);
+ Add_Action (Table.States (1572), 76, (256, 0), 170);
+ Add_Action (Table.States (1572), 85, (205, 4), 171);
+ Add_Action (Table.States (1572), 86, (213, 2), 172);
+ Add_Action (Table.States (1572), 90, (268, 0), 34);
+ Add_Action (Table.States (1572), 106, (237, 1), 173);
+ Add_Action (Table.States (1572), 107, (237, 0), 174);
+ Add_Action (Table.States (1572), 115, (234, 0), 175);
+ Add_Action (Table.States (1572), 116, (196, 0), 146);
+ Add_Action (Table.States (1572), 117, (196, 1), 37);
+ Add_Action (Table.States (1572), 118, (195, 6), 38);
+ Table.States (1572).Goto_List.Set_Capacity (28);
+ Add_Goto (Table.States (1572), 195, 176);
+ Add_Goto (Table.States (1572), 196, 148);
+ Add_Goto (Table.States (1572), 197, 54);
+ Add_Goto (Table.States (1572), 198, 55);
+ Add_Goto (Table.States (1572), 199, 56);
+ Add_Goto (Table.States (1572), 201, 57);
+ Add_Goto (Table.States (1572), 205, 177);
+ Add_Goto (Table.States (1572), 206, 178);
+ Add_Goto (Table.States (1572), 210, 179);
+ Add_Goto (Table.States (1572), 211, 180);
+ Add_Goto (Table.States (1572), 213, 181);
+ Add_Goto (Table.States (1572), 214, 182);
+ Add_Goto (Table.States (1572), 215, 183);
+ Add_Goto (Table.States (1572), 218, 184);
+ Add_Goto (Table.States (1572), 219, 185);
+ Add_Goto (Table.States (1572), 220, 186);
+ Add_Goto (Table.States (1572), 231, 1874);
+ Add_Goto (Table.States (1572), 232, 190);
+ Add_Goto (Table.States (1572), 233, 191);
+ Add_Goto (Table.States (1572), 234, 192);
+ Add_Goto (Table.States (1572), 237, 193);
+ Add_Goto (Table.States (1572), 251, 58);
+ Add_Goto (Table.States (1572), 252, 59);
+ Add_Goto (Table.States (1572), 255, 60);
+ Add_Goto (Table.States (1572), 256, 194);
+ Add_Goto (Table.States (1572), 268, 68);
+ Add_Goto (Table.States (1572), 311, 83);
+ Add_Goto (Table.States (1572), 465, 196);
+ Table.States (1572).Kernel := To_Vector ((0 => ((145, 0), 97, 1,
(32767, 0), 0)));
+ Table.States (1572).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (1573).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1573), 27, (328, 46), 1875);
+ Add_Action (Table.States (1573), 65, (170, 2), 821);
+ Add_Action (Table.States (1573), 67, (170, 0), 822);
+ Table.States (1573).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1573), 170, 1876);
+ Table.States (1573).Kernel := To_Vector ((((179, 0), 61, 2,
(32767, 0), 0), ((328, 46), 61, 4, (32767,
+ 0), 0), ((328, 47), 61, 2, (32767, 0), 0)));
+ Table.States (1573).Minimal_Complete_Actions := To_Vector
(((Shift, (170, 2), 65, 821), (Shift, (328, 46),
+ 27, 1875)));
+ Table.States (1574).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1574), 86, (252, 0), 33);
+ Add_Action (Table.States (1574), 90, (268, 0), 34);
+ Add_Action (Table.States (1574), 116, (196, 0), 146);
+ Add_Action (Table.States (1574), 117, (196, 1), 37);
+ Add_Action (Table.States (1574), 118, (195, 6), 38);
+ Table.States (1574).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1574), 182, 1877);
+ Add_Goto (Table.States (1574), 195, 1152);
+ Add_Goto (Table.States (1574), 196, 148);
+ Add_Goto (Table.States (1574), 197, 54);
+ Add_Goto (Table.States (1574), 198, 55);
+ Add_Goto (Table.States (1574), 199, 56);
+ Add_Goto (Table.States (1574), 201, 57);
+ Add_Goto (Table.States (1574), 251, 58);
+ Add_Goto (Table.States (1574), 252, 59);
+ Add_Goto (Table.States (1574), 255, 60);
+ Add_Goto (Table.States (1574), 268, 68);
+ Add_Goto (Table.States (1574), 311, 83);
+ Table.States (1574).Kernel := To_Vector ((((138, 9), 75, 4,
(32767, 0), 0), ((328, 44), 75, 6, (32767,
+ 0), 0), ((328, 45), 75, 4, (32767, 0), 0)));
+ Table.States (1574).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1575).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1575), (61, 108), (138, 10), 3);
+ Table.States (1575).Kernel := To_Vector ((0 => ((138, 10), 179,
0, (138, 10), 3)));
+ Table.States (1575).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (138, 10), 3)));
+ Table.States (1576).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1576), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (327, 21), 6);
+ Table.States (1576).Kernel := To_Vector ((0 => ((327, 21), 108,
0, (327, 21), 6)));
+ Table.States (1576).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (327, 21), 6)));
+ Table.States (1577).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1577), 108, (327, 20), 1878);
+ Table.States (1577).Kernel := To_Vector ((0 => ((327, 20), 434,
1, (32767, 0), 0)));
+ Table.States (1577).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (327, 20), 108, 1878)));
+ Table.States (1578).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1578), 86, (252, 0), 33);
+ Add_Action (Table.States (1578), 90, (268, 0), 34);
+ Add_Action (Table.States (1578), 116, (196, 0), 146);
+ Add_Action (Table.States (1578), 117, (196, 1), 37);
+ Add_Action (Table.States (1578), 118, (195, 6), 38);
+ Table.States (1578).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1578), 182, 1879);
+ Add_Goto (Table.States (1578), 195, 1152);
+ Add_Goto (Table.States (1578), 196, 148);
+ Add_Goto (Table.States (1578), 197, 54);
+ Add_Goto (Table.States (1578), 198, 55);
+ Add_Goto (Table.States (1578), 199, 56);
+ Add_Goto (Table.States (1578), 201, 57);
+ Add_Goto (Table.States (1578), 251, 58);
+ Add_Goto (Table.States (1578), 252, 59);
+ Add_Goto (Table.States (1578), 255, 60);
+ Add_Goto (Table.States (1578), 268, 68);
+ Add_Goto (Table.States (1578), 311, 83);
+ Table.States (1578).Kernel := To_Vector ((0 => ((181, 0), 75, 1,
(32767, 0), 0)));
+ Table.States (1578).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1579).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1579), 61, (179, 0), 1880);
+ Add_Conflict (Table.States (1579), 61, (138, 8), 3);
+ Add_Action (Table.States (1579), 75, (138, 6), 1881);
+ Add_Action (Table.States (1579), 108, Reduce, (138, 8), 3);
+ Table.States (1579).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1579), 179, 1882);
+ Table.States (1579).Kernel := To_Vector ((((138, 6), 131, 5,
(32767, 0), 0), ((138, 7), 131, 3,
+ (32767, 0), 0), ((138, 8), 131, 0, (138, 8), 3), ((328, 36),
131, 7, (32767, 0), 0), ((328, 37),
+ 131, 5, (32767, 0), 0), ((328, 38), 131, 5, (32767, 0), 0),
((328, 39), 131, 3, (32767, 0), 0)));
+ Table.States (1579).Minimal_Complete_Actions := To_Vector
(((Shift, (179, 0), 61, 1880), (Reduce, (138,
+ 8), 3)));
+ Table.States (1580).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1580), 52, (187, 0), 347);
+ Add_Action (Table.States (1580), 86, (252, 0), 33);
+ Add_Action (Table.States (1580), 90, (268, 0), 34);
+ Add_Action (Table.States (1580), 116, (196, 0), 146);
+ Add_Action (Table.States (1580), 117, (196, 1), 37);
+ Add_Action (Table.States (1580), 118, (195, 6), 38);
+ Table.States (1580).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (1580), 131, 1883);
+ Add_Goto (Table.States (1580), 187, 365);
+ Add_Goto (Table.States (1580), 195, 528);
+ Add_Goto (Table.States (1580), 196, 148);
+ Add_Goto (Table.States (1580), 197, 54);
+ Add_Goto (Table.States (1580), 198, 55);
+ Add_Goto (Table.States (1580), 199, 56);
+ Add_Goto (Table.States (1580), 201, 57);
+ Add_Goto (Table.States (1580), 251, 58);
+ Add_Goto (Table.States (1580), 252, 59);
+ Add_Goto (Table.States (1580), 255, 60);
+ Add_Goto (Table.States (1580), 268, 68);
+ Add_Goto (Table.States (1580), 311, 83);
+ Table.States (1580).Kernel := To_Vector ((((328, 28), 76, 8,
(32767, 0), 0), ((328, 29), 76, 6,
+ (32767, 0), 0), ((328, 30), 76, 6, (32767, 0), 0), ((328, 31),
76, 4, (32767, 0), 0)));
+ Table.States (1580).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ end Subr_57;
+ procedure Subr_58
+ is begin
+ Table.States (1581).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1581), 61, (434, 0), 299);
+ Add_Action (Table.States (1581), 108, (327, 15), 1884);
+ Table.States (1581).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1581), 434, 1885);
+ Table.States (1581).Kernel := To_Vector ((((327, 14), 27, 3,
(32767, 0), 0), ((327, 15), 27, 1,
+ (32767, 0), 0)));
+ Table.States (1581).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (327, 15), 108, 1884)));
+ Table.States (1582).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1582), 27, (327, 12), 1886);
+ Add_Action (Table.States (1582), 65, (170, 2), 821);
+ Add_Action (Table.States (1582), 67, (170, 0), 822);
+ Table.States (1582).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1582), 170, 1887);
+ Table.States (1582).Kernel := To_Vector ((((169, 0), 77, 2,
(32767, 0), 0), ((327, 12), 77, 4, (32767,
+ 0), 0), ((327, 13), 77, 2, (32767, 0), 0)));
+ Table.States (1582).Minimal_Complete_Actions := To_Vector
(((Shift, (170, 2), 65, 821), (Shift, (327, 12),
+ 27, 1886)));
+ Table.States (1583).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1583), (61, 108), (169, 1), 3);
+ Table.States (1583).Kernel := To_Vector ((0 => ((169, 1), 170,
0, (169, 1), 3)));
+ Table.States (1583).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (169, 1), 3)));
+ Table.States (1584).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1584), 61, (179, 0), 1888);
+ Add_Conflict (Table.States (1584), 61, (138, 5), 3);
+ Add_Action (Table.States (1584), 75, (138, 3), 1889);
+ Add_Action (Table.States (1584), 108, Reduce, (138, 5), 3);
+ Table.States (1584).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1584), 179, 1890);
+ Table.States (1584).Kernel := To_Vector ((((138, 3), 131, 5,
(32767, 0), 0), ((138, 4), 131, 3,
+ (32767, 0), 0), ((138, 5), 131, 0, (138, 5), 3), ((328, 32),
131, 7, (32767, 0), 0), ((328, 33),
+ 131, 5, (32767, 0), 0), ((328, 34), 131, 5, (32767, 0), 0),
((328, 35), 131, 3, (32767, 0), 0)));
+ Table.States (1584).Minimal_Complete_Actions := To_Vector
(((Shift, (179, 0), 61, 1888), (Reduce, (138,
+ 5), 3)));
+ Table.States (1585).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1585), 52, (187, 0), 347);
+ Add_Action (Table.States (1585), 86, (252, 0), 33);
+ Add_Action (Table.States (1585), 90, (268, 0), 34);
+ Add_Action (Table.States (1585), 116, (196, 0), 146);
+ Add_Action (Table.States (1585), 117, (196, 1), 37);
+ Add_Action (Table.States (1585), 118, (195, 6), 38);
+ Table.States (1585).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (1585), 131, 1891);
+ Add_Goto (Table.States (1585), 187, 365);
+ Add_Goto (Table.States (1585), 195, 528);
+ Add_Goto (Table.States (1585), 196, 148);
+ Add_Goto (Table.States (1585), 197, 54);
+ Add_Goto (Table.States (1585), 198, 55);
+ Add_Goto (Table.States (1585), 199, 56);
+ Add_Goto (Table.States (1585), 201, 57);
+ Add_Goto (Table.States (1585), 251, 58);
+ Add_Goto (Table.States (1585), 252, 59);
+ Add_Goto (Table.States (1585), 255, 60);
+ Add_Goto (Table.States (1585), 268, 68);
+ Add_Goto (Table.States (1585), 311, 83);
+ Table.States (1585).Kernel := To_Vector ((((138, 0), 76, 6,
(32767, 0), 0), ((138, 1), 76, 4, (32767,
+ 0), 0), ((138, 2), 76, 1, (32767, 0), 0), ((328, 24), 76, 8,
(32767, 0), 0), ((328, 25), 76, 6,
+ (32767, 0), 0), ((328, 26), 76, 6, (32767, 0), 0), ((328, 27),
76, 4, (32767, 0), 0)));
+ Table.States (1585).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1586).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1586), (61, 108), (142, 0), 3);
+ Table.States (1586).Kernel := To_Vector ((0 => ((142, 0), 87, 0,
(142, 0), 3)));
+ Table.States (1586).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (142, 0), 3)));
+ Table.States (1587).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1587), 116, (143, 0), 1224);
+ Add_Action (Table.States (1587), 118, (143, 1), 1225);
+ Table.States (1587).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1587), 141, 1892);
+ Add_Goto (Table.States (1587), 143, 1893);
+ Table.States (1587).Kernel := To_Vector ((((141, 1), 95, 1,
(32767, 0), 0), ((141, 2), 95, 1, (32767,
+ 0), 0)));
+ Table.States (1588).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1588), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (128, 2), 6);
+ Table.States (1588).Kernel := To_Vector ((0 => ((128, 2), 108,
0, (128, 2), 6)));
+ Table.States (1588).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (128, 2), 6)));
+ Table.States (1589).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1589), 53, (186, 1), 1185);
+ Add_Action (Table.States (1589), 54, (186, 0), 1186);
+ Table.States (1589).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1589), 186, 1894);
+ Table.States (1589).Kernel := To_Vector ((0 => ((183, 2), 59, 1,
(32767, 0), 0)));
+ Table.States (1589).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (186, 0), 54, 1186)));
+ Table.States (1590).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1590), (49, 61, 108), (183, 3), 3);
+ Table.States (1590).Kernel := To_Vector ((0 => ((183, 3), 186,
0, (183, 3), 3)));
+ Table.States (1590).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (183, 3), 3)));
+ Table.States (1591).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1591), 56, (188, 0), 880);
+ Add_Action (Table.States (1591), 86, (252, 0), 33);
+ Add_Action (Table.States (1591), 90, (268, 0), 34);
+ Add_Action (Table.States (1591), 116, (196, 0), 146);
+ Add_Action (Table.States (1591), 117, (196, 1), 37);
+ Add_Action (Table.States (1591), 118, (195, 6), 38);
+ Table.States (1591).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (1591), 195, 1895);
+ Add_Goto (Table.States (1591), 196, 148);
+ Add_Goto (Table.States (1591), 197, 54);
+ Add_Goto (Table.States (1591), 198, 55);
+ Add_Goto (Table.States (1591), 199, 56);
+ Add_Goto (Table.States (1591), 201, 57);
+ Add_Goto (Table.States (1591), 251, 58);
+ Add_Goto (Table.States (1591), 252, 59);
+ Add_Goto (Table.States (1591), 255, 60);
+ Add_Goto (Table.States (1591), 268, 68);
+ Add_Goto (Table.States (1591), 311, 83);
+ Table.States (1591).Kernel := To_Vector ((((168, 0), 187, 3,
(32767, 0), 0), ((168, 1), 187, 1,
+ (32767, 0), 0), ((188, 0), 187, 3, (32767, 0), 0), ((188, 1),
187, 2, (32767, 0), 0), ((188, 4),
+ 187, 3, (32767, 0), 0), ((188, 5), 187, 2, (32767, 0), 0),
((188, 8), 187, 5, (32767, 0), 0),
+ ((188, 9), 187, 4, (32767, 0), 0)));
+ Table.States (1591).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1592).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1592), 87, Reduce, (168, 5), 3);
+ Add_Action (Table.States (1592), 94, (134, 0), 282);
+ Add_Action (Table.States (1592), 108, Reduce, (168, 5), 3);
+ Table.States (1592).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1592), 134, 1896);
+ Table.States (1592).Kernel := To_Vector ((((168, 4), 188, 2,
(32767, 0), 0), ((168, 5), 188, 0, (168,
+ 5), 3)));
+ Table.States (1592).Minimal_Complete_Actions := To_Vector
(((Shift, (134, 0), 94, 282), (Reduce, (168, 5),
+ 3)));
+ Table.States (1593).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1593), 85, (198, 0), 281);
+ Add_Action (Table.States (1593), 87, Reduce, (168, 3), 3);
+ Add_Action (Table.States (1593), 94, (134, 0), 282);
+ Add_Action (Table.States (1593), 96, (197, 0), 283);
+ Add_Action (Table.States (1593), 108, Reduce, (168, 3), 3);
+ Add_Action (Table.States (1593), 113, (121, 0), 285);
+ Add_Action (Table.States (1593), 114, (121, 1), 286);
+ Table.States (1593).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1593), 121, 287);
+ Add_Goto (Table.States (1593), 134, 1897);
+ Add_Goto (Table.States (1593), 313, 289);
+ Table.States (1593).Kernel := To_Vector ((((168, 2), 195, 2,
(32767, 0), 0), ((168, 3), 195, 0, (168,
+ 3), 3), ((197, 0), 195, 2, (32767, 0), 0), ((198, 0), 195,
3, (32767, 0), 0), ((199, 0), 195, 2,
+ (32767, 0), 0), ((201, 0), 195, 2, (32767, 0), 0), ((255, 0),
195, 3, (32767, 0), 0), ((311, 0),
+ 195, 3, (32767, 0), 0)));
+ Table.States (1593).Minimal_Complete_Actions := To_Vector
(((Shift, (134, 0), 94, 282), (Reduce, (168, 3),
+ 3)));
+ Table.States (1594).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1594), (87, 108), (166, 2), 3);
+ Table.States (1594).Kernel := To_Vector ((((166, 1), 166, 4,
(32767, 0), 0), ((166, 2), 166, 0, (166,
+ 2), 3), ((166, 2), 166, 4, (32767, 0), 0)));
+ Table.States (1594).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (166, 2), 3)));
+ Table.States (1595).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1595), (87, 108), (166, 1), 3);
+ Table.States (1595).Kernel := To_Vector ((((166, 0), 168, 0,
(166, 0), 1), ((166, 1), 168, 0, (166,
+ 1), 3)));
+ Table.States (1595).Minimal_Complete_Actions := To_Vector
(((Reduce, (166, 0), 1), (Reduce, (166, 1),
+ 3)));
+ Table.States (1596).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1596), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (327, 11), 6);
+ Table.States (1596).Kernel := To_Vector ((0 => ((327, 11), 108,
0, (327, 11), 6)));
+ Table.States (1596).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (327, 11), 6)));
+ Table.States (1597).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1597), 108, (327, 10), 1898);
+ Table.States (1597).Kernel := To_Vector ((0 => ((327, 10), 434,
1, (32767, 0), 0)));
+ Table.States (1597).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (327, 10), 108, 1898)));
+ Table.States (1598).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1598), 52, (187, 0), 347);
+ Add_Action (Table.States (1598), 86, (252, 0), 33);
+ Add_Action (Table.States (1598), 90, (268, 0), 34);
+ Add_Action (Table.States (1598), 116, (196, 0), 146);
+ Add_Action (Table.States (1598), 117, (196, 1), 37);
+ Add_Action (Table.States (1598), 118, (195, 6), 38);
+ Table.States (1598).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (1598), 131, 1899);
+ Add_Goto (Table.States (1598), 187, 365);
+ Add_Goto (Table.States (1598), 195, 528);
+ Add_Goto (Table.States (1598), 196, 148);
+ Add_Goto (Table.States (1598), 197, 54);
+ Add_Goto (Table.States (1598), 198, 55);
+ Add_Goto (Table.States (1598), 199, 56);
+ Add_Goto (Table.States (1598), 201, 57);
+ Add_Goto (Table.States (1598), 251, 58);
+ Add_Goto (Table.States (1598), 252, 59);
+ Add_Goto (Table.States (1598), 255, 60);
+ Add_Goto (Table.States (1598), 268, 68);
+ Add_Goto (Table.States (1598), 311, 83);
+ Table.States (1598).Kernel := To_Vector ((((328, 16), 76, 8,
(32767, 0), 0), ((328, 17), 76, 6,
+ (32767, 0), 0), ((328, 18), 76, 6, (32767, 0), 0), ((328, 19),
76, 4, (32767, 0), 0)));
+ Table.States (1598).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1599).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1599), 61, (434, 0), 299);
+ Add_Action (Table.States (1599), 108, (327, 7), 1900);
+ Table.States (1599).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1599), 434, 1901);
+ Table.States (1599).Kernel := To_Vector ((((327, 6), 27, 3,
(32767, 0), 0), ((327, 7), 27, 1, (32767,
+ 0), 0)));
+ Table.States (1599).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (327, 7), 108, 1900)));
+ Table.States (1600).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1600), 27, (327, 4), 1902);
+ Table.States (1600).Kernel := To_Vector ((((327, 4), 77, 4,
(32767, 0), 0), ((327, 5), 77, 2, (32767,
+ 0), 0)));
+ Table.States (1600).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (327, 4), 27, 1902)));
+ Table.States (1601).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1601), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (189, 0), 6);
+ Table.States (1601).Kernel := To_Vector ((0 => ((189, 0), 108,
0, (189, 0), 6)));
+ Table.States (1601).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (189, 0), 6)));
+ Table.States (1602).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1602), 61, (328, 22), 1903);
+ Add_Action (Table.States (1602), 75, (328, 20), 1904);
+ Table.States (1602).Kernel := To_Vector ((((328, 20), 131, 7,
(32767, 0), 0), ((328, 21), 131, 5,
+ (32767, 0), 0), ((328, 22), 131, 5, (32767, 0), 0), ((328,
23), 131, 3, (32767, 0), 0)));
+ Table.States (1602).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 22), 61, 1903)));
+ Table.States (1603).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1603), 61, (434, 0), 299);
+ Add_Action (Table.States (1603), 108, (327, 9), 1905);
+ Table.States (1603).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1603), 434, 1906);
+ Table.States (1603).Kernel := To_Vector ((((327, 8), 27, 3,
(32767, 0), 0), ((327, 9), 27, 1, (32767,
+ 0), 0)));
+ Table.States (1603).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (327, 9), 108, 1905)));
+ Table.States (1604).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1604), 52, (187, 0), 347);
+ Add_Action (Table.States (1604), 86, (252, 0), 33);
+ Add_Action (Table.States (1604), 90, (268, 0), 34);
+ Add_Action (Table.States (1604), 116, (196, 0), 146);
+ Add_Action (Table.States (1604), 117, (196, 1), 37);
+ Add_Action (Table.States (1604), 118, (195, 6), 38);
+ Table.States (1604).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (1604), 131, 1907);
+ Add_Goto (Table.States (1604), 187, 365);
+ Add_Goto (Table.States (1604), 195, 528);
+ Add_Goto (Table.States (1604), 196, 148);
+ Add_Goto (Table.States (1604), 197, 54);
+ Add_Goto (Table.States (1604), 198, 55);
+ Add_Goto (Table.States (1604), 199, 56);
+ Add_Goto (Table.States (1604), 201, 57);
+ Add_Goto (Table.States (1604), 251, 58);
+ Add_Goto (Table.States (1604), 252, 59);
+ Add_Goto (Table.States (1604), 255, 60);
+ Add_Goto (Table.States (1604), 268, 68);
+ Add_Goto (Table.States (1604), 311, 83);
+ Table.States (1604).Kernel := To_Vector ((((328, 12), 76, 8,
(32767, 0), 0), ((328, 13), 76, 6,
+ (32767, 0), 0), ((328, 14), 76, 6, (32767, 0), 0), ((328, 15),
76, 4, (32767, 0), 0)));
+ Table.States (1604).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1605).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1605), 76, (328, 4), 1908);
+ Table.States (1605).Kernel := To_Vector ((((328, 4), 58, 9,
(32767, 0), 0), ((328, 5), 58, 7, (32767,
+ 0), 0), ((328, 6), 58, 7, (32767, 0), 0), ((328, 7), 58, 5,
(32767, 0), 0)));
+ Table.States (1605).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 4), 76, 1908)));
+ Table.States (1606).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1606), 27, (327, 2), 1909);
+ Add_Action (Table.States (1606), 77, (327, 0), 1910);
+ Table.States (1606).Kernel := To_Vector ((((327, 0), 68, 5,
(32767, 0), 0), ((327, 1), 68, 3, (32767,
+ 0), 0), ((327, 2), 68, 4, (32767, 0), 0), ((327, 3), 68, 2,
(32767, 0), 0)));
+ Table.States (1606).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (327, 2), 27, 1909)));
+ Table.States (1607).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1607), 52, (187, 0), 347);
+ Add_Action (Table.States (1607), 86, (252, 0), 33);
+ Add_Action (Table.States (1607), 90, (268, 0), 34);
+ Add_Action (Table.States (1607), 116, (196, 0), 146);
+ Add_Action (Table.States (1607), 117, (196, 1), 37);
+ Add_Action (Table.States (1607), 118, (195, 6), 38);
+ Table.States (1607).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (1607), 131, 1911);
+ Add_Goto (Table.States (1607), 187, 365);
+ Add_Goto (Table.States (1607), 195, 528);
+ Add_Goto (Table.States (1607), 196, 148);
+ Add_Goto (Table.States (1607), 197, 54);
+ Add_Goto (Table.States (1607), 198, 55);
+ Add_Goto (Table.States (1607), 199, 56);
+ Add_Goto (Table.States (1607), 201, 57);
+ Add_Goto (Table.States (1607), 251, 58);
+ Add_Goto (Table.States (1607), 252, 59);
+ Add_Goto (Table.States (1607), 255, 60);
+ Add_Goto (Table.States (1607), 268, 68);
+ Add_Goto (Table.States (1607), 311, 83);
+ Table.States (1607).Kernel := To_Vector ((((328, 8), 76, 8,
(32767, 0), 0), ((328, 9), 76, 6, (32767,
+ 0), 0), ((328, 10), 76, 6, (32767, 0), 0), ((328, 11), 76,
4, (32767, 0), 0)));
+ Table.States (1607).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1608).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1608), 76, (328, 0), 1912);
+ Table.States (1608).Kernel := To_Vector ((((328, 0), 77, 9,
(32767, 0), 0), ((328, 1), 77, 7, (32767,
+ 0), 0), ((328, 2), 77, 7, (32767, 0), 0), ((328, 3), 77, 5,
(32767, 0), 0)));
+ Table.States (1608).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 0), 76, 1912)));
+ Table.States (1609).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1609), 65, (170, 2), 821);
+ Add_Action (Table.States (1609), 67, (170, 0), 822);
+ Table.States (1609).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1609), 170, 1567);
+ Table.States (1609).Kernel := To_Vector ((0 => ((169, 2), 77, 2,
(32767, 0), 0)));
+ Table.States (1609).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (170, 2), 65, 821)));
+ Table.States (1610).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1610), 61, (179, 0), 1913);
+ Add_Conflict (Table.States (1610), 61, (138, 11), 2);
+ Add_Action (Table.States (1610), 75, (138, 9), 1914);
+ Add_Action (Table.States (1610), 108, Reduce, (138, 11), 2);
+ Table.States (1610).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1610), 179, 1575);
+ Table.States (1610).Kernel := To_Vector ((((138, 9), 131, 5,
(32767, 0), 0), ((138, 10), 131, 3,
+ (32767, 0), 0), ((138, 11), 131, 0, (138, 11), 2)));
+ Table.States (1610).Minimal_Complete_Actions := To_Vector
(((Shift, (179, 0), 61, 1913), (Reduce, (138,
+ 11), 2)));
+ Table.States (1611).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1611), 52, (187, 0), 347);
+ Add_Action (Table.States (1611), 86, (252, 0), 33);
+ Add_Action (Table.States (1611), 90, (268, 0), 34);
+ Add_Action (Table.States (1611), 116, (196, 0), 146);
+ Add_Action (Table.States (1611), 117, (196, 1), 37);
+ Add_Action (Table.States (1611), 118, (195, 6), 38);
+ Table.States (1611).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (1611), 131, 1915);
+ Add_Goto (Table.States (1611), 187, 365);
+ Add_Goto (Table.States (1611), 195, 528);
+ Add_Goto (Table.States (1611), 196, 148);
+ Add_Goto (Table.States (1611), 197, 54);
+ Add_Goto (Table.States (1611), 198, 55);
+ Add_Goto (Table.States (1611), 199, 56);
+ Add_Goto (Table.States (1611), 201, 57);
+ Add_Goto (Table.States (1611), 251, 58);
+ Add_Goto (Table.States (1611), 252, 59);
+ Add_Goto (Table.States (1611), 255, 60);
+ Add_Goto (Table.States (1611), 268, 68);
+ Add_Goto (Table.States (1611), 311, 83);
+ Table.States (1611).Kernel := To_Vector ((((138, 6), 76, 6,
(32767, 0), 0), ((138, 7), 76, 4, (32767,
+ 0), 0), ((138, 8), 76, 1, (32767, 0), 0)));
+ Table.States (1611).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1612).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1612), 65, (170, 2), 821);
+ Add_Action (Table.States (1612), 67, (170, 0), 822);
+ Add_Action (Table.States (1612), 77, (169, 0), 1916);
+ Table.States (1612).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1612), 170, 1583);
+ Table.States (1612).Kernel := To_Vector ((((169, 0), 68, 3,
(32767, 0), 0), ((169, 1), 68, 2, (32767,
+ 0), 0)));
+ Table.States (1612).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (170, 2), 65, 821)));
+ Table.States (1613).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1613), 52, (187, 0), 347);
+ Add_Action (Table.States (1613), 86, (252, 0), 33);
+ Add_Action (Table.States (1613), 90, (268, 0), 34);
+ Add_Action (Table.States (1613), 116, (196, 0), 146);
+ Add_Action (Table.States (1613), 117, (196, 1), 37);
+ Add_Action (Table.States (1613), 118, (195, 6), 38);
+ Table.States (1613).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (1613), 131, 1917);
+ Add_Goto (Table.States (1613), 187, 365);
+ Add_Goto (Table.States (1613), 195, 528);
+ Add_Goto (Table.States (1613), 196, 148);
+ Add_Goto (Table.States (1613), 197, 54);
+ Add_Goto (Table.States (1613), 198, 55);
+ Add_Goto (Table.States (1613), 199, 56);
+ Add_Goto (Table.States (1613), 201, 57);
+ Add_Goto (Table.States (1613), 251, 58);
+ Add_Goto (Table.States (1613), 252, 59);
+ Add_Goto (Table.States (1613), 255, 60);
+ Add_Goto (Table.States (1613), 268, 68);
+ Add_Goto (Table.States (1613), 311, 83);
+ Table.States (1613).Kernel := To_Vector ((((138, 3), 76, 6,
(32767, 0), 0), ((138, 4), 76, 4, (32767,
+ 0), 0), ((138, 5), 76, 1, (32767, 0), 0)));
+ Table.States (1613).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1614).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1614), 76, (138, 0), 1918);
+ Table.States (1614).Kernel := To_Vector ((((138, 0), 77, 7,
(32767, 0), 0), ((138, 1), 77, 5, (32767,
+ 0), 0), ((138, 2), 77, 2, (32767, 0), 0)));
+ Table.States (1614).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (138, 0), 76, 1918)));
+ Table.States (1615).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1615), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (128, 1), 6);
+ Table.States (1615).Kernel := To_Vector ((0 => ((128, 1), 108,
0, (128, 1), 6)));
+ Table.States (1615).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (128, 1), 6)));
+ Table.States (1616).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1616), 108, (128, 0), 1919);
+ Table.States (1616).Kernel := To_Vector ((0 => ((128, 0), 434,
1, (32767, 0), 0)));
+ Table.States (1616).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (128, 0), 108, 1919)));
+ Table.States (1617).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (1617), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (124, 2), 6);
+ Table.States (1617).Kernel := To_Vector ((0 => ((124, 2), 108,
0, (124, 2), 6)));
+ Table.States (1617).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (124, 2), 6)));
+ Table.States (1618).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (1618), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (124, 0), 6);
+ Table.States (1618).Kernel := To_Vector ((0 => ((124, 0), 108,
0, (124, 0), 6)));
+ Table.States (1618).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (124, 0), 6)));
+ Table.States (1619).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1619), (87, 95), (123, 1), 3);
+ Table.States (1619).Kernel := To_Vector ((0 => ((123, 1), 125,
0, (123, 1), 3)));
+ Table.States (1619).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (123, 1), 3)));
+ Table.States (1620).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1620), (87, 95), (125, 0), 3);
+ Table.States (1620).Kernel := To_Vector ((0 => ((125, 0), 227,
0, (125, 0), 3)));
+ Table.States (1620).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 0), 3)));
+ Table.States (1621).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1621), 88, (252, 0), 1920);
+ Table.States (1621).Kernel := To_Vector ((0 => ((252, 0), 221,
1, (32767, 0), 0)));
+ Table.States (1621).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (252, 0), 88, 1920)));
+ end Subr_58;
+ procedure Subr_59
+ is begin
+ Table.States (1622).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1622), (87, 88, 95), (221, 0), 5);
+ Table.States (1622).Kernel := To_Vector ((0 => ((221, 0), 314,
0, (221, 0), 5)));
+ Table.States (1622).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (221, 0), 5)));
+ Table.States (1623).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1623), (87, 88, 95), (221, 2), 5);
+ Table.States (1623).Kernel := To_Vector ((0 => ((221, 2), 314,
0, (221, 2), 5)));
+ Table.States (1623).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (221, 2), 5)));
+ Table.States (1624).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1624), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (336, 1), 6);
+ Table.States (1624).Kernel := To_Vector ((0 => ((336, 1), 108,
0, (336, 1), 6)));
+ Table.States (1624).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (336, 1), 6)));
+ Table.States (1625).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1625), 108, (336, 0), 1921);
+ Table.States (1625).Kernel := To_Vector ((0 => ((336, 0), 434,
1, (32767, 0), 0)));
+ Table.States (1625).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (336, 0), 108, 1921)));
+ Table.States (1626).Action_List.Set_Capacity (10);
+ Add_Action (Table.States (1626), (24, 33, 47, 49, 61, 69, 82, 87,
94, 108), (188, 10), 4);
+ Table.States (1626).Kernel := To_Vector ((0 => ((188, 10), 297,
0, (188, 10), 4)));
+ Table.States (1626).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (188, 10), 4)));
+ Table.States (1627).Action_List.Set_Capacity (10);
+ Add_Action (Table.States (1627), (24, 33, 47, 49, 61, 69, 82, 87,
94, 108), (188, 6), 4);
+ Table.States (1627).Kernel := To_Vector ((0 => ((188, 6), 295,
0, (188, 6), 4)));
+ Table.States (1627).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (188, 6), 4)));
+ Table.States (1628).Action_List.Set_Capacity (10);
+ Add_Action (Table.States (1628), (24, 33, 47, 49, 61, 69, 82, 87,
94, 108), (188, 9), 4);
+ Table.States (1628).Kernel := To_Vector ((0 => ((188, 9), 297,
0, (188, 9), 4)));
+ Table.States (1628).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (188, 9), 4)));
+ Table.States (1629).Action_List.Set_Capacity (10);
+ Add_Action (Table.States (1629), (24, 33, 47, 49, 61, 69, 82, 87,
94, 108), (188, 5), 4);
+ Table.States (1629).Kernel := To_Vector ((0 => ((188, 5), 295,
0, (188, 5), 4)));
+ Table.States (1629).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (188, 5), 4)));
+ Table.States (1630).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1630), 30, (296, 0), 476);
+ Add_Action (Table.States (1630), 85, (299, 0), 1257);
+ Table.States (1630).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1630), 296, 479);
+ Add_Goto (Table.States (1630), 297, 1922);
+ Add_Goto (Table.States (1630), 299, 481);
+ Table.States (1630).Kernel := To_Vector ((0 => ((188, 8), 53, 2,
(32767, 0), 0)));
+ Table.States (1630).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (296, 0), 30, 476)));
+ Table.States (1631).Action_List.Set_Capacity (11);
+ Add_Action (Table.States (1631), 24, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1631), 33, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1631), 47, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1631), 49, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1631), 61, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1631), 69, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1631), 82, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1631), 85, (299, 0), 1257);
+ Add_Action (Table.States (1631), 87, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1631), 94, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1631), 108, Reduce, (295, 1), 0);
+ Table.States (1631).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1631), 295, 1923);
+ Add_Goto (Table.States (1631), 299, 426);
+ Table.States (1631).Kernel := To_Vector ((0 => ((188, 4), 54, 0,
(295, 1), 0)));
+ Table.States (1631).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (295, 1), 0)));
+ Table.States (1632).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (1632), 24, Reduce, (188, 0), 4);
+ Add_Action (Table.States (1632), 33, Reduce, (188, 0), 4);
+ Add_Action (Table.States (1632), 47, Reduce, (188, 0), 4);
+ Add_Action (Table.States (1632), 49, Reduce, (188, 0), 4);
+ Add_Action (Table.States (1632), 61, Reduce, (188, 0), 4);
+ Add_Action (Table.States (1632), 69, Reduce, (188, 0), 4);
+ Add_Action (Table.States (1632), 82, Reduce, (188, 0), 4);
+ Add_Action (Table.States (1632), 85, (198, 0), 281);
+ Add_Action (Table.States (1632), 87, Reduce, (188, 0), 4);
+ Add_Action (Table.States (1632), 94, Reduce, (188, 0), 4);
+ Add_Action (Table.States (1632), 96, (197, 0), 283);
+ Add_Action (Table.States (1632), 108, Reduce, (188, 0), 4);
+ Add_Action (Table.States (1632), 113, (121, 0), 285);
+ Add_Action (Table.States (1632), 114, (121, 1), 286);
+ Table.States (1632).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1632), 121, 287);
+ Add_Goto (Table.States (1632), 313, 289);
+ Table.States (1632).Kernel := To_Vector ((((188, 0), 195, 0,
(188, 0), 4), ((197, 0), 195, 2, (32767,
+ 0), 0), ((198, 0), 195, 3, (32767, 0), 0), ((199, 0), 195,
2, (32767, 0), 0), ((201, 0), 195, 2,
+ (32767, 0), 0), ((255, 0), 195, 3, (32767, 0), 0), ((311, 0),
195, 3, (32767, 0), 0)));
+ Table.States (1632).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (188, 0), 4)));
+ Table.States (1633).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1633), 61, (434, 0), 299);
+ Add_Action (Table.States (1633), 85, (198, 0), 281);
+ Add_Action (Table.States (1633), 96, (197, 0), 283);
+ Add_Action (Table.States (1633), 108, (335, 1), 1924);
+ Add_Action (Table.States (1633), 113, (121, 0), 285);
+ Add_Action (Table.States (1633), 114, (121, 1), 286);
+ Table.States (1633).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1633), 121, 287);
+ Add_Goto (Table.States (1633), 313, 289);
+ Add_Goto (Table.States (1633), 434, 1925);
+ Table.States (1633).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((335, 0), 195, 3, (32767, 0), 0),
+ ((335, 1), 195, 1, (32767, 0), 0)));
+ Table.States (1633).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (335, 1), 108, 1924)));
+ Table.States (1634).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1634), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (335, 7), 6);
+ Table.States (1634).Kernel := To_Vector ((0 => ((335, 7), 108,
0, (335, 7), 6)));
+ Table.States (1634).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (335, 7), 6)));
+ Table.States (1635).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1635), 108, (335, 6), 1926);
+ Table.States (1635).Kernel := To_Vector ((0 => ((335, 6), 434,
1, (32767, 0), 0)));
+ Table.States (1635).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (335, 6), 108, 1926)));
+ Table.States (1636).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1636), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (335, 3), 6);
+ Table.States (1636).Kernel := To_Vector ((0 => ((335, 3), 108,
0, (335, 3), 6)));
+ Table.States (1636).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (335, 3), 6)));
+ Table.States (1637).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1637), 108, (335, 2), 1927);
+ Table.States (1637).Kernel := To_Vector ((0 => ((335, 2), 434,
1, (32767, 0), 0)));
+ Table.States (1637).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (335, 2), 108, 1927)));
+ Table.States (1638).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1638), 69, (156, 0), 1928);
+ Table.States (1638).Kernel := To_Vector ((0 => ((156, 0), 87, 2,
(32767, 0), 0)));
+ Table.States (1638).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (156, 0), 69, 1928)));
+ Table.States (1639).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1639), 86, (252, 0), 33);
+ Add_Action (Table.States (1639), 90, (268, 0), 34);
+ Add_Action (Table.States (1639), 116, (196, 0), 146);
+ Add_Action (Table.States (1639), 117, (196, 1), 37);
+ Add_Action (Table.States (1639), 118, (195, 6), 38);
+ Table.States (1639).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (1639), 155, 1929);
+ Add_Goto (Table.States (1639), 157, 1930);
+ Add_Goto (Table.States (1639), 195, 1931);
+ Add_Goto (Table.States (1639), 196, 148);
+ Add_Goto (Table.States (1639), 197, 54);
+ Add_Goto (Table.States (1639), 198, 55);
+ Add_Goto (Table.States (1639), 199, 56);
+ Add_Goto (Table.States (1639), 201, 57);
+ Add_Goto (Table.States (1639), 251, 58);
+ Add_Goto (Table.States (1639), 252, 59);
+ Add_Goto (Table.States (1639), 255, 60);
+ Add_Goto (Table.States (1639), 268, 68);
+ Add_Goto (Table.States (1639), 311, 83);
+ Table.States (1639).Kernel := To_Vector ((((155, 1), 95, 3,
(32767, 0), 0), ((155, 2), 95, 3, (32767,
+ 0), 0)));
+ Table.States (1640).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1640), 69, (159, 0), 1932);
+ Table.States (1640).Kernel := To_Vector ((0 => ((159, 0), 87, 2,
(32767, 0), 0)));
+ Table.States (1640).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (159, 0), 69, 1932)));
+ Table.States (1641).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (1641), 46, (233, 2), 167);
+ Add_Action (Table.States (1641), 52, (187, 0), 356);
+ Add_Action (Table.States (1641), 65, (234, 1), 169);
+ Add_Action (Table.States (1641), 76, (256, 0), 170);
+ Add_Action (Table.States (1641), 85, (205, 4), 171);
+ Add_Action (Table.States (1641), 86, (213, 2), 172);
+ Add_Action (Table.States (1641), 90, (268, 0), 34);
+ Add_Action (Table.States (1641), 106, (237, 1), 173);
+ Add_Action (Table.States (1641), 107, (237, 0), 174);
+ Add_Action (Table.States (1641), 115, (234, 0), 175);
+ Add_Action (Table.States (1641), 116, (196, 0), 146);
+ Add_Action (Table.States (1641), 117, (196, 1), 37);
+ Add_Action (Table.States (1641), 118, (195, 6), 38);
+ Table.States (1641).Goto_List.Set_Capacity (34);
+ Add_Goto (Table.States (1641), 131, 693);
+ Add_Goto (Table.States (1641), 140, 694);
+ Add_Goto (Table.States (1641), 158, 1933);
+ Add_Goto (Table.States (1641), 160, 1934);
+ Add_Goto (Table.States (1641), 187, 365);
+ Add_Goto (Table.States (1641), 195, 366);
+ Add_Goto (Table.States (1641), 196, 148);
+ Add_Goto (Table.States (1641), 197, 54);
+ Add_Goto (Table.States (1641), 198, 55);
+ Add_Goto (Table.States (1641), 199, 56);
+ Add_Goto (Table.States (1641), 201, 57);
+ Add_Goto (Table.States (1641), 203, 369);
+ Add_Goto (Table.States (1641), 205, 177);
+ Add_Goto (Table.States (1641), 206, 178);
+ Add_Goto (Table.States (1641), 210, 179);
+ Add_Goto (Table.States (1641), 211, 180);
+ Add_Goto (Table.States (1641), 213, 181);
+ Add_Goto (Table.States (1641), 214, 182);
+ Add_Goto (Table.States (1641), 215, 183);
+ Add_Goto (Table.States (1641), 218, 184);
+ Add_Goto (Table.States (1641), 219, 185);
+ Add_Goto (Table.States (1641), 220, 186);
+ Add_Goto (Table.States (1641), 231, 696);
+ Add_Goto (Table.States (1641), 232, 190);
+ Add_Goto (Table.States (1641), 233, 191);
+ Add_Goto (Table.States (1641), 234, 192);
+ Add_Goto (Table.States (1641), 237, 193);
+ Add_Goto (Table.States (1641), 251, 58);
+ Add_Goto (Table.States (1641), 252, 59);
+ Add_Goto (Table.States (1641), 255, 60);
+ Add_Goto (Table.States (1641), 256, 194);
+ Add_Goto (Table.States (1641), 268, 68);
+ Add_Goto (Table.States (1641), 311, 83);
+ Add_Goto (Table.States (1641), 465, 196);
+ Table.States (1641).Kernel := To_Vector ((((158, 1), 95, 1,
(32767, 0), 0), ((158, 2), 95, 1, (32767,
+ 0), 0)));
+ Table.States (1642).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (1642), 46, (233, 2), 167);
+ Add_Action (Table.States (1642), 52, (233, 3), 168);
+ Add_Action (Table.States (1642), 65, (234, 1), 169);
+ Add_Action (Table.States (1642), 76, (256, 0), 170);
+ Add_Action (Table.States (1642), 85, (205, 4), 171);
+ Add_Action (Table.States (1642), 86, (213, 2), 172);
+ Add_Action (Table.States (1642), 90, (268, 0), 34);
+ Add_Action (Table.States (1642), 92, (157, 0), 1935);
+ Add_Action (Table.States (1642), 106, (237, 1), 173);
+ Add_Action (Table.States (1642), 107, (237, 0), 174);
+ Add_Action (Table.States (1642), 115, (234, 0), 175);
+ Add_Action (Table.States (1642), 116, (196, 0), 146);
+ Add_Action (Table.States (1642), 117, (196, 1), 37);
+ Add_Action (Table.States (1642), 118, (195, 6), 38);
+ Table.States (1642).Goto_List.Set_Capacity (30);
+ Add_Goto (Table.States (1642), 140, 981);
+ Add_Goto (Table.States (1642), 195, 673);
+ Add_Goto (Table.States (1642), 196, 148);
+ Add_Goto (Table.States (1642), 197, 54);
+ Add_Goto (Table.States (1642), 198, 55);
+ Add_Goto (Table.States (1642), 199, 56);
+ Add_Goto (Table.States (1642), 201, 57);
+ Add_Goto (Table.States (1642), 203, 369);
+ Add_Goto (Table.States (1642), 205, 177);
+ Add_Goto (Table.States (1642), 206, 178);
+ Add_Goto (Table.States (1642), 210, 179);
+ Add_Goto (Table.States (1642), 211, 180);
+ Add_Goto (Table.States (1642), 213, 181);
+ Add_Goto (Table.States (1642), 214, 182);
+ Add_Goto (Table.States (1642), 215, 183);
+ Add_Goto (Table.States (1642), 218, 184);
+ Add_Goto (Table.States (1642), 219, 185);
+ Add_Goto (Table.States (1642), 220, 186);
+ Add_Goto (Table.States (1642), 231, 696);
+ Add_Goto (Table.States (1642), 232, 190);
+ Add_Goto (Table.States (1642), 233, 191);
+ Add_Goto (Table.States (1642), 234, 192);
+ Add_Goto (Table.States (1642), 237, 193);
+ Add_Goto (Table.States (1642), 251, 58);
+ Add_Goto (Table.States (1642), 252, 59);
+ Add_Goto (Table.States (1642), 255, 60);
+ Add_Goto (Table.States (1642), 256, 194);
+ Add_Goto (Table.States (1642), 268, 68);
+ Add_Goto (Table.States (1642), 311, 83);
+ Add_Goto (Table.States (1642), 465, 196);
+ Table.States (1642).Kernel := To_Vector ((((139, 0), 74, 3,
(32767, 0), 0), ((157, 0), 74, 1, (32767,
+ 0), 0)));
+ Table.States (1642).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1643).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1643), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 9), 6);
+ Table.States (1643).Kernel := To_Vector ((0 => ((135, 9), 108,
0, (135, 9), 6)));
+ Table.States (1643).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 9), 6)));
+ Table.States (1644).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1644), 108, (135, 8), 1936);
+ Table.States (1644).Kernel := To_Vector ((0 => ((135, 8), 434,
1, (32767, 0), 0)));
+ Table.States (1644).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 8), 108, 1936)));
+ Table.States (1645).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1645), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 10), 6);
+ Table.States (1645).Kernel := To_Vector ((0 => ((135, 10), 108,
0, (135, 10), 6)));
+ Table.States (1645).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 10), 6)));
+ Table.States (1646).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1646), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 41), 6);
+ Table.States (1646).Kernel := To_Vector ((0 => ((135, 41), 108,
0, (135, 41), 6)));
+ Table.States (1646).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 41), 6)));
+ Table.States (1647).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1647), 108, (135, 40), 1937);
+ Table.States (1647).Kernel := To_Vector ((0 => ((135, 40), 434,
1, (32767, 0), 0)));
+ Table.States (1647).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 40), 108, 1937)));
+ Table.States (1648).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1648), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 42), 6);
+ Table.States (1648).Kernel := To_Vector ((0 => ((135, 42), 108,
0, (135, 42), 6)));
+ Table.States (1648).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 42), 6)));
+ Table.States (1649).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1649), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 25), 6);
+ Table.States (1649).Kernel := To_Vector ((0 => ((135, 25), 108,
0, (135, 25), 6)));
+ Table.States (1649).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 25), 6)));
+ Table.States (1650).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1650), 108, (135, 24), 1938);
+ Table.States (1650).Kernel := To_Vector ((0 => ((135, 24), 434,
1, (32767, 0), 0)));
+ Table.States (1650).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 24), 108, 1938)));
+ Table.States (1651).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1651), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 26), 6);
+ Table.States (1651).Kernel := To_Vector ((0 => ((135, 26), 108,
0, (135, 26), 6)));
+ Table.States (1651).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 26), 6)));
+ Table.States (1652).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1652), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 3), 6);
+ Table.States (1652).Kernel := To_Vector ((0 => ((135, 3), 108,
0, (135, 3), 6)));
+ Table.States (1652).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 3), 6)));
+ Table.States (1653).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1653), 61, (434, 0), 299);
+ Add_Action (Table.States (1653), 108, (135, 1), 1939);
+ Table.States (1653).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1653), 434, 1940);
+ Table.States (1653).Kernel := To_Vector ((((135, 0), 134, 3,
(32767, 0), 0), ((135, 1), 134, 1,
+ (32767, 0), 0)));
+ Table.States (1653).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 1), 108, 1939)));
+ Table.States (1654).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1654), 108, (135, 2), 1941);
+ Table.States (1654).Kernel := To_Vector ((0 => ((135, 2), 434,
1, (32767, 0), 0)));
+ Table.States (1654).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 2), 108, 1941)));
+ Table.States (1655).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1655), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 35), 6);
+ Table.States (1655).Kernel := To_Vector ((0 => ((135, 35), 108,
0, (135, 35), 6)));
+ Table.States (1655).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 35), 6)));
+ Table.States (1656).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1656), 61, (434, 0), 299);
+ Add_Action (Table.States (1656), 108, (135, 33), 1942);
+ Table.States (1656).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1656), 434, 1943);
+ Table.States (1656).Kernel := To_Vector ((((135, 32), 134, 3,
(32767, 0), 0), ((135, 33), 134, 1,
+ (32767, 0), 0)));
+ Table.States (1656).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 33), 108, 1942)));
+ Table.States (1657).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1657), 108, (135, 34), 1944);
+ Table.States (1657).Kernel := To_Vector ((0 => ((135, 34), 434,
1, (32767, 0), 0)));
+ Table.States (1657).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 34), 108, 1944)));
+ Table.States (1658).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1658), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 19), 6);
+ Table.States (1658).Kernel := To_Vector ((0 => ((135, 19), 108,
0, (135, 19), 6)));
+ Table.States (1658).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 19), 6)));
+ Table.States (1659).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1659), 61, (434, 0), 299);
+ Add_Action (Table.States (1659), 108, (135, 17), 1945);
+ Table.States (1659).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1659), 434, 1946);
+ Table.States (1659).Kernel := To_Vector ((((135, 16), 134, 3,
(32767, 0), 0), ((135, 17), 134, 1,
+ (32767, 0), 0)));
+ Table.States (1659).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 17), 108, 1945)));
+ Table.States (1660).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1660), 108, (135, 18), 1947);
+ Table.States (1660).Kernel := To_Vector ((0 => ((135, 18), 434,
1, (32767, 0), 0)));
+ Table.States (1660).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 18), 108, 1947)));
+ Table.States (1661).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1661), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 5), 6);
+ Table.States (1661).Kernel := To_Vector ((0 => ((135, 5), 108,
0, (135, 5), 6)));
+ Table.States (1661).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 5), 6)));
+ Table.States (1662).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1662), 108, (135, 4), 1948);
+ Table.States (1662).Kernel := To_Vector ((0 => ((135, 4), 434,
1, (32767, 0), 0)));
+ Table.States (1662).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 4), 108, 1948)));
+ Table.States (1663).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1663), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 6), 6);
+ Table.States (1663).Kernel := To_Vector ((0 => ((135, 6), 108,
0, (135, 6), 6)));
+ Table.States (1663).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 6), 6)));
+ Table.States (1664).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1664), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 37), 6);
+ Table.States (1664).Kernel := To_Vector ((0 => ((135, 37), 108,
0, (135, 37), 6)));
+ Table.States (1664).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 37), 6)));
+ Table.States (1665).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1665), 108, (135, 36), 1949);
+ Table.States (1665).Kernel := To_Vector ((0 => ((135, 36), 434,
1, (32767, 0), 0)));
+ Table.States (1665).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 36), 108, 1949)));
+ Table.States (1666).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1666), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 38), 6);
+ Table.States (1666).Kernel := To_Vector ((0 => ((135, 38), 108,
0, (135, 38), 6)));
+ Table.States (1666).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 38), 6)));
+ Table.States (1667).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1667), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 21), 6);
+ Table.States (1667).Kernel := To_Vector ((0 => ((135, 21), 108,
0, (135, 21), 6)));
+ Table.States (1667).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 21), 6)));
+ Table.States (1668).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1668), 108, (135, 20), 1950);
+ Table.States (1668).Kernel := To_Vector ((0 => ((135, 20), 434,
1, (32767, 0), 0)));
+ Table.States (1668).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 20), 108, 1950)));
+ end Subr_59;
+ procedure Subr_60
+ is begin
+ Table.States (1669).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1669), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 22), 6);
+ Table.States (1669).Kernel := To_Vector ((0 => ((135, 22), 108,
0, (135, 22), 6)));
+ Table.States (1669).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 22), 6)));
+ Table.States (1670).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1670), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 12), 6);
+ Table.States (1670).Kernel := To_Vector ((0 => ((135, 12), 108,
0, (135, 12), 6)));
+ Table.States (1670).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 12), 6)));
+ Table.States (1671).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1671), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 44), 6);
+ Table.States (1671).Kernel := To_Vector ((0 => ((135, 44), 108,
0, (135, 44), 6)));
+ Table.States (1671).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 44), 6)));
+ Table.States (1672).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1672), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 28), 6);
+ Table.States (1672).Kernel := To_Vector ((0 => ((135, 28), 108,
0, (135, 28), 6)));
+ Table.States (1672).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 28), 6)));
+ Table.States (1673).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (1673), 12, (402, 0), 165);
+ Add_Action (Table.States (1673), 46, (233, 2), 167);
+ Add_Action (Table.States (1673), 52, (233, 3), 168);
+ Add_Action (Table.States (1673), 65, (234, 1), 169);
+ Add_Action (Table.States (1673), 76, (256, 0), 170);
+ Add_Action (Table.States (1673), 85, (205, 4), 171);
+ Add_Action (Table.States (1673), 86, (213, 2), 172);
+ Add_Action (Table.States (1673), 90, (268, 0), 34);
+ Add_Action (Table.States (1673), 106, (237, 1), 173);
+ Add_Action (Table.States (1673), 107, (237, 0), 174);
+ Add_Action (Table.States (1673), 115, (234, 0), 175);
+ Add_Action (Table.States (1673), 116, (196, 0), 146);
+ Add_Action (Table.States (1673), 117, (196, 1), 37);
+ Add_Action (Table.States (1673), 118, (195, 6), 38);
+ Table.States (1673).Goto_List.Set_Capacity (31);
+ Add_Goto (Table.States (1673), 195, 176);
+ Add_Goto (Table.States (1673), 196, 148);
+ Add_Goto (Table.States (1673), 197, 54);
+ Add_Goto (Table.States (1673), 198, 55);
+ Add_Goto (Table.States (1673), 199, 56);
+ Add_Goto (Table.States (1673), 201, 57);
+ Add_Goto (Table.States (1673), 205, 177);
+ Add_Goto (Table.States (1673), 206, 178);
+ Add_Goto (Table.States (1673), 210, 179);
+ Add_Goto (Table.States (1673), 211, 180);
+ Add_Goto (Table.States (1673), 213, 181);
+ Add_Goto (Table.States (1673), 214, 182);
+ Add_Goto (Table.States (1673), 215, 183);
+ Add_Goto (Table.States (1673), 218, 184);
+ Add_Goto (Table.States (1673), 219, 185);
+ Add_Goto (Table.States (1673), 220, 186);
+ Add_Goto (Table.States (1673), 227, 1951);
+ Add_Goto (Table.States (1673), 228, 188);
+ Add_Goto (Table.States (1673), 231, 189);
+ Add_Goto (Table.States (1673), 232, 190);
+ Add_Goto (Table.States (1673), 233, 191);
+ Add_Goto (Table.States (1673), 234, 192);
+ Add_Goto (Table.States (1673), 237, 193);
+ Add_Goto (Table.States (1673), 251, 58);
+ Add_Goto (Table.States (1673), 252, 59);
+ Add_Goto (Table.States (1673), 255, 60);
+ Add_Goto (Table.States (1673), 256, 194);
+ Add_Goto (Table.States (1673), 268, 68);
+ Add_Goto (Table.States (1673), 311, 83);
+ Add_Goto (Table.States (1673), 402, 195);
+ Add_Goto (Table.States (1673), 465, 196);
+ Table.States (1673).Kernel := To_Vector ((0 => ((254, 0), 95, 1,
(32767, 0), 0)));
+ Table.States (1673).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (1674).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (1674), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (253, 0), 4);
+ Table.States (1674).Kernel := To_Vector ((0 => ((253, 0), 87, 0,
(253, 0), 4)));
+ Table.States (1674).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (253, 0), 4)));
+ Table.States (1675).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1675), 108, (275, 1), 1952);
+ Table.States (1675).Kernel := To_Vector ((0 => ((275, 1), 284,
1, (32767, 0), 0)));
+ Table.States (1675).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (275, 1), 108, 1952)));
+ Table.States (1676).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (1676), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (286, 1), 6);
+ Table.States (1676).Kernel := To_Vector ((0 => ((286, 1), 108,
0, (286, 1), 6)));
+ Table.States (1676).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (286, 1), 6)));
+ Table.States (1677).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1677), 108, Reduce, (284, 1), 0);
+ Add_Action (Table.States (1677), 116, (284, 0), 1312);
+ Table.States (1677).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1677), 284, 1953);
+ Table.States (1677).Kernel := To_Vector ((0 => ((286, 0), 66, 1,
(32767, 0), 0)));
+ Table.States (1677).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (284, 1), 0)));
+ Table.States (1678).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1678), 108, Reduce, (284, 1), 0);
+ Add_Action (Table.States (1678), 116, (284, 0), 1312);
+ Table.States (1678).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1678), 284, 1954);
+ Table.States (1678).Kernel := To_Vector ((0 => ((275, 0), 36, 1,
(32767, 0), 0)));
+ Table.States (1678).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (284, 1), 0)));
+ Table.States (1679).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1679), (55, 58, 86, 90, 116, 117, 118),
(447, 0), 2);
+ Table.States (1679).Kernel := To_Vector ((0 => ((447, 0), 305,
0, (447, 0), 2)));
+ Table.States (1679).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (447, 0), 2)));
+ Table.States (1680).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1680), 85, (198, 0), 1955);
+ Add_Action (Table.States (1680), 96, (197, 0), 283);
+ Add_Action (Table.States (1680), 113, (121, 0), 285);
+ Add_Action (Table.States (1680), 114, (121, 1), 286);
+ Table.States (1680).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1680), 121, 287);
+ Add_Goto (Table.States (1680), 313, 289);
+ Table.States (1680).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((452, 0), 195, 3, (32767, 0), 0)));
+ Table.States (1681).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1681), (63, 82, 95, 108), (445, 1), 2);
+ Table.States (1681).Kernel := To_Vector ((0 => ((445, 1), 452,
0, (445, 1), 2)));
+ Table.States (1681).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (445, 1), 2)));
+ Table.States (1682).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1682), (55, 58, 86, 90, 116, 117, 118),
(305, 1), 2);
+ Table.States (1682).Kernel := To_Vector ((0 => ((305, 1), 29, 0,
(305, 1), 2)));
+ Table.States (1682).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (305, 1), 2)));
+ Table.States (1683).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1683), (63, 82, 87, 95, 108), (450, 1),
1);
+ Table.States (1683).Kernel := To_Vector ((0 => ((450, 1), 55, 0,
(450, 1), 1)));
+ Table.States (1683).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (450, 1), 1)));
+ Table.States (1684).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1684), (63, 82, 87, 95, 108), (450, 0),
1);
+ Table.States (1684).Kernel := To_Vector ((0 => ((450, 0), 65, 0,
(450, 0), 1)));
+ Table.States (1684).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (450, 0), 1)));
+ Table.States (1685).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1685), 63, Reduce, (448, 1), 1);
+ Add_Action (Table.States (1685), 82, Reduce, (448, 1), 1);
+ Add_Action (Table.States (1685), 85, (198, 0), 281);
+ Add_Action (Table.States (1685), 95, Reduce, (448, 1), 1);
+ Add_Action (Table.States (1685), 96, (197, 0), 283);
+ Add_Action (Table.States (1685), 108, Reduce, (448, 1), 1);
+ Add_Action (Table.States (1685), 113, (121, 0), 285);
+ Add_Action (Table.States (1685), 114, (121, 1), 286);
+ Table.States (1685).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1685), 121, 287);
+ Add_Goto (Table.States (1685), 313, 289);
+ Table.States (1685).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((448, 1), 195, 0, (448, 1), 1)));
+ Table.States (1685).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (448, 1), 1)));
+ Table.States (1686).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1686), (63, 82, 95, 108), (445, 0), 2);
+ Table.States (1686).Kernel := To_Vector ((0 => ((445, 0), 448,
0, (445, 0), 2)));
+ Table.States (1686).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (445, 0), 2)));
+ Table.States (1687).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1687), (63, 82, 95, 108), (448, 0), 1);
+ Table.States (1687).Kernel := To_Vector ((0 => ((448, 0), 450,
0, (448, 0), 1)));
+ Table.States (1687).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (448, 0), 1)));
+ Table.States (1688).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1688), 86, (252, 0), 33);
+ Add_Action (Table.States (1688), 90, (268, 0), 34);
+ Add_Action (Table.States (1688), 116, (196, 0), 146);
+ Add_Action (Table.States (1688), 117, (196, 1), 37);
+ Add_Action (Table.States (1688), 118, (195, 6), 38);
+ Table.States (1688).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (1688), 195, 1680);
+ Add_Goto (Table.States (1688), 196, 148);
+ Add_Goto (Table.States (1688), 197, 54);
+ Add_Goto (Table.States (1688), 198, 55);
+ Add_Goto (Table.States (1688), 199, 56);
+ Add_Goto (Table.States (1688), 201, 57);
+ Add_Goto (Table.States (1688), 251, 58);
+ Add_Goto (Table.States (1688), 252, 59);
+ Add_Goto (Table.States (1688), 255, 60);
+ Add_Goto (Table.States (1688), 268, 68);
+ Add_Goto (Table.States (1688), 311, 83);
+ Add_Goto (Table.States (1688), 451, 1956);
+ Add_Goto (Table.States (1688), 452, 1957);
+ Table.States (1688).Kernel := To_Vector ((0 => ((446, 1), 33, 4,
(32767, 0), 0)));
+ Table.States (1688).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1689).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1689), 55, (450, 1), 1683);
+ Add_Action (Table.States (1689), 65, (450, 0), 1684);
+ Add_Action (Table.States (1689), 86, (252, 0), 33);
+ Add_Action (Table.States (1689), 90, (268, 0), 34);
+ Add_Action (Table.States (1689), 116, (196, 0), 146);
+ Add_Action (Table.States (1689), 117, (196, 1), 37);
+ Add_Action (Table.States (1689), 118, (195, 6), 38);
+ Table.States (1689).Goto_List.Set_Capacity (14);
+ Add_Goto (Table.States (1689), 195, 197);
+ Add_Goto (Table.States (1689), 196, 148);
+ Add_Goto (Table.States (1689), 197, 54);
+ Add_Goto (Table.States (1689), 198, 55);
+ Add_Goto (Table.States (1689), 199, 56);
+ Add_Goto (Table.States (1689), 201, 57);
+ Add_Goto (Table.States (1689), 251, 58);
+ Add_Goto (Table.States (1689), 252, 59);
+ Add_Goto (Table.States (1689), 255, 60);
+ Add_Goto (Table.States (1689), 268, 68);
+ Add_Goto (Table.States (1689), 306, 1958);
+ Add_Goto (Table.States (1689), 311, 83);
+ Add_Goto (Table.States (1689), 449, 1959);
+ Add_Goto (Table.States (1689), 450, 1960);
+ Table.States (1689).Kernel := To_Vector ((0 => ((446, 0), 50, 1,
(32767, 0), 0)));
+ Table.States (1689).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (450, 0), 65, 1684)));
+ Table.States (1690).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1690), (87, 95), (463, 0), 1);
+ Table.States (1690).Kernel := To_Vector ((0 => ((463, 0), 303,
0, (463, 0), 1)));
+ Table.States (1690).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (463, 0), 1)));
+ Table.States (1691).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1691), 86, (252, 0), 33);
+ Add_Action (Table.States (1691), 90, (268, 0), 34);
+ Add_Action (Table.States (1691), 116, (196, 0), 146);
+ Add_Action (Table.States (1691), 117, (196, 1), 37);
+ Add_Action (Table.States (1691), 118, (195, 6), 38);
+ Table.States (1691).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1691), 195, 197);
+ Add_Goto (Table.States (1691), 196, 148);
+ Add_Goto (Table.States (1691), 197, 54);
+ Add_Goto (Table.States (1691), 198, 55);
+ Add_Goto (Table.States (1691), 199, 56);
+ Add_Goto (Table.States (1691), 201, 57);
+ Add_Goto (Table.States (1691), 251, 58);
+ Add_Goto (Table.States (1691), 252, 59);
+ Add_Goto (Table.States (1691), 255, 60);
+ Add_Goto (Table.States (1691), 268, 68);
+ Add_Goto (Table.States (1691), 306, 1961);
+ Add_Goto (Table.States (1691), 311, 83);
+ Table.States (1691).Kernel := To_Vector ((0 => ((303, 0), 304,
1, (32767, 0), 0)));
+ Table.States (1691).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1692).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1692), (87, 95), (303, 1), 1);
+ Table.States (1692).Kernel := To_Vector ((0 => ((303, 1), 446,
0, (303, 1), 1)));
+ Table.States (1692).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (303, 1), 1)));
+ Table.States (1693).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1693), 87, (302, 1), 1962);
+ Add_Action (Table.States (1693), 95, (463, 1), 1963);
+ Table.States (1693).Kernel := To_Vector ((((302, 1), 463, 1,
(32767, 0), 0), ((463, 1), 463, 3,
+ (32767, 0), 0), ((463, 2), 463, 3, (32767, 0), 0)));
+ Table.States (1693).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (302, 1), 87, 1962)));
+ Table.States (1694).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1694), (63, 82, 95, 108), (307, 0), 1);
+ Table.States (1694).Kernel := To_Vector ((0 => ((307, 0), 55, 0,
(307, 0), 1)));
+ Table.States (1694).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (307, 0), 1)));
+ Table.States (1695).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1695), (63, 82, 95, 108), (307, 1), 1);
+ Table.States (1695).Kernel := To_Vector ((0 => ((307, 1), 58, 0,
(307, 1), 1)));
+ Table.States (1695).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (307, 1), 1)));
+ Table.States (1696).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1696), 63, Reduce, (307, 2), 1);
+ Add_Action (Table.States (1696), 82, Reduce, (307, 2), 1);
+ Add_Action (Table.States (1696), 85, (198, 0), 281);
+ Add_Action (Table.States (1696), 95, Reduce, (307, 2), 1);
+ Add_Action (Table.States (1696), 96, (197, 0), 283);
+ Add_Action (Table.States (1696), 108, Reduce, (307, 2), 1);
+ Add_Action (Table.States (1696), 113, (121, 0), 285);
+ Add_Action (Table.States (1696), 114, (121, 1), 286);
+ Table.States (1696).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1696), 121, 287);
+ Add_Goto (Table.States (1696), 313, 289);
+ Table.States (1696).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((307, 2), 195, 0, (307, 2), 1),
((311, 0), 195, 3, (32767, 0), 0)));
+ Table.States (1696).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (307, 2), 1)));
+ Table.States (1697).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1697), (63, 82, 95, 108), (302, 0), 2);
+ Table.States (1697).Kernel := To_Vector ((0 => ((302, 0), 307,
0, (302, 0), 2)));
+ Table.States (1697).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (302, 0), 2)));
+ Table.States (1698).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1698), 86, (252, 0), 33);
+ Add_Action (Table.States (1698), 90, (268, 0), 34);
+ Add_Action (Table.States (1698), 108, Reduce, (308, 1), 0);
+ Add_Action (Table.States (1698), 116, (196, 0), 146);
+ Add_Action (Table.States (1698), 117, (196, 1), 37);
+ Add_Action (Table.States (1698), 118, (195, 6), 38);
+ Table.States (1698).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1698), 195, 1063);
+ Add_Goto (Table.States (1698), 196, 148);
+ Add_Goto (Table.States (1698), 197, 54);
+ Add_Goto (Table.States (1698), 198, 55);
+ Add_Goto (Table.States (1698), 199, 56);
+ Add_Goto (Table.States (1698), 201, 57);
+ Add_Goto (Table.States (1698), 251, 58);
+ Add_Goto (Table.States (1698), 252, 59);
+ Add_Goto (Table.States (1698), 255, 60);
+ Add_Goto (Table.States (1698), 268, 68);
+ Add_Goto (Table.States (1698), 308, 1964);
+ Add_Goto (Table.States (1698), 311, 83);
+ Table.States (1698).Kernel := To_Vector ((0 => ((309, 3), 66, 1,
(32767, 0), 0)));
+ Table.States (1698).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (308, 1), 0)));
+ Table.States (1699).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1699), 66, (309, 2), 1965);
+ Table.States (1699).Kernel := To_Vector ((0 => ((309, 2), 396,
2, (32767, 0), 0)));
+ Table.States (1699).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (309, 2), 66, 1965)));
+ Table.States (1700).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1700), 61, Reduce, (295, 1), 0);
+ Add_Action (Table.States (1700), 85, (299, 0), 1257);
+ Add_Action (Table.States (1700), 108, Reduce, (295, 1), 0);
+ Table.States (1700).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1700), 295, 1966);
+ Add_Goto (Table.States (1700), 299, 426);
+ Table.States (1700).Kernel := To_Vector ((((356, 0), 87, 3,
(32767, 0), 0), ((356, 1), 87, 1, (32767,
+ 0), 0)));
+ Table.States (1700).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (295, 1), 0)));
+ Table.States (1701).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1701), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (356, 2), 6);
+ Table.States (1701).Kernel := To_Vector ((0 => ((356, 2), 108,
0, (356, 2), 6)));
+ Table.States (1701).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (356, 2), 6)));
+ Table.States (1702).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1702), 61, (434, 0), 299);
+ Add_Action (Table.States (1702), 85, (198, 0), 281);
+ Add_Action (Table.States (1702), 96, (197, 0), 283);
+ Add_Action (Table.States (1702), 108, (408, 7), 1967);
+ Add_Action (Table.States (1702), 113, (121, 0), 285);
+ Add_Action (Table.States (1702), 114, (121, 1), 286);
+ Table.States (1702).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1702), 121, 287);
+ Add_Goto (Table.States (1702), 313, 289);
+ Add_Goto (Table.States (1702), 434, 1968);
+ Table.States (1702).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((408, 6), 195, 3, (32767, 0), 0),
+ ((408, 7), 195, 1, (32767, 0), 0)));
+ Table.States (1702).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (408, 7), 108, 1967)));
+ Table.States (1703).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1703), 61, (434, 0), 299);
+ Add_Action (Table.States (1703), 85, (198, 0), 281);
+ Add_Action (Table.States (1703), 96, (197, 0), 283);
+ Add_Action (Table.States (1703), 108, (408, 3), 1969);
+ Add_Action (Table.States (1703), 113, (121, 0), 285);
+ Add_Action (Table.States (1703), 114, (121, 1), 286);
+ Table.States (1703).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1703), 121, 287);
+ Add_Goto (Table.States (1703), 313, 289);
+ Add_Goto (Table.States (1703), 434, 1970);
+ Table.States (1703).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((408, 2), 195, 3, (32767, 0), 0),
+ ((408, 3), 195, 1, (32767, 0), 0)));
+ Table.States (1703).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (408, 3), 108, 1969)));
+ Table.States (1704).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1704), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (338, 0), 6);
+ Table.States (1704).Kernel := To_Vector ((0 => ((338, 0), 108,
0, (338, 0), 6)));
+ Table.States (1704).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (338, 0), 6)));
+ Table.States (1705).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1705), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (389, 0), 6);
+ Table.States (1705).Kernel := To_Vector ((0 => ((389, 0), 108,
0, (389, 0), 6)));
+ Table.States (1705).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (389, 0), 6)));
+ Table.States (1706).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1706), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (180, 0), 6);
+ Table.States (1706).Kernel := To_Vector ((0 => ((180, 0), 108,
0, (180, 0), 6)));
+ Table.States (1706).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (180, 0), 6)));
+ Table.States (1707).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1707), 66, (309, 1), 1971);
+ Table.States (1707).Kernel := To_Vector ((0 => ((309, 1), 396,
2, (32767, 0), 0)));
+ Table.States (1707).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (309, 1), 66, 1971)));
+ Table.States (1708).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (1708), 12, (401, 0), 1);
+ Add_Action (Table.States (1708), 15, (370, 0), 3);
+ Add_Action (Table.States (1708), 17, (365, 0), 4);
+ Add_Action (Table.States (1708), 18, (382, 0), 5);
+ Add_Action (Table.States (1708), 19, (363, 0), 6);
+ Add_Action (Table.States (1708), 20, (357, 0), 7);
+ Add_Action (Table.States (1708), 30, (316, 0), 13);
+ Add_Action (Table.States (1708), 31, (290, 0), 14);
+ Add_Action (Table.States (1708), 32, (289, 0), 15);
+ Add_Action (Table.States (1708), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1708), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1708), 37, (288, 0), 17);
+ Add_Conflict (Table.States (1708), 37, (285, 1), 0);
+ Add_Action (Table.States (1708), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1708), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1708), 42, (271, 0), 18);
+ Add_Action (Table.States (1708), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1708), 64, (273, 0), 27);
+ Add_Action (Table.States (1708), 65, (264, 0), 28);
+ Add_Action (Table.States (1708), 84, (124, 0), 32);
+ Add_Action (Table.States (1708), 86, (252, 0), 33);
+ Add_Action (Table.States (1708), 90, (268, 0), 34);
+ Add_Action (Table.States (1708), 105, (265, 0), 35);
+ Add_Action (Table.States (1708), 116, (196, 0), 146);
+ Add_Action (Table.States (1708), 117, (196, 1), 37);
+ Add_Action (Table.States (1708), 118, (195, 6), 38);
+ Table.States (1708).Goto_List.Set_Capacity (46);
+ Add_Goto (Table.States (1708), 124, 39);
+ Add_Goto (Table.States (1708), 195, 52);
+ Add_Goto (Table.States (1708), 196, 53);
+ Add_Goto (Table.States (1708), 197, 54);
+ Add_Goto (Table.States (1708), 198, 55);
+ Add_Goto (Table.States (1708), 199, 56);
+ Add_Goto (Table.States (1708), 201, 57);
+ Add_Goto (Table.States (1708), 251, 58);
+ Add_Goto (Table.States (1708), 252, 59);
+ Add_Goto (Table.States (1708), 255, 60);
+ Add_Goto (Table.States (1708), 259, 452);
+ Add_Goto (Table.States (1708), 261, 331);
+ Add_Goto (Table.States (1708), 262, 62);
+ Add_Goto (Table.States (1708), 263, 63);
+ Add_Goto (Table.States (1708), 264, 64);
+ Add_Goto (Table.States (1708), 265, 65);
+ Add_Goto (Table.States (1708), 266, 66);
+ Add_Goto (Table.States (1708), 267, 67);
+ Add_Goto (Table.States (1708), 268, 68);
+ Add_Goto (Table.States (1708), 271, 69);
+ Add_Goto (Table.States (1708), 273, 70);
+ Add_Goto (Table.States (1708), 275, 71);
+ Add_Goto (Table.States (1708), 285, 72);
+ Add_Goto (Table.States (1708), 286, 73);
+ Add_Goto (Table.States (1708), 288, 74);
+ Add_Goto (Table.States (1708), 289, 75);
+ Add_Goto (Table.States (1708), 290, 76);
+ Add_Goto (Table.States (1708), 310, 82);
+ Add_Goto (Table.States (1708), 311, 83);
+ Add_Goto (Table.States (1708), 316, 84);
+ Add_Goto (Table.States (1708), 318, 85);
+ Add_Goto (Table.States (1708), 357, 110);
+ Add_Goto (Table.States (1708), 363, 111);
+ Add_Goto (Table.States (1708), 364, 112);
+ Add_Goto (Table.States (1708), 365, 113);
+ Add_Goto (Table.States (1708), 366, 114);
+ Add_Goto (Table.States (1708), 367, 115);
+ Add_Goto (Table.States (1708), 370, 116);
+ Add_Goto (Table.States (1708), 376, 117);
+ Add_Goto (Table.States (1708), 378, 118);
+ Add_Goto (Table.States (1708), 379, 119);
+ Add_Goto (Table.States (1708), 382, 120);
+ Add_Goto (Table.States (1708), 396, 1972);
+ Add_Goto (Table.States (1708), 401, 133);
+ Add_Goto (Table.States (1708), 461, 332);
+ Add_Goto (Table.States (1708), 462, 144);
+ Table.States (1708).Kernel := To_Vector ((0 => ((309, 0), 38, 4,
(32767, 0), 0)));
+ Table.States (1708).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ end Subr_60;
+ procedure Subr_61
+ is begin
+ Table.States (1709).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1709), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (320, 0), 6);
+ Table.States (1709).Kernel := To_Vector ((0 => ((320, 0), 108,
0, (320, 0), 6)));
+ Table.States (1709).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (320, 0), 6)));
+ Table.States (1710).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1710), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (321, 0), 6);
+ Table.States (1710).Kernel := To_Vector ((0 => ((321, 0), 108,
0, (321, 0), 6)));
+ Table.States (1710).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (321, 0), 6)));
+ Table.States (1711).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1711), 61, (434, 0), 299);
+ Add_Action (Table.States (1711), 82, (354, 2), 1973);
+ Table.States (1711).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1711), 434, 776);
+ Table.States (1711).Kernel := To_Vector ((((354, 0), 116, 8,
(32767, 0), 0), ((354, 1), 116, 5,
+ (32767, 0), 0), ((354, 2), 116, 6, (32767, 0), 0), ((354, 3),
116, 3, (32767, 0), 0)));
+ Table.States (1711).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (354, 2), 82, 1973)));
+ Table.States (1712).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1712), 61, (434, 0), 299);
+ Add_Action (Table.States (1712), 82, (345, 1), 1974);
+ Table.States (1712).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1712), 434, 795);
+ Table.States (1712).Kernel := To_Vector ((((345, 0), 116, 8,
(32767, 0), 0), ((345, 1), 116, 6,
+ (32767, 0), 0)));
+ Table.States (1712).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (345, 1), 82, 1974)));
+ Table.States (1713).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (1713), 22, (339, 0), 9);
+ Add_Action (Table.States (1713), 25, (329, 1), 10);
+ Add_Action (Table.States (1713), 28, (325, 0), 12);
+ Add_Action (Table.States (1713), 38, Reduce, (192, 1), 0);
+ Add_Action (Table.States (1713), 50, (332, 0), 19);
+ Add_Action (Table.States (1713), 51, (437, 0), 221);
+ Add_Action (Table.States (1713), 52, (329, 0), 21);
+ Add_Action (Table.States (1713), 53, (294, 0), 22);
+ Add_Action (Table.States (1713), 54, (293, 0), 23);
+ Add_Action (Table.States (1713), 59, (346, 0), 24);
+ Add_Action (Table.States (1713), 60, (340, 0), 25);
+ Add_Action (Table.States (1713), 81, (130, 0), 30);
+ Add_Action (Table.States (1713), 83, (128, 0), 31);
+ Add_Action (Table.States (1713), 84, (124, 0), 32);
+ Add_Action (Table.States (1713), 116, (136, 0), 223);
+ Table.States (1713).Goto_List.Set_Capacity (60);
+ Add_Goto (Table.States (1713), 124, 561);
+ Add_Goto (Table.States (1713), 126, 40);
+ Add_Goto (Table.States (1713), 127, 41);
+ Add_Goto (Table.States (1713), 128, 42);
+ Add_Goto (Table.States (1713), 130, 43);
+ Add_Goto (Table.States (1713), 135, 44);
+ Add_Goto (Table.States (1713), 136, 45);
+ Add_Goto (Table.States (1713), 137, 46);
+ Add_Goto (Table.States (1713), 180, 47);
+ Add_Goto (Table.States (1713), 189, 48);
+ Add_Goto (Table.States (1713), 190, 562);
+ Add_Goto (Table.States (1713), 191, 563);
+ Add_Goto (Table.States (1713), 192, 940);
+ Add_Goto (Table.States (1713), 193, 50);
+ Add_Goto (Table.States (1713), 194, 51);
+ Add_Goto (Table.States (1713), 291, 77);
+ Add_Goto (Table.States (1713), 292, 78);
+ Add_Goto (Table.States (1713), 293, 79);
+ Add_Goto (Table.States (1713), 294, 80);
+ Add_Goto (Table.States (1713), 309, 81);
+ Add_Goto (Table.States (1713), 320, 86);
+ Add_Goto (Table.States (1713), 321, 87);
+ Add_Goto (Table.States (1713), 322, 88);
+ Add_Goto (Table.States (1713), 325, 89);
+ Add_Goto (Table.States (1713), 326, 90);
+ Add_Goto (Table.States (1713), 327, 91);
+ Add_Goto (Table.States (1713), 328, 92);
+ Add_Goto (Table.States (1713), 329, 225);
+ Add_Goto (Table.States (1713), 330, 94);
+ Add_Goto (Table.States (1713), 332, 95);
+ Add_Goto (Table.States (1713), 333, 96);
+ Add_Goto (Table.States (1713), 334, 97);
+ Add_Goto (Table.States (1713), 335, 98);
+ Add_Goto (Table.States (1713), 336, 99);
+ Add_Goto (Table.States (1713), 337, 100);
+ Add_Goto (Table.States (1713), 338, 101);
+ Add_Goto (Table.States (1713), 339, 102);
+ Add_Goto (Table.States (1713), 340, 103);
+ Add_Goto (Table.States (1713), 341, 104);
+ Add_Goto (Table.States (1713), 345, 105);
+ Add_Goto (Table.States (1713), 346, 106);
+ Add_Goto (Table.States (1713), 347, 107);
+ Add_Goto (Table.States (1713), 354, 108);
+ Add_Goto (Table.States (1713), 388, 126);
+ Add_Goto (Table.States (1713), 389, 127);
+ Add_Goto (Table.States (1713), 390, 128);
+ Add_Goto (Table.States (1713), 391, 129);
+ Add_Goto (Table.States (1713), 392, 130);
+ Add_Goto (Table.States (1713), 394, 132);
+ Add_Goto (Table.States (1713), 403, 134);
+ Add_Goto (Table.States (1713), 404, 135);
+ Add_Goto (Table.States (1713), 405, 136);
+ Add_Goto (Table.States (1713), 406, 137);
+ Add_Goto (Table.States (1713), 408, 138);
+ Add_Goto (Table.States (1713), 431, 139);
+ Add_Goto (Table.States (1713), 437, 140);
+ Add_Goto (Table.States (1713), 438, 141);
+ Add_Goto (Table.States (1713), 440, 142);
+ Add_Goto (Table.States (1713), 454, 143);
+ Add_Goto (Table.States (1713), 458, 565);
+ Table.States (1713).Kernel := To_Vector ((0 => ((309, 1), 82, 5,
(32767, 0), 0)));
+ Table.States (1713).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (192, 1), 0)));
+ Table.States (1714).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1714), 82, (309, 0), 941);
+ Table.States (1714).Kernel := To_Vector ((0 => ((309, 0), 434,
6, (32767, 0), 0)));
+ Table.States (1714).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (309, 0), 82, 941)));
+ Table.States (1715).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (1715), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (370, 0), 7);
+ Table.States (1715).Kernel := To_Vector ((0 => ((370, 0), 108,
0, (370, 0), 7)));
+ Table.States (1715).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (370, 0), 7)));
+ Table.States (1716).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (1716), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (378, 0), 7);
+ Table.States (1716).Kernel := To_Vector ((0 => ((378, 0), 108,
0, (378, 0), 7)));
+ Table.States (1716).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (378, 0), 7)));
+ Table.States (1717).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (1717), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (376, 0), 7);
+ Table.States (1717).Kernel := To_Vector ((0 => ((376, 0), 108,
0, (376, 0), 7)));
+ Table.States (1717).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (376, 0), 7)));
+ Table.States (1718).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1718), 108, (379, 0), 1975);
+ Table.States (1718).Kernel := To_Vector ((0 => ((379, 0), 15, 1,
(32767, 0), 0)));
+ Table.States (1718).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (379, 0), 108, 1975)));
+ Table.States (1719).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1719), (87, 95), (456, 0), 1);
+ Table.States (1719).Kernel := To_Vector ((0 => ((456, 0), 163,
0, (456, 0), 1)));
+ Table.States (1719).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (456, 0), 1)));
+ Table.States (1720).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1720), 87, (162, 0), 1976);
+ Add_Action (Table.States (1720), 95, (456, 1), 1977);
+ Table.States (1720).Kernel := To_Vector ((((162, 0), 456, 1,
(32767, 0), 0), ((456, 1), 456, 2,
+ (32767, 0), 0), ((456, 2), 456, 2, (32767, 0), 0)));
+ Table.States (1720).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (162, 0), 87, 1976)));
+ Table.States (1721).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (1721), 12, (402, 0), 165);
+ Add_Action (Table.States (1721), 46, (233, 2), 167);
+ Add_Action (Table.States (1721), 52, (233, 3), 168);
+ Add_Action (Table.States (1721), 65, (234, 1), 169);
+ Add_Action (Table.States (1721), 76, (256, 0), 170);
+ Add_Action (Table.States (1721), 85, (205, 4), 171);
+ Add_Action (Table.States (1721), 86, (213, 2), 172);
+ Add_Action (Table.States (1721), 90, (268, 0), 34);
+ Add_Action (Table.States (1721), 106, (237, 1), 173);
+ Add_Action (Table.States (1721), 107, (237, 0), 174);
+ Add_Action (Table.States (1721), 115, (234, 0), 175);
+ Add_Action (Table.States (1721), 116, (196, 0), 146);
+ Add_Action (Table.States (1721), 117, (196, 1), 37);
+ Add_Action (Table.States (1721), 118, (195, 6), 38);
+ Table.States (1721).Goto_List.Set_Capacity (31);
+ Add_Goto (Table.States (1721), 195, 176);
+ Add_Goto (Table.States (1721), 196, 148);
+ Add_Goto (Table.States (1721), 197, 54);
+ Add_Goto (Table.States (1721), 198, 55);
+ Add_Goto (Table.States (1721), 199, 56);
+ Add_Goto (Table.States (1721), 201, 57);
+ Add_Goto (Table.States (1721), 205, 177);
+ Add_Goto (Table.States (1721), 206, 178);
+ Add_Goto (Table.States (1721), 210, 179);
+ Add_Goto (Table.States (1721), 211, 180);
+ Add_Goto (Table.States (1721), 213, 181);
+ Add_Goto (Table.States (1721), 214, 182);
+ Add_Goto (Table.States (1721), 215, 183);
+ Add_Goto (Table.States (1721), 218, 184);
+ Add_Goto (Table.States (1721), 219, 185);
+ Add_Goto (Table.States (1721), 220, 186);
+ Add_Goto (Table.States (1721), 227, 1978);
+ Add_Goto (Table.States (1721), 228, 188);
+ Add_Goto (Table.States (1721), 231, 189);
+ Add_Goto (Table.States (1721), 232, 190);
+ Add_Goto (Table.States (1721), 233, 191);
+ Add_Goto (Table.States (1721), 234, 192);
+ Add_Goto (Table.States (1721), 237, 193);
+ Add_Goto (Table.States (1721), 251, 58);
+ Add_Goto (Table.States (1721), 252, 59);
+ Add_Goto (Table.States (1721), 255, 60);
+ Add_Goto (Table.States (1721), 256, 194);
+ Add_Goto (Table.States (1721), 268, 68);
+ Add_Goto (Table.States (1721), 311, 83);
+ Add_Goto (Table.States (1721), 402, 195);
+ Add_Goto (Table.States (1721), 465, 196);
+ Table.States (1721).Kernel := To_Vector ((0 => ((242, 2), 41, 1,
(32767, 0), 0)));
+ Table.States (1721).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (1722).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (1722), 12, (402, 0), 165);
+ Add_Action (Table.States (1722), 46, (233, 2), 167);
+ Add_Action (Table.States (1722), 52, (233, 3), 168);
+ Add_Action (Table.States (1722), 65, (234, 1), 169);
+ Add_Action (Table.States (1722), 76, (256, 0), 170);
+ Add_Action (Table.States (1722), 85, (205, 4), 171);
+ Add_Action (Table.States (1722), 86, (213, 2), 172);
+ Add_Action (Table.States (1722), 90, (268, 0), 34);
+ Add_Action (Table.States (1722), 106, (237, 1), 173);
+ Add_Action (Table.States (1722), 107, (237, 0), 174);
+ Add_Action (Table.States (1722), 115, (234, 0), 175);
+ Add_Action (Table.States (1722), 116, (196, 0), 146);
+ Add_Action (Table.States (1722), 117, (196, 1), 37);
+ Add_Action (Table.States (1722), 118, (195, 6), 38);
+ Table.States (1722).Goto_List.Set_Capacity (32);
+ Add_Goto (Table.States (1722), 195, 176);
+ Add_Goto (Table.States (1722), 196, 148);
+ Add_Goto (Table.States (1722), 197, 54);
+ Add_Goto (Table.States (1722), 198, 55);
+ Add_Goto (Table.States (1722), 199, 56);
+ Add_Goto (Table.States (1722), 201, 57);
+ Add_Goto (Table.States (1722), 205, 177);
+ Add_Goto (Table.States (1722), 206, 178);
+ Add_Goto (Table.States (1722), 210, 179);
+ Add_Goto (Table.States (1722), 211, 180);
+ Add_Goto (Table.States (1722), 213, 181);
+ Add_Goto (Table.States (1722), 214, 182);
+ Add_Goto (Table.States (1722), 215, 183);
+ Add_Goto (Table.States (1722), 218, 184);
+ Add_Goto (Table.States (1722), 219, 185);
+ Add_Goto (Table.States (1722), 220, 186);
+ Add_Goto (Table.States (1722), 227, 236);
+ Add_Goto (Table.States (1722), 228, 188);
+ Add_Goto (Table.States (1722), 231, 189);
+ Add_Goto (Table.States (1722), 232, 190);
+ Add_Goto (Table.States (1722), 233, 191);
+ Add_Goto (Table.States (1722), 234, 192);
+ Add_Goto (Table.States (1722), 237, 193);
+ Add_Goto (Table.States (1722), 243, 1979);
+ Add_Goto (Table.States (1722), 251, 58);
+ Add_Goto (Table.States (1722), 252, 59);
+ Add_Goto (Table.States (1722), 255, 60);
+ Add_Goto (Table.States (1722), 256, 194);
+ Add_Goto (Table.States (1722), 268, 68);
+ Add_Goto (Table.States (1722), 311, 83);
+ Add_Goto (Table.States (1722), 402, 195);
+ Add_Goto (Table.States (1722), 465, 196);
+ Table.States (1722).Kernel := To_Vector ((0 => ((240, 0), 44, 3,
(32767, 0), 0)));
+ Table.States (1722).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (1723).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1723), (41, 44, 87), (241, 0), 1);
+ Table.States (1723).Kernel := To_Vector ((0 => ((241, 0), 240,
0, (241, 0), 1)));
+ Table.States (1723).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (241, 0), 1)));
+ Table.States (1724).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1724), 41, (242, 0), 1980);
+ Add_Action (Table.States (1724), 44, (240, 0), 1722);
+ Add_Action (Table.States (1724), 87, Reduce, (242, 1), 5);
+ Table.States (1724).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1724), 240, 1981);
+ Table.States (1724).Kernel := To_Vector ((((241, 1), 241, 4,
(32767, 0), 0), ((242, 0), 241, 2,
+ (32767, 0), 0), ((242, 1), 241, 0, (242, 1), 5)));
+ Table.States (1724).Minimal_Complete_Actions := To_Vector
(((Shift, (242, 0), 41, 1980), (Reduce, (242,
+ 1), 5)));
+ Table.States (1725).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1725), 91, (177, 1), 631);
+ Add_Action (Table.States (1725), 99, (246, 0), 1982);
+ Table.States (1725).Kernel := To_Vector ((((177, 1), 177, 2,
(32767, 0), 0), ((246, 0), 177, 2,
+ (32767, 0), 0)));
+ Table.States (1725).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (246, 0), 99, 1982)));
+ Table.States (1726).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1726), 63, (246, 0), 1371);
+ Table.States (1726).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1726), 246, 1983);
+ Table.States (1726).Kernel := To_Vector ((0 => ((244, 1), 95, 4,
(32767, 0), 0)));
+ Table.States (1726).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (246, 0), 63, 1371)));
+ Table.States (1727).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1727), 87, (204, 0), 1984);
+ Table.States (1727).Kernel := To_Vector ((0 => ((204, 0), 227,
1, (32767, 0), 0)));
+ Table.States (1727).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (204, 0), 87, 1984)));
+ Table.States (1728).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (1728), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (213, 1), 6);
+ Table.States (1728).Kernel := To_Vector ((0 => ((213, 1), 87, 0,
(213, 1), 6)));
+ Table.States (1728).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (213, 1), 6)));
+ Table.States (1729).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (1729), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (219, 0), 6);
+ Table.States (1729).Kernel := To_Vector ((0 => ((219, 0), 87, 0,
(219, 0), 6)));
+ Table.States (1729).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (219, 0), 6)));
+ Table.States (1730).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (1730), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (220, 0), 6);
+ Table.States (1730).Kernel := To_Vector ((0 => ((220, 0), 87, 0,
(220, 0), 6)));
+ Table.States (1730).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (220, 0), 6)));
+ Table.States (1731).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (1731), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (213, 2), 6);
+ Table.States (1731).Kernel := To_Vector ((0 => ((213, 2), 88, 0,
(213, 2), 6)));
+ Table.States (1731).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (213, 2), 6)));
+ Table.States (1732).Action_List.Set_Capacity (47);
+ Add_Action (Table.States (1732), (11, 24, 30, 33, 36, 41, 43, 44,
45, 47, 48, 49, 50, 52, 61, 63, 69, 71,
+ 72, 73, 74, 75, 82, 85, 87, 88, 89, 91, 94, 95, 96, 97, 98, 99,
100, 101, 103, 104, 106, 107, 108, 109,
+ 110, 111, 112, 113, 114), (220, 1), 6);
+ Table.States (1732).Kernel := To_Vector ((0 => ((220, 1), 88, 0,
(220, 1), 6)));
+ Table.States (1732).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (220, 1), 6)));
+ Table.States (1733).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (1733), 12, (401, 0), 1);
+ Add_Action (Table.States (1733), 15, (370, 0), 3);
+ Add_Action (Table.States (1733), 17, (365, 0), 4);
+ Add_Action (Table.States (1733), 18, (382, 0), 5);
+ Add_Action (Table.States (1733), 19, (363, 0), 6);
+ Add_Action (Table.States (1733), 20, (357, 0), 7);
+ Add_Action (Table.States (1733), 30, (316, 0), 13);
+ Add_Action (Table.States (1733), 31, (290, 0), 14);
+ Add_Action (Table.States (1733), 32, (289, 0), 15);
+ Add_Action (Table.States (1733), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1733), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1733), 37, (288, 0), 17);
+ Add_Conflict (Table.States (1733), 37, (285, 1), 0);
+ Add_Action (Table.States (1733), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1733), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1733), 42, (271, 0), 18);
+ Add_Action (Table.States (1733), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1733), 64, (273, 0), 27);
+ Add_Action (Table.States (1733), 65, (264, 0), 28);
+ Add_Action (Table.States (1733), 84, (124, 0), 32);
+ Add_Action (Table.States (1733), 86, (252, 0), 33);
+ Add_Action (Table.States (1733), 90, (268, 0), 34);
+ Add_Action (Table.States (1733), 105, (265, 0), 35);
+ Add_Action (Table.States (1733), 116, (196, 0), 146);
+ Add_Action (Table.States (1733), 117, (196, 1), 37);
+ Add_Action (Table.States (1733), 118, (195, 6), 38);
+ Table.States (1733).Goto_List.Set_Capacity (46);
+ Add_Goto (Table.States (1733), 124, 39);
+ Add_Goto (Table.States (1733), 195, 52);
+ Add_Goto (Table.States (1733), 196, 53);
+ Add_Goto (Table.States (1733), 197, 54);
+ Add_Goto (Table.States (1733), 198, 55);
+ Add_Goto (Table.States (1733), 199, 56);
+ Add_Goto (Table.States (1733), 201, 57);
+ Add_Goto (Table.States (1733), 251, 58);
+ Add_Goto (Table.States (1733), 252, 59);
+ Add_Goto (Table.States (1733), 255, 60);
+ Add_Goto (Table.States (1733), 259, 452);
+ Add_Goto (Table.States (1733), 261, 331);
+ Add_Goto (Table.States (1733), 262, 62);
+ Add_Goto (Table.States (1733), 263, 63);
+ Add_Goto (Table.States (1733), 264, 64);
+ Add_Goto (Table.States (1733), 265, 65);
+ Add_Goto (Table.States (1733), 266, 66);
+ Add_Goto (Table.States (1733), 267, 67);
+ Add_Goto (Table.States (1733), 268, 68);
+ Add_Goto (Table.States (1733), 271, 69);
+ Add_Goto (Table.States (1733), 273, 70);
+ Add_Goto (Table.States (1733), 275, 71);
+ Add_Goto (Table.States (1733), 285, 72);
+ Add_Goto (Table.States (1733), 286, 73);
+ Add_Goto (Table.States (1733), 288, 74);
+ Add_Goto (Table.States (1733), 289, 75);
+ Add_Goto (Table.States (1733), 290, 76);
+ Add_Goto (Table.States (1733), 310, 82);
+ Add_Goto (Table.States (1733), 311, 83);
+ Add_Goto (Table.States (1733), 316, 84);
+ Add_Goto (Table.States (1733), 318, 85);
+ Add_Goto (Table.States (1733), 357, 110);
+ Add_Goto (Table.States (1733), 363, 111);
+ Add_Goto (Table.States (1733), 364, 112);
+ Add_Goto (Table.States (1733), 365, 113);
+ Add_Goto (Table.States (1733), 366, 114);
+ Add_Goto (Table.States (1733), 367, 115);
+ Add_Goto (Table.States (1733), 370, 116);
+ Add_Goto (Table.States (1733), 376, 117);
+ Add_Goto (Table.States (1733), 378, 118);
+ Add_Goto (Table.States (1733), 379, 119);
+ Add_Goto (Table.States (1733), 382, 120);
+ Add_Goto (Table.States (1733), 396, 1985);
+ Add_Goto (Table.States (1733), 401, 133);
+ Add_Goto (Table.States (1733), 461, 332);
+ Add_Goto (Table.States (1733), 462, 144);
+ Table.States (1733).Kernel := To_Vector ((0 => ((357, 0), 33, 4,
(32767, 0), 0)));
+ Table.States (1733).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ Table.States (1734).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (1734), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (357, 1), 7);
+ Table.States (1734).Kernel := To_Vector ((0 => ((357, 1), 108,
0, (357, 1), 7)));
+ Table.States (1734).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (357, 1), 7)));
+ Table.States (1735).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1735), 108, (357, 2), 1986);
+ Table.States (1735).Kernel := To_Vector ((0 => ((357, 2), 284,
1, (32767, 0), 0)));
+ Table.States (1735).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (357, 2), 108, 1986)));
+ Table.States (1736).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1736), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (356, 5), 7);
+ Table.States (1736).Kernel := To_Vector ((0 => ((356, 5), 108,
0, (356, 5), 7)));
+ Table.States (1736).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (356, 5), 7)));
+ Table.States (1737).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1737), 108, (356, 4), 1987);
+ Table.States (1737).Kernel := To_Vector ((0 => ((356, 4), 434,
1, (32767, 0), 0)));
+ Table.States (1737).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (356, 4), 108, 1987)));
+ end Subr_61;
+ procedure Subr_62
+ is begin
+ Table.States (1738).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1738), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (339, 0), 7);
+ Table.States (1738).Kernel := To_Vector ((0 => ((339, 0), 108,
0, (339, 0), 7)));
+ Table.States (1738).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (339, 0), 7)));
+ Table.States (1739).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1739), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (339, 4), 7);
+ Table.States (1739).Kernel := To_Vector ((0 => ((339, 4), 108,
0, (339, 4), 7)));
+ Table.States (1739).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (339, 4), 7)));
+ Table.States (1740).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1740), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (339, 2), 7);
+ Table.States (1740).Kernel := To_Vector ((0 => ((339, 2), 108,
0, (339, 2), 7)));
+ Table.States (1740).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (339, 2), 7)));
+ Table.States (1741).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1741), 61, (434, 0), 299);
+ Add_Action (Table.States (1741), 85, (198, 0), 281);
+ Add_Action (Table.States (1741), 96, (197, 0), 283);
+ Add_Action (Table.States (1741), 108, (430, 1), 1988);
+ Add_Action (Table.States (1741), 113, (121, 0), 285);
+ Add_Action (Table.States (1741), 114, (121, 1), 286);
+ Table.States (1741).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1741), 121, 287);
+ Add_Goto (Table.States (1741), 313, 289);
+ Add_Goto (Table.States (1741), 434, 1989);
+ Table.States (1741).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((430, 0), 195, 3, (32767, 0), 0),
+ ((430, 1), 195, 1, (32767, 0), 0)));
+ Table.States (1741).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (430, 1), 108, 1988)));
+ Table.States (1742).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1742), (28, 50, 53, 54, 61, 83, 84,
116), (427, 1), 6);
+ Table.States (1742).Kernel := To_Vector ((0 => ((427, 1), 108,
0, (427, 1), 6)));
+ Table.States (1742).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (427, 1), 6)));
+ Table.States (1743).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1743), 108, (427, 0), 1990);
+ Table.States (1743).Kernel := To_Vector ((0 => ((427, 0), 434,
1, (32767, 0), 0)));
+ Table.States (1743).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (427, 0), 108, 1990)));
+ Table.States (1744).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1744), (28, 50, 53, 54, 61, 83, 84,
116), (427, 2), 6);
+ Table.States (1744).Kernel := To_Vector ((0 => ((427, 2), 108,
0, (427, 2), 6)));
+ Table.States (1744).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (427, 2), 6)));
+ Table.States (1745).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1745), (28, 50, 53, 54, 61, 83, 84,
116), (426, 0), 6);
+ Table.States (1745).Kernel := To_Vector ((0 => ((426, 0), 108,
0, (426, 0), 6)));
+ Table.States (1745).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (426, 0), 6)));
+ Table.States (1746).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1746), (28, 50, 53, 54, 61, 83, 84,
116), (412, 6), 6);
+ Table.States (1746).Kernel := To_Vector ((0 => ((412, 6), 108,
0, (412, 6), 6)));
+ Table.States (1746).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (412, 6), 6)));
+ Table.States (1747).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1747), 49, Reduce, (415, 14), 3);
+ Add_Action (Table.States (1747), 61, (415, 13), 1991);
+ Add_Conflict (Table.States (1747), 61, (415, 14), 3);
+ Add_Action (Table.States (1747), 75, (415, 12), 1992);
+ Add_Action (Table.States (1747), 85, (198, 0), 281);
+ Add_Action (Table.States (1747), 96, (197, 0), 283);
+ Add_Action (Table.States (1747), 108, Reduce, (415, 14), 3);
+ Add_Action (Table.States (1747), 113, (121, 0), 285);
+ Add_Action (Table.States (1747), 114, (121, 1), 286);
+ Table.States (1747).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1747), 121, 287);
+ Add_Goto (Table.States (1747), 313, 289);
+ Table.States (1747).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((415, 12), 195, 4, (32767, 0), 0),
+ ((415, 13), 195, 2, (32767, 0), 0), ((415, 14), 195, 0, (415,
14), 3)));
+ Table.States (1747).Minimal_Complete_Actions := To_Vector
(((Shift, (415, 13), 61, 1991), (Reduce, (415,
+ 14), 3)));
+ Table.States (1748).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1748), 86, (252, 0), 33);
+ Add_Action (Table.States (1748), 90, (268, 0), 34);
+ Add_Action (Table.States (1748), 116, (196, 0), 146);
+ Add_Action (Table.States (1748), 117, (196, 1), 37);
+ Add_Action (Table.States (1748), 118, (195, 6), 38);
+ Table.States (1748).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (1748), 195, 1993);
+ Add_Goto (Table.States (1748), 196, 148);
+ Add_Goto (Table.States (1748), 197, 54);
+ Add_Goto (Table.States (1748), 198, 55);
+ Add_Goto (Table.States (1748), 199, 56);
+ Add_Goto (Table.States (1748), 201, 57);
+ Add_Goto (Table.States (1748), 251, 58);
+ Add_Goto (Table.States (1748), 252, 59);
+ Add_Goto (Table.States (1748), 255, 60);
+ Add_Goto (Table.States (1748), 268, 68);
+ Add_Goto (Table.States (1748), 311, 83);
+ Table.States (1748).Kernel := To_Vector ((0 => ((412, 4), 50, 2,
(32767, 0), 0)));
+ Table.States (1748).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1749).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1749), (49, 61, 108), (414, 2), 3);
+ Table.States (1749).Kernel := To_Vector ((0 => ((414, 2), 27, 0,
(414, 2), 3)));
+ Table.States (1749).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (414, 2), 3)));
+ Table.States (1750).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1750), 92, (421, 0), 1994);
+ Table.States (1750).Kernel := To_Vector ((0 => ((421, 0), 72, 1,
(32767, 0), 0)));
+ Table.States (1750).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (421, 0), 92, 1994)));
+ Table.States (1751).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1751), 27, (415, 16), 1995);
+ Table.States (1751).Kernel := To_Vector ((0 => ((415, 16), 61,
1, (32767, 0), 0)));
+ Table.States (1751).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (415, 16), 27, 1995)));
+ Table.States (1752).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1752), 86, (252, 0), 33);
+ Add_Action (Table.States (1752), 90, (268, 0), 34);
+ Add_Action (Table.States (1752), 116, (196, 0), 146);
+ Add_Action (Table.States (1752), 117, (196, 1), 37);
+ Add_Action (Table.States (1752), 118, (195, 6), 38);
+ Table.States (1752).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1752), 182, 1996);
+ Add_Goto (Table.States (1752), 195, 1152);
+ Add_Goto (Table.States (1752), 196, 148);
+ Add_Goto (Table.States (1752), 197, 54);
+ Add_Goto (Table.States (1752), 198, 55);
+ Add_Goto (Table.States (1752), 199, 56);
+ Add_Goto (Table.States (1752), 201, 57);
+ Add_Goto (Table.States (1752), 251, 58);
+ Add_Goto (Table.States (1752), 252, 59);
+ Add_Goto (Table.States (1752), 255, 60);
+ Add_Goto (Table.States (1752), 268, 68);
+ Add_Goto (Table.States (1752), 311, 83);
+ Table.States (1752).Kernel := To_Vector ((0 => ((415, 15), 75,
3, (32767, 0), 0)));
+ Table.States (1752).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1753).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1753), 49, Reduce, (415, 11), 3);
+ Add_Action (Table.States (1753), 61, (415, 10), 1997);
+ Add_Conflict (Table.States (1753), 61, (415, 11), 3);
+ Add_Action (Table.States (1753), 75, (415, 9), 1998);
+ Add_Action (Table.States (1753), 85, (198, 0), 281);
+ Add_Action (Table.States (1753), 96, (197, 0), 283);
+ Add_Action (Table.States (1753), 108, Reduce, (415, 11), 3);
+ Add_Action (Table.States (1753), 113, (121, 0), 285);
+ Add_Action (Table.States (1753), 114, (121, 1), 286);
+ Table.States (1753).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1753), 121, 287);
+ Add_Goto (Table.States (1753), 313, 289);
+ Table.States (1753).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((415, 9), 195, 4, (32767, 0), 0),
+ ((415, 10), 195, 2, (32767, 0), 0), ((415, 11), 195, 0, (415,
11), 3)));
+ Table.States (1753).Minimal_Complete_Actions := To_Vector
(((Shift, (415, 10), 61, 1997), (Reduce, (415,
+ 11), 3)));
+ Table.States (1754).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1754), 86, (252, 0), 33);
+ Add_Action (Table.States (1754), 90, (268, 0), 34);
+ Add_Action (Table.States (1754), 116, (196, 0), 146);
+ Add_Action (Table.States (1754), 117, (196, 1), 37);
+ Add_Action (Table.States (1754), 118, (195, 6), 38);
+ Table.States (1754).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (1754), 195, 1999);
+ Add_Goto (Table.States (1754), 196, 148);
+ Add_Goto (Table.States (1754), 197, 54);
+ Add_Goto (Table.States (1754), 198, 55);
+ Add_Goto (Table.States (1754), 199, 56);
+ Add_Goto (Table.States (1754), 201, 57);
+ Add_Goto (Table.States (1754), 251, 58);
+ Add_Goto (Table.States (1754), 252, 59);
+ Add_Goto (Table.States (1754), 255, 60);
+ Add_Goto (Table.States (1754), 268, 68);
+ Add_Goto (Table.States (1754), 311, 83);
+ Table.States (1754).Kernel := To_Vector ((((415, 3), 76, 5,
(32767, 0), 0), ((415, 4), 76, 3, (32767,
+ 0), 0), ((415, 5), 76, 1, (32767, 0), 0)));
+ Table.States (1754).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1755).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1755), (49, 61, 108), (414, 1), 3);
+ Table.States (1755).Kernel := To_Vector ((0 => ((414, 1), 27, 0,
(414, 1), 3)));
+ Table.States (1755).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (414, 1), 3)));
+ Table.States (1756).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1756), 27, (414, 0), 2000);
+ Table.States (1756).Kernel := To_Vector ((0 => ((414, 0), 77, 1,
(32767, 0), 0)));
+ Table.States (1756).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (414, 0), 27, 2000)));
+ Table.States (1757).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1757), 49, Reduce, (415, 8), 3);
+ Add_Action (Table.States (1757), 61, (415, 7), 2001);
+ Add_Conflict (Table.States (1757), 61, (415, 8), 3);
+ Add_Action (Table.States (1757), 75, (415, 6), 2002);
+ Add_Action (Table.States (1757), 85, (198, 0), 281);
+ Add_Action (Table.States (1757), 96, (197, 0), 283);
+ Add_Action (Table.States (1757), 108, Reduce, (415, 8), 3);
+ Add_Action (Table.States (1757), 113, (121, 0), 285);
+ Add_Action (Table.States (1757), 114, (121, 1), 286);
+ Table.States (1757).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1757), 121, 287);
+ Add_Goto (Table.States (1757), 313, 289);
+ Table.States (1757).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((415, 6), 195, 4, (32767, 0), 0),
+ ((415, 7), 195, 2, (32767, 0), 0), ((415, 8), 195, 0, (415,
8), 3)));
+ Table.States (1757).Minimal_Complete_Actions := To_Vector
(((Shift, (415, 7), 61, 2001), (Reduce, (415,
+ 8), 3)));
+ Table.States (1758).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1758), 86, (252, 0), 33);
+ Add_Action (Table.States (1758), 90, (268, 0), 34);
+ Add_Action (Table.States (1758), 116, (196, 0), 146);
+ Add_Action (Table.States (1758), 117, (196, 1), 37);
+ Add_Action (Table.States (1758), 118, (195, 6), 38);
+ Table.States (1758).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (1758), 195, 2003);
+ Add_Goto (Table.States (1758), 196, 148);
+ Add_Goto (Table.States (1758), 197, 54);
+ Add_Goto (Table.States (1758), 198, 55);
+ Add_Goto (Table.States (1758), 199, 56);
+ Add_Goto (Table.States (1758), 201, 57);
+ Add_Goto (Table.States (1758), 251, 58);
+ Add_Goto (Table.States (1758), 252, 59);
+ Add_Goto (Table.States (1758), 255, 60);
+ Add_Goto (Table.States (1758), 268, 68);
+ Add_Goto (Table.States (1758), 311, 83);
+ Table.States (1758).Kernel := To_Vector ((((415, 0), 76, 5,
(32767, 0), 0), ((415, 1), 76, 3, (32767,
+ 0), 0), ((415, 2), 76, 1, (32767, 0), 0)));
+ Table.States (1758).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1759).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1759), (49, 61, 108), (416, 0), 3);
+ Table.States (1759).Kernel := To_Vector ((0 => ((416, 0), 87, 0,
(416, 0), 3)));
+ Table.States (1759).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (416, 0), 3)));
+ Table.States (1760).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1760), 86, (252, 0), 33);
+ Add_Action (Table.States (1760), 90, (268, 0), 34);
+ Add_Action (Table.States (1760), 116, (196, 0), 146);
+ Add_Action (Table.States (1760), 117, (196, 1), 37);
+ Add_Action (Table.States (1760), 118, (195, 6), 38);
+ Table.States (1760).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (1760), 195, 2004);
+ Add_Goto (Table.States (1760), 196, 148);
+ Add_Goto (Table.States (1760), 197, 54);
+ Add_Goto (Table.States (1760), 198, 55);
+ Add_Goto (Table.States (1760), 199, 56);
+ Add_Goto (Table.States (1760), 201, 57);
+ Add_Goto (Table.States (1760), 251, 58);
+ Add_Goto (Table.States (1760), 252, 59);
+ Add_Goto (Table.States (1760), 255, 60);
+ Add_Goto (Table.States (1760), 268, 68);
+ Add_Goto (Table.States (1760), 311, 83);
+ Table.States (1760).Kernel := To_Vector ((((411, 4), 50, 4,
(32767, 0), 0), ((411, 5), 50, 2, (32767,
+ 0), 0)));
+ Table.States (1760).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1761).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1761), (28, 50, 53, 54, 61, 83, 84,
116), (411, 6), 6);
+ Table.States (1761).Kernel := To_Vector ((0 => ((411, 6), 108,
0, (411, 6), 6)));
+ Table.States (1761).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (411, 6), 6)));
+ Table.States (1762).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1762), 85, (198, 0), 281);
+ Add_Action (Table.States (1762), 96, (197, 0), 283);
+ Add_Action (Table.States (1762), 108, (412, 2), 2005);
+ Add_Action (Table.States (1762), 113, (121, 0), 285);
+ Add_Action (Table.States (1762), 114, (121, 1), 286);
+ Table.States (1762).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1762), 121, 287);
+ Add_Goto (Table.States (1762), 313, 289);
+ Table.States (1762).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((412, 2), 195, 1, (32767, 0), 0)));
+ Table.States (1762).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (412, 2), 108, 2005)));
+ Table.States (1763).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1763), 50, (412, 0), 2006);
+ Table.States (1763).Kernel := To_Vector ((0 => ((412, 0), 49, 3,
(32767, 0), 0)));
+ Table.States (1763).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (412, 0), 50, 2006)));
+ Table.States (1764).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1764), (28, 50, 53, 54, 61, 83, 84,
116), (412, 1), 6);
+ Table.States (1764).Kernel := To_Vector ((0 => ((412, 1), 108,
0, (412, 1), 6)));
+ Table.States (1764).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (412, 1), 6)));
+ Table.States (1765).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1765), 50, (411, 0), 2007);
+ Table.States (1765).Kernel := To_Vector ((((411, 0), 49, 5,
(32767, 0), 0), ((411, 1), 49, 3, (32767,
+ 0), 0)));
+ Table.States (1765).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (411, 0), 50, 2007)));
+ Table.States (1766).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1766), (28, 50, 53, 54, 61, 83, 84,
116), (411, 3), 6);
+ Table.States (1766).Kernel := To_Vector ((0 => ((411, 3), 108,
0, (411, 3), 6)));
+ Table.States (1766).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (411, 3), 6)));
+ Table.States (1767).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1767), 108, (411, 2), 2008);
+ Table.States (1767).Kernel := To_Vector ((0 => ((411, 2), 434,
1, (32767, 0), 0)));
+ Table.States (1767).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (411, 2), 108, 2008)));
+ Table.States (1768).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1768), (28, 50, 53, 54, 61, 83, 84,
116), (409, 3), 6);
+ Table.States (1768).Kernel := To_Vector ((0 => ((409, 3), 108,
0, (409, 3), 6)));
+ Table.States (1768).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (409, 3), 6)));
+ Table.States (1769).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1769), 61, (434, 0), 299);
+ Add_Action (Table.States (1769), 108, (409, 1), 2009);
+ Table.States (1769).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1769), 434, 2010);
+ Table.States (1769).Kernel := To_Vector ((((409, 0), 134, 3,
(32767, 0), 0), ((409, 1), 134, 1,
+ (32767, 0), 0)));
+ Table.States (1769).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (409, 1), 108, 2009)));
+ Table.States (1770).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1770), 108, (409, 2), 2011);
+ Table.States (1770).Kernel := To_Vector ((0 => ((409, 2), 434,
1, (32767, 0), 0)));
+ Table.States (1770).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (409, 2), 108, 2011)));
+ Table.States (1771).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1771), (28, 50, 53, 54, 61, 83, 84,
116), (409, 9), 6);
+ Table.States (1771).Kernel := To_Vector ((0 => ((409, 9), 108,
0, (409, 9), 6)));
+ Table.States (1771).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (409, 9), 6)));
+ Table.States (1772).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1772), 108, (409, 8), 2012);
+ Table.States (1772).Kernel := To_Vector ((0 => ((409, 8), 434,
1, (32767, 0), 0)));
+ Table.States (1772).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (409, 8), 108, 2012)));
+ Table.States (1773).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1773), (28, 50, 53, 54, 61, 83, 84,
116), (409, 10), 6);
+ Table.States (1773).Kernel := To_Vector ((0 => ((409, 10), 108,
0, (409, 10), 6)));
+ Table.States (1773).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (409, 10), 6)));
+ Table.States (1774).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1774), (28, 50, 53, 54, 61, 83, 84,
116), (409, 5), 6);
+ Table.States (1774).Kernel := To_Vector ((0 => ((409, 5), 108,
0, (409, 5), 6)));
+ Table.States (1774).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (409, 5), 6)));
+ Table.States (1775).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1775), 108, (409, 4), 2013);
+ Table.States (1775).Kernel := To_Vector ((0 => ((409, 4), 434,
1, (32767, 0), 0)));
+ Table.States (1775).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (409, 4), 108, 2013)));
+ Table.States (1776).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1776), (28, 50, 53, 54, 61, 83, 84,
116), (409, 6), 6);
+ Table.States (1776).Kernel := To_Vector ((0 => ((409, 6), 108,
0, (409, 6), 6)));
+ Table.States (1776).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (409, 6), 6)));
+ Table.States (1777).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1777), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (390, 0), 7);
+ Table.States (1777).Kernel := To_Vector ((0 => ((390, 0), 108,
0, (390, 0), 7)));
+ Table.States (1777).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (390, 0), 7)));
+ Table.States (1778).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1778), 66, (326, 2), 2014);
+ Table.States (1778).Kernel := To_Vector ((0 => ((326, 2), 396,
2, (32767, 0), 0)));
+ Table.States (1778).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (326, 2), 66, 2014)));
+ Table.States (1779).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1779), 108, (326, 3), 2015);
+ Table.States (1779).Kernel := To_Vector ((0 => ((326, 3), 308,
1, (32767, 0), 0)));
+ Table.States (1779).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (326, 3), 108, 2015)));
+ Table.States (1780).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (1780), 12, (401, 0), 1);
+ Add_Action (Table.States (1780), 15, (370, 0), 3);
+ Add_Action (Table.States (1780), 17, (365, 0), 4);
+ Add_Action (Table.States (1780), 18, (382, 0), 5);
+ Add_Action (Table.States (1780), 19, (363, 0), 6);
+ Add_Action (Table.States (1780), 20, (357, 0), 7);
+ Add_Action (Table.States (1780), 30, (316, 0), 13);
+ Add_Action (Table.States (1780), 31, (290, 0), 14);
+ Add_Action (Table.States (1780), 32, (289, 0), 15);
+ Add_Action (Table.States (1780), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1780), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1780), 37, (288, 0), 17);
+ Add_Conflict (Table.States (1780), 37, (285, 1), 0);
+ Add_Action (Table.States (1780), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1780), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1780), 42, (271, 0), 18);
+ Add_Action (Table.States (1780), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1780), 64, (273, 0), 27);
+ Add_Action (Table.States (1780), 65, (264, 0), 28);
+ Add_Action (Table.States (1780), 84, (124, 0), 32);
+ Add_Action (Table.States (1780), 86, (252, 0), 33);
+ Add_Action (Table.States (1780), 90, (268, 0), 34);
+ Add_Action (Table.States (1780), 105, (265, 0), 35);
+ Add_Action (Table.States (1780), 116, (196, 0), 146);
+ Add_Action (Table.States (1780), 117, (196, 1), 37);
+ Add_Action (Table.States (1780), 118, (195, 6), 38);
+ Table.States (1780).Goto_List.Set_Capacity (46);
+ Add_Goto (Table.States (1780), 124, 39);
+ Add_Goto (Table.States (1780), 195, 52);
+ Add_Goto (Table.States (1780), 196, 53);
+ Add_Goto (Table.States (1780), 197, 54);
+ Add_Goto (Table.States (1780), 198, 55);
+ Add_Goto (Table.States (1780), 199, 56);
+ Add_Goto (Table.States (1780), 201, 57);
+ Add_Goto (Table.States (1780), 251, 58);
+ Add_Goto (Table.States (1780), 252, 59);
+ Add_Goto (Table.States (1780), 255, 60);
+ Add_Goto (Table.States (1780), 259, 452);
+ Add_Goto (Table.States (1780), 261, 331);
+ Add_Goto (Table.States (1780), 262, 62);
+ Add_Goto (Table.States (1780), 263, 63);
+ Add_Goto (Table.States (1780), 264, 64);
+ Add_Goto (Table.States (1780), 265, 65);
+ Add_Goto (Table.States (1780), 266, 66);
+ Add_Goto (Table.States (1780), 267, 67);
+ Add_Goto (Table.States (1780), 268, 68);
+ Add_Goto (Table.States (1780), 271, 69);
+ Add_Goto (Table.States (1780), 273, 70);
+ Add_Goto (Table.States (1780), 275, 71);
+ Add_Goto (Table.States (1780), 285, 72);
+ Add_Goto (Table.States (1780), 286, 73);
+ Add_Goto (Table.States (1780), 288, 74);
+ Add_Goto (Table.States (1780), 289, 75);
+ Add_Goto (Table.States (1780), 290, 76);
+ Add_Goto (Table.States (1780), 310, 82);
+ Add_Goto (Table.States (1780), 311, 83);
+ Add_Goto (Table.States (1780), 316, 84);
+ Add_Goto (Table.States (1780), 318, 85);
+ Add_Goto (Table.States (1780), 357, 110);
+ Add_Goto (Table.States (1780), 363, 111);
+ Add_Goto (Table.States (1780), 364, 112);
+ Add_Goto (Table.States (1780), 365, 113);
+ Add_Goto (Table.States (1780), 366, 114);
+ Add_Goto (Table.States (1780), 367, 115);
+ Add_Goto (Table.States (1780), 370, 116);
+ Add_Goto (Table.States (1780), 376, 117);
+ Add_Goto (Table.States (1780), 378, 118);
+ Add_Goto (Table.States (1780), 379, 119);
+ Add_Goto (Table.States (1780), 382, 120);
+ Add_Goto (Table.States (1780), 396, 2016);
+ Add_Goto (Table.States (1780), 401, 133);
+ Add_Goto (Table.States (1780), 461, 332);
+ Add_Goto (Table.States (1780), 462, 144);
+ Table.States (1780).Kernel := To_Vector ((0 => ((326, 0), 38, 4,
(32767, 0), 0)));
+ Table.States (1780).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ end Subr_62;
+ procedure Subr_63
+ is begin
+ Table.States (1781).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1781), 86, (252, 0), 33);
+ Add_Action (Table.States (1781), 90, (268, 0), 34);
+ Add_Action (Table.States (1781), 108, Reduce, (308, 1), 0);
+ Add_Action (Table.States (1781), 116, (196, 0), 146);
+ Add_Action (Table.States (1781), 117, (196, 1), 37);
+ Add_Action (Table.States (1781), 118, (195, 6), 38);
+ Table.States (1781).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1781), 195, 1063);
+ Add_Goto (Table.States (1781), 196, 148);
+ Add_Goto (Table.States (1781), 197, 54);
+ Add_Goto (Table.States (1781), 198, 55);
+ Add_Goto (Table.States (1781), 199, 56);
+ Add_Goto (Table.States (1781), 201, 57);
+ Add_Goto (Table.States (1781), 251, 58);
+ Add_Goto (Table.States (1781), 252, 59);
+ Add_Goto (Table.States (1781), 255, 60);
+ Add_Goto (Table.States (1781), 268, 68);
+ Add_Goto (Table.States (1781), 308, 2017);
+ Add_Goto (Table.States (1781), 311, 83);
+ Table.States (1781).Kernel := To_Vector ((0 => ((326, 1), 66, 1,
(32767, 0), 0)));
+ Table.States (1781).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (308, 1), 0)));
+ Table.States (1782).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1782), (1 => 108), (325, 9), 7);
+ Table.States (1782).Kernel := To_Vector ((0 => ((325, 9), 308,
0, (325, 9), 7)));
+ Table.States (1782).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (325, 9), 7)));
+ Table.States (1783).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1783), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (408, 0), 7);
+ Table.States (1783).Kernel := To_Vector ((0 => ((408, 0), 108,
0, (408, 0), 7)));
+ Table.States (1783).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (408, 0), 7)));
+ Table.States (1784).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1784), (1 => 108), (325, 7), 7);
+ Table.States (1784).Kernel := To_Vector ((0 => ((325, 7), 308,
0, (325, 7), 7)));
+ Table.States (1784).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (325, 7), 7)));
+ Table.States (1785).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1785), 86, (252, 0), 33);
+ Add_Action (Table.States (1785), 90, (268, 0), 34);
+ Add_Action (Table.States (1785), 108, Reduce, (308, 1), 0);
+ Add_Action (Table.States (1785), 116, (196, 0), 146);
+ Add_Action (Table.States (1785), 117, (196, 1), 37);
+ Add_Action (Table.States (1785), 118, (195, 6), 38);
+ Table.States (1785).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1785), 195, 1063);
+ Add_Goto (Table.States (1785), 196, 148);
+ Add_Goto (Table.States (1785), 197, 54);
+ Add_Goto (Table.States (1785), 198, 55);
+ Add_Goto (Table.States (1785), 199, 56);
+ Add_Goto (Table.States (1785), 201, 57);
+ Add_Goto (Table.States (1785), 251, 58);
+ Add_Goto (Table.States (1785), 252, 59);
+ Add_Goto (Table.States (1785), 255, 60);
+ Add_Goto (Table.States (1785), 268, 68);
+ Add_Goto (Table.States (1785), 308, 2018);
+ Add_Goto (Table.States (1785), 311, 83);
+ Table.States (1785).Kernel := To_Vector ((0 => ((325, 6), 66, 0,
(308, 1), 0)));
+ Table.States (1785).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (308, 1), 0)));
+ Table.States (1786).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1786), (1 => 108), (325, 4), 7);
+ Table.States (1786).Kernel := To_Vector ((0 => ((325, 4), 308,
0, (325, 4), 7)));
+ Table.States (1786).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (325, 4), 7)));
+ Table.States (1787).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1787), 86, (252, 0), 33);
+ Add_Action (Table.States (1787), 90, (268, 0), 34);
+ Add_Action (Table.States (1787), 108, Reduce, (308, 1), 0);
+ Add_Action (Table.States (1787), 116, (196, 0), 146);
+ Add_Action (Table.States (1787), 117, (196, 1), 37);
+ Add_Action (Table.States (1787), 118, (195, 6), 38);
+ Table.States (1787).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1787), 195, 1063);
+ Add_Goto (Table.States (1787), 196, 148);
+ Add_Goto (Table.States (1787), 197, 54);
+ Add_Goto (Table.States (1787), 198, 55);
+ Add_Goto (Table.States (1787), 199, 56);
+ Add_Goto (Table.States (1787), 201, 57);
+ Add_Goto (Table.States (1787), 251, 58);
+ Add_Goto (Table.States (1787), 252, 59);
+ Add_Goto (Table.States (1787), 255, 60);
+ Add_Goto (Table.States (1787), 268, 68);
+ Add_Goto (Table.States (1787), 308, 2019);
+ Add_Goto (Table.States (1787), 311, 83);
+ Table.States (1787).Kernel := To_Vector ((0 => ((325, 3), 66, 0,
(308, 1), 0)));
+ Table.States (1787).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (308, 1), 0)));
+ Table.States (1788).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1788), 86, (252, 0), 33);
+ Add_Action (Table.States (1788), 90, (268, 0), 34);
+ Add_Action (Table.States (1788), 108, Reduce, (308, 1), 0);
+ Add_Action (Table.States (1788), 116, (196, 0), 146);
+ Add_Action (Table.States (1788), 117, (196, 1), 37);
+ Add_Action (Table.States (1788), 118, (195, 6), 38);
+ Table.States (1788).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1788), 195, 1063);
+ Add_Goto (Table.States (1788), 196, 148);
+ Add_Goto (Table.States (1788), 197, 54);
+ Add_Goto (Table.States (1788), 198, 55);
+ Add_Goto (Table.States (1788), 199, 56);
+ Add_Goto (Table.States (1788), 201, 57);
+ Add_Goto (Table.States (1788), 251, 58);
+ Add_Goto (Table.States (1788), 252, 59);
+ Add_Goto (Table.States (1788), 255, 60);
+ Add_Goto (Table.States (1788), 268, 68);
+ Add_Goto (Table.States (1788), 308, 2020);
+ Add_Goto (Table.States (1788), 311, 83);
+ Table.States (1788).Kernel := To_Vector ((0 => ((325, 1), 66, 0,
(308, 1), 0)));
+ Table.States (1788).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (308, 1), 0)));
+ Table.States (1789).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (1789), 22, (339, 0), 9);
+ Add_Action (Table.States (1789), 25, (329, 1), 10);
+ Add_Action (Table.States (1789), 28, (325, 0), 720);
+ Add_Action (Table.States (1789), 50, (332, 0), 19);
+ Add_Action (Table.States (1789), 51, (437, 0), 221);
+ Add_Action (Table.States (1789), 52, (329, 0), 21);
+ Add_Action (Table.States (1789), 53, (294, 0), 22);
+ Add_Action (Table.States (1789), 54, (293, 0), 23);
+ Add_Action (Table.States (1789), 59, (346, 0), 721);
+ Add_Action (Table.States (1789), 60, (340, 0), 722);
+ Add_Action (Table.States (1789), 66, (325, 0), 2021);
+ Add_Action (Table.States (1789), 81, (130, 0), 30);
+ Add_Action (Table.States (1789), 83, (128, 0), 31);
+ Add_Action (Table.States (1789), 84, (124, 0), 32);
+ Add_Action (Table.States (1789), 116, (136, 0), 223);
+ Table.States (1789).Goto_List.Set_Capacity (48);
+ Add_Goto (Table.States (1789), 124, 725);
+ Add_Goto (Table.States (1789), 126, 40);
+ Add_Goto (Table.States (1789), 127, 41);
+ Add_Goto (Table.States (1789), 128, 42);
+ Add_Goto (Table.States (1789), 130, 43);
+ Add_Goto (Table.States (1789), 135, 44);
+ Add_Goto (Table.States (1789), 136, 45);
+ Add_Goto (Table.States (1789), 137, 46);
+ Add_Goto (Table.States (1789), 180, 47);
+ Add_Goto (Table.States (1789), 189, 48);
+ Add_Goto (Table.States (1789), 193, 726);
+ Add_Goto (Table.States (1789), 291, 77);
+ Add_Goto (Table.States (1789), 292, 727);
+ Add_Goto (Table.States (1789), 293, 79);
+ Add_Goto (Table.States (1789), 294, 80);
+ Add_Goto (Table.States (1789), 320, 86);
+ Add_Goto (Table.States (1789), 321, 87);
+ Add_Goto (Table.States (1789), 322, 88);
+ Add_Goto (Table.States (1789), 323, 1070);
+ Add_Goto (Table.States (1789), 324, 1071);
+ Add_Goto (Table.States (1789), 325, 89);
+ Add_Goto (Table.States (1789), 327, 91);
+ Add_Goto (Table.States (1789), 328, 92);
+ Add_Goto (Table.States (1789), 329, 730);
+ Add_Goto (Table.States (1789), 330, 94);
+ Add_Goto (Table.States (1789), 332, 95);
+ Add_Goto (Table.States (1789), 333, 96);
+ Add_Goto (Table.States (1789), 334, 97);
+ Add_Goto (Table.States (1789), 335, 98);
+ Add_Goto (Table.States (1789), 336, 99);
+ Add_Goto (Table.States (1789), 337, 100);
+ Add_Goto (Table.States (1789), 338, 101);
+ Add_Goto (Table.States (1789), 339, 102);
+ Add_Goto (Table.States (1789), 340, 103);
+ Add_Goto (Table.States (1789), 341, 104);
+ Add_Goto (Table.States (1789), 346, 106);
+ Add_Goto (Table.States (1789), 347, 107);
+ Add_Goto (Table.States (1789), 394, 132);
+ Add_Goto (Table.States (1789), 403, 134);
+ Add_Goto (Table.States (1789), 404, 135);
+ Add_Goto (Table.States (1789), 405, 136);
+ Add_Goto (Table.States (1789), 406, 137);
+ Add_Goto (Table.States (1789), 408, 138);
+ Add_Goto (Table.States (1789), 431, 139);
+ Add_Goto (Table.States (1789), 437, 140);
+ Add_Goto (Table.States (1789), 438, 141);
+ Add_Goto (Table.States (1789), 440, 142);
+ Add_Goto (Table.States (1789), 454, 143);
+ Table.States (1789).Kernel := To_Vector ((((324, 1), 324, 3,
(32767, 0), 0), ((324, 2), 324, 3,
+ (32767, 0), 0), ((325, 0), 324, 1, (32767, 0), 0)));
+ Table.States (1789).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (325, 0), 66, 2021)));
+ Table.States (1790).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1790), (1 => 108), (325, 2), 7);
+ Table.States (1790).Kernel := To_Vector ((0 => ((325, 2), 308,
0, (325, 2), 7)));
+ Table.States (1790).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (325, 2), 7)));
+ Table.States (1791).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1791), (33, 108), (317, 0), 6);
+ Table.States (1791).Kernel := To_Vector ((0 => ((317, 0), 134,
0, (317, 0), 6)));
+ Table.States (1791).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (317, 0), 6)));
+ Table.States (1792).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (1792), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (318, 0), 7);
+ Table.States (1792).Kernel := To_Vector ((0 => ((318, 0), 108,
0, (318, 0), 7)));
+ Table.States (1792).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (318, 0), 7)));
+ Table.States (1793).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1793), 62, (400, 1), 1458);
+ Add_Action (Table.States (1793), 86, (252, 0), 33);
+ Add_Action (Table.States (1793), 90, (268, 0), 34);
+ Add_Action (Table.States (1793), 116, (196, 0), 146);
+ Add_Action (Table.States (1793), 117, (196, 1), 37);
+ Add_Action (Table.States (1793), 118, (195, 6), 38);
+ Table.States (1793).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (1793), 195, 1460);
+ Add_Goto (Table.States (1793), 196, 148);
+ Add_Goto (Table.States (1793), 197, 54);
+ Add_Goto (Table.States (1793), 198, 55);
+ Add_Goto (Table.States (1793), 199, 56);
+ Add_Goto (Table.States (1793), 201, 57);
+ Add_Goto (Table.States (1793), 251, 58);
+ Add_Goto (Table.States (1793), 252, 59);
+ Add_Goto (Table.States (1793), 255, 60);
+ Add_Goto (Table.States (1793), 268, 68);
+ Add_Goto (Table.States (1793), 311, 83);
+ Add_Goto (Table.States (1793), 397, 2022);
+ Add_Goto (Table.States (1793), 400, 2023);
+ Table.States (1793).Kernel := To_Vector ((((397, 1), 91, 1,
(32767, 0), 0), ((397, 2), 91, 1, (32767,
+ 0), 0)));
+ Table.States (1794).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (1794), 12, (401, 0), 1);
+ Add_Action (Table.States (1794), 15, (370, 0), 3);
+ Add_Action (Table.States (1794), 17, (365, 0), 4);
+ Add_Action (Table.States (1794), 18, (382, 0), 5);
+ Add_Action (Table.States (1794), 19, (363, 0), 6);
+ Add_Action (Table.States (1794), 20, (357, 0), 7);
+ Add_Action (Table.States (1794), 30, (316, 0), 13);
+ Add_Action (Table.States (1794), 31, (290, 0), 14);
+ Add_Action (Table.States (1794), 32, (289, 0), 15);
+ Add_Action (Table.States (1794), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1794), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1794), 37, (288, 0), 17);
+ Add_Conflict (Table.States (1794), 37, (285, 1), 0);
+ Add_Action (Table.States (1794), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1794), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1794), 42, (271, 0), 18);
+ Add_Action (Table.States (1794), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1794), 64, (273, 0), 27);
+ Add_Action (Table.States (1794), 65, (264, 0), 28);
+ Add_Action (Table.States (1794), 84, (124, 0), 32);
+ Add_Action (Table.States (1794), 86, (252, 0), 33);
+ Add_Action (Table.States (1794), 90, (268, 0), 34);
+ Add_Action (Table.States (1794), 105, (265, 0), 35);
+ Add_Action (Table.States (1794), 116, (196, 0), 146);
+ Add_Action (Table.States (1794), 117, (196, 1), 37);
+ Add_Action (Table.States (1794), 118, (195, 6), 38);
+ Table.States (1794).Goto_List.Set_Capacity (45);
+ Add_Goto (Table.States (1794), 124, 39);
+ Add_Goto (Table.States (1794), 195, 52);
+ Add_Goto (Table.States (1794), 196, 53);
+ Add_Goto (Table.States (1794), 197, 54);
+ Add_Goto (Table.States (1794), 198, 55);
+ Add_Goto (Table.States (1794), 199, 56);
+ Add_Goto (Table.States (1794), 201, 57);
+ Add_Goto (Table.States (1794), 251, 58);
+ Add_Goto (Table.States (1794), 252, 59);
+ Add_Goto (Table.States (1794), 255, 60);
+ Add_Goto (Table.States (1794), 259, 2024);
+ Add_Goto (Table.States (1794), 261, 331);
+ Add_Goto (Table.States (1794), 262, 62);
+ Add_Goto (Table.States (1794), 263, 63);
+ Add_Goto (Table.States (1794), 264, 64);
+ Add_Goto (Table.States (1794), 265, 65);
+ Add_Goto (Table.States (1794), 266, 66);
+ Add_Goto (Table.States (1794), 267, 67);
+ Add_Goto (Table.States (1794), 268, 68);
+ Add_Goto (Table.States (1794), 271, 69);
+ Add_Goto (Table.States (1794), 273, 70);
+ Add_Goto (Table.States (1794), 275, 71);
+ Add_Goto (Table.States (1794), 285, 72);
+ Add_Goto (Table.States (1794), 286, 73);
+ Add_Goto (Table.States (1794), 288, 74);
+ Add_Goto (Table.States (1794), 289, 75);
+ Add_Goto (Table.States (1794), 290, 76);
+ Add_Goto (Table.States (1794), 310, 82);
+ Add_Goto (Table.States (1794), 311, 83);
+ Add_Goto (Table.States (1794), 316, 84);
+ Add_Goto (Table.States (1794), 318, 85);
+ Add_Goto (Table.States (1794), 357, 110);
+ Add_Goto (Table.States (1794), 363, 111);
+ Add_Goto (Table.States (1794), 364, 112);
+ Add_Goto (Table.States (1794), 365, 113);
+ Add_Goto (Table.States (1794), 366, 114);
+ Add_Goto (Table.States (1794), 367, 115);
+ Add_Goto (Table.States (1794), 370, 116);
+ Add_Goto (Table.States (1794), 376, 117);
+ Add_Goto (Table.States (1794), 378, 118);
+ Add_Goto (Table.States (1794), 379, 119);
+ Add_Goto (Table.States (1794), 382, 120);
+ Add_Goto (Table.States (1794), 401, 133);
+ Add_Goto (Table.States (1794), 461, 332);
+ Add_Goto (Table.States (1794), 462, 144);
+ Table.States (1794).Kernel := To_Vector ((0 => ((398, 1), 99, 2,
(32767, 0), 0)));
+ Table.States (1794).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ Table.States (1795).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1795), 62, (400, 1), 1458);
+ Add_Action (Table.States (1795), 86, (252, 0), 33);
+ Add_Action (Table.States (1795), 90, (268, 0), 34);
+ Add_Action (Table.States (1795), 116, (196, 0), 146);
+ Add_Action (Table.States (1795), 117, (196, 1), 37);
+ Add_Action (Table.States (1795), 118, (195, 6), 38);
+ Table.States (1795).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (1795), 195, 1460);
+ Add_Goto (Table.States (1795), 196, 148);
+ Add_Goto (Table.States (1795), 197, 54);
+ Add_Goto (Table.States (1795), 198, 55);
+ Add_Goto (Table.States (1795), 199, 56);
+ Add_Goto (Table.States (1795), 201, 57);
+ Add_Goto (Table.States (1795), 251, 58);
+ Add_Goto (Table.States (1795), 252, 59);
+ Add_Goto (Table.States (1795), 255, 60);
+ Add_Goto (Table.States (1795), 268, 68);
+ Add_Goto (Table.States (1795), 311, 83);
+ Add_Goto (Table.States (1795), 397, 2025);
+ Add_Goto (Table.States (1795), 400, 1463);
+ Table.States (1795).Kernel := To_Vector ((0 => ((398, 0), 93, 4,
(32767, 0), 0)));
+ Table.States (1795).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1796).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1796), 108, (288, 0), 2026);
+ Table.States (1796).Kernel := To_Vector ((0 => ((288, 0), 33, 1,
(32767, 0), 0)));
+ Table.States (1796).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (288, 0), 108, 2026)));
+ Table.States (1797).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1797), (66, 75), (287, 1), 3);
+ Table.States (1797).Kernel := To_Vector ((0 => ((287, 1), 396,
0, (287, 1), 3)));
+ Table.States (1797).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (287, 1), 3)));
+ Table.States (1798).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1798), 42, (271, 2), 2027);
+ Table.States (1798).Kernel := To_Vector ((0 => ((271, 2), 66, 2,
(32767, 0), 0)));
+ Table.States (1798).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (271, 2), 42, 2027)));
+ Table.States (1799).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (1799), 12, (401, 0), 1);
+ Add_Action (Table.States (1799), 15, (370, 0), 3);
+ Add_Action (Table.States (1799), 17, (365, 0), 4);
+ Add_Action (Table.States (1799), 18, (382, 0), 5);
+ Add_Action (Table.States (1799), 19, (363, 0), 6);
+ Add_Action (Table.States (1799), 20, (357, 0), 7);
+ Add_Action (Table.States (1799), 30, (316, 0), 13);
+ Add_Action (Table.States (1799), 31, (290, 0), 14);
+ Add_Action (Table.States (1799), 32, (289, 0), 15);
+ Add_Action (Table.States (1799), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1799), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1799), 37, (288, 0), 17);
+ Add_Conflict (Table.States (1799), 37, (285, 1), 0);
+ Add_Action (Table.States (1799), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1799), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1799), 42, (271, 0), 18);
+ Add_Action (Table.States (1799), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1799), 64, (273, 0), 27);
+ Add_Action (Table.States (1799), 65, (264, 0), 28);
+ Add_Action (Table.States (1799), 84, (124, 0), 32);
+ Add_Action (Table.States (1799), 86, (252, 0), 33);
+ Add_Action (Table.States (1799), 90, (268, 0), 34);
+ Add_Action (Table.States (1799), 105, (265, 0), 35);
+ Add_Action (Table.States (1799), 116, (196, 0), 146);
+ Add_Action (Table.States (1799), 117, (196, 1), 37);
+ Add_Action (Table.States (1799), 118, (195, 6), 38);
+ Table.States (1799).Goto_List.Set_Capacity (45);
+ Add_Goto (Table.States (1799), 124, 39);
+ Add_Goto (Table.States (1799), 195, 52);
+ Add_Goto (Table.States (1799), 196, 53);
+ Add_Goto (Table.States (1799), 197, 54);
+ Add_Goto (Table.States (1799), 198, 55);
+ Add_Goto (Table.States (1799), 199, 56);
+ Add_Goto (Table.States (1799), 201, 57);
+ Add_Goto (Table.States (1799), 251, 58);
+ Add_Goto (Table.States (1799), 252, 59);
+ Add_Goto (Table.States (1799), 255, 60);
+ Add_Goto (Table.States (1799), 259, 2028);
+ Add_Goto (Table.States (1799), 261, 331);
+ Add_Goto (Table.States (1799), 262, 62);
+ Add_Goto (Table.States (1799), 263, 63);
+ Add_Goto (Table.States (1799), 264, 64);
+ Add_Goto (Table.States (1799), 265, 65);
+ Add_Goto (Table.States (1799), 266, 66);
+ Add_Goto (Table.States (1799), 267, 67);
+ Add_Goto (Table.States (1799), 268, 68);
+ Add_Goto (Table.States (1799), 271, 69);
+ Add_Goto (Table.States (1799), 273, 70);
+ Add_Goto (Table.States (1799), 275, 71);
+ Add_Goto (Table.States (1799), 285, 72);
+ Add_Goto (Table.States (1799), 286, 73);
+ Add_Goto (Table.States (1799), 288, 74);
+ Add_Goto (Table.States (1799), 289, 75);
+ Add_Goto (Table.States (1799), 290, 76);
+ Add_Goto (Table.States (1799), 310, 82);
+ Add_Goto (Table.States (1799), 311, 83);
+ Add_Goto (Table.States (1799), 316, 84);
+ Add_Goto (Table.States (1799), 318, 85);
+ Add_Goto (Table.States (1799), 357, 110);
+ Add_Goto (Table.States (1799), 363, 111);
+ Add_Goto (Table.States (1799), 364, 112);
+ Add_Goto (Table.States (1799), 365, 113);
+ Add_Goto (Table.States (1799), 366, 114);
+ Add_Goto (Table.States (1799), 367, 115);
+ Add_Goto (Table.States (1799), 370, 116);
+ Add_Goto (Table.States (1799), 376, 117);
+ Add_Goto (Table.States (1799), 378, 118);
+ Add_Goto (Table.States (1799), 379, 119);
+ Add_Goto (Table.States (1799), 382, 120);
+ Add_Goto (Table.States (1799), 401, 133);
+ Add_Goto (Table.States (1799), 461, 332);
+ Add_Goto (Table.States (1799), 462, 144);
+ Table.States (1799).Kernel := To_Vector ((0 => ((269, 0), 43, 2,
(32767, 0), 0)));
+ Table.States (1799).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ end Subr_63;
+ procedure Subr_64
+ is begin
+ Table.States (1800).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (1800), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (271, 3), 7);
+ Table.States (1800).Kernel := To_Vector ((0 => ((271, 3), 108,
0, (271, 3), 7)));
+ Table.States (1800).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (271, 3), 7)));
+ Table.States (1801).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1801), 66, (271, 0), 2029);
+ Table.States (1801).Kernel := To_Vector ((0 => ((271, 0), 259,
3, (32767, 0), 0)));
+ Table.States (1801).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (271, 0), 66, 2029)));
+ Table.States (1802).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1802), 108, (271, 1), 2030);
+ Table.States (1802).Kernel := To_Vector ((0 => ((271, 1), 42, 1,
(32767, 0), 0)));
+ Table.States (1802).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (271, 1), 108, 2030)));
+ Table.States (1803).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1803), 86, (252, 0), 33);
+ Add_Action (Table.States (1803), 90, (268, 0), 34);
+ Add_Action (Table.States (1803), 116, (196, 0), 146);
+ Add_Action (Table.States (1803), 117, (196, 1), 37);
+ Add_Action (Table.States (1803), 118, (195, 6), 38);
+ Table.States (1803).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (1803), 195, 2031);
+ Add_Goto (Table.States (1803), 196, 148);
+ Add_Goto (Table.States (1803), 197, 54);
+ Add_Goto (Table.States (1803), 198, 55);
+ Add_Goto (Table.States (1803), 199, 56);
+ Add_Goto (Table.States (1803), 201, 57);
+ Add_Goto (Table.States (1803), 251, 58);
+ Add_Goto (Table.States (1803), 252, 59);
+ Add_Goto (Table.States (1803), 255, 60);
+ Add_Goto (Table.States (1803), 268, 68);
+ Add_Goto (Table.States (1803), 311, 83);
+ Table.States (1803).Kernel := To_Vector ((((300, 0), 187, 3,
(32767, 0), 0), ((300, 1), 187, 1,
+ (32767, 0), 0)));
+ Table.States (1803).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1804).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1804), 85, (198, 0), 281);
+ Add_Action (Table.States (1804), 87, Reduce, (300, 3), 5);
+ Add_Action (Table.States (1804), 94, (134, 0), 282);
+ Add_Action (Table.States (1804), 96, (197, 0), 283);
+ Add_Action (Table.States (1804), 108, Reduce, (300, 3), 5);
+ Add_Action (Table.States (1804), 113, (121, 0), 285);
+ Add_Action (Table.States (1804), 114, (121, 1), 286);
+ Table.States (1804).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1804), 121, 287);
+ Add_Goto (Table.States (1804), 134, 2032);
+ Add_Goto (Table.States (1804), 313, 289);
+ Table.States (1804).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((300, 2), 195, 2, (32767, 0), 0),
((300, 3), 195, 0, (300, 3), 5), ((311,
+ 0), 195, 3, (32767, 0), 0)));
+ Table.States (1804).Minimal_Complete_Actions := To_Vector
(((Shift, (134, 0), 94, 282), (Reduce, (300, 3),
+ 5)));
+ Table.States (1805).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1805), 85, (198, 0), 281);
+ Add_Action (Table.States (1805), 87, Reduce, (300, 5), 5);
+ Add_Action (Table.States (1805), 94, (134, 0), 282);
+ Add_Action (Table.States (1805), 96, (197, 0), 283);
+ Add_Action (Table.States (1805), 108, Reduce, (300, 5), 5);
+ Add_Action (Table.States (1805), 113, (121, 0), 285);
+ Add_Action (Table.States (1805), 114, (121, 1), 286);
+ Table.States (1805).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1805), 121, 287);
+ Add_Goto (Table.States (1805), 134, 2033);
+ Add_Goto (Table.States (1805), 313, 289);
+ Table.States (1805).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((300, 4), 195, 2, (32767, 0), 0),
((300, 5), 195, 0, (300, 5), 5), ((311,
+ 0), 195, 3, (32767, 0), 0)));
+ Table.States (1805).Minimal_Complete_Actions := To_Vector
(((Shift, (134, 0), 94, 282), (Reduce, (300, 5),
+ 5)));
+ Table.States (1806).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1806), (87, 108), (300, 6), 5);
+ Table.States (1806).Kernel := To_Vector ((0 => ((300, 6), 134,
0, (300, 6), 5)));
+ Table.States (1806).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (300, 6), 5)));
+ Table.States (1807).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1807), 36, Reduce, (280, 1), 6);
+ Add_Action (Table.States (1807), 50, Reduce, (280, 1), 6);
+ Add_Action (Table.States (1807), 63, (279, 0), 1104);
+ Add_Action (Table.States (1807), 85, (198, 0), 281);
+ Add_Action (Table.States (1807), 96, (197, 0), 283);
+ Add_Action (Table.States (1807), 99, Reduce, (280, 1), 6);
+ Add_Action (Table.States (1807), 113, (121, 0), 285);
+ Add_Action (Table.States (1807), 114, (121, 1), 286);
+ Table.States (1807).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1807), 121, 287);
+ Add_Goto (Table.States (1807), 279, 2034);
+ Add_Goto (Table.States (1807), 313, 289);
+ Table.States (1807).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((280, 0), 195, 2, (32767, 0), 0),
((280, 1), 195, 0, (280, 1), 6), ((311,
+ 0), 195, 3, (32767, 0), 0)));
+ Table.States (1807).Minimal_Complete_Actions := To_Vector
(((Shift, (279, 0), 63, 1104), (Reduce, (280,
+ 1), 6)));
+ Table.States (1808).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1808), (36, 50, 99), (280, 2), 6);
+ Table.States (1808).Kernel := To_Vector ((0 => ((280, 2), 279,
0, (280, 2), 6)));
+ Table.States (1808).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (280, 2), 6)));
+ Table.States (1809).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1809), 36, Reduce, (280, 9), 6);
+ Add_Action (Table.States (1809), 50, Reduce, (280, 9), 6);
+ Add_Action (Table.States (1809), 63, (279, 0), 1104);
+ Add_Action (Table.States (1809), 85, (198, 0), 281);
+ Add_Action (Table.States (1809), 96, (197, 0), 283);
+ Add_Action (Table.States (1809), 99, Reduce, (280, 9), 6);
+ Add_Action (Table.States (1809), 113, (121, 0), 285);
+ Add_Action (Table.States (1809), 114, (121, 1), 286);
+ Table.States (1809).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1809), 121, 287);
+ Add_Goto (Table.States (1809), 279, 2035);
+ Add_Goto (Table.States (1809), 313, 289);
+ Table.States (1809).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((280, 8), 195, 2, (32767, 0), 0),
((280, 9), 195, 0, (280, 9), 6), ((311,
+ 0), 195, 3, (32767, 0), 0)));
+ Table.States (1809).Minimal_Complete_Actions := To_Vector
(((Shift, (279, 0), 63, 1104), (Reduce, (280,
+ 9), 6)));
+ Table.States (1810).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1810), (36, 50, 99), (280, 10), 6);
+ Table.States (1810).Kernel := To_Vector ((0 => ((280, 10), 279,
0, (280, 10), 6)));
+ Table.States (1810).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (280, 10), 6)));
+ Table.States (1811).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1811), 108, (455, 0), 2036);
+ Table.States (1811).Kernel := To_Vector ((0 => ((455, 0), 227,
1, (32767, 0), 0)));
+ Table.States (1811).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (455, 0), 108, 2036)));
+ Table.States (1812).Action_List.Set_Capacity (44);
+ Add_Action (Table.States (1812), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 63, 64, 65, 66, 77,
81, 83, 84, 86, 90, 105, 116, 117, 118,
+ 119), (440, 7), 7);
+ Table.States (1812).Kernel := To_Vector ((0 => ((440, 7), 108,
0, (440, 7), 7)));
+ Table.States (1812).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (440, 7), 7)));
+ Table.States (1813).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1813), 85, (198, 0), 281);
+ Add_Action (Table.States (1813), 96, (197, 0), 283);
+ Add_Action (Table.States (1813), 108, (440, 6), 2037);
+ Add_Action (Table.States (1813), 113, (121, 0), 285);
+ Add_Action (Table.States (1813), 114, (121, 1), 286);
+ Table.States (1813).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1813), 121, 287);
+ Add_Goto (Table.States (1813), 313, 289);
+ Table.States (1813).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((440, 6), 195, 1, (32767, 0), 0)));
+ Table.States (1813).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (440, 6), 108, 2037)));
+ Table.States (1814).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1814), (1 => 74), (442, 0), 1);
+ Table.States (1814).Kernel := To_Vector ((0 => ((442, 0), 227,
0, (442, 0), 1)));
+ Table.States (1814).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (442, 0), 1)));
+ Table.States (1815).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1815), 74, (441, 0), 2038);
+ Table.States (1815).Kernel := To_Vector ((0 => ((441, 0), 442,
5, (32767, 0), 0)));
+ Table.States (1815).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (441, 0), 74, 2038)));
+ Table.States (1816).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1816), 86, (252, 0), 33);
+ Add_Action (Table.States (1816), 90, (268, 0), 34);
+ Add_Action (Table.States (1816), 108, (440, 3), 2039);
+ Add_Action (Table.States (1816), 116, (196, 0), 146);
+ Add_Action (Table.States (1816), 117, (196, 1), 37);
+ Add_Action (Table.States (1816), 118, (195, 6), 38);
+ Table.States (1816).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (1816), 195, 2040);
+ Add_Goto (Table.States (1816), 196, 148);
+ Add_Goto (Table.States (1816), 197, 54);
+ Add_Goto (Table.States (1816), 198, 55);
+ Add_Goto (Table.States (1816), 199, 56);
+ Add_Goto (Table.States (1816), 201, 57);
+ Add_Goto (Table.States (1816), 251, 58);
+ Add_Goto (Table.States (1816), 252, 59);
+ Add_Goto (Table.States (1816), 255, 60);
+ Add_Goto (Table.States (1816), 268, 68);
+ Add_Goto (Table.States (1816), 311, 83);
+ Table.States (1816).Kernel := To_Vector ((((440, 2), 67, 2,
(32767, 0), 0), ((440, 3), 67, 1, (32767,
+ 0), 0)));
+ Table.States (1816).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (440, 3), 108, 2039)));
+ Table.States (1817).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1817), 67, (440, 0), 2041);
+ Table.States (1817).Kernel := To_Vector ((((440, 0), 66, 3,
(32767, 0), 0), ((440, 1), 66, 2, (32767,
+ 0), 0)));
+ Table.States (1817).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (440, 0), 67, 2041)));
+ Table.States (1818).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1818), 86, (252, 0), 33);
+ Add_Action (Table.States (1818), 90, (268, 0), 34);
+ Add_Action (Table.States (1818), 108, (440, 5), 2042);
+ Add_Action (Table.States (1818), 116, (196, 0), 146);
+ Add_Action (Table.States (1818), 117, (196, 1), 37);
+ Add_Action (Table.States (1818), 118, (195, 6), 38);
+ Table.States (1818).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (1818), 195, 2043);
+ Add_Goto (Table.States (1818), 196, 148);
+ Add_Goto (Table.States (1818), 197, 54);
+ Add_Goto (Table.States (1818), 198, 55);
+ Add_Goto (Table.States (1818), 199, 56);
+ Add_Goto (Table.States (1818), 201, 57);
+ Add_Goto (Table.States (1818), 251, 58);
+ Add_Goto (Table.States (1818), 252, 59);
+ Add_Goto (Table.States (1818), 255, 60);
+ Add_Goto (Table.States (1818), 268, 68);
+ Add_Goto (Table.States (1818), 311, 83);
+ Table.States (1818).Kernel := To_Vector ((((440, 4), 67, 2,
(32767, 0), 0), ((440, 5), 67, 1, (32767,
+ 0), 0)));
+ Table.States (1818).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (440, 5), 108, 2042)));
+ Table.States (1819).Action_List.Set_Capacity (44);
+ Add_Action (Table.States (1819), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 63, 64, 65, 66, 77,
81, 83, 84, 86, 90, 105, 116, 117, 118,
+ 119), (437, 0), 7);
+ Table.States (1819).Kernel := To_Vector ((0 => ((437, 0), 108,
0, (437, 0), 7)));
+ Table.States (1819).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (437, 0), 7)));
+ Table.States (1820).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1820), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (408, 8), 7);
+ Table.States (1820).Kernel := To_Vector ((0 => ((408, 8), 108,
0, (408, 8), 7)));
+ Table.States (1820).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (408, 8), 7)));
+ Table.States (1821).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1821), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (408, 4), 7);
+ Table.States (1821).Kernel := To_Vector ((0 => ((408, 4), 108,
0, (408, 4), 7)));
+ Table.States (1821).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (408, 4), 7)));
+ Table.States (1822).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1822), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (392, 0), 7);
+ Table.States (1822).Kernel := To_Vector ((0 => ((392, 0), 108,
0, (392, 0), 7)));
+ Table.States (1822).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (392, 0), 7)));
+ Table.States (1823).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1823), 51, (362, 0), 2044);
+ Add_Action (Table.States (1823), 116, (136, 0), 207);
+ Table.States (1823).Goto_List.Set_Capacity (4);
+ Add_Goto (Table.States (1823), 136, 688);
+ Add_Goto (Table.States (1823), 298, 467);
+ Add_Goto (Table.States (1823), 300, 468);
+ Add_Goto (Table.States (1823), 362, 2045);
+ Table.States (1823).Kernel := To_Vector ((((299, 0), 85, 4,
(32767, 0), 0), ((360, 0), 85, 5, (32767,
+ 0), 0)));
+ Table.States (1823).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (136, 0), 116, 207)));
+ Table.States (1824).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1824), (61, 63), (360, 1), 1);
+ Table.States (1824).Kernel := To_Vector ((0 => ((360, 1), 295,
0, (360, 1), 1)));
+ Table.States (1824).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (360, 1), 1)));
+ Table.States (1825).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1825), 61, (434, 0), 299);
+ Add_Action (Table.States (1825), 63, (361, 0), 2046);
+ Table.States (1825).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1825), 361, 2047);
+ Add_Goto (Table.States (1825), 434, 2048);
+ Table.States (1825).Kernel := To_Vector ((((359, 0), 360, 10,
(32767, 0), 0), ((359, 1), 360, 8,
+ (32767, 0), 0)));
+ Table.States (1825).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (361, 0), 63, 2046)));
+ Table.States (1826).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1826), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (354, 3), 7);
+ Table.States (1826).Kernel := To_Vector ((0 => ((354, 3), 108,
0, (354, 3), 7)));
+ Table.States (1826).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (354, 3), 7)));
+ Table.States (1827).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1827), 108, (354, 2), 2049);
+ Table.States (1827).Kernel := To_Vector ((0 => ((354, 2), 284,
1, (32767, 0), 0)));
+ Table.States (1827).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (354, 2), 108, 2049)));
+ Table.States (1828).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1828), 108, (354, 1), 2050);
+ Table.States (1828).Kernel := To_Vector ((0 => ((354, 1), 284,
1, (32767, 0), 0)));
+ Table.States (1828).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (354, 1), 108, 2050)));
+ Table.States (1829).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1829), 108, Reduce, (284, 1), 0);
+ Add_Action (Table.States (1829), 116, (284, 0), 1312);
+ Table.States (1829).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1829), 284, 2051);
+ Table.States (1829).Kernel := To_Vector ((0 => ((354, 0), 66, 1,
(32767, 0), 0)));
+ Table.States (1829).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (284, 1), 0)));
+ Table.States (1830).Action_List.Set_Capacity (9);
+ Add_Action (Table.States (1830), 21, (356, 4), 8);
+ Add_Action (Table.States (1830), 25, (329, 1), 10);
+ Add_Action (Table.States (1830), 27, (350, 6), 781);
+ Add_Action (Table.States (1830), 51, (437, 0), 221);
+ Add_Action (Table.States (1830), 52, (329, 0), 21);
+ Add_Action (Table.States (1830), 53, (294, 0), 314);
+ Add_Action (Table.States (1830), 54, (293, 0), 315);
+ Add_Action (Table.States (1830), 66, (350, 10), 782);
+ Add_Action (Table.States (1830), 84, (124, 0), 32);
+ Table.States (1830).Goto_List.Set_Capacity (15);
+ Add_Goto (Table.States (1830), 124, 784);
+ Add_Goto (Table.States (1830), 291, 785);
+ Add_Goto (Table.States (1830), 292, 786);
+ Add_Goto (Table.States (1830), 293, 317);
+ Add_Goto (Table.States (1830), 294, 318);
+ Add_Goto (Table.States (1830), 329, 787);
+ Add_Goto (Table.States (1830), 348, 788);
+ Add_Goto (Table.States (1830), 350, 2052);
+ Add_Goto (Table.States (1830), 351, 790);
+ Add_Goto (Table.States (1830), 356, 791);
+ Add_Goto (Table.States (1830), 431, 792);
+ Add_Goto (Table.States (1830), 437, 140);
+ Add_Goto (Table.States (1830), 438, 141);
+ Add_Goto (Table.States (1830), 440, 142);
+ Add_Goto (Table.States (1830), 454, 143);
+ Table.States (1830).Kernel := To_Vector ((0 => ((346, 6), 61, 2,
(32767, 0), 0)));
+ Table.States (1830).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (350, 10), 66, 782)));
+ Table.States (1831).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1831), 61, (346, 2), 2053);
+ Add_Action (Table.States (1831), 75, (182, 1), 1522);
+ Table.States (1831).Kernel := To_Vector ((((182, 1), 182, 2,
(32767, 0), 0), ((346, 2), 182, 3,
+ (32767, 0), 0)));
+ Table.States (1831).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (346, 2), 61, 2053)));
+ Table.States (1832).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1832), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (346, 3), 7);
+ Table.States (1832).Kernel := To_Vector ((0 => ((346, 3), 108,
0, (346, 3), 7)));
+ Table.States (1832).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (346, 3), 7)));
+ Table.States (1833).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1833), 86, (252, 0), 33);
+ Add_Action (Table.States (1833), 90, (268, 0), 34);
+ Add_Action (Table.States (1833), 116, (196, 0), 146);
+ Add_Action (Table.States (1833), 117, (196, 1), 37);
+ Add_Action (Table.States (1833), 118, (195, 6), 38);
+ Table.States (1833).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1833), 182, 2054);
+ Add_Goto (Table.States (1833), 195, 1152);
+ Add_Goto (Table.States (1833), 196, 148);
+ Add_Goto (Table.States (1833), 197, 54);
+ Add_Goto (Table.States (1833), 198, 55);
+ Add_Goto (Table.States (1833), 199, 56);
+ Add_Goto (Table.States (1833), 201, 57);
+ Add_Goto (Table.States (1833), 251, 58);
+ Add_Goto (Table.States (1833), 252, 59);
+ Add_Goto (Table.States (1833), 255, 60);
+ Add_Goto (Table.States (1833), 268, 68);
+ Add_Goto (Table.States (1833), 311, 83);
+ Table.States (1833).Kernel := To_Vector ((0 => ((346, 0), 76, 4,
(32767, 0), 0)));
+ Table.States (1833).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1834).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1834), 108, (346, 1), 2055);
+ Table.States (1834).Kernel := To_Vector ((0 => ((346, 1), 350,
1, (32767, 0), 0)));
+ Table.States (1834).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (346, 1), 108, 2055)));
+ Table.States (1835).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1835), 61, (346, 4), 2056);
+ Add_Action (Table.States (1835), 75, (182, 1), 1522);
+ Table.States (1835).Kernel := To_Vector ((((182, 1), 182, 2,
(32767, 0), 0), ((346, 4), 182, 3,
+ (32767, 0), 0)));
+ Table.States (1835).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (346, 4), 61, 2056)));
+ Table.States (1836).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1836), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (346, 5), 7);
+ Table.States (1836).Kernel := To_Vector ((0 => ((346, 5), 108,
0, (346, 5), 7)));
+ Table.States (1836).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (346, 5), 7)));
+ Table.States (1837).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1837), 52, (187, 0), 347);
+ Add_Action (Table.States (1837), 56, (188, 2), 514);
+ Add_Action (Table.States (1837), 86, (252, 0), 33);
+ Add_Action (Table.States (1837), 90, (268, 0), 34);
+ Add_Action (Table.States (1837), 116, (196, 0), 146);
+ Add_Action (Table.States (1837), 117, (196, 1), 37);
+ Add_Action (Table.States (1837), 118, (195, 6), 38);
+ Table.States (1837).Goto_List.Set_Capacity (14);
+ Add_Goto (Table.States (1837), 131, 2057);
+ Add_Goto (Table.States (1837), 187, 526);
+ Add_Goto (Table.States (1837), 188, 2058);
+ Add_Goto (Table.States (1837), 195, 528);
+ Add_Goto (Table.States (1837), 196, 148);
+ Add_Goto (Table.States (1837), 197, 54);
+ Add_Goto (Table.States (1837), 198, 55);
+ Add_Goto (Table.States (1837), 199, 56);
+ Add_Goto (Table.States (1837), 201, 57);
+ Add_Goto (Table.States (1837), 251, 58);
+ Add_Goto (Table.States (1837), 252, 59);
+ Add_Goto (Table.States (1837), 255, 60);
+ Add_Goto (Table.States (1837), 268, 68);
+ Add_Goto (Table.States (1837), 311, 83);
+ Table.States (1837).Kernel := To_Vector ((((161, 0), 80, 1,
(32767, 0), 0), ((161, 2), 80, 2, (32767,
+ 0), 0)));
+ Table.States (1837).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1838).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1838), (49, 61, 94, 108), (161, 1), 1);
+ Table.States (1838).Kernel := To_Vector ((0 => ((161, 1), 131,
0, (161, 1), 1)));
+ Table.States (1838).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (161, 1), 1)));
+ Table.States (1839).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1839), 61, (434, 0), 299);
+ Add_Action (Table.States (1839), 94, (134, 0), 282);
+ Add_Action (Table.States (1839), 108, (173, 3), 2059);
+ Table.States (1839).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1839), 134, 2060);
+ Add_Goto (Table.States (1839), 434, 2061);
+ Table.States (1839).Kernel := To_Vector ((((173, 0), 161, 5,
(32767, 0), 0), ((173, 1), 161, 3,
+ (32767, 0), 0), ((173, 2), 161, 3, (32767, 0), 0), ((173, 3),
161, 1, (32767, 0), 0)));
+ Table.States (1839).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (173, 3), 108, 2059)));
+ Table.States (1840).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1840), (49, 61, 94, 108), (161, 3), 1);
+ Table.States (1840).Kernel := To_Vector ((0 => ((161, 3), 188,
0, (161, 3), 1)));
+ Table.States (1840).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (161, 3), 1)));
+ end Subr_64;
+ procedure Subr_65
+ is begin
+ Table.States (1841).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1841), (1 => 108), (350, 6), 4);
+ Table.States (1841).Kernel := To_Vector ((0 => ((350, 6), 116,
0, (350, 6), 4)));
+ Table.States (1841).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (350, 6), 4)));
+ Table.States (1842).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1842), 108, (347, 2), 2062);
+ Table.States (1842).Kernel := To_Vector ((0 => ((347, 2), 350,
1, (32767, 0), 0)));
+ Table.States (1842).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (347, 2), 108, 2062)));
+ Table.States (1843).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1843), 49, Reduce, (182, 1), 3);
+ Add_Action (Table.States (1843), 61, Reduce, (182, 1), 3);
+ Add_Action (Table.States (1843), 75, Reduce, (182, 1), 3);
+ Add_Action (Table.States (1843), 85, (198, 0), 281);
+ Add_Action (Table.States (1843), 96, (197, 0), 283);
+ Add_Action (Table.States (1843), 108, Reduce, (182, 1), 3);
+ Add_Action (Table.States (1843), 113, (121, 0), 285);
+ Add_Action (Table.States (1843), 114, (121, 1), 286);
+ Table.States (1843).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1843), 121, 287);
+ Add_Goto (Table.States (1843), 313, 289);
+ Table.States (1843).Kernel := To_Vector ((((182, 1), 195, 0,
(182, 1), 3), ((197, 0), 195, 2, (32767,
+ 0), 0), ((198, 0), 195, 3, (32767, 0), 0), ((199, 0), 195,
2, (32767, 0), 0), ((201, 0), 195, 2,
+ (32767, 0), 0), ((255, 0), 195, 3, (32767, 0), 0), ((311, 0),
195, 3, (32767, 0), 0)));
+ Table.States (1843).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (182, 1), 3)));
+ Table.States (1844).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1844), (1 => 108), (350, 2), 4);
+ Table.States (1844).Kernel := To_Vector ((0 => ((350, 2), 116,
0, (350, 2), 4)));
+ Table.States (1844).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (350, 2), 4)));
+ Table.States (1845).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1845), 108, Reduce, (350, 1), 4);
+ Add_Action (Table.States (1845), 116, (350, 0), 2063);
+ Table.States (1845).Kernel := To_Vector ((((350, 0), 66, 1,
(32767, 0), 0), ((350, 1), 66, 0, (350,
+ 1), 4)));
+ Table.States (1845).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (350, 1), 4)));
+ Table.States (1846).Action_List.Set_Capacity (9);
+ Add_Action (Table.States (1846), 21, (356, 4), 8);
+ Add_Action (Table.States (1846), 25, (329, 1), 10);
+ Add_Action (Table.States (1846), 27, (350, 6), 781);
+ Add_Action (Table.States (1846), 51, (437, 0), 221);
+ Add_Action (Table.States (1846), 52, (329, 0), 21);
+ Add_Action (Table.States (1846), 53, (294, 0), 314);
+ Add_Action (Table.States (1846), 54, (293, 0), 315);
+ Add_Action (Table.States (1846), 66, (350, 10), 782);
+ Add_Action (Table.States (1846), 84, (124, 0), 32);
+ Table.States (1846).Goto_List.Set_Capacity (15);
+ Add_Goto (Table.States (1846), 124, 784);
+ Add_Goto (Table.States (1846), 291, 785);
+ Add_Goto (Table.States (1846), 292, 786);
+ Add_Goto (Table.States (1846), 293, 317);
+ Add_Goto (Table.States (1846), 294, 318);
+ Add_Goto (Table.States (1846), 329, 787);
+ Add_Goto (Table.States (1846), 348, 788);
+ Add_Goto (Table.States (1846), 350, 2064);
+ Add_Goto (Table.States (1846), 351, 790);
+ Add_Goto (Table.States (1846), 356, 791);
+ Add_Goto (Table.States (1846), 431, 792);
+ Add_Goto (Table.States (1846), 437, 140);
+ Add_Goto (Table.States (1846), 438, 141);
+ Add_Goto (Table.States (1846), 440, 142);
+ Add_Goto (Table.States (1846), 454, 143);
+ Table.States (1846).Kernel := To_Vector ((0 => ((347, 0), 61, 2,
(32767, 0), 0)));
+ Table.States (1846).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (350, 10), 66, 782)));
+ Table.States (1847).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1847), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (391, 0), 7);
+ Table.States (1847).Kernel := To_Vector ((0 => ((391, 0), 108,
0, (391, 0), 7)));
+ Table.States (1847).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (391, 0), 7)));
+ Table.States (1848).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1848), 66, (345, 1), 2065);
+ Table.States (1848).Kernel := To_Vector ((0 => ((345, 1), 396,
2, (32767, 0), 0)));
+ Table.States (1848).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (345, 1), 66, 2065)));
+ Table.States (1849).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (1849), 12, (401, 0), 1);
+ Add_Action (Table.States (1849), 15, (370, 0), 3);
+ Add_Action (Table.States (1849), 17, (365, 0), 4);
+ Add_Action (Table.States (1849), 18, (382, 0), 5);
+ Add_Action (Table.States (1849), 19, (363, 0), 6);
+ Add_Action (Table.States (1849), 20, (357, 0), 7);
+ Add_Action (Table.States (1849), 30, (316, 0), 13);
+ Add_Action (Table.States (1849), 31, (290, 0), 14);
+ Add_Action (Table.States (1849), 32, (289, 0), 15);
+ Add_Action (Table.States (1849), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1849), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1849), 37, (288, 0), 17);
+ Add_Conflict (Table.States (1849), 37, (285, 1), 0);
+ Add_Action (Table.States (1849), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1849), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1849), 42, (271, 0), 18);
+ Add_Action (Table.States (1849), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (1849), 64, (273, 0), 27);
+ Add_Action (Table.States (1849), 65, (264, 0), 28);
+ Add_Action (Table.States (1849), 84, (124, 0), 32);
+ Add_Action (Table.States (1849), 86, (252, 0), 33);
+ Add_Action (Table.States (1849), 90, (268, 0), 34);
+ Add_Action (Table.States (1849), 105, (265, 0), 35);
+ Add_Action (Table.States (1849), 116, (196, 0), 146);
+ Add_Action (Table.States (1849), 117, (196, 1), 37);
+ Add_Action (Table.States (1849), 118, (195, 6), 38);
+ Table.States (1849).Goto_List.Set_Capacity (46);
+ Add_Goto (Table.States (1849), 124, 39);
+ Add_Goto (Table.States (1849), 195, 52);
+ Add_Goto (Table.States (1849), 196, 53);
+ Add_Goto (Table.States (1849), 197, 54);
+ Add_Goto (Table.States (1849), 198, 55);
+ Add_Goto (Table.States (1849), 199, 56);
+ Add_Goto (Table.States (1849), 201, 57);
+ Add_Goto (Table.States (1849), 251, 58);
+ Add_Goto (Table.States (1849), 252, 59);
+ Add_Goto (Table.States (1849), 255, 60);
+ Add_Goto (Table.States (1849), 259, 452);
+ Add_Goto (Table.States (1849), 261, 331);
+ Add_Goto (Table.States (1849), 262, 62);
+ Add_Goto (Table.States (1849), 263, 63);
+ Add_Goto (Table.States (1849), 264, 64);
+ Add_Goto (Table.States (1849), 265, 65);
+ Add_Goto (Table.States (1849), 266, 66);
+ Add_Goto (Table.States (1849), 267, 67);
+ Add_Goto (Table.States (1849), 268, 68);
+ Add_Goto (Table.States (1849), 271, 69);
+ Add_Goto (Table.States (1849), 273, 70);
+ Add_Goto (Table.States (1849), 275, 71);
+ Add_Goto (Table.States (1849), 285, 72);
+ Add_Goto (Table.States (1849), 286, 73);
+ Add_Goto (Table.States (1849), 288, 74);
+ Add_Goto (Table.States (1849), 289, 75);
+ Add_Goto (Table.States (1849), 290, 76);
+ Add_Goto (Table.States (1849), 310, 82);
+ Add_Goto (Table.States (1849), 311, 83);
+ Add_Goto (Table.States (1849), 316, 84);
+ Add_Goto (Table.States (1849), 318, 85);
+ Add_Goto (Table.States (1849), 357, 110);
+ Add_Goto (Table.States (1849), 363, 111);
+ Add_Goto (Table.States (1849), 364, 112);
+ Add_Goto (Table.States (1849), 365, 113);
+ Add_Goto (Table.States (1849), 366, 114);
+ Add_Goto (Table.States (1849), 367, 115);
+ Add_Goto (Table.States (1849), 370, 116);
+ Add_Goto (Table.States (1849), 376, 117);
+ Add_Goto (Table.States (1849), 378, 118);
+ Add_Goto (Table.States (1849), 379, 119);
+ Add_Goto (Table.States (1849), 382, 120);
+ Add_Goto (Table.States (1849), 396, 2066);
+ Add_Goto (Table.States (1849), 401, 133);
+ Add_Goto (Table.States (1849), 461, 332);
+ Add_Goto (Table.States (1849), 462, 144);
+ Table.States (1849).Kernel := To_Vector ((0 => ((345, 0), 38, 4,
(32767, 0), 0)));
+ Table.States (1849).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ Table.States (1850).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1850), 21, (356, 4), 8);
+ Add_Action (Table.States (1850), 25, (329, 1), 10);
+ Add_Action (Table.States (1850), 51, (437, 0), 221);
+ Add_Action (Table.States (1850), 52, (329, 0), 21);
+ Table.States (1850).Goto_List.Set_Capacity (10);
+ Add_Goto (Table.States (1850), 329, 801);
+ Add_Goto (Table.States (1850), 342, 802);
+ Add_Goto (Table.States (1850), 343, 2067);
+ Add_Goto (Table.States (1850), 344, 804);
+ Add_Goto (Table.States (1850), 356, 805);
+ Add_Goto (Table.States (1850), 431, 806);
+ Add_Goto (Table.States (1850), 437, 140);
+ Add_Goto (Table.States (1850), 438, 141);
+ Add_Goto (Table.States (1850), 440, 142);
+ Add_Goto (Table.States (1850), 454, 143);
+ Table.States (1850).Kernel := To_Vector ((0 => ((340, 9), 61, 5,
(32767, 0), 0)));
+ Table.States (1850).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (356, 4), 21, 8)));
+ Table.States (1851).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1851), 61, (340, 3), 2068);
+ Add_Action (Table.States (1851), 75, (182, 1), 1522);
+ Table.States (1851).Kernel := To_Vector ((((182, 1), 182, 2,
(32767, 0), 0), ((340, 3), 182, 6,
+ (32767, 0), 0)));
+ Table.States (1851).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (340, 3), 61, 2068)));
+ Table.States (1852).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1852), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (340, 4), 7);
+ Table.States (1852).Kernel := To_Vector ((0 => ((340, 4), 108,
0, (340, 4), 7)));
+ Table.States (1852).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (340, 4), 7)));
+ Table.States (1853).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1853), 86, (252, 0), 33);
+ Add_Action (Table.States (1853), 90, (268, 0), 34);
+ Add_Action (Table.States (1853), 116, (196, 0), 146);
+ Add_Action (Table.States (1853), 117, (196, 1), 37);
+ Add_Action (Table.States (1853), 118, (195, 6), 38);
+ Table.States (1853).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1853), 182, 2069);
+ Add_Goto (Table.States (1853), 195, 1152);
+ Add_Goto (Table.States (1853), 196, 148);
+ Add_Goto (Table.States (1853), 197, 54);
+ Add_Goto (Table.States (1853), 198, 55);
+ Add_Goto (Table.States (1853), 199, 56);
+ Add_Goto (Table.States (1853), 201, 57);
+ Add_Goto (Table.States (1853), 251, 58);
+ Add_Goto (Table.States (1853), 252, 59);
+ Add_Goto (Table.States (1853), 255, 60);
+ Add_Goto (Table.States (1853), 268, 68);
+ Add_Goto (Table.States (1853), 311, 83);
+ Table.States (1853).Kernel := To_Vector ((0 => ((340, 0), 76, 7,
(32767, 0), 0)));
+ Table.States (1853).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1854).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1854), 108, (340, 1), 2070);
+ Table.States (1854).Kernel := To_Vector ((0 => ((340, 1), 343,
1, (32767, 0), 0)));
+ Table.States (1854).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (340, 1), 108, 2070)));
+ Table.States (1855).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1855), 61, (340, 6), 2071);
+ Add_Action (Table.States (1855), 75, (182, 1), 1522);
+ Table.States (1855).Kernel := To_Vector ((((182, 1), 182, 2,
(32767, 0), 0), ((340, 6), 182, 6,
+ (32767, 0), 0)));
+ Table.States (1855).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (340, 6), 61, 2071)));
+ Table.States (1856).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1856), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (340, 7), 7);
+ Table.States (1856).Kernel := To_Vector ((0 => ((340, 7), 108,
0, (340, 7), 7)));
+ Table.States (1856).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (340, 7), 7)));
+ Table.States (1857).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1857), 108, (341, 3), 2072);
+ Table.States (1857).Kernel := To_Vector ((0 => ((341, 3), 343,
1, (32767, 0), 0)));
+ Table.States (1857).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (341, 3), 108, 2072)));
+ Table.States (1858).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1858), 108, Reduce, (284, 1), 0);
+ Add_Action (Table.States (1858), 116, (284, 0), 1312);
+ Table.States (1858).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1858), 284, 2073);
+ Table.States (1858).Kernel := To_Vector ((0 => ((343, 0), 66, 0,
(284, 1), 0)));
+ Table.States (1858).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (284, 1), 0)));
+ Table.States (1859).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1859), 21, (356, 4), 8);
+ Add_Action (Table.States (1859), 25, (329, 1), 10);
+ Add_Action (Table.States (1859), 51, (437, 0), 221);
+ Add_Action (Table.States (1859), 52, (329, 0), 21);
+ Table.States (1859).Goto_List.Set_Capacity (10);
+ Add_Goto (Table.States (1859), 329, 801);
+ Add_Goto (Table.States (1859), 342, 802);
+ Add_Goto (Table.States (1859), 343, 2074);
+ Add_Goto (Table.States (1859), 344, 804);
+ Add_Goto (Table.States (1859), 356, 805);
+ Add_Goto (Table.States (1859), 431, 806);
+ Add_Goto (Table.States (1859), 437, 140);
+ Add_Goto (Table.States (1859), 438, 141);
+ Add_Goto (Table.States (1859), 440, 142);
+ Add_Goto (Table.States (1859), 454, 143);
+ Table.States (1859).Kernel := To_Vector ((0 => ((341, 0), 61, 5,
(32767, 0), 0)));
+ Table.States (1859).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (356, 4), 21, 8)));
+ Table.States (1860).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1860), (63, 66), (274, 0), 4);
+ Table.States (1860).Kernel := To_Vector ((0 => ((274, 0), 259,
0, (274, 0), 4)));
+ Table.States (1860).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (274, 0), 4)));
+ Table.States (1861).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (1861), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (273, 0), 7);
+ Table.States (1861).Kernel := To_Vector ((0 => ((273, 0), 108,
0, (273, 0), 7)));
+ Table.States (1861).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (273, 0), 7)));
+ Table.States (1862).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1862), 49, Reduce, (181, 6), 4);
+ Add_Action (Table.States (1862), 61, Reduce, (181, 6), 4);
+ Add_Action (Table.States (1862), 75, (182, 1), 1522);
+ Add_Action (Table.States (1862), 108, Reduce, (181, 6), 4);
+ Table.States (1862).Kernel := To_Vector ((((181, 6), 182, 0,
(181, 6), 4), ((182, 1), 182, 2, (32767,
+ 0), 0)));
+ Table.States (1862).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (181, 6), 4)));
+ Table.States (1863).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1863), 27, (328, 42), 2075);
+ Table.States (1863).Kernel := To_Vector ((((328, 42), 61, 4,
(32767, 0), 0), ((328, 43), 61, 2,
+ (32767, 0), 0)));
+ Table.States (1863).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 42), 27, 2075)));
+ Table.States (1864).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1864), 86, (252, 0), 33);
+ Add_Action (Table.States (1864), 90, (268, 0), 34);
+ Add_Action (Table.States (1864), 116, (196, 0), 146);
+ Add_Action (Table.States (1864), 117, (196, 1), 37);
+ Add_Action (Table.States (1864), 118, (195, 6), 38);
+ Table.States (1864).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1864), 182, 2076);
+ Add_Goto (Table.States (1864), 195, 1152);
+ Add_Goto (Table.States (1864), 196, 148);
+ Add_Goto (Table.States (1864), 197, 54);
+ Add_Goto (Table.States (1864), 198, 55);
+ Add_Goto (Table.States (1864), 199, 56);
+ Add_Goto (Table.States (1864), 201, 57);
+ Add_Goto (Table.States (1864), 251, 58);
+ Add_Goto (Table.States (1864), 252, 59);
+ Add_Goto (Table.States (1864), 255, 60);
+ Add_Goto (Table.States (1864), 268, 68);
+ Add_Goto (Table.States (1864), 311, 83);
+ Table.States (1864).Kernel := To_Vector ((((328, 40), 75, 6,
(32767, 0), 0), ((328, 41), 75, 4,
+ (32767, 0), 0)));
+ Table.States (1864).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1865).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1865), 49, Reduce, (181, 4), 4);
+ Add_Action (Table.States (1865), 61, Reduce, (181, 4), 4);
+ Add_Action (Table.States (1865), 75, (182, 1), 1522);
+ Add_Action (Table.States (1865), 108, Reduce, (181, 4), 4);
+ Table.States (1865).Kernel := To_Vector ((((181, 4), 182, 0,
(181, 4), 4), ((182, 1), 182, 2, (32767,
+ 0), 0)));
+ Table.States (1865).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (181, 4), 4)));
+ Table.States (1866).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1866), 49, Reduce, (181, 2), 4);
+ Add_Action (Table.States (1866), 61, Reduce, (181, 2), 4);
+ Add_Action (Table.States (1866), 75, (182, 1), 1522);
+ Add_Action (Table.States (1866), 108, Reduce, (181, 2), 4);
+ Table.States (1866).Kernel := To_Vector ((((181, 2), 182, 0,
(181, 2), 4), ((182, 1), 182, 2, (32767,
+ 0), 0)));
+ Table.States (1866).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (181, 2), 4)));
+ Table.States (1867).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1867), 63, (176, 0), 2077);
+ Table.States (1867).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1867), 174, 2078);
+ Add_Goto (Table.States (1867), 176, 2079);
+ Table.States (1867).Kernel := To_Vector ((0 => ((175, 0), 82,
11, (32767, 0), 0)));
+ Table.States (1867).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (176, 0), 63, 2077)));
+ Table.States (1868).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1868), 61, Reduce, (170, 1), 4);
+ Add_Action (Table.States (1868), 108, Reduce, (170, 1), 4);
+ Add_Action (Table.States (1868), 116, (170, 0), 2080);
+ Table.States (1868).Kernel := To_Vector ((((170, 0), 67, 1,
(32767, 0), 0), ((170, 1), 67, 0, (170,
+ 1), 4)));
+ Table.States (1868).Minimal_Complete_Actions := To_Vector
(((Shift, (170, 0), 116, 2080), (Reduce, (170,
+ 1), 4)));
+ Table.States (1869).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1869), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (327, 18), 7);
+ Table.States (1869).Kernel := To_Vector ((0 => ((327, 18), 108,
0, (327, 18), 7)));
+ Table.States (1869).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (327, 18), 7)));
+ Table.States (1870).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1870), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (327, 17), 7);
+ Table.States (1870).Kernel := To_Vector ((0 => ((327, 17), 108,
0, (327, 17), 7)));
+ Table.States (1870).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (327, 17), 7)));
+ Table.States (1871).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1871), 108, (327, 16), 2081);
+ Table.States (1871).Kernel := To_Vector ((0 => ((327, 16), 434,
1, (32767, 0), 0)));
+ Table.States (1871).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (327, 16), 108, 2081)));
+ Table.States (1872).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1872), 61, Reduce, (152, 1), 4);
+ Add_Action (Table.States (1872), 74, (149, 0), 1569);
+ Add_Action (Table.States (1872), 108, Reduce, (152, 1), 4);
+ Table.States (1872).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1872), 149, 2082);
+ Table.States (1872).Kernel := To_Vector ((((152, 0), 227, 4,
(32767, 0), 0), ((152, 1), 227, 0, (152,
+ 1), 4)));
+ Table.States (1872).Minimal_Complete_Actions := To_Vector
(((Shift, (149, 0), 74, 1569), (Reduce, (152,
+ 1), 4)));
+ Table.States (1873).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1873), 97, (149, 0), 2083);
+ Table.States (1873).Kernel := To_Vector ((0 => ((149, 0), 231,
2, (32767, 0), 0)));
+ Table.States (1873).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (149, 0), 97, 2083)));
+ Table.States (1874).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1874), (61, 108), (145, 0), 4);
+ Table.States (1874).Kernel := To_Vector ((0 => ((145, 0), 231,
0, (145, 0), 4)));
+ Table.States (1874).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (145, 0), 4)));
+ Table.States (1875).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1875), 61, (434, 0), 299);
+ Add_Action (Table.States (1875), 108, (328, 47), 2084);
+ Table.States (1875).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1875), 434, 2085);
+ Table.States (1875).Kernel := To_Vector ((((328, 46), 27, 3,
(32767, 0), 0), ((328, 47), 27, 1,
+ (32767, 0), 0)));
+ Table.States (1875).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 47), 108, 2084)));
+ Table.States (1876).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1876), (61, 108), (179, 0), 2);
+ Table.States (1876).Kernel := To_Vector ((0 => ((179, 0), 170,
0, (179, 0), 2)));
+ Table.States (1876).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (179, 0), 2)));
+ Table.States (1877).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1877), 61, (179, 0), 2086);
+ Add_Action (Table.States (1877), 75, (182, 1), 1522);
+ Table.States (1877).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1877), 179, 2087);
+ Table.States (1877).Kernel := To_Vector ((((138, 9), 182, 3,
(32767, 0), 0), ((182, 1), 182, 2,
+ (32767, 0), 0), ((328, 44), 182, 5, (32767, 0), 0), ((328,
45), 182, 3, (32767, 0), 0)));
+ Table.States (1877).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (179, 0), 61, 2086)));
+ Table.States (1878).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1878), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (327, 20), 7);
+ Table.States (1878).Kernel := To_Vector ((0 => ((327, 20), 108,
0, (327, 20), 7)));
+ Table.States (1878).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (327, 20), 7)));
+ Table.States (1879).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1879), 49, Reduce, (181, 0), 4);
+ Add_Action (Table.States (1879), 61, Reduce, (181, 0), 4);
+ Add_Action (Table.States (1879), 75, (182, 1), 1522);
+ Add_Action (Table.States (1879), 108, Reduce, (181, 0), 4);
+ Table.States (1879).Kernel := To_Vector ((((181, 0), 182, 0,
(181, 0), 4), ((182, 1), 182, 2, (32767,
+ 0), 0)));
+ Table.States (1879).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (181, 0), 4)));
+ end Subr_65;
+ procedure Subr_66
+ is begin
+ Table.States (1880).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1880), 27, (328, 38), 2088);
+ Add_Action (Table.States (1880), 65, (170, 2), 821);
+ Add_Action (Table.States (1880), 67, (170, 0), 822);
+ Table.States (1880).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1880), 170, 1876);
+ Table.States (1880).Kernel := To_Vector ((((179, 0), 61, 2,
(32767, 0), 0), ((328, 38), 61, 4, (32767,
+ 0), 0), ((328, 39), 61, 2, (32767, 0), 0)));
+ Table.States (1880).Minimal_Complete_Actions := To_Vector
(((Shift, (170, 2), 65, 821), (Shift, (328, 38),
+ 27, 2088)));
+ Table.States (1881).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1881), 86, (252, 0), 33);
+ Add_Action (Table.States (1881), 90, (268, 0), 34);
+ Add_Action (Table.States (1881), 116, (196, 0), 146);
+ Add_Action (Table.States (1881), 117, (196, 1), 37);
+ Add_Action (Table.States (1881), 118, (195, 6), 38);
+ Table.States (1881).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1881), 182, 2089);
+ Add_Goto (Table.States (1881), 195, 1152);
+ Add_Goto (Table.States (1881), 196, 148);
+ Add_Goto (Table.States (1881), 197, 54);
+ Add_Goto (Table.States (1881), 198, 55);
+ Add_Goto (Table.States (1881), 199, 56);
+ Add_Goto (Table.States (1881), 201, 57);
+ Add_Goto (Table.States (1881), 251, 58);
+ Add_Goto (Table.States (1881), 252, 59);
+ Add_Goto (Table.States (1881), 255, 60);
+ Add_Goto (Table.States (1881), 268, 68);
+ Add_Goto (Table.States (1881), 311, 83);
+ Table.States (1881).Kernel := To_Vector ((((138, 6), 75, 4,
(32767, 0), 0), ((328, 36), 75, 6, (32767,
+ 0), 0), ((328, 37), 75, 4, (32767, 0), 0)));
+ Table.States (1881).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1882).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1882), (61, 108), (138, 7), 4);
+ Table.States (1882).Kernel := To_Vector ((0 => ((138, 7), 179,
0, (138, 7), 4)));
+ Table.States (1882).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (138, 7), 4)));
+ Table.States (1883).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1883), 61, (328, 30), 2090);
+ Add_Action (Table.States (1883), 75, (328, 28), 2091);
+ Table.States (1883).Kernel := To_Vector ((((328, 28), 131, 7,
(32767, 0), 0), ((328, 29), 131, 5,
+ (32767, 0), 0), ((328, 30), 131, 5, (32767, 0), 0), ((328,
31), 131, 3, (32767, 0), 0)));
+ Table.States (1883).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 30), 61, 2090)));
+ Table.States (1884).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1884), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (327, 15), 7);
+ Table.States (1884).Kernel := To_Vector ((0 => ((327, 15), 108,
0, (327, 15), 7)));
+ Table.States (1884).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (327, 15), 7)));
+ Table.States (1885).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1885), 108, (327, 14), 2092);
+ Table.States (1885).Kernel := To_Vector ((0 => ((327, 14), 434,
1, (32767, 0), 0)));
+ Table.States (1885).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (327, 14), 108, 2092)));
+ Table.States (1886).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1886), 61, (434, 0), 299);
+ Add_Action (Table.States (1886), 108, (327, 13), 2093);
+ Table.States (1886).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1886), 434, 2094);
+ Table.States (1886).Kernel := To_Vector ((((327, 12), 27, 3,
(32767, 0), 0), ((327, 13), 27, 1,
+ (32767, 0), 0)));
+ Table.States (1886).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (327, 13), 108, 2093)));
+ Table.States (1887).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1887), (61, 108), (169, 0), 4);
+ Table.States (1887).Kernel := To_Vector ((0 => ((169, 0), 170,
0, (169, 0), 4)));
+ Table.States (1887).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (169, 0), 4)));
+ Table.States (1888).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1888), 27, (328, 34), 2095);
+ Add_Action (Table.States (1888), 65, (170, 2), 821);
+ Add_Action (Table.States (1888), 67, (170, 0), 822);
+ Table.States (1888).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1888), 170, 1876);
+ Table.States (1888).Kernel := To_Vector ((((179, 0), 61, 2,
(32767, 0), 0), ((328, 34), 61, 4, (32767,
+ 0), 0), ((328, 35), 61, 2, (32767, 0), 0)));
+ Table.States (1888).Minimal_Complete_Actions := To_Vector
(((Shift, (170, 2), 65, 821), (Shift, (328, 34),
+ 27, 2095)));
+ Table.States (1889).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1889), 86, (252, 0), 33);
+ Add_Action (Table.States (1889), 90, (268, 0), 34);
+ Add_Action (Table.States (1889), 116, (196, 0), 146);
+ Add_Action (Table.States (1889), 117, (196, 1), 37);
+ Add_Action (Table.States (1889), 118, (195, 6), 38);
+ Table.States (1889).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1889), 182, 2096);
+ Add_Goto (Table.States (1889), 195, 1152);
+ Add_Goto (Table.States (1889), 196, 148);
+ Add_Goto (Table.States (1889), 197, 54);
+ Add_Goto (Table.States (1889), 198, 55);
+ Add_Goto (Table.States (1889), 199, 56);
+ Add_Goto (Table.States (1889), 201, 57);
+ Add_Goto (Table.States (1889), 251, 58);
+ Add_Goto (Table.States (1889), 252, 59);
+ Add_Goto (Table.States (1889), 255, 60);
+ Add_Goto (Table.States (1889), 268, 68);
+ Add_Goto (Table.States (1889), 311, 83);
+ Table.States (1889).Kernel := To_Vector ((((138, 3), 75, 4,
(32767, 0), 0), ((328, 32), 75, 6, (32767,
+ 0), 0), ((328, 33), 75, 4, (32767, 0), 0)));
+ Table.States (1889).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1890).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1890), (61, 108), (138, 4), 4);
+ Table.States (1890).Kernel := To_Vector ((0 => ((138, 4), 179,
0, (138, 4), 4)));
+ Table.States (1890).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (138, 4), 4)));
+ Table.States (1891).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1891), 61, (179, 0), 2097);
+ Add_Conflict (Table.States (1891), 61, (138, 2), 4);
+ Add_Action (Table.States (1891), 75, (138, 0), 2098);
+ Add_Action (Table.States (1891), 108, Reduce, (138, 2), 4);
+ Table.States (1891).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1891), 179, 2099);
+ Table.States (1891).Kernel := To_Vector ((((138, 0), 131, 5,
(32767, 0), 0), ((138, 1), 131, 3,
+ (32767, 0), 0), ((138, 2), 131, 0, (138, 2), 4), ((328, 24),
131, 7, (32767, 0), 0), ((328, 25),
+ 131, 5, (32767, 0), 0), ((328, 26), 131, 5, (32767, 0), 0),
((328, 27), 131, 3, (32767, 0), 0)));
+ Table.States (1891).Minimal_Complete_Actions := To_Vector
(((Shift, (179, 0), 61, 2097), (Reduce, (138,
+ 2), 4)));
+ Table.States (1892).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1892), (87, 95), (141, 2), 3);
+ Table.States (1892).Kernel := To_Vector ((((141, 1), 141, 2,
(32767, 0), 0), ((141, 2), 141, 0, (141,
+ 2), 3), ((141, 2), 141, 2, (32767, 0), 0)));
+ Table.States (1892).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (141, 2), 3)));
+ Table.States (1893).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1893), (87, 95), (141, 1), 3);
+ Table.States (1893).Kernel := To_Vector ((((141, 0), 143, 0,
(141, 0), 1), ((141, 1), 143, 0, (141,
+ 1), 3)));
+ Table.States (1893).Minimal_Complete_Actions := To_Vector
(((Reduce, (141, 0), 1), (Reduce, (141, 1),
+ 3)));
+ Table.States (1894).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1894), (49, 61, 108), (183, 2), 4);
+ Table.States (1894).Kernel := To_Vector ((0 => ((183, 2), 186,
0, (183, 2), 4)));
+ Table.States (1894).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (183, 2), 4)));
+ Table.States (1895).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1895), 85, (198, 0), 281);
+ Add_Action (Table.States (1895), 87, Reduce, (168, 1), 4);
+ Add_Action (Table.States (1895), 94, (134, 0), 282);
+ Add_Action (Table.States (1895), 96, (197, 0), 283);
+ Add_Action (Table.States (1895), 108, Reduce, (168, 1), 4);
+ Add_Action (Table.States (1895), 113, (121, 0), 285);
+ Add_Action (Table.States (1895), 114, (121, 1), 286);
+ Table.States (1895).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (1895), 121, 287);
+ Add_Goto (Table.States (1895), 134, 2100);
+ Add_Goto (Table.States (1895), 313, 289);
+ Table.States (1895).Kernel := To_Vector ((((168, 0), 195, 2,
(32767, 0), 0), ((168, 1), 195, 0, (168,
+ 1), 4), ((197, 0), 195, 2, (32767, 0), 0), ((198, 0), 195,
3, (32767, 0), 0), ((199, 0), 195, 2,
+ (32767, 0), 0), ((201, 0), 195, 2, (32767, 0), 0), ((255, 0),
195, 3, (32767, 0), 0), ((311, 0),
+ 195, 3, (32767, 0), 0)));
+ Table.States (1895).Minimal_Complete_Actions := To_Vector
(((Shift, (134, 0), 94, 282), (Reduce, (168, 1),
+ 4)));
+ Table.States (1896).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1896), (87, 108), (168, 4), 4);
+ Table.States (1896).Kernel := To_Vector ((0 => ((168, 4), 134,
0, (168, 4), 4)));
+ Table.States (1896).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (168, 4), 4)));
+ Table.States (1897).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1897), (87, 108), (168, 2), 4);
+ Table.States (1897).Kernel := To_Vector ((0 => ((168, 2), 134,
0, (168, 2), 4)));
+ Table.States (1897).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (168, 2), 4)));
+ Table.States (1898).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1898), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (327, 10), 7);
+ Table.States (1898).Kernel := To_Vector ((0 => ((327, 10), 108,
0, (327, 10), 7)));
+ Table.States (1898).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (327, 10), 7)));
+ Table.States (1899).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1899), 61, (328, 18), 2101);
+ Add_Action (Table.States (1899), 75, (328, 16), 2102);
+ Table.States (1899).Kernel := To_Vector ((((328, 16), 131, 7,
(32767, 0), 0), ((328, 17), 131, 5,
+ (32767, 0), 0), ((328, 18), 131, 5, (32767, 0), 0), ((328,
19), 131, 3, (32767, 0), 0)));
+ Table.States (1899).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 18), 61, 2101)));
+ Table.States (1900).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1900), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (327, 7), 7);
+ Table.States (1900).Kernel := To_Vector ((0 => ((327, 7), 108,
0, (327, 7), 7)));
+ Table.States (1900).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (327, 7), 7)));
+ Table.States (1901).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1901), 108, (327, 6), 2103);
+ Table.States (1901).Kernel := To_Vector ((0 => ((327, 6), 434,
1, (32767, 0), 0)));
+ Table.States (1901).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (327, 6), 108, 2103)));
+ Table.States (1902).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1902), 61, (434, 0), 299);
+ Add_Action (Table.States (1902), 108, (327, 5), 2104);
+ Table.States (1902).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1902), 434, 2105);
+ Table.States (1902).Kernel := To_Vector ((((327, 4), 27, 3,
(32767, 0), 0), ((327, 5), 27, 1, (32767,
+ 0), 0)));
+ Table.States (1902).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (327, 5), 108, 2104)));
+ Table.States (1903).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1903), 27, (328, 22), 2106);
+ Table.States (1903).Kernel := To_Vector ((((328, 22), 61, 4,
(32767, 0), 0), ((328, 23), 61, 2,
+ (32767, 0), 0)));
+ Table.States (1903).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 22), 27, 2106)));
+ Table.States (1904).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1904), 86, (252, 0), 33);
+ Add_Action (Table.States (1904), 90, (268, 0), 34);
+ Add_Action (Table.States (1904), 116, (196, 0), 146);
+ Add_Action (Table.States (1904), 117, (196, 1), 37);
+ Add_Action (Table.States (1904), 118, (195, 6), 38);
+ Table.States (1904).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1904), 182, 2107);
+ Add_Goto (Table.States (1904), 195, 1152);
+ Add_Goto (Table.States (1904), 196, 148);
+ Add_Goto (Table.States (1904), 197, 54);
+ Add_Goto (Table.States (1904), 198, 55);
+ Add_Goto (Table.States (1904), 199, 56);
+ Add_Goto (Table.States (1904), 201, 57);
+ Add_Goto (Table.States (1904), 251, 58);
+ Add_Goto (Table.States (1904), 252, 59);
+ Add_Goto (Table.States (1904), 255, 60);
+ Add_Goto (Table.States (1904), 268, 68);
+ Add_Goto (Table.States (1904), 311, 83);
+ Table.States (1904).Kernel := To_Vector ((((328, 20), 75, 6,
(32767, 0), 0), ((328, 21), 75, 4,
+ (32767, 0), 0)));
+ Table.States (1904).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1905).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1905), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (327, 9), 7);
+ Table.States (1905).Kernel := To_Vector ((0 => ((327, 9), 108,
0, (327, 9), 7)));
+ Table.States (1905).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (327, 9), 7)));
+ Table.States (1906).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1906), 108, (327, 8), 2108);
+ Table.States (1906).Kernel := To_Vector ((0 => ((327, 8), 434,
1, (32767, 0), 0)));
+ Table.States (1906).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (327, 8), 108, 2108)));
+ Table.States (1907).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1907), 61, (328, 14), 2109);
+ Add_Action (Table.States (1907), 75, (328, 12), 2110);
+ Table.States (1907).Kernel := To_Vector ((((328, 12), 131, 7,
(32767, 0), 0), ((328, 13), 131, 5,
+ (32767, 0), 0), ((328, 14), 131, 5, (32767, 0), 0), ((328,
15), 131, 3, (32767, 0), 0)));
+ Table.States (1907).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 14), 61, 2109)));
+ Table.States (1908).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1908), 52, (187, 0), 347);
+ Add_Action (Table.States (1908), 86, (252, 0), 33);
+ Add_Action (Table.States (1908), 90, (268, 0), 34);
+ Add_Action (Table.States (1908), 116, (196, 0), 146);
+ Add_Action (Table.States (1908), 117, (196, 1), 37);
+ Add_Action (Table.States (1908), 118, (195, 6), 38);
+ Table.States (1908).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (1908), 131, 2111);
+ Add_Goto (Table.States (1908), 187, 365);
+ Add_Goto (Table.States (1908), 195, 528);
+ Add_Goto (Table.States (1908), 196, 148);
+ Add_Goto (Table.States (1908), 197, 54);
+ Add_Goto (Table.States (1908), 198, 55);
+ Add_Goto (Table.States (1908), 199, 56);
+ Add_Goto (Table.States (1908), 201, 57);
+ Add_Goto (Table.States (1908), 251, 58);
+ Add_Goto (Table.States (1908), 252, 59);
+ Add_Goto (Table.States (1908), 255, 60);
+ Add_Goto (Table.States (1908), 268, 68);
+ Add_Goto (Table.States (1908), 311, 83);
+ Table.States (1908).Kernel := To_Vector ((((328, 4), 76, 8,
(32767, 0), 0), ((328, 5), 76, 6, (32767,
+ 0), 0), ((328, 6), 76, 6, (32767, 0), 0), ((328, 7), 76, 4,
(32767, 0), 0)));
+ Table.States (1908).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1909).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1909), 61, (434, 0), 299);
+ Add_Action (Table.States (1909), 108, (327, 3), 2112);
+ Table.States (1909).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1909), 434, 2113);
+ Table.States (1909).Kernel := To_Vector ((((327, 2), 27, 3,
(32767, 0), 0), ((327, 3), 27, 1, (32767,
+ 0), 0)));
+ Table.States (1909).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (327, 3), 108, 2112)));
+ Table.States (1910).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1910), 27, (327, 0), 2114);
+ Table.States (1910).Kernel := To_Vector ((((327, 0), 77, 4,
(32767, 0), 0), ((327, 1), 77, 2, (32767,
+ 0), 0)));
+ Table.States (1910).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (327, 0), 27, 2114)));
+ Table.States (1911).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1911), 61, (328, 10), 2115);
+ Add_Action (Table.States (1911), 75, (328, 8), 2116);
+ Table.States (1911).Kernel := To_Vector ((((328, 8), 131, 7,
(32767, 0), 0), ((328, 9), 131, 5,
+ (32767, 0), 0), ((328, 10), 131, 5, (32767, 0), 0), ((328,
11), 131, 3, (32767, 0), 0)));
+ Table.States (1911).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 10), 61, 2115)));
+ Table.States (1912).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1912), 52, (187, 0), 347);
+ Add_Action (Table.States (1912), 86, (252, 0), 33);
+ Add_Action (Table.States (1912), 90, (268, 0), 34);
+ Add_Action (Table.States (1912), 116, (196, 0), 146);
+ Add_Action (Table.States (1912), 117, (196, 1), 37);
+ Add_Action (Table.States (1912), 118, (195, 6), 38);
+ Table.States (1912).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (1912), 131, 2117);
+ Add_Goto (Table.States (1912), 187, 365);
+ Add_Goto (Table.States (1912), 195, 528);
+ Add_Goto (Table.States (1912), 196, 148);
+ Add_Goto (Table.States (1912), 197, 54);
+ Add_Goto (Table.States (1912), 198, 55);
+ Add_Goto (Table.States (1912), 199, 56);
+ Add_Goto (Table.States (1912), 201, 57);
+ Add_Goto (Table.States (1912), 251, 58);
+ Add_Goto (Table.States (1912), 252, 59);
+ Add_Goto (Table.States (1912), 255, 60);
+ Add_Goto (Table.States (1912), 268, 68);
+ Add_Goto (Table.States (1912), 311, 83);
+ Table.States (1912).Kernel := To_Vector ((((328, 0), 76, 8,
(32767, 0), 0), ((328, 1), 76, 6, (32767,
+ 0), 0), ((328, 2), 76, 6, (32767, 0), 0), ((328, 3), 76, 4,
(32767, 0), 0)));
+ Table.States (1912).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1913).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1913), 65, (170, 2), 821);
+ Add_Action (Table.States (1913), 67, (170, 0), 822);
+ Table.States (1913).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1913), 170, 1876);
+ Table.States (1913).Kernel := To_Vector ((0 => ((179, 0), 61, 2,
(32767, 0), 0)));
+ Table.States (1913).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (170, 2), 65, 821)));
+ Table.States (1914).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1914), 86, (252, 0), 33);
+ Add_Action (Table.States (1914), 90, (268, 0), 34);
+ Add_Action (Table.States (1914), 116, (196, 0), 146);
+ Add_Action (Table.States (1914), 117, (196, 1), 37);
+ Add_Action (Table.States (1914), 118, (195, 6), 38);
+ Table.States (1914).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1914), 182, 2118);
+ Add_Goto (Table.States (1914), 195, 1152);
+ Add_Goto (Table.States (1914), 196, 148);
+ Add_Goto (Table.States (1914), 197, 54);
+ Add_Goto (Table.States (1914), 198, 55);
+ Add_Goto (Table.States (1914), 199, 56);
+ Add_Goto (Table.States (1914), 201, 57);
+ Add_Goto (Table.States (1914), 251, 58);
+ Add_Goto (Table.States (1914), 252, 59);
+ Add_Goto (Table.States (1914), 255, 60);
+ Add_Goto (Table.States (1914), 268, 68);
+ Add_Goto (Table.States (1914), 311, 83);
+ Table.States (1914).Kernel := To_Vector ((0 => ((138, 9), 75, 4,
(32767, 0), 0)));
+ Table.States (1914).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1915).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1915), 61, (179, 0), 1913);
+ Add_Conflict (Table.States (1915), 61, (138, 8), 3);
+ Add_Action (Table.States (1915), 75, (138, 6), 2119);
+ Add_Action (Table.States (1915), 108, Reduce, (138, 8), 3);
+ Table.States (1915).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1915), 179, 1882);
+ Table.States (1915).Kernel := To_Vector ((((138, 6), 131, 5,
(32767, 0), 0), ((138, 7), 131, 3,
+ (32767, 0), 0), ((138, 8), 131, 0, (138, 8), 3)));
+ Table.States (1915).Minimal_Complete_Actions := To_Vector
(((Shift, (179, 0), 61, 1913), (Reduce, (138,
+ 8), 3)));
+ Table.States (1916).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1916), 65, (170, 2), 821);
+ Add_Action (Table.States (1916), 67, (170, 0), 822);
+ Table.States (1916).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1916), 170, 1887);
+ Table.States (1916).Kernel := To_Vector ((0 => ((169, 0), 77, 2,
(32767, 0), 0)));
+ Table.States (1916).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (170, 2), 65, 821)));
+ Table.States (1917).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1917), 61, (179, 0), 1913);
+ Add_Conflict (Table.States (1917), 61, (138, 5), 3);
+ Add_Action (Table.States (1917), 75, (138, 3), 2120);
+ Add_Action (Table.States (1917), 108, Reduce, (138, 5), 3);
+ Table.States (1917).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1917), 179, 1890);
+ Table.States (1917).Kernel := To_Vector ((((138, 3), 131, 5,
(32767, 0), 0), ((138, 4), 131, 3,
+ (32767, 0), 0), ((138, 5), 131, 0, (138, 5), 3)));
+ Table.States (1917).Minimal_Complete_Actions := To_Vector
(((Shift, (179, 0), 61, 1913), (Reduce, (138,
+ 5), 3)));
+ Table.States (1918).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1918), 52, (187, 0), 347);
+ Add_Action (Table.States (1918), 86, (252, 0), 33);
+ Add_Action (Table.States (1918), 90, (268, 0), 34);
+ Add_Action (Table.States (1918), 116, (196, 0), 146);
+ Add_Action (Table.States (1918), 117, (196, 1), 37);
+ Add_Action (Table.States (1918), 118, (195, 6), 38);
+ Table.States (1918).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (1918), 131, 2121);
+ Add_Goto (Table.States (1918), 187, 365);
+ Add_Goto (Table.States (1918), 195, 528);
+ Add_Goto (Table.States (1918), 196, 148);
+ Add_Goto (Table.States (1918), 197, 54);
+ Add_Goto (Table.States (1918), 198, 55);
+ Add_Goto (Table.States (1918), 199, 56);
+ Add_Goto (Table.States (1918), 201, 57);
+ Add_Goto (Table.States (1918), 251, 58);
+ Add_Goto (Table.States (1918), 252, 59);
+ Add_Goto (Table.States (1918), 255, 60);
+ Add_Goto (Table.States (1918), 268, 68);
+ Add_Goto (Table.States (1918), 311, 83);
+ Table.States (1918).Kernel := To_Vector ((((138, 0), 76, 6,
(32767, 0), 0), ((138, 1), 76, 4, (32767,
+ 0), 0), ((138, 2), 76, 1, (32767, 0), 0)));
+ Table.States (1918).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1919).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1919), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (128, 0), 7);
+ Table.States (1919).Kernel := To_Vector ((0 => ((128, 0), 108,
0, (128, 0), 7)));
+ Table.States (1919).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (128, 0), 7)));
+ Table.States (1920).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1920), (113, 114), (252, 0), 7);
+ Table.States (1920).Kernel := To_Vector ((0 => ((252, 0), 88, 0,
(252, 0), 7)));
+ Table.States (1920).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (252, 0), 7)));
+ Table.States (1921).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1921), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (336, 0), 7);
+ Table.States (1921).Kernel := To_Vector ((0 => ((336, 0), 108,
0, (336, 0), 7)));
+ Table.States (1921).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (336, 0), 7)));
+ Table.States (1922).Action_List.Set_Capacity (10);
+ Add_Action (Table.States (1922), (24, 33, 47, 49, 61, 69, 82, 87,
94, 108), (188, 8), 5);
+ Table.States (1922).Kernel := To_Vector ((0 => ((188, 8), 297,
0, (188, 8), 5)));
+ Table.States (1922).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (188, 8), 5)));
+ Table.States (1923).Action_List.Set_Capacity (10);
+ Add_Action (Table.States (1923), (24, 33, 47, 49, 61, 69, 82, 87,
94, 108), (188, 4), 5);
+ Table.States (1923).Kernel := To_Vector ((0 => ((188, 4), 295,
0, (188, 4), 5)));
+ Table.States (1923).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (188, 4), 5)));
+ end Subr_66;
+ procedure Subr_67
+ is begin
+ Table.States (1924).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1924), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (335, 1), 7);
+ Table.States (1924).Kernel := To_Vector ((0 => ((335, 1), 108,
0, (335, 1), 7)));
+ Table.States (1924).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (335, 1), 7)));
+ Table.States (1925).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1925), 108, (335, 0), 2122);
+ Table.States (1925).Kernel := To_Vector ((0 => ((335, 0), 434,
1, (32767, 0), 0)));
+ Table.States (1925).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (335, 0), 108, 2122)));
+ Table.States (1926).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1926), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (335, 6), 7);
+ Table.States (1926).Kernel := To_Vector ((0 => ((335, 6), 108,
0, (335, 6), 7)));
+ Table.States (1926).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (335, 6), 7)));
+ Table.States (1927).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1927), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (335, 2), 7);
+ Table.States (1927).Kernel := To_Vector ((0 => ((335, 2), 108,
0, (335, 2), 7)));
+ Table.States (1927).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (335, 2), 7)));
+ Table.States (1928).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1928), 52, (187, 0), 347);
+ Add_Action (Table.States (1928), 56, (188, 2), 514);
+ Add_Action (Table.States (1928), 80, (161, 0), 1837);
+ Add_Action (Table.States (1928), 86, (252, 0), 33);
+ Add_Action (Table.States (1928), 90, (268, 0), 34);
+ Add_Action (Table.States (1928), 116, (196, 0), 146);
+ Add_Action (Table.States (1928), 117, (196, 1), 37);
+ Add_Action (Table.States (1928), 118, (195, 6), 38);
+ Table.States (1928).Goto_List.Set_Capacity (15);
+ Add_Goto (Table.States (1928), 131, 1838);
+ Add_Goto (Table.States (1928), 161, 2123);
+ Add_Goto (Table.States (1928), 187, 526);
+ Add_Goto (Table.States (1928), 188, 1840);
+ Add_Goto (Table.States (1928), 195, 528);
+ Add_Goto (Table.States (1928), 196, 148);
+ Add_Goto (Table.States (1928), 197, 54);
+ Add_Goto (Table.States (1928), 198, 55);
+ Add_Goto (Table.States (1928), 199, 56);
+ Add_Goto (Table.States (1928), 201, 57);
+ Add_Goto (Table.States (1928), 251, 58);
+ Add_Goto (Table.States (1928), 252, 59);
+ Add_Goto (Table.States (1928), 255, 60);
+ Add_Goto (Table.States (1928), 268, 68);
+ Add_Goto (Table.States (1928), 311, 83);
+ Table.States (1928).Kernel := To_Vector ((0 => ((156, 0), 69, 1,
(32767, 0), 0)));
+ Table.States (1928).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1929).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1929), (87, 95), (155, 2), 3);
+ Table.States (1929).Kernel := To_Vector ((((155, 1), 155, 4,
(32767, 0), 0), ((155, 2), 155, 0, (155,
+ 2), 3), ((155, 2), 155, 4, (32767, 0), 0)));
+ Table.States (1929).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (155, 2), 3)));
+ Table.States (1930).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1930), (87, 95), (155, 1), 3);
+ Table.States (1930).Kernel := To_Vector ((((155, 0), 157, 0,
(155, 0), 1), ((155, 1), 157, 0, (155,
+ 1), 3)));
+ Table.States (1930).Minimal_Complete_Actions := To_Vector
(((Reduce, (155, 0), 1), (Reduce, (155, 1),
+ 3)));
+ Table.States (1931).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1931), 74, (157, 0), 2124);
+ Add_Action (Table.States (1931), 85, (198, 0), 281);
+ Add_Action (Table.States (1931), 96, (197, 0), 283);
+ Add_Action (Table.States (1931), 113, (121, 0), 285);
+ Add_Action (Table.States (1931), 114, (121, 1), 286);
+ Table.States (1931).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1931), 121, 287);
+ Add_Goto (Table.States (1931), 313, 289);
+ Table.States (1931).Kernel := To_Vector ((((157, 0), 195, 2,
(32767, 0), 0), ((197, 0), 195, 2,
+ (32767, 0), 0), ((198, 0), 195, 3, (32767, 0), 0), ((199, 0),
195, 2, (32767, 0), 0), ((201, 0),
+ 195, 2, (32767, 0), 0), ((255, 0), 195, 3, (32767, 0), 0),
((311, 0), 195, 3, (32767, 0), 0)));
+ Table.States (1932).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1932), 52, (187, 0), 347);
+ Add_Action (Table.States (1932), 56, (188, 2), 514);
+ Add_Action (Table.States (1932), 80, (161, 0), 1837);
+ Add_Action (Table.States (1932), 86, (252, 0), 33);
+ Add_Action (Table.States (1932), 90, (268, 0), 34);
+ Add_Action (Table.States (1932), 116, (196, 0), 146);
+ Add_Action (Table.States (1932), 117, (196, 1), 37);
+ Add_Action (Table.States (1932), 118, (195, 6), 38);
+ Table.States (1932).Goto_List.Set_Capacity (15);
+ Add_Goto (Table.States (1932), 131, 1838);
+ Add_Goto (Table.States (1932), 161, 2125);
+ Add_Goto (Table.States (1932), 187, 526);
+ Add_Goto (Table.States (1932), 188, 1840);
+ Add_Goto (Table.States (1932), 195, 528);
+ Add_Goto (Table.States (1932), 196, 148);
+ Add_Goto (Table.States (1932), 197, 54);
+ Add_Goto (Table.States (1932), 198, 55);
+ Add_Goto (Table.States (1932), 199, 56);
+ Add_Goto (Table.States (1932), 201, 57);
+ Add_Goto (Table.States (1932), 251, 58);
+ Add_Goto (Table.States (1932), 252, 59);
+ Add_Goto (Table.States (1932), 255, 60);
+ Add_Goto (Table.States (1932), 268, 68);
+ Add_Goto (Table.States (1932), 311, 83);
+ Table.States (1932).Kernel := To_Vector ((0 => ((159, 0), 69, 1,
(32767, 0), 0)));
+ Table.States (1932).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1933).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1933), (87, 95), (158, 2), 3);
+ Table.States (1933).Kernel := To_Vector ((((158, 1), 158, 2,
(32767, 0), 0), ((158, 2), 158, 0, (158,
+ 2), 3), ((158, 2), 158, 2, (32767, 0), 0)));
+ Table.States (1933).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (158, 2), 3)));
+ Table.States (1934).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1934), (87, 95), (158, 1), 3);
+ Table.States (1934).Kernel := To_Vector ((((158, 0), 160, 0,
(158, 0), 1), ((158, 1), 160, 0, (158,
+ 1), 3)));
+ Table.States (1934).Minimal_Complete_Actions := To_Vector
(((Reduce, (158, 0), 1), (Reduce, (158, 1),
+ 3)));
+ Table.States (1935).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1935), (87, 95), (157, 0), 3);
+ Table.States (1935).Kernel := To_Vector ((0 => ((157, 0), 92, 0,
(157, 0), 3)));
+ Table.States (1935).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (157, 0), 3)));
+ Table.States (1936).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1936), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 8), 7);
+ Table.States (1936).Kernel := To_Vector ((0 => ((135, 8), 108,
0, (135, 8), 7)));
+ Table.States (1936).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 8), 7)));
+ Table.States (1937).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1937), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 40), 7);
+ Table.States (1937).Kernel := To_Vector ((0 => ((135, 40), 108,
0, (135, 40), 7)));
+ Table.States (1937).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 40), 7)));
+ Table.States (1938).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1938), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 24), 7);
+ Table.States (1938).Kernel := To_Vector ((0 => ((135, 24), 108,
0, (135, 24), 7)));
+ Table.States (1938).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 24), 7)));
+ Table.States (1939).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1939), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 1), 7);
+ Table.States (1939).Kernel := To_Vector ((0 => ((135, 1), 108,
0, (135, 1), 7)));
+ Table.States (1939).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 1), 7)));
+ Table.States (1940).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1940), 108, (135, 0), 2126);
+ Table.States (1940).Kernel := To_Vector ((0 => ((135, 0), 434,
1, (32767, 0), 0)));
+ Table.States (1940).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 0), 108, 2126)));
+ Table.States (1941).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1941), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 2), 7);
+ Table.States (1941).Kernel := To_Vector ((0 => ((135, 2), 108,
0, (135, 2), 7)));
+ Table.States (1941).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 2), 7)));
+ Table.States (1942).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1942), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 33), 7);
+ Table.States (1942).Kernel := To_Vector ((0 => ((135, 33), 108,
0, (135, 33), 7)));
+ Table.States (1942).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 33), 7)));
+ Table.States (1943).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1943), 108, (135, 32), 2127);
+ Table.States (1943).Kernel := To_Vector ((0 => ((135, 32), 434,
1, (32767, 0), 0)));
+ Table.States (1943).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 32), 108, 2127)));
+ Table.States (1944).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1944), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 34), 7);
+ Table.States (1944).Kernel := To_Vector ((0 => ((135, 34), 108,
0, (135, 34), 7)));
+ Table.States (1944).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 34), 7)));
+ Table.States (1945).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1945), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 17), 7);
+ Table.States (1945).Kernel := To_Vector ((0 => ((135, 17), 108,
0, (135, 17), 7)));
+ Table.States (1945).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 17), 7)));
+ Table.States (1946).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1946), 108, (135, 16), 2128);
+ Table.States (1946).Kernel := To_Vector ((0 => ((135, 16), 434,
1, (32767, 0), 0)));
+ Table.States (1946).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (135, 16), 108, 2128)));
+ Table.States (1947).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1947), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 18), 7);
+ Table.States (1947).Kernel := To_Vector ((0 => ((135, 18), 108,
0, (135, 18), 7)));
+ Table.States (1947).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 18), 7)));
+ Table.States (1948).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1948), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 4), 7);
+ Table.States (1948).Kernel := To_Vector ((0 => ((135, 4), 108,
0, (135, 4), 7)));
+ Table.States (1948).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 4), 7)));
+ Table.States (1949).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1949), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 36), 7);
+ Table.States (1949).Kernel := To_Vector ((0 => ((135, 36), 108,
0, (135, 36), 7)));
+ Table.States (1949).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 36), 7)));
+ Table.States (1950).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1950), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 20), 7);
+ Table.States (1950).Kernel := To_Vector ((0 => ((135, 20), 108,
0, (135, 20), 7)));
+ Table.States (1950).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 20), 7)));
+ Table.States (1951).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1951), (1 => 87), (254, 0), 3);
+ Table.States (1951).Kernel := To_Vector ((0 => ((254, 0), 227,
0, (254, 0), 3)));
+ Table.States (1951).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (254, 0), 3)));
+ Table.States (1952).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (1952), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (275, 1), 7);
+ Table.States (1952).Kernel := To_Vector ((0 => ((275, 1), 108,
0, (275, 1), 7)));
+ Table.States (1952).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (275, 1), 7)));
+ Table.States (1953).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1953), 108, (286, 0), 2129);
+ Table.States (1953).Kernel := To_Vector ((0 => ((286, 0), 284,
1, (32767, 0), 0)));
+ Table.States (1953).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (286, 0), 108, 2129)));
+ Table.States (1954).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1954), 108, (275, 0), 2130);
+ Table.States (1954).Kernel := To_Vector ((0 => ((275, 0), 284,
1, (32767, 0), 0)));
+ Table.States (1954).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (275, 0), 108, 2130)));
+ Table.States (1955).Action_List.Set_Capacity (20);
+ Add_Action (Table.States (1955), 12, (402, 0), 165);
+ Add_Action (Table.States (1955), 39, (249, 0), 353);
+ Add_Action (Table.States (1955), 42, (242, 0), 354);
+ Add_Action (Table.States (1955), 46, (233, 2), 167);
+ Add_Action (Table.States (1955), 51, (247, 0), 530);
+ Add_Action (Table.States (1955), 52, (187, 0), 356);
+ Add_Action (Table.States (1955), 62, (200, 2), 531);
+ Add_Action (Table.States (1955), 64, (245, 0), 358);
+ Add_Action (Table.States (1955), 65, (234, 1), 169);
+ Add_Action (Table.States (1955), 76, (256, 0), 170);
+ Add_Action (Table.States (1955), 85, (205, 4), 171);
+ Add_Action (Table.States (1955), 86, (213, 2), 172);
+ Add_Action (Table.States (1955), 90, (268, 0), 34);
+ Add_Action (Table.States (1955), 92, (315, 2), 532);
+ Add_Action (Table.States (1955), 106, (237, 1), 173);
+ Add_Action (Table.States (1955), 107, (237, 0), 174);
+ Add_Action (Table.States (1955), 115, (234, 0), 175);
+ Add_Action (Table.States (1955), 116, (196, 0), 146);
+ Add_Action (Table.States (1955), 117, (196, 1), 37);
+ Add_Action (Table.States (1955), 118, (195, 6), 360);
+ Table.States (1955).Goto_List.Set_Capacity (45);
+ Add_Goto (Table.States (1955), 131, 533);
+ Add_Goto (Table.States (1955), 140, 534);
+ Add_Goto (Table.States (1955), 163, 535);
+ Add_Goto (Table.States (1955), 187, 365);
+ Add_Goto (Table.States (1955), 195, 2131);
+ Add_Goto (Table.States (1955), 196, 367);
+ Add_Goto (Table.States (1955), 197, 54);
+ Add_Goto (Table.States (1955), 198, 55);
+ Add_Goto (Table.States (1955), 199, 56);
+ Add_Goto (Table.States (1955), 200, 368);
+ Add_Goto (Table.States (1955), 201, 57);
+ Add_Goto (Table.States (1955), 203, 369);
+ Add_Goto (Table.States (1955), 205, 177);
+ Add_Goto (Table.States (1955), 206, 178);
+ Add_Goto (Table.States (1955), 209, 536);
+ Add_Goto (Table.States (1955), 210, 179);
+ Add_Goto (Table.States (1955), 211, 180);
+ Add_Goto (Table.States (1955), 213, 181);
+ Add_Goto (Table.States (1955), 214, 182);
+ Add_Goto (Table.States (1955), 215, 183);
+ Add_Goto (Table.States (1955), 218, 184);
+ Add_Goto (Table.States (1955), 219, 185);
+ Add_Goto (Table.States (1955), 220, 186);
+ Add_Goto (Table.States (1955), 227, 537);
+ Add_Goto (Table.States (1955), 228, 188);
+ Add_Goto (Table.States (1955), 231, 378);
+ Add_Goto (Table.States (1955), 232, 190);
+ Add_Goto (Table.States (1955), 233, 191);
+ Add_Goto (Table.States (1955), 234, 192);
+ Add_Goto (Table.States (1955), 237, 193);
+ Add_Goto (Table.States (1955), 239, 538);
+ Add_Goto (Table.States (1955), 242, 380);
+ Add_Goto (Table.States (1955), 245, 381);
+ Add_Goto (Table.States (1955), 247, 539);
+ Add_Goto (Table.States (1955), 249, 540);
+ Add_Goto (Table.States (1955), 251, 58);
+ Add_Goto (Table.States (1955), 252, 59);
+ Add_Goto (Table.States (1955), 255, 60);
+ Add_Goto (Table.States (1955), 256, 194);
+ Add_Goto (Table.States (1955), 268, 68);
+ Add_Goto (Table.States (1955), 311, 83);
+ Add_Goto (Table.States (1955), 312, 541);
+ Add_Goto (Table.States (1955), 315, 542);
+ Add_Goto (Table.States (1955), 402, 195);
+ Add_Goto (Table.States (1955), 465, 196);
+ Table.States (1955).Kernel := To_Vector ((((198, 0), 85, 2,
(32767, 0), 0), ((313, 0), 85, 2, (32767,
+ 0), 0), ((313, 1), 85, 5, (32767, 0), 0), ((313, 2), 85, 8,
(32767, 0), 0), ((313, 3), 85, 4,
+ (32767, 0), 0), ((452, 0), 85, 2, (32767, 0), 0)));
+ Table.States (1955).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (1956).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1956), 87, Reduce, (446, 1), 2);
+ Add_Action (Table.States (1956), 95, (451, 1), 2132);
+ Add_Conflict (Table.States (1956), 95, (446, 1), 2);
+ Table.States (1956).Kernel := To_Vector ((((446, 1), 451, 0,
(446, 1), 2), ((451, 1), 451, 5, (32767,
+ 0), 0), ((451, 2), 451, 5, (32767, 0), 0)));
+ Table.States (1956).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (446, 1), 2)));
+ Table.States (1957).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1957), (87, 95), (451, 0), 1);
+ Table.States (1957).Kernel := To_Vector ((0 => ((451, 0), 452,
0, (451, 0), 1)));
+ Table.States (1957).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (451, 0), 1)));
+ Table.States (1958).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1958), 87, Reduce, (449, 1), 1);
+ Add_Action (Table.States (1958), 95, (306, 1), 420);
+ Add_Conflict (Table.States (1958), 95, (449, 1), 1);
+ Table.States (1958).Kernel := To_Vector ((((306, 1), 306, 2,
(32767, 0), 0), ((306, 2), 306, 2,
+ (32767, 0), 0), ((449, 1), 306, 0, (449, 1), 1)));
+ Table.States (1958).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (449, 1), 1)));
+ Table.States (1959).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1959), (87, 95), (446, 0), 2);
+ Table.States (1959).Kernel := To_Vector ((0 => ((446, 0), 449,
0, (446, 0), 2)));
+ Table.States (1959).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (446, 0), 2)));
+ Table.States (1960).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1960), (87, 95), (449, 0), 1);
+ Table.States (1960).Kernel := To_Vector ((0 => ((449, 0), 450,
0, (449, 0), 1)));
+ Table.States (1960).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (449, 0), 1)));
+ Table.States (1961).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1961), 87, Reduce, (303, 0), 2);
+ Add_Action (Table.States (1961), 95, (306, 1), 420);
+ Add_Conflict (Table.States (1961), 95, (303, 0), 2);
+ Table.States (1961).Kernel := To_Vector ((((303, 0), 306, 0,
(303, 0), 2), ((306, 1), 306, 2, (32767,
+ 0), 0), ((306, 2), 306, 2, (32767, 0), 0)));
+ Table.States (1961).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (303, 0), 2)));
+ Table.States (1962).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (1962), (63, 82, 95, 108), (302, 1), 3);
+ Table.States (1962).Kernel := To_Vector ((0 => ((302, 1), 87, 0,
(302, 1), 3)));
+ Table.States (1962).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (302, 1), 3)));
+ Table.States (1963).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1963), 25, (447, 0), 1319);
+ Add_Action (Table.States (1963), 29, (305, 2), 1320);
+ Add_Action (Table.States (1963), 33, (446, 1), 1688);
+ Add_Action (Table.States (1963), 47, (305, 0), 1322);
+ Add_Action (Table.States (1963), 50, (446, 0), 1689);
+ Table.States (1963).Goto_List.Set_Capacity (6);
+ Add_Goto (Table.States (1963), 303, 2133);
+ Add_Goto (Table.States (1963), 304, 1691);
+ Add_Goto (Table.States (1963), 305, 1328);
+ Add_Goto (Table.States (1963), 446, 1692);
+ Add_Goto (Table.States (1963), 447, 1331);
+ Add_Goto (Table.States (1963), 463, 2134);
+ Table.States (1963).Kernel := To_Vector ((((463, 1), 95, 2,
(32767, 0), 0), ((463, 2), 95, 2, (32767,
+ 0), 0)));
+ Table.States (1964).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1964), 108, (309, 3), 2135);
+ Table.States (1964).Kernel := To_Vector ((0 => ((309, 3), 308,
1, (32767, 0), 0)));
+ Table.States (1964).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (309, 3), 108, 2135)));
+ Table.States (1965).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1965), 86, (252, 0), 33);
+ Add_Action (Table.States (1965), 90, (268, 0), 34);
+ Add_Action (Table.States (1965), 108, Reduce, (308, 1), 0);
+ Add_Action (Table.States (1965), 116, (196, 0), 146);
+ Add_Action (Table.States (1965), 117, (196, 1), 37);
+ Add_Action (Table.States (1965), 118, (195, 6), 38);
+ Table.States (1965).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1965), 195, 1063);
+ Add_Goto (Table.States (1965), 196, 148);
+ Add_Goto (Table.States (1965), 197, 54);
+ Add_Goto (Table.States (1965), 198, 55);
+ Add_Goto (Table.States (1965), 199, 56);
+ Add_Goto (Table.States (1965), 201, 57);
+ Add_Goto (Table.States (1965), 251, 58);
+ Add_Goto (Table.States (1965), 252, 59);
+ Add_Goto (Table.States (1965), 255, 60);
+ Add_Goto (Table.States (1965), 268, 68);
+ Add_Goto (Table.States (1965), 308, 2136);
+ Add_Goto (Table.States (1965), 311, 83);
+ Table.States (1965).Kernel := To_Vector ((0 => ((309, 2), 66, 1,
(32767, 0), 0)));
+ Table.States (1965).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (308, 1), 0)));
+ Table.States (1966).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1966), 61, (434, 0), 299);
+ Add_Action (Table.States (1966), 108, (356, 1), 2137);
+ Table.States (1966).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (1966), 434, 2138);
+ Table.States (1966).Kernel := To_Vector ((((356, 0), 295, 3,
(32767, 0), 0), ((356, 1), 295, 1,
+ (32767, 0), 0)));
+ Table.States (1966).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (356, 1), 108, 2137)));
+ Table.States (1967).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1967), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (408, 7), 7);
+ Table.States (1967).Kernel := To_Vector ((0 => ((408, 7), 108,
0, (408, 7), 7)));
+ Table.States (1967).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (408, 7), 7)));
+ Table.States (1968).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1968), 108, (408, 6), 2139);
+ Table.States (1968).Kernel := To_Vector ((0 => ((408, 6), 434,
1, (32767, 0), 0)));
+ Table.States (1968).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (408, 6), 108, 2139)));
+ Table.States (1969).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1969), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (408, 3), 7);
+ Table.States (1969).Kernel := To_Vector ((0 => ((408, 3), 108,
0, (408, 3), 7)));
+ Table.States (1969).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (408, 3), 7)));
+ Table.States (1970).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1970), 108, (408, 2), 2140);
+ Table.States (1970).Kernel := To_Vector ((0 => ((408, 2), 434,
1, (32767, 0), 0)));
+ Table.States (1970).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (408, 2), 108, 2140)));
+ Table.States (1971).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (1971), 86, (252, 0), 33);
+ Add_Action (Table.States (1971), 90, (268, 0), 34);
+ Add_Action (Table.States (1971), 108, Reduce, (308, 1), 0);
+ Add_Action (Table.States (1971), 116, (196, 0), 146);
+ Add_Action (Table.States (1971), 117, (196, 1), 37);
+ Add_Action (Table.States (1971), 118, (195, 6), 38);
+ Table.States (1971).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1971), 195, 1063);
+ Add_Goto (Table.States (1971), 196, 148);
+ Add_Goto (Table.States (1971), 197, 54);
+ Add_Goto (Table.States (1971), 198, 55);
+ Add_Goto (Table.States (1971), 199, 56);
+ Add_Goto (Table.States (1971), 201, 57);
+ Add_Goto (Table.States (1971), 251, 58);
+ Add_Goto (Table.States (1971), 252, 59);
+ Add_Goto (Table.States (1971), 255, 60);
+ Add_Goto (Table.States (1971), 268, 68);
+ Add_Goto (Table.States (1971), 308, 2141);
+ Add_Goto (Table.States (1971), 311, 83);
+ Table.States (1971).Kernel := To_Vector ((0 => ((309, 1), 66, 1,
(32767, 0), 0)));
+ Table.States (1971).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (308, 1), 0)));
+ end Subr_67;
+ procedure Subr_68
+ is begin
+ Table.States (1972).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1972), 66, (309, 0), 2142);
+ Table.States (1972).Kernel := To_Vector ((0 => ((309, 0), 396,
2, (32767, 0), 0)));
+ Table.States (1972).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (309, 0), 66, 2142)));
+ Table.States (1973).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (1973), 21, (359, 0), 1126);
+ Add_Action (Table.States (1973), 25, (329, 1), 10);
+ Add_Action (Table.States (1973), 51, (437, 0), 221);
+ Add_Action (Table.States (1973), 52, (329, 0), 21);
+ Add_Action (Table.States (1973), 53, (294, 0), 314);
+ Add_Action (Table.States (1973), 54, (293, 0), 315);
+ Add_Action (Table.States (1973), 66, (354, 3), 1127);
+ Table.States (1973).Goto_List.Set_Capacity (16);
+ Add_Goto (Table.States (1973), 291, 1128);
+ Add_Goto (Table.States (1973), 292, 1129);
+ Add_Goto (Table.States (1973), 293, 79);
+ Add_Goto (Table.States (1973), 294, 80);
+ Add_Goto (Table.States (1973), 309, 1130);
+ Add_Goto (Table.States (1973), 320, 1131);
+ Add_Goto (Table.States (1973), 321, 1132);
+ Add_Goto (Table.States (1973), 329, 1133);
+ Add_Goto (Table.States (1973), 353, 1134);
+ Add_Goto (Table.States (1973), 355, 1135);
+ Add_Goto (Table.States (1973), 359, 1136);
+ Add_Goto (Table.States (1973), 431, 1137);
+ Add_Goto (Table.States (1973), 437, 140);
+ Add_Goto (Table.States (1973), 438, 141);
+ Add_Goto (Table.States (1973), 440, 142);
+ Add_Goto (Table.States (1973), 454, 143);
+ Table.States (1973).Kernel := To_Vector ((((354, 2), 82, 5,
(32767, 0), 0), ((354, 3), 82, 2, (32767,
+ 0), 0)));
+ Table.States (1973).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (354, 3), 66, 1127)));
+ Table.States (1974).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (1974), 22, (339, 0), 9);
+ Add_Action (Table.States (1974), 25, (329, 1), 10);
+ Add_Action (Table.States (1974), 28, (325, 0), 12);
+ Add_Action (Table.States (1974), 38, Reduce, (192, 1), 0);
+ Add_Action (Table.States (1974), 50, (332, 0), 19);
+ Add_Action (Table.States (1974), 51, (437, 0), 221);
+ Add_Action (Table.States (1974), 52, (329, 0), 21);
+ Add_Action (Table.States (1974), 53, (294, 0), 22);
+ Add_Action (Table.States (1974), 54, (293, 0), 23);
+ Add_Action (Table.States (1974), 59, (346, 0), 24);
+ Add_Action (Table.States (1974), 60, (340, 0), 25);
+ Add_Action (Table.States (1974), 81, (130, 0), 30);
+ Add_Action (Table.States (1974), 83, (128, 0), 31);
+ Add_Action (Table.States (1974), 84, (124, 0), 32);
+ Add_Action (Table.States (1974), 116, (136, 0), 223);
+ Table.States (1974).Goto_List.Set_Capacity (60);
+ Add_Goto (Table.States (1974), 124, 561);
+ Add_Goto (Table.States (1974), 126, 40);
+ Add_Goto (Table.States (1974), 127, 41);
+ Add_Goto (Table.States (1974), 128, 42);
+ Add_Goto (Table.States (1974), 130, 43);
+ Add_Goto (Table.States (1974), 135, 44);
+ Add_Goto (Table.States (1974), 136, 45);
+ Add_Goto (Table.States (1974), 137, 46);
+ Add_Goto (Table.States (1974), 180, 47);
+ Add_Goto (Table.States (1974), 189, 48);
+ Add_Goto (Table.States (1974), 190, 562);
+ Add_Goto (Table.States (1974), 191, 563);
+ Add_Goto (Table.States (1974), 192, 1161);
+ Add_Goto (Table.States (1974), 193, 50);
+ Add_Goto (Table.States (1974), 194, 51);
+ Add_Goto (Table.States (1974), 291, 77);
+ Add_Goto (Table.States (1974), 292, 78);
+ Add_Goto (Table.States (1974), 293, 79);
+ Add_Goto (Table.States (1974), 294, 80);
+ Add_Goto (Table.States (1974), 309, 81);
+ Add_Goto (Table.States (1974), 320, 86);
+ Add_Goto (Table.States (1974), 321, 87);
+ Add_Goto (Table.States (1974), 322, 88);
+ Add_Goto (Table.States (1974), 325, 89);
+ Add_Goto (Table.States (1974), 326, 90);
+ Add_Goto (Table.States (1974), 327, 91);
+ Add_Goto (Table.States (1974), 328, 92);
+ Add_Goto (Table.States (1974), 329, 225);
+ Add_Goto (Table.States (1974), 330, 94);
+ Add_Goto (Table.States (1974), 332, 95);
+ Add_Goto (Table.States (1974), 333, 96);
+ Add_Goto (Table.States (1974), 334, 97);
+ Add_Goto (Table.States (1974), 335, 98);
+ Add_Goto (Table.States (1974), 336, 99);
+ Add_Goto (Table.States (1974), 337, 100);
+ Add_Goto (Table.States (1974), 338, 101);
+ Add_Goto (Table.States (1974), 339, 102);
+ Add_Goto (Table.States (1974), 340, 103);
+ Add_Goto (Table.States (1974), 341, 104);
+ Add_Goto (Table.States (1974), 345, 105);
+ Add_Goto (Table.States (1974), 346, 106);
+ Add_Goto (Table.States (1974), 347, 107);
+ Add_Goto (Table.States (1974), 354, 108);
+ Add_Goto (Table.States (1974), 388, 126);
+ Add_Goto (Table.States (1974), 389, 127);
+ Add_Goto (Table.States (1974), 390, 128);
+ Add_Goto (Table.States (1974), 391, 129);
+ Add_Goto (Table.States (1974), 392, 130);
+ Add_Goto (Table.States (1974), 394, 132);
+ Add_Goto (Table.States (1974), 403, 134);
+ Add_Goto (Table.States (1974), 404, 135);
+ Add_Goto (Table.States (1974), 405, 136);
+ Add_Goto (Table.States (1974), 406, 137);
+ Add_Goto (Table.States (1974), 408, 138);
+ Add_Goto (Table.States (1974), 431, 139);
+ Add_Goto (Table.States (1974), 437, 140);
+ Add_Goto (Table.States (1974), 438, 141);
+ Add_Goto (Table.States (1974), 440, 142);
+ Add_Goto (Table.States (1974), 454, 143);
+ Add_Goto (Table.States (1974), 458, 565);
+ Table.States (1974).Kernel := To_Vector ((0 => ((345, 1), 82, 5,
(32767, 0), 0)));
+ Table.States (1974).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (192, 1), 0)));
+ Table.States (1975).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (1975), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (379, 0), 8);
+ Table.States (1975).Kernel := To_Vector ((0 => ((379, 0), 108,
0, (379, 0), 8)));
+ Table.States (1975).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (379, 0), 8)));
+ Table.States (1976).Action_List.Set_Capacity (39);
+ Add_Action (Table.States (1976), (33, 36, 41, 43, 44, 45, 47, 48,
49, 50, 52, 61, 63, 69, 72, 73, 74, 75,
+ 82, 87, 88, 89, 91, 94, 95, 97, 98, 99, 100, 101, 103, 104, 106,
107, 108, 109, 110, 111, 112), (162, 0),
+ 5);
+ Table.States (1976).Kernel := To_Vector ((0 => ((162, 0), 87, 0,
(162, 0), 5)));
+ Table.States (1976).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (162, 0), 5)));
+ Table.States (1977).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (1977), 46, (233, 2), 167);
+ Add_Action (Table.States (1977), 52, (187, 0), 356);
+ Add_Action (Table.States (1977), 65, (234, 1), 169);
+ Add_Action (Table.States (1977), 76, (256, 0), 170);
+ Add_Action (Table.States (1977), 85, (205, 4), 171);
+ Add_Action (Table.States (1977), 86, (213, 2), 172);
+ Add_Action (Table.States (1977), 90, (268, 0), 34);
+ Add_Action (Table.States (1977), 106, (237, 1), 173);
+ Add_Action (Table.States (1977), 107, (237, 0), 174);
+ Add_Action (Table.States (1977), 115, (234, 0), 175);
+ Add_Action (Table.States (1977), 116, (196, 0), 146);
+ Add_Action (Table.States (1977), 117, (196, 1), 37);
+ Add_Action (Table.States (1977), 118, (195, 6), 38);
+ Table.States (1977).Goto_List.Set_Capacity (34);
+ Add_Goto (Table.States (1977), 131, 533);
+ Add_Goto (Table.States (1977), 140, 534);
+ Add_Goto (Table.States (1977), 163, 2143);
+ Add_Goto (Table.States (1977), 187, 365);
+ Add_Goto (Table.States (1977), 195, 366);
+ Add_Goto (Table.States (1977), 196, 148);
+ Add_Goto (Table.States (1977), 197, 54);
+ Add_Goto (Table.States (1977), 198, 55);
+ Add_Goto (Table.States (1977), 199, 56);
+ Add_Goto (Table.States (1977), 201, 57);
+ Add_Goto (Table.States (1977), 203, 369);
+ Add_Goto (Table.States (1977), 205, 177);
+ Add_Goto (Table.States (1977), 206, 178);
+ Add_Goto (Table.States (1977), 210, 179);
+ Add_Goto (Table.States (1977), 211, 180);
+ Add_Goto (Table.States (1977), 213, 181);
+ Add_Goto (Table.States (1977), 214, 182);
+ Add_Goto (Table.States (1977), 215, 183);
+ Add_Goto (Table.States (1977), 218, 184);
+ Add_Goto (Table.States (1977), 219, 185);
+ Add_Goto (Table.States (1977), 220, 186);
+ Add_Goto (Table.States (1977), 231, 696);
+ Add_Goto (Table.States (1977), 232, 190);
+ Add_Goto (Table.States (1977), 233, 191);
+ Add_Goto (Table.States (1977), 234, 192);
+ Add_Goto (Table.States (1977), 237, 193);
+ Add_Goto (Table.States (1977), 251, 58);
+ Add_Goto (Table.States (1977), 252, 59);
+ Add_Goto (Table.States (1977), 255, 60);
+ Add_Goto (Table.States (1977), 256, 194);
+ Add_Goto (Table.States (1977), 268, 68);
+ Add_Goto (Table.States (1977), 311, 83);
+ Add_Goto (Table.States (1977), 456, 2144);
+ Add_Goto (Table.States (1977), 465, 196);
+ Table.States (1977).Kernel := To_Vector ((((456, 1), 95, 1,
(32767, 0), 0), ((456, 2), 95, 1, (32767,
+ 0), 0)));
+ Table.States (1978).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1978), (1 => 87), (242, 2), 6);
+ Table.States (1978).Kernel := To_Vector ((0 => ((242, 2), 227,
0, (242, 2), 6)));
+ Table.States (1978).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (242, 2), 6)));
+ Table.States (1979).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1979), 43, (240, 0), 2145);
+ Table.States (1979).Kernel := To_Vector ((0 => ((240, 0), 243,
2, (32767, 0), 0)));
+ Table.States (1979).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (240, 0), 43, 2145)));
+ Table.States (1980).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (1980), 12, (402, 0), 165);
+ Add_Action (Table.States (1980), 46, (233, 2), 167);
+ Add_Action (Table.States (1980), 52, (233, 3), 168);
+ Add_Action (Table.States (1980), 65, (234, 1), 169);
+ Add_Action (Table.States (1980), 76, (256, 0), 170);
+ Add_Action (Table.States (1980), 85, (205, 4), 171);
+ Add_Action (Table.States (1980), 86, (213, 2), 172);
+ Add_Action (Table.States (1980), 90, (268, 0), 34);
+ Add_Action (Table.States (1980), 106, (237, 1), 173);
+ Add_Action (Table.States (1980), 107, (237, 0), 174);
+ Add_Action (Table.States (1980), 115, (234, 0), 175);
+ Add_Action (Table.States (1980), 116, (196, 0), 146);
+ Add_Action (Table.States (1980), 117, (196, 1), 37);
+ Add_Action (Table.States (1980), 118, (195, 6), 38);
+ Table.States (1980).Goto_List.Set_Capacity (31);
+ Add_Goto (Table.States (1980), 195, 176);
+ Add_Goto (Table.States (1980), 196, 148);
+ Add_Goto (Table.States (1980), 197, 54);
+ Add_Goto (Table.States (1980), 198, 55);
+ Add_Goto (Table.States (1980), 199, 56);
+ Add_Goto (Table.States (1980), 201, 57);
+ Add_Goto (Table.States (1980), 205, 177);
+ Add_Goto (Table.States (1980), 206, 178);
+ Add_Goto (Table.States (1980), 210, 179);
+ Add_Goto (Table.States (1980), 211, 180);
+ Add_Goto (Table.States (1980), 213, 181);
+ Add_Goto (Table.States (1980), 214, 182);
+ Add_Goto (Table.States (1980), 215, 183);
+ Add_Goto (Table.States (1980), 218, 184);
+ Add_Goto (Table.States (1980), 219, 185);
+ Add_Goto (Table.States (1980), 220, 186);
+ Add_Goto (Table.States (1980), 227, 2146);
+ Add_Goto (Table.States (1980), 228, 188);
+ Add_Goto (Table.States (1980), 231, 189);
+ Add_Goto (Table.States (1980), 232, 190);
+ Add_Goto (Table.States (1980), 233, 191);
+ Add_Goto (Table.States (1980), 234, 192);
+ Add_Goto (Table.States (1980), 237, 193);
+ Add_Goto (Table.States (1980), 251, 58);
+ Add_Goto (Table.States (1980), 252, 59);
+ Add_Goto (Table.States (1980), 255, 60);
+ Add_Goto (Table.States (1980), 256, 194);
+ Add_Goto (Table.States (1980), 268, 68);
+ Add_Goto (Table.States (1980), 311, 83);
+ Add_Goto (Table.States (1980), 402, 195);
+ Add_Goto (Table.States (1980), 465, 196);
+ Table.States (1980).Kernel := To_Vector ((0 => ((242, 0), 41, 1,
(32767, 0), 0)));
+ Table.States (1980).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (1981).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1981), (41, 44, 87), (241, 1), 2);
+ Table.States (1981).Kernel := To_Vector ((0 => ((241, 1), 240,
0, (241, 1), 2)));
+ Table.States (1981).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (241, 1), 2)));
+ Table.States (1982).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (1982), 12, (402, 0), 165);
+ Add_Action (Table.States (1982), 46, (233, 2), 167);
+ Add_Action (Table.States (1982), 52, (233, 3), 168);
+ Add_Action (Table.States (1982), 65, (234, 1), 169);
+ Add_Action (Table.States (1982), 76, (256, 0), 170);
+ Add_Action (Table.States (1982), 85, (205, 4), 171);
+ Add_Action (Table.States (1982), 86, (213, 2), 172);
+ Add_Action (Table.States (1982), 90, (268, 0), 34);
+ Add_Action (Table.States (1982), 106, (237, 1), 173);
+ Add_Action (Table.States (1982), 107, (237, 0), 174);
+ Add_Action (Table.States (1982), 115, (234, 0), 175);
+ Add_Action (Table.States (1982), 116, (196, 0), 146);
+ Add_Action (Table.States (1982), 117, (196, 1), 37);
+ Add_Action (Table.States (1982), 118, (195, 6), 38);
+ Table.States (1982).Goto_List.Set_Capacity (31);
+ Add_Goto (Table.States (1982), 195, 176);
+ Add_Goto (Table.States (1982), 196, 148);
+ Add_Goto (Table.States (1982), 197, 54);
+ Add_Goto (Table.States (1982), 198, 55);
+ Add_Goto (Table.States (1982), 199, 56);
+ Add_Goto (Table.States (1982), 201, 57);
+ Add_Goto (Table.States (1982), 205, 177);
+ Add_Goto (Table.States (1982), 206, 178);
+ Add_Goto (Table.States (1982), 210, 179);
+ Add_Goto (Table.States (1982), 211, 180);
+ Add_Goto (Table.States (1982), 213, 181);
+ Add_Goto (Table.States (1982), 214, 182);
+ Add_Goto (Table.States (1982), 215, 183);
+ Add_Goto (Table.States (1982), 218, 184);
+ Add_Goto (Table.States (1982), 219, 185);
+ Add_Goto (Table.States (1982), 220, 186);
+ Add_Goto (Table.States (1982), 227, 2147);
+ Add_Goto (Table.States (1982), 228, 188);
+ Add_Goto (Table.States (1982), 231, 189);
+ Add_Goto (Table.States (1982), 232, 190);
+ Add_Goto (Table.States (1982), 233, 191);
+ Add_Goto (Table.States (1982), 234, 192);
+ Add_Goto (Table.States (1982), 237, 193);
+ Add_Goto (Table.States (1982), 251, 58);
+ Add_Goto (Table.States (1982), 252, 59);
+ Add_Goto (Table.States (1982), 255, 60);
+ Add_Goto (Table.States (1982), 256, 194);
+ Add_Goto (Table.States (1982), 268, 68);
+ Add_Goto (Table.States (1982), 311, 83);
+ Add_Goto (Table.States (1982), 402, 195);
+ Add_Goto (Table.States (1982), 465, 196);
+ Table.States (1982).Kernel := To_Vector ((0 => ((246, 0), 99, 1,
(32767, 0), 0)));
+ Table.States (1982).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (1983).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1983), (87, 95), (244, 1), 3);
+ Table.States (1983).Kernel := To_Vector ((0 => ((244, 1), 246,
0, (244, 1), 3)));
+ Table.States (1983).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (244, 1), 3)));
+ Table.States (1984).Action_List.Set_Capacity (23);
+ Add_Action (Table.States (1984), (33, 36, 41, 43, 44, 47, 48, 49,
50, 61, 63, 69, 72, 74, 75, 82, 87, 88,
+ 91, 94, 95, 99, 108), (204, 0), 4);
+ Table.States (1984).Kernel := To_Vector ((0 => ((204, 0), 87, 0,
(204, 0), 4)));
+ Table.States (1984).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (204, 0), 4)));
+ Table.States (1985).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1985), 66, (357, 0), 2148);
+ Table.States (1985).Kernel := To_Vector ((0 => ((357, 0), 396,
2, (32767, 0), 0)));
+ Table.States (1985).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (357, 0), 66, 2148)));
+ Table.States (1986).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (1986), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (357, 2), 8);
+ Table.States (1986).Kernel := To_Vector ((0 => ((357, 2), 108,
0, (357, 2), 8)));
+ Table.States (1986).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (357, 2), 8)));
+ Table.States (1987).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (1987), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (356, 4), 8);
+ Table.States (1987).Kernel := To_Vector ((0 => ((356, 4), 108,
0, (356, 4), 8)));
+ Table.States (1987).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (356, 4), 8)));
+ Table.States (1988).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1988), (28, 50, 53, 54, 61, 83, 84,
116), (430, 1), 7);
+ Table.States (1988).Kernel := To_Vector ((0 => ((430, 1), 108,
0, (430, 1), 7)));
+ Table.States (1988).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (430, 1), 7)));
+ Table.States (1989).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1989), 108, (430, 0), 2149);
+ Table.States (1989).Kernel := To_Vector ((0 => ((430, 0), 434,
1, (32767, 0), 0)));
+ Table.States (1989).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (430, 0), 108, 2149)));
+ Table.States (1990).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1990), (28, 50, 53, 54, 61, 83, 84,
116), (427, 0), 7);
+ Table.States (1990).Kernel := To_Vector ((0 => ((427, 0), 108,
0, (427, 0), 7)));
+ Table.States (1990).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (427, 0), 7)));
+ Table.States (1991).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1991), 27, (415, 13), 2150);
+ Table.States (1991).Kernel := To_Vector ((0 => ((415, 13), 61,
1, (32767, 0), 0)));
+ Table.States (1991).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (415, 13), 27, 2150)));
+ Table.States (1992).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1992), 86, (252, 0), 33);
+ Add_Action (Table.States (1992), 90, (268, 0), 34);
+ Add_Action (Table.States (1992), 116, (196, 0), 146);
+ Add_Action (Table.States (1992), 117, (196, 1), 37);
+ Add_Action (Table.States (1992), 118, (195, 6), 38);
+ Table.States (1992).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1992), 182, 2151);
+ Add_Goto (Table.States (1992), 195, 1152);
+ Add_Goto (Table.States (1992), 196, 148);
+ Add_Goto (Table.States (1992), 197, 54);
+ Add_Goto (Table.States (1992), 198, 55);
+ Add_Goto (Table.States (1992), 199, 56);
+ Add_Goto (Table.States (1992), 201, 57);
+ Add_Goto (Table.States (1992), 251, 58);
+ Add_Goto (Table.States (1992), 252, 59);
+ Add_Goto (Table.States (1992), 255, 60);
+ Add_Goto (Table.States (1992), 268, 68);
+ Add_Goto (Table.States (1992), 311, 83);
+ Table.States (1992).Kernel := To_Vector ((0 => ((415, 12), 75,
3, (32767, 0), 0)));
+ Table.States (1992).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1993).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1993), 85, (198, 0), 281);
+ Add_Action (Table.States (1993), 96, (197, 0), 283);
+ Add_Action (Table.States (1993), 108, (412, 4), 2152);
+ Add_Action (Table.States (1993), 113, (121, 0), 285);
+ Add_Action (Table.States (1993), 114, (121, 1), 286);
+ Table.States (1993).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1993), 121, 287);
+ Add_Goto (Table.States (1993), 313, 289);
+ Table.States (1993).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((412, 4), 195, 1, (32767, 0), 0)));
+ Table.States (1993).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (412, 4), 108, 2152)));
+ Table.States (1994).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1994), (49, 61, 108), (421, 0), 4);
+ Table.States (1994).Kernel := To_Vector ((0 => ((421, 0), 92, 0,
(421, 0), 4)));
+ Table.States (1994).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (421, 0), 4)));
+ Table.States (1995).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (1995), (49, 61, 108), (415, 16), 4);
+ Table.States (1995).Kernel := To_Vector ((0 => ((415, 16), 27,
0, (415, 16), 4)));
+ Table.States (1995).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (415, 16), 4)));
+ Table.States (1996).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (1996), 61, (415, 15), 2153);
+ Add_Action (Table.States (1996), 75, (182, 1), 1522);
+ Table.States (1996).Kernel := To_Vector ((((182, 1), 182, 2,
(32767, 0), 0), ((415, 15), 182, 2,
+ (32767, 0), 0)));
+ Table.States (1996).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (415, 15), 61, 2153)));
+ Table.States (1997).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (1997), 27, (415, 10), 2154);
+ Table.States (1997).Kernel := To_Vector ((0 => ((415, 10), 61,
1, (32767, 0), 0)));
+ Table.States (1997).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (415, 10), 27, 2154)));
+ Table.States (1998).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (1998), 86, (252, 0), 33);
+ Add_Action (Table.States (1998), 90, (268, 0), 34);
+ Add_Action (Table.States (1998), 116, (196, 0), 146);
+ Add_Action (Table.States (1998), 117, (196, 1), 37);
+ Add_Action (Table.States (1998), 118, (195, 6), 38);
+ Table.States (1998).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (1998), 182, 2155);
+ Add_Goto (Table.States (1998), 195, 1152);
+ Add_Goto (Table.States (1998), 196, 148);
+ Add_Goto (Table.States (1998), 197, 54);
+ Add_Goto (Table.States (1998), 198, 55);
+ Add_Goto (Table.States (1998), 199, 56);
+ Add_Goto (Table.States (1998), 201, 57);
+ Add_Goto (Table.States (1998), 251, 58);
+ Add_Goto (Table.States (1998), 252, 59);
+ Add_Goto (Table.States (1998), 255, 60);
+ Add_Goto (Table.States (1998), 268, 68);
+ Add_Goto (Table.States (1998), 311, 83);
+ Table.States (1998).Kernel := To_Vector ((0 => ((415, 9), 75, 3,
(32767, 0), 0)));
+ Table.States (1998).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (1999).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (1999), 49, Reduce, (415, 5), 4);
+ Add_Action (Table.States (1999), 61, (415, 4), 2156);
+ Add_Conflict (Table.States (1999), 61, (415, 5), 4);
+ Add_Action (Table.States (1999), 75, (415, 3), 2157);
+ Add_Action (Table.States (1999), 85, (198, 0), 281);
+ Add_Action (Table.States (1999), 96, (197, 0), 283);
+ Add_Action (Table.States (1999), 108, Reduce, (415, 5), 4);
+ Add_Action (Table.States (1999), 113, (121, 0), 285);
+ Add_Action (Table.States (1999), 114, (121, 1), 286);
+ Table.States (1999).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (1999), 121, 287);
+ Add_Goto (Table.States (1999), 313, 289);
+ Table.States (1999).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((415, 3), 195, 4, (32767, 0), 0),
+ ((415, 4), 195, 2, (32767, 0), 0), ((415, 5), 195, 0, (415,
5), 4)));
+ Table.States (1999).Minimal_Complete_Actions := To_Vector
(((Shift, (415, 4), 61, 2156), (Reduce, (415,
+ 5), 4)));
+ end Subr_68;
+ procedure Subr_69
+ is begin
+ Table.States (2000).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (2000), (49, 61, 108), (414, 0), 4);
+ Table.States (2000).Kernel := To_Vector ((0 => ((414, 0), 27, 0,
(414, 0), 4)));
+ Table.States (2000).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (414, 0), 4)));
+ Table.States (2001).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2001), 27, (415, 7), 2158);
+ Table.States (2001).Kernel := To_Vector ((0 => ((415, 7), 61, 1,
(32767, 0), 0)));
+ Table.States (2001).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (415, 7), 27, 2158)));
+ Table.States (2002).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (2002), 86, (252, 0), 33);
+ Add_Action (Table.States (2002), 90, (268, 0), 34);
+ Add_Action (Table.States (2002), 116, (196, 0), 146);
+ Add_Action (Table.States (2002), 117, (196, 1), 37);
+ Add_Action (Table.States (2002), 118, (195, 6), 38);
+ Table.States (2002).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (2002), 182, 2159);
+ Add_Goto (Table.States (2002), 195, 1152);
+ Add_Goto (Table.States (2002), 196, 148);
+ Add_Goto (Table.States (2002), 197, 54);
+ Add_Goto (Table.States (2002), 198, 55);
+ Add_Goto (Table.States (2002), 199, 56);
+ Add_Goto (Table.States (2002), 201, 57);
+ Add_Goto (Table.States (2002), 251, 58);
+ Add_Goto (Table.States (2002), 252, 59);
+ Add_Goto (Table.States (2002), 255, 60);
+ Add_Goto (Table.States (2002), 268, 68);
+ Add_Goto (Table.States (2002), 311, 83);
+ Table.States (2002).Kernel := To_Vector ((0 => ((415, 6), 75, 3,
(32767, 0), 0)));
+ Table.States (2002).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (2003).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (2003), 49, Reduce, (415, 2), 4);
+ Add_Action (Table.States (2003), 61, (415, 1), 2160);
+ Add_Conflict (Table.States (2003), 61, (415, 2), 4);
+ Add_Action (Table.States (2003), 75, (415, 0), 2161);
+ Add_Action (Table.States (2003), 85, (198, 0), 281);
+ Add_Action (Table.States (2003), 96, (197, 0), 283);
+ Add_Action (Table.States (2003), 108, Reduce, (415, 2), 4);
+ Add_Action (Table.States (2003), 113, (121, 0), 285);
+ Add_Action (Table.States (2003), 114, (121, 1), 286);
+ Table.States (2003).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (2003), 121, 287);
+ Add_Goto (Table.States (2003), 313, 289);
+ Table.States (2003).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((415, 0), 195, 4, (32767, 0), 0),
+ ((415, 1), 195, 2, (32767, 0), 0), ((415, 2), 195, 0, (415,
2), 4)));
+ Table.States (2003).Minimal_Complete_Actions := To_Vector
(((Shift, (415, 1), 61, 2160), (Reduce, (415,
+ 2), 4)));
+ Table.States (2004).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (2004), 61, (434, 0), 299);
+ Add_Action (Table.States (2004), 85, (198, 0), 281);
+ Add_Action (Table.States (2004), 96, (197, 0), 283);
+ Add_Action (Table.States (2004), 108, (411, 5), 2162);
+ Add_Action (Table.States (2004), 113, (121, 0), 285);
+ Add_Action (Table.States (2004), 114, (121, 1), 286);
+ Table.States (2004).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (2004), 121, 287);
+ Add_Goto (Table.States (2004), 313, 289);
+ Add_Goto (Table.States (2004), 434, 2163);
+ Table.States (2004).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((411, 4), 195, 3, (32767, 0), 0),
+ ((411, 5), 195, 1, (32767, 0), 0)));
+ Table.States (2004).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (411, 5), 108, 2162)));
+ Table.States (2005).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (2005), (28, 50, 53, 54, 61, 83, 84,
116), (412, 2), 7);
+ Table.States (2005).Kernel := To_Vector ((0 => ((412, 2), 108,
0, (412, 2), 7)));
+ Table.States (2005).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (412, 2), 7)));
+ Table.States (2006).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (2006), 86, (252, 0), 33);
+ Add_Action (Table.States (2006), 90, (268, 0), 34);
+ Add_Action (Table.States (2006), 116, (196, 0), 146);
+ Add_Action (Table.States (2006), 117, (196, 1), 37);
+ Add_Action (Table.States (2006), 118, (195, 6), 38);
+ Table.States (2006).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (2006), 195, 2164);
+ Add_Goto (Table.States (2006), 196, 148);
+ Add_Goto (Table.States (2006), 197, 54);
+ Add_Goto (Table.States (2006), 198, 55);
+ Add_Goto (Table.States (2006), 199, 56);
+ Add_Goto (Table.States (2006), 201, 57);
+ Add_Goto (Table.States (2006), 251, 58);
+ Add_Goto (Table.States (2006), 252, 59);
+ Add_Goto (Table.States (2006), 255, 60);
+ Add_Goto (Table.States (2006), 268, 68);
+ Add_Goto (Table.States (2006), 311, 83);
+ Table.States (2006).Kernel := To_Vector ((0 => ((412, 0), 50, 2,
(32767, 0), 0)));
+ Table.States (2006).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (2007).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (2007), 86, (252, 0), 33);
+ Add_Action (Table.States (2007), 90, (268, 0), 34);
+ Add_Action (Table.States (2007), 116, (196, 0), 146);
+ Add_Action (Table.States (2007), 117, (196, 1), 37);
+ Add_Action (Table.States (2007), 118, (195, 6), 38);
+ Table.States (2007).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (2007), 195, 2165);
+ Add_Goto (Table.States (2007), 196, 148);
+ Add_Goto (Table.States (2007), 197, 54);
+ Add_Goto (Table.States (2007), 198, 55);
+ Add_Goto (Table.States (2007), 199, 56);
+ Add_Goto (Table.States (2007), 201, 57);
+ Add_Goto (Table.States (2007), 251, 58);
+ Add_Goto (Table.States (2007), 252, 59);
+ Add_Goto (Table.States (2007), 255, 60);
+ Add_Goto (Table.States (2007), 268, 68);
+ Add_Goto (Table.States (2007), 311, 83);
+ Table.States (2007).Kernel := To_Vector ((((411, 0), 50, 4,
(32767, 0), 0), ((411, 1), 50, 2, (32767,
+ 0), 0)));
+ Table.States (2007).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (2008).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (2008), (28, 50, 53, 54, 61, 83, 84,
116), (411, 2), 7);
+ Table.States (2008).Kernel := To_Vector ((0 => ((411, 2), 108,
0, (411, 2), 7)));
+ Table.States (2008).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (411, 2), 7)));
+ Table.States (2009).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (2009), (28, 50, 53, 54, 61, 83, 84,
116), (409, 1), 7);
+ Table.States (2009).Kernel := To_Vector ((0 => ((409, 1), 108,
0, (409, 1), 7)));
+ Table.States (2009).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (409, 1), 7)));
+ Table.States (2010).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2010), 108, (409, 0), 2166);
+ Table.States (2010).Kernel := To_Vector ((0 => ((409, 0), 434,
1, (32767, 0), 0)));
+ Table.States (2010).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (409, 0), 108, 2166)));
+ Table.States (2011).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (2011), (28, 50, 53, 54, 61, 83, 84,
116), (409, 2), 7);
+ Table.States (2011).Kernel := To_Vector ((0 => ((409, 2), 108,
0, (409, 2), 7)));
+ Table.States (2011).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (409, 2), 7)));
+ Table.States (2012).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (2012), (28, 50, 53, 54, 61, 83, 84,
116), (409, 8), 7);
+ Table.States (2012).Kernel := To_Vector ((0 => ((409, 8), 108,
0, (409, 8), 7)));
+ Table.States (2012).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (409, 8), 7)));
+ Table.States (2013).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (2013), (28, 50, 53, 54, 61, 83, 84,
116), (409, 4), 7);
+ Table.States (2013).Kernel := To_Vector ((0 => ((409, 4), 108,
0, (409, 4), 7)));
+ Table.States (2013).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (409, 4), 7)));
+ Table.States (2014).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (2014), 86, (252, 0), 33);
+ Add_Action (Table.States (2014), 90, (268, 0), 34);
+ Add_Action (Table.States (2014), 108, Reduce, (308, 1), 0);
+ Add_Action (Table.States (2014), 116, (196, 0), 146);
+ Add_Action (Table.States (2014), 117, (196, 1), 37);
+ Add_Action (Table.States (2014), 118, (195, 6), 38);
+ Table.States (2014).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (2014), 195, 1063);
+ Add_Goto (Table.States (2014), 196, 148);
+ Add_Goto (Table.States (2014), 197, 54);
+ Add_Goto (Table.States (2014), 198, 55);
+ Add_Goto (Table.States (2014), 199, 56);
+ Add_Goto (Table.States (2014), 201, 57);
+ Add_Goto (Table.States (2014), 251, 58);
+ Add_Goto (Table.States (2014), 252, 59);
+ Add_Goto (Table.States (2014), 255, 60);
+ Add_Goto (Table.States (2014), 268, 68);
+ Add_Goto (Table.States (2014), 308, 2167);
+ Add_Goto (Table.States (2014), 311, 83);
+ Table.States (2014).Kernel := To_Vector ((0 => ((326, 2), 66, 1,
(32767, 0), 0)));
+ Table.States (2014).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (308, 1), 0)));
+ Table.States (2015).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2015), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (326, 3), 8);
+ Table.States (2015).Kernel := To_Vector ((0 => ((326, 3), 108,
0, (326, 3), 8)));
+ Table.States (2015).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (326, 3), 8)));
+ Table.States (2016).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2016), 66, (326, 0), 2168);
+ Table.States (2016).Kernel := To_Vector ((0 => ((326, 0), 396,
2, (32767, 0), 0)));
+ Table.States (2016).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (326, 0), 66, 2168)));
+ Table.States (2017).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2017), 108, (326, 1), 2169);
+ Table.States (2017).Kernel := To_Vector ((0 => ((326, 1), 308,
1, (32767, 0), 0)));
+ Table.States (2017).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (326, 1), 108, 2169)));
+ Table.States (2018).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2018), (1 => 108), (325, 6), 8);
+ Table.States (2018).Kernel := To_Vector ((0 => ((325, 6), 308,
0, (325, 6), 8)));
+ Table.States (2018).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (325, 6), 8)));
+ Table.States (2019).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2019), (1 => 108), (325, 3), 8);
+ Table.States (2019).Kernel := To_Vector ((0 => ((325, 3), 308,
0, (325, 3), 8)));
+ Table.States (2019).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (325, 3), 8)));
+ Table.States (2020).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2020), (1 => 108), (325, 1), 8);
+ Table.States (2020).Kernel := To_Vector ((0 => ((325, 1), 308,
0, (325, 1), 8)));
+ Table.States (2020).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (325, 1), 8)));
+ Table.States (2021).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (2021), 86, (252, 0), 33);
+ Add_Action (Table.States (2021), 90, (268, 0), 34);
+ Add_Action (Table.States (2021), 108, Reduce, (308, 1), 0);
+ Add_Action (Table.States (2021), 116, (196, 0), 146);
+ Add_Action (Table.States (2021), 117, (196, 1), 37);
+ Add_Action (Table.States (2021), 118, (195, 6), 38);
+ Table.States (2021).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (2021), 195, 1063);
+ Add_Goto (Table.States (2021), 196, 148);
+ Add_Goto (Table.States (2021), 197, 54);
+ Add_Goto (Table.States (2021), 198, 55);
+ Add_Goto (Table.States (2021), 199, 56);
+ Add_Goto (Table.States (2021), 201, 57);
+ Add_Goto (Table.States (2021), 251, 58);
+ Add_Goto (Table.States (2021), 252, 59);
+ Add_Goto (Table.States (2021), 255, 60);
+ Add_Goto (Table.States (2021), 268, 68);
+ Add_Goto (Table.States (2021), 308, 2170);
+ Add_Goto (Table.States (2021), 311, 83);
+ Table.States (2021).Kernel := To_Vector ((0 => ((325, 0), 66, 0,
(308, 1), 0)));
+ Table.States (2021).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (308, 1), 0)));
+ Table.States (2022).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2022), (91, 99), (397, 2), 3);
+ Table.States (2022).Kernel := To_Vector ((((397, 1), 397, 2,
(32767, 0), 0), ((397, 2), 397, 0, (397,
+ 2), 3), ((397, 2), 397, 2, (32767, 0), 0)));
+ Table.States (2022).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (397, 2), 3)));
+ Table.States (2023).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2023), (91, 99), (397, 1), 3);
+ Table.States (2023).Kernel := To_Vector ((((397, 0), 400, 0,
(397, 0), 1), ((397, 1), 400, 0, (397,
+ 1), 3)));
+ Table.States (2023).Minimal_Complete_Actions := To_Vector
(((Reduce, (397, 0), 1), (Reduce, (397, 1),
+ 3)));
+ Table.States (2024).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (2024), (63, 66, 75), (398, 1), 4);
+ Table.States (2024).Kernel := To_Vector ((0 => ((398, 1), 259,
0, (398, 1), 4)));
+ Table.States (2024).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (398, 1), 4)));
+ Table.States (2025).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2025), 91, (397, 1), 1793);
+ Add_Action (Table.States (2025), 99, (398, 0), 2171);
+ Table.States (2025).Kernel := To_Vector ((((397, 1), 397, 2,
(32767, 0), 0), ((397, 2), 397, 2,
+ (32767, 0), 0), ((398, 0), 397, 3, (32767, 0), 0)));
+ Table.States (2025).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (398, 0), 99, 2171)));
+ Table.States (2026).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (2026), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (288, 0), 8);
+ Table.States (2026).Kernel := To_Vector ((0 => ((288, 0), 108,
0, (288, 0), 8)));
+ Table.States (2026).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (288, 0), 8)));
+ Table.States (2027).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2027), 108, (271, 2), 2172);
+ Table.States (2027).Kernel := To_Vector ((0 => ((271, 2), 42, 1,
(32767, 0), 0)));
+ Table.States (2027).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (271, 2), 108, 2172)));
+ Table.States (2028).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (2028), (41, 44, 66), (269, 0), 4);
+ Table.States (2028).Kernel := To_Vector ((0 => ((269, 0), 259,
0, (269, 0), 4)));
+ Table.States (2028).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (269, 0), 4)));
+ Table.States (2029).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2029), 42, (271, 0), 2173);
+ Table.States (2029).Kernel := To_Vector ((0 => ((271, 0), 66, 2,
(32767, 0), 0)));
+ Table.States (2029).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (271, 0), 42, 2173)));
+ Table.States (2030).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (2030), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (271, 1), 8);
+ Table.States (2030).Kernel := To_Vector ((0 => ((271, 1), 108,
0, (271, 1), 8)));
+ Table.States (2030).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (271, 1), 8)));
+ Table.States (2031).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (2031), 85, (198, 0), 281);
+ Add_Action (Table.States (2031), 87, Reduce, (300, 1), 6);
+ Add_Action (Table.States (2031), 94, (134, 0), 282);
+ Add_Action (Table.States (2031), 96, (197, 0), 283);
+ Add_Action (Table.States (2031), 108, Reduce, (300, 1), 6);
+ Add_Action (Table.States (2031), 113, (121, 0), 285);
+ Add_Action (Table.States (2031), 114, (121, 1), 286);
+ Table.States (2031).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (2031), 121, 287);
+ Add_Goto (Table.States (2031), 134, 2174);
+ Add_Goto (Table.States (2031), 313, 289);
+ Table.States (2031).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((300, 0), 195, 2, (32767, 0), 0),
((300, 1), 195, 0, (300, 1), 6), ((311,
+ 0), 195, 3, (32767, 0), 0)));
+ Table.States (2031).Minimal_Complete_Actions := To_Vector
(((Shift, (134, 0), 94, 282), (Reduce, (300, 1),
+ 6)));
+ Table.States (2032).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2032), (87, 108), (300, 2), 6);
+ Table.States (2032).Kernel := To_Vector ((0 => ((300, 2), 134,
0, (300, 2), 6)));
+ Table.States (2032).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (300, 2), 6)));
+ Table.States (2033).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2033), (87, 108), (300, 4), 6);
+ Table.States (2033).Kernel := To_Vector ((0 => ((300, 4), 134,
0, (300, 4), 6)));
+ Table.States (2033).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (300, 4), 6)));
+ Table.States (2034).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (2034), (36, 50, 99), (280, 0), 7);
+ Table.States (2034).Kernel := To_Vector ((0 => ((280, 0), 279,
0, (280, 0), 7)));
+ Table.States (2034).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (280, 0), 7)));
+ Table.States (2035).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (2035), (36, 50, 99), (280, 8), 7);
+ Table.States (2035).Kernel := To_Vector ((0 => ((280, 8), 279,
0, (280, 8), 7)));
+ Table.States (2035).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (280, 8), 7)));
+ Table.States (2036).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (2036), (66, 86, 90, 116, 117, 118),
(455, 0), 4);
+ Table.States (2036).Kernel := To_Vector ((0 => ((455, 0), 108,
0, (455, 0), 4)));
+ Table.States (2036).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (455, 0), 4)));
+ Table.States (2037).Action_List.Set_Capacity (44);
+ Add_Action (Table.States (2037), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 63, 64, 65, 66, 77,
81, 83, 84, 86, 90, 105, 116, 117, 118,
+ 119), (440, 6), 8);
+ Table.States (2037).Kernel := To_Vector ((0 => ((440, 6), 108,
0, (440, 6), 8)));
+ Table.States (2037).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (440, 6), 8)));
+ Table.States (2038).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (2038), 46, (233, 2), 167);
+ Add_Action (Table.States (2038), 52, (233, 3), 168);
+ Add_Action (Table.States (2038), 65, (234, 1), 169);
+ Add_Action (Table.States (2038), 76, (256, 0), 170);
+ Add_Action (Table.States (2038), 85, (205, 4), 171);
+ Add_Action (Table.States (2038), 86, (213, 2), 172);
+ Add_Action (Table.States (2038), 90, (268, 0), 34);
+ Add_Action (Table.States (2038), 106, (237, 1), 173);
+ Add_Action (Table.States (2038), 107, (237, 0), 174);
+ Add_Action (Table.States (2038), 115, (234, 0), 175);
+ Add_Action (Table.States (2038), 116, (196, 0), 146);
+ Add_Action (Table.States (2038), 117, (196, 1), 37);
+ Add_Action (Table.States (2038), 118, (195, 6), 38);
+ Table.States (2038).Goto_List.Set_Capacity (29);
+ Add_Goto (Table.States (2038), 195, 176);
+ Add_Goto (Table.States (2038), 196, 148);
+ Add_Goto (Table.States (2038), 197, 54);
+ Add_Goto (Table.States (2038), 198, 55);
+ Add_Goto (Table.States (2038), 199, 56);
+ Add_Goto (Table.States (2038), 201, 57);
+ Add_Goto (Table.States (2038), 205, 177);
+ Add_Goto (Table.States (2038), 206, 178);
+ Add_Goto (Table.States (2038), 210, 179);
+ Add_Goto (Table.States (2038), 211, 180);
+ Add_Goto (Table.States (2038), 213, 181);
+ Add_Goto (Table.States (2038), 214, 182);
+ Add_Goto (Table.States (2038), 215, 183);
+ Add_Goto (Table.States (2038), 218, 184);
+ Add_Goto (Table.States (2038), 219, 185);
+ Add_Goto (Table.States (2038), 220, 186);
+ Add_Goto (Table.States (2038), 231, 2175);
+ Add_Goto (Table.States (2038), 232, 190);
+ Add_Goto (Table.States (2038), 233, 191);
+ Add_Goto (Table.States (2038), 234, 192);
+ Add_Goto (Table.States (2038), 237, 193);
+ Add_Goto (Table.States (2038), 251, 58);
+ Add_Goto (Table.States (2038), 252, 59);
+ Add_Goto (Table.States (2038), 255, 60);
+ Add_Goto (Table.States (2038), 256, 194);
+ Add_Goto (Table.States (2038), 268, 68);
+ Add_Goto (Table.States (2038), 311, 83);
+ Add_Goto (Table.States (2038), 443, 2176);
+ Add_Goto (Table.States (2038), 465, 196);
+ Table.States (2038).Kernel := To_Vector ((0 => ((441, 0), 74, 4,
(32767, 0), 0)));
+ Table.States (2038).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (2039).Action_List.Set_Capacity (44);
+ Add_Action (Table.States (2039), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 63, 64, 65, 66, 77,
81, 83, 84, 86, 90, 105, 116, 117, 118,
+ 119), (440, 3), 8);
+ Table.States (2039).Kernel := To_Vector ((0 => ((440, 3), 108,
0, (440, 3), 8)));
+ Table.States (2039).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (440, 3), 8)));
+ Table.States (2040).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (2040), 85, (198, 0), 281);
+ Add_Action (Table.States (2040), 96, (197, 0), 283);
+ Add_Action (Table.States (2040), 108, (440, 2), 2177);
+ Add_Action (Table.States (2040), 113, (121, 0), 285);
+ Add_Action (Table.States (2040), 114, (121, 1), 286);
+ Table.States (2040).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (2040), 121, 287);
+ Add_Goto (Table.States (2040), 313, 289);
+ Table.States (2040).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((440, 2), 195, 1, (32767, 0), 0)));
+ Table.States (2040).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (440, 2), 108, 2177)));
+ Table.States (2041).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (2041), 86, (252, 0), 33);
+ Add_Action (Table.States (2041), 90, (268, 0), 34);
+ Add_Action (Table.States (2041), 108, (440, 1), 2178);
+ Add_Action (Table.States (2041), 116, (196, 0), 146);
+ Add_Action (Table.States (2041), 117, (196, 1), 37);
+ Add_Action (Table.States (2041), 118, (195, 6), 38);
+ Table.States (2041).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (2041), 195, 2179);
+ Add_Goto (Table.States (2041), 196, 148);
+ Add_Goto (Table.States (2041), 197, 54);
+ Add_Goto (Table.States (2041), 198, 55);
+ Add_Goto (Table.States (2041), 199, 56);
+ Add_Goto (Table.States (2041), 201, 57);
+ Add_Goto (Table.States (2041), 251, 58);
+ Add_Goto (Table.States (2041), 252, 59);
+ Add_Goto (Table.States (2041), 255, 60);
+ Add_Goto (Table.States (2041), 268, 68);
+ Add_Goto (Table.States (2041), 311, 83);
+ Table.States (2041).Kernel := To_Vector ((((440, 0), 67, 2,
(32767, 0), 0), ((440, 1), 67, 1, (32767,
+ 0), 0)));
+ Table.States (2041).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (440, 1), 108, 2178)));
+ Table.States (2042).Action_List.Set_Capacity (44);
+ Add_Action (Table.States (2042), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 63, 64, 65, 66, 77,
81, 83, 84, 86, 90, 105, 116, 117, 118,
+ 119), (440, 5), 8);
+ Table.States (2042).Kernel := To_Vector ((0 => ((440, 5), 108,
0, (440, 5), 8)));
+ Table.States (2042).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (440, 5), 8)));
+ Table.States (2043).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (2043), 85, (198, 0), 281);
+ Add_Action (Table.States (2043), 96, (197, 0), 283);
+ Add_Action (Table.States (2043), 108, (440, 4), 2180);
+ Add_Action (Table.States (2043), 113, (121, 0), 285);
+ Add_Action (Table.States (2043), 114, (121, 1), 286);
+ Table.States (2043).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (2043), 121, 287);
+ Add_Goto (Table.States (2043), 313, 289);
+ Table.States (2043).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((440, 4), 195, 1, (32767, 0), 0)));
+ Table.States (2043).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (440, 4), 108, 2180)));
+ end Subr_69;
+ procedure Subr_70
+ is begin
+ Table.States (2044).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2044), 116, (362, 0), 2181);
+ Table.States (2044).Kernel := To_Vector ((0 => ((362, 0), 51, 3,
(32767, 0), 0)));
+ Table.States (2044).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (362, 0), 116, 2181)));
+ Table.States (2045).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2045), 87, (360, 0), 2182);
+ Table.States (2045).Kernel := To_Vector ((0 => ((360, 0), 362,
1, (32767, 0), 0)));
+ Table.States (2045).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (360, 0), 87, 2182)));
+ Table.States (2046).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (2046), 12, (402, 0), 165);
+ Add_Action (Table.States (2046), 46, (233, 2), 167);
+ Add_Action (Table.States (2046), 52, (233, 3), 168);
+ Add_Action (Table.States (2046), 65, (234, 1), 169);
+ Add_Action (Table.States (2046), 76, (256, 0), 170);
+ Add_Action (Table.States (2046), 85, (205, 4), 171);
+ Add_Action (Table.States (2046), 86, (213, 2), 172);
+ Add_Action (Table.States (2046), 90, (268, 0), 34);
+ Add_Action (Table.States (2046), 106, (237, 1), 173);
+ Add_Action (Table.States (2046), 107, (237, 0), 174);
+ Add_Action (Table.States (2046), 115, (234, 0), 175);
+ Add_Action (Table.States (2046), 116, (196, 0), 146);
+ Add_Action (Table.States (2046), 117, (196, 1), 37);
+ Add_Action (Table.States (2046), 118, (195, 6), 38);
+ Table.States (2046).Goto_List.Set_Capacity (32);
+ Add_Goto (Table.States (2046), 195, 176);
+ Add_Goto (Table.States (2046), 196, 148);
+ Add_Goto (Table.States (2046), 197, 54);
+ Add_Goto (Table.States (2046), 198, 55);
+ Add_Goto (Table.States (2046), 199, 56);
+ Add_Goto (Table.States (2046), 201, 57);
+ Add_Goto (Table.States (2046), 205, 177);
+ Add_Goto (Table.States (2046), 206, 178);
+ Add_Goto (Table.States (2046), 210, 179);
+ Add_Goto (Table.States (2046), 211, 180);
+ Add_Goto (Table.States (2046), 213, 181);
+ Add_Goto (Table.States (2046), 214, 182);
+ Add_Goto (Table.States (2046), 215, 183);
+ Add_Goto (Table.States (2046), 218, 184);
+ Add_Goto (Table.States (2046), 219, 185);
+ Add_Goto (Table.States (2046), 220, 186);
+ Add_Goto (Table.States (2046), 227, 236);
+ Add_Goto (Table.States (2046), 228, 188);
+ Add_Goto (Table.States (2046), 231, 189);
+ Add_Goto (Table.States (2046), 232, 190);
+ Add_Goto (Table.States (2046), 233, 191);
+ Add_Goto (Table.States (2046), 234, 192);
+ Add_Goto (Table.States (2046), 237, 193);
+ Add_Goto (Table.States (2046), 243, 2183);
+ Add_Goto (Table.States (2046), 251, 58);
+ Add_Goto (Table.States (2046), 252, 59);
+ Add_Goto (Table.States (2046), 255, 60);
+ Add_Goto (Table.States (2046), 256, 194);
+ Add_Goto (Table.States (2046), 268, 68);
+ Add_Goto (Table.States (2046), 311, 83);
+ Add_Goto (Table.States (2046), 402, 195);
+ Add_Goto (Table.States (2046), 465, 196);
+ Table.States (2046).Kernel := To_Vector ((0 => ((361, 0), 63, 1,
(32767, 0), 0)));
+ Table.States (2046).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (2047).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2047), 82, (359, 1), 2184);
+ Table.States (2047).Kernel := To_Vector ((0 => ((359, 1), 361,
6, (32767, 0), 0)));
+ Table.States (2047).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (359, 1), 82, 2184)));
+ Table.States (2048).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2048), 63, (361, 0), 2046);
+ Table.States (2048).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2048), 361, 2185);
+ Table.States (2048).Kernel := To_Vector ((0 => ((359, 0), 434,
8, (32767, 0), 0)));
+ Table.States (2048).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (361, 0), 63, 2046)));
+ Table.States (2049).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2049), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (354, 2), 8);
+ Table.States (2049).Kernel := To_Vector ((0 => ((354, 2), 108,
0, (354, 2), 8)));
+ Table.States (2049).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (354, 2), 8)));
+ Table.States (2050).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2050), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (354, 1), 8);
+ Table.States (2050).Kernel := To_Vector ((0 => ((354, 1), 108,
0, (354, 1), 8)));
+ Table.States (2050).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (354, 1), 8)));
+ Table.States (2051).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2051), 108, (354, 0), 2186);
+ Table.States (2051).Kernel := To_Vector ((0 => ((354, 0), 284,
1, (32767, 0), 0)));
+ Table.States (2051).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (354, 0), 108, 2186)));
+ Table.States (2052).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2052), 108, (346, 6), 2187);
+ Table.States (2052).Kernel := To_Vector ((0 => ((346, 6), 350,
1, (32767, 0), 0)));
+ Table.States (2052).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (346, 6), 108, 2187)));
+ Table.States (2053).Action_List.Set_Capacity (9);
+ Add_Action (Table.States (2053), 21, (356, 4), 8);
+ Add_Action (Table.States (2053), 25, (329, 1), 10);
+ Add_Action (Table.States (2053), 27, (350, 6), 781);
+ Add_Action (Table.States (2053), 51, (437, 0), 221);
+ Add_Action (Table.States (2053), 52, (329, 0), 21);
+ Add_Action (Table.States (2053), 53, (294, 0), 314);
+ Add_Action (Table.States (2053), 54, (293, 0), 315);
+ Add_Action (Table.States (2053), 66, (350, 10), 782);
+ Add_Action (Table.States (2053), 84, (124, 0), 32);
+ Table.States (2053).Goto_List.Set_Capacity (15);
+ Add_Goto (Table.States (2053), 124, 784);
+ Add_Goto (Table.States (2053), 291, 785);
+ Add_Goto (Table.States (2053), 292, 786);
+ Add_Goto (Table.States (2053), 293, 317);
+ Add_Goto (Table.States (2053), 294, 318);
+ Add_Goto (Table.States (2053), 329, 787);
+ Add_Goto (Table.States (2053), 348, 788);
+ Add_Goto (Table.States (2053), 350, 2188);
+ Add_Goto (Table.States (2053), 351, 790);
+ Add_Goto (Table.States (2053), 356, 791);
+ Add_Goto (Table.States (2053), 431, 792);
+ Add_Goto (Table.States (2053), 437, 140);
+ Add_Goto (Table.States (2053), 438, 141);
+ Add_Goto (Table.States (2053), 440, 142);
+ Add_Goto (Table.States (2053), 454, 143);
+ Table.States (2053).Kernel := To_Vector ((0 => ((346, 2), 61, 2,
(32767, 0), 0)));
+ Table.States (2053).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (350, 10), 66, 782)));
+ Table.States (2054).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2054), 61, (346, 0), 2189);
+ Add_Action (Table.States (2054), 75, (182, 1), 1522);
+ Table.States (2054).Kernel := To_Vector ((((182, 1), 182, 2,
(32767, 0), 0), ((346, 0), 182, 3,
+ (32767, 0), 0)));
+ Table.States (2054).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (346, 0), 61, 2189)));
+ Table.States (2055).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2055), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (346, 1), 8);
+ Table.States (2055).Kernel := To_Vector ((0 => ((346, 1), 108,
0, (346, 1), 8)));
+ Table.States (2055).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (346, 1), 8)));
+ Table.States (2056).Action_List.Set_Capacity (9);
+ Add_Action (Table.States (2056), 21, (356, 4), 8);
+ Add_Action (Table.States (2056), 25, (329, 1), 10);
+ Add_Action (Table.States (2056), 27, (350, 6), 781);
+ Add_Action (Table.States (2056), 51, (437, 0), 221);
+ Add_Action (Table.States (2056), 52, (329, 0), 21);
+ Add_Action (Table.States (2056), 53, (294, 0), 314);
+ Add_Action (Table.States (2056), 54, (293, 0), 315);
+ Add_Action (Table.States (2056), 66, (350, 10), 782);
+ Add_Action (Table.States (2056), 84, (124, 0), 32);
+ Table.States (2056).Goto_List.Set_Capacity (15);
+ Add_Goto (Table.States (2056), 124, 784);
+ Add_Goto (Table.States (2056), 291, 785);
+ Add_Goto (Table.States (2056), 292, 786);
+ Add_Goto (Table.States (2056), 293, 317);
+ Add_Goto (Table.States (2056), 294, 318);
+ Add_Goto (Table.States (2056), 329, 787);
+ Add_Goto (Table.States (2056), 348, 788);
+ Add_Goto (Table.States (2056), 350, 2190);
+ Add_Goto (Table.States (2056), 351, 790);
+ Add_Goto (Table.States (2056), 356, 791);
+ Add_Goto (Table.States (2056), 431, 792);
+ Add_Goto (Table.States (2056), 437, 140);
+ Add_Goto (Table.States (2056), 438, 141);
+ Add_Goto (Table.States (2056), 440, 142);
+ Add_Goto (Table.States (2056), 454, 143);
+ Table.States (2056).Kernel := To_Vector ((0 => ((346, 4), 61, 2,
(32767, 0), 0)));
+ Table.States (2056).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (350, 10), 66, 782)));
+ Table.States (2057).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (2057), (49, 61, 94, 108), (161, 0), 2);
+ Table.States (2057).Kernel := To_Vector ((0 => ((161, 0), 131,
0, (161, 0), 2)));
+ Table.States (2057).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (161, 0), 2)));
+ Table.States (2058).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (2058), (49, 61, 94, 108), (161, 2), 2);
+ Table.States (2058).Kernel := To_Vector ((0 => ((161, 2), 188,
0, (161, 2), 2)));
+ Table.States (2058).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (161, 2), 2)));
+ Table.States (2059).Action_List.Set_Capacity (11);
+ Add_Action (Table.States (2059), (21, 25, 51, 52, 53, 54, 63, 64,
66, 84, 116), (173, 3), 4);
+ Table.States (2059).Kernel := To_Vector ((0 => ((173, 3), 108,
0, (173, 3), 4)));
+ Table.States (2059).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (173, 3), 4)));
+ Table.States (2060).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2060), 61, (434, 0), 299);
+ Add_Action (Table.States (2060), 108, (173, 1), 2191);
+ Table.States (2060).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2060), 434, 2192);
+ Table.States (2060).Kernel := To_Vector ((((173, 0), 134, 3,
(32767, 0), 0), ((173, 1), 134, 1,
+ (32767, 0), 0)));
+ Table.States (2060).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (173, 1), 108, 2191)));
+ Table.States (2061).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2061), 108, (173, 2), 2193);
+ Table.States (2061).Kernel := To_Vector ((0 => ((173, 2), 434,
1, (32767, 0), 0)));
+ Table.States (2061).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (173, 2), 108, 2193)));
+ Table.States (2062).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2062), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (347, 2), 8);
+ Table.States (2062).Kernel := To_Vector ((0 => ((347, 2), 108,
0, (347, 2), 8)));
+ Table.States (2062).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (347, 2), 8)));
+ Table.States (2063).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2063), (1 => 108), (350, 0), 5);
+ Table.States (2063).Kernel := To_Vector ((0 => ((350, 0), 116,
0, (350, 0), 5)));
+ Table.States (2063).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (350, 0), 5)));
+ Table.States (2064).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2064), 108, (347, 0), 2194);
+ Table.States (2064).Kernel := To_Vector ((0 => ((347, 0), 350,
1, (32767, 0), 0)));
+ Table.States (2064).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (347, 0), 108, 2194)));
+ Table.States (2065).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2065), 108, Reduce, (284, 1), 0);
+ Add_Action (Table.States (2065), 116, (284, 0), 1312);
+ Table.States (2065).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2065), 284, 2195);
+ Table.States (2065).Kernel := To_Vector ((0 => ((345, 1), 66, 1,
(32767, 0), 0)));
+ Table.States (2065).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (284, 1), 0)));
+ Table.States (2066).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2066), 66, (345, 0), 2196);
+ Table.States (2066).Kernel := To_Vector ((0 => ((345, 0), 396,
2, (32767, 0), 0)));
+ Table.States (2066).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (345, 0), 66, 2196)));
+ Table.States (2067).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2067), 108, (340, 9), 2197);
+ Table.States (2067).Kernel := To_Vector ((0 => ((340, 9), 343,
1, (32767, 0), 0)));
+ Table.States (2067).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (340, 9), 108, 2197)));
+ Table.States (2068).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (2068), 21, (356, 4), 8);
+ Add_Action (Table.States (2068), 25, (329, 1), 10);
+ Add_Action (Table.States (2068), 51, (437, 0), 221);
+ Add_Action (Table.States (2068), 52, (329, 0), 21);
+ Table.States (2068).Goto_List.Set_Capacity (10);
+ Add_Goto (Table.States (2068), 329, 801);
+ Add_Goto (Table.States (2068), 342, 802);
+ Add_Goto (Table.States (2068), 343, 2198);
+ Add_Goto (Table.States (2068), 344, 804);
+ Add_Goto (Table.States (2068), 356, 805);
+ Add_Goto (Table.States (2068), 431, 806);
+ Add_Goto (Table.States (2068), 437, 140);
+ Add_Goto (Table.States (2068), 438, 141);
+ Add_Goto (Table.States (2068), 440, 142);
+ Add_Goto (Table.States (2068), 454, 143);
+ Table.States (2068).Kernel := To_Vector ((0 => ((340, 3), 61, 5,
(32767, 0), 0)));
+ Table.States (2068).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (356, 4), 21, 8)));
+ Table.States (2069).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2069), 61, (340, 0), 2199);
+ Add_Action (Table.States (2069), 75, (182, 1), 1522);
+ Table.States (2069).Kernel := To_Vector ((((182, 1), 182, 2,
(32767, 0), 0), ((340, 0), 182, 6,
+ (32767, 0), 0)));
+ Table.States (2069).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (340, 0), 61, 2199)));
+ Table.States (2070).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2070), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (340, 1), 8);
+ Table.States (2070).Kernel := To_Vector ((0 => ((340, 1), 108,
0, (340, 1), 8)));
+ Table.States (2070).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (340, 1), 8)));
+ Table.States (2071).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (2071), 21, (356, 4), 8);
+ Add_Action (Table.States (2071), 25, (329, 1), 10);
+ Add_Action (Table.States (2071), 51, (437, 0), 221);
+ Add_Action (Table.States (2071), 52, (329, 0), 21);
+ Table.States (2071).Goto_List.Set_Capacity (10);
+ Add_Goto (Table.States (2071), 329, 801);
+ Add_Goto (Table.States (2071), 342, 802);
+ Add_Goto (Table.States (2071), 343, 2200);
+ Add_Goto (Table.States (2071), 344, 804);
+ Add_Goto (Table.States (2071), 356, 805);
+ Add_Goto (Table.States (2071), 431, 806);
+ Add_Goto (Table.States (2071), 437, 140);
+ Add_Goto (Table.States (2071), 438, 141);
+ Add_Goto (Table.States (2071), 440, 142);
+ Add_Goto (Table.States (2071), 454, 143);
+ Table.States (2071).Kernel := To_Vector ((0 => ((340, 6), 61, 5,
(32767, 0), 0)));
+ Table.States (2071).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (356, 4), 21, 8)));
+ Table.States (2072).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2072), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (341, 3), 8);
+ Table.States (2072).Kernel := To_Vector ((0 => ((341, 3), 108,
0, (341, 3), 8)));
+ Table.States (2072).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (341, 3), 8)));
+ Table.States (2073).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2073), (1 => 108), (343, 0), 5);
+ Table.States (2073).Kernel := To_Vector ((0 => ((343, 0), 284,
0, (343, 0), 5)));
+ Table.States (2073).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (343, 0), 5)));
+ Table.States (2074).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2074), 108, (341, 0), 2201);
+ Table.States (2074).Kernel := To_Vector ((0 => ((341, 0), 343,
1, (32767, 0), 0)));
+ Table.States (2074).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (341, 0), 108, 2201)));
+ Table.States (2075).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2075), 61, (434, 0), 299);
+ Add_Action (Table.States (2075), 108, (328, 43), 2202);
+ Table.States (2075).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2075), 434, 2203);
+ Table.States (2075).Kernel := To_Vector ((((328, 42), 27, 3,
(32767, 0), 0), ((328, 43), 27, 1,
+ (32767, 0), 0)));
+ Table.States (2075).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 43), 108, 2202)));
+ Table.States (2076).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2076), 61, (328, 40), 2204);
+ Add_Action (Table.States (2076), 75, (182, 1), 1522);
+ Table.States (2076).Kernel := To_Vector ((((182, 1), 182, 2,
(32767, 0), 0), ((328, 40), 182, 5,
+ (32767, 0), 0), ((328, 41), 182, 3, (32767, 0), 0)));
+ Table.States (2076).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 40), 61, 2204)));
+ Table.States (2077).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (2077), 12, (402, 0), 165);
+ Add_Action (Table.States (2077), 46, (233, 2), 167);
+ Add_Action (Table.States (2077), 52, (187, 0), 356);
+ Add_Action (Table.States (2077), 62, (178, 3), 385);
+ Add_Action (Table.States (2077), 65, (234, 1), 169);
+ Add_Action (Table.States (2077), 76, (256, 0), 170);
+ Add_Action (Table.States (2077), 85, (205, 4), 171);
+ Add_Action (Table.States (2077), 86, (213, 2), 172);
+ Add_Action (Table.States (2077), 90, (268, 0), 34);
+ Add_Action (Table.States (2077), 106, (237, 1), 173);
+ Add_Action (Table.States (2077), 107, (237, 0), 174);
+ Add_Action (Table.States (2077), 115, (234, 0), 175);
+ Add_Action (Table.States (2077), 116, (196, 0), 146);
+ Add_Action (Table.States (2077), 117, (196, 1), 37);
+ Add_Action (Table.States (2077), 118, (195, 6), 38);
+ Table.States (2077).Goto_List.Set_Capacity (37);
+ Add_Goto (Table.States (2077), 131, 361);
+ Add_Goto (Table.States (2077), 140, 362);
+ Add_Goto (Table.States (2077), 177, 2205);
+ Add_Goto (Table.States (2077), 178, 364);
+ Add_Goto (Table.States (2077), 187, 365);
+ Add_Goto (Table.States (2077), 195, 366);
+ Add_Goto (Table.States (2077), 196, 148);
+ Add_Goto (Table.States (2077), 197, 54);
+ Add_Goto (Table.States (2077), 198, 55);
+ Add_Goto (Table.States (2077), 199, 56);
+ Add_Goto (Table.States (2077), 201, 57);
+ Add_Goto (Table.States (2077), 203, 369);
+ Add_Goto (Table.States (2077), 205, 177);
+ Add_Goto (Table.States (2077), 206, 178);
+ Add_Goto (Table.States (2077), 210, 179);
+ Add_Goto (Table.States (2077), 211, 180);
+ Add_Goto (Table.States (2077), 213, 181);
+ Add_Goto (Table.States (2077), 214, 182);
+ Add_Goto (Table.States (2077), 215, 183);
+ Add_Goto (Table.States (2077), 218, 184);
+ Add_Goto (Table.States (2077), 219, 185);
+ Add_Goto (Table.States (2077), 220, 186);
+ Add_Goto (Table.States (2077), 227, 975);
+ Add_Goto (Table.States (2077), 228, 188);
+ Add_Goto (Table.States (2077), 231, 378);
+ Add_Goto (Table.States (2077), 232, 190);
+ Add_Goto (Table.States (2077), 233, 191);
+ Add_Goto (Table.States (2077), 234, 192);
+ Add_Goto (Table.States (2077), 237, 193);
+ Add_Goto (Table.States (2077), 251, 58);
+ Add_Goto (Table.States (2077), 252, 59);
+ Add_Goto (Table.States (2077), 255, 60);
+ Add_Goto (Table.States (2077), 256, 194);
+ Add_Goto (Table.States (2077), 268, 68);
+ Add_Goto (Table.States (2077), 311, 83);
+ Add_Goto (Table.States (2077), 402, 195);
+ Add_Goto (Table.States (2077), 465, 196);
+ Table.States (2077).Kernel := To_Vector ((0 => ((176, 0), 63, 4,
(32767, 0), 0)));
+ Table.States (2077).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (178, 3), 62, 385)));
+ Table.States (2078).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2078), 63, (176, 0), 2077);
+ Add_Action (Table.States (2078), 66, (175, 0), 2206);
+ Table.States (2078).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2078), 176, 2207);
+ Table.States (2078).Kernel := To_Vector ((((174, 1), 174, 8,
(32767, 0), 0), ((175, 0), 174, 3,
+ (32767, 0), 0)));
+ Table.States (2078).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (175, 0), 66, 2206)));
+ Table.States (2079).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2079), (63, 66), (174, 0), 1);
+ Table.States (2079).Kernel := To_Vector ((0 => ((174, 0), 176,
0, (174, 0), 1)));
+ Table.States (2079).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (174, 0), 1)));
+ Table.States (2080).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2080), (61, 108), (170, 0), 5);
+ Table.States (2080).Kernel := To_Vector ((0 => ((170, 0), 116,
0, (170, 0), 5)));
+ Table.States (2080).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (170, 0), 5)));
+ Table.States (2081).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2081), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (327, 16), 8);
+ Table.States (2081).Kernel := To_Vector ((0 => ((327, 16), 108,
0, (327, 16), 8)));
+ Table.States (2081).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (327, 16), 8)));
+ Table.States (2082).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2082), (61, 108), (152, 0), 5);
+ Table.States (2082).Kernel := To_Vector ((0 => ((152, 0), 149,
0, (152, 0), 5)));
+ Table.States (2082).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (152, 0), 5)));
+ Table.States (2083).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (2083), 46, (233, 2), 167);
+ Add_Action (Table.States (2083), 52, (233, 3), 168);
+ Add_Action (Table.States (2083), 65, (234, 1), 169);
+ Add_Action (Table.States (2083), 76, (256, 0), 170);
+ Add_Action (Table.States (2083), 85, (205, 4), 171);
+ Add_Action (Table.States (2083), 86, (213, 2), 172);
+ Add_Action (Table.States (2083), 90, (268, 0), 34);
+ Add_Action (Table.States (2083), 106, (237, 1), 173);
+ Add_Action (Table.States (2083), 107, (237, 0), 174);
+ Add_Action (Table.States (2083), 115, (234, 0), 175);
+ Add_Action (Table.States (2083), 116, (196, 0), 146);
+ Add_Action (Table.States (2083), 117, (196, 1), 37);
+ Add_Action (Table.States (2083), 118, (195, 6), 38);
+ Table.States (2083).Goto_List.Set_Capacity (28);
+ Add_Goto (Table.States (2083), 195, 176);
+ Add_Goto (Table.States (2083), 196, 148);
+ Add_Goto (Table.States (2083), 197, 54);
+ Add_Goto (Table.States (2083), 198, 55);
+ Add_Goto (Table.States (2083), 199, 56);
+ Add_Goto (Table.States (2083), 201, 57);
+ Add_Goto (Table.States (2083), 205, 177);
+ Add_Goto (Table.States (2083), 206, 178);
+ Add_Goto (Table.States (2083), 210, 179);
+ Add_Goto (Table.States (2083), 211, 180);
+ Add_Goto (Table.States (2083), 213, 181);
+ Add_Goto (Table.States (2083), 214, 182);
+ Add_Goto (Table.States (2083), 215, 183);
+ Add_Goto (Table.States (2083), 218, 184);
+ Add_Goto (Table.States (2083), 219, 185);
+ Add_Goto (Table.States (2083), 220, 186);
+ Add_Goto (Table.States (2083), 231, 2208);
+ Add_Goto (Table.States (2083), 232, 190);
+ Add_Goto (Table.States (2083), 233, 191);
+ Add_Goto (Table.States (2083), 234, 192);
+ Add_Goto (Table.States (2083), 237, 193);
+ Add_Goto (Table.States (2083), 251, 58);
+ Add_Goto (Table.States (2083), 252, 59);
+ Add_Goto (Table.States (2083), 255, 60);
+ Add_Goto (Table.States (2083), 256, 194);
+ Add_Goto (Table.States (2083), 268, 68);
+ Add_Goto (Table.States (2083), 311, 83);
+ Add_Goto (Table.States (2083), 465, 196);
+ Table.States (2083).Kernel := To_Vector ((0 => ((149, 0), 97, 1,
(32767, 0), 0)));
+ Table.States (2083).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ end Subr_70;
+ procedure Subr_71
+ is begin
+ Table.States (2084).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2084), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 47), 8);
+ Table.States (2084).Kernel := To_Vector ((0 => ((328, 47), 108,
0, (328, 47), 8)));
+ Table.States (2084).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 47), 8)));
+ Table.States (2085).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2085), 108, (328, 46), 2209);
+ Table.States (2085).Kernel := To_Vector ((0 => ((328, 46), 434,
1, (32767, 0), 0)));
+ Table.States (2085).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 46), 108, 2209)));
+ Table.States (2086).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (2086), 27, (328, 44), 2210);
+ Add_Action (Table.States (2086), 65, (170, 2), 821);
+ Add_Action (Table.States (2086), 67, (170, 0), 822);
+ Table.States (2086).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2086), 170, 1876);
+ Table.States (2086).Kernel := To_Vector ((((179, 0), 61, 2,
(32767, 0), 0), ((328, 44), 61, 4, (32767,
+ 0), 0), ((328, 45), 61, 2, (32767, 0), 0)));
+ Table.States (2086).Minimal_Complete_Actions := To_Vector
(((Shift, (170, 2), 65, 821), (Shift, (328, 44),
+ 27, 2210)));
+ Table.States (2087).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2087), (61, 108), (138, 9), 5);
+ Table.States (2087).Kernel := To_Vector ((0 => ((138, 9), 179,
0, (138, 9), 5)));
+ Table.States (2087).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (138, 9), 5)));
+ Table.States (2088).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2088), 61, (434, 0), 299);
+ Add_Action (Table.States (2088), 108, (328, 39), 2211);
+ Table.States (2088).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2088), 434, 2212);
+ Table.States (2088).Kernel := To_Vector ((((328, 38), 27, 3,
(32767, 0), 0), ((328, 39), 27, 1,
+ (32767, 0), 0)));
+ Table.States (2088).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 39), 108, 2211)));
+ Table.States (2089).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2089), 61, (179, 0), 2213);
+ Add_Action (Table.States (2089), 75, (182, 1), 1522);
+ Table.States (2089).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2089), 179, 2214);
+ Table.States (2089).Kernel := To_Vector ((((138, 6), 182, 3,
(32767, 0), 0), ((182, 1), 182, 2,
+ (32767, 0), 0), ((328, 36), 182, 5, (32767, 0), 0), ((328,
37), 182, 3, (32767, 0), 0)));
+ Table.States (2089).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (179, 0), 61, 2213)));
+ Table.States (2090).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2090), 27, (328, 30), 2215);
+ Table.States (2090).Kernel := To_Vector ((((328, 30), 61, 4,
(32767, 0), 0), ((328, 31), 61, 2,
+ (32767, 0), 0)));
+ Table.States (2090).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 30), 27, 2215)));
+ Table.States (2091).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (2091), 86, (252, 0), 33);
+ Add_Action (Table.States (2091), 90, (268, 0), 34);
+ Add_Action (Table.States (2091), 116, (196, 0), 146);
+ Add_Action (Table.States (2091), 117, (196, 1), 37);
+ Add_Action (Table.States (2091), 118, (195, 6), 38);
+ Table.States (2091).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (2091), 182, 2216);
+ Add_Goto (Table.States (2091), 195, 1152);
+ Add_Goto (Table.States (2091), 196, 148);
+ Add_Goto (Table.States (2091), 197, 54);
+ Add_Goto (Table.States (2091), 198, 55);
+ Add_Goto (Table.States (2091), 199, 56);
+ Add_Goto (Table.States (2091), 201, 57);
+ Add_Goto (Table.States (2091), 251, 58);
+ Add_Goto (Table.States (2091), 252, 59);
+ Add_Goto (Table.States (2091), 255, 60);
+ Add_Goto (Table.States (2091), 268, 68);
+ Add_Goto (Table.States (2091), 311, 83);
+ Table.States (2091).Kernel := To_Vector ((((328, 28), 75, 6,
(32767, 0), 0), ((328, 29), 75, 4,
+ (32767, 0), 0)));
+ Table.States (2091).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (2092).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2092), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (327, 14), 8);
+ Table.States (2092).Kernel := To_Vector ((0 => ((327, 14), 108,
0, (327, 14), 8)));
+ Table.States (2092).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (327, 14), 8)));
+ Table.States (2093).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2093), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (327, 13), 8);
+ Table.States (2093).Kernel := To_Vector ((0 => ((327, 13), 108,
0, (327, 13), 8)));
+ Table.States (2093).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (327, 13), 8)));
+ Table.States (2094).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2094), 108, (327, 12), 2217);
+ Table.States (2094).Kernel := To_Vector ((0 => ((327, 12), 434,
1, (32767, 0), 0)));
+ Table.States (2094).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (327, 12), 108, 2217)));
+ Table.States (2095).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2095), 61, (434, 0), 299);
+ Add_Action (Table.States (2095), 108, (328, 35), 2218);
+ Table.States (2095).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2095), 434, 2219);
+ Table.States (2095).Kernel := To_Vector ((((328, 34), 27, 3,
(32767, 0), 0), ((328, 35), 27, 1,
+ (32767, 0), 0)));
+ Table.States (2095).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 35), 108, 2218)));
+ Table.States (2096).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2096), 61, (179, 0), 2220);
+ Add_Action (Table.States (2096), 75, (182, 1), 1522);
+ Table.States (2096).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2096), 179, 2221);
+ Table.States (2096).Kernel := To_Vector ((((138, 3), 182, 3,
(32767, 0), 0), ((182, 1), 182, 2,
+ (32767, 0), 0), ((328, 32), 182, 5, (32767, 0), 0), ((328,
33), 182, 3, (32767, 0), 0)));
+ Table.States (2096).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (179, 0), 61, 2220)));
+ Table.States (2097).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (2097), 27, (328, 26), 2222);
+ Add_Action (Table.States (2097), 65, (170, 2), 821);
+ Add_Action (Table.States (2097), 67, (170, 0), 822);
+ Table.States (2097).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2097), 170, 1876);
+ Table.States (2097).Kernel := To_Vector ((((179, 0), 61, 2,
(32767, 0), 0), ((328, 26), 61, 4, (32767,
+ 0), 0), ((328, 27), 61, 2, (32767, 0), 0)));
+ Table.States (2097).Minimal_Complete_Actions := To_Vector
(((Shift, (170, 2), 65, 821), (Shift, (328, 26),
+ 27, 2222)));
+ Table.States (2098).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (2098), 86, (252, 0), 33);
+ Add_Action (Table.States (2098), 90, (268, 0), 34);
+ Add_Action (Table.States (2098), 116, (196, 0), 146);
+ Add_Action (Table.States (2098), 117, (196, 1), 37);
+ Add_Action (Table.States (2098), 118, (195, 6), 38);
+ Table.States (2098).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (2098), 182, 2223);
+ Add_Goto (Table.States (2098), 195, 1152);
+ Add_Goto (Table.States (2098), 196, 148);
+ Add_Goto (Table.States (2098), 197, 54);
+ Add_Goto (Table.States (2098), 198, 55);
+ Add_Goto (Table.States (2098), 199, 56);
+ Add_Goto (Table.States (2098), 201, 57);
+ Add_Goto (Table.States (2098), 251, 58);
+ Add_Goto (Table.States (2098), 252, 59);
+ Add_Goto (Table.States (2098), 255, 60);
+ Add_Goto (Table.States (2098), 268, 68);
+ Add_Goto (Table.States (2098), 311, 83);
+ Table.States (2098).Kernel := To_Vector ((((138, 0), 75, 4,
(32767, 0), 0), ((328, 24), 75, 6, (32767,
+ 0), 0), ((328, 25), 75, 4, (32767, 0), 0)));
+ Table.States (2098).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (2099).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2099), (61, 108), (138, 1), 5);
+ Table.States (2099).Kernel := To_Vector ((0 => ((138, 1), 179,
0, (138, 1), 5)));
+ Table.States (2099).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (138, 1), 5)));
+ Table.States (2100).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2100), (87, 108), (168, 0), 5);
+ Table.States (2100).Kernel := To_Vector ((0 => ((168, 0), 134,
0, (168, 0), 5)));
+ Table.States (2100).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (168, 0), 5)));
+ Table.States (2101).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2101), 27, (328, 18), 2224);
+ Table.States (2101).Kernel := To_Vector ((((328, 18), 61, 4,
(32767, 0), 0), ((328, 19), 61, 2,
+ (32767, 0), 0)));
+ Table.States (2101).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 18), 27, 2224)));
+ Table.States (2102).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (2102), 86, (252, 0), 33);
+ Add_Action (Table.States (2102), 90, (268, 0), 34);
+ Add_Action (Table.States (2102), 116, (196, 0), 146);
+ Add_Action (Table.States (2102), 117, (196, 1), 37);
+ Add_Action (Table.States (2102), 118, (195, 6), 38);
+ Table.States (2102).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (2102), 182, 2225);
+ Add_Goto (Table.States (2102), 195, 1152);
+ Add_Goto (Table.States (2102), 196, 148);
+ Add_Goto (Table.States (2102), 197, 54);
+ Add_Goto (Table.States (2102), 198, 55);
+ Add_Goto (Table.States (2102), 199, 56);
+ Add_Goto (Table.States (2102), 201, 57);
+ Add_Goto (Table.States (2102), 251, 58);
+ Add_Goto (Table.States (2102), 252, 59);
+ Add_Goto (Table.States (2102), 255, 60);
+ Add_Goto (Table.States (2102), 268, 68);
+ Add_Goto (Table.States (2102), 311, 83);
+ Table.States (2102).Kernel := To_Vector ((((328, 16), 75, 6,
(32767, 0), 0), ((328, 17), 75, 4,
+ (32767, 0), 0)));
+ Table.States (2102).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (2103).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2103), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (327, 6), 8);
+ Table.States (2103).Kernel := To_Vector ((0 => ((327, 6), 108,
0, (327, 6), 8)));
+ Table.States (2103).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (327, 6), 8)));
+ Table.States (2104).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2104), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (327, 5), 8);
+ Table.States (2104).Kernel := To_Vector ((0 => ((327, 5), 108,
0, (327, 5), 8)));
+ Table.States (2104).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (327, 5), 8)));
+ Table.States (2105).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2105), 108, (327, 4), 2226);
+ Table.States (2105).Kernel := To_Vector ((0 => ((327, 4), 434,
1, (32767, 0), 0)));
+ Table.States (2105).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (327, 4), 108, 2226)));
+ Table.States (2106).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2106), 61, (434, 0), 299);
+ Add_Action (Table.States (2106), 108, (328, 23), 2227);
+ Table.States (2106).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2106), 434, 2228);
+ Table.States (2106).Kernel := To_Vector ((((328, 22), 27, 3,
(32767, 0), 0), ((328, 23), 27, 1,
+ (32767, 0), 0)));
+ Table.States (2106).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 23), 108, 2227)));
+ Table.States (2107).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2107), 61, (328, 20), 2229);
+ Add_Action (Table.States (2107), 75, (182, 1), 1522);
+ Table.States (2107).Kernel := To_Vector ((((182, 1), 182, 2,
(32767, 0), 0), ((328, 20), 182, 5,
+ (32767, 0), 0), ((328, 21), 182, 3, (32767, 0), 0)));
+ Table.States (2107).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 20), 61, 2229)));
+ Table.States (2108).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2108), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (327, 8), 8);
+ Table.States (2108).Kernel := To_Vector ((0 => ((327, 8), 108,
0, (327, 8), 8)));
+ Table.States (2108).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (327, 8), 8)));
+ Table.States (2109).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2109), 27, (328, 14), 2230);
+ Table.States (2109).Kernel := To_Vector ((((328, 14), 61, 4,
(32767, 0), 0), ((328, 15), 61, 2,
+ (32767, 0), 0)));
+ Table.States (2109).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 14), 27, 2230)));
+ Table.States (2110).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (2110), 86, (252, 0), 33);
+ Add_Action (Table.States (2110), 90, (268, 0), 34);
+ Add_Action (Table.States (2110), 116, (196, 0), 146);
+ Add_Action (Table.States (2110), 117, (196, 1), 37);
+ Add_Action (Table.States (2110), 118, (195, 6), 38);
+ Table.States (2110).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (2110), 182, 2231);
+ Add_Goto (Table.States (2110), 195, 1152);
+ Add_Goto (Table.States (2110), 196, 148);
+ Add_Goto (Table.States (2110), 197, 54);
+ Add_Goto (Table.States (2110), 198, 55);
+ Add_Goto (Table.States (2110), 199, 56);
+ Add_Goto (Table.States (2110), 201, 57);
+ Add_Goto (Table.States (2110), 251, 58);
+ Add_Goto (Table.States (2110), 252, 59);
+ Add_Goto (Table.States (2110), 255, 60);
+ Add_Goto (Table.States (2110), 268, 68);
+ Add_Goto (Table.States (2110), 311, 83);
+ Table.States (2110).Kernel := To_Vector ((((328, 12), 75, 6,
(32767, 0), 0), ((328, 13), 75, 4,
+ (32767, 0), 0)));
+ Table.States (2110).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (2111).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2111), 61, (328, 6), 2232);
+ Add_Action (Table.States (2111), 75, (328, 4), 2233);
+ Table.States (2111).Kernel := To_Vector ((((328, 4), 131, 7,
(32767, 0), 0), ((328, 5), 131, 5,
+ (32767, 0), 0), ((328, 6), 131, 5, (32767, 0), 0), ((328, 7),
131, 3, (32767, 0), 0)));
+ Table.States (2111).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 6), 61, 2232)));
+ Table.States (2112).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2112), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (327, 3), 8);
+ Table.States (2112).Kernel := To_Vector ((0 => ((327, 3), 108,
0, (327, 3), 8)));
+ Table.States (2112).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (327, 3), 8)));
+ Table.States (2113).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2113), 108, (327, 2), 2234);
+ Table.States (2113).Kernel := To_Vector ((0 => ((327, 2), 434,
1, (32767, 0), 0)));
+ Table.States (2113).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (327, 2), 108, 2234)));
+ Table.States (2114).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2114), 61, (434, 0), 299);
+ Add_Action (Table.States (2114), 108, (327, 1), 2235);
+ Table.States (2114).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2114), 434, 2236);
+ Table.States (2114).Kernel := To_Vector ((((327, 0), 27, 3,
(32767, 0), 0), ((327, 1), 27, 1, (32767,
+ 0), 0)));
+ Table.States (2114).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (327, 1), 108, 2235)));
+ Table.States (2115).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2115), 27, (328, 10), 2237);
+ Table.States (2115).Kernel := To_Vector ((((328, 10), 61, 4,
(32767, 0), 0), ((328, 11), 61, 2,
+ (32767, 0), 0)));
+ Table.States (2115).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 10), 27, 2237)));
+ Table.States (2116).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (2116), 86, (252, 0), 33);
+ Add_Action (Table.States (2116), 90, (268, 0), 34);
+ Add_Action (Table.States (2116), 116, (196, 0), 146);
+ Add_Action (Table.States (2116), 117, (196, 1), 37);
+ Add_Action (Table.States (2116), 118, (195, 6), 38);
+ Table.States (2116).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (2116), 182, 2238);
+ Add_Goto (Table.States (2116), 195, 1152);
+ Add_Goto (Table.States (2116), 196, 148);
+ Add_Goto (Table.States (2116), 197, 54);
+ Add_Goto (Table.States (2116), 198, 55);
+ Add_Goto (Table.States (2116), 199, 56);
+ Add_Goto (Table.States (2116), 201, 57);
+ Add_Goto (Table.States (2116), 251, 58);
+ Add_Goto (Table.States (2116), 252, 59);
+ Add_Goto (Table.States (2116), 255, 60);
+ Add_Goto (Table.States (2116), 268, 68);
+ Add_Goto (Table.States (2116), 311, 83);
+ Table.States (2116).Kernel := To_Vector ((((328, 8), 75, 6,
(32767, 0), 0), ((328, 9), 75, 4, (32767,
+ 0), 0)));
+ Table.States (2116).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (2117).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2117), 61, (328, 2), 2239);
+ Add_Action (Table.States (2117), 75, (328, 0), 2240);
+ Table.States (2117).Kernel := To_Vector ((((328, 0), 131, 7,
(32767, 0), 0), ((328, 1), 131, 5,
+ (32767, 0), 0), ((328, 2), 131, 5, (32767, 0), 0), ((328, 3),
131, 3, (32767, 0), 0)));
+ Table.States (2117).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 2), 61, 2239)));
+ Table.States (2118).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2118), 61, (179, 0), 1913);
+ Add_Action (Table.States (2118), 75, (182, 1), 1522);
+ Table.States (2118).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2118), 179, 2087);
+ Table.States (2118).Kernel := To_Vector ((((138, 9), 182, 3,
(32767, 0), 0), ((182, 1), 182, 2,
+ (32767, 0), 0)));
+ Table.States (2118).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (179, 0), 61, 1913)));
+ Table.States (2119).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (2119), 86, (252, 0), 33);
+ Add_Action (Table.States (2119), 90, (268, 0), 34);
+ Add_Action (Table.States (2119), 116, (196, 0), 146);
+ Add_Action (Table.States (2119), 117, (196, 1), 37);
+ Add_Action (Table.States (2119), 118, (195, 6), 38);
+ Table.States (2119).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (2119), 182, 2241);
+ Add_Goto (Table.States (2119), 195, 1152);
+ Add_Goto (Table.States (2119), 196, 148);
+ Add_Goto (Table.States (2119), 197, 54);
+ Add_Goto (Table.States (2119), 198, 55);
+ Add_Goto (Table.States (2119), 199, 56);
+ Add_Goto (Table.States (2119), 201, 57);
+ Add_Goto (Table.States (2119), 251, 58);
+ Add_Goto (Table.States (2119), 252, 59);
+ Add_Goto (Table.States (2119), 255, 60);
+ Add_Goto (Table.States (2119), 268, 68);
+ Add_Goto (Table.States (2119), 311, 83);
+ Table.States (2119).Kernel := To_Vector ((0 => ((138, 6), 75, 4,
(32767, 0), 0)));
+ Table.States (2119).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (2120).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (2120), 86, (252, 0), 33);
+ Add_Action (Table.States (2120), 90, (268, 0), 34);
+ Add_Action (Table.States (2120), 116, (196, 0), 146);
+ Add_Action (Table.States (2120), 117, (196, 1), 37);
+ Add_Action (Table.States (2120), 118, (195, 6), 38);
+ Table.States (2120).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (2120), 182, 2242);
+ Add_Goto (Table.States (2120), 195, 1152);
+ Add_Goto (Table.States (2120), 196, 148);
+ Add_Goto (Table.States (2120), 197, 54);
+ Add_Goto (Table.States (2120), 198, 55);
+ Add_Goto (Table.States (2120), 199, 56);
+ Add_Goto (Table.States (2120), 201, 57);
+ Add_Goto (Table.States (2120), 251, 58);
+ Add_Goto (Table.States (2120), 252, 59);
+ Add_Goto (Table.States (2120), 255, 60);
+ Add_Goto (Table.States (2120), 268, 68);
+ Add_Goto (Table.States (2120), 311, 83);
+ Table.States (2120).Kernel := To_Vector ((0 => ((138, 3), 75, 4,
(32767, 0), 0)));
+ Table.States (2120).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (2121).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (2121), 61, (179, 0), 1913);
+ Add_Conflict (Table.States (2121), 61, (138, 2), 4);
+ Add_Action (Table.States (2121), 75, (138, 0), 2243);
+ Add_Action (Table.States (2121), 108, Reduce, (138, 2), 4);
+ Table.States (2121).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2121), 179, 2099);
+ Table.States (2121).Kernel := To_Vector ((((138, 0), 131, 5,
(32767, 0), 0), ((138, 1), 131, 3,
+ (32767, 0), 0), ((138, 2), 131, 0, (138, 2), 4)));
+ Table.States (2121).Minimal_Complete_Actions := To_Vector
(((Shift, (179, 0), 61, 1913), (Reduce, (138,
+ 2), 4)));
+ Table.States (2122).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2122), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (335, 0), 8);
+ Table.States (2122).Kernel := To_Vector ((0 => ((335, 0), 108,
0, (335, 0), 8)));
+ Table.States (2122).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (335, 0), 8)));
+ Table.States (2123).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (2123), (49, 61, 94, 108), (156, 0), 6);
+ Table.States (2123).Kernel := To_Vector ((0 => ((156, 0), 161,
0, (156, 0), 6)));
+ Table.States (2123).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (156, 0), 6)));
+ Table.States (2124).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2124), 92, (157, 0), 1935);
+ Table.States (2124).Kernel := To_Vector ((0 => ((157, 0), 74, 1,
(32767, 0), 0)));
+ Table.States (2124).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (157, 0), 92, 1935)));
+ Table.States (2125).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (2125), (49, 61, 94, 108), (159, 0), 6);
+ Table.States (2125).Kernel := To_Vector ((0 => ((159, 0), 161,
0, (159, 0), 6)));
+ Table.States (2125).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (159, 0), 6)));
+ Table.States (2126).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2126), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 0), 8);
+ Table.States (2126).Kernel := To_Vector ((0 => ((135, 0), 108,
0, (135, 0), 8)));
+ Table.States (2126).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 0), 8)));
+ Table.States (2127).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2127), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 32), 8);
+ Table.States (2127).Kernel := To_Vector ((0 => ((135, 32), 108,
0, (135, 32), 8)));
+ Table.States (2127).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 32), 8)));
+ Table.States (2128).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2128), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (135, 16), 8);
+ Table.States (2128).Kernel := To_Vector ((0 => ((135, 16), 108,
0, (135, 16), 8)));
+ Table.States (2128).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 16), 8)));
+ Table.States (2129).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (2129), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (286, 0), 8);
+ Table.States (2129).Kernel := To_Vector ((0 => ((286, 0), 108,
0, (286, 0), 8)));
+ Table.States (2129).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (286, 0), 8)));
+ Table.States (2130).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (2130), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (275, 0), 8);
+ Table.States (2130).Kernel := To_Vector ((0 => ((275, 0), 108,
0, (275, 0), 8)));
+ Table.States (2130).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (275, 0), 8)));
+ Table.States (2131).Action_List.Set_Capacity (29);
+ Add_Action (Table.States (2131), 45, Reduce, (234, 3), 1);
+ Add_Action (Table.States (2131), 47, Reduce, (234, 3), 1);
+ Add_Action (Table.States (2131), 48, Reduce, (234, 3), 1);
+ Add_Action (Table.States (2131), 49, Reduce, (234, 3), 1);
+ Add_Action (Table.States (2131), 52, Reduce, (234, 3), 1);
+ Add_Action (Table.States (2131), 71, (453, 0), 635);
+ Add_Action (Table.States (2131), 72, (153, 0), 636);
+ Add_Action (Table.States (2131), 73, Reduce, (234, 3), 1);
+ Add_Action (Table.States (2131), 74, (139, 0), 637);
+ Add_Action (Table.States (2131), 75, Reduce, (234, 3), 1);
+ Add_Action (Table.States (2131), 85, (162, 0), 612);
+ Add_Action (Table.States (2131), 87, (452, 0), 2244);
+ Add_Conflict (Table.States (2131), 87, (131, 3), 1);
+ Add_Conflict (Table.States (2131), 87, (234, 3), 1);
+ Add_Action (Table.States (2131), 89, Reduce, (234, 3), 1);
+ Add_Action (Table.States (2131), 95, Reduce, (234, 3), 1);
+ Add_Action (Table.States (2131), 96, (197, 0), 283);
+ Add_Action (Table.States (2131), 97, Reduce, (234, 3), 1);
+ Add_Action (Table.States (2131), 98, Reduce, (234, 3), 1);
+ Add_Action (Table.States (2131), 100, Reduce, (234, 3), 1);
+ Add_Action (Table.States (2131), 101, Reduce, (234, 3), 1);
+ Add_Action (Table.States (2131), 103, Reduce, (234, 3), 1);
+ Add_Action (Table.States (2131), 104, Reduce, (234, 3), 1);
+ Add_Action (Table.States (2131), 106, Reduce, (234, 3), 1);
+ Add_Action (Table.States (2131), 107, Reduce, (234, 3), 1);
+ Add_Action (Table.States (2131), 109, Reduce, (234, 3), 1);
+ Add_Action (Table.States (2131), 110, Reduce, (234, 3), 1);
+ Add_Action (Table.States (2131), 111, Reduce, (234, 3), 1);
+ Add_Action (Table.States (2131), 112, Reduce, (234, 3), 1);
+ Add_Action (Table.States (2131), 113, (121, 0), 285);
+ Add_Action (Table.States (2131), 114, (121, 1), 286);
+ Table.States (2131).Goto_List.Set_Capacity (8);
+ Add_Goto (Table.States (2131), 121, 638);
+ Add_Goto (Table.States (2131), 132, 639);
+ Add_Goto (Table.States (2131), 133, 640);
+ Add_Goto (Table.States (2131), 139, 641);
+ Add_Goto (Table.States (2131), 153, 642);
+ Add_Goto (Table.States (2131), 162, 643);
+ Add_Goto (Table.States (2131), 313, 289);
+ Add_Goto (Table.States (2131), 453, 644);
+ Table.States (2131).Kernel := To_Vector ((((131, 2), 195, 2,
(32767, 0), 0), ((131, 3), 195, 0, (131,
+ 3), 1), ((197, 0), 195, 2, (32767, 0), 0), ((198, 0), 195,
3, (32767, 0), 0), ((199, 0), 195, 2,
+ (32767, 0), 0), ((201, 0), 195, 2, (32767, 0), 0), ((203, 0),
195, 2, (32767, 0), 0), ((234, 3),
+ 195, 0, (234, 3), 1), ((255, 0), 195, 3, (32767, 0), 0),
((311, 0), 195, 3, (32767, 0), 0), ((452,
+ 0), 195, 1, (32767, 0), 0)));
+ Table.States (2131).Minimal_Complete_Actions := To_Vector
(((Reduce, (131, 3), 1), (Reduce, (234, 3),
+ 1)));
+ end Subr_71;
+ procedure Subr_72
+ is begin
+ Table.States (2132).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (2132), 86, (252, 0), 33);
+ Add_Action (Table.States (2132), 90, (268, 0), 34);
+ Add_Action (Table.States (2132), 116, (196, 0), 146);
+ Add_Action (Table.States (2132), 117, (196, 1), 37);
+ Add_Action (Table.States (2132), 118, (195, 6), 38);
+ Table.States (2132).Goto_List.Set_Capacity (13);
+ Add_Goto (Table.States (2132), 195, 1680);
+ Add_Goto (Table.States (2132), 196, 148);
+ Add_Goto (Table.States (2132), 197, 54);
+ Add_Goto (Table.States (2132), 198, 55);
+ Add_Goto (Table.States (2132), 199, 56);
+ Add_Goto (Table.States (2132), 201, 57);
+ Add_Goto (Table.States (2132), 251, 58);
+ Add_Goto (Table.States (2132), 252, 59);
+ Add_Goto (Table.States (2132), 255, 60);
+ Add_Goto (Table.States (2132), 268, 68);
+ Add_Goto (Table.States (2132), 311, 83);
+ Add_Goto (Table.States (2132), 451, 2245);
+ Add_Goto (Table.States (2132), 452, 2246);
+ Table.States (2132).Kernel := To_Vector ((((451, 1), 95, 4,
(32767, 0), 0), ((451, 2), 95, 4, (32767,
+ 0), 0)));
+ Table.States (2133).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2133), (87, 95), (463, 1), 3);
+ Table.States (2133).Kernel := To_Vector ((((463, 0), 303, 0,
(463, 0), 1), ((463, 1), 303, 0, (463,
+ 1), 3)));
+ Table.States (2133).Minimal_Complete_Actions := To_Vector
(((Reduce, (463, 0), 1), (Reduce, (463, 1),
+ 3)));
+ Table.States (2134).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2134), (87, 95), (463, 2), 3);
+ Table.States (2134).Kernel := To_Vector ((((463, 1), 463, 3,
(32767, 0), 0), ((463, 2), 463, 0, (463,
+ 2), 3), ((463, 2), 463, 3, (32767, 0), 0)));
+ Table.States (2134).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (463, 2), 3)));
+ Table.States (2135).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2135), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (309, 3), 8);
+ Table.States (2135).Kernel := To_Vector ((0 => ((309, 3), 108,
0, (309, 3), 8)));
+ Table.States (2135).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (309, 3), 8)));
+ Table.States (2136).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2136), 108, (309, 2), 2247);
+ Table.States (2136).Kernel := To_Vector ((0 => ((309, 2), 308,
1, (32767, 0), 0)));
+ Table.States (2136).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (309, 2), 108, 2247)));
+ Table.States (2137).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2137), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (356, 1), 8);
+ Table.States (2137).Kernel := To_Vector ((0 => ((356, 1), 108,
0, (356, 1), 8)));
+ Table.States (2137).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (356, 1), 8)));
+ Table.States (2138).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2138), 108, (356, 0), 2248);
+ Table.States (2138).Kernel := To_Vector ((0 => ((356, 0), 434,
1, (32767, 0), 0)));
+ Table.States (2138).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (356, 0), 108, 2248)));
+ Table.States (2139).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2139), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (408, 6), 8);
+ Table.States (2139).Kernel := To_Vector ((0 => ((408, 6), 108,
0, (408, 6), 8)));
+ Table.States (2139).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (408, 6), 8)));
+ Table.States (2140).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2140), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (408, 2), 8);
+ Table.States (2140).Kernel := To_Vector ((0 => ((408, 2), 108,
0, (408, 2), 8)));
+ Table.States (2140).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (408, 2), 8)));
+ Table.States (2141).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2141), 108, (309, 1), 2249);
+ Table.States (2141).Kernel := To_Vector ((0 => ((309, 1), 308,
1, (32767, 0), 0)));
+ Table.States (2141).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (309, 1), 108, 2249)));
+ Table.States (2142).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (2142), 86, (252, 0), 33);
+ Add_Action (Table.States (2142), 90, (268, 0), 34);
+ Add_Action (Table.States (2142), 108, Reduce, (308, 1), 0);
+ Add_Action (Table.States (2142), 116, (196, 0), 146);
+ Add_Action (Table.States (2142), 117, (196, 1), 37);
+ Add_Action (Table.States (2142), 118, (195, 6), 38);
+ Table.States (2142).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (2142), 195, 1063);
+ Add_Goto (Table.States (2142), 196, 148);
+ Add_Goto (Table.States (2142), 197, 54);
+ Add_Goto (Table.States (2142), 198, 55);
+ Add_Goto (Table.States (2142), 199, 56);
+ Add_Goto (Table.States (2142), 201, 57);
+ Add_Goto (Table.States (2142), 251, 58);
+ Add_Goto (Table.States (2142), 252, 59);
+ Add_Goto (Table.States (2142), 255, 60);
+ Add_Goto (Table.States (2142), 268, 68);
+ Add_Goto (Table.States (2142), 308, 2250);
+ Add_Goto (Table.States (2142), 311, 83);
+ Table.States (2142).Kernel := To_Vector ((0 => ((309, 0), 66, 1,
(32767, 0), 0)));
+ Table.States (2142).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (308, 1), 0)));
+ Table.States (2143).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2143), (87, 95), (456, 1), 3);
+ Table.States (2143).Kernel := To_Vector ((((456, 0), 163, 0,
(456, 0), 1), ((456, 1), 163, 0, (456,
+ 1), 3)));
+ Table.States (2143).Minimal_Complete_Actions := To_Vector
(((Reduce, (456, 0), 1), (Reduce, (456, 1),
+ 3)));
+ Table.States (2144).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2144), (87, 95), (456, 2), 3);
+ Table.States (2144).Kernel := To_Vector ((((456, 1), 456, 2,
(32767, 0), 0), ((456, 2), 456, 0, (456,
+ 2), 3), ((456, 2), 456, 2, (32767, 0), 0)));
+ Table.States (2144).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (456, 2), 3)));
+ Table.States (2145).Action_List.Set_Capacity (14);
+ Add_Action (Table.States (2145), 12, (402, 0), 165);
+ Add_Action (Table.States (2145), 46, (233, 2), 167);
+ Add_Action (Table.States (2145), 52, (233, 3), 168);
+ Add_Action (Table.States (2145), 65, (234, 1), 169);
+ Add_Action (Table.States (2145), 76, (256, 0), 170);
+ Add_Action (Table.States (2145), 85, (205, 4), 171);
+ Add_Action (Table.States (2145), 86, (213, 2), 172);
+ Add_Action (Table.States (2145), 90, (268, 0), 34);
+ Add_Action (Table.States (2145), 106, (237, 1), 173);
+ Add_Action (Table.States (2145), 107, (237, 0), 174);
+ Add_Action (Table.States (2145), 115, (234, 0), 175);
+ Add_Action (Table.States (2145), 116, (196, 0), 146);
+ Add_Action (Table.States (2145), 117, (196, 1), 37);
+ Add_Action (Table.States (2145), 118, (195, 6), 38);
+ Table.States (2145).Goto_List.Set_Capacity (31);
+ Add_Goto (Table.States (2145), 195, 176);
+ Add_Goto (Table.States (2145), 196, 148);
+ Add_Goto (Table.States (2145), 197, 54);
+ Add_Goto (Table.States (2145), 198, 55);
+ Add_Goto (Table.States (2145), 199, 56);
+ Add_Goto (Table.States (2145), 201, 57);
+ Add_Goto (Table.States (2145), 205, 177);
+ Add_Goto (Table.States (2145), 206, 178);
+ Add_Goto (Table.States (2145), 210, 179);
+ Add_Goto (Table.States (2145), 211, 180);
+ Add_Goto (Table.States (2145), 213, 181);
+ Add_Goto (Table.States (2145), 214, 182);
+ Add_Goto (Table.States (2145), 215, 183);
+ Add_Goto (Table.States (2145), 218, 184);
+ Add_Goto (Table.States (2145), 219, 185);
+ Add_Goto (Table.States (2145), 220, 186);
+ Add_Goto (Table.States (2145), 227, 2251);
+ Add_Goto (Table.States (2145), 228, 188);
+ Add_Goto (Table.States (2145), 231, 189);
+ Add_Goto (Table.States (2145), 232, 190);
+ Add_Goto (Table.States (2145), 233, 191);
+ Add_Goto (Table.States (2145), 234, 192);
+ Add_Goto (Table.States (2145), 237, 193);
+ Add_Goto (Table.States (2145), 251, 58);
+ Add_Goto (Table.States (2145), 252, 59);
+ Add_Goto (Table.States (2145), 255, 60);
+ Add_Goto (Table.States (2145), 256, 194);
+ Add_Goto (Table.States (2145), 268, 68);
+ Add_Goto (Table.States (2145), 311, 83);
+ Add_Goto (Table.States (2145), 402, 195);
+ Add_Goto (Table.States (2145), 465, 196);
+ Table.States (2145).Kernel := To_Vector ((0 => ((240, 0), 43, 1,
(32767, 0), 0)));
+ Table.States (2145).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (2146).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2146), (1 => 87), (242, 0), 7);
+ Table.States (2146).Kernel := To_Vector ((0 => ((242, 0), 227,
0, (242, 0), 7)));
+ Table.States (2146).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (242, 0), 7)));
+ Table.States (2147).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2147), (87, 95), (246, 0), 4);
+ Table.States (2147).Kernel := To_Vector ((0 => ((246, 0), 227,
0, (246, 0), 4)));
+ Table.States (2147).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (246, 0), 4)));
+ Table.States (2148).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2148), 108, Reduce, (284, 1), 0);
+ Add_Action (Table.States (2148), 116, (284, 0), 1312);
+ Table.States (2148).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2148), 284, 2252);
+ Table.States (2148).Kernel := To_Vector ((0 => ((357, 0), 66, 1,
(32767, 0), 0)));
+ Table.States (2148).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (284, 1), 0)));
+ Table.States (2149).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (2149), (28, 50, 53, 54, 61, 83, 84,
116), (430, 0), 8);
+ Table.States (2149).Kernel := To_Vector ((0 => ((430, 0), 108,
0, (430, 0), 8)));
+ Table.States (2149).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (430, 0), 8)));
+ Table.States (2150).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (2150), (49, 61, 108), (415, 13), 5);
+ Table.States (2150).Kernel := To_Vector ((0 => ((415, 13), 27,
0, (415, 13), 5)));
+ Table.States (2150).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (415, 13), 5)));
+ Table.States (2151).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2151), 61, (415, 12), 2253);
+ Add_Action (Table.States (2151), 75, (182, 1), 1522);
+ Table.States (2151).Kernel := To_Vector ((((182, 1), 182, 2,
(32767, 0), 0), ((415, 12), 182, 2,
+ (32767, 0), 0)));
+ Table.States (2151).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (415, 12), 61, 2253)));
+ Table.States (2152).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (2152), (28, 50, 53, 54, 61, 83, 84,
116), (412, 4), 8);
+ Table.States (2152).Kernel := To_Vector ((0 => ((412, 4), 108,
0, (412, 4), 8)));
+ Table.States (2152).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (412, 4), 8)));
+ Table.States (2153).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2153), 27, (415, 15), 2254);
+ Table.States (2153).Kernel := To_Vector ((0 => ((415, 15), 61,
1, (32767, 0), 0)));
+ Table.States (2153).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (415, 15), 27, 2254)));
+ Table.States (2154).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (2154), (49, 61, 108), (415, 10), 5);
+ Table.States (2154).Kernel := To_Vector ((0 => ((415, 10), 27,
0, (415, 10), 5)));
+ Table.States (2154).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (415, 10), 5)));
+ Table.States (2155).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2155), 61, (415, 9), 2255);
+ Add_Action (Table.States (2155), 75, (182, 1), 1522);
+ Table.States (2155).Kernel := To_Vector ((((182, 1), 182, 2,
(32767, 0), 0), ((415, 9), 182, 2,
+ (32767, 0), 0)));
+ Table.States (2155).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (415, 9), 61, 2255)));
+ Table.States (2156).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2156), 27, (415, 4), 2256);
+ Table.States (2156).Kernel := To_Vector ((0 => ((415, 4), 61, 1,
(32767, 0), 0)));
+ Table.States (2156).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (415, 4), 27, 2256)));
+ Table.States (2157).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (2157), 86, (252, 0), 33);
+ Add_Action (Table.States (2157), 90, (268, 0), 34);
+ Add_Action (Table.States (2157), 116, (196, 0), 146);
+ Add_Action (Table.States (2157), 117, (196, 1), 37);
+ Add_Action (Table.States (2157), 118, (195, 6), 38);
+ Table.States (2157).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (2157), 182, 2257);
+ Add_Goto (Table.States (2157), 195, 1152);
+ Add_Goto (Table.States (2157), 196, 148);
+ Add_Goto (Table.States (2157), 197, 54);
+ Add_Goto (Table.States (2157), 198, 55);
+ Add_Goto (Table.States (2157), 199, 56);
+ Add_Goto (Table.States (2157), 201, 57);
+ Add_Goto (Table.States (2157), 251, 58);
+ Add_Goto (Table.States (2157), 252, 59);
+ Add_Goto (Table.States (2157), 255, 60);
+ Add_Goto (Table.States (2157), 268, 68);
+ Add_Goto (Table.States (2157), 311, 83);
+ Table.States (2157).Kernel := To_Vector ((0 => ((415, 3), 75, 3,
(32767, 0), 0)));
+ Table.States (2157).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (2158).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (2158), (49, 61, 108), (415, 7), 5);
+ Table.States (2158).Kernel := To_Vector ((0 => ((415, 7), 27, 0,
(415, 7), 5)));
+ Table.States (2158).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (415, 7), 5)));
+ Table.States (2159).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2159), 61, (415, 6), 2258);
+ Add_Action (Table.States (2159), 75, (182, 1), 1522);
+ Table.States (2159).Kernel := To_Vector ((((182, 1), 182, 2,
(32767, 0), 0), ((415, 6), 182, 2,
+ (32767, 0), 0)));
+ Table.States (2159).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (415, 6), 61, 2258)));
+ Table.States (2160).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2160), 27, (415, 1), 2259);
+ Table.States (2160).Kernel := To_Vector ((0 => ((415, 1), 61, 1,
(32767, 0), 0)));
+ Table.States (2160).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (415, 1), 27, 2259)));
+ Table.States (2161).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (2161), 86, (252, 0), 33);
+ Add_Action (Table.States (2161), 90, (268, 0), 34);
+ Add_Action (Table.States (2161), 116, (196, 0), 146);
+ Add_Action (Table.States (2161), 117, (196, 1), 37);
+ Add_Action (Table.States (2161), 118, (195, 6), 38);
+ Table.States (2161).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (2161), 182, 2260);
+ Add_Goto (Table.States (2161), 195, 1152);
+ Add_Goto (Table.States (2161), 196, 148);
+ Add_Goto (Table.States (2161), 197, 54);
+ Add_Goto (Table.States (2161), 198, 55);
+ Add_Goto (Table.States (2161), 199, 56);
+ Add_Goto (Table.States (2161), 201, 57);
+ Add_Goto (Table.States (2161), 251, 58);
+ Add_Goto (Table.States (2161), 252, 59);
+ Add_Goto (Table.States (2161), 255, 60);
+ Add_Goto (Table.States (2161), 268, 68);
+ Add_Goto (Table.States (2161), 311, 83);
+ Table.States (2161).Kernel := To_Vector ((0 => ((415, 0), 75, 3,
(32767, 0), 0)));
+ Table.States (2161).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (2162).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (2162), (28, 50, 53, 54, 61, 83, 84,
116), (411, 5), 8);
+ Table.States (2162).Kernel := To_Vector ((0 => ((411, 5), 108,
0, (411, 5), 8)));
+ Table.States (2162).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (411, 5), 8)));
+ Table.States (2163).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2163), 108, (411, 4), 2261);
+ Table.States (2163).Kernel := To_Vector ((0 => ((411, 4), 434,
1, (32767, 0), 0)));
+ Table.States (2163).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (411, 4), 108, 2261)));
+ Table.States (2164).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (2164), 85, (198, 0), 281);
+ Add_Action (Table.States (2164), 96, (197, 0), 283);
+ Add_Action (Table.States (2164), 108, (412, 0), 2262);
+ Add_Action (Table.States (2164), 113, (121, 0), 285);
+ Add_Action (Table.States (2164), 114, (121, 1), 286);
+ Table.States (2164).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (2164), 121, 287);
+ Add_Goto (Table.States (2164), 313, 289);
+ Table.States (2164).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((412, 0), 195, 1, (32767, 0), 0)));
+ Table.States (2164).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (412, 0), 108, 2262)));
+ Table.States (2165).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (2165), 61, (434, 0), 299);
+ Add_Action (Table.States (2165), 85, (198, 0), 281);
+ Add_Action (Table.States (2165), 96, (197, 0), 283);
+ Add_Action (Table.States (2165), 108, (411, 1), 2263);
+ Add_Action (Table.States (2165), 113, (121, 0), 285);
+ Add_Action (Table.States (2165), 114, (121, 1), 286);
+ Table.States (2165).Goto_List.Set_Capacity (3);
+ Add_Goto (Table.States (2165), 121, 287);
+ Add_Goto (Table.States (2165), 313, 289);
+ Add_Goto (Table.States (2165), 434, 2264);
+ Table.States (2165).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((411, 0), 195, 3, (32767, 0), 0),
+ ((411, 1), 195, 1, (32767, 0), 0)));
+ Table.States (2165).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (411, 1), 108, 2263)));
+ Table.States (2166).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (2166), (28, 50, 53, 54, 61, 83, 84,
116), (409, 0), 8);
+ Table.States (2166).Kernel := To_Vector ((0 => ((409, 0), 108,
0, (409, 0), 8)));
+ Table.States (2166).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (409, 0), 8)));
+ Table.States (2167).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2167), 108, (326, 2), 2265);
+ Table.States (2167).Kernel := To_Vector ((0 => ((326, 2), 308,
1, (32767, 0), 0)));
+ Table.States (2167).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (326, 2), 108, 2265)));
+ Table.States (2168).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (2168), 86, (252, 0), 33);
+ Add_Action (Table.States (2168), 90, (268, 0), 34);
+ Add_Action (Table.States (2168), 108, Reduce, (308, 1), 0);
+ Add_Action (Table.States (2168), 116, (196, 0), 146);
+ Add_Action (Table.States (2168), 117, (196, 1), 37);
+ Add_Action (Table.States (2168), 118, (195, 6), 38);
+ Table.States (2168).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (2168), 195, 1063);
+ Add_Goto (Table.States (2168), 196, 148);
+ Add_Goto (Table.States (2168), 197, 54);
+ Add_Goto (Table.States (2168), 198, 55);
+ Add_Goto (Table.States (2168), 199, 56);
+ Add_Goto (Table.States (2168), 201, 57);
+ Add_Goto (Table.States (2168), 251, 58);
+ Add_Goto (Table.States (2168), 252, 59);
+ Add_Goto (Table.States (2168), 255, 60);
+ Add_Goto (Table.States (2168), 268, 68);
+ Add_Goto (Table.States (2168), 308, 2266);
+ Add_Goto (Table.States (2168), 311, 83);
+ Table.States (2168).Kernel := To_Vector ((0 => ((326, 0), 66, 1,
(32767, 0), 0)));
+ Table.States (2168).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (308, 1), 0)));
+ Table.States (2169).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2169), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (326, 1), 9);
+ Table.States (2169).Kernel := To_Vector ((0 => ((326, 1), 108,
0, (326, 1), 9)));
+ Table.States (2169).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (326, 1), 9)));
+ Table.States (2170).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2170), (1 => 108), (325, 0), 9);
+ Table.States (2170).Kernel := To_Vector ((0 => ((325, 0), 308,
0, (325, 0), 9)));
+ Table.States (2170).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (325, 0), 9)));
+ Table.States (2171).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (2171), 12, (401, 0), 1);
+ Add_Action (Table.States (2171), 15, (370, 0), 3);
+ Add_Action (Table.States (2171), 17, (365, 0), 4);
+ Add_Action (Table.States (2171), 18, (382, 0), 5);
+ Add_Action (Table.States (2171), 19, (363, 0), 6);
+ Add_Action (Table.States (2171), 20, (357, 0), 7);
+ Add_Action (Table.States (2171), 30, (316, 0), 13);
+ Add_Action (Table.States (2171), 31, (290, 0), 14);
+ Add_Action (Table.States (2171), 32, (289, 0), 15);
+ Add_Action (Table.States (2171), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (2171), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (2171), 37, (288, 0), 17);
+ Add_Conflict (Table.States (2171), 37, (285, 1), 0);
+ Add_Action (Table.States (2171), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (2171), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (2171), 42, (271, 0), 18);
+ Add_Action (Table.States (2171), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (2171), 64, (273, 0), 27);
+ Add_Action (Table.States (2171), 65, (264, 0), 28);
+ Add_Action (Table.States (2171), 84, (124, 0), 32);
+ Add_Action (Table.States (2171), 86, (252, 0), 33);
+ Add_Action (Table.States (2171), 90, (268, 0), 34);
+ Add_Action (Table.States (2171), 105, (265, 0), 35);
+ Add_Action (Table.States (2171), 116, (196, 0), 146);
+ Add_Action (Table.States (2171), 117, (196, 1), 37);
+ Add_Action (Table.States (2171), 118, (195, 6), 38);
+ Table.States (2171).Goto_List.Set_Capacity (45);
+ Add_Goto (Table.States (2171), 124, 39);
+ Add_Goto (Table.States (2171), 195, 52);
+ Add_Goto (Table.States (2171), 196, 53);
+ Add_Goto (Table.States (2171), 197, 54);
+ Add_Goto (Table.States (2171), 198, 55);
+ Add_Goto (Table.States (2171), 199, 56);
+ Add_Goto (Table.States (2171), 201, 57);
+ Add_Goto (Table.States (2171), 251, 58);
+ Add_Goto (Table.States (2171), 252, 59);
+ Add_Goto (Table.States (2171), 255, 60);
+ Add_Goto (Table.States (2171), 259, 2267);
+ Add_Goto (Table.States (2171), 261, 331);
+ Add_Goto (Table.States (2171), 262, 62);
+ Add_Goto (Table.States (2171), 263, 63);
+ Add_Goto (Table.States (2171), 264, 64);
+ Add_Goto (Table.States (2171), 265, 65);
+ Add_Goto (Table.States (2171), 266, 66);
+ Add_Goto (Table.States (2171), 267, 67);
+ Add_Goto (Table.States (2171), 268, 68);
+ Add_Goto (Table.States (2171), 271, 69);
+ Add_Goto (Table.States (2171), 273, 70);
+ Add_Goto (Table.States (2171), 275, 71);
+ Add_Goto (Table.States (2171), 285, 72);
+ Add_Goto (Table.States (2171), 286, 73);
+ Add_Goto (Table.States (2171), 288, 74);
+ Add_Goto (Table.States (2171), 289, 75);
+ Add_Goto (Table.States (2171), 290, 76);
+ Add_Goto (Table.States (2171), 310, 82);
+ Add_Goto (Table.States (2171), 311, 83);
+ Add_Goto (Table.States (2171), 316, 84);
+ Add_Goto (Table.States (2171), 318, 85);
+ Add_Goto (Table.States (2171), 357, 110);
+ Add_Goto (Table.States (2171), 363, 111);
+ Add_Goto (Table.States (2171), 364, 112);
+ Add_Goto (Table.States (2171), 365, 113);
+ Add_Goto (Table.States (2171), 366, 114);
+ Add_Goto (Table.States (2171), 367, 115);
+ Add_Goto (Table.States (2171), 370, 116);
+ Add_Goto (Table.States (2171), 376, 117);
+ Add_Goto (Table.States (2171), 378, 118);
+ Add_Goto (Table.States (2171), 379, 119);
+ Add_Goto (Table.States (2171), 382, 120);
+ Add_Goto (Table.States (2171), 401, 133);
+ Add_Goto (Table.States (2171), 461, 332);
+ Add_Goto (Table.States (2171), 462, 144);
+ Table.States (2171).Kernel := To_Vector ((0 => ((398, 0), 99, 2,
(32767, 0), 0)));
+ Table.States (2171).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ end Subr_72;
+ procedure Subr_73
+ is begin
+ Table.States (2172).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (2172), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (271, 2), 9);
+ Table.States (2172).Kernel := To_Vector ((0 => ((271, 2), 108,
0, (271, 2), 9)));
+ Table.States (2172).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (271, 2), 9)));
+ Table.States (2173).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2173), 108, (271, 0), 2268);
+ Table.States (2173).Kernel := To_Vector ((0 => ((271, 0), 42, 1,
(32767, 0), 0)));
+ Table.States (2173).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (271, 0), 108, 2268)));
+ Table.States (2174).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2174), (87, 108), (300, 0), 7);
+ Table.States (2174).Kernel := To_Vector ((0 => ((300, 0), 134,
0, (300, 0), 7)));
+ Table.States (2174).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (300, 0), 7)));
+ Table.States (2175).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2175), (1 => 97), (443, 0), 1);
+ Table.States (2175).Kernel := To_Vector ((0 => ((443, 0), 231,
0, (443, 0), 1)));
+ Table.States (2175).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (443, 0), 1)));
+ Table.States (2176).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2176), 97, (441, 0), 2269);
+ Table.States (2176).Kernel := To_Vector ((0 => ((441, 0), 443,
3, (32767, 0), 0)));
+ Table.States (2176).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (441, 0), 97, 2269)));
+ Table.States (2177).Action_List.Set_Capacity (44);
+ Add_Action (Table.States (2177), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 63, 64, 65, 66, 77,
81, 83, 84, 86, 90, 105, 116, 117, 118,
+ 119), (440, 2), 9);
+ Table.States (2177).Kernel := To_Vector ((0 => ((440, 2), 108,
0, (440, 2), 9)));
+ Table.States (2177).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (440, 2), 9)));
+ Table.States (2178).Action_List.Set_Capacity (44);
+ Add_Action (Table.States (2178), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 63, 64, 65, 66, 77,
81, 83, 84, 86, 90, 105, 116, 117, 118,
+ 119), (440, 1), 9);
+ Table.States (2178).Kernel := To_Vector ((0 => ((440, 1), 108,
0, (440, 1), 9)));
+ Table.States (2178).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (440, 1), 9)));
+ Table.States (2179).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (2179), 85, (198, 0), 281);
+ Add_Action (Table.States (2179), 96, (197, 0), 283);
+ Add_Action (Table.States (2179), 108, (440, 0), 2270);
+ Add_Action (Table.States (2179), 113, (121, 0), 285);
+ Add_Action (Table.States (2179), 114, (121, 1), 286);
+ Table.States (2179).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (2179), 121, 287);
+ Add_Goto (Table.States (2179), 313, 289);
+ Table.States (2179).Kernel := To_Vector ((((197, 0), 195, 2,
(32767, 0), 0), ((198, 0), 195, 3,
+ (32767, 0), 0), ((199, 0), 195, 2, (32767, 0), 0), ((201, 0),
195, 2, (32767, 0), 0), ((255, 0),
+ 195, 3, (32767, 0), 0), ((311, 0), 195, 3, (32767, 0), 0),
((440, 0), 195, 1, (32767, 0), 0)));
+ Table.States (2179).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (440, 0), 108, 2270)));
+ Table.States (2180).Action_List.Set_Capacity (44);
+ Add_Action (Table.States (2180), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 63, 64, 65, 66, 77,
81, 83, 84, 86, 90, 105, 116, 117, 118,
+ 119), (440, 4), 9);
+ Table.States (2180).Kernel := To_Vector ((0 => ((440, 4), 108,
0, (440, 4), 9)));
+ Table.States (2180).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (440, 4), 9)));
+ Table.States (2181).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2181), 47, (362, 0), 2271);
+ Table.States (2181).Kernel := To_Vector ((0 => ((362, 0), 116,
2, (32767, 0), 0)));
+ Table.States (2181).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (362, 0), 47, 2271)));
+ Table.States (2182).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (2182), 61, Reduce, (295, 1), 0);
+ Add_Action (Table.States (2182), 63, Reduce, (295, 1), 0);
+ Add_Action (Table.States (2182), 85, (299, 0), 1257);
+ Table.States (2182).Goto_List.Set_Capacity (2);
+ Add_Goto (Table.States (2182), 295, 2272);
+ Add_Goto (Table.States (2182), 299, 426);
+ Table.States (2182).Kernel := To_Vector ((0 => ((360, 0), 87, 0,
(295, 1), 0)));
+ Table.States (2182).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (295, 1), 0)));
+ Table.States (2183).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2183), (1 => 82), (361, 0), 2);
+ Table.States (2183).Kernel := To_Vector ((0 => ((361, 0), 243,
0, (361, 0), 2)));
+ Table.States (2183).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (361, 0), 2)));
+ Table.States (2184).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (2184), 22, (339, 0), 9);
+ Add_Action (Table.States (2184), 25, (329, 1), 10);
+ Add_Action (Table.States (2184), 28, (325, 0), 12);
+ Add_Action (Table.States (2184), 38, Reduce, (192, 1), 0);
+ Add_Action (Table.States (2184), 50, (332, 0), 19);
+ Add_Action (Table.States (2184), 51, (437, 0), 221);
+ Add_Action (Table.States (2184), 52, (329, 0), 21);
+ Add_Action (Table.States (2184), 53, (294, 0), 22);
+ Add_Action (Table.States (2184), 54, (293, 0), 23);
+ Add_Action (Table.States (2184), 59, (346, 0), 24);
+ Add_Action (Table.States (2184), 60, (340, 0), 25);
+ Add_Action (Table.States (2184), 81, (130, 0), 30);
+ Add_Action (Table.States (2184), 83, (128, 0), 31);
+ Add_Action (Table.States (2184), 84, (124, 0), 32);
+ Add_Action (Table.States (2184), 116, (136, 0), 223);
+ Table.States (2184).Goto_List.Set_Capacity (60);
+ Add_Goto (Table.States (2184), 124, 561);
+ Add_Goto (Table.States (2184), 126, 40);
+ Add_Goto (Table.States (2184), 127, 41);
+ Add_Goto (Table.States (2184), 128, 42);
+ Add_Goto (Table.States (2184), 130, 43);
+ Add_Goto (Table.States (2184), 135, 44);
+ Add_Goto (Table.States (2184), 136, 45);
+ Add_Goto (Table.States (2184), 137, 46);
+ Add_Goto (Table.States (2184), 180, 47);
+ Add_Goto (Table.States (2184), 189, 48);
+ Add_Goto (Table.States (2184), 190, 562);
+ Add_Goto (Table.States (2184), 191, 563);
+ Add_Goto (Table.States (2184), 192, 2273);
+ Add_Goto (Table.States (2184), 193, 50);
+ Add_Goto (Table.States (2184), 194, 51);
+ Add_Goto (Table.States (2184), 291, 77);
+ Add_Goto (Table.States (2184), 292, 78);
+ Add_Goto (Table.States (2184), 293, 79);
+ Add_Goto (Table.States (2184), 294, 80);
+ Add_Goto (Table.States (2184), 309, 81);
+ Add_Goto (Table.States (2184), 320, 86);
+ Add_Goto (Table.States (2184), 321, 87);
+ Add_Goto (Table.States (2184), 322, 88);
+ Add_Goto (Table.States (2184), 325, 89);
+ Add_Goto (Table.States (2184), 326, 90);
+ Add_Goto (Table.States (2184), 327, 91);
+ Add_Goto (Table.States (2184), 328, 92);
+ Add_Goto (Table.States (2184), 329, 225);
+ Add_Goto (Table.States (2184), 330, 94);
+ Add_Goto (Table.States (2184), 332, 95);
+ Add_Goto (Table.States (2184), 333, 96);
+ Add_Goto (Table.States (2184), 334, 97);
+ Add_Goto (Table.States (2184), 335, 98);
+ Add_Goto (Table.States (2184), 336, 99);
+ Add_Goto (Table.States (2184), 337, 100);
+ Add_Goto (Table.States (2184), 338, 101);
+ Add_Goto (Table.States (2184), 339, 102);
+ Add_Goto (Table.States (2184), 340, 103);
+ Add_Goto (Table.States (2184), 341, 104);
+ Add_Goto (Table.States (2184), 345, 105);
+ Add_Goto (Table.States (2184), 346, 106);
+ Add_Goto (Table.States (2184), 347, 107);
+ Add_Goto (Table.States (2184), 354, 108);
+ Add_Goto (Table.States (2184), 388, 126);
+ Add_Goto (Table.States (2184), 389, 127);
+ Add_Goto (Table.States (2184), 390, 128);
+ Add_Goto (Table.States (2184), 391, 129);
+ Add_Goto (Table.States (2184), 392, 130);
+ Add_Goto (Table.States (2184), 394, 132);
+ Add_Goto (Table.States (2184), 403, 134);
+ Add_Goto (Table.States (2184), 404, 135);
+ Add_Goto (Table.States (2184), 405, 136);
+ Add_Goto (Table.States (2184), 406, 137);
+ Add_Goto (Table.States (2184), 408, 138);
+ Add_Goto (Table.States (2184), 431, 139);
+ Add_Goto (Table.States (2184), 437, 140);
+ Add_Goto (Table.States (2184), 438, 141);
+ Add_Goto (Table.States (2184), 440, 142);
+ Add_Goto (Table.States (2184), 454, 143);
+ Add_Goto (Table.States (2184), 458, 565);
+ Table.States (2184).Kernel := To_Vector ((0 => ((359, 1), 82, 5,
(32767, 0), 0)));
+ Table.States (2184).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (192, 1), 0)));
+ Table.States (2185).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2185), 82, (359, 0), 2274);
+ Table.States (2185).Kernel := To_Vector ((0 => ((359, 0), 361,
6, (32767, 0), 0)));
+ Table.States (2185).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (359, 0), 82, 2274)));
+ Table.States (2186).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2186), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (354, 0), 9);
+ Table.States (2186).Kernel := To_Vector ((0 => ((354, 0), 108,
0, (354, 0), 9)));
+ Table.States (2186).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (354, 0), 9)));
+ Table.States (2187).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2187), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (346, 6), 9);
+ Table.States (2187).Kernel := To_Vector ((0 => ((346, 6), 108,
0, (346, 6), 9)));
+ Table.States (2187).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (346, 6), 9)));
+ Table.States (2188).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2188), 108, (346, 2), 2275);
+ Table.States (2188).Kernel := To_Vector ((0 => ((346, 2), 350,
1, (32767, 0), 0)));
+ Table.States (2188).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (346, 2), 108, 2275)));
+ Table.States (2189).Action_List.Set_Capacity (9);
+ Add_Action (Table.States (2189), 21, (356, 4), 8);
+ Add_Action (Table.States (2189), 25, (329, 1), 10);
+ Add_Action (Table.States (2189), 27, (350, 6), 781);
+ Add_Action (Table.States (2189), 51, (437, 0), 221);
+ Add_Action (Table.States (2189), 52, (329, 0), 21);
+ Add_Action (Table.States (2189), 53, (294, 0), 314);
+ Add_Action (Table.States (2189), 54, (293, 0), 315);
+ Add_Action (Table.States (2189), 66, (350, 10), 782);
+ Add_Action (Table.States (2189), 84, (124, 0), 32);
+ Table.States (2189).Goto_List.Set_Capacity (15);
+ Add_Goto (Table.States (2189), 124, 784);
+ Add_Goto (Table.States (2189), 291, 785);
+ Add_Goto (Table.States (2189), 292, 786);
+ Add_Goto (Table.States (2189), 293, 317);
+ Add_Goto (Table.States (2189), 294, 318);
+ Add_Goto (Table.States (2189), 329, 787);
+ Add_Goto (Table.States (2189), 348, 788);
+ Add_Goto (Table.States (2189), 350, 2276);
+ Add_Goto (Table.States (2189), 351, 790);
+ Add_Goto (Table.States (2189), 356, 791);
+ Add_Goto (Table.States (2189), 431, 792);
+ Add_Goto (Table.States (2189), 437, 140);
+ Add_Goto (Table.States (2189), 438, 141);
+ Add_Goto (Table.States (2189), 440, 142);
+ Add_Goto (Table.States (2189), 454, 143);
+ Table.States (2189).Kernel := To_Vector ((0 => ((346, 0), 61, 2,
(32767, 0), 0)));
+ Table.States (2189).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (350, 10), 66, 782)));
+ Table.States (2190).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2190), 108, (346, 4), 2277);
+ Table.States (2190).Kernel := To_Vector ((0 => ((346, 4), 350,
1, (32767, 0), 0)));
+ Table.States (2190).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (346, 4), 108, 2277)));
+ Table.States (2191).Action_List.Set_Capacity (11);
+ Add_Action (Table.States (2191), (21, 25, 51, 52, 53, 54, 63, 64,
66, 84, 116), (173, 1), 5);
+ Table.States (2191).Kernel := To_Vector ((0 => ((173, 1), 108,
0, (173, 1), 5)));
+ Table.States (2191).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (173, 1), 5)));
+ Table.States (2192).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2192), 108, (173, 0), 2278);
+ Table.States (2192).Kernel := To_Vector ((0 => ((173, 0), 434,
1, (32767, 0), 0)));
+ Table.States (2192).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (173, 0), 108, 2278)));
+ Table.States (2193).Action_List.Set_Capacity (11);
+ Add_Action (Table.States (2193), (21, 25, 51, 52, 53, 54, 63, 64,
66, 84, 116), (173, 2), 5);
+ Table.States (2193).Kernel := To_Vector ((0 => ((173, 2), 108,
0, (173, 2), 5)));
+ Table.States (2193).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (173, 2), 5)));
+ Table.States (2194).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2194), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (347, 0), 9);
+ Table.States (2194).Kernel := To_Vector ((0 => ((347, 0), 108,
0, (347, 0), 9)));
+ Table.States (2194).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (347, 0), 9)));
+ Table.States (2195).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2195), 108, (345, 1), 2279);
+ Table.States (2195).Kernel := To_Vector ((0 => ((345, 1), 284,
1, (32767, 0), 0)));
+ Table.States (2195).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (345, 1), 108, 2279)));
+ Table.States (2196).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2196), 108, Reduce, (284, 1), 0);
+ Add_Action (Table.States (2196), 116, (284, 0), 1312);
+ Table.States (2196).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2196), 284, 2280);
+ Table.States (2196).Kernel := To_Vector ((0 => ((345, 0), 66, 1,
(32767, 0), 0)));
+ Table.States (2196).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (284, 1), 0)));
+ Table.States (2197).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2197), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (340, 9), 9);
+ Table.States (2197).Kernel := To_Vector ((0 => ((340, 9), 108,
0, (340, 9), 9)));
+ Table.States (2197).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (340, 9), 9)));
+ Table.States (2198).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2198), 108, (340, 3), 2281);
+ Table.States (2198).Kernel := To_Vector ((0 => ((340, 3), 343,
1, (32767, 0), 0)));
+ Table.States (2198).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (340, 3), 108, 2281)));
+ Table.States (2199).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (2199), 21, (356, 4), 8);
+ Add_Action (Table.States (2199), 25, (329, 1), 10);
+ Add_Action (Table.States (2199), 51, (437, 0), 221);
+ Add_Action (Table.States (2199), 52, (329, 0), 21);
+ Table.States (2199).Goto_List.Set_Capacity (10);
+ Add_Goto (Table.States (2199), 329, 801);
+ Add_Goto (Table.States (2199), 342, 802);
+ Add_Goto (Table.States (2199), 343, 2282);
+ Add_Goto (Table.States (2199), 344, 804);
+ Add_Goto (Table.States (2199), 356, 805);
+ Add_Goto (Table.States (2199), 431, 806);
+ Add_Goto (Table.States (2199), 437, 140);
+ Add_Goto (Table.States (2199), 438, 141);
+ Add_Goto (Table.States (2199), 440, 142);
+ Add_Goto (Table.States (2199), 454, 143);
+ Table.States (2199).Kernel := To_Vector ((0 => ((340, 0), 61, 5,
(32767, 0), 0)));
+ Table.States (2199).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (356, 4), 21, 8)));
+ Table.States (2200).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2200), 108, (340, 6), 2283);
+ Table.States (2200).Kernel := To_Vector ((0 => ((340, 6), 343,
1, (32767, 0), 0)));
+ Table.States (2200).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (340, 6), 108, 2283)));
+ Table.States (2201).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2201), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (341, 0), 9);
+ Table.States (2201).Kernel := To_Vector ((0 => ((341, 0), 108,
0, (341, 0), 9)));
+ Table.States (2201).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (341, 0), 9)));
+ Table.States (2202).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2202), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 43), 9);
+ Table.States (2202).Kernel := To_Vector ((0 => ((328, 43), 108,
0, (328, 43), 9)));
+ Table.States (2202).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 43), 9)));
+ Table.States (2203).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2203), 108, (328, 42), 2284);
+ Table.States (2203).Kernel := To_Vector ((0 => ((328, 42), 434,
1, (32767, 0), 0)));
+ Table.States (2203).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 42), 108, 2284)));
+ Table.States (2204).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2204), 27, (328, 40), 2285);
+ Table.States (2204).Kernel := To_Vector ((((328, 40), 61, 4,
(32767, 0), 0), ((328, 41), 61, 2,
+ (32767, 0), 0)));
+ Table.States (2204).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 40), 27, 2285)));
+ Table.States (2205).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2205), 91, (177, 1), 631);
+ Add_Action (Table.States (2205), 99, (176, 0), 2286);
+ Table.States (2205).Kernel := To_Vector ((((176, 0), 177, 3,
(32767, 0), 0), ((177, 1), 177, 2,
+ (32767, 0), 0)));
+ Table.States (2205).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (176, 0), 99, 2286)));
+ Table.States (2206).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2206), 64, (175, 0), 2287);
+ Table.States (2206).Kernel := To_Vector ((0 => ((175, 0), 66, 2,
(32767, 0), 0)));
+ Table.States (2206).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (175, 0), 64, 2287)));
+ Table.States (2207).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2207), (63, 66), (174, 1), 2);
+ Table.States (2207).Kernel := To_Vector ((0 => ((174, 1), 176,
0, (174, 1), 2)));
+ Table.States (2207).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (174, 1), 2)));
+ Table.States (2208).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2208), (61, 108), (149, 0), 4);
+ Table.States (2208).Kernel := To_Vector ((0 => ((149, 0), 231,
0, (149, 0), 4)));
+ Table.States (2208).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (149, 0), 4)));
+ Table.States (2209).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2209), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 46), 9);
+ Table.States (2209).Kernel := To_Vector ((0 => ((328, 46), 108,
0, (328, 46), 9)));
+ Table.States (2209).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 46), 9)));
+ Table.States (2210).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2210), 61, (434, 0), 299);
+ Add_Action (Table.States (2210), 108, (328, 45), 2288);
+ Table.States (2210).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2210), 434, 2289);
+ Table.States (2210).Kernel := To_Vector ((((328, 44), 27, 3,
(32767, 0), 0), ((328, 45), 27, 1,
+ (32767, 0), 0)));
+ Table.States (2210).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 45), 108, 2288)));
+ Table.States (2211).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2211), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 39), 9);
+ Table.States (2211).Kernel := To_Vector ((0 => ((328, 39), 108,
0, (328, 39), 9)));
+ Table.States (2211).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 39), 9)));
+ Table.States (2212).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2212), 108, (328, 38), 2290);
+ Table.States (2212).Kernel := To_Vector ((0 => ((328, 38), 434,
1, (32767, 0), 0)));
+ Table.States (2212).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 38), 108, 2290)));
+ Table.States (2213).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (2213), 27, (328, 36), 2291);
+ Add_Action (Table.States (2213), 65, (170, 2), 821);
+ Add_Action (Table.States (2213), 67, (170, 0), 822);
+ Table.States (2213).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2213), 170, 1876);
+ Table.States (2213).Kernel := To_Vector ((((179, 0), 61, 2,
(32767, 0), 0), ((328, 36), 61, 4, (32767,
+ 0), 0), ((328, 37), 61, 2, (32767, 0), 0)));
+ Table.States (2213).Minimal_Complete_Actions := To_Vector
(((Shift, (170, 2), 65, 821), (Shift, (328, 36),
+ 27, 2291)));
+ Table.States (2214).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2214), (61, 108), (138, 6), 6);
+ Table.States (2214).Kernel := To_Vector ((0 => ((138, 6), 179,
0, (138, 6), 6)));
+ Table.States (2214).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (138, 6), 6)));
+ Table.States (2215).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2215), 61, (434, 0), 299);
+ Add_Action (Table.States (2215), 108, (328, 31), 2292);
+ Table.States (2215).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2215), 434, 2293);
+ Table.States (2215).Kernel := To_Vector ((((328, 30), 27, 3,
(32767, 0), 0), ((328, 31), 27, 1,
+ (32767, 0), 0)));
+ Table.States (2215).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 31), 108, 2292)));
+ Table.States (2216).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2216), 61, (328, 28), 2294);
+ Add_Action (Table.States (2216), 75, (182, 1), 1522);
+ Table.States (2216).Kernel := To_Vector ((((182, 1), 182, 2,
(32767, 0), 0), ((328, 28), 182, 5,
+ (32767, 0), 0), ((328, 29), 182, 3, (32767, 0), 0)));
+ Table.States (2216).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 28), 61, 2294)));
+ Table.States (2217).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2217), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (327, 12), 9);
+ Table.States (2217).Kernel := To_Vector ((0 => ((327, 12), 108,
0, (327, 12), 9)));
+ Table.States (2217).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (327, 12), 9)));
+ Table.States (2218).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2218), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 35), 9);
+ Table.States (2218).Kernel := To_Vector ((0 => ((328, 35), 108,
0, (328, 35), 9)));
+ Table.States (2218).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 35), 9)));
+ Table.States (2219).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2219), 108, (328, 34), 2295);
+ Table.States (2219).Kernel := To_Vector ((0 => ((328, 34), 434,
1, (32767, 0), 0)));
+ Table.States (2219).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 34), 108, 2295)));
+ Table.States (2220).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (2220), 27, (328, 32), 2296);
+ Add_Action (Table.States (2220), 65, (170, 2), 821);
+ Add_Action (Table.States (2220), 67, (170, 0), 822);
+ Table.States (2220).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2220), 170, 1876);
+ Table.States (2220).Kernel := To_Vector ((((179, 0), 61, 2,
(32767, 0), 0), ((328, 32), 61, 4, (32767,
+ 0), 0), ((328, 33), 61, 2, (32767, 0), 0)));
+ Table.States (2220).Minimal_Complete_Actions := To_Vector
(((Shift, (170, 2), 65, 821), (Shift, (328, 32),
+ 27, 2296)));
+ Table.States (2221).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2221), (61, 108), (138, 3), 6);
+ Table.States (2221).Kernel := To_Vector ((0 => ((138, 3), 179,
0, (138, 3), 6)));
+ Table.States (2221).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (138, 3), 6)));
+ Table.States (2222).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2222), 61, (434, 0), 299);
+ Add_Action (Table.States (2222), 108, (328, 27), 2297);
+ Table.States (2222).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2222), 434, 2298);
+ Table.States (2222).Kernel := To_Vector ((((328, 26), 27, 3,
(32767, 0), 0), ((328, 27), 27, 1,
+ (32767, 0), 0)));
+ Table.States (2222).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 27), 108, 2297)));
+ Table.States (2223).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2223), 61, (179, 0), 2299);
+ Add_Action (Table.States (2223), 75, (182, 1), 1522);
+ Table.States (2223).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2223), 179, 2300);
+ Table.States (2223).Kernel := To_Vector ((((138, 0), 182, 3,
(32767, 0), 0), ((182, 1), 182, 2,
+ (32767, 0), 0), ((328, 24), 182, 5, (32767, 0), 0), ((328,
25), 182, 3, (32767, 0), 0)));
+ Table.States (2223).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (179, 0), 61, 2299)));
+ Table.States (2224).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2224), 61, (434, 0), 299);
+ Add_Action (Table.States (2224), 108, (328, 19), 2301);
+ Table.States (2224).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2224), 434, 2302);
+ Table.States (2224).Kernel := To_Vector ((((328, 18), 27, 3,
(32767, 0), 0), ((328, 19), 27, 1,
+ (32767, 0), 0)));
+ Table.States (2224).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 19), 108, 2301)));
+ end Subr_73;
+ procedure Subr_74
+ is begin
+ Table.States (2225).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2225), 61, (328, 16), 2303);
+ Add_Action (Table.States (2225), 75, (182, 1), 1522);
+ Table.States (2225).Kernel := To_Vector ((((182, 1), 182, 2,
(32767, 0), 0), ((328, 16), 182, 5,
+ (32767, 0), 0), ((328, 17), 182, 3, (32767, 0), 0)));
+ Table.States (2225).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 16), 61, 2303)));
+ Table.States (2226).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2226), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (327, 4), 9);
+ Table.States (2226).Kernel := To_Vector ((0 => ((327, 4), 108,
0, (327, 4), 9)));
+ Table.States (2226).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (327, 4), 9)));
+ Table.States (2227).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2227), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 23), 9);
+ Table.States (2227).Kernel := To_Vector ((0 => ((328, 23), 108,
0, (328, 23), 9)));
+ Table.States (2227).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 23), 9)));
+ Table.States (2228).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2228), 108, (328, 22), 2304);
+ Table.States (2228).Kernel := To_Vector ((0 => ((328, 22), 434,
1, (32767, 0), 0)));
+ Table.States (2228).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 22), 108, 2304)));
+ Table.States (2229).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2229), 27, (328, 20), 2305);
+ Table.States (2229).Kernel := To_Vector ((((328, 20), 61, 4,
(32767, 0), 0), ((328, 21), 61, 2,
+ (32767, 0), 0)));
+ Table.States (2229).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 20), 27, 2305)));
+ Table.States (2230).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2230), 61, (434, 0), 299);
+ Add_Action (Table.States (2230), 108, (328, 15), 2306);
+ Table.States (2230).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2230), 434, 2307);
+ Table.States (2230).Kernel := To_Vector ((((328, 14), 27, 3,
(32767, 0), 0), ((328, 15), 27, 1,
+ (32767, 0), 0)));
+ Table.States (2230).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 15), 108, 2306)));
+ Table.States (2231).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2231), 61, (328, 12), 2308);
+ Add_Action (Table.States (2231), 75, (182, 1), 1522);
+ Table.States (2231).Kernel := To_Vector ((((182, 1), 182, 2,
(32767, 0), 0), ((328, 12), 182, 5,
+ (32767, 0), 0), ((328, 13), 182, 3, (32767, 0), 0)));
+ Table.States (2231).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 12), 61, 2308)));
+ Table.States (2232).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2232), 27, (328, 6), 2309);
+ Table.States (2232).Kernel := To_Vector ((((328, 6), 61, 4,
(32767, 0), 0), ((328, 7), 61, 2, (32767,
+ 0), 0)));
+ Table.States (2232).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 6), 27, 2309)));
+ Table.States (2233).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (2233), 86, (252, 0), 33);
+ Add_Action (Table.States (2233), 90, (268, 0), 34);
+ Add_Action (Table.States (2233), 116, (196, 0), 146);
+ Add_Action (Table.States (2233), 117, (196, 1), 37);
+ Add_Action (Table.States (2233), 118, (195, 6), 38);
+ Table.States (2233).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (2233), 182, 2310);
+ Add_Goto (Table.States (2233), 195, 1152);
+ Add_Goto (Table.States (2233), 196, 148);
+ Add_Goto (Table.States (2233), 197, 54);
+ Add_Goto (Table.States (2233), 198, 55);
+ Add_Goto (Table.States (2233), 199, 56);
+ Add_Goto (Table.States (2233), 201, 57);
+ Add_Goto (Table.States (2233), 251, 58);
+ Add_Goto (Table.States (2233), 252, 59);
+ Add_Goto (Table.States (2233), 255, 60);
+ Add_Goto (Table.States (2233), 268, 68);
+ Add_Goto (Table.States (2233), 311, 83);
+ Table.States (2233).Kernel := To_Vector ((((328, 4), 75, 6,
(32767, 0), 0), ((328, 5), 75, 4, (32767,
+ 0), 0)));
+ Table.States (2233).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (2234).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2234), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (327, 2), 9);
+ Table.States (2234).Kernel := To_Vector ((0 => ((327, 2), 108,
0, (327, 2), 9)));
+ Table.States (2234).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (327, 2), 9)));
+ Table.States (2235).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2235), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (327, 1), 9);
+ Table.States (2235).Kernel := To_Vector ((0 => ((327, 1), 108,
0, (327, 1), 9)));
+ Table.States (2235).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (327, 1), 9)));
+ Table.States (2236).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2236), 108, (327, 0), 2311);
+ Table.States (2236).Kernel := To_Vector ((0 => ((327, 0), 434,
1, (32767, 0), 0)));
+ Table.States (2236).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (327, 0), 108, 2311)));
+ Table.States (2237).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2237), 61, (434, 0), 299);
+ Add_Action (Table.States (2237), 108, (328, 11), 2312);
+ Table.States (2237).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2237), 434, 2313);
+ Table.States (2237).Kernel := To_Vector ((((328, 10), 27, 3,
(32767, 0), 0), ((328, 11), 27, 1,
+ (32767, 0), 0)));
+ Table.States (2237).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 11), 108, 2312)));
+ Table.States (2238).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2238), 61, (328, 8), 2314);
+ Add_Action (Table.States (2238), 75, (182, 1), 1522);
+ Table.States (2238).Kernel := To_Vector ((((182, 1), 182, 2,
(32767, 0), 0), ((328, 8), 182, 5,
+ (32767, 0), 0), ((328, 9), 182, 3, (32767, 0), 0)));
+ Table.States (2238).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 8), 61, 2314)));
+ Table.States (2239).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2239), 27, (328, 2), 2315);
+ Table.States (2239).Kernel := To_Vector ((((328, 2), 61, 4,
(32767, 0), 0), ((328, 3), 61, 2, (32767,
+ 0), 0)));
+ Table.States (2239).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 2), 27, 2315)));
+ Table.States (2240).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (2240), 86, (252, 0), 33);
+ Add_Action (Table.States (2240), 90, (268, 0), 34);
+ Add_Action (Table.States (2240), 116, (196, 0), 146);
+ Add_Action (Table.States (2240), 117, (196, 1), 37);
+ Add_Action (Table.States (2240), 118, (195, 6), 38);
+ Table.States (2240).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (2240), 182, 2316);
+ Add_Goto (Table.States (2240), 195, 1152);
+ Add_Goto (Table.States (2240), 196, 148);
+ Add_Goto (Table.States (2240), 197, 54);
+ Add_Goto (Table.States (2240), 198, 55);
+ Add_Goto (Table.States (2240), 199, 56);
+ Add_Goto (Table.States (2240), 201, 57);
+ Add_Goto (Table.States (2240), 251, 58);
+ Add_Goto (Table.States (2240), 252, 59);
+ Add_Goto (Table.States (2240), 255, 60);
+ Add_Goto (Table.States (2240), 268, 68);
+ Add_Goto (Table.States (2240), 311, 83);
+ Table.States (2240).Kernel := To_Vector ((((328, 0), 75, 6,
(32767, 0), 0), ((328, 1), 75, 4, (32767,
+ 0), 0)));
+ Table.States (2240).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (2241).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2241), 61, (179, 0), 1913);
+ Add_Action (Table.States (2241), 75, (182, 1), 1522);
+ Table.States (2241).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2241), 179, 2214);
+ Table.States (2241).Kernel := To_Vector ((((138, 6), 182, 3,
(32767, 0), 0), ((182, 1), 182, 2,
+ (32767, 0), 0)));
+ Table.States (2241).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (179, 0), 61, 1913)));
+ Table.States (2242).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2242), 61, (179, 0), 1913);
+ Add_Action (Table.States (2242), 75, (182, 1), 1522);
+ Table.States (2242).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2242), 179, 2221);
+ Table.States (2242).Kernel := To_Vector ((((138, 3), 182, 3,
(32767, 0), 0), ((182, 1), 182, 2,
+ (32767, 0), 0)));
+ Table.States (2242).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (179, 0), 61, 1913)));
+ Table.States (2243).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (2243), 86, (252, 0), 33);
+ Add_Action (Table.States (2243), 90, (268, 0), 34);
+ Add_Action (Table.States (2243), 116, (196, 0), 146);
+ Add_Action (Table.States (2243), 117, (196, 1), 37);
+ Add_Action (Table.States (2243), 118, (195, 6), 38);
+ Table.States (2243).Goto_List.Set_Capacity (12);
+ Add_Goto (Table.States (2243), 182, 2317);
+ Add_Goto (Table.States (2243), 195, 1152);
+ Add_Goto (Table.States (2243), 196, 148);
+ Add_Goto (Table.States (2243), 197, 54);
+ Add_Goto (Table.States (2243), 198, 55);
+ Add_Goto (Table.States (2243), 199, 56);
+ Add_Goto (Table.States (2243), 201, 57);
+ Add_Goto (Table.States (2243), 251, 58);
+ Add_Goto (Table.States (2243), 252, 59);
+ Add_Goto (Table.States (2243), 255, 60);
+ Add_Goto (Table.States (2243), 268, 68);
+ Add_Goto (Table.States (2243), 311, 83);
+ Table.States (2243).Kernel := To_Vector ((0 => ((138, 0), 75, 4,
(32767, 0), 0)));
+ Table.States (2243).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (2244).Action_List.Set_Capacity (5);
+ Add_Action (Table.States (2244), (63, 82, 87, 95, 108), (452, 0),
4);
+ Table.States (2244).Kernel := To_Vector ((0 => ((452, 0), 87, 0,
(452, 0), 4)));
+ Table.States (2244).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (452, 0), 4)));
+ Table.States (2245).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2245), (87, 95), (451, 2), 3);
+ Table.States (2245).Kernel := To_Vector ((((451, 1), 451, 5,
(32767, 0), 0), ((451, 2), 451, 0, (451,
+ 2), 3), ((451, 2), 451, 5, (32767, 0), 0)));
+ Table.States (2245).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (451, 2), 3)));
+ Table.States (2246).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2246), (87, 95), (451, 1), 3);
+ Table.States (2246).Kernel := To_Vector ((((451, 0), 452, 0,
(451, 0), 1), ((451, 1), 452, 0, (451,
+ 1), 3)));
+ Table.States (2246).Minimal_Complete_Actions := To_Vector
(((Reduce, (451, 0), 1), (Reduce, (451, 1),
+ 3)));
+ Table.States (2247).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2247), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (309, 2), 9);
+ Table.States (2247).Kernel := To_Vector ((0 => ((309, 2), 108,
0, (309, 2), 9)));
+ Table.States (2247).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (309, 2), 9)));
+ Table.States (2248).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2248), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (356, 0), 9);
+ Table.States (2248).Kernel := To_Vector ((0 => ((356, 0), 108,
0, (356, 0), 9)));
+ Table.States (2248).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (356, 0), 9)));
+ Table.States (2249).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2249), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (309, 1), 9);
+ Table.States (2249).Kernel := To_Vector ((0 => ((309, 1), 108,
0, (309, 1), 9)));
+ Table.States (2249).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (309, 1), 9)));
+ Table.States (2250).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2250), 108, (309, 0), 2318);
+ Table.States (2250).Kernel := To_Vector ((0 => ((309, 0), 308,
1, (32767, 0), 0)));
+ Table.States (2250).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (309, 0), 108, 2318)));
+ Table.States (2251).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (2251), (41, 44, 87), (240, 0), 4);
+ Table.States (2251).Kernel := To_Vector ((0 => ((240, 0), 227,
0, (240, 0), 4)));
+ Table.States (2251).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (240, 0), 4)));
+ Table.States (2252).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2252), 108, (357, 0), 2319);
+ Table.States (2252).Kernel := To_Vector ((0 => ((357, 0), 284,
1, (32767, 0), 0)));
+ Table.States (2252).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (357, 0), 108, 2319)));
+ Table.States (2253).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2253), 27, (415, 12), 2320);
+ Table.States (2253).Kernel := To_Vector ((0 => ((415, 12), 61,
1, (32767, 0), 0)));
+ Table.States (2253).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (415, 12), 27, 2320)));
+ Table.States (2254).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (2254), (49, 61, 108), (415, 15), 6);
+ Table.States (2254).Kernel := To_Vector ((0 => ((415, 15), 27,
0, (415, 15), 6)));
+ Table.States (2254).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (415, 15), 6)));
+ Table.States (2255).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2255), 27, (415, 9), 2321);
+ Table.States (2255).Kernel := To_Vector ((0 => ((415, 9), 61, 1,
(32767, 0), 0)));
+ Table.States (2255).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (415, 9), 27, 2321)));
+ Table.States (2256).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (2256), (49, 61, 108), (415, 4), 6);
+ Table.States (2256).Kernel := To_Vector ((0 => ((415, 4), 27, 0,
(415, 4), 6)));
+ Table.States (2256).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (415, 4), 6)));
+ Table.States (2257).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2257), 61, (415, 3), 2322);
+ Add_Action (Table.States (2257), 75, (182, 1), 1522);
+ Table.States (2257).Kernel := To_Vector ((((182, 1), 182, 2,
(32767, 0), 0), ((415, 3), 182, 2,
+ (32767, 0), 0)));
+ Table.States (2257).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (415, 3), 61, 2322)));
+ Table.States (2258).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2258), 27, (415, 6), 2323);
+ Table.States (2258).Kernel := To_Vector ((0 => ((415, 6), 61, 1,
(32767, 0), 0)));
+ Table.States (2258).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (415, 6), 27, 2323)));
+ Table.States (2259).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (2259), (49, 61, 108), (415, 1), 6);
+ Table.States (2259).Kernel := To_Vector ((0 => ((415, 1), 27, 0,
(415, 1), 6)));
+ Table.States (2259).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (415, 1), 6)));
+ Table.States (2260).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2260), 61, (415, 0), 2324);
+ Add_Action (Table.States (2260), 75, (182, 1), 1522);
+ Table.States (2260).Kernel := To_Vector ((((182, 1), 182, 2,
(32767, 0), 0), ((415, 0), 182, 2,
+ (32767, 0), 0)));
+ Table.States (2260).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (415, 0), 61, 2324)));
+ Table.States (2261).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (2261), (28, 50, 53, 54, 61, 83, 84,
116), (411, 4), 9);
+ Table.States (2261).Kernel := To_Vector ((0 => ((411, 4), 108,
0, (411, 4), 9)));
+ Table.States (2261).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (411, 4), 9)));
+ Table.States (2262).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (2262), (28, 50, 53, 54, 61, 83, 84,
116), (412, 0), 9);
+ Table.States (2262).Kernel := To_Vector ((0 => ((412, 0), 108,
0, (412, 0), 9)));
+ Table.States (2262).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (412, 0), 9)));
+ Table.States (2263).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (2263), (28, 50, 53, 54, 61, 83, 84,
116), (411, 1), 9);
+ Table.States (2263).Kernel := To_Vector ((0 => ((411, 1), 108,
0, (411, 1), 9)));
+ Table.States (2263).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (411, 1), 9)));
+ Table.States (2264).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2264), 108, (411, 0), 2325);
+ Table.States (2264).Kernel := To_Vector ((0 => ((411, 0), 434,
1, (32767, 0), 0)));
+ Table.States (2264).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (411, 0), 108, 2325)));
+ Table.States (2265).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2265), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (326, 2), 10);
+ Table.States (2265).Kernel := To_Vector ((0 => ((326, 2), 108,
0, (326, 2), 10)));
+ Table.States (2265).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (326, 2), 10)));
+ Table.States (2266).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2266), 108, (326, 0), 2326);
+ Table.States (2266).Kernel := To_Vector ((0 => ((326, 0), 308,
1, (32767, 0), 0)));
+ Table.States (2266).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (326, 0), 108, 2326)));
+ Table.States (2267).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (2267), (63, 66, 75), (398, 0), 6);
+ Table.States (2267).Kernel := To_Vector ((0 => ((398, 0), 259,
0, (398, 0), 6)));
+ Table.States (2267).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (398, 0), 6)));
+ Table.States (2268).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (2268), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (271, 0), 10);
+ Table.States (2268).Kernel := To_Vector ((0 => ((271, 0), 108,
0, (271, 0), 10)));
+ Table.States (2268).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (271, 0), 10)));
+ Table.States (2269).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (2269), 46, (233, 2), 167);
+ Add_Action (Table.States (2269), 52, (233, 3), 168);
+ Add_Action (Table.States (2269), 65, (234, 1), 169);
+ Add_Action (Table.States (2269), 76, (256, 0), 170);
+ Add_Action (Table.States (2269), 85, (205, 4), 171);
+ Add_Action (Table.States (2269), 86, (213, 2), 172);
+ Add_Action (Table.States (2269), 90, (268, 0), 34);
+ Add_Action (Table.States (2269), 106, (237, 1), 173);
+ Add_Action (Table.States (2269), 107, (237, 0), 174);
+ Add_Action (Table.States (2269), 115, (234, 0), 175);
+ Add_Action (Table.States (2269), 116, (196, 0), 146);
+ Add_Action (Table.States (2269), 117, (196, 1), 37);
+ Add_Action (Table.States (2269), 118, (195, 6), 38);
+ Table.States (2269).Goto_List.Set_Capacity (29);
+ Add_Goto (Table.States (2269), 195, 176);
+ Add_Goto (Table.States (2269), 196, 148);
+ Add_Goto (Table.States (2269), 197, 54);
+ Add_Goto (Table.States (2269), 198, 55);
+ Add_Goto (Table.States (2269), 199, 56);
+ Add_Goto (Table.States (2269), 201, 57);
+ Add_Goto (Table.States (2269), 205, 177);
+ Add_Goto (Table.States (2269), 206, 178);
+ Add_Goto (Table.States (2269), 210, 179);
+ Add_Goto (Table.States (2269), 211, 180);
+ Add_Goto (Table.States (2269), 213, 181);
+ Add_Goto (Table.States (2269), 214, 182);
+ Add_Goto (Table.States (2269), 215, 183);
+ Add_Goto (Table.States (2269), 218, 184);
+ Add_Goto (Table.States (2269), 219, 185);
+ Add_Goto (Table.States (2269), 220, 186);
+ Add_Goto (Table.States (2269), 231, 2327);
+ Add_Goto (Table.States (2269), 232, 190);
+ Add_Goto (Table.States (2269), 233, 191);
+ Add_Goto (Table.States (2269), 234, 192);
+ Add_Goto (Table.States (2269), 237, 193);
+ Add_Goto (Table.States (2269), 251, 58);
+ Add_Goto (Table.States (2269), 252, 59);
+ Add_Goto (Table.States (2269), 255, 60);
+ Add_Goto (Table.States (2269), 256, 194);
+ Add_Goto (Table.States (2269), 268, 68);
+ Add_Goto (Table.States (2269), 311, 83);
+ Add_Goto (Table.States (2269), 444, 2328);
+ Add_Goto (Table.States (2269), 465, 196);
+ Table.States (2269).Kernel := To_Vector ((0 => ((441, 0), 97, 2,
(32767, 0), 0)));
+ Table.States (2269).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (234, 0), 115, 175)));
+ Table.States (2270).Action_List.Set_Capacity (44);
+ Add_Action (Table.States (2270), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 63, 64, 65, 66, 77,
81, 83, 84, 86, 90, 105, 116, 117, 118,
+ 119), (440, 0), 10);
+ Table.States (2270).Kernel := To_Vector ((0 => ((440, 0), 108,
0, (440, 0), 10)));
+ Table.States (2270).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (440, 0), 10)));
+ Table.States (2271).Action_List.Set_Capacity (13);
+ Add_Action (Table.States (2271), 46, (233, 2), 167);
+ Add_Action (Table.States (2271), 52, (187, 0), 356);
+ Add_Action (Table.States (2271), 65, (234, 1), 169);
+ Add_Action (Table.States (2271), 76, (256, 0), 170);
+ Add_Action (Table.States (2271), 85, (205, 4), 171);
+ Add_Action (Table.States (2271), 86, (213, 2), 172);
+ Add_Action (Table.States (2271), 90, (268, 0), 34);
+ Add_Action (Table.States (2271), 106, (237, 1), 173);
+ Add_Action (Table.States (2271), 107, (237, 0), 174);
+ Add_Action (Table.States (2271), 115, (234, 0), 175);
+ Add_Action (Table.States (2271), 116, (196, 0), 146);
+ Add_Action (Table.States (2271), 117, (196, 1), 37);
+ Add_Action (Table.States (2271), 118, (195, 6), 38);
+ Table.States (2271).Goto_List.Set_Capacity (33);
+ Add_Goto (Table.States (2271), 131, 693);
+ Add_Goto (Table.States (2271), 140, 694);
+ Add_Goto (Table.States (2271), 160, 2329);
+ Add_Goto (Table.States (2271), 187, 365);
+ Add_Goto (Table.States (2271), 195, 366);
+ Add_Goto (Table.States (2271), 196, 148);
+ Add_Goto (Table.States (2271), 197, 54);
+ Add_Goto (Table.States (2271), 198, 55);
+ Add_Goto (Table.States (2271), 199, 56);
+ Add_Goto (Table.States (2271), 201, 57);
+ Add_Goto (Table.States (2271), 203, 369);
+ Add_Goto (Table.States (2271), 205, 177);
+ Add_Goto (Table.States (2271), 206, 178);
+ Add_Goto (Table.States (2271), 210, 179);
+ Add_Goto (Table.States (2271), 211, 180);
+ Add_Goto (Table.States (2271), 213, 181);
+ Add_Goto (Table.States (2271), 214, 182);
+ Add_Goto (Table.States (2271), 215, 183);
+ Add_Goto (Table.States (2271), 218, 184);
+ Add_Goto (Table.States (2271), 219, 185);
+ Add_Goto (Table.States (2271), 220, 186);
+ Add_Goto (Table.States (2271), 231, 696);
+ Add_Goto (Table.States (2271), 232, 190);
+ Add_Goto (Table.States (2271), 233, 191);
+ Add_Goto (Table.States (2271), 234, 192);
+ Add_Goto (Table.States (2271), 237, 193);
+ Add_Goto (Table.States (2271), 251, 58);
+ Add_Goto (Table.States (2271), 252, 59);
+ Add_Goto (Table.States (2271), 255, 60);
+ Add_Goto (Table.States (2271), 256, 194);
+ Add_Goto (Table.States (2271), 268, 68);
+ Add_Goto (Table.States (2271), 311, 83);
+ Add_Goto (Table.States (2271), 465, 196);
+ Table.States (2271).Kernel := To_Vector ((0 => ((362, 0), 47, 1,
(32767, 0), 0)));
+ Table.States (2271).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 116, 146)));
+ Table.States (2272).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2272), (61, 63), (360, 0), 4);
+ Table.States (2272).Kernel := To_Vector ((0 => ((360, 0), 295,
0, (360, 0), 4)));
+ Table.States (2272).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (360, 0), 4)));
+ Table.States (2273).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2273), 38, (359, 1), 2330);
+ Table.States (2273).Kernel := To_Vector ((0 => ((359, 1), 192,
5, (32767, 0), 0)));
+ Table.States (2273).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (359, 1), 38, 2330)));
+ Table.States (2274).Action_List.Set_Capacity (15);
+ Add_Action (Table.States (2274), 22, (339, 0), 9);
+ Add_Action (Table.States (2274), 25, (329, 1), 10);
+ Add_Action (Table.States (2274), 28, (325, 0), 12);
+ Add_Action (Table.States (2274), 38, Reduce, (192, 1), 0);
+ Add_Action (Table.States (2274), 50, (332, 0), 19);
+ Add_Action (Table.States (2274), 51, (437, 0), 221);
+ Add_Action (Table.States (2274), 52, (329, 0), 21);
+ Add_Action (Table.States (2274), 53, (294, 0), 22);
+ Add_Action (Table.States (2274), 54, (293, 0), 23);
+ Add_Action (Table.States (2274), 59, (346, 0), 24);
+ Add_Action (Table.States (2274), 60, (340, 0), 25);
+ Add_Action (Table.States (2274), 81, (130, 0), 30);
+ Add_Action (Table.States (2274), 83, (128, 0), 31);
+ Add_Action (Table.States (2274), 84, (124, 0), 32);
+ Add_Action (Table.States (2274), 116, (136, 0), 223);
+ Table.States (2274).Goto_List.Set_Capacity (60);
+ Add_Goto (Table.States (2274), 124, 561);
+ Add_Goto (Table.States (2274), 126, 40);
+ Add_Goto (Table.States (2274), 127, 41);
+ Add_Goto (Table.States (2274), 128, 42);
+ Add_Goto (Table.States (2274), 130, 43);
+ Add_Goto (Table.States (2274), 135, 44);
+ Add_Goto (Table.States (2274), 136, 45);
+ Add_Goto (Table.States (2274), 137, 46);
+ Add_Goto (Table.States (2274), 180, 47);
+ Add_Goto (Table.States (2274), 189, 48);
+ Add_Goto (Table.States (2274), 190, 562);
+ Add_Goto (Table.States (2274), 191, 563);
+ Add_Goto (Table.States (2274), 192, 2331);
+ Add_Goto (Table.States (2274), 193, 50);
+ Add_Goto (Table.States (2274), 194, 51);
+ Add_Goto (Table.States (2274), 291, 77);
+ Add_Goto (Table.States (2274), 292, 78);
+ Add_Goto (Table.States (2274), 293, 79);
+ Add_Goto (Table.States (2274), 294, 80);
+ Add_Goto (Table.States (2274), 309, 81);
+ Add_Goto (Table.States (2274), 320, 86);
+ Add_Goto (Table.States (2274), 321, 87);
+ Add_Goto (Table.States (2274), 322, 88);
+ Add_Goto (Table.States (2274), 325, 89);
+ Add_Goto (Table.States (2274), 326, 90);
+ Add_Goto (Table.States (2274), 327, 91);
+ Add_Goto (Table.States (2274), 328, 92);
+ Add_Goto (Table.States (2274), 329, 225);
+ Add_Goto (Table.States (2274), 330, 94);
+ Add_Goto (Table.States (2274), 332, 95);
+ Add_Goto (Table.States (2274), 333, 96);
+ Add_Goto (Table.States (2274), 334, 97);
+ Add_Goto (Table.States (2274), 335, 98);
+ Add_Goto (Table.States (2274), 336, 99);
+ Add_Goto (Table.States (2274), 337, 100);
+ Add_Goto (Table.States (2274), 338, 101);
+ Add_Goto (Table.States (2274), 339, 102);
+ Add_Goto (Table.States (2274), 340, 103);
+ Add_Goto (Table.States (2274), 341, 104);
+ Add_Goto (Table.States (2274), 345, 105);
+ Add_Goto (Table.States (2274), 346, 106);
+ Add_Goto (Table.States (2274), 347, 107);
+ Add_Goto (Table.States (2274), 354, 108);
+ Add_Goto (Table.States (2274), 388, 126);
+ Add_Goto (Table.States (2274), 389, 127);
+ Add_Goto (Table.States (2274), 390, 128);
+ Add_Goto (Table.States (2274), 391, 129);
+ Add_Goto (Table.States (2274), 392, 130);
+ Add_Goto (Table.States (2274), 394, 132);
+ Add_Goto (Table.States (2274), 403, 134);
+ Add_Goto (Table.States (2274), 404, 135);
+ Add_Goto (Table.States (2274), 405, 136);
+ Add_Goto (Table.States (2274), 406, 137);
+ Add_Goto (Table.States (2274), 408, 138);
+ Add_Goto (Table.States (2274), 431, 139);
+ Add_Goto (Table.States (2274), 437, 140);
+ Add_Goto (Table.States (2274), 438, 141);
+ Add_Goto (Table.States (2274), 440, 142);
+ Add_Goto (Table.States (2274), 454, 143);
+ Add_Goto (Table.States (2274), 458, 565);
+ Table.States (2274).Kernel := To_Vector ((0 => ((359, 0), 82, 5,
(32767, 0), 0)));
+ Table.States (2274).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (192, 1), 0)));
+ end Subr_74;
+ procedure Subr_75
+ is begin
+ Table.States (2275).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2275), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (346, 2), 10);
+ Table.States (2275).Kernel := To_Vector ((0 => ((346, 2), 108,
0, (346, 2), 10)));
+ Table.States (2275).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (346, 2), 10)));
+ Table.States (2276).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2276), 108, (346, 0), 2332);
+ Table.States (2276).Kernel := To_Vector ((0 => ((346, 0), 350,
1, (32767, 0), 0)));
+ Table.States (2276).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (346, 0), 108, 2332)));
+ Table.States (2277).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2277), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (346, 4), 10);
+ Table.States (2277).Kernel := To_Vector ((0 => ((346, 4), 108,
0, (346, 4), 10)));
+ Table.States (2277).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (346, 4), 10)));
+ Table.States (2278).Action_List.Set_Capacity (11);
+ Add_Action (Table.States (2278), (21, 25, 51, 52, 53, 54, 63, 64,
66, 84, 116), (173, 0), 6);
+ Table.States (2278).Kernel := To_Vector ((0 => ((173, 0), 108,
0, (173, 0), 6)));
+ Table.States (2278).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (173, 0), 6)));
+ Table.States (2279).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2279), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (345, 1), 10);
+ Table.States (2279).Kernel := To_Vector ((0 => ((345, 1), 108,
0, (345, 1), 10)));
+ Table.States (2279).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (345, 1), 10)));
+ Table.States (2280).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2280), 108, (345, 0), 2333);
+ Table.States (2280).Kernel := To_Vector ((0 => ((345, 0), 284,
1, (32767, 0), 0)));
+ Table.States (2280).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (345, 0), 108, 2333)));
+ Table.States (2281).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2281), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (340, 3), 10);
+ Table.States (2281).Kernel := To_Vector ((0 => ((340, 3), 108,
0, (340, 3), 10)));
+ Table.States (2281).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (340, 3), 10)));
+ Table.States (2282).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2282), 108, (340, 0), 2334);
+ Table.States (2282).Kernel := To_Vector ((0 => ((340, 0), 343,
1, (32767, 0), 0)));
+ Table.States (2282).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (340, 0), 108, 2334)));
+ Table.States (2283).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2283), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (340, 6), 10);
+ Table.States (2283).Kernel := To_Vector ((0 => ((340, 6), 108,
0, (340, 6), 10)));
+ Table.States (2283).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (340, 6), 10)));
+ Table.States (2284).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2284), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 42), 10);
+ Table.States (2284).Kernel := To_Vector ((0 => ((328, 42), 108,
0, (328, 42), 10)));
+ Table.States (2284).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 42), 10)));
+ Table.States (2285).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2285), 61, (434, 0), 299);
+ Add_Action (Table.States (2285), 108, (328, 41), 2335);
+ Table.States (2285).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2285), 434, 2336);
+ Table.States (2285).Kernel := To_Vector ((((328, 40), 27, 3,
(32767, 0), 0), ((328, 41), 27, 1,
+ (32767, 0), 0)));
+ Table.States (2285).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 41), 108, 2335)));
+ Table.States (2286).Action_List.Set_Capacity (4);
+ Add_Action (Table.States (2286), 51, (437, 0), 221);
+ Add_Action (Table.States (2286), 64, (175, 0), 1199);
+ Add_Action (Table.States (2286), 65, (171, 3), 1200);
+ Add_Action (Table.States (2286), 116, (136, 0), 207);
+ Table.States (2286).Goto_List.Set_Capacity (11);
+ Add_Goto (Table.States (2286), 136, 1145);
+ Add_Goto (Table.States (2286), 171, 2337);
+ Add_Goto (Table.States (2286), 172, 1202);
+ Add_Goto (Table.States (2286), 173, 1203);
+ Add_Goto (Table.States (2286), 175, 1204);
+ Add_Goto (Table.States (2286), 431, 1205);
+ Add_Goto (Table.States (2286), 437, 140);
+ Add_Goto (Table.States (2286), 438, 141);
+ Add_Goto (Table.States (2286), 440, 142);
+ Add_Goto (Table.States (2286), 454, 143);
+ Add_Goto (Table.States (2286), 457, 1206);
+ Table.States (2286).Kernel := To_Vector ((0 => ((176, 0), 99, 2,
(32767, 0), 0)));
+ Table.States (2286).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (171, 3), 65, 1200)));
+ Table.States (2287).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2287), 108, (175, 0), 2338);
+ Table.States (2287).Kernel := To_Vector ((0 => ((175, 0), 64, 1,
(32767, 0), 0)));
+ Table.States (2287).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (175, 0), 108, 2338)));
+ Table.States (2288).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2288), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 45), 10);
+ Table.States (2288).Kernel := To_Vector ((0 => ((328, 45), 108,
0, (328, 45), 10)));
+ Table.States (2288).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 45), 10)));
+ Table.States (2289).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2289), 108, (328, 44), 2339);
+ Table.States (2289).Kernel := To_Vector ((0 => ((328, 44), 434,
1, (32767, 0), 0)));
+ Table.States (2289).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 44), 108, 2339)));
+ Table.States (2290).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2290), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 38), 10);
+ Table.States (2290).Kernel := To_Vector ((0 => ((328, 38), 108,
0, (328, 38), 10)));
+ Table.States (2290).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 38), 10)));
+ Table.States (2291).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2291), 61, (434, 0), 299);
+ Add_Action (Table.States (2291), 108, (328, 37), 2340);
+ Table.States (2291).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2291), 434, 2341);
+ Table.States (2291).Kernel := To_Vector ((((328, 36), 27, 3,
(32767, 0), 0), ((328, 37), 27, 1,
+ (32767, 0), 0)));
+ Table.States (2291).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 37), 108, 2340)));
+ Table.States (2292).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2292), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 31), 10);
+ Table.States (2292).Kernel := To_Vector ((0 => ((328, 31), 108,
0, (328, 31), 10)));
+ Table.States (2292).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 31), 10)));
+ Table.States (2293).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2293), 108, (328, 30), 2342);
+ Table.States (2293).Kernel := To_Vector ((0 => ((328, 30), 434,
1, (32767, 0), 0)));
+ Table.States (2293).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 30), 108, 2342)));
+ Table.States (2294).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2294), 27, (328, 28), 2343);
+ Table.States (2294).Kernel := To_Vector ((((328, 28), 61, 4,
(32767, 0), 0), ((328, 29), 61, 2,
+ (32767, 0), 0)));
+ Table.States (2294).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 28), 27, 2343)));
+ Table.States (2295).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2295), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 34), 10);
+ Table.States (2295).Kernel := To_Vector ((0 => ((328, 34), 108,
0, (328, 34), 10)));
+ Table.States (2295).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 34), 10)));
+ Table.States (2296).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2296), 61, (434, 0), 299);
+ Add_Action (Table.States (2296), 108, (328, 33), 2344);
+ Table.States (2296).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2296), 434, 2345);
+ Table.States (2296).Kernel := To_Vector ((((328, 32), 27, 3,
(32767, 0), 0), ((328, 33), 27, 1,
+ (32767, 0), 0)));
+ Table.States (2296).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 33), 108, 2344)));
+ Table.States (2297).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2297), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 27), 10);
+ Table.States (2297).Kernel := To_Vector ((0 => ((328, 27), 108,
0, (328, 27), 10)));
+ Table.States (2297).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 27), 10)));
+ Table.States (2298).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2298), 108, (328, 26), 2346);
+ Table.States (2298).Kernel := To_Vector ((0 => ((328, 26), 434,
1, (32767, 0), 0)));
+ Table.States (2298).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 26), 108, 2346)));
+ Table.States (2299).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (2299), 27, (328, 24), 2347);
+ Add_Action (Table.States (2299), 65, (170, 2), 821);
+ Add_Action (Table.States (2299), 67, (170, 0), 822);
+ Table.States (2299).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2299), 170, 1876);
+ Table.States (2299).Kernel := To_Vector ((((179, 0), 61, 2,
(32767, 0), 0), ((328, 24), 61, 4, (32767,
+ 0), 0), ((328, 25), 61, 2, (32767, 0), 0)));
+ Table.States (2299).Minimal_Complete_Actions := To_Vector
(((Shift, (170, 2), 65, 821), (Shift, (328, 24),
+ 27, 2347)));
+ Table.States (2300).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2300), (61, 108), (138, 0), 7);
+ Table.States (2300).Kernel := To_Vector ((0 => ((138, 0), 179,
0, (138, 0), 7)));
+ Table.States (2300).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (138, 0), 7)));
+ Table.States (2301).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2301), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 19), 10);
+ Table.States (2301).Kernel := To_Vector ((0 => ((328, 19), 108,
0, (328, 19), 10)));
+ Table.States (2301).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 19), 10)));
+ Table.States (2302).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2302), 108, (328, 18), 2348);
+ Table.States (2302).Kernel := To_Vector ((0 => ((328, 18), 434,
1, (32767, 0), 0)));
+ Table.States (2302).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 18), 108, 2348)));
+ Table.States (2303).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2303), 27, (328, 16), 2349);
+ Table.States (2303).Kernel := To_Vector ((((328, 16), 61, 4,
(32767, 0), 0), ((328, 17), 61, 2,
+ (32767, 0), 0)));
+ Table.States (2303).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 16), 27, 2349)));
+ Table.States (2304).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2304), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 22), 10);
+ Table.States (2304).Kernel := To_Vector ((0 => ((328, 22), 108,
0, (328, 22), 10)));
+ Table.States (2304).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 22), 10)));
+ Table.States (2305).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2305), 61, (434, 0), 299);
+ Add_Action (Table.States (2305), 108, (328, 21), 2350);
+ Table.States (2305).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2305), 434, 2351);
+ Table.States (2305).Kernel := To_Vector ((((328, 20), 27, 3,
(32767, 0), 0), ((328, 21), 27, 1,
+ (32767, 0), 0)));
+ Table.States (2305).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 21), 108, 2350)));
+ Table.States (2306).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2306), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 15), 10);
+ Table.States (2306).Kernel := To_Vector ((0 => ((328, 15), 108,
0, (328, 15), 10)));
+ Table.States (2306).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 15), 10)));
+ Table.States (2307).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2307), 108, (328, 14), 2352);
+ Table.States (2307).Kernel := To_Vector ((0 => ((328, 14), 434,
1, (32767, 0), 0)));
+ Table.States (2307).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 14), 108, 2352)));
+ Table.States (2308).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2308), 27, (328, 12), 2353);
+ Table.States (2308).Kernel := To_Vector ((((328, 12), 61, 4,
(32767, 0), 0), ((328, 13), 61, 2,
+ (32767, 0), 0)));
+ Table.States (2308).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 12), 27, 2353)));
+ Table.States (2309).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2309), 61, (434, 0), 299);
+ Add_Action (Table.States (2309), 108, (328, 7), 2354);
+ Table.States (2309).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2309), 434, 2355);
+ Table.States (2309).Kernel := To_Vector ((((328, 6), 27, 3,
(32767, 0), 0), ((328, 7), 27, 1, (32767,
+ 0), 0)));
+ Table.States (2309).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 7), 108, 2354)));
+ Table.States (2310).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2310), 61, (328, 4), 2356);
+ Add_Action (Table.States (2310), 75, (182, 1), 1522);
+ Table.States (2310).Kernel := To_Vector ((((182, 1), 182, 2,
(32767, 0), 0), ((328, 4), 182, 5,
+ (32767, 0), 0), ((328, 5), 182, 3, (32767, 0), 0)));
+ Table.States (2310).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 4), 61, 2356)));
+ Table.States (2311).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2311), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (327, 0), 10);
+ Table.States (2311).Kernel := To_Vector ((0 => ((327, 0), 108,
0, (327, 0), 10)));
+ Table.States (2311).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (327, 0), 10)));
+ Table.States (2312).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2312), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 11), 10);
+ Table.States (2312).Kernel := To_Vector ((0 => ((328, 11), 108,
0, (328, 11), 10)));
+ Table.States (2312).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 11), 10)));
+ Table.States (2313).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2313), 108, (328, 10), 2357);
+ Table.States (2313).Kernel := To_Vector ((0 => ((328, 10), 434,
1, (32767, 0), 0)));
+ Table.States (2313).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 10), 108, 2357)));
+ Table.States (2314).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2314), 27, (328, 8), 2358);
+ Table.States (2314).Kernel := To_Vector ((((328, 8), 61, 4,
(32767, 0), 0), ((328, 9), 61, 2, (32767,
+ 0), 0)));
+ Table.States (2314).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 8), 27, 2358)));
+ Table.States (2315).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2315), 61, (434, 0), 299);
+ Add_Action (Table.States (2315), 108, (328, 3), 2359);
+ Table.States (2315).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2315), 434, 2360);
+ Table.States (2315).Kernel := To_Vector ((((328, 2), 27, 3,
(32767, 0), 0), ((328, 3), 27, 1, (32767,
+ 0), 0)));
+ Table.States (2315).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 3), 108, 2359)));
+ Table.States (2316).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2316), 61, (328, 0), 2361);
+ Add_Action (Table.States (2316), 75, (182, 1), 1522);
+ Table.States (2316).Kernel := To_Vector ((((182, 1), 182, 2,
(32767, 0), 0), ((328, 0), 182, 5,
+ (32767, 0), 0), ((328, 1), 182, 3, (32767, 0), 0)));
+ Table.States (2316).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 0), 61, 2361)));
+ Table.States (2317).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2317), 61, (179, 0), 1913);
+ Add_Action (Table.States (2317), 75, (182, 1), 1522);
+ Table.States (2317).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2317), 179, 2300);
+ Table.States (2317).Kernel := To_Vector ((((138, 0), 182, 3,
(32767, 0), 0), ((182, 1), 182, 2,
+ (32767, 0), 0)));
+ Table.States (2317).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (179, 0), 61, 1913)));
+ Table.States (2318).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2318), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (309, 0), 10);
+ Table.States (2318).Kernel := To_Vector ((0 => ((309, 0), 108,
0, (309, 0), 10)));
+ Table.States (2318).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (309, 0), 10)));
+ Table.States (2319).Action_List.Set_Capacity (50);
+ Add_Action (Table.States (2319), (12, 13, 15, 17, 18, 19, 20, 21,
22, 23, 25, 27, 28, 30, 31, 32, 35, 36,
+ 37, 38, 39, 41, 42, 43, 44, 49, 50, 51, 52, 53, 54, 59, 60, 61,
63, 64, 65, 66, 75, 77, 81, 83, 84, 86, 90,
+ 105, 116, 117, 118, 119), (357, 0), 11);
+ Table.States (2319).Kernel := To_Vector ((0 => ((357, 0), 108,
0, (357, 0), 11)));
+ Table.States (2319).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (357, 0), 11)));
+ Table.States (2320).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (2320), (49, 61, 108), (415, 12), 7);
+ Table.States (2320).Kernel := To_Vector ((0 => ((415, 12), 27,
0, (415, 12), 7)));
+ Table.States (2320).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (415, 12), 7)));
+ Table.States (2321).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (2321), (49, 61, 108), (415, 9), 7);
+ Table.States (2321).Kernel := To_Vector ((0 => ((415, 9), 27, 0,
(415, 9), 7)));
+ Table.States (2321).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (415, 9), 7)));
+ Table.States (2322).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2322), 27, (415, 3), 2362);
+ Table.States (2322).Kernel := To_Vector ((0 => ((415, 3), 61, 1,
(32767, 0), 0)));
+ Table.States (2322).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (415, 3), 27, 2362)));
+ Table.States (2323).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (2323), (49, 61, 108), (415, 6), 7);
+ Table.States (2323).Kernel := To_Vector ((0 => ((415, 6), 27, 0,
(415, 6), 7)));
+ Table.States (2323).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (415, 6), 7)));
+ Table.States (2324).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2324), 27, (415, 0), 2363);
+ Table.States (2324).Kernel := To_Vector ((0 => ((415, 0), 61, 1,
(32767, 0), 0)));
+ Table.States (2324).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (415, 0), 27, 2363)));
+ Table.States (2325).Action_List.Set_Capacity (8);
+ Add_Action (Table.States (2325), (28, 50, 53, 54, 61, 83, 84,
116), (411, 0), 10);
+ Table.States (2325).Kernel := To_Vector ((0 => ((411, 0), 108,
0, (411, 0), 10)));
+ Table.States (2325).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (411, 0), 10)));
+ Table.States (2326).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2326), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (326, 0), 11);
+ Table.States (2326).Kernel := To_Vector ((0 => ((326, 0), 108,
0, (326, 0), 11)));
+ Table.States (2326).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (326, 0), 11)));
+ Table.States (2327).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2327), (1 => 108), (444, 0), 1);
+ Table.States (2327).Kernel := To_Vector ((0 => ((444, 0), 231,
0, (444, 0), 1)));
+ Table.States (2327).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (444, 0), 1)));
+ Table.States (2328).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2328), 108, (441, 0), 2364);
+ Table.States (2328).Kernel := To_Vector ((0 => ((441, 0), 444,
1, (32767, 0), 0)));
+ Table.States (2328).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (441, 0), 108, 2364)));
+ Table.States (2329).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2329), (1 => 87), (362, 0), 4);
+ Table.States (2329).Kernel := To_Vector ((0 => ((362, 0), 160,
0, (362, 0), 4)));
+ Table.States (2329).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (362, 0), 4)));
+ Table.States (2330).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (2330), 12, (401, 0), 1);
+ Add_Action (Table.States (2330), 15, (370, 0), 3);
+ Add_Action (Table.States (2330), 17, (365, 0), 4);
+ Add_Action (Table.States (2330), 18, (382, 0), 5);
+ Add_Action (Table.States (2330), 19, (363, 0), 6);
+ Add_Action (Table.States (2330), 20, (357, 0), 7);
+ Add_Action (Table.States (2330), 30, (316, 0), 13);
+ Add_Action (Table.States (2330), 31, (290, 0), 14);
+ Add_Action (Table.States (2330), 32, (289, 0), 15);
+ Add_Action (Table.States (2330), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (2330), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (2330), 37, (288, 0), 17);
+ Add_Conflict (Table.States (2330), 37, (285, 1), 0);
+ Add_Action (Table.States (2330), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (2330), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (2330), 42, (271, 0), 18);
+ Add_Action (Table.States (2330), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (2330), 64, (273, 0), 27);
+ Add_Action (Table.States (2330), 65, (264, 0), 28);
+ Add_Action (Table.States (2330), 84, (124, 0), 32);
+ Add_Action (Table.States (2330), 86, (252, 0), 33);
+ Add_Action (Table.States (2330), 90, (268, 0), 34);
+ Add_Action (Table.States (2330), 105, (265, 0), 35);
+ Add_Action (Table.States (2330), 116, (196, 0), 146);
+ Add_Action (Table.States (2330), 117, (196, 1), 37);
+ Add_Action (Table.States (2330), 118, (195, 6), 38);
+ Table.States (2330).Goto_List.Set_Capacity (46);
+ Add_Goto (Table.States (2330), 124, 39);
+ Add_Goto (Table.States (2330), 195, 52);
+ Add_Goto (Table.States (2330), 196, 53);
+ Add_Goto (Table.States (2330), 197, 54);
+ Add_Goto (Table.States (2330), 198, 55);
+ Add_Goto (Table.States (2330), 199, 56);
+ Add_Goto (Table.States (2330), 201, 57);
+ Add_Goto (Table.States (2330), 251, 58);
+ Add_Goto (Table.States (2330), 252, 59);
+ Add_Goto (Table.States (2330), 255, 60);
+ Add_Goto (Table.States (2330), 259, 452);
+ Add_Goto (Table.States (2330), 261, 331);
+ Add_Goto (Table.States (2330), 262, 62);
+ Add_Goto (Table.States (2330), 263, 63);
+ Add_Goto (Table.States (2330), 264, 64);
+ Add_Goto (Table.States (2330), 265, 65);
+ Add_Goto (Table.States (2330), 266, 66);
+ Add_Goto (Table.States (2330), 267, 67);
+ Add_Goto (Table.States (2330), 268, 68);
+ Add_Goto (Table.States (2330), 271, 69);
+ Add_Goto (Table.States (2330), 273, 70);
+ Add_Goto (Table.States (2330), 275, 71);
+ Add_Goto (Table.States (2330), 285, 72);
+ Add_Goto (Table.States (2330), 286, 73);
+ Add_Goto (Table.States (2330), 288, 74);
+ Add_Goto (Table.States (2330), 289, 75);
+ Add_Goto (Table.States (2330), 290, 76);
+ Add_Goto (Table.States (2330), 310, 82);
+ Add_Goto (Table.States (2330), 311, 83);
+ Add_Goto (Table.States (2330), 316, 84);
+ Add_Goto (Table.States (2330), 318, 85);
+ Add_Goto (Table.States (2330), 357, 110);
+ Add_Goto (Table.States (2330), 363, 111);
+ Add_Goto (Table.States (2330), 364, 112);
+ Add_Goto (Table.States (2330), 365, 113);
+ Add_Goto (Table.States (2330), 366, 114);
+ Add_Goto (Table.States (2330), 367, 115);
+ Add_Goto (Table.States (2330), 370, 116);
+ Add_Goto (Table.States (2330), 376, 117);
+ Add_Goto (Table.States (2330), 378, 118);
+ Add_Goto (Table.States (2330), 379, 119);
+ Add_Goto (Table.States (2330), 382, 120);
+ Add_Goto (Table.States (2330), 396, 2365);
+ Add_Goto (Table.States (2330), 401, 133);
+ Add_Goto (Table.States (2330), 461, 332);
+ Add_Goto (Table.States (2330), 462, 144);
+ Table.States (2330).Kernel := To_Vector ((0 => ((359, 1), 38, 4,
(32767, 0), 0)));
+ Table.States (2330).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ Table.States (2331).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2331), 38, (359, 0), 2366);
+ Table.States (2331).Kernel := To_Vector ((0 => ((359, 0), 192,
5, (32767, 0), 0)));
+ Table.States (2331).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (359, 0), 38, 2366)));
+ Table.States (2332).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2332), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (346, 0), 11);
+ Table.States (2332).Kernel := To_Vector ((0 => ((346, 0), 108,
0, (346, 0), 11)));
+ Table.States (2332).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (346, 0), 11)));
+ end Subr_75;
+ procedure Subr_76
+ is begin
+ Table.States (2333).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2333), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (345, 0), 11);
+ Table.States (2333).Kernel := To_Vector ((0 => ((345, 0), 108,
0, (345, 0), 11)));
+ Table.States (2333).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (345, 0), 11)));
+ Table.States (2334).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2334), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (340, 0), 11);
+ Table.States (2334).Kernel := To_Vector ((0 => ((340, 0), 108,
0, (340, 0), 11)));
+ Table.States (2334).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (340, 0), 11)));
+ Table.States (2335).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2335), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 41), 11);
+ Table.States (2335).Kernel := To_Vector ((0 => ((328, 41), 108,
0, (328, 41), 11)));
+ Table.States (2335).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 41), 11)));
+ Table.States (2336).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2336), 108, (328, 40), 2367);
+ Table.States (2336).Kernel := To_Vector ((0 => ((328, 40), 434,
1, (32767, 0), 0)));
+ Table.States (2336).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 40), 108, 2367)));
+ Table.States (2337).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2337), (63, 66), (176, 0), 4);
+ Table.States (2337).Kernel := To_Vector ((0 => ((176, 0), 171,
0, (176, 0), 4)));
+ Table.States (2337).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (176, 0), 4)));
+ Table.States (2338).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2338), (63, 66), (175, 0), 7);
+ Table.States (2338).Kernel := To_Vector ((0 => ((175, 0), 108,
0, (175, 0), 7)));
+ Table.States (2338).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (175, 0), 7)));
+ Table.States (2339).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2339), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 44), 11);
+ Table.States (2339).Kernel := To_Vector ((0 => ((328, 44), 108,
0, (328, 44), 11)));
+ Table.States (2339).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 44), 11)));
+ Table.States (2340).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2340), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 37), 11);
+ Table.States (2340).Kernel := To_Vector ((0 => ((328, 37), 108,
0, (328, 37), 11)));
+ Table.States (2340).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 37), 11)));
+ Table.States (2341).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2341), 108, (328, 36), 2368);
+ Table.States (2341).Kernel := To_Vector ((0 => ((328, 36), 434,
1, (32767, 0), 0)));
+ Table.States (2341).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 36), 108, 2368)));
+ Table.States (2342).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2342), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 30), 11);
+ Table.States (2342).Kernel := To_Vector ((0 => ((328, 30), 108,
0, (328, 30), 11)));
+ Table.States (2342).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 30), 11)));
+ Table.States (2343).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2343), 61, (434, 0), 299);
+ Add_Action (Table.States (2343), 108, (328, 29), 2369);
+ Table.States (2343).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2343), 434, 2370);
+ Table.States (2343).Kernel := To_Vector ((((328, 28), 27, 3,
(32767, 0), 0), ((328, 29), 27, 1,
+ (32767, 0), 0)));
+ Table.States (2343).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 29), 108, 2369)));
+ Table.States (2344).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2344), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 33), 11);
+ Table.States (2344).Kernel := To_Vector ((0 => ((328, 33), 108,
0, (328, 33), 11)));
+ Table.States (2344).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 33), 11)));
+ Table.States (2345).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2345), 108, (328, 32), 2371);
+ Table.States (2345).Kernel := To_Vector ((0 => ((328, 32), 434,
1, (32767, 0), 0)));
+ Table.States (2345).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 32), 108, 2371)));
+ Table.States (2346).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2346), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 26), 11);
+ Table.States (2346).Kernel := To_Vector ((0 => ((328, 26), 108,
0, (328, 26), 11)));
+ Table.States (2346).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 26), 11)));
+ Table.States (2347).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2347), 61, (434, 0), 299);
+ Add_Action (Table.States (2347), 108, (328, 25), 2372);
+ Table.States (2347).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2347), 434, 2373);
+ Table.States (2347).Kernel := To_Vector ((((328, 24), 27, 3,
(32767, 0), 0), ((328, 25), 27, 1,
+ (32767, 0), 0)));
+ Table.States (2347).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 25), 108, 2372)));
+ Table.States (2348).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2348), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 18), 11);
+ Table.States (2348).Kernel := To_Vector ((0 => ((328, 18), 108,
0, (328, 18), 11)));
+ Table.States (2348).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 18), 11)));
+ Table.States (2349).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2349), 61, (434, 0), 299);
+ Add_Action (Table.States (2349), 108, (328, 17), 2374);
+ Table.States (2349).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2349), 434, 2375);
+ Table.States (2349).Kernel := To_Vector ((((328, 16), 27, 3,
(32767, 0), 0), ((328, 17), 27, 1,
+ (32767, 0), 0)));
+ Table.States (2349).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 17), 108, 2374)));
+ Table.States (2350).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2350), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 21), 11);
+ Table.States (2350).Kernel := To_Vector ((0 => ((328, 21), 108,
0, (328, 21), 11)));
+ Table.States (2350).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 21), 11)));
+ Table.States (2351).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2351), 108, (328, 20), 2376);
+ Table.States (2351).Kernel := To_Vector ((0 => ((328, 20), 434,
1, (32767, 0), 0)));
+ Table.States (2351).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 20), 108, 2376)));
+ Table.States (2352).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2352), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 14), 11);
+ Table.States (2352).Kernel := To_Vector ((0 => ((328, 14), 108,
0, (328, 14), 11)));
+ Table.States (2352).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 14), 11)));
+ Table.States (2353).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2353), 61, (434, 0), 299);
+ Add_Action (Table.States (2353), 108, (328, 13), 2377);
+ Table.States (2353).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2353), 434, 2378);
+ Table.States (2353).Kernel := To_Vector ((((328, 12), 27, 3,
(32767, 0), 0), ((328, 13), 27, 1,
+ (32767, 0), 0)));
+ Table.States (2353).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 13), 108, 2377)));
+ Table.States (2354).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2354), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 7), 11);
+ Table.States (2354).Kernel := To_Vector ((0 => ((328, 7), 108,
0, (328, 7), 11)));
+ Table.States (2354).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 7), 11)));
+ Table.States (2355).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2355), 108, (328, 6), 2379);
+ Table.States (2355).Kernel := To_Vector ((0 => ((328, 6), 434,
1, (32767, 0), 0)));
+ Table.States (2355).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 6), 108, 2379)));
+ Table.States (2356).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2356), 27, (328, 4), 2380);
+ Table.States (2356).Kernel := To_Vector ((((328, 4), 61, 4,
(32767, 0), 0), ((328, 5), 61, 2, (32767,
+ 0), 0)));
+ Table.States (2356).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 4), 27, 2380)));
+ Table.States (2357).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2357), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 10), 11);
+ Table.States (2357).Kernel := To_Vector ((0 => ((328, 10), 108,
0, (328, 10), 11)));
+ Table.States (2357).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 10), 11)));
+ Table.States (2358).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2358), 61, (434, 0), 299);
+ Add_Action (Table.States (2358), 108, (328, 9), 2381);
+ Table.States (2358).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2358), 434, 2382);
+ Table.States (2358).Kernel := To_Vector ((((328, 8), 27, 3,
(32767, 0), 0), ((328, 9), 27, 1, (32767,
+ 0), 0)));
+ Table.States (2358).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 9), 108, 2381)));
+ Table.States (2359).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2359), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 3), 11);
+ Table.States (2359).Kernel := To_Vector ((0 => ((328, 3), 108,
0, (328, 3), 11)));
+ Table.States (2359).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 3), 11)));
+ Table.States (2360).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2360), 108, (328, 2), 2383);
+ Table.States (2360).Kernel := To_Vector ((0 => ((328, 2), 434,
1, (32767, 0), 0)));
+ Table.States (2360).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 2), 108, 2383)));
+ Table.States (2361).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2361), 27, (328, 0), 2384);
+ Table.States (2361).Kernel := To_Vector ((((328, 0), 61, 4,
(32767, 0), 0), ((328, 1), 61, 2, (32767,
+ 0), 0)));
+ Table.States (2361).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 0), 27, 2384)));
+ Table.States (2362).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (2362), (49, 61, 108), (415, 3), 8);
+ Table.States (2362).Kernel := To_Vector ((0 => ((415, 3), 27, 0,
(415, 3), 8)));
+ Table.States (2362).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (415, 3), 8)));
+ Table.States (2363).Action_List.Set_Capacity (3);
+ Add_Action (Table.States (2363), (49, 61, 108), (415, 0), 8);
+ Table.States (2363).Kernel := To_Vector ((0 => ((415, 0), 27, 0,
(415, 0), 8)));
+ Table.States (2363).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (415, 0), 8)));
+ Table.States (2364).Action_List.Set_Capacity (6);
+ Add_Action (Table.States (2364), (66, 86, 90, 116, 117, 118),
(441, 0), 8);
+ Table.States (2364).Kernel := To_Vector ((0 => ((441, 0), 108,
0, (441, 0), 8)));
+ Table.States (2364).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (441, 0), 8)));
+ Table.States (2365).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2365), 66, (359, 1), 2385);
+ Table.States (2365).Kernel := To_Vector ((0 => ((359, 1), 396,
2, (32767, 0), 0)));
+ Table.States (2365).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (359, 1), 66, 2385)));
+ Table.States (2366).Action_List.Set_Capacity (25);
+ Add_Action (Table.States (2366), 12, (401, 0), 1);
+ Add_Action (Table.States (2366), 15, (370, 0), 3);
+ Add_Action (Table.States (2366), 17, (365, 0), 4);
+ Add_Action (Table.States (2366), 18, (382, 0), 5);
+ Add_Action (Table.States (2366), 19, (363, 0), 6);
+ Add_Action (Table.States (2366), 20, (357, 0), 7);
+ Add_Action (Table.States (2366), 30, (316, 0), 13);
+ Add_Action (Table.States (2366), 31, (290, 0), 14);
+ Add_Action (Table.States (2366), 32, (289, 0), 15);
+ Add_Action (Table.States (2366), 35, Reduce, (285, 1), 0);
+ Add_Action (Table.States (2366), 36, Reduce, (285, 1), 0);
+ Add_Action (Table.States (2366), 37, (288, 0), 17);
+ Add_Conflict (Table.States (2366), 37, (285, 1), 0);
+ Add_Action (Table.States (2366), 38, Reduce, (285, 1), 0);
+ Add_Action (Table.States (2366), 39, Reduce, (285, 1), 0);
+ Add_Action (Table.States (2366), 42, (271, 0), 18);
+ Add_Action (Table.States (2366), 51, Reduce, (285, 1), 0);
+ Add_Action (Table.States (2366), 64, (273, 0), 27);
+ Add_Action (Table.States (2366), 65, (264, 0), 28);
+ Add_Action (Table.States (2366), 84, (124, 0), 32);
+ Add_Action (Table.States (2366), 86, (252, 0), 33);
+ Add_Action (Table.States (2366), 90, (268, 0), 34);
+ Add_Action (Table.States (2366), 105, (265, 0), 35);
+ Add_Action (Table.States (2366), 116, (196, 0), 146);
+ Add_Action (Table.States (2366), 117, (196, 1), 37);
+ Add_Action (Table.States (2366), 118, (195, 6), 38);
+ Table.States (2366).Goto_List.Set_Capacity (46);
+ Add_Goto (Table.States (2366), 124, 39);
+ Add_Goto (Table.States (2366), 195, 52);
+ Add_Goto (Table.States (2366), 196, 53);
+ Add_Goto (Table.States (2366), 197, 54);
+ Add_Goto (Table.States (2366), 198, 55);
+ Add_Goto (Table.States (2366), 199, 56);
+ Add_Goto (Table.States (2366), 201, 57);
+ Add_Goto (Table.States (2366), 251, 58);
+ Add_Goto (Table.States (2366), 252, 59);
+ Add_Goto (Table.States (2366), 255, 60);
+ Add_Goto (Table.States (2366), 259, 452);
+ Add_Goto (Table.States (2366), 261, 331);
+ Add_Goto (Table.States (2366), 262, 62);
+ Add_Goto (Table.States (2366), 263, 63);
+ Add_Goto (Table.States (2366), 264, 64);
+ Add_Goto (Table.States (2366), 265, 65);
+ Add_Goto (Table.States (2366), 266, 66);
+ Add_Goto (Table.States (2366), 267, 67);
+ Add_Goto (Table.States (2366), 268, 68);
+ Add_Goto (Table.States (2366), 271, 69);
+ Add_Goto (Table.States (2366), 273, 70);
+ Add_Goto (Table.States (2366), 275, 71);
+ Add_Goto (Table.States (2366), 285, 72);
+ Add_Goto (Table.States (2366), 286, 73);
+ Add_Goto (Table.States (2366), 288, 74);
+ Add_Goto (Table.States (2366), 289, 75);
+ Add_Goto (Table.States (2366), 290, 76);
+ Add_Goto (Table.States (2366), 310, 82);
+ Add_Goto (Table.States (2366), 311, 83);
+ Add_Goto (Table.States (2366), 316, 84);
+ Add_Goto (Table.States (2366), 318, 85);
+ Add_Goto (Table.States (2366), 357, 110);
+ Add_Goto (Table.States (2366), 363, 111);
+ Add_Goto (Table.States (2366), 364, 112);
+ Add_Goto (Table.States (2366), 365, 113);
+ Add_Goto (Table.States (2366), 366, 114);
+ Add_Goto (Table.States (2366), 367, 115);
+ Add_Goto (Table.States (2366), 370, 116);
+ Add_Goto (Table.States (2366), 376, 117);
+ Add_Goto (Table.States (2366), 378, 118);
+ Add_Goto (Table.States (2366), 379, 119);
+ Add_Goto (Table.States (2366), 382, 120);
+ Add_Goto (Table.States (2366), 396, 2386);
+ Add_Goto (Table.States (2366), 401, 133);
+ Add_Goto (Table.States (2366), 461, 332);
+ Add_Goto (Table.States (2366), 462, 144);
+ Table.States (2366).Kernel := To_Vector ((0 => ((359, 0), 38, 4,
(32767, 0), 0)));
+ Table.States (2366).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 65, 28)));
+ Table.States (2367).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2367), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 40), 12);
+ Table.States (2367).Kernel := To_Vector ((0 => ((328, 40), 108,
0, (328, 40), 12)));
+ Table.States (2367).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 40), 12)));
+ Table.States (2368).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2368), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 36), 12);
+ Table.States (2368).Kernel := To_Vector ((0 => ((328, 36), 108,
0, (328, 36), 12)));
+ Table.States (2368).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 36), 12)));
+ Table.States (2369).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2369), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 29), 12);
+ Table.States (2369).Kernel := To_Vector ((0 => ((328, 29), 108,
0, (328, 29), 12)));
+ Table.States (2369).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 29), 12)));
+ Table.States (2370).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2370), 108, (328, 28), 2387);
+ Table.States (2370).Kernel := To_Vector ((0 => ((328, 28), 434,
1, (32767, 0), 0)));
+ Table.States (2370).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 28), 108, 2387)));
+ Table.States (2371).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2371), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 32), 12);
+ Table.States (2371).Kernel := To_Vector ((0 => ((328, 32), 108,
0, (328, 32), 12)));
+ Table.States (2371).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 32), 12)));
+ Table.States (2372).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2372), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 25), 12);
+ Table.States (2372).Kernel := To_Vector ((0 => ((328, 25), 108,
0, (328, 25), 12)));
+ Table.States (2372).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 25), 12)));
+ Table.States (2373).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2373), 108, (328, 24), 2388);
+ Table.States (2373).Kernel := To_Vector ((0 => ((328, 24), 434,
1, (32767, 0), 0)));
+ Table.States (2373).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 24), 108, 2388)));
+ Table.States (2374).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2374), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 17), 12);
+ Table.States (2374).Kernel := To_Vector ((0 => ((328, 17), 108,
0, (328, 17), 12)));
+ Table.States (2374).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 17), 12)));
+ Table.States (2375).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2375), 108, (328, 16), 2389);
+ Table.States (2375).Kernel := To_Vector ((0 => ((328, 16), 434,
1, (32767, 0), 0)));
+ Table.States (2375).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 16), 108, 2389)));
+ Table.States (2376).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2376), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 20), 12);
+ Table.States (2376).Kernel := To_Vector ((0 => ((328, 20), 108,
0, (328, 20), 12)));
+ Table.States (2376).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 20), 12)));
+ Table.States (2377).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2377), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 13), 12);
+ Table.States (2377).Kernel := To_Vector ((0 => ((328, 13), 108,
0, (328, 13), 12)));
+ Table.States (2377).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 13), 12)));
+ Table.States (2378).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2378), 108, (328, 12), 2390);
+ Table.States (2378).Kernel := To_Vector ((0 => ((328, 12), 434,
1, (32767, 0), 0)));
+ Table.States (2378).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 12), 108, 2390)));
+ Table.States (2379).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2379), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 6), 12);
+ Table.States (2379).Kernel := To_Vector ((0 => ((328, 6), 108,
0, (328, 6), 12)));
+ Table.States (2379).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 6), 12)));
+ Table.States (2380).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2380), 61, (434, 0), 299);
+ Add_Action (Table.States (2380), 108, (328, 5), 2391);
+ Table.States (2380).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2380), 434, 2392);
+ Table.States (2380).Kernel := To_Vector ((((328, 4), 27, 3,
(32767, 0), 0), ((328, 5), 27, 1, (32767,
+ 0), 0)));
+ Table.States (2380).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 5), 108, 2391)));
+ Table.States (2381).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2381), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 9), 12);
+ Table.States (2381).Kernel := To_Vector ((0 => ((328, 9), 108,
0, (328, 9), 12)));
+ Table.States (2381).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 9), 12)));
+ Table.States (2382).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2382), 108, (328, 8), 2393);
+ Table.States (2382).Kernel := To_Vector ((0 => ((328, 8), 434,
1, (32767, 0), 0)));
+ Table.States (2382).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 8), 108, 2393)));
+ Table.States (2383).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2383), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 2), 12);
+ Table.States (2383).Kernel := To_Vector ((0 => ((328, 2), 108,
0, (328, 2), 12)));
+ Table.States (2383).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 2), 12)));
+ Table.States (2384).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2384), 61, (434, 0), 299);
+ Add_Action (Table.States (2384), 108, (328, 1), 2394);
+ Table.States (2384).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2384), 434, 2395);
+ Table.States (2384).Kernel := To_Vector ((((328, 0), 27, 3,
(32767, 0), 0), ((328, 1), 27, 1, (32767,
+ 0), 0)));
+ Table.States (2384).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 1), 108, 2394)));
+ Table.States (2385).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2385), 108, Reduce, (284, 1), 0);
+ Add_Action (Table.States (2385), 116, (284, 0), 1312);
+ Table.States (2385).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2385), 284, 2396);
+ Table.States (2385).Kernel := To_Vector ((0 => ((359, 1), 66, 1,
(32767, 0), 0)));
+ Table.States (2385).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (284, 1), 0)));
+ Table.States (2386).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2386), 66, (359, 0), 2397);
+ Table.States (2386).Kernel := To_Vector ((0 => ((359, 0), 396,
2, (32767, 0), 0)));
+ Table.States (2386).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (359, 0), 66, 2397)));
+ Table.States (2387).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2387), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 28), 13);
+ Table.States (2387).Kernel := To_Vector ((0 => ((328, 28), 108,
0, (328, 28), 13)));
+ Table.States (2387).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 28), 13)));
+ Table.States (2388).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2388), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 24), 13);
+ Table.States (2388).Kernel := To_Vector ((0 => ((328, 24), 108,
0, (328, 24), 13)));
+ Table.States (2388).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 24), 13)));
+ Table.States (2389).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2389), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 16), 13);
+ Table.States (2389).Kernel := To_Vector ((0 => ((328, 16), 108,
0, (328, 16), 13)));
+ Table.States (2389).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 16), 13)));
+ Table.States (2390).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2390), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 12), 13);
+ Table.States (2390).Kernel := To_Vector ((0 => ((328, 12), 108,
0, (328, 12), 13)));
+ Table.States (2390).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 12), 13)));
+ Table.States (2391).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2391), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 5), 13);
+ Table.States (2391).Kernel := To_Vector ((0 => ((328, 5), 108,
0, (328, 5), 13)));
+ Table.States (2391).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 5), 13)));
+ Table.States (2392).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2392), 108, (328, 4), 2398);
+ Table.States (2392).Kernel := To_Vector ((0 => ((328, 4), 434,
1, (32767, 0), 0)));
+ Table.States (2392).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 4), 108, 2398)));
+ end Subr_76;
+ procedure Subr_77
+ is begin
+ Table.States (2393).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2393), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 8), 13);
+ Table.States (2393).Kernel := To_Vector ((0 => ((328, 8), 108,
0, (328, 8), 13)));
+ Table.States (2393).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 8), 13)));
+ Table.States (2394).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2394), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 1), 13);
+ Table.States (2394).Kernel := To_Vector ((0 => ((328, 1), 108,
0, (328, 1), 13)));
+ Table.States (2394).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 1), 13)));
+ Table.States (2395).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2395), 108, (328, 0), 2399);
+ Table.States (2395).Kernel := To_Vector ((0 => ((328, 0), 434,
1, (32767, 0), 0)));
+ Table.States (2395).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (328, 0), 108, 2399)));
+ Table.States (2396).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2396), 108, (359, 1), 2400);
+ Table.States (2396).Kernel := To_Vector ((0 => ((359, 1), 284,
1, (32767, 0), 0)));
+ Table.States (2396).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (359, 1), 108, 2400)));
+ Table.States (2397).Action_List.Set_Capacity (2);
+ Add_Action (Table.States (2397), 108, Reduce, (284, 1), 0);
+ Add_Action (Table.States (2397), 116, (284, 0), 1312);
+ Table.States (2397).Goto_List.Set_Capacity (1);
+ Add_Goto (Table.States (2397), 284, 2401);
+ Table.States (2397).Kernel := To_Vector ((0 => ((359, 0), 66, 1,
(32767, 0), 0)));
+ Table.States (2397).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (284, 1), 0)));
+ Table.States (2398).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2398), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 4), 14);
+ Table.States (2398).Kernel := To_Vector ((0 => ((328, 4), 108,
0, (328, 4), 14)));
+ Table.States (2398).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 4), 14)));
+ Table.States (2399).Action_List.Set_Capacity (43);
+ Add_Action (Table.States (2399), (12, 13, 15, 17, 18, 19, 20, 21,
22, 25, 27, 28, 30, 31, 32, 35, 36, 37,
+ 38, 39, 42, 50, 51, 52, 53, 54, 59, 60, 61, 64, 65, 66, 77, 81,
83, 84, 86, 90, 105, 116, 117, 118, 119),
+ (328, 0), 14);
+ Table.States (2399).Kernel := To_Vector ((0 => ((328, 0), 108,
0, (328, 0), 14)));
+ Table.States (2399).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 0), 14)));
+ Table.States (2400).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (2400), (21, 25, 51, 52, 53, 54, 66),
(359, 1), 11);
+ Table.States (2400).Kernel := To_Vector ((0 => ((359, 1), 108,
0, (359, 1), 11)));
+ Table.States (2400).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (359, 1), 11)));
+ Table.States (2401).Action_List.Set_Capacity (1);
+ Add_Action (Table.States (2401), 108, (359, 0), 2402);
+ Table.States (2401).Kernel := To_Vector ((0 => ((359, 0), 284,
1, (32767, 0), 0)));
+ Table.States (2401).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (359, 0), 108, 2402)));
+ Table.States (2402).Action_List.Set_Capacity (7);
+ Add_Action (Table.States (2402), (21, 25, 51, 52, 53, 54, 66),
(359, 0), 12);
+ Table.States (2402).Kernel := To_Vector ((0 => ((359, 0), 108,
0, (359, 0), 12)));
+ Table.States (2402).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (359, 0), 12)));
+ end Subr_77;
+ begin
+ Subr_1;
+ Subr_2;
+ Subr_3;
+ Subr_4;
+ Subr_5;
+ Subr_6;
+ Subr_7;
+ Subr_8;
+ Subr_9;
+ Subr_10;
+ Subr_11;
+ Subr_12;
+ Subr_13;
+ Subr_14;
+ Subr_15;
+ Subr_16;
+ Subr_17;
+ Subr_18;
+ Subr_19;
+ Subr_20;
+ Subr_21;
+ Subr_22;
+ Subr_23;
+ Subr_24;
+ Subr_25;
+ Subr_26;
+ Subr_27;
+ Subr_28;
+ Subr_29;
+ Subr_30;
+ Subr_31;
+ Subr_32;
+ Subr_33;
+ Subr_34;
+ Subr_35;
+ Subr_36;
+ Subr_37;
+ Subr_38;
+ Subr_39;
+ Subr_40;
+ Subr_41;
+ Subr_42;
+ Subr_43;
+ Subr_44;
+ Subr_45;
+ Subr_46;
+ Subr_47;
+ Subr_48;
+ Subr_49;
+ Subr_50;
+ Subr_51;
+ Subr_52;
+ Subr_53;
+ Subr_54;
+ Subr_55;
+ Subr_56;
+ Subr_57;
+ Subr_58;
+ Subr_59;
+ Subr_60;
+ Subr_61;
+ Subr_62;
+ Subr_63;
+ Subr_64;
+ Subr_65;
+ Subr_66;
+ Subr_67;
+ Subr_68;
+ Subr_69;
+ Subr_70;
+ Subr_71;
+ Subr_72;
+ Subr_73;
+ Subr_74;
+ Subr_75;
+ Subr_76;
+ Subr_77;
+ Table.Error_Action := new Parse_Action_Node'((Verb => Error, others
=> <>), null);
+ end;
+
+ Table.Error_Recover_Enabled := True;
+ Table.McKenzie_Param := McKenzie_Param;
+ Table.Max_Parallel := 20;
+ return Table;
+ end Create_Parse_Table;
+
+ function Create_Lexer (Trace : in WisiToken.Trace_Access) return
WisiToken.Lexer.Handle
+ is begin
+ return Lexer.New_Lexer (Trace,
Ada_Annex_P_Process_Actions.Descriptor'Access);
+ end Create_Lexer;
+
+ function Create_Productions return
WisiToken.Syntax_Trees.Production_Info_Trees.Vector
+ is begin
+ return Result : WisiToken.Syntax_Trees.Production_Info_Trees.Vector do
+ Result.Set_First_Last (120, 466);
+ Result (123).RHSs.Set_First_Last (0, 1);
+ Result (123).RHSs (0).In_Parse_Action := null;
+ Result (123).RHSs (0).Post_Parse_Action :=
pragma_argument_association_list_0'Access;
+ Result (123).RHSs (1).In_Parse_Action := null;
+ Result (123).RHSs (1).Post_Parse_Action :=
pragma_argument_association_list_1'Access;
+ Result (124).RHSs.Set_First_Last (0, 3);
+ Result (124).RHSs (0).In_Parse_Action := null;
+ Result (124).RHSs (0).Post_Parse_Action := pragma_g_0'Access;
+ Result (124).RHSs (1).In_Parse_Action := null;
+ Result (124).RHSs (1).Post_Parse_Action := pragma_g_1'Access;
+ Result (124).RHSs (2).In_Parse_Action := null;
+ Result (124).RHSs (2).Post_Parse_Action := pragma_g_2'Access;
+ Result (124).RHSs (3).In_Parse_Action := null;
+ Result (124).RHSs (3).Post_Parse_Action := pragma_g_3'Access;
+ Result (128).RHSs.Set_First_Last (0, 5);
+ Result (128).RHSs (0).In_Parse_Action := null;
+ Result (128).RHSs (0).Post_Parse_Action :=
full_type_declaration_0'Access;
+ Result (128).RHSs (1).In_Parse_Action := null;
+ Result (128).RHSs (1).Post_Parse_Action :=
full_type_declaration_1'Access;
+ Result (128).RHSs (2).In_Parse_Action := null;
+ Result (128).RHSs (2).Post_Parse_Action :=
full_type_declaration_2'Access;
+ Result (128).RHSs (3).In_Parse_Action := null;
+ Result (128).RHSs (3).Post_Parse_Action :=
full_type_declaration_3'Access;
+ Result (128).RHSs (4).In_Parse_Action := null;
+ Result (128).RHSs (4).Post_Parse_Action := null;
+ Result (128).RHSs (5).In_Parse_Action := null;
+ Result (128).RHSs (5).Post_Parse_Action := null;
+ Result (130).RHSs.Set_First_Last (0, 1);
+ Result (130).RHSs (0).In_Parse_Action := null;
+ Result (130).RHSs (0).Post_Parse_Action :=
subtype_declaration_0'Access;
+ Result (130).RHSs (1).In_Parse_Action := null;
+ Result (130).RHSs (1).Post_Parse_Action :=
subtype_declaration_1'Access;
+ Result (135).RHSs.Set_First_Last (0, 49);
+ Result (135).RHSs (0).In_Parse_Action := null;
+ Result (135).RHSs (0).Post_Parse_Action :=
object_declaration_0'Access;
+ Result (135).RHSs (1).In_Parse_Action := null;
+ Result (135).RHSs (1).Post_Parse_Action :=
object_declaration_1'Access;
+ Result (135).RHSs (2).In_Parse_Action := null;
+ Result (135).RHSs (2).Post_Parse_Action :=
object_declaration_2'Access;
+ Result (135).RHSs (3).In_Parse_Action := null;
+ Result (135).RHSs (3).Post_Parse_Action :=
object_declaration_3'Access;
+ Result (135).RHSs (4).In_Parse_Action := null;
+ Result (135).RHSs (4).Post_Parse_Action :=
object_declaration_4'Access;
+ Result (135).RHSs (5).In_Parse_Action := null;
+ Result (135).RHSs (5).Post_Parse_Action :=
object_declaration_5'Access;
+ Result (135).RHSs (6).In_Parse_Action := null;
+ Result (135).RHSs (6).Post_Parse_Action :=
object_declaration_6'Access;
+ Result (135).RHSs (7).In_Parse_Action := null;
+ Result (135).RHSs (7).Post_Parse_Action :=
object_declaration_7'Access;
+ Result (135).RHSs (8).In_Parse_Action := null;
+ Result (135).RHSs (8).Post_Parse_Action :=
object_declaration_8'Access;
+ Result (135).RHSs (9).In_Parse_Action := null;
+ Result (135).RHSs (9).Post_Parse_Action :=
object_declaration_9'Access;
+ Result (135).RHSs (10).In_Parse_Action := null;
+ Result (135).RHSs (10).Post_Parse_Action :=
object_declaration_10'Access;
+ Result (135).RHSs (11).In_Parse_Action := null;
+ Result (135).RHSs (11).Post_Parse_Action :=
object_declaration_11'Access;
+ Result (135).RHSs (12).In_Parse_Action := null;
+ Result (135).RHSs (12).Post_Parse_Action :=
object_declaration_12'Access;
+ Result (135).RHSs (13).In_Parse_Action := null;
+ Result (135).RHSs (13).Post_Parse_Action :=
object_declaration_13'Access;
+ Result (135).RHSs (14).In_Parse_Action := null;
+ Result (135).RHSs (14).Post_Parse_Action :=
object_declaration_14'Access;
+ Result (135).RHSs (15).In_Parse_Action := null;
+ Result (135).RHSs (15).Post_Parse_Action :=
object_declaration_15'Access;
+ Result (135).RHSs (16).In_Parse_Action := null;
+ Result (135).RHSs (16).Post_Parse_Action :=
object_declaration_16'Access;
+ Result (135).RHSs (17).In_Parse_Action := null;
+ Result (135).RHSs (17).Post_Parse_Action :=
object_declaration_17'Access;
+ Result (135).RHSs (18).In_Parse_Action := null;
+ Result (135).RHSs (18).Post_Parse_Action :=
object_declaration_18'Access;
+ Result (135).RHSs (19).In_Parse_Action := null;
+ Result (135).RHSs (19).Post_Parse_Action :=
object_declaration_19'Access;
+ Result (135).RHSs (20).In_Parse_Action := null;
+ Result (135).RHSs (20).Post_Parse_Action :=
object_declaration_20'Access;
+ Result (135).RHSs (21).In_Parse_Action := null;
+ Result (135).RHSs (21).Post_Parse_Action :=
object_declaration_21'Access;
+ Result (135).RHSs (22).In_Parse_Action := null;
+ Result (135).RHSs (22).Post_Parse_Action :=
object_declaration_22'Access;
+ Result (135).RHSs (23).In_Parse_Action := null;
+ Result (135).RHSs (23).Post_Parse_Action :=
object_declaration_23'Access;
+ Result (135).RHSs (24).In_Parse_Action := null;
+ Result (135).RHSs (24).Post_Parse_Action :=
object_declaration_24'Access;
+ Result (135).RHSs (25).In_Parse_Action := null;
+ Result (135).RHSs (25).Post_Parse_Action :=
object_declaration_25'Access;
+ Result (135).RHSs (26).In_Parse_Action := null;
+ Result (135).RHSs (26).Post_Parse_Action :=
object_declaration_26'Access;
+ Result (135).RHSs (27).In_Parse_Action := null;
+ Result (135).RHSs (27).Post_Parse_Action :=
object_declaration_27'Access;
+ Result (135).RHSs (28).In_Parse_Action := null;
+ Result (135).RHSs (28).Post_Parse_Action :=
object_declaration_28'Access;
+ Result (135).RHSs (29).In_Parse_Action := null;
+ Result (135).RHSs (29).Post_Parse_Action :=
object_declaration_29'Access;
+ Result (135).RHSs (30).In_Parse_Action := null;
+ Result (135).RHSs (30).Post_Parse_Action :=
object_declaration_30'Access;
+ Result (135).RHSs (31).In_Parse_Action := null;
+ Result (135).RHSs (31).Post_Parse_Action :=
object_declaration_31'Access;
+ Result (135).RHSs (32).In_Parse_Action := null;
+ Result (135).RHSs (32).Post_Parse_Action :=
object_declaration_32'Access;
+ Result (135).RHSs (33).In_Parse_Action := null;
+ Result (135).RHSs (33).Post_Parse_Action :=
object_declaration_33'Access;
+ Result (135).RHSs (34).In_Parse_Action := null;
+ Result (135).RHSs (34).Post_Parse_Action :=
object_declaration_34'Access;
+ Result (135).RHSs (35).In_Parse_Action := null;
+ Result (135).RHSs (35).Post_Parse_Action :=
object_declaration_35'Access;
+ Result (135).RHSs (36).In_Parse_Action := null;
+ Result (135).RHSs (36).Post_Parse_Action :=
object_declaration_36'Access;
+ Result (135).RHSs (37).In_Parse_Action := null;
+ Result (135).RHSs (37).Post_Parse_Action :=
object_declaration_37'Access;
+ Result (135).RHSs (38).In_Parse_Action := null;
+ Result (135).RHSs (38).Post_Parse_Action :=
object_declaration_38'Access;
+ Result (135).RHSs (39).In_Parse_Action := null;
+ Result (135).RHSs (39).Post_Parse_Action :=
object_declaration_39'Access;
+ Result (135).RHSs (40).In_Parse_Action := null;
+ Result (135).RHSs (40).Post_Parse_Action :=
object_declaration_40'Access;
+ Result (135).RHSs (41).In_Parse_Action := null;
+ Result (135).RHSs (41).Post_Parse_Action :=
object_declaration_41'Access;
+ Result (135).RHSs (42).In_Parse_Action := null;
+ Result (135).RHSs (42).Post_Parse_Action :=
object_declaration_42'Access;
+ Result (135).RHSs (43).In_Parse_Action := null;
+ Result (135).RHSs (43).Post_Parse_Action :=
object_declaration_43'Access;
+ Result (135).RHSs (44).In_Parse_Action := null;
+ Result (135).RHSs (44).Post_Parse_Action :=
object_declaration_44'Access;
+ Result (135).RHSs (45).In_Parse_Action := null;
+ Result (135).RHSs (45).Post_Parse_Action :=
object_declaration_45'Access;
+ Result (135).RHSs (46).In_Parse_Action := null;
+ Result (135).RHSs (46).Post_Parse_Action :=
object_declaration_46'Access;
+ Result (135).RHSs (47).In_Parse_Action := null;
+ Result (135).RHSs (47).Post_Parse_Action :=
object_declaration_47'Access;
+ Result (135).RHSs (48).In_Parse_Action := null;
+ Result (135).RHSs (48).Post_Parse_Action := null;
+ Result (135).RHSs (49).In_Parse_Action := null;
+ Result (135).RHSs (49).Post_Parse_Action := null;
+ Result (136).RHSs.Set_First_Last (0, 1);
+ Result (136).RHSs (0).In_Parse_Action := null;
+ Result (136).RHSs (0).Post_Parse_Action :=
defining_identifier_list_0'Access;
+ Result (136).RHSs (1).In_Parse_Action := null;
+ Result (136).RHSs (1).Post_Parse_Action :=
defining_identifier_list_1'Access;
+ Result (137).RHSs.Set_First_Last (0, 0);
+ Result (137).RHSs (0).In_Parse_Action := null;
+ Result (137).RHSs (0).Post_Parse_Action :=
number_declaration_0'Access;
+ Result (141).Optimized_List := True;
+ Result (142).RHSs.Set_First_Last (0, 0);
+ Result (142).RHSs (0).In_Parse_Action := null;
+ Result (142).RHSs (0).Post_Parse_Action :=
enumeration_type_definition_0'Access;
+ Result (144).RHSs.Set_First_Last (0, 1);
+ Result (144).RHSs (0).In_Parse_Action := null;
+ Result (144).RHSs (0).Post_Parse_Action :=
integer_type_definition_0'Access;
+ Result (144).RHSs (1).In_Parse_Action := null;
+ Result (144).RHSs (1).Post_Parse_Action :=
integer_type_definition_1'Access;
+ Result (155).Optimized_List := True;
+ Result (156).RHSs.Set_First_Last (0, 0);
+ Result (156).RHSs (0).In_Parse_Action := null;
+ Result (156).RHSs (0).Post_Parse_Action :=
unconstrained_array_definition_0'Access;
+ Result (158).Optimized_List := True;
+ Result (159).RHSs.Set_First_Last (0, 0);
+ Result (159).RHSs (0).In_Parse_Action := null;
+ Result (159).RHSs (0).Post_Parse_Action :=
constrained_array_definition_0'Access;
+ Result (163).RHSs.Set_First_Last (0, 1);
+ Result (163).RHSs (0).In_Parse_Action := null;
+ Result (163).RHSs (0).Post_Parse_Action := discrete_range_0'Access;
+ Result (163).RHSs (1).In_Parse_Action := null;
+ Result (163).RHSs (1).Post_Parse_Action := discrete_range_1'Access;
+ Result (166).Optimized_List := True;
+ Result (167).RHSs.Set_First_Last (0, 0);
+ Result (167).RHSs (0).In_Parse_Action := null;
+ Result (167).RHSs (0).Post_Parse_Action :=
known_discriminant_part_0'Access;
+ Result (168).RHSs.Set_First_Last (0, 5);
+ Result (168).RHSs (0).In_Parse_Action := null;
+ Result (168).RHSs (0).Post_Parse_Action :=
discriminant_specification_0'Access;
+ Result (168).RHSs (1).In_Parse_Action := null;
+ Result (168).RHSs (1).Post_Parse_Action :=
discriminant_specification_1'Access;
+ Result (168).RHSs (2).In_Parse_Action := null;
+ Result (168).RHSs (2).Post_Parse_Action :=
discriminant_specification_2'Access;
+ Result (168).RHSs (3).In_Parse_Action := null;
+ Result (168).RHSs (3).Post_Parse_Action :=
discriminant_specification_3'Access;
+ Result (168).RHSs (4).In_Parse_Action := null;
+ Result (168).RHSs (4).Post_Parse_Action :=
discriminant_specification_4'Access;
+ Result (168).RHSs (5).In_Parse_Action := null;
+ Result (168).RHSs (5).Post_Parse_Action :=
discriminant_specification_5'Access;
+ Result (170).RHSs.Set_First_Last (0, 2);
+ Result (170).RHSs (0).In_Parse_Action := null;
+ Result (170).RHSs (0).Post_Parse_Action := record_definition_0'Access;
+ Result (170).RHSs (1).In_Parse_Action := null;
+ Result (170).RHSs (1).Post_Parse_Action := record_definition_1'Access;
+ Result (170).RHSs (2).In_Parse_Action := null;
+ Result (170).RHSs (2).Post_Parse_Action := null;
+ Result (171).RHSs.Set_First_Last (0, 3);
+ Result (171).RHSs (0).In_Parse_Action := null;
+ Result (171).RHSs (0).Post_Parse_Action := null;
+ Result (171).RHSs (1).In_Parse_Action := null;
+ Result (171).RHSs (1).Post_Parse_Action := null;
+ Result (171).RHSs (2).In_Parse_Action := null;
+ Result (171).RHSs (2).Post_Parse_Action := null;
+ Result (171).RHSs (3).In_Parse_Action := null;
+ Result (171).RHSs (3).Post_Parse_Action := component_list_3'Access;
+ Result (173).RHSs.Set_First_Last (0, 3);
+ Result (173).RHSs (0).In_Parse_Action := null;
+ Result (173).RHSs (0).Post_Parse_Action :=
component_declaration_0'Access;
+ Result (173).RHSs (1).In_Parse_Action := null;
+ Result (173).RHSs (1).Post_Parse_Action :=
component_declaration_1'Access;
+ Result (173).RHSs (2).In_Parse_Action := null;
+ Result (173).RHSs (2).Post_Parse_Action :=
component_declaration_2'Access;
+ Result (173).RHSs (3).In_Parse_Action := null;
+ Result (173).RHSs (3).Post_Parse_Action :=
component_declaration_3'Access;
+ Result (174).RHSs.Set_First_Last (0, 1);
+ Result (174).RHSs (0).In_Parse_Action := null;
+ Result (174).RHSs (0).Post_Parse_Action := null;
+ Result (174).RHSs (1).In_Parse_Action := null;
+ Result (174).RHSs (1).Post_Parse_Action := variant_list_1'Access;
+ Result (175).RHSs.Set_First_Last (0, 0);
+ Result (175).RHSs (0).In_Parse_Action := null;
+ Result (175).RHSs (0).Post_Parse_Action := variant_part_0'Access;
+ Result (176).RHSs.Set_First_Last (0, 0);
+ Result (176).RHSs (0).In_Parse_Action := null;
+ Result (176).RHSs (0).Post_Parse_Action := variant_0'Access;
+ Result (178).RHSs.Set_First_Last (0, 3);
+ Result (178).RHSs (0).In_Parse_Action := null;
+ Result (178).RHSs (0).Post_Parse_Action := discrete_choice_0'Access;
+ Result (178).RHSs (1).In_Parse_Action := null;
+ Result (178).RHSs (1).Post_Parse_Action := discrete_choice_1'Access;
+ Result (178).RHSs (2).In_Parse_Action := null;
+ Result (178).RHSs (2).Post_Parse_Action := discrete_choice_2'Access;
+ Result (178).RHSs (3).In_Parse_Action := null;
+ Result (178).RHSs (3).Post_Parse_Action := null;
+ Result (179).RHSs.Set_First_Last (0, 0);
+ Result (179).RHSs (0).In_Parse_Action := null;
+ Result (179).RHSs (0).Post_Parse_Action :=
record_extension_part_0'Access;
+ Result (180).RHSs.Set_First_Last (0, 3);
+ Result (180).RHSs (0).In_Parse_Action := null;
+ Result (180).RHSs (0).Post_Parse_Action :=
abstract_subprogram_declaration_0'Access;
+ Result (180).RHSs (1).In_Parse_Action := null;
+ Result (180).RHSs (1).Post_Parse_Action :=
abstract_subprogram_declaration_1'Access;
+ Result (180).RHSs (2).In_Parse_Action := null;
+ Result (180).RHSs (2).Post_Parse_Action :=
abstract_subprogram_declaration_2'Access;
+ Result (180).RHSs (3).In_Parse_Action := null;
+ Result (180).RHSs (3).Post_Parse_Action :=
abstract_subprogram_declaration_3'Access;
+ Result (182).RHSs.Set_First_Last (0, 1);
+ Result (182).RHSs (0).In_Parse_Action := null;
+ Result (182).RHSs (0).Post_Parse_Action := interface_list_0'Access;
+ Result (182).RHSs (1).In_Parse_Action := null;
+ Result (182).RHSs (1).Post_Parse_Action := interface_list_1'Access;
+ Result (186).RHSs.Set_First_Last (0, 1);
+ Result (186).RHSs (0).In_Parse_Action := null;
+ Result (186).RHSs (0).Post_Parse_Action :=
access_to_subprogram_definition_0'Access;
+ Result (186).RHSs (1).In_Parse_Action := null;
+ Result (186).RHSs (1).Post_Parse_Action :=
access_to_subprogram_definition_1'Access;
+ Result (188).RHSs.Set_First_Last (0, 11);
+ Result (188).RHSs (0).In_Parse_Action := null;
+ Result (188).RHSs (0).Post_Parse_Action := access_definition_0'Access;
+ Result (188).RHSs (1).In_Parse_Action := null;
+ Result (188).RHSs (1).Post_Parse_Action := access_definition_1'Access;
+ Result (188).RHSs (2).In_Parse_Action := null;
+ Result (188).RHSs (2).Post_Parse_Action := access_definition_2'Access;
+ Result (188).RHSs (3).In_Parse_Action := null;
+ Result (188).RHSs (3).Post_Parse_Action := access_definition_3'Access;
+ Result (188).RHSs (4).In_Parse_Action := null;
+ Result (188).RHSs (4).Post_Parse_Action := access_definition_4'Access;
+ Result (188).RHSs (5).In_Parse_Action := null;
+ Result (188).RHSs (5).Post_Parse_Action := access_definition_5'Access;
+ Result (188).RHSs (6).In_Parse_Action := null;
+ Result (188).RHSs (6).Post_Parse_Action := access_definition_6'Access;
+ Result (188).RHSs (7).In_Parse_Action := null;
+ Result (188).RHSs (7).Post_Parse_Action := access_definition_7'Access;
+ Result (188).RHSs (8).In_Parse_Action := null;
+ Result (188).RHSs (8).Post_Parse_Action := access_definition_8'Access;
+ Result (188).RHSs (9).In_Parse_Action := null;
+ Result (188).RHSs (9).Post_Parse_Action := access_definition_9'Access;
+ Result (188).RHSs (10).In_Parse_Action := null;
+ Result (188).RHSs (10).Post_Parse_Action :=
access_definition_10'Access;
+ Result (188).RHSs (11).In_Parse_Action := null;
+ Result (188).RHSs (11).Post_Parse_Action :=
access_definition_11'Access;
+ Result (189).RHSs.Set_First_Last (0, 3);
+ Result (189).RHSs (0).In_Parse_Action := null;
+ Result (189).RHSs (0).Post_Parse_Action :=
incomplete_type_declaration_0'Access;
+ Result (189).RHSs (1).In_Parse_Action := null;
+ Result (189).RHSs (1).Post_Parse_Action :=
incomplete_type_declaration_1'Access;
+ Result (189).RHSs (2).In_Parse_Action := null;
+ Result (189).RHSs (2).Post_Parse_Action :=
incomplete_type_declaration_2'Access;
+ Result (189).RHSs (3).In_Parse_Action := null;
+ Result (189).RHSs (3).Post_Parse_Action :=
incomplete_type_declaration_3'Access;
+ Result (195).RHSs.Set_First_Last (0, 8);
+ Result (195).RHSs (0).In_Parse_Action := name_0_check'Access;
+ Result (195).RHSs (0).Post_Parse_Action := null;
+ Result (195).RHSs (1).In_Parse_Action := null;
+ Result (195).RHSs (1).Post_Parse_Action := null;
+ Result (195).RHSs (2).In_Parse_Action := null;
+ Result (195).RHSs (2).Post_Parse_Action := null;
+ Result (195).RHSs (3).In_Parse_Action := name_3_check'Access;
+ Result (195).RHSs (3).Post_Parse_Action := null;
+ Result (195).RHSs (4).In_Parse_Action := null;
+ Result (195).RHSs (4).Post_Parse_Action := null;
+ Result (195).RHSs (5).In_Parse_Action := null;
+ Result (195).RHSs (5).Post_Parse_Action := null;
+ Result (195).RHSs (6).In_Parse_Action := null;
+ Result (195).RHSs (6).Post_Parse_Action := null;
+ Result (195).RHSs (7).In_Parse_Action := null;
+ Result (195).RHSs (7).Post_Parse_Action := null;
+ Result (195).RHSs (8).In_Parse_Action := null;
+ Result (195).RHSs (8).Post_Parse_Action := null;
+ Result (196).RHSs.Set_First_Last (0, 1);
+ Result (196).RHSs (0).In_Parse_Action := direct_name_0_check'Access;
+ Result (196).RHSs (0).Post_Parse_Action := direct_name_0'Access;
+ Result (196).RHSs (1).In_Parse_Action := direct_name_1_check'Access;
+ Result (196).RHSs (1).Post_Parse_Action := null;
+ Result (198).RHSs.Set_First_Last (0, 0);
+ Result (198).RHSs (0).In_Parse_Action := null;
+ Result (198).RHSs (0).Post_Parse_Action := slice_0'Access;
+ Result (199).RHSs.Set_First_Last (0, 0);
+ Result (199).RHSs (0).In_Parse_Action :=
selected_component_0_check'Access;
+ Result (199).RHSs (0).Post_Parse_Action :=
selected_component_0'Access;
+ Result (204).RHSs.Set_First_Last (0, 1);
+ Result (204).RHSs (0).In_Parse_Action := null;
+ Result (204).RHSs (0).Post_Parse_Action :=
range_attribute_designator_0'Access;
+ Result (204).RHSs (1).In_Parse_Action := null;
+ Result (204).RHSs (1).Post_Parse_Action :=
range_attribute_designator_1'Access;
+ Result (205).RHSs.Set_First_Last (0, 6);
+ Result (205).RHSs (0).In_Parse_Action := null;
+ Result (205).RHSs (0).Post_Parse_Action := null;
+ Result (205).RHSs (1).In_Parse_Action := null;
+ Result (205).RHSs (1).Post_Parse_Action := null;
+ Result (205).RHSs (2).In_Parse_Action := null;
+ Result (205).RHSs (2).Post_Parse_Action := null;
+ Result (205).RHSs (3).In_Parse_Action := null;
+ Result (205).RHSs (3).Post_Parse_Action := null;
+ Result (205).RHSs (4).In_Parse_Action := null;
+ Result (205).RHSs (4).Post_Parse_Action := aggregate_4'Access;
+ Result (205).RHSs (5).In_Parse_Action := null;
+ Result (205).RHSs (5).Post_Parse_Action := aggregate_5'Access;
+ Result (205).RHSs (6).In_Parse_Action := null;
+ Result (205).RHSs (6).Post_Parse_Action := aggregate_6'Access;
+ Result (206).RHSs.Set_First_Last (0, 0);
+ Result (206).RHSs (0).In_Parse_Action := null;
+ Result (206).RHSs (0).Post_Parse_Action := record_aggregate_0'Access;
+ Result (208).RHSs.Set_First_Last (0, 1);
+ Result (208).RHSs (0).In_Parse_Action := null;
+ Result (208).RHSs (0).Post_Parse_Action :=
record_component_association_0'Access;
+ Result (208).RHSs (1).In_Parse_Action := null;
+ Result (208).RHSs (1).Post_Parse_Action :=
record_component_association_1'Access;
+ Result (209).RHSs.Set_First_Last (0, 1);
+ Result (209).RHSs (0).In_Parse_Action := null;
+ Result (209).RHSs (0).Post_Parse_Action := null;
+ Result (209).RHSs (1).In_Parse_Action := null;
+ Result (209).RHSs (1).Post_Parse_Action :=
component_choice_list_1'Access;
+ Result (210).RHSs.Set_First_Last (0, 0);
+ Result (210).RHSs (0).In_Parse_Action := null;
+ Result (210).RHSs (0).Post_Parse_Action :=
extension_aggregate_0'Access;
+ Result (212).RHSs.Set_First_Last (0, 1);
+ Result (212).RHSs (0).In_Parse_Action := null;
+ Result (212).RHSs (0).Post_Parse_Action := expression_list_0'Access;
+ Result (212).RHSs (1).In_Parse_Action := null;
+ Result (212).RHSs (1).Post_Parse_Action := expression_list_1'Access;
+ Result (213).RHSs.Set_First_Last (0, 3);
+ Result (213).RHSs (0).In_Parse_Action := null;
+ Result (213).RHSs (0).Post_Parse_Action :=
positional_array_aggregate_0'Access;
+ Result (213).RHSs (1).In_Parse_Action := null;
+ Result (213).RHSs (1).Post_Parse_Action :=
positional_array_aggregate_1'Access;
+ Result (213).RHSs (2).In_Parse_Action := null;
+ Result (213).RHSs (2).Post_Parse_Action :=
positional_array_aggregate_2'Access;
+ Result (213).RHSs (3).In_Parse_Action := null;
+ Result (213).RHSs (3).Post_Parse_Action :=
positional_array_aggregate_3'Access;
+ Result (215).RHSs.Set_First_Last (0, 1);
+ Result (215).RHSs (0).In_Parse_Action := null;
+ Result (215).RHSs (0).Post_Parse_Action :=
named_array_aggregate_0'Access;
+ Result (215).RHSs (1).In_Parse_Action := null;
+ Result (215).RHSs (1).Post_Parse_Action :=
named_array_aggregate_1'Access;
+ Result (216).Optimized_List := True;
+ Result (217).RHSs.Set_First_Last (0, 1);
+ Result (217).RHSs (0).In_Parse_Action := null;
+ Result (217).RHSs (0).Post_Parse_Action :=
array_component_association_0'Access;
+ Result (217).RHSs (1).In_Parse_Action := null;
+ Result (217).RHSs (1).Post_Parse_Action := null;
+ Result (219).RHSs.Set_First_Last (0, 0);
+ Result (219).RHSs (0).In_Parse_Action := null;
+ Result (219).RHSs (0).Post_Parse_Action :=
record_delta_aggregate_0'Access;
+ Result (220).RHSs.Set_First_Last (0, 1);
+ Result (220).RHSs (0).In_Parse_Action := null;
+ Result (220).RHSs (0).Post_Parse_Action :=
array_delta_aggregate_0'Access;
+ Result (220).RHSs (1).In_Parse_Action := null;
+ Result (220).RHSs (1).Post_Parse_Action :=
array_delta_aggregate_1'Access;
+ Result (221).RHSs.Set_First_Last (0, 3);
+ Result (221).RHSs (0).In_Parse_Action := null;
+ Result (221).RHSs (0).Post_Parse_Action :=
iterated_element_association_0'Access;
+ Result (221).RHSs (1).In_Parse_Action := null;
+ Result (221).RHSs (1).Post_Parse_Action :=
iterated_element_association_1'Access;
+ Result (221).RHSs (2).In_Parse_Action := null;
+ Result (221).RHSs (2).Post_Parse_Action :=
iterated_element_association_2'Access;
+ Result (221).RHSs (3).In_Parse_Action := null;
+ Result (221).RHSs (3).Post_Parse_Action :=
iterated_element_association_3'Access;
+ Result (229).Optimized_List := True;
+ Result (230).RHSs.Set_First_Last (0, 1);
+ Result (230).RHSs (0).In_Parse_Action := null;
+ Result (230).RHSs (0).Post_Parse_Action := membership_choice_0'Access;
+ Result (230).RHSs (1).In_Parse_Action := null;
+ Result (230).RHSs (1).Post_Parse_Action := membership_choice_1'Access;
+ Result (232).Optimized_List := True;
+ Result (234).RHSs.Set_First_Last (0, 4);
+ Result (234).RHSs (0).In_Parse_Action := null;
+ Result (234).RHSs (0).Post_Parse_Action := primary_0'Access;
+ Result (234).RHSs (1).In_Parse_Action := null;
+ Result (234).RHSs (1).Post_Parse_Action := null;
+ Result (234).RHSs (2).In_Parse_Action := null;
+ Result (234).RHSs (2).Post_Parse_Action := primary_2'Access;
+ Result (234).RHSs (3).In_Parse_Action := null;
+ Result (234).RHSs (3).Post_Parse_Action := null;
+ Result (234).RHSs (4).In_Parse_Action := null;
+ Result (234).RHSs (4).Post_Parse_Action := null;
+ Result (240).RHSs.Set_First_Last (0, 0);
+ Result (240).RHSs (0).In_Parse_Action := null;
+ Result (240).RHSs (0).Post_Parse_Action :=
elsif_expression_item_0'Access;
+ Result (241).RHSs.Set_First_Last (0, 1);
+ Result (241).RHSs (0).In_Parse_Action := null;
+ Result (241).RHSs (0).Post_Parse_Action := null;
+ Result (241).RHSs (1).In_Parse_Action := null;
+ Result (241).RHSs (1).Post_Parse_Action :=
elsif_expression_list_1'Access;
+ Result (242).RHSs.Set_First_Last (0, 3);
+ Result (242).RHSs (0).In_Parse_Action := null;
+ Result (242).RHSs (0).Post_Parse_Action := if_expression_0'Access;
+ Result (242).RHSs (1).In_Parse_Action := null;
+ Result (242).RHSs (1).Post_Parse_Action := if_expression_1'Access;
+ Result (242).RHSs (2).In_Parse_Action := null;
+ Result (242).RHSs (2).Post_Parse_Action := if_expression_2'Access;
+ Result (242).RHSs (3).In_Parse_Action := null;
+ Result (242).RHSs (3).Post_Parse_Action := if_expression_3'Access;
+ Result (244).RHSs.Set_First_Last (0, 1);
+ Result (244).RHSs (0).In_Parse_Action := null;
+ Result (244).RHSs (0).Post_Parse_Action := null;
+ Result (244).RHSs (1).In_Parse_Action := null;
+ Result (244).RHSs (1).Post_Parse_Action :=
case_expression_alternative_list_1'Access;
+ Result (245).RHSs.Set_First_Last (0, 0);
+ Result (245).RHSs (0).In_Parse_Action := null;
+ Result (245).RHSs (0).Post_Parse_Action := case_expression_0'Access;
+ Result (246).RHSs.Set_First_Last (0, 0);
+ Result (246).RHSs (0).In_Parse_Action := null;
+ Result (246).RHSs (0).Post_Parse_Action :=
case_expression_alternative_0'Access;
+ Result (247).RHSs.Set_First_Last (0, 1);
+ Result (247).RHSs (0).In_Parse_Action := null;
+ Result (247).RHSs (0).Post_Parse_Action :=
quantified_expression_0'Access;
+ Result (247).RHSs (1).In_Parse_Action := null;
+ Result (247).RHSs (1).Post_Parse_Action :=
quantified_expression_1'Access;
+ Result (249).RHSs.Set_First_Last (0, 1);
+ Result (249).RHSs (0).In_Parse_Action := null;
+ Result (249).RHSs (0).Post_Parse_Action :=
declare_expression_0'Access;
+ Result (249).RHSs (1).In_Parse_Action := null;
+ Result (249).RHSs (1).Post_Parse_Action :=
declare_expression_1'Access;
+ Result (254).RHSs.Set_First_Last (0, 0);
+ Result (254).RHSs (0).In_Parse_Action := null;
+ Result (254).RHSs (0).Post_Parse_Action :=
reduction_specification_0'Access;
+ Result (255).RHSs.Set_First_Last (0, 0);
+ Result (255).RHSs (0).In_Parse_Action := null;
+ Result (255).RHSs (0).Post_Parse_Action :=
qualified_expression_0'Access;
+ Result (257).RHSs.Set_First_Last (0, 3);
+ Result (257).RHSs (0).In_Parse_Action := null;
+ Result (257).RHSs (0).Post_Parse_Action := null;
+ Result (257).RHSs (1).In_Parse_Action := null;
+ Result (257).RHSs (1).Post_Parse_Action := null;
+ Result (257).RHSs (2).In_Parse_Action := null;
+ Result (257).RHSs (2).Post_Parse_Action :=
subtype_indication_paren_constraint_2'Access;
+ Result (257).RHSs (3).In_Parse_Action := null;
+ Result (257).RHSs (3).Post_Parse_Action :=
subtype_indication_paren_constraint_3'Access;
+ Result (264).RHSs.Set_First_Last (0, 0);
+ Result (264).RHSs (0).In_Parse_Action := null;
+ Result (264).RHSs (0).Post_Parse_Action := null_statement_0'Access;
+ Result (265).RHSs.Set_First_Last (0, 0);
+ Result (265).RHSs (0).In_Parse_Action := null;
+ Result (265).RHSs (0).Post_Parse_Action := label_0'Access;
+ Result (267).RHSs.Set_First_Last (0, 0);
+ Result (267).RHSs (0).In_Parse_Action := null;
+ Result (267).RHSs (0).Post_Parse_Action :=
assignment_statement_0'Access;
+ Result (269).RHSs.Set_First_Last (0, 0);
+ Result (269).RHSs (0).In_Parse_Action := null;
+ Result (269).RHSs (0).Post_Parse_Action :=
elsif_statement_item_0'Access;
+ Result (271).RHSs.Set_First_Last (0, 3);
+ Result (271).RHSs (0).In_Parse_Action := null;
+ Result (271).RHSs (0).Post_Parse_Action := if_statement_0'Access;
+ Result (271).RHSs (1).In_Parse_Action := null;
+ Result (271).RHSs (1).Post_Parse_Action := if_statement_1'Access;
+ Result (271).RHSs (2).In_Parse_Action := null;
+ Result (271).RHSs (2).Post_Parse_Action := if_statement_2'Access;
+ Result (271).RHSs (3).In_Parse_Action := null;
+ Result (271).RHSs (3).Post_Parse_Action := if_statement_3'Access;
+ Result (273).RHSs.Set_First_Last (0, 0);
+ Result (273).RHSs (0).In_Parse_Action := null;
+ Result (273).RHSs (0).Post_Parse_Action := case_statement_0'Access;
+ Result (274).RHSs.Set_First_Last (0, 0);
+ Result (274).RHSs (0).In_Parse_Action := null;
+ Result (274).RHSs (0).Post_Parse_Action :=
case_statement_alternative_0'Access;
+ Result (275).RHSs.Set_First_Last (0, 1);
+ Result (275).RHSs (0).In_Parse_Action :=
loop_statement_0_check'Access;
+ Result (275).RHSs (0).Post_Parse_Action := loop_statement_0'Access;
+ Result (275).RHSs (1).In_Parse_Action :=
loop_statement_1_check'Access;
+ Result (275).RHSs (1).Post_Parse_Action := loop_statement_1'Access;
+ Result (276).RHSs.Set_First_Last (0, 8);
+ Result (276).RHSs (0).In_Parse_Action := null;
+ Result (276).RHSs (0).Post_Parse_Action := iteration_scheme_0'Access;
+ Result (276).RHSs (1).In_Parse_Action := null;
+ Result (276).RHSs (1).Post_Parse_Action := iteration_scheme_1'Access;
+ Result (276).RHSs (2).In_Parse_Action := null;
+ Result (276).RHSs (2).Post_Parse_Action := iteration_scheme_2'Access;
+ Result (276).RHSs (3).In_Parse_Action := null;
+ Result (276).RHSs (3).Post_Parse_Action := iteration_scheme_3'Access;
+ Result (276).RHSs (4).In_Parse_Action := null;
+ Result (276).RHSs (4).Post_Parse_Action := iteration_scheme_4'Access;
+ Result (276).RHSs (5).In_Parse_Action := null;
+ Result (276).RHSs (5).Post_Parse_Action := iteration_scheme_5'Access;
+ Result (276).RHSs (6).In_Parse_Action := null;
+ Result (276).RHSs (6).Post_Parse_Action := iteration_scheme_6'Access;
+ Result (276).RHSs (7).In_Parse_Action := null;
+ Result (276).RHSs (7).Post_Parse_Action := iteration_scheme_7'Access;
+ Result (276).RHSs (8).In_Parse_Action := null;
+ Result (276).RHSs (8).Post_Parse_Action := iteration_scheme_8'Access;
+ Result (277).RHSs.Set_First_Last (0, 1);
+ Result (277).RHSs (0).In_Parse_Action := null;
+ Result (277).RHSs (0).Post_Parse_Action :=
chunk_specification_0'Access;
+ Result (277).RHSs (1).In_Parse_Action := null;
+ Result (277).RHSs (1).Post_Parse_Action :=
chunk_specification_1'Access;
+ Result (285).RHSs.Set_First_Last (0, 1);
+ Result (285).RHSs (0).In_Parse_Action := label_opt_0_check'Access;
+ Result (285).RHSs (0).Post_Parse_Action := null;
+ Result (285).RHSs (1).In_Parse_Action := null;
+ Result (285).RHSs (1).Post_Parse_Action := null;
+ Result (286).RHSs.Set_First_Last (0, 1);
+ Result (286).RHSs (0).In_Parse_Action :=
block_statement_0_check'Access;
+ Result (286).RHSs (0).Post_Parse_Action := block_statement_0'Access;
+ Result (286).RHSs (1).In_Parse_Action :=
block_statement_1_check'Access;
+ Result (286).RHSs (1).Post_Parse_Action := block_statement_1'Access;
+ Result (287).RHSs.Set_First_Last (0, 1);
+ Result (287).RHSs (0).In_Parse_Action := null;
+ Result (287).RHSs (0).Post_Parse_Action := null;
+ Result (287).RHSs (1).In_Parse_Action := null;
+ Result (287).RHSs (1).Post_Parse_Action :=
statement_AND_list_1'Access;
+ Result (288).RHSs.Set_First_Last (0, 0);
+ Result (288).RHSs (0).In_Parse_Action := null;
+ Result (288).RHSs (0).Post_Parse_Action :=
parallel_block_statement_0'Access;
+ Result (289).RHSs.Set_First_Last (0, 3);
+ Result (289).RHSs (0).In_Parse_Action := null;
+ Result (289).RHSs (0).Post_Parse_Action := exit_statement_0'Access;
+ Result (289).RHSs (1).In_Parse_Action := null;
+ Result (289).RHSs (1).Post_Parse_Action := exit_statement_1'Access;
+ Result (289).RHSs (2).In_Parse_Action := null;
+ Result (289).RHSs (2).Post_Parse_Action := exit_statement_2'Access;
+ Result (289).RHSs (3).In_Parse_Action := null;
+ Result (289).RHSs (3).Post_Parse_Action := exit_statement_3'Access;
+ Result (290).RHSs.Set_First_Last (0, 0);
+ Result (290).RHSs (0).In_Parse_Action := null;
+ Result (290).RHSs (0).Post_Parse_Action := goto_statement_0'Access;
+ Result (291).RHSs.Set_First_Last (0, 3);
+ Result (291).RHSs (0).In_Parse_Action := null;
+ Result (291).RHSs (0).Post_Parse_Action :=
subprogram_declaration_0'Access;
+ Result (291).RHSs (1).In_Parse_Action := null;
+ Result (291).RHSs (1).Post_Parse_Action :=
subprogram_declaration_1'Access;
+ Result (291).RHSs (2).In_Parse_Action := null;
+ Result (291).RHSs (2).Post_Parse_Action :=
subprogram_declaration_2'Access;
+ Result (291).RHSs (3).In_Parse_Action := null;
+ Result (291).RHSs (3).Post_Parse_Action :=
subprogram_declaration_3'Access;
+ Result (292).RHSs.Set_First_Last (0, 1);
+ Result (292).RHSs (0).In_Parse_Action :=
subprogram_specification_0_check'Access;
+ Result (292).RHSs (0).Post_Parse_Action := null;
+ Result (292).RHSs (1).In_Parse_Action :=
subprogram_specification_1_check'Access;
+ Result (292).RHSs (1).Post_Parse_Action := null;
+ Result (293).RHSs.Set_First_Last (0, 0);
+ Result (293).RHSs (0).In_Parse_Action :=
procedure_specification_0_check'Access;
+ Result (293).RHSs (0).Post_Parse_Action :=
procedure_specification_0'Access;
+ Result (294).RHSs.Set_First_Last (0, 0);
+ Result (294).RHSs (0).In_Parse_Action :=
function_specification_0_check'Access;
+ Result (294).RHSs (0).Post_Parse_Action :=
function_specification_0'Access;
+ Result (296).RHSs.Set_First_Last (0, 2);
+ Result (296).RHSs (0).In_Parse_Action := null;
+ Result (296).RHSs (0).Post_Parse_Action := result_profile_0'Access;
+ Result (296).RHSs (1).In_Parse_Action := null;
+ Result (296).RHSs (1).Post_Parse_Action := result_profile_1'Access;
+ Result (296).RHSs (2).In_Parse_Action := null;
+ Result (296).RHSs (2).Post_Parse_Action := result_profile_2'Access;
+ Result (297).RHSs.Set_First_Last (0, 1);
+ Result (297).RHSs (0).In_Parse_Action := null;
+ Result (297).RHSs (0).Post_Parse_Action :=
parameter_and_result_profile_0'Access;
+ Result (297).RHSs (1).In_Parse_Action := null;
+ Result (297).RHSs (1).Post_Parse_Action := null;
+ Result (298).Optimized_List := True;
+ Result (299).RHSs.Set_First_Last (0, 0);
+ Result (299).RHSs (0).In_Parse_Action := null;
+ Result (299).RHSs (0).Post_Parse_Action := formal_part_0'Access;
+ Result (300).RHSs.Set_First_Last (0, 9);
+ Result (300).RHSs (0).In_Parse_Action := null;
+ Result (300).RHSs (0).Post_Parse_Action :=
parameter_specification_0'Access;
+ Result (300).RHSs (1).In_Parse_Action := null;
+ Result (300).RHSs (1).Post_Parse_Action :=
parameter_specification_1'Access;
+ Result (300).RHSs (2).In_Parse_Action := null;
+ Result (300).RHSs (2).Post_Parse_Action :=
parameter_specification_2'Access;
+ Result (300).RHSs (3).In_Parse_Action := null;
+ Result (300).RHSs (3).Post_Parse_Action :=
parameter_specification_3'Access;
+ Result (300).RHSs (4).In_Parse_Action := null;
+ Result (300).RHSs (4).Post_Parse_Action :=
parameter_specification_4'Access;
+ Result (300).RHSs (5).In_Parse_Action := null;
+ Result (300).RHSs (5).Post_Parse_Action :=
parameter_specification_5'Access;
+ Result (300).RHSs (6).In_Parse_Action := null;
+ Result (300).RHSs (6).Post_Parse_Action :=
parameter_specification_6'Access;
+ Result (300).RHSs (7).In_Parse_Action := null;
+ Result (300).RHSs (7).Post_Parse_Action :=
parameter_specification_7'Access;
+ Result (300).RHSs (8).In_Parse_Action := null;
+ Result (300).RHSs (8).Post_Parse_Action :=
parameter_specification_8'Access;
+ Result (300).RHSs (9).In_Parse_Action := null;
+ Result (300).RHSs (9).Post_Parse_Action :=
parameter_specification_9'Access;
+ Result (306).Optimized_List := True;
+ Result (308).RHSs.Set_First_Last (0, 1);
+ Result (308).RHSs (0).In_Parse_Action := name_opt_0_check'Access;
+ Result (308).RHSs (0).Post_Parse_Action := null;
+ Result (308).RHSs (1).In_Parse_Action := null;
+ Result (308).RHSs (1).Post_Parse_Action := null;
+ Result (309).RHSs.Set_First_Last (0, 3);
+ Result (309).RHSs (0).In_Parse_Action :=
subprogram_body_0_check'Access;
+ Result (309).RHSs (0).Post_Parse_Action := subprogram_body_0'Access;
+ Result (309).RHSs (1).In_Parse_Action :=
subprogram_body_1_check'Access;
+ Result (309).RHSs (1).Post_Parse_Action := subprogram_body_1'Access;
+ Result (309).RHSs (2).In_Parse_Action :=
subprogram_body_2_check'Access;
+ Result (309).RHSs (2).Post_Parse_Action := subprogram_body_2'Access;
+ Result (309).RHSs (3).In_Parse_Action :=
subprogram_body_3_check'Access;
+ Result (309).RHSs (3).Post_Parse_Action := subprogram_body_3'Access;
+ Result (310).RHSs.Set_First_Last (0, 0);
+ Result (310).RHSs (0).In_Parse_Action := null;
+ Result (310).RHSs (0).Post_Parse_Action :=
procedure_call_statement_0'Access;
+ Result (311).RHSs.Set_First_Last (0, 0);
+ Result (311).RHSs (0).In_Parse_Action := null;
+ Result (311).RHSs (0).Post_Parse_Action := function_call_0'Access;
+ Result (313).RHSs.Set_First_Last (0, 3);
+ Result (313).RHSs (0).In_Parse_Action := null;
+ Result (313).RHSs (0).Post_Parse_Action :=
actual_parameter_part_0'Access;
+ Result (313).RHSs (1).In_Parse_Action := null;
+ Result (313).RHSs (1).Post_Parse_Action :=
actual_parameter_part_1'Access;
+ Result (313).RHSs (2).In_Parse_Action := null;
+ Result (313).RHSs (2).Post_Parse_Action :=
actual_parameter_part_2'Access;
+ Result (313).RHSs (3).In_Parse_Action := null;
+ Result (313).RHSs (3).Post_Parse_Action :=
actual_parameter_part_3'Access;
+ Result (314).RHSs.Set_First_Last (0, 1);
+ Result (314).RHSs (0).In_Parse_Action := null;
+ Result (314).RHSs (0).Post_Parse_Action := assoc_expression_0'Access;
+ Result (314).RHSs (1).In_Parse_Action := null;
+ Result (314).RHSs (1).Post_Parse_Action := null;
+ Result (315).RHSs.Set_First_Last (0, 2);
+ Result (315).RHSs (0).In_Parse_Action := null;
+ Result (315).RHSs (0).Post_Parse_Action :=
parameter_association_0'Access;
+ Result (315).RHSs (1).In_Parse_Action := null;
+ Result (315).RHSs (1).Post_Parse_Action :=
parameter_association_1'Access;
+ Result (315).RHSs (2).In_Parse_Action := null;
+ Result (315).RHSs (2).Post_Parse_Action := null;
+ Result (316).RHSs.Set_First_Last (0, 1);
+ Result (316).RHSs (0).In_Parse_Action := null;
+ Result (316).RHSs (0).Post_Parse_Action :=
simple_return_statement_0'Access;
+ Result (316).RHSs (1).In_Parse_Action := null;
+ Result (316).RHSs (1).Post_Parse_Action :=
simple_return_statement_1'Access;
+ Result (317).RHSs.Set_First_Last (0, 7);
+ Result (317).RHSs (0).In_Parse_Action := null;
+ Result (317).RHSs (0).Post_Parse_Action :=
extended_return_object_declaration_0'Access;
+ Result (317).RHSs (1).In_Parse_Action := null;
+ Result (317).RHSs (1).Post_Parse_Action :=
extended_return_object_declaration_1'Access;
+ Result (317).RHSs (2).In_Parse_Action := null;
+ Result (317).RHSs (2).Post_Parse_Action :=
extended_return_object_declaration_2'Access;
+ Result (317).RHSs (3).In_Parse_Action := null;
+ Result (317).RHSs (3).Post_Parse_Action :=
extended_return_object_declaration_3'Access;
+ Result (317).RHSs (4).In_Parse_Action := null;
+ Result (317).RHSs (4).Post_Parse_Action :=
extended_return_object_declaration_4'Access;
+ Result (317).RHSs (5).In_Parse_Action := null;
+ Result (317).RHSs (5).Post_Parse_Action :=
extended_return_object_declaration_5'Access;
+ Result (317).RHSs (6).In_Parse_Action := null;
+ Result (317).RHSs (6).Post_Parse_Action :=
extended_return_object_declaration_6'Access;
+ Result (317).RHSs (7).In_Parse_Action := null;
+ Result (317).RHSs (7).Post_Parse_Action :=
extended_return_object_declaration_7'Access;
+ Result (318).RHSs.Set_First_Last (0, 1);
+ Result (318).RHSs (0).In_Parse_Action := null;
+ Result (318).RHSs (0).Post_Parse_Action :=
extended_return_statement_0'Access;
+ Result (318).RHSs (1).In_Parse_Action := null;
+ Result (318).RHSs (1).Post_Parse_Action :=
extended_return_statement_1'Access;
+ Result (320).RHSs.Set_First_Last (0, 3);
+ Result (320).RHSs (0).In_Parse_Action := null;
+ Result (320).RHSs (0).Post_Parse_Action :=
null_procedure_declaration_0'Access;
+ Result (320).RHSs (1).In_Parse_Action := null;
+ Result (320).RHSs (1).Post_Parse_Action :=
null_procedure_declaration_1'Access;
+ Result (320).RHSs (2).In_Parse_Action := null;
+ Result (320).RHSs (2).Post_Parse_Action :=
null_procedure_declaration_2'Access;
+ Result (320).RHSs (3).In_Parse_Action := null;
+ Result (320).RHSs (3).Post_Parse_Action :=
null_procedure_declaration_3'Access;
+ Result (321).RHSs.Set_First_Last (0, 3);
+ Result (321).RHSs (0).In_Parse_Action := null;
+ Result (321).RHSs (0).Post_Parse_Action :=
expression_function_declaration_0'Access;
+ Result (321).RHSs (1).In_Parse_Action := null;
+ Result (321).RHSs (1).Post_Parse_Action :=
expression_function_declaration_1'Access;
+ Result (321).RHSs (2).In_Parse_Action := null;
+ Result (321).RHSs (2).Post_Parse_Action :=
expression_function_declaration_2'Access;
+ Result (321).RHSs (3).In_Parse_Action := null;
+ Result (321).RHSs (3).Post_Parse_Action :=
expression_function_declaration_3'Access;
+ Result (322).RHSs.Set_First_Last (0, 0);
+ Result (322).RHSs (0).In_Parse_Action := null;
+ Result (322).RHSs (0).Post_Parse_Action :=
package_declaration_0'Access;
+ Result (324).Optimized_List := True;
+ Result (325).RHSs.Set_First_Last (0, 11);
+ Result (325).RHSs (0).In_Parse_Action :=
package_specification_0_check'Access;
+ Result (325).RHSs (0).Post_Parse_Action :=
package_specification_0'Access;
+ Result (325).RHSs (1).In_Parse_Action :=
package_specification_1_check'Access;
+ Result (325).RHSs (1).Post_Parse_Action :=
package_specification_1'Access;
+ Result (325).RHSs (2).In_Parse_Action :=
package_specification_2_check'Access;
+ Result (325).RHSs (2).Post_Parse_Action :=
package_specification_2'Access;
+ Result (325).RHSs (3).In_Parse_Action :=
package_specification_3_check'Access;
+ Result (325).RHSs (3).Post_Parse_Action :=
package_specification_3'Access;
+ Result (325).RHSs (4).In_Parse_Action :=
package_specification_4_check'Access;
+ Result (325).RHSs (4).Post_Parse_Action :=
package_specification_4'Access;
+ Result (325).RHSs (5).In_Parse_Action :=
package_specification_5_check'Access;
+ Result (325).RHSs (5).Post_Parse_Action :=
package_specification_5'Access;
+ Result (325).RHSs (6).In_Parse_Action :=
package_specification_6_check'Access;
+ Result (325).RHSs (6).Post_Parse_Action :=
package_specification_6'Access;
+ Result (325).RHSs (7).In_Parse_Action :=
package_specification_7_check'Access;
+ Result (325).RHSs (7).Post_Parse_Action :=
package_specification_7'Access;
+ Result (325).RHSs (8).In_Parse_Action :=
package_specification_8_check'Access;
+ Result (325).RHSs (8).Post_Parse_Action :=
package_specification_8'Access;
+ Result (325).RHSs (9).In_Parse_Action :=
package_specification_9_check'Access;
+ Result (325).RHSs (9).Post_Parse_Action :=
package_specification_9'Access;
+ Result (325).RHSs (10).In_Parse_Action :=
package_specification_10_check'Access;
+ Result (325).RHSs (10).Post_Parse_Action :=
package_specification_10'Access;
+ Result (325).RHSs (11).In_Parse_Action :=
package_specification_11_check'Access;
+ Result (325).RHSs (11).Post_Parse_Action :=
package_specification_11'Access;
+ Result (326).RHSs.Set_First_Last (0, 3);
+ Result (326).RHSs (0).In_Parse_Action := package_body_0_check'Access;
+ Result (326).RHSs (0).Post_Parse_Action := package_body_0'Access;
+ Result (326).RHSs (1).In_Parse_Action := package_body_1_check'Access;
+ Result (326).RHSs (1).Post_Parse_Action := package_body_1'Access;
+ Result (326).RHSs (2).In_Parse_Action := package_body_2_check'Access;
+ Result (326).RHSs (2).Post_Parse_Action := package_body_2'Access;
+ Result (326).RHSs (3).In_Parse_Action := package_body_3_check'Access;
+ Result (326).RHSs (3).Post_Parse_Action := package_body_3'Access;
+ Result (327).RHSs.Set_First_Last (0, 23);
+ Result (327).RHSs (0).In_Parse_Action := null;
+ Result (327).RHSs (0).Post_Parse_Action :=
private_type_declaration_0'Access;
+ Result (327).RHSs (1).In_Parse_Action := null;
+ Result (327).RHSs (1).Post_Parse_Action :=
private_type_declaration_1'Access;
+ Result (327).RHSs (2).In_Parse_Action := null;
+ Result (327).RHSs (2).Post_Parse_Action :=
private_type_declaration_2'Access;
+ Result (327).RHSs (3).In_Parse_Action := null;
+ Result (327).RHSs (3).Post_Parse_Action :=
private_type_declaration_3'Access;
+ Result (327).RHSs (4).In_Parse_Action := null;
+ Result (327).RHSs (4).Post_Parse_Action :=
private_type_declaration_4'Access;
+ Result (327).RHSs (5).In_Parse_Action := null;
+ Result (327).RHSs (5).Post_Parse_Action :=
private_type_declaration_5'Access;
+ Result (327).RHSs (6).In_Parse_Action := null;
+ Result (327).RHSs (6).Post_Parse_Action :=
private_type_declaration_6'Access;
+ Result (327).RHSs (7).In_Parse_Action := null;
+ Result (327).RHSs (7).Post_Parse_Action :=
private_type_declaration_7'Access;
+ Result (327).RHSs (8).In_Parse_Action := null;
+ Result (327).RHSs (8).Post_Parse_Action :=
private_type_declaration_8'Access;
+ Result (327).RHSs (9).In_Parse_Action := null;
+ Result (327).RHSs (9).Post_Parse_Action :=
private_type_declaration_9'Access;
+ Result (327).RHSs (10).In_Parse_Action := null;
+ Result (327).RHSs (10).Post_Parse_Action :=
private_type_declaration_10'Access;
+ Result (327).RHSs (11).In_Parse_Action := null;
+ Result (327).RHSs (11).Post_Parse_Action :=
private_type_declaration_11'Access;
+ Result (327).RHSs (12).In_Parse_Action := null;
+ Result (327).RHSs (12).Post_Parse_Action :=
private_type_declaration_12'Access;
+ Result (327).RHSs (13).In_Parse_Action := null;
+ Result (327).RHSs (13).Post_Parse_Action :=
private_type_declaration_13'Access;
+ Result (327).RHSs (14).In_Parse_Action := null;
+ Result (327).RHSs (14).Post_Parse_Action :=
private_type_declaration_14'Access;
+ Result (327).RHSs (15).In_Parse_Action := null;
+ Result (327).RHSs (15).Post_Parse_Action :=
private_type_declaration_15'Access;
+ Result (327).RHSs (16).In_Parse_Action := null;
+ Result (327).RHSs (16).Post_Parse_Action :=
private_type_declaration_16'Access;
+ Result (327).RHSs (17).In_Parse_Action := null;
+ Result (327).RHSs (17).Post_Parse_Action :=
private_type_declaration_17'Access;
+ Result (327).RHSs (18).In_Parse_Action := null;
+ Result (327).RHSs (18).Post_Parse_Action :=
private_type_declaration_18'Access;
+ Result (327).RHSs (19).In_Parse_Action := null;
+ Result (327).RHSs (19).Post_Parse_Action :=
private_type_declaration_19'Access;
+ Result (327).RHSs (20).In_Parse_Action := null;
+ Result (327).RHSs (20).Post_Parse_Action :=
private_type_declaration_20'Access;
+ Result (327).RHSs (21).In_Parse_Action := null;
+ Result (327).RHSs (21).Post_Parse_Action :=
private_type_declaration_21'Access;
+ Result (327).RHSs (22).In_Parse_Action := null;
+ Result (327).RHSs (22).Post_Parse_Action :=
private_type_declaration_22'Access;
+ Result (327).RHSs (23).In_Parse_Action := null;
+ Result (327).RHSs (23).Post_Parse_Action :=
private_type_declaration_23'Access;
+ Result (328).RHSs.Set_First_Last (0, 47);
+ Result (328).RHSs (0).In_Parse_Action := null;
+ Result (328).RHSs (0).Post_Parse_Action :=
private_extension_declaration_0'Access;
+ Result (328).RHSs (1).In_Parse_Action := null;
+ Result (328).RHSs (1).Post_Parse_Action :=
private_extension_declaration_1'Access;
+ Result (328).RHSs (2).In_Parse_Action := null;
+ Result (328).RHSs (2).Post_Parse_Action :=
private_extension_declaration_2'Access;
+ Result (328).RHSs (3).In_Parse_Action := null;
+ Result (328).RHSs (3).Post_Parse_Action :=
private_extension_declaration_3'Access;
+ Result (328).RHSs (4).In_Parse_Action := null;
+ Result (328).RHSs (4).Post_Parse_Action :=
private_extension_declaration_4'Access;
+ Result (328).RHSs (5).In_Parse_Action := null;
+ Result (328).RHSs (5).Post_Parse_Action :=
private_extension_declaration_5'Access;
+ Result (328).RHSs (6).In_Parse_Action := null;
+ Result (328).RHSs (6).Post_Parse_Action :=
private_extension_declaration_6'Access;
+ Result (328).RHSs (7).In_Parse_Action := null;
+ Result (328).RHSs (7).Post_Parse_Action :=
private_extension_declaration_7'Access;
+ Result (328).RHSs (8).In_Parse_Action := null;
+ Result (328).RHSs (8).Post_Parse_Action :=
private_extension_declaration_8'Access;
+ Result (328).RHSs (9).In_Parse_Action := null;
+ Result (328).RHSs (9).Post_Parse_Action :=
private_extension_declaration_9'Access;
+ Result (328).RHSs (10).In_Parse_Action := null;
+ Result (328).RHSs (10).Post_Parse_Action :=
private_extension_declaration_10'Access;
+ Result (328).RHSs (11).In_Parse_Action := null;
+ Result (328).RHSs (11).Post_Parse_Action :=
private_extension_declaration_11'Access;
+ Result (328).RHSs (12).In_Parse_Action := null;
+ Result (328).RHSs (12).Post_Parse_Action :=
private_extension_declaration_12'Access;
+ Result (328).RHSs (13).In_Parse_Action := null;
+ Result (328).RHSs (13).Post_Parse_Action :=
private_extension_declaration_13'Access;
+ Result (328).RHSs (14).In_Parse_Action := null;
+ Result (328).RHSs (14).Post_Parse_Action :=
private_extension_declaration_14'Access;
+ Result (328).RHSs (15).In_Parse_Action := null;
+ Result (328).RHSs (15).Post_Parse_Action :=
private_extension_declaration_15'Access;
+ Result (328).RHSs (16).In_Parse_Action := null;
+ Result (328).RHSs (16).Post_Parse_Action :=
private_extension_declaration_16'Access;
+ Result (328).RHSs (17).In_Parse_Action := null;
+ Result (328).RHSs (17).Post_Parse_Action :=
private_extension_declaration_17'Access;
+ Result (328).RHSs (18).In_Parse_Action := null;
+ Result (328).RHSs (18).Post_Parse_Action :=
private_extension_declaration_18'Access;
+ Result (328).RHSs (19).In_Parse_Action := null;
+ Result (328).RHSs (19).Post_Parse_Action :=
private_extension_declaration_19'Access;
+ Result (328).RHSs (20).In_Parse_Action := null;
+ Result (328).RHSs (20).Post_Parse_Action :=
private_extension_declaration_20'Access;
+ Result (328).RHSs (21).In_Parse_Action := null;
+ Result (328).RHSs (21).Post_Parse_Action :=
private_extension_declaration_21'Access;
+ Result (328).RHSs (22).In_Parse_Action := null;
+ Result (328).RHSs (22).Post_Parse_Action :=
private_extension_declaration_22'Access;
+ Result (328).RHSs (23).In_Parse_Action := null;
+ Result (328).RHSs (23).Post_Parse_Action :=
private_extension_declaration_23'Access;
+ Result (328).RHSs (24).In_Parse_Action := null;
+ Result (328).RHSs (24).Post_Parse_Action :=
private_extension_declaration_24'Access;
+ Result (328).RHSs (25).In_Parse_Action := null;
+ Result (328).RHSs (25).Post_Parse_Action :=
private_extension_declaration_25'Access;
+ Result (328).RHSs (26).In_Parse_Action := null;
+ Result (328).RHSs (26).Post_Parse_Action :=
private_extension_declaration_26'Access;
+ Result (328).RHSs (27).In_Parse_Action := null;
+ Result (328).RHSs (27).Post_Parse_Action :=
private_extension_declaration_27'Access;
+ Result (328).RHSs (28).In_Parse_Action := null;
+ Result (328).RHSs (28).Post_Parse_Action :=
private_extension_declaration_28'Access;
+ Result (328).RHSs (29).In_Parse_Action := null;
+ Result (328).RHSs (29).Post_Parse_Action :=
private_extension_declaration_29'Access;
+ Result (328).RHSs (30).In_Parse_Action := null;
+ Result (328).RHSs (30).Post_Parse_Action :=
private_extension_declaration_30'Access;
+ Result (328).RHSs (31).In_Parse_Action := null;
+ Result (328).RHSs (31).Post_Parse_Action :=
private_extension_declaration_31'Access;
+ Result (328).RHSs (32).In_Parse_Action := null;
+ Result (328).RHSs (32).Post_Parse_Action :=
private_extension_declaration_32'Access;
+ Result (328).RHSs (33).In_Parse_Action := null;
+ Result (328).RHSs (33).Post_Parse_Action :=
private_extension_declaration_33'Access;
+ Result (328).RHSs (34).In_Parse_Action := null;
+ Result (328).RHSs (34).Post_Parse_Action :=
private_extension_declaration_34'Access;
+ Result (328).RHSs (35).In_Parse_Action := null;
+ Result (328).RHSs (35).Post_Parse_Action :=
private_extension_declaration_35'Access;
+ Result (328).RHSs (36).In_Parse_Action := null;
+ Result (328).RHSs (36).Post_Parse_Action :=
private_extension_declaration_36'Access;
+ Result (328).RHSs (37).In_Parse_Action := null;
+ Result (328).RHSs (37).Post_Parse_Action :=
private_extension_declaration_37'Access;
+ Result (328).RHSs (38).In_Parse_Action := null;
+ Result (328).RHSs (38).Post_Parse_Action :=
private_extension_declaration_38'Access;
+ Result (328).RHSs (39).In_Parse_Action := null;
+ Result (328).RHSs (39).Post_Parse_Action :=
private_extension_declaration_39'Access;
+ Result (328).RHSs (40).In_Parse_Action := null;
+ Result (328).RHSs (40).Post_Parse_Action :=
private_extension_declaration_40'Access;
+ Result (328).RHSs (41).In_Parse_Action := null;
+ Result (328).RHSs (41).Post_Parse_Action :=
private_extension_declaration_41'Access;
+ Result (328).RHSs (42).In_Parse_Action := null;
+ Result (328).RHSs (42).Post_Parse_Action :=
private_extension_declaration_42'Access;
+ Result (328).RHSs (43).In_Parse_Action := null;
+ Result (328).RHSs (43).Post_Parse_Action :=
private_extension_declaration_43'Access;
+ Result (328).RHSs (44).In_Parse_Action := null;
+ Result (328).RHSs (44).Post_Parse_Action :=
private_extension_declaration_44'Access;
+ Result (328).RHSs (45).In_Parse_Action := null;
+ Result (328).RHSs (45).Post_Parse_Action :=
private_extension_declaration_45'Access;
+ Result (328).RHSs (46).In_Parse_Action := null;
+ Result (328).RHSs (46).Post_Parse_Action :=
private_extension_declaration_46'Access;
+ Result (328).RHSs (47).In_Parse_Action := null;
+ Result (328).RHSs (47).Post_Parse_Action :=
private_extension_declaration_47'Access;
+ Result (329).RHSs.Set_First_Last (0, 1);
+ Result (329).RHSs (0).In_Parse_Action := null;
+ Result (329).RHSs (0).Post_Parse_Action :=
overriding_indicator_0'Access;
+ Result (329).RHSs (1).In_Parse_Action := null;
+ Result (329).RHSs (1).Post_Parse_Action :=
overriding_indicator_1'Access;
+ Result (332).RHSs.Set_First_Last (0, 0);
+ Result (332).RHSs (0).In_Parse_Action := null;
+ Result (332).RHSs (0).Post_Parse_Action :=
use_package_clause_0'Access;
+ Result (333).RHSs.Set_First_Last (0, 1);
+ Result (333).RHSs (0).In_Parse_Action := null;
+ Result (333).RHSs (0).Post_Parse_Action := use_type_clause_0'Access;
+ Result (333).RHSs (1).In_Parse_Action := null;
+ Result (333).RHSs (1).Post_Parse_Action := use_type_clause_1'Access;
+ Result (335).RHSs.Set_First_Last (0, 7);
+ Result (335).RHSs (0).In_Parse_Action := null;
+ Result (335).RHSs (0).Post_Parse_Action :=
object_renaming_declaration_0'Access;
+ Result (335).RHSs (1).In_Parse_Action := null;
+ Result (335).RHSs (1).Post_Parse_Action :=
object_renaming_declaration_1'Access;
+ Result (335).RHSs (2).In_Parse_Action := null;
+ Result (335).RHSs (2).Post_Parse_Action :=
object_renaming_declaration_2'Access;
+ Result (335).RHSs (3).In_Parse_Action := null;
+ Result (335).RHSs (3).Post_Parse_Action :=
object_renaming_declaration_3'Access;
+ Result (335).RHSs (4).In_Parse_Action := null;
+ Result (335).RHSs (4).Post_Parse_Action :=
object_renaming_declaration_4'Access;
+ Result (335).RHSs (5).In_Parse_Action := null;
+ Result (335).RHSs (5).Post_Parse_Action :=
object_renaming_declaration_5'Access;
+ Result (335).RHSs (6).In_Parse_Action := null;
+ Result (335).RHSs (6).Post_Parse_Action :=
object_renaming_declaration_6'Access;
+ Result (335).RHSs (7).In_Parse_Action := null;
+ Result (335).RHSs (7).Post_Parse_Action :=
object_renaming_declaration_7'Access;
+ Result (336).RHSs.Set_First_Last (0, 1);
+ Result (336).RHSs (0).In_Parse_Action := null;
+ Result (336).RHSs (0).Post_Parse_Action :=
exception_renaming_declaration_0'Access;
+ Result (336).RHSs (1).In_Parse_Action := null;
+ Result (336).RHSs (1).Post_Parse_Action :=
exception_renaming_declaration_1'Access;
+ Result (337).RHSs.Set_First_Last (0, 1);
+ Result (337).RHSs (0).In_Parse_Action := null;
+ Result (337).RHSs (0).Post_Parse_Action :=
package_renaming_declaration_0'Access;
+ Result (337).RHSs (1).In_Parse_Action := null;
+ Result (337).RHSs (1).Post_Parse_Action :=
package_renaming_declaration_1'Access;
+ Result (338).RHSs.Set_First_Last (0, 3);
+ Result (338).RHSs (0).In_Parse_Action := null;
+ Result (338).RHSs (0).Post_Parse_Action :=
subprogram_renaming_declaration_0'Access;
+ Result (338).RHSs (1).In_Parse_Action := null;
+ Result (338).RHSs (1).Post_Parse_Action :=
subprogram_renaming_declaration_1'Access;
+ Result (338).RHSs (2).In_Parse_Action := null;
+ Result (338).RHSs (2).Post_Parse_Action :=
subprogram_renaming_declaration_2'Access;
+ Result (338).RHSs (3).In_Parse_Action := null;
+ Result (338).RHSs (3).Post_Parse_Action :=
subprogram_renaming_declaration_3'Access;
+ Result (339).RHSs.Set_First_Last (0, 5);
+ Result (339).RHSs (0).In_Parse_Action := null;
+ Result (339).RHSs (0).Post_Parse_Action :=
generic_renaming_declaration_0'Access;
+ Result (339).RHSs (1).In_Parse_Action := null;
+ Result (339).RHSs (1).Post_Parse_Action :=
generic_renaming_declaration_1'Access;
+ Result (339).RHSs (2).In_Parse_Action := null;
+ Result (339).RHSs (2).Post_Parse_Action :=
generic_renaming_declaration_2'Access;
+ Result (339).RHSs (3).In_Parse_Action := null;
+ Result (339).RHSs (3).Post_Parse_Action :=
generic_renaming_declaration_3'Access;
+ Result (339).RHSs (4).In_Parse_Action := null;
+ Result (339).RHSs (4).Post_Parse_Action :=
generic_renaming_declaration_4'Access;
+ Result (339).RHSs (5).In_Parse_Action := null;
+ Result (339).RHSs (5).Post_Parse_Action :=
generic_renaming_declaration_5'Access;
+ Result (340).RHSs.Set_First_Last (0, 11);
+ Result (340).RHSs (0).In_Parse_Action :=
task_type_declaration_0_check'Access;
+ Result (340).RHSs (0).Post_Parse_Action :=
task_type_declaration_0'Access;
+ Result (340).RHSs (1).In_Parse_Action :=
task_type_declaration_1_check'Access;
+ Result (340).RHSs (1).Post_Parse_Action :=
task_type_declaration_1'Access;
+ Result (340).RHSs (2).In_Parse_Action := null;
+ Result (340).RHSs (2).Post_Parse_Action :=
task_type_declaration_2'Access;
+ Result (340).RHSs (3).In_Parse_Action :=
task_type_declaration_3_check'Access;
+ Result (340).RHSs (3).Post_Parse_Action :=
task_type_declaration_3'Access;
+ Result (340).RHSs (4).In_Parse_Action :=
task_type_declaration_4_check'Access;
+ Result (340).RHSs (4).Post_Parse_Action :=
task_type_declaration_4'Access;
+ Result (340).RHSs (5).In_Parse_Action := null;
+ Result (340).RHSs (5).Post_Parse_Action :=
task_type_declaration_5'Access;
+ Result (340).RHSs (6).In_Parse_Action :=
task_type_declaration_6_check'Access;
+ Result (340).RHSs (6).Post_Parse_Action :=
task_type_declaration_6'Access;
+ Result (340).RHSs (7).In_Parse_Action :=
task_type_declaration_7_check'Access;
+ Result (340).RHSs (7).Post_Parse_Action :=
task_type_declaration_7'Access;
+ Result (340).RHSs (8).In_Parse_Action := null;
+ Result (340).RHSs (8).Post_Parse_Action :=
task_type_declaration_8'Access;
+ Result (340).RHSs (9).In_Parse_Action :=
task_type_declaration_9_check'Access;
+ Result (340).RHSs (9).Post_Parse_Action :=
task_type_declaration_9'Access;
+ Result (340).RHSs (10).In_Parse_Action :=
task_type_declaration_10_check'Access;
+ Result (340).RHSs (10).Post_Parse_Action :=
task_type_declaration_10'Access;
+ Result (340).RHSs (11).In_Parse_Action := null;
+ Result (340).RHSs (11).Post_Parse_Action :=
task_type_declaration_11'Access;
+ Result (341).RHSs.Set_First_Last (0, 5);
+ Result (341).RHSs (0).In_Parse_Action :=
single_task_declaration_0_check'Access;
+ Result (341).RHSs (0).Post_Parse_Action :=
single_task_declaration_0'Access;
+ Result (341).RHSs (1).In_Parse_Action :=
single_task_declaration_1_check'Access;
+ Result (341).RHSs (1).Post_Parse_Action :=
single_task_declaration_1'Access;
+ Result (341).RHSs (2).In_Parse_Action := null;
+ Result (341).RHSs (2).Post_Parse_Action :=
single_task_declaration_2'Access;
+ Result (341).RHSs (3).In_Parse_Action :=
single_task_declaration_3_check'Access;
+ Result (341).RHSs (3).Post_Parse_Action :=
single_task_declaration_3'Access;
+ Result (341).RHSs (4).In_Parse_Action :=
single_task_declaration_4_check'Access;
+ Result (341).RHSs (4).Post_Parse_Action :=
single_task_declaration_4'Access;
+ Result (341).RHSs (5).In_Parse_Action := null;
+ Result (341).RHSs (5).Post_Parse_Action :=
single_task_declaration_5'Access;
+ Result (343).RHSs.Set_First_Last (0, 1);
+ Result (343).RHSs (0).In_Parse_Action :=
task_definition_0_check'Access;
+ Result (343).RHSs (0).Post_Parse_Action := task_definition_0'Access;
+ Result (343).RHSs (1).In_Parse_Action :=
task_definition_1_check'Access;
+ Result (343).RHSs (1).Post_Parse_Action := task_definition_1'Access;
+ Result (345).RHSs.Set_First_Last (0, 1);
+ Result (345).RHSs (0).In_Parse_Action := task_body_0_check'Access;
+ Result (345).RHSs (0).Post_Parse_Action := task_body_0'Access;
+ Result (345).RHSs (1).In_Parse_Action := task_body_1_check'Access;
+ Result (345).RHSs (1).Post_Parse_Action := task_body_1'Access;
+ Result (346).RHSs.Set_First_Last (0, 7);
+ Result (346).RHSs (0).In_Parse_Action :=
protected_type_declaration_0_check'Access;
+ Result (346).RHSs (0).Post_Parse_Action :=
protected_type_declaration_0'Access;
+ Result (346).RHSs (1).In_Parse_Action :=
protected_type_declaration_1_check'Access;
+ Result (346).RHSs (1).Post_Parse_Action :=
protected_type_declaration_1'Access;
+ Result (346).RHSs (2).In_Parse_Action :=
protected_type_declaration_2_check'Access;
+ Result (346).RHSs (2).Post_Parse_Action :=
protected_type_declaration_2'Access;
+ Result (346).RHSs (3).In_Parse_Action :=
protected_type_declaration_3_check'Access;
+ Result (346).RHSs (3).Post_Parse_Action :=
protected_type_declaration_3'Access;
+ Result (346).RHSs (4).In_Parse_Action :=
protected_type_declaration_4_check'Access;
+ Result (346).RHSs (4).Post_Parse_Action :=
protected_type_declaration_4'Access;
+ Result (346).RHSs (5).In_Parse_Action :=
protected_type_declaration_5_check'Access;
+ Result (346).RHSs (5).Post_Parse_Action :=
protected_type_declaration_5'Access;
+ Result (346).RHSs (6).In_Parse_Action :=
protected_type_declaration_6_check'Access;
+ Result (346).RHSs (6).Post_Parse_Action :=
protected_type_declaration_6'Access;
+ Result (346).RHSs (7).In_Parse_Action :=
protected_type_declaration_7_check'Access;
+ Result (346).RHSs (7).Post_Parse_Action :=
protected_type_declaration_7'Access;
+ Result (347).RHSs.Set_First_Last (0, 3);
+ Result (347).RHSs (0).In_Parse_Action :=
single_protected_declaration_0_check'Access;
+ Result (347).RHSs (0).Post_Parse_Action :=
single_protected_declaration_0'Access;
+ Result (347).RHSs (1).In_Parse_Action :=
single_protected_declaration_1_check'Access;
+ Result (347).RHSs (1).Post_Parse_Action :=
single_protected_declaration_1'Access;
+ Result (347).RHSs (2).In_Parse_Action :=
single_protected_declaration_2_check'Access;
+ Result (347).RHSs (2).Post_Parse_Action :=
single_protected_declaration_2'Access;
+ Result (347).RHSs (3).In_Parse_Action :=
single_protected_declaration_3_check'Access;
+ Result (347).RHSs (3).Post_Parse_Action :=
single_protected_declaration_3'Access;
+ Result (350).RHSs.Set_First_Last (0, 11);
+ Result (350).RHSs (0).In_Parse_Action :=
protected_definition_0_check'Access;
+ Result (350).RHSs (0).Post_Parse_Action :=
protected_definition_0'Access;
+ Result (350).RHSs (1).In_Parse_Action := null;
+ Result (350).RHSs (1).Post_Parse_Action :=
protected_definition_1'Access;
+ Result (350).RHSs (2).In_Parse_Action :=
protected_definition_2_check'Access;
+ Result (350).RHSs (2).Post_Parse_Action :=
protected_definition_2'Access;
+ Result (350).RHSs (3).In_Parse_Action := null;
+ Result (350).RHSs (3).Post_Parse_Action :=
protected_definition_3'Access;
+ Result (350).RHSs (4).In_Parse_Action :=
protected_definition_4_check'Access;
+ Result (350).RHSs (4).Post_Parse_Action :=
protected_definition_4'Access;
+ Result (350).RHSs (5).In_Parse_Action := null;
+ Result (350).RHSs (5).Post_Parse_Action :=
protected_definition_5'Access;
+ Result (350).RHSs (6).In_Parse_Action :=
protected_definition_6_check'Access;
+ Result (350).RHSs (6).Post_Parse_Action :=
protected_definition_6'Access;
+ Result (350).RHSs (7).In_Parse_Action := null;
+ Result (350).RHSs (7).Post_Parse_Action :=
protected_definition_7'Access;
+ Result (350).RHSs (8).In_Parse_Action :=
protected_definition_8_check'Access;
+ Result (350).RHSs (8).Post_Parse_Action :=
protected_definition_8'Access;
+ Result (350).RHSs (9).In_Parse_Action := null;
+ Result (350).RHSs (9).Post_Parse_Action :=
protected_definition_9'Access;
+ Result (350).RHSs (10).In_Parse_Action :=
protected_definition_10_check'Access;
+ Result (350).RHSs (10).Post_Parse_Action :=
protected_definition_10'Access;
+ Result (350).RHSs (11).In_Parse_Action := null;
+ Result (350).RHSs (11).Post_Parse_Action :=
protected_definition_11'Access;
+ Result (354).RHSs.Set_First_Last (0, 3);
+ Result (354).RHSs (0).In_Parse_Action :=
protected_body_0_check'Access;
+ Result (354).RHSs (0).Post_Parse_Action := protected_body_0'Access;
+ Result (354).RHSs (1).In_Parse_Action :=
protected_body_1_check'Access;
+ Result (354).RHSs (1).Post_Parse_Action := protected_body_1'Access;
+ Result (354).RHSs (2).In_Parse_Action :=
protected_body_2_check'Access;
+ Result (354).RHSs (2).Post_Parse_Action := protected_body_2'Access;
+ Result (354).RHSs (3).In_Parse_Action :=
protected_body_3_check'Access;
+ Result (354).RHSs (3).Post_Parse_Action := protected_body_3'Access;
+ Result (356).RHSs.Set_First_Last (0, 7);
+ Result (356).RHSs (0).In_Parse_Action := null;
+ Result (356).RHSs (0).Post_Parse_Action := entry_declaration_0'Access;
+ Result (356).RHSs (1).In_Parse_Action := null;
+ Result (356).RHSs (1).Post_Parse_Action := entry_declaration_1'Access;
+ Result (356).RHSs (2).In_Parse_Action := null;
+ Result (356).RHSs (2).Post_Parse_Action := entry_declaration_2'Access;
+ Result (356).RHSs (3).In_Parse_Action := null;
+ Result (356).RHSs (3).Post_Parse_Action := entry_declaration_3'Access;
+ Result (356).RHSs (4).In_Parse_Action := null;
+ Result (356).RHSs (4).Post_Parse_Action := entry_declaration_4'Access;
+ Result (356).RHSs (5).In_Parse_Action := null;
+ Result (356).RHSs (5).Post_Parse_Action := entry_declaration_5'Access;
+ Result (356).RHSs (6).In_Parse_Action := null;
+ Result (356).RHSs (6).Post_Parse_Action := entry_declaration_6'Access;
+ Result (356).RHSs (7).In_Parse_Action := null;
+ Result (356).RHSs (7).Post_Parse_Action := entry_declaration_7'Access;
+ Result (357).RHSs.Set_First_Last (0, 3);
+ Result (357).RHSs (0).In_Parse_Action :=
accept_statement_0_check'Access;
+ Result (357).RHSs (0).Post_Parse_Action := accept_statement_0'Access;
+ Result (357).RHSs (1).In_Parse_Action := null;
+ Result (357).RHSs (1).Post_Parse_Action := accept_statement_1'Access;
+ Result (357).RHSs (2).In_Parse_Action :=
accept_statement_2_check'Access;
+ Result (357).RHSs (2).Post_Parse_Action := accept_statement_2'Access;
+ Result (357).RHSs (3).In_Parse_Action := null;
+ Result (357).RHSs (3).Post_Parse_Action := accept_statement_3'Access;
+ Result (359).RHSs.Set_First_Last (0, 1);
+ Result (359).RHSs (0).In_Parse_Action := entry_body_0_check'Access;
+ Result (359).RHSs (0).Post_Parse_Action := entry_body_0'Access;
+ Result (359).RHSs (1).In_Parse_Action := entry_body_1_check'Access;
+ Result (359).RHSs (1).Post_Parse_Action := entry_body_1'Access;
+ Result (360).RHSs.Set_First_Last (0, 1);
+ Result (360).RHSs (0).In_Parse_Action := null;
+ Result (360).RHSs (0).Post_Parse_Action :=
entry_body_formal_part_0'Access;
+ Result (360).RHSs (1).In_Parse_Action := null;
+ Result (360).RHSs (1).Post_Parse_Action :=
entry_body_formal_part_1'Access;
+ Result (361).RHSs.Set_First_Last (0, 0);
+ Result (361).RHSs (0).In_Parse_Action := null;
+ Result (361).RHSs (0).Post_Parse_Action := entry_barrier_0'Access;
+ Result (363).RHSs.Set_First_Last (0, 1);
+ Result (363).RHSs (0).In_Parse_Action := null;
+ Result (363).RHSs (0).Post_Parse_Action := requeue_statement_0'Access;
+ Result (363).RHSs (1).In_Parse_Action := null;
+ Result (363).RHSs (1).Post_Parse_Action := requeue_statement_1'Access;
+ Result (365).RHSs.Set_First_Last (0, 0);
+ Result (365).RHSs (0).In_Parse_Action := null;
+ Result (365).RHSs (0).Post_Parse_Action :=
delay_until_statement_0'Access;
+ Result (366).RHSs.Set_First_Last (0, 0);
+ Result (366).RHSs (0).In_Parse_Action := null;
+ Result (366).RHSs (0).Post_Parse_Action :=
delay_relative_statement_0'Access;
+ Result (368).RHSs.Set_First_Last (0, 1);
+ Result (368).RHSs (0).In_Parse_Action := null;
+ Result (368).RHSs (0).Post_Parse_Action := guard_select_0'Access;
+ Result (368).RHSs (1).In_Parse_Action := null;
+ Result (368).RHSs (1).Post_Parse_Action := null;
+ Result (369).RHSs.Set_First_Last (0, 1);
+ Result (369).RHSs (0).In_Parse_Action := null;
+ Result (369).RHSs (0).Post_Parse_Action := null;
+ Result (369).RHSs (1).In_Parse_Action := null;
+ Result (369).RHSs (1).Post_Parse_Action :=
select_alternative_list_1'Access;
+ Result (370).RHSs.Set_First_Last (0, 1);
+ Result (370).RHSs (0).In_Parse_Action := null;
+ Result (370).RHSs (0).Post_Parse_Action := selective_accept_0'Access;
+ Result (370).RHSs (1).In_Parse_Action := null;
+ Result (370).RHSs (1).Post_Parse_Action := selective_accept_1'Access;
+ Result (371).RHSs.Set_First_Last (0, 0);
+ Result (371).RHSs (0).In_Parse_Action := null;
+ Result (371).RHSs (0).Post_Parse_Action := guard_0'Access;
+ Result (375).RHSs.Set_First_Last (0, 0);
+ Result (375).RHSs (0).In_Parse_Action := null;
+ Result (375).RHSs (0).Post_Parse_Action :=
terminate_alternative_0'Access;
+ Result (376).RHSs.Set_First_Last (0, 0);
+ Result (376).RHSs (0).In_Parse_Action := null;
+ Result (376).RHSs (0).Post_Parse_Action := timed_entry_call_0'Access;
+ Result (378).RHSs.Set_First_Last (0, 0);
+ Result (378).RHSs (0).In_Parse_Action := null;
+ Result (378).RHSs (0).Post_Parse_Action :=
conditional_entry_call_0'Access;
+ Result (379).RHSs.Set_First_Last (0, 0);
+ Result (379).RHSs (0).In_Parse_Action := null;
+ Result (379).RHSs (0).Post_Parse_Action :=
asynchronous_select_0'Access;
+ Result (382).RHSs.Set_First_Last (0, 0);
+ Result (382).RHSs (0).In_Parse_Action := null;
+ Result (382).RHSs (0).Post_Parse_Action := abort_statement_0'Access;
+ Result (383).RHSs.Set_First_Last (0, 1);
+ Result (383).RHSs (0).In_Parse_Action := compilation_0_check'Access;
+ Result (383).RHSs (0).Post_Parse_Action := compilation_0'Access;
+ Result (383).RHSs (1).In_Parse_Action := null;
+ Result (383).RHSs (1).Post_Parse_Action := compilation_1'Access;
+ Result (384).RHSs.Set_First_Last (0, 5);
+ Result (384).RHSs (0).In_Parse_Action := null;
+ Result (384).RHSs (0).Post_Parse_Action := null;
+ Result (384).RHSs (1).In_Parse_Action := null;
+ Result (384).RHSs (1).Post_Parse_Action := compilation_unit_1'Access;
+ Result (384).RHSs (2).In_Parse_Action := null;
+ Result (384).RHSs (2).Post_Parse_Action := compilation_unit_2'Access;
+ Result (384).RHSs (3).In_Parse_Action := null;
+ Result (384).RHSs (3).Post_Parse_Action := null;
+ Result (384).RHSs (4).In_Parse_Action := null;
+ Result (384).RHSs (4).Post_Parse_Action := null;
+ Result (384).RHSs (5).In_Parse_Action := null;
+ Result (384).RHSs (5).Post_Parse_Action := null;
+ Result (386).RHSs.Set_First_Last (0, 1);
+ Result (386).RHSs (0).In_Parse_Action := null;
+ Result (386).RHSs (0).Post_Parse_Action :=
limited_with_clause_0'Access;
+ Result (386).RHSs (1).In_Parse_Action := null;
+ Result (386).RHSs (1).Post_Parse_Action :=
limited_with_clause_1'Access;
+ Result (387).RHSs.Set_First_Last (0, 1);
+ Result (387).RHSs (0).In_Parse_Action := null;
+ Result (387).RHSs (0).Post_Parse_Action :=
nonlimited_with_clause_0'Access;
+ Result (387).RHSs (1).In_Parse_Action := null;
+ Result (387).RHSs (1).Post_Parse_Action :=
nonlimited_with_clause_1'Access;
+ Result (389).RHSs.Set_First_Last (0, 3);
+ Result (389).RHSs (0).In_Parse_Action := null;
+ Result (389).RHSs (0).Post_Parse_Action :=
subprogram_body_stub_0'Access;
+ Result (389).RHSs (1).In_Parse_Action := null;
+ Result (389).RHSs (1).Post_Parse_Action :=
subprogram_body_stub_1'Access;
+ Result (389).RHSs (2).In_Parse_Action := null;
+ Result (389).RHSs (2).Post_Parse_Action :=
subprogram_body_stub_2'Access;
+ Result (389).RHSs (3).In_Parse_Action := null;
+ Result (389).RHSs (3).Post_Parse_Action :=
subprogram_body_stub_3'Access;
+ Result (390).RHSs.Set_First_Last (0, 1);
+ Result (390).RHSs (0).In_Parse_Action := null;
+ Result (390).RHSs (0).Post_Parse_Action := package_body_stub_0'Access;
+ Result (390).RHSs (1).In_Parse_Action := null;
+ Result (390).RHSs (1).Post_Parse_Action := package_body_stub_1'Access;
+ Result (391).RHSs.Set_First_Last (0, 1);
+ Result (391).RHSs (0).In_Parse_Action := null;
+ Result (391).RHSs (0).Post_Parse_Action := task_body_stub_0'Access;
+ Result (391).RHSs (1).In_Parse_Action := null;
+ Result (391).RHSs (1).Post_Parse_Action := task_body_stub_1'Access;
+ Result (392).RHSs.Set_First_Last (0, 1);
+ Result (392).RHSs (0).In_Parse_Action := null;
+ Result (392).RHSs (0).Post_Parse_Action :=
protected_body_stub_0'Access;
+ Result (392).RHSs (1).In_Parse_Action := null;
+ Result (392).RHSs (1).Post_Parse_Action :=
protected_body_stub_1'Access;
+ Result (393).RHSs.Set_First_Last (0, 0);
+ Result (393).RHSs (0).In_Parse_Action := null;
+ Result (393).RHSs (0).Post_Parse_Action := subunit_0'Access;
+ Result (394).RHSs.Set_First_Last (0, 1);
+ Result (394).RHSs (0).In_Parse_Action := null;
+ Result (394).RHSs (0).Post_Parse_Action :=
exception_declaration_0'Access;
+ Result (394).RHSs (1).In_Parse_Action := null;
+ Result (394).RHSs (1).Post_Parse_Action :=
exception_declaration_1'Access;
+ Result (395).RHSs.Set_First_Last (0, 2);
+ Result (395).RHSs (0).In_Parse_Action := null;
+ Result (395).RHSs (0).Post_Parse_Action := null;
+ Result (395).RHSs (1).In_Parse_Action := null;
+ Result (395).RHSs (1).Post_Parse_Action := null;
+ Result (395).RHSs (2).In_Parse_Action := null;
+ Result (395).RHSs (2).Post_Parse_Action :=
exception_handler_list_2'Access;
+ Result (396).RHSs.Set_First_Last (0, 1);
+ Result (396).RHSs (0).In_Parse_Action := null;
+ Result (396).RHSs (0).Post_Parse_Action :=
handled_sequence_of_statements_0'Access;
+ Result (396).RHSs (1).In_Parse_Action := null;
+ Result (396).RHSs (1).Post_Parse_Action :=
handled_sequence_of_statements_1'Access;
+ Result (397).Optimized_List := True;
+ Result (398).RHSs.Set_First_Last (0, 1);
+ Result (398).RHSs (0).In_Parse_Action := null;
+ Result (398).RHSs (0).Post_Parse_Action := exception_handler_0'Access;
+ Result (398).RHSs (1).In_Parse_Action := null;
+ Result (398).RHSs (1).Post_Parse_Action := exception_handler_1'Access;
+ Result (401).RHSs.Set_First_Last (0, 2);
+ Result (401).RHSs (0).In_Parse_Action := null;
+ Result (401).RHSs (0).Post_Parse_Action := raise_statement_0'Access;
+ Result (401).RHSs (1).In_Parse_Action := null;
+ Result (401).RHSs (1).Post_Parse_Action := raise_statement_1'Access;
+ Result (401).RHSs (2).In_Parse_Action := null;
+ Result (401).RHSs (2).Post_Parse_Action := raise_statement_2'Access;
+ Result (402).RHSs.Set_First_Last (0, 1);
+ Result (402).RHSs (0).In_Parse_Action := null;
+ Result (402).RHSs (0).Post_Parse_Action := raise_expression_0'Access;
+ Result (402).RHSs (1).In_Parse_Action := null;
+ Result (402).RHSs (1).Post_Parse_Action := raise_expression_1'Access;
+ Result (404).RHSs.Set_First_Last (0, 1);
+ Result (404).RHSs (0).In_Parse_Action := null;
+ Result (404).RHSs (0).Post_Parse_Action :=
generic_subprogram_declaration_0'Access;
+ Result (404).RHSs (1).In_Parse_Action := null;
+ Result (404).RHSs (1).Post_Parse_Action :=
generic_subprogram_declaration_1'Access;
+ Result (405).RHSs.Set_First_Last (0, 0);
+ Result (405).RHSs (0).In_Parse_Action := null;
+ Result (405).RHSs (0).Post_Parse_Action :=
generic_package_declaration_0'Access;
+ Result (406).RHSs.Set_First_Last (0, 1);
+ Result (406).RHSs (0).In_Parse_Action := null;
+ Result (406).RHSs (0).Post_Parse_Action :=
generic_formal_part_0'Access;
+ Result (406).RHSs (1).In_Parse_Action := null;
+ Result (406).RHSs (1).Post_Parse_Action :=
generic_formal_part_1'Access;
+ Result (408).RHSs.Set_First_Last (0, 9);
+ Result (408).RHSs (0).In_Parse_Action := null;
+ Result (408).RHSs (0).Post_Parse_Action :=
generic_instantiation_0'Access;
+ Result (408).RHSs (1).In_Parse_Action := null;
+ Result (408).RHSs (1).Post_Parse_Action :=
generic_instantiation_1'Access;
+ Result (408).RHSs (2).In_Parse_Action := null;
+ Result (408).RHSs (2).Post_Parse_Action :=
generic_instantiation_2'Access;
+ Result (408).RHSs (3).In_Parse_Action := null;
+ Result (408).RHSs (3).Post_Parse_Action :=
generic_instantiation_3'Access;
+ Result (408).RHSs (4).In_Parse_Action := null;
+ Result (408).RHSs (4).Post_Parse_Action :=
generic_instantiation_4'Access;
+ Result (408).RHSs (5).In_Parse_Action := null;
+ Result (408).RHSs (5).Post_Parse_Action :=
generic_instantiation_5'Access;
+ Result (408).RHSs (6).In_Parse_Action := null;
+ Result (408).RHSs (6).Post_Parse_Action :=
generic_instantiation_6'Access;
+ Result (408).RHSs (7).In_Parse_Action := null;
+ Result (408).RHSs (7).Post_Parse_Action :=
generic_instantiation_7'Access;
+ Result (408).RHSs (8).In_Parse_Action := null;
+ Result (408).RHSs (8).Post_Parse_Action :=
generic_instantiation_8'Access;
+ Result (408).RHSs (9).In_Parse_Action := null;
+ Result (408).RHSs (9).Post_Parse_Action :=
generic_instantiation_9'Access;
+ Result (409).RHSs.Set_First_Last (0, 11);
+ Result (409).RHSs (0).In_Parse_Action := null;
+ Result (409).RHSs (0).Post_Parse_Action :=
formal_object_declaration_0'Access;
+ Result (409).RHSs (1).In_Parse_Action := null;
+ Result (409).RHSs (1).Post_Parse_Action :=
formal_object_declaration_1'Access;
+ Result (409).RHSs (2).In_Parse_Action := null;
+ Result (409).RHSs (2).Post_Parse_Action :=
formal_object_declaration_2'Access;
+ Result (409).RHSs (3).In_Parse_Action := null;
+ Result (409).RHSs (3).Post_Parse_Action :=
formal_object_declaration_3'Access;
+ Result (409).RHSs (4).In_Parse_Action := null;
+ Result (409).RHSs (4).Post_Parse_Action :=
formal_object_declaration_4'Access;
+ Result (409).RHSs (5).In_Parse_Action := null;
+ Result (409).RHSs (5).Post_Parse_Action :=
formal_object_declaration_5'Access;
+ Result (409).RHSs (6).In_Parse_Action := null;
+ Result (409).RHSs (6).Post_Parse_Action :=
formal_object_declaration_6'Access;
+ Result (409).RHSs (7).In_Parse_Action := null;
+ Result (409).RHSs (7).Post_Parse_Action :=
formal_object_declaration_7'Access;
+ Result (409).RHSs (8).In_Parse_Action := null;
+ Result (409).RHSs (8).Post_Parse_Action :=
formal_object_declaration_8'Access;
+ Result (409).RHSs (9).In_Parse_Action := null;
+ Result (409).RHSs (9).Post_Parse_Action :=
formal_object_declaration_9'Access;
+ Result (409).RHSs (10).In_Parse_Action := null;
+ Result (409).RHSs (10).Post_Parse_Action :=
formal_object_declaration_10'Access;
+ Result (409).RHSs (11).In_Parse_Action := null;
+ Result (409).RHSs (11).Post_Parse_Action :=
formal_object_declaration_11'Access;
+ Result (411).RHSs.Set_First_Last (0, 7);
+ Result (411).RHSs (0).In_Parse_Action := null;
+ Result (411).RHSs (0).Post_Parse_Action :=
formal_complete_type_declaration_0'Access;
+ Result (411).RHSs (1).In_Parse_Action := null;
+ Result (411).RHSs (1).Post_Parse_Action :=
formal_complete_type_declaration_1'Access;
+ Result (411).RHSs (2).In_Parse_Action := null;
+ Result (411).RHSs (2).Post_Parse_Action :=
formal_complete_type_declaration_2'Access;
+ Result (411).RHSs (3).In_Parse_Action := null;
+ Result (411).RHSs (3).Post_Parse_Action :=
formal_complete_type_declaration_3'Access;
+ Result (411).RHSs (4).In_Parse_Action := null;
+ Result (411).RHSs (4).Post_Parse_Action :=
formal_complete_type_declaration_4'Access;
+ Result (411).RHSs (5).In_Parse_Action := null;
+ Result (411).RHSs (5).Post_Parse_Action :=
formal_complete_type_declaration_5'Access;
+ Result (411).RHSs (6).In_Parse_Action := null;
+ Result (411).RHSs (6).Post_Parse_Action :=
formal_complete_type_declaration_6'Access;
+ Result (411).RHSs (7).In_Parse_Action := null;
+ Result (411).RHSs (7).Post_Parse_Action :=
formal_complete_type_declaration_7'Access;
+ Result (412).RHSs.Set_First_Last (0, 7);
+ Result (412).RHSs (0).In_Parse_Action := null;
+ Result (412).RHSs (0).Post_Parse_Action :=
formal_incomplete_type_declaration_0'Access;
+ Result (412).RHSs (1).In_Parse_Action := null;
+ Result (412).RHSs (1).Post_Parse_Action :=
formal_incomplete_type_declaration_1'Access;
+ Result (412).RHSs (2).In_Parse_Action := null;
+ Result (412).RHSs (2).Post_Parse_Action :=
formal_incomplete_type_declaration_2'Access;
+ Result (412).RHSs (3).In_Parse_Action := null;
+ Result (412).RHSs (3).Post_Parse_Action :=
formal_incomplete_type_declaration_3'Access;
+ Result (412).RHSs (4).In_Parse_Action := null;
+ Result (412).RHSs (4).Post_Parse_Action :=
formal_incomplete_type_declaration_4'Access;
+ Result (412).RHSs (5).In_Parse_Action := null;
+ Result (412).RHSs (5).Post_Parse_Action :=
formal_incomplete_type_declaration_5'Access;
+ Result (412).RHSs (6).In_Parse_Action := null;
+ Result (412).RHSs (6).Post_Parse_Action :=
formal_incomplete_type_declaration_6'Access;
+ Result (412).RHSs (7).In_Parse_Action := null;
+ Result (412).RHSs (7).Post_Parse_Action :=
formal_incomplete_type_declaration_7'Access;
+ Result (415).RHSs.Set_First_Last (0, 17);
+ Result (415).RHSs (0).In_Parse_Action := null;
+ Result (415).RHSs (0).Post_Parse_Action :=
formal_derived_type_definition_0'Access;
+ Result (415).RHSs (1).In_Parse_Action := null;
+ Result (415).RHSs (1).Post_Parse_Action :=
formal_derived_type_definition_1'Access;
+ Result (415).RHSs (2).In_Parse_Action := null;
+ Result (415).RHSs (2).Post_Parse_Action :=
formal_derived_type_definition_2'Access;
+ Result (415).RHSs (3).In_Parse_Action := null;
+ Result (415).RHSs (3).Post_Parse_Action :=
formal_derived_type_definition_3'Access;
+ Result (415).RHSs (4).In_Parse_Action := null;
+ Result (415).RHSs (4).Post_Parse_Action :=
formal_derived_type_definition_4'Access;
+ Result (415).RHSs (5).In_Parse_Action := null;
+ Result (415).RHSs (5).Post_Parse_Action :=
formal_derived_type_definition_5'Access;
+ Result (415).RHSs (6).In_Parse_Action := null;
+ Result (415).RHSs (6).Post_Parse_Action :=
formal_derived_type_definition_6'Access;
+ Result (415).RHSs (7).In_Parse_Action := null;
+ Result (415).RHSs (7).Post_Parse_Action :=
formal_derived_type_definition_7'Access;
+ Result (415).RHSs (8).In_Parse_Action := null;
+ Result (415).RHSs (8).Post_Parse_Action :=
formal_derived_type_definition_8'Access;
+ Result (415).RHSs (9).In_Parse_Action := null;
+ Result (415).RHSs (9).Post_Parse_Action :=
formal_derived_type_definition_9'Access;
+ Result (415).RHSs (10).In_Parse_Action := null;
+ Result (415).RHSs (10).Post_Parse_Action :=
formal_derived_type_definition_10'Access;
+ Result (415).RHSs (11).In_Parse_Action := null;
+ Result (415).RHSs (11).Post_Parse_Action :=
formal_derived_type_definition_11'Access;
+ Result (415).RHSs (12).In_Parse_Action := null;
+ Result (415).RHSs (12).Post_Parse_Action :=
formal_derived_type_definition_12'Access;
+ Result (415).RHSs (13).In_Parse_Action := null;
+ Result (415).RHSs (13).Post_Parse_Action :=
formal_derived_type_definition_13'Access;
+ Result (415).RHSs (14).In_Parse_Action := null;
+ Result (415).RHSs (14).Post_Parse_Action :=
formal_derived_type_definition_14'Access;
+ Result (415).RHSs (15).In_Parse_Action := null;
+ Result (415).RHSs (15).Post_Parse_Action :=
formal_derived_type_definition_15'Access;
+ Result (415).RHSs (16).In_Parse_Action := null;
+ Result (415).RHSs (16).Post_Parse_Action :=
formal_derived_type_definition_16'Access;
+ Result (415).RHSs (17).In_Parse_Action := null;
+ Result (415).RHSs (17).Post_Parse_Action :=
formal_derived_type_definition_17'Access;
+ Result (426).RHSs.Set_First_Last (0, 3);
+ Result (426).RHSs (0).In_Parse_Action := null;
+ Result (426).RHSs (0).Post_Parse_Action :=
formal_concrete_subprogram_declaration_0'Access;
+ Result (426).RHSs (1).In_Parse_Action := null;
+ Result (426).RHSs (1).Post_Parse_Action :=
formal_concrete_subprogram_declaration_1'Access;
+ Result (426).RHSs (2).In_Parse_Action := null;
+ Result (426).RHSs (2).Post_Parse_Action :=
formal_concrete_subprogram_declaration_2'Access;
+ Result (426).RHSs (3).In_Parse_Action := null;
+ Result (426).RHSs (3).Post_Parse_Action :=
formal_concrete_subprogram_declaration_3'Access;
+ Result (427).RHSs.Set_First_Last (0, 3);
+ Result (427).RHSs (0).In_Parse_Action := null;
+ Result (427).RHSs (0).Post_Parse_Action :=
formal_abstract_subprogram_declaration_0'Access;
+ Result (427).RHSs (1).In_Parse_Action := null;
+ Result (427).RHSs (1).Post_Parse_Action :=
formal_abstract_subprogram_declaration_1'Access;
+ Result (427).RHSs (2).In_Parse_Action := null;
+ Result (427).RHSs (2).Post_Parse_Action :=
formal_abstract_subprogram_declaration_2'Access;
+ Result (427).RHSs (3).In_Parse_Action := null;
+ Result (427).RHSs (3).Post_Parse_Action :=
formal_abstract_subprogram_declaration_3'Access;
+ Result (429).RHSs.Set_First_Last (0, 0);
+ Result (429).RHSs (0).In_Parse_Action := null;
+ Result (429).RHSs (0).Post_Parse_Action := default_name_0'Access;
+ Result (430).RHSs.Set_First_Last (0, 1);
+ Result (430).RHSs (0).In_Parse_Action := null;
+ Result (430).RHSs (0).Post_Parse_Action :=
formal_package_declaration_0'Access;
+ Result (430).RHSs (1).In_Parse_Action := null;
+ Result (430).RHSs (1).Post_Parse_Action :=
formal_package_declaration_1'Access;
+ Result (432).RHSs.Set_First_Last (0, 1);
+ Result (432).RHSs (0).In_Parse_Action := null;
+ Result (432).RHSs (0).Post_Parse_Action :=
aspect_association_0'Access;
+ Result (432).RHSs (1).In_Parse_Action := null;
+ Result (432).RHSs (1).Post_Parse_Action :=
aspect_association_1'Access;
+ Result (434).RHSs.Set_First_Last (0, 0);
+ Result (434).RHSs (0).In_Parse_Action := null;
+ Result (434).RHSs (0).Post_Parse_Action :=
aspect_specification_0'Access;
+ Result (437).RHSs.Set_First_Last (0, 0);
+ Result (437).RHSs (0).In_Parse_Action := null;
+ Result (437).RHSs (0).Post_Parse_Action :=
attribute_definition_clause_0'Access;
+ Result (438).RHSs.Set_First_Last (0, 0);
+ Result (438).RHSs (0).In_Parse_Action := null;
+ Result (438).RHSs (0).Post_Parse_Action :=
enumeration_representation_clause_0'Access;
+ Result (440).RHSs.Set_First_Last (0, 7);
+ Result (440).RHSs (0).In_Parse_Action := null;
+ Result (440).RHSs (0).Post_Parse_Action :=
record_representation_clause_0'Access;
+ Result (440).RHSs (1).In_Parse_Action := null;
+ Result (440).RHSs (1).Post_Parse_Action :=
record_representation_clause_1'Access;
+ Result (440).RHSs (2).In_Parse_Action := null;
+ Result (440).RHSs (2).Post_Parse_Action :=
record_representation_clause_2'Access;
+ Result (440).RHSs (3).In_Parse_Action := null;
+ Result (440).RHSs (3).Post_Parse_Action :=
record_representation_clause_3'Access;
+ Result (440).RHSs (4).In_Parse_Action := null;
+ Result (440).RHSs (4).Post_Parse_Action :=
record_representation_clause_4'Access;
+ Result (440).RHSs (5).In_Parse_Action := null;
+ Result (440).RHSs (5).Post_Parse_Action :=
record_representation_clause_5'Access;
+ Result (440).RHSs (6).In_Parse_Action := null;
+ Result (440).RHSs (6).Post_Parse_Action :=
record_representation_clause_6'Access;
+ Result (440).RHSs (7).In_Parse_Action := null;
+ Result (440).RHSs (7).Post_Parse_Action :=
record_representation_clause_7'Access;
+ Result (441).RHSs.Set_First_Last (0, 0);
+ Result (441).RHSs (0).In_Parse_Action := null;
+ Result (441).RHSs (0).Post_Parse_Action := component_clause_0'Access;
+ Result (451).Optimized_List := True;
+ Result (453).RHSs.Set_First_Last (0, 1);
+ Result (453).RHSs (0).In_Parse_Action := null;
+ Result (453).RHSs (0).Post_Parse_Action := delta_constraint_0'Access;
+ Result (453).RHSs (1).In_Parse_Action := null;
+ Result (453).RHSs (1).Post_Parse_Action := delta_constraint_1'Access;
+ Result (454).RHSs.Set_First_Last (0, 0);
+ Result (454).RHSs (0).In_Parse_Action := null;
+ Result (454).RHSs (0).Post_Parse_Action := at_clause_0'Access;
+ Result (456).Optimized_List := True;
+ Result (457).Optimized_List := True;
+ Result (458).Optimized_List := True;
+ Result (459).Optimized_List := True;
+ Result (460).Optimized_List := True;
+ Result (461).Optimized_List := True;
+ Result (462).Optimized_List := True;
+ Result (463).Optimized_List := True;
+ Result (464).Optimized_List := True;
+ Result (465).Optimized_List := True;
+ Result (466).Optimized_List := True;
+ end return;
+ end Create_Productions;
+
+end Ada_Annex_P_Process_LALR_Main;
diff --git a/ada_annex_p_process_lalr_main.ads
b/ada_annex_p_process_lalr_main.ads
new file mode 100644
index 0000000000..266e735e31
--- /dev/null
+++ b/ada_annex_p_process_lalr_main.ads
@@ -0,0 +1,31 @@
+-- generated parser support file. -*- buffer-read-only:t -*-
+-- command line: wisitoken-bnf-generate.exe --generate LALR Ada_Emacs re2c
PROCESS ada_annex_p.wy
+--
+
+-- Copyright (C) 2013 - 2022 Free Software Foundation, Inc.
+
+-- This program is free software; you can redistribute it and/or
+-- modify it under the terms of the GNU General Public License as
+-- published by the Free Software Foundation; either version 3, or (at
+-- your option) any later version.
+--
+-- This software is distributed in the hope that it will be useful,
+-- but WITHOUT ANY WARRANTY; without even the implied warranty of
+-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+-- General Public License for more details.
+--
+-- You should have received a copy of the GNU General Public License
+-- along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>.
+
+with WisiToken.Syntax_Trees;
+with WisiToken.Lexer;
+with WisiToken.Parse.LR;
+package Ada_Annex_P_Process_LALR_Main is
+
+ function Create_Parse_Table
+ return WisiToken.Parse.LR.Parse_Table_Ptr;
+
+ function Create_Productions return
WisiToken.Syntax_Trees.Production_Info_Trees.Vector;
+
+ function Create_Lexer (Trace : in WisiToken.Trace_Access) return
WisiToken.Lexer.Handle;
+end Ada_Annex_P_Process_LALR_Main;
diff --git a/ada_annex_p_process_lr1_main.adb b/ada_annex_p_process_lr1_main.adb
new file mode 100644
index 0000000000..9838beeec5
--- /dev/null
+++ b/ada_annex_p_process_lr1_main.adb
@@ -0,0 +1,1803 @@
+-- generated parser support file. -*- buffer-read-only:t -*-
+-- command line: wisitoken-bnf-generate.exe --generate LR1 Ada_Emacs re2c
PROCESS text_rep ada_annex_p.wy
+--
+
+-- Copyright (C) 2013 - 2022 Free Software Foundation, Inc.
+
+-- This program is free software; you can redistribute it and/or
+-- modify it under the terms of the GNU General Public License as
+-- published by the Free Software Foundation; either version 3, or (at
+-- your option) any later version.
+--
+-- This software is distributed in the hope that it will be useful,
+-- but WITHOUT ANY WARRANTY; without even the implied warranty of
+-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+-- General Public License for more details.
+--
+-- You should have received a copy of the GNU General Public License
+-- along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>.
+
+with Ada_Annex_P_Process_Actions; use Ada_Annex_P_Process_Actions;
+with SAL;
+with WisiToken.Lexer.re2c;
+with ada_annex_p_re2c_c;
+package body Ada_Annex_P_Process_LR1_Main is
+
+ function Is_Block_Delimited (ID : in WisiToken.Token_ID) return Boolean
+ is begin
+ case To_Token_Enum (ID) is
+ when
+ COMMENT_ID |
+ GNAT_PREP_IF_ID |
+ GNAT_PREP_ELSIF_ID |
+ GNAT_PREP_ELSE_ID |
+ GNAT_PREP_END_IF_ID |
+ CONFLICT_MARK_A_ID |
+ CONFLICT_MARK_B_ID |
+ CONFLICT_MARK_END_ID |
+ PLACEHOLDER_ID |
+ STRING_LITERAL_ID |
+ CHARACTER_LITERAL_ID => return True;
+ when others => return False;
+ end case;
+ end Is_Block_Delimited;
+
+ function Same_Block_Delimiters (ID : in WisiToken.Token_ID) return Boolean
+ is begin
+ case To_Token_Enum (ID) is
+ when COMMENT_ID => return False;
+ when GNAT_PREP_IF_ID => return False;
+ when GNAT_PREP_ELSIF_ID => return False;
+ when GNAT_PREP_ELSE_ID => return False;
+ when GNAT_PREP_END_IF_ID => return False;
+ when CONFLICT_MARK_A_ID => return False;
+ when CONFLICT_MARK_B_ID => return False;
+ when CONFLICT_MARK_END_ID => return False;
+ when PLACEHOLDER_ID => return False;
+ when STRING_LITERAL_ID => return True;
+ when CHARACTER_LITERAL_ID => return True;
+ when others => return False;
+ end case;
+ end Same_Block_Delimiters;
+
+ function Escape_Delimiter_Doubled (ID : in WisiToken.Token_ID) return
Boolean
+ is begin
+ case To_Token_Enum (ID) is
+ when STRING_LITERAL_ID => return True;
+ when others => return False;
+ end case;
+ end Escape_Delimiter_Doubled;
+
+ function Start_Delimiter_Length (ID : in WisiToken.Token_ID) return Integer
+ is begin
+ case To_Token_Enum (ID) is
+ when COMMENT_ID => return 2;
+ when GNAT_PREP_IF_ID => return 3;
+ when GNAT_PREP_ELSIF_ID => return 6;
+ when GNAT_PREP_ELSE_ID => return 5;
+ when GNAT_PREP_END_IF_ID => return 7;
+ when CONFLICT_MARK_A_ID => return 7;
+ when CONFLICT_MARK_B_ID => return 7;
+ when CONFLICT_MARK_END_ID => return 7;
+ when PLACEHOLDER_ID => return 1;
+ when STRING_LITERAL_ID => return 1;
+ when CHARACTER_LITERAL_ID => return 1;
+ when others => raise SAL.Programmer_Error; return 0;
+ end case;
+ end Start_Delimiter_Length;
+
+ function End_Delimiter_Length (ID : in WisiToken.Token_ID) return Integer
+ is begin
+ case To_Token_Enum (ID) is
+ when
+ COMMENT_ID |
+ GNAT_PREP_IF_ID |
+ GNAT_PREP_ELSIF_ID |
+ GNAT_PREP_ELSE_ID |
+ GNAT_PREP_END_IF_ID |
+ CONFLICT_MARK_A_ID |
+ CONFLICT_MARK_B_ID |
+ CONFLICT_MARK_END_ID |
+ STRING_LITERAL_ID |
+ CHARACTER_LITERAL_ID => return 1;
+ when PLACEHOLDER_ID => return 1;
+ when others => raise SAL.Programmer_Error; return 0;
+ end case;
+ end End_Delimiter_Length;
+
+ function New_Line_Is_End_Delimiter (ID : in WisiToken.Token_ID) return
Boolean
+ is begin
+ return
+ (case To_Token_Enum (ID) is
+ when COMMENT_ID => True,
+ when GNAT_PREP_IF_ID => True,
+ when GNAT_PREP_ELSIF_ID => True,
+ when GNAT_PREP_ELSE_ID => True,
+ when GNAT_PREP_END_IF_ID => True,
+ when CONFLICT_MARK_A_ID => True,
+ when CONFLICT_MARK_B_ID => True,
+ when CONFLICT_MARK_END_ID => True,
+ when PLACEHOLDER_ID => True,
+ when STRING_LITERAL_ID => True,
+ when CHARACTER_LITERAL_ID => True,
+ when others => raise SAL.Programmer_Error);
+ end New_Line_Is_End_Delimiter;
+
+ function Find_End_Delimiter
+ (Source : in WisiToken.Lexer.Source;
+ ID : in WisiToken.Token_ID;
+ Token_Start : in WisiToken.Buffer_Pos)
+ return WisiToken.Buffer_Pos
+ is begin
+ return
+ (case To_Token_Enum (ID) is
+ when COMMENT_ID => WisiToken.Lexer.Find_New_Line (Source,
Token_Start),
+ when GNAT_PREP_IF_ID => WisiToken.Lexer.Find_New_Line (Source,
Token_Start),
+ when GNAT_PREP_ELSIF_ID => WisiToken.Lexer.Find_New_Line (Source,
Token_Start),
+ when GNAT_PREP_ELSE_ID => WisiToken.Lexer.Find_New_Line (Source,
Token_Start),
+ when GNAT_PREP_END_IF_ID => WisiToken.Lexer.Find_New_Line (Source,
Token_Start),
+ when CONFLICT_MARK_A_ID => WisiToken.Lexer.Find_New_Line (Source,
Token_Start),
+ when CONFLICT_MARK_B_ID => WisiToken.Lexer.Find_New_Line (Source,
Token_Start),
+ when CONFLICT_MARK_END_ID => WisiToken.Lexer.Find_New_Line (Source,
Token_Start),
+ when PLACEHOLDER_ID => WisiToken.Lexer.Find_String (Source,
Token_Start, "}"),
+ when STRING_LITERAL_ID => WisiToken.Lexer.Find_String_Or_New_Line
(Source, Token_Start, """"),
+ when CHARACTER_LITERAL_ID => WisiToken.Lexer.Find_String_Or_New_Line
(Source, Token_Start, """"),
+ when others => raise SAL.Programmer_Error);
+ end Find_End_Delimiter;
+
+ function Find_Scan_End
+ (Source : in WisiToken.Lexer.Source;
+ ID : in WisiToken.Token_ID;
+ Region : in WisiToken.Buffer_Region;
+ Inserted : in Boolean;
+ Start : in Boolean)
+ return WisiToken.Buffer_Pos
+ is
+ use WisiToken;
+ begin
+ return
+ (case To_Token_Enum (ID) is
+ when COMMENT_ID =>
+ (if Inserted then Region.Last
+ elsif Start then Region.Last
+ else Lexer.Find_New_Line (Source, Region.Last)),
+ when GNAT_PREP_IF_ID =>
+ (if Inserted then Region.Last
+ elsif Start then Region.Last
+ else Lexer.Find_New_Line (Source, Region.Last)),
+ when GNAT_PREP_ELSIF_ID =>
+ (if Inserted then Region.Last
+ elsif Start then Region.Last
+ else Lexer.Find_New_Line (Source, Region.Last)),
+ when GNAT_PREP_ELSE_ID =>
+ (if Inserted then Region.Last
+ elsif Start then Region.Last
+ else Lexer.Find_New_Line (Source, Region.Last)),
+ when GNAT_PREP_END_IF_ID =>
+ (if Inserted then Region.Last
+ elsif Start then Region.Last
+ else Lexer.Find_New_Line (Source, Region.Last)),
+ when CONFLICT_MARK_A_ID =>
+ (if Inserted then Region.Last
+ elsif Start then Region.Last
+ else Lexer.Find_New_Line (Source, Region.Last)),
+ when CONFLICT_MARK_B_ID =>
+ (if Inserted then Region.Last
+ elsif Start then Region.Last
+ else Lexer.Find_New_Line (Source, Region.Last)),
+ when CONFLICT_MARK_END_ID =>
+ (if Inserted then Region.Last
+ elsif Start then Region.Last
+ else Lexer.Find_New_Line (Source, Region.Last)),
+ when PLACEHOLDER_ID =>
+ (if Inserted then Region.Last
+ elsif Start then Region.Last
+ else Lexer.Find_String_Or_New_Line (Source, Region.Last, "{")),
+ when STRING_LITERAL_ID => Lexer.Find_New_Line (Source, Region.Last),
+ when CHARACTER_LITERAL_ID => Lexer.Find_New_Line (Source,
Region.Last),
+ when others => raise SAL.Programmer_Error);
+ end Find_Scan_End;
+
+ function Contains_End_Delimiter
+ (Source : in WisiToken.Lexer.Source;
+ ID : in WisiToken.Token_ID;
+ Region : in WisiToken.Buffer_Region)
+ return WisiToken.Base_Buffer_Pos
+ is
+ use WisiToken;
+ begin
+ return
+ (case To_Token_Enum (ID) is
+ when COMMENT_ID => Lexer.Find_New_Line (Source, Region),
+ when GNAT_PREP_IF_ID => Lexer.Find_New_Line (Source, Region),
+ when GNAT_PREP_ELSIF_ID => Lexer.Find_New_Line (Source, Region),
+ when GNAT_PREP_ELSE_ID => Lexer.Find_New_Line (Source, Region),
+ when GNAT_PREP_END_IF_ID => Lexer.Find_New_Line (Source, Region),
+ when CONFLICT_MARK_A_ID => Lexer.Find_New_Line (Source, Region),
+ when CONFLICT_MARK_B_ID => Lexer.Find_New_Line (Source, Region),
+ when CONFLICT_MARK_END_ID => Lexer.Find_New_Line (Source, Region),
+ when PLACEHOLDER_ID => Lexer.Find_String_Or_New_Line (Source, Region,
"}"),
+ when STRING_LITERAL_ID => Lexer.Find_String_Or_New_Line (Source,
Region, """"),
+ when CHARACTER_LITERAL_ID => Lexer.Find_String_Or_New_Line (Source,
Region, "'"),
+ when others => raise SAL.Programmer_Error);
+ end Contains_End_Delimiter;
+
+ function Line_Begin_Char_Pos
+ (Source : in WisiToken.Lexer.Source;
+ Token : in WisiToken.Lexer.Token;
+ Line : in WisiToken.Line_Number_Type)
+ return WisiToken.Buffer_Pos
+ is
+ pragma Unreferenced (Source, Line);
+ use all type WisiToken.Base_Buffer_Pos;
+ begin
+ case To_Token_Enum (Token.ID) is
+ when NEW_LINE_ID => return Token.Char_Region.Last + 1;
+ when COMMENT_ID => return Token.Char_Region.Last + 1;
+ when GNAT_PREP_IF_ID => return Token.Char_Region.Last + 1;
+ when GNAT_PREP_ELSIF_ID => return Token.Char_Region.Last + 1;
+ when GNAT_PREP_ELSE_ID => return Token.Char_Region.Last + 1;
+ when GNAT_PREP_END_IF_ID => return Token.Char_Region.Last + 1;
+ when CONFLICT_MARK_A_ID => return Token.Char_Region.Last + 1;
+ when CONFLICT_MARK_B_ID => return Token.Char_Region.Last + 1;
+ when CONFLICT_MARK_END_ID => return Token.Char_Region.Last + 1;
+ when others => raise SAL.Programmer_Error;
+ end case;
+ end Line_Begin_Char_Pos;
+
+ function Can_Contain_New_Line (ID : in WisiToken.Token_ID) return Boolean
+ is begin
+ case To_Token_Enum (ID) is
+ when NEW_LINE_ID => return True;
+ when COMMENT_ID => return True;
+ when GNAT_PREP_IF_ID => return True;
+ when GNAT_PREP_ELSIF_ID => return True;
+ when GNAT_PREP_ELSE_ID => return True;
+ when GNAT_PREP_END_IF_ID => return True;
+ when CONFLICT_MARK_A_ID => return True;
+ when CONFLICT_MARK_B_ID => return True;
+ when CONFLICT_MARK_END_ID => return True;
+ when others => return False;
+ end case;
+ end Can_Contain_New_Line;
+
+ function Terminated_By_New_Line (ID : in WisiToken.Token_ID) return Boolean
+ is begin
+ case To_Token_Enum (ID) is
+ when NEW_LINE_ID => return True;
+ when COMMENT_ID => return True;
+ when GNAT_PREP_IF_ID => return True;
+ when GNAT_PREP_ELSIF_ID => return True;
+ when GNAT_PREP_ELSE_ID => return True;
+ when GNAT_PREP_END_IF_ID => return True;
+ when CONFLICT_MARK_A_ID => return True;
+ when CONFLICT_MARK_B_ID => return True;
+ when CONFLICT_MARK_END_ID => return True;
+ when STRING_LITERAL_ID => return True;
+ when CHARACTER_LITERAL_ID => return True;
+ when others => return False;
+ end case;
+ end Terminated_By_New_Line;
+
+ package Lexer is new WisiToken.Lexer.re2c
+ (ada_annex_p_re2c_c.New_Lexer,
+ ada_annex_p_re2c_c.Free_Lexer,
+ ada_annex_p_re2c_c.Reset_Lexer,
+ ada_annex_p_re2c_c.Set_Verbosity,
+ ada_annex_p_re2c_c.Set_Position,
+ ada_annex_p_re2c_c.Next_Token,
+ Is_Block_Delimited,
+ Same_Block_Delimiters,
+ Escape_Delimiter_Doubled,
+ Start_Delimiter_Length,
+ End_Delimiter_Length,
+ New_Line_Is_End_Delimiter,
+ Find_End_Delimiter,
+ Contains_End_Delimiter,
+ Find_Scan_End,
+ Line_Begin_Char_Pos,
+ Can_Contain_New_Line,
+ Terminated_By_New_Line);
+
+ function Create_Parse_Table
+ (Text_Rep_File_Name : in String)
+ return WisiToken.Parse.LR.Parse_Table_Ptr
+ is
+ use WisiToken.Parse.LR;
+ McKenzie_Param : constant McKenzie_Param_Type :=
+ (First_Terminal => 11,
+ Last_Terminal => 119,
+ First_Nonterminal => 120,
+ Last_Nonterminal => 466,
+ Insert =>
+ (4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 7, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 4, 4, 4, 4,
+ 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 4, 3, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
+ 4, 4, 4, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 4, 4, 4, 3, 4, 4, 4, 4, 4,
4, 4, 4, 3, 4, 4, 4, 4, 4, 4, 4, 2, 4, 4,
+ 4),
+ Delete =>
+ (3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
+ 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
+ 3, 3, 3, 3, 1, 3, 3, 3, 3, 3, 3, 3, 1, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
+ 3),
+ Push_Back =>
+ (2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2),
+ Undo_Reduce =>
+ (2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2),
+ Minimal_Complete_Cost_Delta => -3,
+ Fast_Forward => 2,
+ Matching_Begin => 1,
+ Ignore_Check_Fail => 2,
+ Check_Limit => 4,
+ Zombie_Limit => 4,
+ Check_Delta_Limit => 100,
+ Enqueue_Limit => 58000);
+
+ Table : constant Parse_Table_Ptr := Get_Text_Rep (Text_Rep_File_Name);
+ begin
+ Table.Error_Recover_Enabled := True;
+ Table.McKenzie_Param := McKenzie_Param;
+ Table.Max_Parallel := 20;
+ return Table;
+ end Create_Parse_Table;
+
+ function Create_Lexer (Trace : in WisiToken.Trace_Access) return
WisiToken.Lexer.Handle
+ is begin
+ return Lexer.New_Lexer (Trace,
Ada_Annex_P_Process_Actions.Descriptor'Access);
+ end Create_Lexer;
+
+ function Create_Productions return
WisiToken.Syntax_Trees.Production_Info_Trees.Vector
+ is begin
+ return Result : WisiToken.Syntax_Trees.Production_Info_Trees.Vector do
+ Result.Set_First_Last (120, 466);
+ Result (123).RHSs.Set_First_Last (0, 1);
+ Result (123).RHSs (0).In_Parse_Action := null;
+ Result (123).RHSs (0).Post_Parse_Action :=
pragma_argument_association_list_0'Access;
+ Result (123).RHSs (1).In_Parse_Action := null;
+ Result (123).RHSs (1).Post_Parse_Action :=
pragma_argument_association_list_1'Access;
+ Result (124).RHSs.Set_First_Last (0, 3);
+ Result (124).RHSs (0).In_Parse_Action := null;
+ Result (124).RHSs (0).Post_Parse_Action := pragma_g_0'Access;
+ Result (124).RHSs (1).In_Parse_Action := null;
+ Result (124).RHSs (1).Post_Parse_Action := pragma_g_1'Access;
+ Result (124).RHSs (2).In_Parse_Action := null;
+ Result (124).RHSs (2).Post_Parse_Action := pragma_g_2'Access;
+ Result (124).RHSs (3).In_Parse_Action := null;
+ Result (124).RHSs (3).Post_Parse_Action := pragma_g_3'Access;
+ Result (128).RHSs.Set_First_Last (0, 5);
+ Result (128).RHSs (0).In_Parse_Action := null;
+ Result (128).RHSs (0).Post_Parse_Action :=
full_type_declaration_0'Access;
+ Result (128).RHSs (1).In_Parse_Action := null;
+ Result (128).RHSs (1).Post_Parse_Action :=
full_type_declaration_1'Access;
+ Result (128).RHSs (2).In_Parse_Action := null;
+ Result (128).RHSs (2).Post_Parse_Action :=
full_type_declaration_2'Access;
+ Result (128).RHSs (3).In_Parse_Action := null;
+ Result (128).RHSs (3).Post_Parse_Action :=
full_type_declaration_3'Access;
+ Result (128).RHSs (4).In_Parse_Action := null;
+ Result (128).RHSs (4).Post_Parse_Action := null;
+ Result (128).RHSs (5).In_Parse_Action := null;
+ Result (128).RHSs (5).Post_Parse_Action := null;
+ Result (130).RHSs.Set_First_Last (0, 1);
+ Result (130).RHSs (0).In_Parse_Action := null;
+ Result (130).RHSs (0).Post_Parse_Action :=
subtype_declaration_0'Access;
+ Result (130).RHSs (1).In_Parse_Action := null;
+ Result (130).RHSs (1).Post_Parse_Action :=
subtype_declaration_1'Access;
+ Result (135).RHSs.Set_First_Last (0, 49);
+ Result (135).RHSs (0).In_Parse_Action := null;
+ Result (135).RHSs (0).Post_Parse_Action :=
object_declaration_0'Access;
+ Result (135).RHSs (1).In_Parse_Action := null;
+ Result (135).RHSs (1).Post_Parse_Action :=
object_declaration_1'Access;
+ Result (135).RHSs (2).In_Parse_Action := null;
+ Result (135).RHSs (2).Post_Parse_Action :=
object_declaration_2'Access;
+ Result (135).RHSs (3).In_Parse_Action := null;
+ Result (135).RHSs (3).Post_Parse_Action :=
object_declaration_3'Access;
+ Result (135).RHSs (4).In_Parse_Action := null;
+ Result (135).RHSs (4).Post_Parse_Action :=
object_declaration_4'Access;
+ Result (135).RHSs (5).In_Parse_Action := null;
+ Result (135).RHSs (5).Post_Parse_Action :=
object_declaration_5'Access;
+ Result (135).RHSs (6).In_Parse_Action := null;
+ Result (135).RHSs (6).Post_Parse_Action :=
object_declaration_6'Access;
+ Result (135).RHSs (7).In_Parse_Action := null;
+ Result (135).RHSs (7).Post_Parse_Action :=
object_declaration_7'Access;
+ Result (135).RHSs (8).In_Parse_Action := null;
+ Result (135).RHSs (8).Post_Parse_Action :=
object_declaration_8'Access;
+ Result (135).RHSs (9).In_Parse_Action := null;
+ Result (135).RHSs (9).Post_Parse_Action :=
object_declaration_9'Access;
+ Result (135).RHSs (10).In_Parse_Action := null;
+ Result (135).RHSs (10).Post_Parse_Action :=
object_declaration_10'Access;
+ Result (135).RHSs (11).In_Parse_Action := null;
+ Result (135).RHSs (11).Post_Parse_Action :=
object_declaration_11'Access;
+ Result (135).RHSs (12).In_Parse_Action := null;
+ Result (135).RHSs (12).Post_Parse_Action :=
object_declaration_12'Access;
+ Result (135).RHSs (13).In_Parse_Action := null;
+ Result (135).RHSs (13).Post_Parse_Action :=
object_declaration_13'Access;
+ Result (135).RHSs (14).In_Parse_Action := null;
+ Result (135).RHSs (14).Post_Parse_Action :=
object_declaration_14'Access;
+ Result (135).RHSs (15).In_Parse_Action := null;
+ Result (135).RHSs (15).Post_Parse_Action :=
object_declaration_15'Access;
+ Result (135).RHSs (16).In_Parse_Action := null;
+ Result (135).RHSs (16).Post_Parse_Action :=
object_declaration_16'Access;
+ Result (135).RHSs (17).In_Parse_Action := null;
+ Result (135).RHSs (17).Post_Parse_Action :=
object_declaration_17'Access;
+ Result (135).RHSs (18).In_Parse_Action := null;
+ Result (135).RHSs (18).Post_Parse_Action :=
object_declaration_18'Access;
+ Result (135).RHSs (19).In_Parse_Action := null;
+ Result (135).RHSs (19).Post_Parse_Action :=
object_declaration_19'Access;
+ Result (135).RHSs (20).In_Parse_Action := null;
+ Result (135).RHSs (20).Post_Parse_Action :=
object_declaration_20'Access;
+ Result (135).RHSs (21).In_Parse_Action := null;
+ Result (135).RHSs (21).Post_Parse_Action :=
object_declaration_21'Access;
+ Result (135).RHSs (22).In_Parse_Action := null;
+ Result (135).RHSs (22).Post_Parse_Action :=
object_declaration_22'Access;
+ Result (135).RHSs (23).In_Parse_Action := null;
+ Result (135).RHSs (23).Post_Parse_Action :=
object_declaration_23'Access;
+ Result (135).RHSs (24).In_Parse_Action := null;
+ Result (135).RHSs (24).Post_Parse_Action :=
object_declaration_24'Access;
+ Result (135).RHSs (25).In_Parse_Action := null;
+ Result (135).RHSs (25).Post_Parse_Action :=
object_declaration_25'Access;
+ Result (135).RHSs (26).In_Parse_Action := null;
+ Result (135).RHSs (26).Post_Parse_Action :=
object_declaration_26'Access;
+ Result (135).RHSs (27).In_Parse_Action := null;
+ Result (135).RHSs (27).Post_Parse_Action :=
object_declaration_27'Access;
+ Result (135).RHSs (28).In_Parse_Action := null;
+ Result (135).RHSs (28).Post_Parse_Action :=
object_declaration_28'Access;
+ Result (135).RHSs (29).In_Parse_Action := null;
+ Result (135).RHSs (29).Post_Parse_Action :=
object_declaration_29'Access;
+ Result (135).RHSs (30).In_Parse_Action := null;
+ Result (135).RHSs (30).Post_Parse_Action :=
object_declaration_30'Access;
+ Result (135).RHSs (31).In_Parse_Action := null;
+ Result (135).RHSs (31).Post_Parse_Action :=
object_declaration_31'Access;
+ Result (135).RHSs (32).In_Parse_Action := null;
+ Result (135).RHSs (32).Post_Parse_Action :=
object_declaration_32'Access;
+ Result (135).RHSs (33).In_Parse_Action := null;
+ Result (135).RHSs (33).Post_Parse_Action :=
object_declaration_33'Access;
+ Result (135).RHSs (34).In_Parse_Action := null;
+ Result (135).RHSs (34).Post_Parse_Action :=
object_declaration_34'Access;
+ Result (135).RHSs (35).In_Parse_Action := null;
+ Result (135).RHSs (35).Post_Parse_Action :=
object_declaration_35'Access;
+ Result (135).RHSs (36).In_Parse_Action := null;
+ Result (135).RHSs (36).Post_Parse_Action :=
object_declaration_36'Access;
+ Result (135).RHSs (37).In_Parse_Action := null;
+ Result (135).RHSs (37).Post_Parse_Action :=
object_declaration_37'Access;
+ Result (135).RHSs (38).In_Parse_Action := null;
+ Result (135).RHSs (38).Post_Parse_Action :=
object_declaration_38'Access;
+ Result (135).RHSs (39).In_Parse_Action := null;
+ Result (135).RHSs (39).Post_Parse_Action :=
object_declaration_39'Access;
+ Result (135).RHSs (40).In_Parse_Action := null;
+ Result (135).RHSs (40).Post_Parse_Action :=
object_declaration_40'Access;
+ Result (135).RHSs (41).In_Parse_Action := null;
+ Result (135).RHSs (41).Post_Parse_Action :=
object_declaration_41'Access;
+ Result (135).RHSs (42).In_Parse_Action := null;
+ Result (135).RHSs (42).Post_Parse_Action :=
object_declaration_42'Access;
+ Result (135).RHSs (43).In_Parse_Action := null;
+ Result (135).RHSs (43).Post_Parse_Action :=
object_declaration_43'Access;
+ Result (135).RHSs (44).In_Parse_Action := null;
+ Result (135).RHSs (44).Post_Parse_Action :=
object_declaration_44'Access;
+ Result (135).RHSs (45).In_Parse_Action := null;
+ Result (135).RHSs (45).Post_Parse_Action :=
object_declaration_45'Access;
+ Result (135).RHSs (46).In_Parse_Action := null;
+ Result (135).RHSs (46).Post_Parse_Action :=
object_declaration_46'Access;
+ Result (135).RHSs (47).In_Parse_Action := null;
+ Result (135).RHSs (47).Post_Parse_Action :=
object_declaration_47'Access;
+ Result (135).RHSs (48).In_Parse_Action := null;
+ Result (135).RHSs (48).Post_Parse_Action := null;
+ Result (135).RHSs (49).In_Parse_Action := null;
+ Result (135).RHSs (49).Post_Parse_Action := null;
+ Result (136).RHSs.Set_First_Last (0, 1);
+ Result (136).RHSs (0).In_Parse_Action := null;
+ Result (136).RHSs (0).Post_Parse_Action :=
defining_identifier_list_0'Access;
+ Result (136).RHSs (1).In_Parse_Action := null;
+ Result (136).RHSs (1).Post_Parse_Action :=
defining_identifier_list_1'Access;
+ Result (137).RHSs.Set_First_Last (0, 0);
+ Result (137).RHSs (0).In_Parse_Action := null;
+ Result (137).RHSs (0).Post_Parse_Action :=
number_declaration_0'Access;
+ Result (141).Optimized_List := True;
+ Result (142).RHSs.Set_First_Last (0, 0);
+ Result (142).RHSs (0).In_Parse_Action := null;
+ Result (142).RHSs (0).Post_Parse_Action :=
enumeration_type_definition_0'Access;
+ Result (144).RHSs.Set_First_Last (0, 1);
+ Result (144).RHSs (0).In_Parse_Action := null;
+ Result (144).RHSs (0).Post_Parse_Action :=
integer_type_definition_0'Access;
+ Result (144).RHSs (1).In_Parse_Action := null;
+ Result (144).RHSs (1).Post_Parse_Action :=
integer_type_definition_1'Access;
+ Result (155).Optimized_List := True;
+ Result (156).RHSs.Set_First_Last (0, 0);
+ Result (156).RHSs (0).In_Parse_Action := null;
+ Result (156).RHSs (0).Post_Parse_Action :=
unconstrained_array_definition_0'Access;
+ Result (158).Optimized_List := True;
+ Result (159).RHSs.Set_First_Last (0, 0);
+ Result (159).RHSs (0).In_Parse_Action := null;
+ Result (159).RHSs (0).Post_Parse_Action :=
constrained_array_definition_0'Access;
+ Result (163).RHSs.Set_First_Last (0, 1);
+ Result (163).RHSs (0).In_Parse_Action := null;
+ Result (163).RHSs (0).Post_Parse_Action := discrete_range_0'Access;
+ Result (163).RHSs (1).In_Parse_Action := null;
+ Result (163).RHSs (1).Post_Parse_Action := discrete_range_1'Access;
+ Result (166).Optimized_List := True;
+ Result (167).RHSs.Set_First_Last (0, 0);
+ Result (167).RHSs (0).In_Parse_Action := null;
+ Result (167).RHSs (0).Post_Parse_Action :=
known_discriminant_part_0'Access;
+ Result (168).RHSs.Set_First_Last (0, 5);
+ Result (168).RHSs (0).In_Parse_Action := null;
+ Result (168).RHSs (0).Post_Parse_Action :=
discriminant_specification_0'Access;
+ Result (168).RHSs (1).In_Parse_Action := null;
+ Result (168).RHSs (1).Post_Parse_Action :=
discriminant_specification_1'Access;
+ Result (168).RHSs (2).In_Parse_Action := null;
+ Result (168).RHSs (2).Post_Parse_Action :=
discriminant_specification_2'Access;
+ Result (168).RHSs (3).In_Parse_Action := null;
+ Result (168).RHSs (3).Post_Parse_Action :=
discriminant_specification_3'Access;
+ Result (168).RHSs (4).In_Parse_Action := null;
+ Result (168).RHSs (4).Post_Parse_Action :=
discriminant_specification_4'Access;
+ Result (168).RHSs (5).In_Parse_Action := null;
+ Result (168).RHSs (5).Post_Parse_Action :=
discriminant_specification_5'Access;
+ Result (170).RHSs.Set_First_Last (0, 2);
+ Result (170).RHSs (0).In_Parse_Action := null;
+ Result (170).RHSs (0).Post_Parse_Action := record_definition_0'Access;
+ Result (170).RHSs (1).In_Parse_Action := null;
+ Result (170).RHSs (1).Post_Parse_Action := record_definition_1'Access;
+ Result (170).RHSs (2).In_Parse_Action := null;
+ Result (170).RHSs (2).Post_Parse_Action := null;
+ Result (171).RHSs.Set_First_Last (0, 3);
+ Result (171).RHSs (0).In_Parse_Action := null;
+ Result (171).RHSs (0).Post_Parse_Action := null;
+ Result (171).RHSs (1).In_Parse_Action := null;
+ Result (171).RHSs (1).Post_Parse_Action := null;
+ Result (171).RHSs (2).In_Parse_Action := null;
+ Result (171).RHSs (2).Post_Parse_Action := null;
+ Result (171).RHSs (3).In_Parse_Action := null;
+ Result (171).RHSs (3).Post_Parse_Action := component_list_3'Access;
+ Result (173).RHSs.Set_First_Last (0, 3);
+ Result (173).RHSs (0).In_Parse_Action := null;
+ Result (173).RHSs (0).Post_Parse_Action :=
component_declaration_0'Access;
+ Result (173).RHSs (1).In_Parse_Action := null;
+ Result (173).RHSs (1).Post_Parse_Action :=
component_declaration_1'Access;
+ Result (173).RHSs (2).In_Parse_Action := null;
+ Result (173).RHSs (2).Post_Parse_Action :=
component_declaration_2'Access;
+ Result (173).RHSs (3).In_Parse_Action := null;
+ Result (173).RHSs (3).Post_Parse_Action :=
component_declaration_3'Access;
+ Result (174).RHSs.Set_First_Last (0, 1);
+ Result (174).RHSs (0).In_Parse_Action := null;
+ Result (174).RHSs (0).Post_Parse_Action := null;
+ Result (174).RHSs (1).In_Parse_Action := null;
+ Result (174).RHSs (1).Post_Parse_Action := variant_list_1'Access;
+ Result (175).RHSs.Set_First_Last (0, 0);
+ Result (175).RHSs (0).In_Parse_Action := null;
+ Result (175).RHSs (0).Post_Parse_Action := variant_part_0'Access;
+ Result (176).RHSs.Set_First_Last (0, 0);
+ Result (176).RHSs (0).In_Parse_Action := null;
+ Result (176).RHSs (0).Post_Parse_Action := variant_0'Access;
+ Result (178).RHSs.Set_First_Last (0, 3);
+ Result (178).RHSs (0).In_Parse_Action := null;
+ Result (178).RHSs (0).Post_Parse_Action := discrete_choice_0'Access;
+ Result (178).RHSs (1).In_Parse_Action := null;
+ Result (178).RHSs (1).Post_Parse_Action := discrete_choice_1'Access;
+ Result (178).RHSs (2).In_Parse_Action := null;
+ Result (178).RHSs (2).Post_Parse_Action := discrete_choice_2'Access;
+ Result (178).RHSs (3).In_Parse_Action := null;
+ Result (178).RHSs (3).Post_Parse_Action := null;
+ Result (179).RHSs.Set_First_Last (0, 0);
+ Result (179).RHSs (0).In_Parse_Action := null;
+ Result (179).RHSs (0).Post_Parse_Action :=
record_extension_part_0'Access;
+ Result (180).RHSs.Set_First_Last (0, 3);
+ Result (180).RHSs (0).In_Parse_Action := null;
+ Result (180).RHSs (0).Post_Parse_Action :=
abstract_subprogram_declaration_0'Access;
+ Result (180).RHSs (1).In_Parse_Action := null;
+ Result (180).RHSs (1).Post_Parse_Action :=
abstract_subprogram_declaration_1'Access;
+ Result (180).RHSs (2).In_Parse_Action := null;
+ Result (180).RHSs (2).Post_Parse_Action :=
abstract_subprogram_declaration_2'Access;
+ Result (180).RHSs (3).In_Parse_Action := null;
+ Result (180).RHSs (3).Post_Parse_Action :=
abstract_subprogram_declaration_3'Access;
+ Result (182).RHSs.Set_First_Last (0, 1);
+ Result (182).RHSs (0).In_Parse_Action := null;
+ Result (182).RHSs (0).Post_Parse_Action := interface_list_0'Access;
+ Result (182).RHSs (1).In_Parse_Action := null;
+ Result (182).RHSs (1).Post_Parse_Action := interface_list_1'Access;
+ Result (186).RHSs.Set_First_Last (0, 1);
+ Result (186).RHSs (0).In_Parse_Action := null;
+ Result (186).RHSs (0).Post_Parse_Action :=
access_to_subprogram_definition_0'Access;
+ Result (186).RHSs (1).In_Parse_Action := null;
+ Result (186).RHSs (1).Post_Parse_Action :=
access_to_subprogram_definition_1'Access;
+ Result (188).RHSs.Set_First_Last (0, 11);
+ Result (188).RHSs (0).In_Parse_Action := null;
+ Result (188).RHSs (0).Post_Parse_Action := access_definition_0'Access;
+ Result (188).RHSs (1).In_Parse_Action := null;
+ Result (188).RHSs (1).Post_Parse_Action := access_definition_1'Access;
+ Result (188).RHSs (2).In_Parse_Action := null;
+ Result (188).RHSs (2).Post_Parse_Action := access_definition_2'Access;
+ Result (188).RHSs (3).In_Parse_Action := null;
+ Result (188).RHSs (3).Post_Parse_Action := access_definition_3'Access;
+ Result (188).RHSs (4).In_Parse_Action := null;
+ Result (188).RHSs (4).Post_Parse_Action := access_definition_4'Access;
+ Result (188).RHSs (5).In_Parse_Action := null;
+ Result (188).RHSs (5).Post_Parse_Action := access_definition_5'Access;
+ Result (188).RHSs (6).In_Parse_Action := null;
+ Result (188).RHSs (6).Post_Parse_Action := access_definition_6'Access;
+ Result (188).RHSs (7).In_Parse_Action := null;
+ Result (188).RHSs (7).Post_Parse_Action := access_definition_7'Access;
+ Result (188).RHSs (8).In_Parse_Action := null;
+ Result (188).RHSs (8).Post_Parse_Action := access_definition_8'Access;
+ Result (188).RHSs (9).In_Parse_Action := null;
+ Result (188).RHSs (9).Post_Parse_Action := access_definition_9'Access;
+ Result (188).RHSs (10).In_Parse_Action := null;
+ Result (188).RHSs (10).Post_Parse_Action :=
access_definition_10'Access;
+ Result (188).RHSs (11).In_Parse_Action := null;
+ Result (188).RHSs (11).Post_Parse_Action :=
access_definition_11'Access;
+ Result (189).RHSs.Set_First_Last (0, 3);
+ Result (189).RHSs (0).In_Parse_Action := null;
+ Result (189).RHSs (0).Post_Parse_Action :=
incomplete_type_declaration_0'Access;
+ Result (189).RHSs (1).In_Parse_Action := null;
+ Result (189).RHSs (1).Post_Parse_Action :=
incomplete_type_declaration_1'Access;
+ Result (189).RHSs (2).In_Parse_Action := null;
+ Result (189).RHSs (2).Post_Parse_Action :=
incomplete_type_declaration_2'Access;
+ Result (189).RHSs (3).In_Parse_Action := null;
+ Result (189).RHSs (3).Post_Parse_Action :=
incomplete_type_declaration_3'Access;
+ Result (195).RHSs.Set_First_Last (0, 8);
+ Result (195).RHSs (0).In_Parse_Action := name_0_check'Access;
+ Result (195).RHSs (0).Post_Parse_Action := null;
+ Result (195).RHSs (1).In_Parse_Action := null;
+ Result (195).RHSs (1).Post_Parse_Action := null;
+ Result (195).RHSs (2).In_Parse_Action := null;
+ Result (195).RHSs (2).Post_Parse_Action := null;
+ Result (195).RHSs (3).In_Parse_Action := name_3_check'Access;
+ Result (195).RHSs (3).Post_Parse_Action := null;
+ Result (195).RHSs (4).In_Parse_Action := null;
+ Result (195).RHSs (4).Post_Parse_Action := null;
+ Result (195).RHSs (5).In_Parse_Action := null;
+ Result (195).RHSs (5).Post_Parse_Action := null;
+ Result (195).RHSs (6).In_Parse_Action := null;
+ Result (195).RHSs (6).Post_Parse_Action := null;
+ Result (195).RHSs (7).In_Parse_Action := null;
+ Result (195).RHSs (7).Post_Parse_Action := null;
+ Result (195).RHSs (8).In_Parse_Action := null;
+ Result (195).RHSs (8).Post_Parse_Action := null;
+ Result (196).RHSs.Set_First_Last (0, 1);
+ Result (196).RHSs (0).In_Parse_Action := direct_name_0_check'Access;
+ Result (196).RHSs (0).Post_Parse_Action := direct_name_0'Access;
+ Result (196).RHSs (1).In_Parse_Action := direct_name_1_check'Access;
+ Result (196).RHSs (1).Post_Parse_Action := null;
+ Result (198).RHSs.Set_First_Last (0, 0);
+ Result (198).RHSs (0).In_Parse_Action := null;
+ Result (198).RHSs (0).Post_Parse_Action := slice_0'Access;
+ Result (199).RHSs.Set_First_Last (0, 0);
+ Result (199).RHSs (0).In_Parse_Action :=
selected_component_0_check'Access;
+ Result (199).RHSs (0).Post_Parse_Action :=
selected_component_0'Access;
+ Result (204).RHSs.Set_First_Last (0, 1);
+ Result (204).RHSs (0).In_Parse_Action := null;
+ Result (204).RHSs (0).Post_Parse_Action :=
range_attribute_designator_0'Access;
+ Result (204).RHSs (1).In_Parse_Action := null;
+ Result (204).RHSs (1).Post_Parse_Action :=
range_attribute_designator_1'Access;
+ Result (205).RHSs.Set_First_Last (0, 6);
+ Result (205).RHSs (0).In_Parse_Action := null;
+ Result (205).RHSs (0).Post_Parse_Action := null;
+ Result (205).RHSs (1).In_Parse_Action := null;
+ Result (205).RHSs (1).Post_Parse_Action := null;
+ Result (205).RHSs (2).In_Parse_Action := null;
+ Result (205).RHSs (2).Post_Parse_Action := null;
+ Result (205).RHSs (3).In_Parse_Action := null;
+ Result (205).RHSs (3).Post_Parse_Action := null;
+ Result (205).RHSs (4).In_Parse_Action := null;
+ Result (205).RHSs (4).Post_Parse_Action := aggregate_4'Access;
+ Result (205).RHSs (5).In_Parse_Action := null;
+ Result (205).RHSs (5).Post_Parse_Action := aggregate_5'Access;
+ Result (205).RHSs (6).In_Parse_Action := null;
+ Result (205).RHSs (6).Post_Parse_Action := aggregate_6'Access;
+ Result (206).RHSs.Set_First_Last (0, 0);
+ Result (206).RHSs (0).In_Parse_Action := null;
+ Result (206).RHSs (0).Post_Parse_Action := record_aggregate_0'Access;
+ Result (208).RHSs.Set_First_Last (0, 1);
+ Result (208).RHSs (0).In_Parse_Action := null;
+ Result (208).RHSs (0).Post_Parse_Action :=
record_component_association_0'Access;
+ Result (208).RHSs (1).In_Parse_Action := null;
+ Result (208).RHSs (1).Post_Parse_Action :=
record_component_association_1'Access;
+ Result (209).RHSs.Set_First_Last (0, 1);
+ Result (209).RHSs (0).In_Parse_Action := null;
+ Result (209).RHSs (0).Post_Parse_Action := null;
+ Result (209).RHSs (1).In_Parse_Action := null;
+ Result (209).RHSs (1).Post_Parse_Action :=
component_choice_list_1'Access;
+ Result (210).RHSs.Set_First_Last (0, 0);
+ Result (210).RHSs (0).In_Parse_Action := null;
+ Result (210).RHSs (0).Post_Parse_Action :=
extension_aggregate_0'Access;
+ Result (212).RHSs.Set_First_Last (0, 1);
+ Result (212).RHSs (0).In_Parse_Action := null;
+ Result (212).RHSs (0).Post_Parse_Action := expression_list_0'Access;
+ Result (212).RHSs (1).In_Parse_Action := null;
+ Result (212).RHSs (1).Post_Parse_Action := expression_list_1'Access;
+ Result (213).RHSs.Set_First_Last (0, 3);
+ Result (213).RHSs (0).In_Parse_Action := null;
+ Result (213).RHSs (0).Post_Parse_Action :=
positional_array_aggregate_0'Access;
+ Result (213).RHSs (1).In_Parse_Action := null;
+ Result (213).RHSs (1).Post_Parse_Action :=
positional_array_aggregate_1'Access;
+ Result (213).RHSs (2).In_Parse_Action := null;
+ Result (213).RHSs (2).Post_Parse_Action :=
positional_array_aggregate_2'Access;
+ Result (213).RHSs (3).In_Parse_Action := null;
+ Result (213).RHSs (3).Post_Parse_Action :=
positional_array_aggregate_3'Access;
+ Result (215).RHSs.Set_First_Last (0, 1);
+ Result (215).RHSs (0).In_Parse_Action := null;
+ Result (215).RHSs (0).Post_Parse_Action :=
named_array_aggregate_0'Access;
+ Result (215).RHSs (1).In_Parse_Action := null;
+ Result (215).RHSs (1).Post_Parse_Action :=
named_array_aggregate_1'Access;
+ Result (216).Optimized_List := True;
+ Result (217).RHSs.Set_First_Last (0, 1);
+ Result (217).RHSs (0).In_Parse_Action := null;
+ Result (217).RHSs (0).Post_Parse_Action :=
array_component_association_0'Access;
+ Result (217).RHSs (1).In_Parse_Action := null;
+ Result (217).RHSs (1).Post_Parse_Action := null;
+ Result (219).RHSs.Set_First_Last (0, 0);
+ Result (219).RHSs (0).In_Parse_Action := null;
+ Result (219).RHSs (0).Post_Parse_Action :=
record_delta_aggregate_0'Access;
+ Result (220).RHSs.Set_First_Last (0, 1);
+ Result (220).RHSs (0).In_Parse_Action := null;
+ Result (220).RHSs (0).Post_Parse_Action :=
array_delta_aggregate_0'Access;
+ Result (220).RHSs (1).In_Parse_Action := null;
+ Result (220).RHSs (1).Post_Parse_Action :=
array_delta_aggregate_1'Access;
+ Result (221).RHSs.Set_First_Last (0, 3);
+ Result (221).RHSs (0).In_Parse_Action := null;
+ Result (221).RHSs (0).Post_Parse_Action :=
iterated_element_association_0'Access;
+ Result (221).RHSs (1).In_Parse_Action := null;
+ Result (221).RHSs (1).Post_Parse_Action :=
iterated_element_association_1'Access;
+ Result (221).RHSs (2).In_Parse_Action := null;
+ Result (221).RHSs (2).Post_Parse_Action :=
iterated_element_association_2'Access;
+ Result (221).RHSs (3).In_Parse_Action := null;
+ Result (221).RHSs (3).Post_Parse_Action :=
iterated_element_association_3'Access;
+ Result (229).Optimized_List := True;
+ Result (230).RHSs.Set_First_Last (0, 1);
+ Result (230).RHSs (0).In_Parse_Action := null;
+ Result (230).RHSs (0).Post_Parse_Action := membership_choice_0'Access;
+ Result (230).RHSs (1).In_Parse_Action := null;
+ Result (230).RHSs (1).Post_Parse_Action := membership_choice_1'Access;
+ Result (232).Optimized_List := True;
+ Result (234).RHSs.Set_First_Last (0, 4);
+ Result (234).RHSs (0).In_Parse_Action := null;
+ Result (234).RHSs (0).Post_Parse_Action := primary_0'Access;
+ Result (234).RHSs (1).In_Parse_Action := null;
+ Result (234).RHSs (1).Post_Parse_Action := null;
+ Result (234).RHSs (2).In_Parse_Action := null;
+ Result (234).RHSs (2).Post_Parse_Action := primary_2'Access;
+ Result (234).RHSs (3).In_Parse_Action := null;
+ Result (234).RHSs (3).Post_Parse_Action := null;
+ Result (234).RHSs (4).In_Parse_Action := null;
+ Result (234).RHSs (4).Post_Parse_Action := null;
+ Result (240).RHSs.Set_First_Last (0, 0);
+ Result (240).RHSs (0).In_Parse_Action := null;
+ Result (240).RHSs (0).Post_Parse_Action :=
elsif_expression_item_0'Access;
+ Result (241).RHSs.Set_First_Last (0, 1);
+ Result (241).RHSs (0).In_Parse_Action := null;
+ Result (241).RHSs (0).Post_Parse_Action := null;
+ Result (241).RHSs (1).In_Parse_Action := null;
+ Result (241).RHSs (1).Post_Parse_Action :=
elsif_expression_list_1'Access;
+ Result (242).RHSs.Set_First_Last (0, 3);
+ Result (242).RHSs (0).In_Parse_Action := null;
+ Result (242).RHSs (0).Post_Parse_Action := if_expression_0'Access;
+ Result (242).RHSs (1).In_Parse_Action := null;
+ Result (242).RHSs (1).Post_Parse_Action := if_expression_1'Access;
+ Result (242).RHSs (2).In_Parse_Action := null;
+ Result (242).RHSs (2).Post_Parse_Action := if_expression_2'Access;
+ Result (242).RHSs (3).In_Parse_Action := null;
+ Result (242).RHSs (3).Post_Parse_Action := if_expression_3'Access;
+ Result (244).RHSs.Set_First_Last (0, 1);
+ Result (244).RHSs (0).In_Parse_Action := null;
+ Result (244).RHSs (0).Post_Parse_Action := null;
+ Result (244).RHSs (1).In_Parse_Action := null;
+ Result (244).RHSs (1).Post_Parse_Action :=
case_expression_alternative_list_1'Access;
+ Result (245).RHSs.Set_First_Last (0, 0);
+ Result (245).RHSs (0).In_Parse_Action := null;
+ Result (245).RHSs (0).Post_Parse_Action := case_expression_0'Access;
+ Result (246).RHSs.Set_First_Last (0, 0);
+ Result (246).RHSs (0).In_Parse_Action := null;
+ Result (246).RHSs (0).Post_Parse_Action :=
case_expression_alternative_0'Access;
+ Result (247).RHSs.Set_First_Last (0, 1);
+ Result (247).RHSs (0).In_Parse_Action := null;
+ Result (247).RHSs (0).Post_Parse_Action :=
quantified_expression_0'Access;
+ Result (247).RHSs (1).In_Parse_Action := null;
+ Result (247).RHSs (1).Post_Parse_Action :=
quantified_expression_1'Access;
+ Result (249).RHSs.Set_First_Last (0, 1);
+ Result (249).RHSs (0).In_Parse_Action := null;
+ Result (249).RHSs (0).Post_Parse_Action :=
declare_expression_0'Access;
+ Result (249).RHSs (1).In_Parse_Action := null;
+ Result (249).RHSs (1).Post_Parse_Action :=
declare_expression_1'Access;
+ Result (254).RHSs.Set_First_Last (0, 0);
+ Result (254).RHSs (0).In_Parse_Action := null;
+ Result (254).RHSs (0).Post_Parse_Action :=
reduction_specification_0'Access;
+ Result (255).RHSs.Set_First_Last (0, 0);
+ Result (255).RHSs (0).In_Parse_Action := null;
+ Result (255).RHSs (0).Post_Parse_Action :=
qualified_expression_0'Access;
+ Result (257).RHSs.Set_First_Last (0, 3);
+ Result (257).RHSs (0).In_Parse_Action := null;
+ Result (257).RHSs (0).Post_Parse_Action := null;
+ Result (257).RHSs (1).In_Parse_Action := null;
+ Result (257).RHSs (1).Post_Parse_Action := null;
+ Result (257).RHSs (2).In_Parse_Action := null;
+ Result (257).RHSs (2).Post_Parse_Action :=
subtype_indication_paren_constraint_2'Access;
+ Result (257).RHSs (3).In_Parse_Action := null;
+ Result (257).RHSs (3).Post_Parse_Action :=
subtype_indication_paren_constraint_3'Access;
+ Result (264).RHSs.Set_First_Last (0, 0);
+ Result (264).RHSs (0).In_Parse_Action := null;
+ Result (264).RHSs (0).Post_Parse_Action := null_statement_0'Access;
+ Result (265).RHSs.Set_First_Last (0, 0);
+ Result (265).RHSs (0).In_Parse_Action := null;
+ Result (265).RHSs (0).Post_Parse_Action := label_0'Access;
+ Result (267).RHSs.Set_First_Last (0, 0);
+ Result (267).RHSs (0).In_Parse_Action := null;
+ Result (267).RHSs (0).Post_Parse_Action :=
assignment_statement_0'Access;
+ Result (269).RHSs.Set_First_Last (0, 0);
+ Result (269).RHSs (0).In_Parse_Action := null;
+ Result (269).RHSs (0).Post_Parse_Action :=
elsif_statement_item_0'Access;
+ Result (271).RHSs.Set_First_Last (0, 3);
+ Result (271).RHSs (0).In_Parse_Action := null;
+ Result (271).RHSs (0).Post_Parse_Action := if_statement_0'Access;
+ Result (271).RHSs (1).In_Parse_Action := null;
+ Result (271).RHSs (1).Post_Parse_Action := if_statement_1'Access;
+ Result (271).RHSs (2).In_Parse_Action := null;
+ Result (271).RHSs (2).Post_Parse_Action := if_statement_2'Access;
+ Result (271).RHSs (3).In_Parse_Action := null;
+ Result (271).RHSs (3).Post_Parse_Action := if_statement_3'Access;
+ Result (273).RHSs.Set_First_Last (0, 0);
+ Result (273).RHSs (0).In_Parse_Action := null;
+ Result (273).RHSs (0).Post_Parse_Action := case_statement_0'Access;
+ Result (274).RHSs.Set_First_Last (0, 0);
+ Result (274).RHSs (0).In_Parse_Action := null;
+ Result (274).RHSs (0).Post_Parse_Action :=
case_statement_alternative_0'Access;
+ Result (275).RHSs.Set_First_Last (0, 1);
+ Result (275).RHSs (0).In_Parse_Action :=
loop_statement_0_check'Access;
+ Result (275).RHSs (0).Post_Parse_Action := loop_statement_0'Access;
+ Result (275).RHSs (1).In_Parse_Action :=
loop_statement_1_check'Access;
+ Result (275).RHSs (1).Post_Parse_Action := loop_statement_1'Access;
+ Result (276).RHSs.Set_First_Last (0, 8);
+ Result (276).RHSs (0).In_Parse_Action := null;
+ Result (276).RHSs (0).Post_Parse_Action := iteration_scheme_0'Access;
+ Result (276).RHSs (1).In_Parse_Action := null;
+ Result (276).RHSs (1).Post_Parse_Action := iteration_scheme_1'Access;
+ Result (276).RHSs (2).In_Parse_Action := null;
+ Result (276).RHSs (2).Post_Parse_Action := iteration_scheme_2'Access;
+ Result (276).RHSs (3).In_Parse_Action := null;
+ Result (276).RHSs (3).Post_Parse_Action := iteration_scheme_3'Access;
+ Result (276).RHSs (4).In_Parse_Action := null;
+ Result (276).RHSs (4).Post_Parse_Action := iteration_scheme_4'Access;
+ Result (276).RHSs (5).In_Parse_Action := null;
+ Result (276).RHSs (5).Post_Parse_Action := iteration_scheme_5'Access;
+ Result (276).RHSs (6).In_Parse_Action := null;
+ Result (276).RHSs (6).Post_Parse_Action := iteration_scheme_6'Access;
+ Result (276).RHSs (7).In_Parse_Action := null;
+ Result (276).RHSs (7).Post_Parse_Action := iteration_scheme_7'Access;
+ Result (276).RHSs (8).In_Parse_Action := null;
+ Result (276).RHSs (8).Post_Parse_Action := iteration_scheme_8'Access;
+ Result (277).RHSs.Set_First_Last (0, 1);
+ Result (277).RHSs (0).In_Parse_Action := null;
+ Result (277).RHSs (0).Post_Parse_Action :=
chunk_specification_0'Access;
+ Result (277).RHSs (1).In_Parse_Action := null;
+ Result (277).RHSs (1).Post_Parse_Action :=
chunk_specification_1'Access;
+ Result (285).RHSs.Set_First_Last (0, 1);
+ Result (285).RHSs (0).In_Parse_Action := label_opt_0_check'Access;
+ Result (285).RHSs (0).Post_Parse_Action := null;
+ Result (285).RHSs (1).In_Parse_Action := null;
+ Result (285).RHSs (1).Post_Parse_Action := null;
+ Result (286).RHSs.Set_First_Last (0, 1);
+ Result (286).RHSs (0).In_Parse_Action :=
block_statement_0_check'Access;
+ Result (286).RHSs (0).Post_Parse_Action := block_statement_0'Access;
+ Result (286).RHSs (1).In_Parse_Action :=
block_statement_1_check'Access;
+ Result (286).RHSs (1).Post_Parse_Action := block_statement_1'Access;
+ Result (287).RHSs.Set_First_Last (0, 1);
+ Result (287).RHSs (0).In_Parse_Action := null;
+ Result (287).RHSs (0).Post_Parse_Action := null;
+ Result (287).RHSs (1).In_Parse_Action := null;
+ Result (287).RHSs (1).Post_Parse_Action :=
statement_AND_list_1'Access;
+ Result (288).RHSs.Set_First_Last (0, 0);
+ Result (288).RHSs (0).In_Parse_Action := null;
+ Result (288).RHSs (0).Post_Parse_Action :=
parallel_block_statement_0'Access;
+ Result (289).RHSs.Set_First_Last (0, 3);
+ Result (289).RHSs (0).In_Parse_Action := null;
+ Result (289).RHSs (0).Post_Parse_Action := exit_statement_0'Access;
+ Result (289).RHSs (1).In_Parse_Action := null;
+ Result (289).RHSs (1).Post_Parse_Action := exit_statement_1'Access;
+ Result (289).RHSs (2).In_Parse_Action := null;
+ Result (289).RHSs (2).Post_Parse_Action := exit_statement_2'Access;
+ Result (289).RHSs (3).In_Parse_Action := null;
+ Result (289).RHSs (3).Post_Parse_Action := exit_statement_3'Access;
+ Result (290).RHSs.Set_First_Last (0, 0);
+ Result (290).RHSs (0).In_Parse_Action := null;
+ Result (290).RHSs (0).Post_Parse_Action := goto_statement_0'Access;
+ Result (291).RHSs.Set_First_Last (0, 3);
+ Result (291).RHSs (0).In_Parse_Action := null;
+ Result (291).RHSs (0).Post_Parse_Action :=
subprogram_declaration_0'Access;
+ Result (291).RHSs (1).In_Parse_Action := null;
+ Result (291).RHSs (1).Post_Parse_Action :=
subprogram_declaration_1'Access;
+ Result (291).RHSs (2).In_Parse_Action := null;
+ Result (291).RHSs (2).Post_Parse_Action :=
subprogram_declaration_2'Access;
+ Result (291).RHSs (3).In_Parse_Action := null;
+ Result (291).RHSs (3).Post_Parse_Action :=
subprogram_declaration_3'Access;
+ Result (292).RHSs.Set_First_Last (0, 1);
+ Result (292).RHSs (0).In_Parse_Action :=
subprogram_specification_0_check'Access;
+ Result (292).RHSs (0).Post_Parse_Action := null;
+ Result (292).RHSs (1).In_Parse_Action :=
subprogram_specification_1_check'Access;
+ Result (292).RHSs (1).Post_Parse_Action := null;
+ Result (293).RHSs.Set_First_Last (0, 0);
+ Result (293).RHSs (0).In_Parse_Action :=
procedure_specification_0_check'Access;
+ Result (293).RHSs (0).Post_Parse_Action :=
procedure_specification_0'Access;
+ Result (294).RHSs.Set_First_Last (0, 0);
+ Result (294).RHSs (0).In_Parse_Action :=
function_specification_0_check'Access;
+ Result (294).RHSs (0).Post_Parse_Action :=
function_specification_0'Access;
+ Result (296).RHSs.Set_First_Last (0, 2);
+ Result (296).RHSs (0).In_Parse_Action := null;
+ Result (296).RHSs (0).Post_Parse_Action := result_profile_0'Access;
+ Result (296).RHSs (1).In_Parse_Action := null;
+ Result (296).RHSs (1).Post_Parse_Action := result_profile_1'Access;
+ Result (296).RHSs (2).In_Parse_Action := null;
+ Result (296).RHSs (2).Post_Parse_Action := result_profile_2'Access;
+ Result (297).RHSs.Set_First_Last (0, 1);
+ Result (297).RHSs (0).In_Parse_Action := null;
+ Result (297).RHSs (0).Post_Parse_Action :=
parameter_and_result_profile_0'Access;
+ Result (297).RHSs (1).In_Parse_Action := null;
+ Result (297).RHSs (1).Post_Parse_Action := null;
+ Result (298).Optimized_List := True;
+ Result (299).RHSs.Set_First_Last (0, 0);
+ Result (299).RHSs (0).In_Parse_Action := null;
+ Result (299).RHSs (0).Post_Parse_Action := formal_part_0'Access;
+ Result (300).RHSs.Set_First_Last (0, 9);
+ Result (300).RHSs (0).In_Parse_Action := null;
+ Result (300).RHSs (0).Post_Parse_Action :=
parameter_specification_0'Access;
+ Result (300).RHSs (1).In_Parse_Action := null;
+ Result (300).RHSs (1).Post_Parse_Action :=
parameter_specification_1'Access;
+ Result (300).RHSs (2).In_Parse_Action := null;
+ Result (300).RHSs (2).Post_Parse_Action :=
parameter_specification_2'Access;
+ Result (300).RHSs (3).In_Parse_Action := null;
+ Result (300).RHSs (3).Post_Parse_Action :=
parameter_specification_3'Access;
+ Result (300).RHSs (4).In_Parse_Action := null;
+ Result (300).RHSs (4).Post_Parse_Action :=
parameter_specification_4'Access;
+ Result (300).RHSs (5).In_Parse_Action := null;
+ Result (300).RHSs (5).Post_Parse_Action :=
parameter_specification_5'Access;
+ Result (300).RHSs (6).In_Parse_Action := null;
+ Result (300).RHSs (6).Post_Parse_Action :=
parameter_specification_6'Access;
+ Result (300).RHSs (7).In_Parse_Action := null;
+ Result (300).RHSs (7).Post_Parse_Action :=
parameter_specification_7'Access;
+ Result (300).RHSs (8).In_Parse_Action := null;
+ Result (300).RHSs (8).Post_Parse_Action :=
parameter_specification_8'Access;
+ Result (300).RHSs (9).In_Parse_Action := null;
+ Result (300).RHSs (9).Post_Parse_Action :=
parameter_specification_9'Access;
+ Result (306).Optimized_List := True;
+ Result (308).RHSs.Set_First_Last (0, 1);
+ Result (308).RHSs (0).In_Parse_Action := name_opt_0_check'Access;
+ Result (308).RHSs (0).Post_Parse_Action := null;
+ Result (308).RHSs (1).In_Parse_Action := null;
+ Result (308).RHSs (1).Post_Parse_Action := null;
+ Result (309).RHSs.Set_First_Last (0, 3);
+ Result (309).RHSs (0).In_Parse_Action :=
subprogram_body_0_check'Access;
+ Result (309).RHSs (0).Post_Parse_Action := subprogram_body_0'Access;
+ Result (309).RHSs (1).In_Parse_Action :=
subprogram_body_1_check'Access;
+ Result (309).RHSs (1).Post_Parse_Action := subprogram_body_1'Access;
+ Result (309).RHSs (2).In_Parse_Action :=
subprogram_body_2_check'Access;
+ Result (309).RHSs (2).Post_Parse_Action := subprogram_body_2'Access;
+ Result (309).RHSs (3).In_Parse_Action :=
subprogram_body_3_check'Access;
+ Result (309).RHSs (3).Post_Parse_Action := subprogram_body_3'Access;
+ Result (310).RHSs.Set_First_Last (0, 0);
+ Result (310).RHSs (0).In_Parse_Action := null;
+ Result (310).RHSs (0).Post_Parse_Action :=
procedure_call_statement_0'Access;
+ Result (311).RHSs.Set_First_Last (0, 0);
+ Result (311).RHSs (0).In_Parse_Action := null;
+ Result (311).RHSs (0).Post_Parse_Action := function_call_0'Access;
+ Result (313).RHSs.Set_First_Last (0, 3);
+ Result (313).RHSs (0).In_Parse_Action := null;
+ Result (313).RHSs (0).Post_Parse_Action :=
actual_parameter_part_0'Access;
+ Result (313).RHSs (1).In_Parse_Action := null;
+ Result (313).RHSs (1).Post_Parse_Action :=
actual_parameter_part_1'Access;
+ Result (313).RHSs (2).In_Parse_Action := null;
+ Result (313).RHSs (2).Post_Parse_Action :=
actual_parameter_part_2'Access;
+ Result (313).RHSs (3).In_Parse_Action := null;
+ Result (313).RHSs (3).Post_Parse_Action :=
actual_parameter_part_3'Access;
+ Result (314).RHSs.Set_First_Last (0, 1);
+ Result (314).RHSs (0).In_Parse_Action := null;
+ Result (314).RHSs (0).Post_Parse_Action := assoc_expression_0'Access;
+ Result (314).RHSs (1).In_Parse_Action := null;
+ Result (314).RHSs (1).Post_Parse_Action := null;
+ Result (315).RHSs.Set_First_Last (0, 2);
+ Result (315).RHSs (0).In_Parse_Action := null;
+ Result (315).RHSs (0).Post_Parse_Action :=
parameter_association_0'Access;
+ Result (315).RHSs (1).In_Parse_Action := null;
+ Result (315).RHSs (1).Post_Parse_Action :=
parameter_association_1'Access;
+ Result (315).RHSs (2).In_Parse_Action := null;
+ Result (315).RHSs (2).Post_Parse_Action := null;
+ Result (316).RHSs.Set_First_Last (0, 1);
+ Result (316).RHSs (0).In_Parse_Action := null;
+ Result (316).RHSs (0).Post_Parse_Action :=
simple_return_statement_0'Access;
+ Result (316).RHSs (1).In_Parse_Action := null;
+ Result (316).RHSs (1).Post_Parse_Action :=
simple_return_statement_1'Access;
+ Result (317).RHSs.Set_First_Last (0, 7);
+ Result (317).RHSs (0).In_Parse_Action := null;
+ Result (317).RHSs (0).Post_Parse_Action :=
extended_return_object_declaration_0'Access;
+ Result (317).RHSs (1).In_Parse_Action := null;
+ Result (317).RHSs (1).Post_Parse_Action :=
extended_return_object_declaration_1'Access;
+ Result (317).RHSs (2).In_Parse_Action := null;
+ Result (317).RHSs (2).Post_Parse_Action :=
extended_return_object_declaration_2'Access;
+ Result (317).RHSs (3).In_Parse_Action := null;
+ Result (317).RHSs (3).Post_Parse_Action :=
extended_return_object_declaration_3'Access;
+ Result (317).RHSs (4).In_Parse_Action := null;
+ Result (317).RHSs (4).Post_Parse_Action :=
extended_return_object_declaration_4'Access;
+ Result (317).RHSs (5).In_Parse_Action := null;
+ Result (317).RHSs (5).Post_Parse_Action :=
extended_return_object_declaration_5'Access;
+ Result (317).RHSs (6).In_Parse_Action := null;
+ Result (317).RHSs (6).Post_Parse_Action :=
extended_return_object_declaration_6'Access;
+ Result (317).RHSs (7).In_Parse_Action := null;
+ Result (317).RHSs (7).Post_Parse_Action :=
extended_return_object_declaration_7'Access;
+ Result (318).RHSs.Set_First_Last (0, 1);
+ Result (318).RHSs (0).In_Parse_Action := null;
+ Result (318).RHSs (0).Post_Parse_Action :=
extended_return_statement_0'Access;
+ Result (318).RHSs (1).In_Parse_Action := null;
+ Result (318).RHSs (1).Post_Parse_Action :=
extended_return_statement_1'Access;
+ Result (320).RHSs.Set_First_Last (0, 3);
+ Result (320).RHSs (0).In_Parse_Action := null;
+ Result (320).RHSs (0).Post_Parse_Action :=
null_procedure_declaration_0'Access;
+ Result (320).RHSs (1).In_Parse_Action := null;
+ Result (320).RHSs (1).Post_Parse_Action :=
null_procedure_declaration_1'Access;
+ Result (320).RHSs (2).In_Parse_Action := null;
+ Result (320).RHSs (2).Post_Parse_Action :=
null_procedure_declaration_2'Access;
+ Result (320).RHSs (3).In_Parse_Action := null;
+ Result (320).RHSs (3).Post_Parse_Action :=
null_procedure_declaration_3'Access;
+ Result (321).RHSs.Set_First_Last (0, 3);
+ Result (321).RHSs (0).In_Parse_Action := null;
+ Result (321).RHSs (0).Post_Parse_Action :=
expression_function_declaration_0'Access;
+ Result (321).RHSs (1).In_Parse_Action := null;
+ Result (321).RHSs (1).Post_Parse_Action :=
expression_function_declaration_1'Access;
+ Result (321).RHSs (2).In_Parse_Action := null;
+ Result (321).RHSs (2).Post_Parse_Action :=
expression_function_declaration_2'Access;
+ Result (321).RHSs (3).In_Parse_Action := null;
+ Result (321).RHSs (3).Post_Parse_Action :=
expression_function_declaration_3'Access;
+ Result (322).RHSs.Set_First_Last (0, 0);
+ Result (322).RHSs (0).In_Parse_Action := null;
+ Result (322).RHSs (0).Post_Parse_Action :=
package_declaration_0'Access;
+ Result (324).Optimized_List := True;
+ Result (325).RHSs.Set_First_Last (0, 11);
+ Result (325).RHSs (0).In_Parse_Action :=
package_specification_0_check'Access;
+ Result (325).RHSs (0).Post_Parse_Action :=
package_specification_0'Access;
+ Result (325).RHSs (1).In_Parse_Action :=
package_specification_1_check'Access;
+ Result (325).RHSs (1).Post_Parse_Action :=
package_specification_1'Access;
+ Result (325).RHSs (2).In_Parse_Action :=
package_specification_2_check'Access;
+ Result (325).RHSs (2).Post_Parse_Action :=
package_specification_2'Access;
+ Result (325).RHSs (3).In_Parse_Action :=
package_specification_3_check'Access;
+ Result (325).RHSs (3).Post_Parse_Action :=
package_specification_3'Access;
+ Result (325).RHSs (4).In_Parse_Action :=
package_specification_4_check'Access;
+ Result (325).RHSs (4).Post_Parse_Action :=
package_specification_4'Access;
+ Result (325).RHSs (5).In_Parse_Action :=
package_specification_5_check'Access;
+ Result (325).RHSs (5).Post_Parse_Action :=
package_specification_5'Access;
+ Result (325).RHSs (6).In_Parse_Action :=
package_specification_6_check'Access;
+ Result (325).RHSs (6).Post_Parse_Action :=
package_specification_6'Access;
+ Result (325).RHSs (7).In_Parse_Action :=
package_specification_7_check'Access;
+ Result (325).RHSs (7).Post_Parse_Action :=
package_specification_7'Access;
+ Result (325).RHSs (8).In_Parse_Action :=
package_specification_8_check'Access;
+ Result (325).RHSs (8).Post_Parse_Action :=
package_specification_8'Access;
+ Result (325).RHSs (9).In_Parse_Action :=
package_specification_9_check'Access;
+ Result (325).RHSs (9).Post_Parse_Action :=
package_specification_9'Access;
+ Result (325).RHSs (10).In_Parse_Action :=
package_specification_10_check'Access;
+ Result (325).RHSs (10).Post_Parse_Action :=
package_specification_10'Access;
+ Result (325).RHSs (11).In_Parse_Action :=
package_specification_11_check'Access;
+ Result (325).RHSs (11).Post_Parse_Action :=
package_specification_11'Access;
+ Result (326).RHSs.Set_First_Last (0, 3);
+ Result (326).RHSs (0).In_Parse_Action := package_body_0_check'Access;
+ Result (326).RHSs (0).Post_Parse_Action := package_body_0'Access;
+ Result (326).RHSs (1).In_Parse_Action := package_body_1_check'Access;
+ Result (326).RHSs (1).Post_Parse_Action := package_body_1'Access;
+ Result (326).RHSs (2).In_Parse_Action := package_body_2_check'Access;
+ Result (326).RHSs (2).Post_Parse_Action := package_body_2'Access;
+ Result (326).RHSs (3).In_Parse_Action := package_body_3_check'Access;
+ Result (326).RHSs (3).Post_Parse_Action := package_body_3'Access;
+ Result (327).RHSs.Set_First_Last (0, 23);
+ Result (327).RHSs (0).In_Parse_Action := null;
+ Result (327).RHSs (0).Post_Parse_Action :=
private_type_declaration_0'Access;
+ Result (327).RHSs (1).In_Parse_Action := null;
+ Result (327).RHSs (1).Post_Parse_Action :=
private_type_declaration_1'Access;
+ Result (327).RHSs (2).In_Parse_Action := null;
+ Result (327).RHSs (2).Post_Parse_Action :=
private_type_declaration_2'Access;
+ Result (327).RHSs (3).In_Parse_Action := null;
+ Result (327).RHSs (3).Post_Parse_Action :=
private_type_declaration_3'Access;
+ Result (327).RHSs (4).In_Parse_Action := null;
+ Result (327).RHSs (4).Post_Parse_Action :=
private_type_declaration_4'Access;
+ Result (327).RHSs (5).In_Parse_Action := null;
+ Result (327).RHSs (5).Post_Parse_Action :=
private_type_declaration_5'Access;
+ Result (327).RHSs (6).In_Parse_Action := null;
+ Result (327).RHSs (6).Post_Parse_Action :=
private_type_declaration_6'Access;
+ Result (327).RHSs (7).In_Parse_Action := null;
+ Result (327).RHSs (7).Post_Parse_Action :=
private_type_declaration_7'Access;
+ Result (327).RHSs (8).In_Parse_Action := null;
+ Result (327).RHSs (8).Post_Parse_Action :=
private_type_declaration_8'Access;
+ Result (327).RHSs (9).In_Parse_Action := null;
+ Result (327).RHSs (9).Post_Parse_Action :=
private_type_declaration_9'Access;
+ Result (327).RHSs (10).In_Parse_Action := null;
+ Result (327).RHSs (10).Post_Parse_Action :=
private_type_declaration_10'Access;
+ Result (327).RHSs (11).In_Parse_Action := null;
+ Result (327).RHSs (11).Post_Parse_Action :=
private_type_declaration_11'Access;
+ Result (327).RHSs (12).In_Parse_Action := null;
+ Result (327).RHSs (12).Post_Parse_Action :=
private_type_declaration_12'Access;
+ Result (327).RHSs (13).In_Parse_Action := null;
+ Result (327).RHSs (13).Post_Parse_Action :=
private_type_declaration_13'Access;
+ Result (327).RHSs (14).In_Parse_Action := null;
+ Result (327).RHSs (14).Post_Parse_Action :=
private_type_declaration_14'Access;
+ Result (327).RHSs (15).In_Parse_Action := null;
+ Result (327).RHSs (15).Post_Parse_Action :=
private_type_declaration_15'Access;
+ Result (327).RHSs (16).In_Parse_Action := null;
+ Result (327).RHSs (16).Post_Parse_Action :=
private_type_declaration_16'Access;
+ Result (327).RHSs (17).In_Parse_Action := null;
+ Result (327).RHSs (17).Post_Parse_Action :=
private_type_declaration_17'Access;
+ Result (327).RHSs (18).In_Parse_Action := null;
+ Result (327).RHSs (18).Post_Parse_Action :=
private_type_declaration_18'Access;
+ Result (327).RHSs (19).In_Parse_Action := null;
+ Result (327).RHSs (19).Post_Parse_Action :=
private_type_declaration_19'Access;
+ Result (327).RHSs (20).In_Parse_Action := null;
+ Result (327).RHSs (20).Post_Parse_Action :=
private_type_declaration_20'Access;
+ Result (327).RHSs (21).In_Parse_Action := null;
+ Result (327).RHSs (21).Post_Parse_Action :=
private_type_declaration_21'Access;
+ Result (327).RHSs (22).In_Parse_Action := null;
+ Result (327).RHSs (22).Post_Parse_Action :=
private_type_declaration_22'Access;
+ Result (327).RHSs (23).In_Parse_Action := null;
+ Result (327).RHSs (23).Post_Parse_Action :=
private_type_declaration_23'Access;
+ Result (328).RHSs.Set_First_Last (0, 47);
+ Result (328).RHSs (0).In_Parse_Action := null;
+ Result (328).RHSs (0).Post_Parse_Action :=
private_extension_declaration_0'Access;
+ Result (328).RHSs (1).In_Parse_Action := null;
+ Result (328).RHSs (1).Post_Parse_Action :=
private_extension_declaration_1'Access;
+ Result (328).RHSs (2).In_Parse_Action := null;
+ Result (328).RHSs (2).Post_Parse_Action :=
private_extension_declaration_2'Access;
+ Result (328).RHSs (3).In_Parse_Action := null;
+ Result (328).RHSs (3).Post_Parse_Action :=
private_extension_declaration_3'Access;
+ Result (328).RHSs (4).In_Parse_Action := null;
+ Result (328).RHSs (4).Post_Parse_Action :=
private_extension_declaration_4'Access;
+ Result (328).RHSs (5).In_Parse_Action := null;
+ Result (328).RHSs (5).Post_Parse_Action :=
private_extension_declaration_5'Access;
+ Result (328).RHSs (6).In_Parse_Action := null;
+ Result (328).RHSs (6).Post_Parse_Action :=
private_extension_declaration_6'Access;
+ Result (328).RHSs (7).In_Parse_Action := null;
+ Result (328).RHSs (7).Post_Parse_Action :=
private_extension_declaration_7'Access;
+ Result (328).RHSs (8).In_Parse_Action := null;
+ Result (328).RHSs (8).Post_Parse_Action :=
private_extension_declaration_8'Access;
+ Result (328).RHSs (9).In_Parse_Action := null;
+ Result (328).RHSs (9).Post_Parse_Action :=
private_extension_declaration_9'Access;
+ Result (328).RHSs (10).In_Parse_Action := null;
+ Result (328).RHSs (10).Post_Parse_Action :=
private_extension_declaration_10'Access;
+ Result (328).RHSs (11).In_Parse_Action := null;
+ Result (328).RHSs (11).Post_Parse_Action :=
private_extension_declaration_11'Access;
+ Result (328).RHSs (12).In_Parse_Action := null;
+ Result (328).RHSs (12).Post_Parse_Action :=
private_extension_declaration_12'Access;
+ Result (328).RHSs (13).In_Parse_Action := null;
+ Result (328).RHSs (13).Post_Parse_Action :=
private_extension_declaration_13'Access;
+ Result (328).RHSs (14).In_Parse_Action := null;
+ Result (328).RHSs (14).Post_Parse_Action :=
private_extension_declaration_14'Access;
+ Result (328).RHSs (15).In_Parse_Action := null;
+ Result (328).RHSs (15).Post_Parse_Action :=
private_extension_declaration_15'Access;
+ Result (328).RHSs (16).In_Parse_Action := null;
+ Result (328).RHSs (16).Post_Parse_Action :=
private_extension_declaration_16'Access;
+ Result (328).RHSs (17).In_Parse_Action := null;
+ Result (328).RHSs (17).Post_Parse_Action :=
private_extension_declaration_17'Access;
+ Result (328).RHSs (18).In_Parse_Action := null;
+ Result (328).RHSs (18).Post_Parse_Action :=
private_extension_declaration_18'Access;
+ Result (328).RHSs (19).In_Parse_Action := null;
+ Result (328).RHSs (19).Post_Parse_Action :=
private_extension_declaration_19'Access;
+ Result (328).RHSs (20).In_Parse_Action := null;
+ Result (328).RHSs (20).Post_Parse_Action :=
private_extension_declaration_20'Access;
+ Result (328).RHSs (21).In_Parse_Action := null;
+ Result (328).RHSs (21).Post_Parse_Action :=
private_extension_declaration_21'Access;
+ Result (328).RHSs (22).In_Parse_Action := null;
+ Result (328).RHSs (22).Post_Parse_Action :=
private_extension_declaration_22'Access;
+ Result (328).RHSs (23).In_Parse_Action := null;
+ Result (328).RHSs (23).Post_Parse_Action :=
private_extension_declaration_23'Access;
+ Result (328).RHSs (24).In_Parse_Action := null;
+ Result (328).RHSs (24).Post_Parse_Action :=
private_extension_declaration_24'Access;
+ Result (328).RHSs (25).In_Parse_Action := null;
+ Result (328).RHSs (25).Post_Parse_Action :=
private_extension_declaration_25'Access;
+ Result (328).RHSs (26).In_Parse_Action := null;
+ Result (328).RHSs (26).Post_Parse_Action :=
private_extension_declaration_26'Access;
+ Result (328).RHSs (27).In_Parse_Action := null;
+ Result (328).RHSs (27).Post_Parse_Action :=
private_extension_declaration_27'Access;
+ Result (328).RHSs (28).In_Parse_Action := null;
+ Result (328).RHSs (28).Post_Parse_Action :=
private_extension_declaration_28'Access;
+ Result (328).RHSs (29).In_Parse_Action := null;
+ Result (328).RHSs (29).Post_Parse_Action :=
private_extension_declaration_29'Access;
+ Result (328).RHSs (30).In_Parse_Action := null;
+ Result (328).RHSs (30).Post_Parse_Action :=
private_extension_declaration_30'Access;
+ Result (328).RHSs (31).In_Parse_Action := null;
+ Result (328).RHSs (31).Post_Parse_Action :=
private_extension_declaration_31'Access;
+ Result (328).RHSs (32).In_Parse_Action := null;
+ Result (328).RHSs (32).Post_Parse_Action :=
private_extension_declaration_32'Access;
+ Result (328).RHSs (33).In_Parse_Action := null;
+ Result (328).RHSs (33).Post_Parse_Action :=
private_extension_declaration_33'Access;
+ Result (328).RHSs (34).In_Parse_Action := null;
+ Result (328).RHSs (34).Post_Parse_Action :=
private_extension_declaration_34'Access;
+ Result (328).RHSs (35).In_Parse_Action := null;
+ Result (328).RHSs (35).Post_Parse_Action :=
private_extension_declaration_35'Access;
+ Result (328).RHSs (36).In_Parse_Action := null;
+ Result (328).RHSs (36).Post_Parse_Action :=
private_extension_declaration_36'Access;
+ Result (328).RHSs (37).In_Parse_Action := null;
+ Result (328).RHSs (37).Post_Parse_Action :=
private_extension_declaration_37'Access;
+ Result (328).RHSs (38).In_Parse_Action := null;
+ Result (328).RHSs (38).Post_Parse_Action :=
private_extension_declaration_38'Access;
+ Result (328).RHSs (39).In_Parse_Action := null;
+ Result (328).RHSs (39).Post_Parse_Action :=
private_extension_declaration_39'Access;
+ Result (328).RHSs (40).In_Parse_Action := null;
+ Result (328).RHSs (40).Post_Parse_Action :=
private_extension_declaration_40'Access;
+ Result (328).RHSs (41).In_Parse_Action := null;
+ Result (328).RHSs (41).Post_Parse_Action :=
private_extension_declaration_41'Access;
+ Result (328).RHSs (42).In_Parse_Action := null;
+ Result (328).RHSs (42).Post_Parse_Action :=
private_extension_declaration_42'Access;
+ Result (328).RHSs (43).In_Parse_Action := null;
+ Result (328).RHSs (43).Post_Parse_Action :=
private_extension_declaration_43'Access;
+ Result (328).RHSs (44).In_Parse_Action := null;
+ Result (328).RHSs (44).Post_Parse_Action :=
private_extension_declaration_44'Access;
+ Result (328).RHSs (45).In_Parse_Action := null;
+ Result (328).RHSs (45).Post_Parse_Action :=
private_extension_declaration_45'Access;
+ Result (328).RHSs (46).In_Parse_Action := null;
+ Result (328).RHSs (46).Post_Parse_Action :=
private_extension_declaration_46'Access;
+ Result (328).RHSs (47).In_Parse_Action := null;
+ Result (328).RHSs (47).Post_Parse_Action :=
private_extension_declaration_47'Access;
+ Result (329).RHSs.Set_First_Last (0, 1);
+ Result (329).RHSs (0).In_Parse_Action := null;
+ Result (329).RHSs (0).Post_Parse_Action :=
overriding_indicator_0'Access;
+ Result (329).RHSs (1).In_Parse_Action := null;
+ Result (329).RHSs (1).Post_Parse_Action :=
overriding_indicator_1'Access;
+ Result (332).RHSs.Set_First_Last (0, 0);
+ Result (332).RHSs (0).In_Parse_Action := null;
+ Result (332).RHSs (0).Post_Parse_Action :=
use_package_clause_0'Access;
+ Result (333).RHSs.Set_First_Last (0, 1);
+ Result (333).RHSs (0).In_Parse_Action := null;
+ Result (333).RHSs (0).Post_Parse_Action := use_type_clause_0'Access;
+ Result (333).RHSs (1).In_Parse_Action := null;
+ Result (333).RHSs (1).Post_Parse_Action := use_type_clause_1'Access;
+ Result (335).RHSs.Set_First_Last (0, 7);
+ Result (335).RHSs (0).In_Parse_Action := null;
+ Result (335).RHSs (0).Post_Parse_Action :=
object_renaming_declaration_0'Access;
+ Result (335).RHSs (1).In_Parse_Action := null;
+ Result (335).RHSs (1).Post_Parse_Action :=
object_renaming_declaration_1'Access;
+ Result (335).RHSs (2).In_Parse_Action := null;
+ Result (335).RHSs (2).Post_Parse_Action :=
object_renaming_declaration_2'Access;
+ Result (335).RHSs (3).In_Parse_Action := null;
+ Result (335).RHSs (3).Post_Parse_Action :=
object_renaming_declaration_3'Access;
+ Result (335).RHSs (4).In_Parse_Action := null;
+ Result (335).RHSs (4).Post_Parse_Action :=
object_renaming_declaration_4'Access;
+ Result (335).RHSs (5).In_Parse_Action := null;
+ Result (335).RHSs (5).Post_Parse_Action :=
object_renaming_declaration_5'Access;
+ Result (335).RHSs (6).In_Parse_Action := null;
+ Result (335).RHSs (6).Post_Parse_Action :=
object_renaming_declaration_6'Access;
+ Result (335).RHSs (7).In_Parse_Action := null;
+ Result (335).RHSs (7).Post_Parse_Action :=
object_renaming_declaration_7'Access;
+ Result (336).RHSs.Set_First_Last (0, 1);
+ Result (336).RHSs (0).In_Parse_Action := null;
+ Result (336).RHSs (0).Post_Parse_Action :=
exception_renaming_declaration_0'Access;
+ Result (336).RHSs (1).In_Parse_Action := null;
+ Result (336).RHSs (1).Post_Parse_Action :=
exception_renaming_declaration_1'Access;
+ Result (337).RHSs.Set_First_Last (0, 1);
+ Result (337).RHSs (0).In_Parse_Action := null;
+ Result (337).RHSs (0).Post_Parse_Action :=
package_renaming_declaration_0'Access;
+ Result (337).RHSs (1).In_Parse_Action := null;
+ Result (337).RHSs (1).Post_Parse_Action :=
package_renaming_declaration_1'Access;
+ Result (338).RHSs.Set_First_Last (0, 3);
+ Result (338).RHSs (0).In_Parse_Action := null;
+ Result (338).RHSs (0).Post_Parse_Action :=
subprogram_renaming_declaration_0'Access;
+ Result (338).RHSs (1).In_Parse_Action := null;
+ Result (338).RHSs (1).Post_Parse_Action :=
subprogram_renaming_declaration_1'Access;
+ Result (338).RHSs (2).In_Parse_Action := null;
+ Result (338).RHSs (2).Post_Parse_Action :=
subprogram_renaming_declaration_2'Access;
+ Result (338).RHSs (3).In_Parse_Action := null;
+ Result (338).RHSs (3).Post_Parse_Action :=
subprogram_renaming_declaration_3'Access;
+ Result (339).RHSs.Set_First_Last (0, 5);
+ Result (339).RHSs (0).In_Parse_Action := null;
+ Result (339).RHSs (0).Post_Parse_Action :=
generic_renaming_declaration_0'Access;
+ Result (339).RHSs (1).In_Parse_Action := null;
+ Result (339).RHSs (1).Post_Parse_Action :=
generic_renaming_declaration_1'Access;
+ Result (339).RHSs (2).In_Parse_Action := null;
+ Result (339).RHSs (2).Post_Parse_Action :=
generic_renaming_declaration_2'Access;
+ Result (339).RHSs (3).In_Parse_Action := null;
+ Result (339).RHSs (3).Post_Parse_Action :=
generic_renaming_declaration_3'Access;
+ Result (339).RHSs (4).In_Parse_Action := null;
+ Result (339).RHSs (4).Post_Parse_Action :=
generic_renaming_declaration_4'Access;
+ Result (339).RHSs (5).In_Parse_Action := null;
+ Result (339).RHSs (5).Post_Parse_Action :=
generic_renaming_declaration_5'Access;
+ Result (340).RHSs.Set_First_Last (0, 11);
+ Result (340).RHSs (0).In_Parse_Action :=
task_type_declaration_0_check'Access;
+ Result (340).RHSs (0).Post_Parse_Action :=
task_type_declaration_0'Access;
+ Result (340).RHSs (1).In_Parse_Action :=
task_type_declaration_1_check'Access;
+ Result (340).RHSs (1).Post_Parse_Action :=
task_type_declaration_1'Access;
+ Result (340).RHSs (2).In_Parse_Action := null;
+ Result (340).RHSs (2).Post_Parse_Action :=
task_type_declaration_2'Access;
+ Result (340).RHSs (3).In_Parse_Action :=
task_type_declaration_3_check'Access;
+ Result (340).RHSs (3).Post_Parse_Action :=
task_type_declaration_3'Access;
+ Result (340).RHSs (4).In_Parse_Action :=
task_type_declaration_4_check'Access;
+ Result (340).RHSs (4).Post_Parse_Action :=
task_type_declaration_4'Access;
+ Result (340).RHSs (5).In_Parse_Action := null;
+ Result (340).RHSs (5).Post_Parse_Action :=
task_type_declaration_5'Access;
+ Result (340).RHSs (6).In_Parse_Action :=
task_type_declaration_6_check'Access;
+ Result (340).RHSs (6).Post_Parse_Action :=
task_type_declaration_6'Access;
+ Result (340).RHSs (7).In_Parse_Action :=
task_type_declaration_7_check'Access;
+ Result (340).RHSs (7).Post_Parse_Action :=
task_type_declaration_7'Access;
+ Result (340).RHSs (8).In_Parse_Action := null;
+ Result (340).RHSs (8).Post_Parse_Action :=
task_type_declaration_8'Access;
+ Result (340).RHSs (9).In_Parse_Action :=
task_type_declaration_9_check'Access;
+ Result (340).RHSs (9).Post_Parse_Action :=
task_type_declaration_9'Access;
+ Result (340).RHSs (10).In_Parse_Action :=
task_type_declaration_10_check'Access;
+ Result (340).RHSs (10).Post_Parse_Action :=
task_type_declaration_10'Access;
+ Result (340).RHSs (11).In_Parse_Action := null;
+ Result (340).RHSs (11).Post_Parse_Action :=
task_type_declaration_11'Access;
+ Result (341).RHSs.Set_First_Last (0, 5);
+ Result (341).RHSs (0).In_Parse_Action :=
single_task_declaration_0_check'Access;
+ Result (341).RHSs (0).Post_Parse_Action :=
single_task_declaration_0'Access;
+ Result (341).RHSs (1).In_Parse_Action :=
single_task_declaration_1_check'Access;
+ Result (341).RHSs (1).Post_Parse_Action :=
single_task_declaration_1'Access;
+ Result (341).RHSs (2).In_Parse_Action := null;
+ Result (341).RHSs (2).Post_Parse_Action :=
single_task_declaration_2'Access;
+ Result (341).RHSs (3).In_Parse_Action :=
single_task_declaration_3_check'Access;
+ Result (341).RHSs (3).Post_Parse_Action :=
single_task_declaration_3'Access;
+ Result (341).RHSs (4).In_Parse_Action :=
single_task_declaration_4_check'Access;
+ Result (341).RHSs (4).Post_Parse_Action :=
single_task_declaration_4'Access;
+ Result (341).RHSs (5).In_Parse_Action := null;
+ Result (341).RHSs (5).Post_Parse_Action :=
single_task_declaration_5'Access;
+ Result (343).RHSs.Set_First_Last (0, 1);
+ Result (343).RHSs (0).In_Parse_Action :=
task_definition_0_check'Access;
+ Result (343).RHSs (0).Post_Parse_Action := task_definition_0'Access;
+ Result (343).RHSs (1).In_Parse_Action :=
task_definition_1_check'Access;
+ Result (343).RHSs (1).Post_Parse_Action := task_definition_1'Access;
+ Result (345).RHSs.Set_First_Last (0, 1);
+ Result (345).RHSs (0).In_Parse_Action := task_body_0_check'Access;
+ Result (345).RHSs (0).Post_Parse_Action := task_body_0'Access;
+ Result (345).RHSs (1).In_Parse_Action := task_body_1_check'Access;
+ Result (345).RHSs (1).Post_Parse_Action := task_body_1'Access;
+ Result (346).RHSs.Set_First_Last (0, 7);
+ Result (346).RHSs (0).In_Parse_Action :=
protected_type_declaration_0_check'Access;
+ Result (346).RHSs (0).Post_Parse_Action :=
protected_type_declaration_0'Access;
+ Result (346).RHSs (1).In_Parse_Action :=
protected_type_declaration_1_check'Access;
+ Result (346).RHSs (1).Post_Parse_Action :=
protected_type_declaration_1'Access;
+ Result (346).RHSs (2).In_Parse_Action :=
protected_type_declaration_2_check'Access;
+ Result (346).RHSs (2).Post_Parse_Action :=
protected_type_declaration_2'Access;
+ Result (346).RHSs (3).In_Parse_Action :=
protected_type_declaration_3_check'Access;
+ Result (346).RHSs (3).Post_Parse_Action :=
protected_type_declaration_3'Access;
+ Result (346).RHSs (4).In_Parse_Action :=
protected_type_declaration_4_check'Access;
+ Result (346).RHSs (4).Post_Parse_Action :=
protected_type_declaration_4'Access;
+ Result (346).RHSs (5).In_Parse_Action :=
protected_type_declaration_5_check'Access;
+ Result (346).RHSs (5).Post_Parse_Action :=
protected_type_declaration_5'Access;
+ Result (346).RHSs (6).In_Parse_Action :=
protected_type_declaration_6_check'Access;
+ Result (346).RHSs (6).Post_Parse_Action :=
protected_type_declaration_6'Access;
+ Result (346).RHSs (7).In_Parse_Action :=
protected_type_declaration_7_check'Access;
+ Result (346).RHSs (7).Post_Parse_Action :=
protected_type_declaration_7'Access;
+ Result (347).RHSs.Set_First_Last (0, 3);
+ Result (347).RHSs (0).In_Parse_Action :=
single_protected_declaration_0_check'Access;
+ Result (347).RHSs (0).Post_Parse_Action :=
single_protected_declaration_0'Access;
+ Result (347).RHSs (1).In_Parse_Action :=
single_protected_declaration_1_check'Access;
+ Result (347).RHSs (1).Post_Parse_Action :=
single_protected_declaration_1'Access;
+ Result (347).RHSs (2).In_Parse_Action :=
single_protected_declaration_2_check'Access;
+ Result (347).RHSs (2).Post_Parse_Action :=
single_protected_declaration_2'Access;
+ Result (347).RHSs (3).In_Parse_Action :=
single_protected_declaration_3_check'Access;
+ Result (347).RHSs (3).Post_Parse_Action :=
single_protected_declaration_3'Access;
+ Result (350).RHSs.Set_First_Last (0, 11);
+ Result (350).RHSs (0).In_Parse_Action :=
protected_definition_0_check'Access;
+ Result (350).RHSs (0).Post_Parse_Action :=
protected_definition_0'Access;
+ Result (350).RHSs (1).In_Parse_Action := null;
+ Result (350).RHSs (1).Post_Parse_Action :=
protected_definition_1'Access;
+ Result (350).RHSs (2).In_Parse_Action :=
protected_definition_2_check'Access;
+ Result (350).RHSs (2).Post_Parse_Action :=
protected_definition_2'Access;
+ Result (350).RHSs (3).In_Parse_Action := null;
+ Result (350).RHSs (3).Post_Parse_Action :=
protected_definition_3'Access;
+ Result (350).RHSs (4).In_Parse_Action :=
protected_definition_4_check'Access;
+ Result (350).RHSs (4).Post_Parse_Action :=
protected_definition_4'Access;
+ Result (350).RHSs (5).In_Parse_Action := null;
+ Result (350).RHSs (5).Post_Parse_Action :=
protected_definition_5'Access;
+ Result (350).RHSs (6).In_Parse_Action :=
protected_definition_6_check'Access;
+ Result (350).RHSs (6).Post_Parse_Action :=
protected_definition_6'Access;
+ Result (350).RHSs (7).In_Parse_Action := null;
+ Result (350).RHSs (7).Post_Parse_Action :=
protected_definition_7'Access;
+ Result (350).RHSs (8).In_Parse_Action :=
protected_definition_8_check'Access;
+ Result (350).RHSs (8).Post_Parse_Action :=
protected_definition_8'Access;
+ Result (350).RHSs (9).In_Parse_Action := null;
+ Result (350).RHSs (9).Post_Parse_Action :=
protected_definition_9'Access;
+ Result (350).RHSs (10).In_Parse_Action :=
protected_definition_10_check'Access;
+ Result (350).RHSs (10).Post_Parse_Action :=
protected_definition_10'Access;
+ Result (350).RHSs (11).In_Parse_Action := null;
+ Result (350).RHSs (11).Post_Parse_Action :=
protected_definition_11'Access;
+ Result (354).RHSs.Set_First_Last (0, 3);
+ Result (354).RHSs (0).In_Parse_Action :=
protected_body_0_check'Access;
+ Result (354).RHSs (0).Post_Parse_Action := protected_body_0'Access;
+ Result (354).RHSs (1).In_Parse_Action :=
protected_body_1_check'Access;
+ Result (354).RHSs (1).Post_Parse_Action := protected_body_1'Access;
+ Result (354).RHSs (2).In_Parse_Action :=
protected_body_2_check'Access;
+ Result (354).RHSs (2).Post_Parse_Action := protected_body_2'Access;
+ Result (354).RHSs (3).In_Parse_Action :=
protected_body_3_check'Access;
+ Result (354).RHSs (3).Post_Parse_Action := protected_body_3'Access;
+ Result (356).RHSs.Set_First_Last (0, 7);
+ Result (356).RHSs (0).In_Parse_Action := null;
+ Result (356).RHSs (0).Post_Parse_Action := entry_declaration_0'Access;
+ Result (356).RHSs (1).In_Parse_Action := null;
+ Result (356).RHSs (1).Post_Parse_Action := entry_declaration_1'Access;
+ Result (356).RHSs (2).In_Parse_Action := null;
+ Result (356).RHSs (2).Post_Parse_Action := entry_declaration_2'Access;
+ Result (356).RHSs (3).In_Parse_Action := null;
+ Result (356).RHSs (3).Post_Parse_Action := entry_declaration_3'Access;
+ Result (356).RHSs (4).In_Parse_Action := null;
+ Result (356).RHSs (4).Post_Parse_Action := entry_declaration_4'Access;
+ Result (356).RHSs (5).In_Parse_Action := null;
+ Result (356).RHSs (5).Post_Parse_Action := entry_declaration_5'Access;
+ Result (356).RHSs (6).In_Parse_Action := null;
+ Result (356).RHSs (6).Post_Parse_Action := entry_declaration_6'Access;
+ Result (356).RHSs (7).In_Parse_Action := null;
+ Result (356).RHSs (7).Post_Parse_Action := entry_declaration_7'Access;
+ Result (357).RHSs.Set_First_Last (0, 3);
+ Result (357).RHSs (0).In_Parse_Action :=
accept_statement_0_check'Access;
+ Result (357).RHSs (0).Post_Parse_Action := accept_statement_0'Access;
+ Result (357).RHSs (1).In_Parse_Action := null;
+ Result (357).RHSs (1).Post_Parse_Action := accept_statement_1'Access;
+ Result (357).RHSs (2).In_Parse_Action :=
accept_statement_2_check'Access;
+ Result (357).RHSs (2).Post_Parse_Action := accept_statement_2'Access;
+ Result (357).RHSs (3).In_Parse_Action := null;
+ Result (357).RHSs (3).Post_Parse_Action := accept_statement_3'Access;
+ Result (359).RHSs.Set_First_Last (0, 1);
+ Result (359).RHSs (0).In_Parse_Action := entry_body_0_check'Access;
+ Result (359).RHSs (0).Post_Parse_Action := entry_body_0'Access;
+ Result (359).RHSs (1).In_Parse_Action := entry_body_1_check'Access;
+ Result (359).RHSs (1).Post_Parse_Action := entry_body_1'Access;
+ Result (360).RHSs.Set_First_Last (0, 1);
+ Result (360).RHSs (0).In_Parse_Action := null;
+ Result (360).RHSs (0).Post_Parse_Action :=
entry_body_formal_part_0'Access;
+ Result (360).RHSs (1).In_Parse_Action := null;
+ Result (360).RHSs (1).Post_Parse_Action :=
entry_body_formal_part_1'Access;
+ Result (361).RHSs.Set_First_Last (0, 0);
+ Result (361).RHSs (0).In_Parse_Action := null;
+ Result (361).RHSs (0).Post_Parse_Action := entry_barrier_0'Access;
+ Result (363).RHSs.Set_First_Last (0, 1);
+ Result (363).RHSs (0).In_Parse_Action := null;
+ Result (363).RHSs (0).Post_Parse_Action := requeue_statement_0'Access;
+ Result (363).RHSs (1).In_Parse_Action := null;
+ Result (363).RHSs (1).Post_Parse_Action := requeue_statement_1'Access;
+ Result (365).RHSs.Set_First_Last (0, 0);
+ Result (365).RHSs (0).In_Parse_Action := null;
+ Result (365).RHSs (0).Post_Parse_Action :=
delay_until_statement_0'Access;
+ Result (366).RHSs.Set_First_Last (0, 0);
+ Result (366).RHSs (0).In_Parse_Action := null;
+ Result (366).RHSs (0).Post_Parse_Action :=
delay_relative_statement_0'Access;
+ Result (368).RHSs.Set_First_Last (0, 1);
+ Result (368).RHSs (0).In_Parse_Action := null;
+ Result (368).RHSs (0).Post_Parse_Action := guard_select_0'Access;
+ Result (368).RHSs (1).In_Parse_Action := null;
+ Result (368).RHSs (1).Post_Parse_Action := null;
+ Result (369).RHSs.Set_First_Last (0, 1);
+ Result (369).RHSs (0).In_Parse_Action := null;
+ Result (369).RHSs (0).Post_Parse_Action := null;
+ Result (369).RHSs (1).In_Parse_Action := null;
+ Result (369).RHSs (1).Post_Parse_Action :=
select_alternative_list_1'Access;
+ Result (370).RHSs.Set_First_Last (0, 1);
+ Result (370).RHSs (0).In_Parse_Action := null;
+ Result (370).RHSs (0).Post_Parse_Action := selective_accept_0'Access;
+ Result (370).RHSs (1).In_Parse_Action := null;
+ Result (370).RHSs (1).Post_Parse_Action := selective_accept_1'Access;
+ Result (371).RHSs.Set_First_Last (0, 0);
+ Result (371).RHSs (0).In_Parse_Action := null;
+ Result (371).RHSs (0).Post_Parse_Action := guard_0'Access;
+ Result (375).RHSs.Set_First_Last (0, 0);
+ Result (375).RHSs (0).In_Parse_Action := null;
+ Result (375).RHSs (0).Post_Parse_Action :=
terminate_alternative_0'Access;
+ Result (376).RHSs.Set_First_Last (0, 0);
+ Result (376).RHSs (0).In_Parse_Action := null;
+ Result (376).RHSs (0).Post_Parse_Action := timed_entry_call_0'Access;
+ Result (378).RHSs.Set_First_Last (0, 0);
+ Result (378).RHSs (0).In_Parse_Action := null;
+ Result (378).RHSs (0).Post_Parse_Action :=
conditional_entry_call_0'Access;
+ Result (379).RHSs.Set_First_Last (0, 0);
+ Result (379).RHSs (0).In_Parse_Action := null;
+ Result (379).RHSs (0).Post_Parse_Action :=
asynchronous_select_0'Access;
+ Result (382).RHSs.Set_First_Last (0, 0);
+ Result (382).RHSs (0).In_Parse_Action := null;
+ Result (382).RHSs (0).Post_Parse_Action := abort_statement_0'Access;
+ Result (383).RHSs.Set_First_Last (0, 1);
+ Result (383).RHSs (0).In_Parse_Action := compilation_0_check'Access;
+ Result (383).RHSs (0).Post_Parse_Action := compilation_0'Access;
+ Result (383).RHSs (1).In_Parse_Action := null;
+ Result (383).RHSs (1).Post_Parse_Action := compilation_1'Access;
+ Result (384).RHSs.Set_First_Last (0, 5);
+ Result (384).RHSs (0).In_Parse_Action := null;
+ Result (384).RHSs (0).Post_Parse_Action := null;
+ Result (384).RHSs (1).In_Parse_Action := null;
+ Result (384).RHSs (1).Post_Parse_Action := compilation_unit_1'Access;
+ Result (384).RHSs (2).In_Parse_Action := null;
+ Result (384).RHSs (2).Post_Parse_Action := compilation_unit_2'Access;
+ Result (384).RHSs (3).In_Parse_Action := null;
+ Result (384).RHSs (3).Post_Parse_Action := null;
+ Result (384).RHSs (4).In_Parse_Action := null;
+ Result (384).RHSs (4).Post_Parse_Action := null;
+ Result (384).RHSs (5).In_Parse_Action := null;
+ Result (384).RHSs (5).Post_Parse_Action := null;
+ Result (386).RHSs.Set_First_Last (0, 1);
+ Result (386).RHSs (0).In_Parse_Action := null;
+ Result (386).RHSs (0).Post_Parse_Action :=
limited_with_clause_0'Access;
+ Result (386).RHSs (1).In_Parse_Action := null;
+ Result (386).RHSs (1).Post_Parse_Action :=
limited_with_clause_1'Access;
+ Result (387).RHSs.Set_First_Last (0, 1);
+ Result (387).RHSs (0).In_Parse_Action := null;
+ Result (387).RHSs (0).Post_Parse_Action :=
nonlimited_with_clause_0'Access;
+ Result (387).RHSs (1).In_Parse_Action := null;
+ Result (387).RHSs (1).Post_Parse_Action :=
nonlimited_with_clause_1'Access;
+ Result (389).RHSs.Set_First_Last (0, 3);
+ Result (389).RHSs (0).In_Parse_Action := null;
+ Result (389).RHSs (0).Post_Parse_Action :=
subprogram_body_stub_0'Access;
+ Result (389).RHSs (1).In_Parse_Action := null;
+ Result (389).RHSs (1).Post_Parse_Action :=
subprogram_body_stub_1'Access;
+ Result (389).RHSs (2).In_Parse_Action := null;
+ Result (389).RHSs (2).Post_Parse_Action :=
subprogram_body_stub_2'Access;
+ Result (389).RHSs (3).In_Parse_Action := null;
+ Result (389).RHSs (3).Post_Parse_Action :=
subprogram_body_stub_3'Access;
+ Result (390).RHSs.Set_First_Last (0, 1);
+ Result (390).RHSs (0).In_Parse_Action := null;
+ Result (390).RHSs (0).Post_Parse_Action := package_body_stub_0'Access;
+ Result (390).RHSs (1).In_Parse_Action := null;
+ Result (390).RHSs (1).Post_Parse_Action := package_body_stub_1'Access;
+ Result (391).RHSs.Set_First_Last (0, 1);
+ Result (391).RHSs (0).In_Parse_Action := null;
+ Result (391).RHSs (0).Post_Parse_Action := task_body_stub_0'Access;
+ Result (391).RHSs (1).In_Parse_Action := null;
+ Result (391).RHSs (1).Post_Parse_Action := task_body_stub_1'Access;
+ Result (392).RHSs.Set_First_Last (0, 1);
+ Result (392).RHSs (0).In_Parse_Action := null;
+ Result (392).RHSs (0).Post_Parse_Action :=
protected_body_stub_0'Access;
+ Result (392).RHSs (1).In_Parse_Action := null;
+ Result (392).RHSs (1).Post_Parse_Action :=
protected_body_stub_1'Access;
+ Result (393).RHSs.Set_First_Last (0, 0);
+ Result (393).RHSs (0).In_Parse_Action := null;
+ Result (393).RHSs (0).Post_Parse_Action := subunit_0'Access;
+ Result (394).RHSs.Set_First_Last (0, 1);
+ Result (394).RHSs (0).In_Parse_Action := null;
+ Result (394).RHSs (0).Post_Parse_Action :=
exception_declaration_0'Access;
+ Result (394).RHSs (1).In_Parse_Action := null;
+ Result (394).RHSs (1).Post_Parse_Action :=
exception_declaration_1'Access;
+ Result (395).RHSs.Set_First_Last (0, 2);
+ Result (395).RHSs (0).In_Parse_Action := null;
+ Result (395).RHSs (0).Post_Parse_Action := null;
+ Result (395).RHSs (1).In_Parse_Action := null;
+ Result (395).RHSs (1).Post_Parse_Action := null;
+ Result (395).RHSs (2).In_Parse_Action := null;
+ Result (395).RHSs (2).Post_Parse_Action :=
exception_handler_list_2'Access;
+ Result (396).RHSs.Set_First_Last (0, 1);
+ Result (396).RHSs (0).In_Parse_Action := null;
+ Result (396).RHSs (0).Post_Parse_Action :=
handled_sequence_of_statements_0'Access;
+ Result (396).RHSs (1).In_Parse_Action := null;
+ Result (396).RHSs (1).Post_Parse_Action :=
handled_sequence_of_statements_1'Access;
+ Result (397).Optimized_List := True;
+ Result (398).RHSs.Set_First_Last (0, 1);
+ Result (398).RHSs (0).In_Parse_Action := null;
+ Result (398).RHSs (0).Post_Parse_Action := exception_handler_0'Access;
+ Result (398).RHSs (1).In_Parse_Action := null;
+ Result (398).RHSs (1).Post_Parse_Action := exception_handler_1'Access;
+ Result (401).RHSs.Set_First_Last (0, 2);
+ Result (401).RHSs (0).In_Parse_Action := null;
+ Result (401).RHSs (0).Post_Parse_Action := raise_statement_0'Access;
+ Result (401).RHSs (1).In_Parse_Action := null;
+ Result (401).RHSs (1).Post_Parse_Action := raise_statement_1'Access;
+ Result (401).RHSs (2).In_Parse_Action := null;
+ Result (401).RHSs (2).Post_Parse_Action := raise_statement_2'Access;
+ Result (402).RHSs.Set_First_Last (0, 1);
+ Result (402).RHSs (0).In_Parse_Action := null;
+ Result (402).RHSs (0).Post_Parse_Action := raise_expression_0'Access;
+ Result (402).RHSs (1).In_Parse_Action := null;
+ Result (402).RHSs (1).Post_Parse_Action := raise_expression_1'Access;
+ Result (404).RHSs.Set_First_Last (0, 1);
+ Result (404).RHSs (0).In_Parse_Action := null;
+ Result (404).RHSs (0).Post_Parse_Action :=
generic_subprogram_declaration_0'Access;
+ Result (404).RHSs (1).In_Parse_Action := null;
+ Result (404).RHSs (1).Post_Parse_Action :=
generic_subprogram_declaration_1'Access;
+ Result (405).RHSs.Set_First_Last (0, 0);
+ Result (405).RHSs (0).In_Parse_Action := null;
+ Result (405).RHSs (0).Post_Parse_Action :=
generic_package_declaration_0'Access;
+ Result (406).RHSs.Set_First_Last (0, 1);
+ Result (406).RHSs (0).In_Parse_Action := null;
+ Result (406).RHSs (0).Post_Parse_Action :=
generic_formal_part_0'Access;
+ Result (406).RHSs (1).In_Parse_Action := null;
+ Result (406).RHSs (1).Post_Parse_Action :=
generic_formal_part_1'Access;
+ Result (408).RHSs.Set_First_Last (0, 9);
+ Result (408).RHSs (0).In_Parse_Action := null;
+ Result (408).RHSs (0).Post_Parse_Action :=
generic_instantiation_0'Access;
+ Result (408).RHSs (1).In_Parse_Action := null;
+ Result (408).RHSs (1).Post_Parse_Action :=
generic_instantiation_1'Access;
+ Result (408).RHSs (2).In_Parse_Action := null;
+ Result (408).RHSs (2).Post_Parse_Action :=
generic_instantiation_2'Access;
+ Result (408).RHSs (3).In_Parse_Action := null;
+ Result (408).RHSs (3).Post_Parse_Action :=
generic_instantiation_3'Access;
+ Result (408).RHSs (4).In_Parse_Action := null;
+ Result (408).RHSs (4).Post_Parse_Action :=
generic_instantiation_4'Access;
+ Result (408).RHSs (5).In_Parse_Action := null;
+ Result (408).RHSs (5).Post_Parse_Action :=
generic_instantiation_5'Access;
+ Result (408).RHSs (6).In_Parse_Action := null;
+ Result (408).RHSs (6).Post_Parse_Action :=
generic_instantiation_6'Access;
+ Result (408).RHSs (7).In_Parse_Action := null;
+ Result (408).RHSs (7).Post_Parse_Action :=
generic_instantiation_7'Access;
+ Result (408).RHSs (8).In_Parse_Action := null;
+ Result (408).RHSs (8).Post_Parse_Action :=
generic_instantiation_8'Access;
+ Result (408).RHSs (9).In_Parse_Action := null;
+ Result (408).RHSs (9).Post_Parse_Action :=
generic_instantiation_9'Access;
+ Result (409).RHSs.Set_First_Last (0, 11);
+ Result (409).RHSs (0).In_Parse_Action := null;
+ Result (409).RHSs (0).Post_Parse_Action :=
formal_object_declaration_0'Access;
+ Result (409).RHSs (1).In_Parse_Action := null;
+ Result (409).RHSs (1).Post_Parse_Action :=
formal_object_declaration_1'Access;
+ Result (409).RHSs (2).In_Parse_Action := null;
+ Result (409).RHSs (2).Post_Parse_Action :=
formal_object_declaration_2'Access;
+ Result (409).RHSs (3).In_Parse_Action := null;
+ Result (409).RHSs (3).Post_Parse_Action :=
formal_object_declaration_3'Access;
+ Result (409).RHSs (4).In_Parse_Action := null;
+ Result (409).RHSs (4).Post_Parse_Action :=
formal_object_declaration_4'Access;
+ Result (409).RHSs (5).In_Parse_Action := null;
+ Result (409).RHSs (5).Post_Parse_Action :=
formal_object_declaration_5'Access;
+ Result (409).RHSs (6).In_Parse_Action := null;
+ Result (409).RHSs (6).Post_Parse_Action :=
formal_object_declaration_6'Access;
+ Result (409).RHSs (7).In_Parse_Action := null;
+ Result (409).RHSs (7).Post_Parse_Action :=
formal_object_declaration_7'Access;
+ Result (409).RHSs (8).In_Parse_Action := null;
+ Result (409).RHSs (8).Post_Parse_Action :=
formal_object_declaration_8'Access;
+ Result (409).RHSs (9).In_Parse_Action := null;
+ Result (409).RHSs (9).Post_Parse_Action :=
formal_object_declaration_9'Access;
+ Result (409).RHSs (10).In_Parse_Action := null;
+ Result (409).RHSs (10).Post_Parse_Action :=
formal_object_declaration_10'Access;
+ Result (409).RHSs (11).In_Parse_Action := null;
+ Result (409).RHSs (11).Post_Parse_Action :=
formal_object_declaration_11'Access;
+ Result (411).RHSs.Set_First_Last (0, 7);
+ Result (411).RHSs (0).In_Parse_Action := null;
+ Result (411).RHSs (0).Post_Parse_Action :=
formal_complete_type_declaration_0'Access;
+ Result (411).RHSs (1).In_Parse_Action := null;
+ Result (411).RHSs (1).Post_Parse_Action :=
formal_complete_type_declaration_1'Access;
+ Result (411).RHSs (2).In_Parse_Action := null;
+ Result (411).RHSs (2).Post_Parse_Action :=
formal_complete_type_declaration_2'Access;
+ Result (411).RHSs (3).In_Parse_Action := null;
+ Result (411).RHSs (3).Post_Parse_Action :=
formal_complete_type_declaration_3'Access;
+ Result (411).RHSs (4).In_Parse_Action := null;
+ Result (411).RHSs (4).Post_Parse_Action :=
formal_complete_type_declaration_4'Access;
+ Result (411).RHSs (5).In_Parse_Action := null;
+ Result (411).RHSs (5).Post_Parse_Action :=
formal_complete_type_declaration_5'Access;
+ Result (411).RHSs (6).In_Parse_Action := null;
+ Result (411).RHSs (6).Post_Parse_Action :=
formal_complete_type_declaration_6'Access;
+ Result (411).RHSs (7).In_Parse_Action := null;
+ Result (411).RHSs (7).Post_Parse_Action :=
formal_complete_type_declaration_7'Access;
+ Result (412).RHSs.Set_First_Last (0, 7);
+ Result (412).RHSs (0).In_Parse_Action := null;
+ Result (412).RHSs (0).Post_Parse_Action :=
formal_incomplete_type_declaration_0'Access;
+ Result (412).RHSs (1).In_Parse_Action := null;
+ Result (412).RHSs (1).Post_Parse_Action :=
formal_incomplete_type_declaration_1'Access;
+ Result (412).RHSs (2).In_Parse_Action := null;
+ Result (412).RHSs (2).Post_Parse_Action :=
formal_incomplete_type_declaration_2'Access;
+ Result (412).RHSs (3).In_Parse_Action := null;
+ Result (412).RHSs (3).Post_Parse_Action :=
formal_incomplete_type_declaration_3'Access;
+ Result (412).RHSs (4).In_Parse_Action := null;
+ Result (412).RHSs (4).Post_Parse_Action :=
formal_incomplete_type_declaration_4'Access;
+ Result (412).RHSs (5).In_Parse_Action := null;
+ Result (412).RHSs (5).Post_Parse_Action :=
formal_incomplete_type_declaration_5'Access;
+ Result (412).RHSs (6).In_Parse_Action := null;
+ Result (412).RHSs (6).Post_Parse_Action :=
formal_incomplete_type_declaration_6'Access;
+ Result (412).RHSs (7).In_Parse_Action := null;
+ Result (412).RHSs (7).Post_Parse_Action :=
formal_incomplete_type_declaration_7'Access;
+ Result (415).RHSs.Set_First_Last (0, 17);
+ Result (415).RHSs (0).In_Parse_Action := null;
+ Result (415).RHSs (0).Post_Parse_Action :=
formal_derived_type_definition_0'Access;
+ Result (415).RHSs (1).In_Parse_Action := null;
+ Result (415).RHSs (1).Post_Parse_Action :=
formal_derived_type_definition_1'Access;
+ Result (415).RHSs (2).In_Parse_Action := null;
+ Result (415).RHSs (2).Post_Parse_Action :=
formal_derived_type_definition_2'Access;
+ Result (415).RHSs (3).In_Parse_Action := null;
+ Result (415).RHSs (3).Post_Parse_Action :=
formal_derived_type_definition_3'Access;
+ Result (415).RHSs (4).In_Parse_Action := null;
+ Result (415).RHSs (4).Post_Parse_Action :=
formal_derived_type_definition_4'Access;
+ Result (415).RHSs (5).In_Parse_Action := null;
+ Result (415).RHSs (5).Post_Parse_Action :=
formal_derived_type_definition_5'Access;
+ Result (415).RHSs (6).In_Parse_Action := null;
+ Result (415).RHSs (6).Post_Parse_Action :=
formal_derived_type_definition_6'Access;
+ Result (415).RHSs (7).In_Parse_Action := null;
+ Result (415).RHSs (7).Post_Parse_Action :=
formal_derived_type_definition_7'Access;
+ Result (415).RHSs (8).In_Parse_Action := null;
+ Result (415).RHSs (8).Post_Parse_Action :=
formal_derived_type_definition_8'Access;
+ Result (415).RHSs (9).In_Parse_Action := null;
+ Result (415).RHSs (9).Post_Parse_Action :=
formal_derived_type_definition_9'Access;
+ Result (415).RHSs (10).In_Parse_Action := null;
+ Result (415).RHSs (10).Post_Parse_Action :=
formal_derived_type_definition_10'Access;
+ Result (415).RHSs (11).In_Parse_Action := null;
+ Result (415).RHSs (11).Post_Parse_Action :=
formal_derived_type_definition_11'Access;
+ Result (415).RHSs (12).In_Parse_Action := null;
+ Result (415).RHSs (12).Post_Parse_Action :=
formal_derived_type_definition_12'Access;
+ Result (415).RHSs (13).In_Parse_Action := null;
+ Result (415).RHSs (13).Post_Parse_Action :=
formal_derived_type_definition_13'Access;
+ Result (415).RHSs (14).In_Parse_Action := null;
+ Result (415).RHSs (14).Post_Parse_Action :=
formal_derived_type_definition_14'Access;
+ Result (415).RHSs (15).In_Parse_Action := null;
+ Result (415).RHSs (15).Post_Parse_Action :=
formal_derived_type_definition_15'Access;
+ Result (415).RHSs (16).In_Parse_Action := null;
+ Result (415).RHSs (16).Post_Parse_Action :=
formal_derived_type_definition_16'Access;
+ Result (415).RHSs (17).In_Parse_Action := null;
+ Result (415).RHSs (17).Post_Parse_Action :=
formal_derived_type_definition_17'Access;
+ Result (426).RHSs.Set_First_Last (0, 3);
+ Result (426).RHSs (0).In_Parse_Action := null;
+ Result (426).RHSs (0).Post_Parse_Action :=
formal_concrete_subprogram_declaration_0'Access;
+ Result (426).RHSs (1).In_Parse_Action := null;
+ Result (426).RHSs (1).Post_Parse_Action :=
formal_concrete_subprogram_declaration_1'Access;
+ Result (426).RHSs (2).In_Parse_Action := null;
+ Result (426).RHSs (2).Post_Parse_Action :=
formal_concrete_subprogram_declaration_2'Access;
+ Result (426).RHSs (3).In_Parse_Action := null;
+ Result (426).RHSs (3).Post_Parse_Action :=
formal_concrete_subprogram_declaration_3'Access;
+ Result (427).RHSs.Set_First_Last (0, 3);
+ Result (427).RHSs (0).In_Parse_Action := null;
+ Result (427).RHSs (0).Post_Parse_Action :=
formal_abstract_subprogram_declaration_0'Access;
+ Result (427).RHSs (1).In_Parse_Action := null;
+ Result (427).RHSs (1).Post_Parse_Action :=
formal_abstract_subprogram_declaration_1'Access;
+ Result (427).RHSs (2).In_Parse_Action := null;
+ Result (427).RHSs (2).Post_Parse_Action :=
formal_abstract_subprogram_declaration_2'Access;
+ Result (427).RHSs (3).In_Parse_Action := null;
+ Result (427).RHSs (3).Post_Parse_Action :=
formal_abstract_subprogram_declaration_3'Access;
+ Result (429).RHSs.Set_First_Last (0, 0);
+ Result (429).RHSs (0).In_Parse_Action := null;
+ Result (429).RHSs (0).Post_Parse_Action := default_name_0'Access;
+ Result (430).RHSs.Set_First_Last (0, 1);
+ Result (430).RHSs (0).In_Parse_Action := null;
+ Result (430).RHSs (0).Post_Parse_Action :=
formal_package_declaration_0'Access;
+ Result (430).RHSs (1).In_Parse_Action := null;
+ Result (430).RHSs (1).Post_Parse_Action :=
formal_package_declaration_1'Access;
+ Result (432).RHSs.Set_First_Last (0, 1);
+ Result (432).RHSs (0).In_Parse_Action := null;
+ Result (432).RHSs (0).Post_Parse_Action :=
aspect_association_0'Access;
+ Result (432).RHSs (1).In_Parse_Action := null;
+ Result (432).RHSs (1).Post_Parse_Action :=
aspect_association_1'Access;
+ Result (434).RHSs.Set_First_Last (0, 0);
+ Result (434).RHSs (0).In_Parse_Action := null;
+ Result (434).RHSs (0).Post_Parse_Action :=
aspect_specification_0'Access;
+ Result (437).RHSs.Set_First_Last (0, 0);
+ Result (437).RHSs (0).In_Parse_Action := null;
+ Result (437).RHSs (0).Post_Parse_Action :=
attribute_definition_clause_0'Access;
+ Result (438).RHSs.Set_First_Last (0, 0);
+ Result (438).RHSs (0).In_Parse_Action := null;
+ Result (438).RHSs (0).Post_Parse_Action :=
enumeration_representation_clause_0'Access;
+ Result (440).RHSs.Set_First_Last (0, 7);
+ Result (440).RHSs (0).In_Parse_Action := null;
+ Result (440).RHSs (0).Post_Parse_Action :=
record_representation_clause_0'Access;
+ Result (440).RHSs (1).In_Parse_Action := null;
+ Result (440).RHSs (1).Post_Parse_Action :=
record_representation_clause_1'Access;
+ Result (440).RHSs (2).In_Parse_Action := null;
+ Result (440).RHSs (2).Post_Parse_Action :=
record_representation_clause_2'Access;
+ Result (440).RHSs (3).In_Parse_Action := null;
+ Result (440).RHSs (3).Post_Parse_Action :=
record_representation_clause_3'Access;
+ Result (440).RHSs (4).In_Parse_Action := null;
+ Result (440).RHSs (4).Post_Parse_Action :=
record_representation_clause_4'Access;
+ Result (440).RHSs (5).In_Parse_Action := null;
+ Result (440).RHSs (5).Post_Parse_Action :=
record_representation_clause_5'Access;
+ Result (440).RHSs (6).In_Parse_Action := null;
+ Result (440).RHSs (6).Post_Parse_Action :=
record_representation_clause_6'Access;
+ Result (440).RHSs (7).In_Parse_Action := null;
+ Result (440).RHSs (7).Post_Parse_Action :=
record_representation_clause_7'Access;
+ Result (441).RHSs.Set_First_Last (0, 0);
+ Result (441).RHSs (0).In_Parse_Action := null;
+ Result (441).RHSs (0).Post_Parse_Action := component_clause_0'Access;
+ Result (451).Optimized_List := True;
+ Result (453).RHSs.Set_First_Last (0, 1);
+ Result (453).RHSs (0).In_Parse_Action := null;
+ Result (453).RHSs (0).Post_Parse_Action := delta_constraint_0'Access;
+ Result (453).RHSs (1).In_Parse_Action := null;
+ Result (453).RHSs (1).Post_Parse_Action := delta_constraint_1'Access;
+ Result (454).RHSs.Set_First_Last (0, 0);
+ Result (454).RHSs (0).In_Parse_Action := null;
+ Result (454).RHSs (0).Post_Parse_Action := at_clause_0'Access;
+ Result (456).Optimized_List := True;
+ Result (457).Optimized_List := True;
+ Result (458).Optimized_List := True;
+ Result (459).Optimized_List := True;
+ Result (460).Optimized_List := True;
+ Result (461).Optimized_List := True;
+ Result (462).Optimized_List := True;
+ Result (463).Optimized_List := True;
+ Result (464).Optimized_List := True;
+ Result (465).Optimized_List := True;
+ Result (466).Optimized_List := True;
+ end return;
+ end Create_Productions;
+
+end Ada_Annex_P_Process_LR1_Main;
diff --git a/ada_annex_p_process_lr1_main.ads b/ada_annex_p_process_lr1_main.ads
new file mode 100644
index 0000000000..e191ef5a2e
--- /dev/null
+++ b/ada_annex_p_process_lr1_main.ads
@@ -0,0 +1,32 @@
+-- generated parser support file. -*- buffer-read-only:t -*-
+-- command line: wisitoken-bnf-generate.exe --generate LR1 Ada_Emacs re2c
PROCESS text_rep ada_annex_p.wy
+--
+
+-- Copyright (C) 2013 - 2022 Free Software Foundation, Inc.
+
+-- This program is free software; you can redistribute it and/or
+-- modify it under the terms of the GNU General Public License as
+-- published by the Free Software Foundation; either version 3, or (at
+-- your option) any later version.
+--
+-- This software is distributed in the hope that it will be useful,
+-- but WITHOUT ANY WARRANTY; without even the implied warranty of
+-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+-- General Public License for more details.
+--
+-- You should have received a copy of the GNU General Public License
+-- along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>.
+
+with WisiToken.Syntax_Trees;
+with WisiToken.Lexer;
+with WisiToken.Parse.LR;
+package Ada_Annex_P_Process_LR1_Main is
+
+ function Create_Parse_Table
+ (Text_Rep_File_Name : in String)
+ return WisiToken.Parse.LR.Parse_Table_Ptr;
+
+ function Create_Productions return
WisiToken.Syntax_Trees.Production_Info_Trees.Vector;
+
+ function Create_Lexer (Trace : in WisiToken.Trace_Access) return
WisiToken.Lexer.Handle;
+end Ada_Annex_P_Process_LR1_Main;
diff --git a/ada_re2c.c b/ada_annex_p_re2c.c
similarity index 59%
rename from ada_re2c.c
rename to ada_annex_p_re2c.c
index 684faccc42..a01cc3a840 100644
--- a/ada_re2c.c
+++ b/ada_annex_p_re2c.c
@@ -1,10 +1,10 @@
-/* Generated by re2c 1.3 */
-#line 1 "../ada.re2c"
-// generated parser support file. -*- mode: C -*-
-// command line: wisitoken-bnf-generate.exe --generate LALR Ada_Emacs re2c
PROCESS ada.wy
+/* Generated by re2c 2.0.2 */
+#line 1 "ada_annex_p.re2c"
+// generated parser support file. -*- buffer-read-only:t mode: C -*-
+// command line: wisitoken-bnf-generate.exe --generate LALR Ada_Emacs re2c
PROCESS ada_annex_p.wy
//
-// Copyright (C) 2013 - 2020 Free Software Foundation, Inc.
+// Copyright (C) 2013 - 2022 Free Software Foundation, Inc.
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
@@ -47,7 +47,7 @@ typedef struct wisi_lexer
#define NO_ERROR 0
#define ERROR_unrecognized_character 1
-wisi_lexer* ada_new_lexer
+wisi_lexer* ada_annex_p_new_lexer
(unsigned char* input, size_t length, int verbosity)
{
wisi_lexer* result = malloc (sizeof (wisi_lexer));
@@ -57,25 +57,41 @@ wisi_lexer* ada_new_lexer
result->byte_token_start = input;
result->char_pos = 1; /* match WisiToken.Buffer_Region */
result->char_token_start = 1;
- result->line = (*result->cursor == 0x0A) ? 2 : 1;
+ result->line = 1;
result->line_token_start = result->line;
- result->verbosity = verbosity;
+ result->verbosity = 0;
return result;
}
void
-ada_free_lexer(wisi_lexer** lexer)
+ada_annex_p_free_lexer(wisi_lexer** lexer)
{
free(*lexer);
*lexer = 0;
}
void
-ada_reset_lexer(wisi_lexer* lexer)
+ada_annex_p_reset_lexer(wisi_lexer* lexer)
{
lexer->cursor = lexer->buffer;
lexer->char_pos = 1;
- lexer->line = (*lexer->cursor == 0x0A) ? 2 : 1;
+ lexer->line = 1;
+}
+
+void
+ada_annex_p_set_verbosity
+ (wisi_lexer* lexer, int verbosity)
+{
+ lexer->verbosity = verbosity;
+}
+
+void
+ada_annex_p_set_position
+ (wisi_lexer* lexer, size_t byte_position, size_t char_position, int line)
+{
+ lexer->cursor = lexer->buffer + byte_position - 1;
+ lexer->char_pos = char_position;
+ lexer->line = line;
}
static void debug(wisi_lexer* lexer, int state, unsigned char ch)
@@ -95,20 +111,22 @@ static void debug(wisi_lexer* lexer, int state, unsigned
char ch)
static void skip(wisi_lexer* lexer)
{
- if (lexer->cursor <= lexer->buffer_last)
- ++lexer->cursor;
if (lexer->cursor <= lexer->buffer_last)
{
- /* UFT-8 encoding: https://en.wikipedia.org/wiki/UTF-8#Description */
- if (*lexer->cursor == 0x0A && lexer->cursor > lexer->buffer &&
*(lexer->cursor - 1) == 0x0D)
- {/* second byte of DOS line ending */
- }
- else if ((*lexer->cursor & 0x80) == 0x80 && (*lexer->cursor & 0xC0) !=
0xC0)
- {/* byte 2, 3 or 4 of multi-byte UTF-8 char */
- }
- else
- ++lexer->char_pos;
- if (*lexer->cursor == 0x0A) ++lexer->line;
+ ++lexer->cursor;
+ if (lexer->cursor <= lexer->buffer_last)
+ {
+ /* UFT-8 encoding: https://en.wikipedia.org/wiki/UTF-8#Description */
+ if (*lexer->cursor == 0x0A && lexer->cursor > lexer->buffer &&
*(lexer->cursor - 1) == 0x0D)
+ {/* second byte of DOS line ending */
+ }
+ else if ((*lexer->cursor & 0x80) == 0x80 && (*lexer->cursor & 0xC0)
!= 0xC0)
+ {/* byte 2, 3 or 4 of multi-byte UTF-8 char */
+ }
+ else
+ lexer->char_pos++;
+ } else
+ lexer->char_pos++;
}
}
#define YYSKIP() skip(lexer)
@@ -117,50 +135,61 @@ static void skip(wisi_lexer* lexer)
#define YYBACKUPCTX() lexer->context = lexer->cursor; lexer->context_pos =
lexer->char_pos;lexer->context_line = lexer->line
#define YYRESTORECTX() lexer->cursor = lexer->context; lexer->char_pos =
lexer->context_pos;lexer->line = lexer->context_line
-int ada_next_token
+int ada_annex_p_next_token
(wisi_lexer* lexer,
int* id,
size_t* byte_position,
size_t* byte_length,
size_t* char_position,
size_t* char_length,
- int* line_start)
+ int* line_start,
+ int* line_length)
{
int status = NO_ERROR;
*id = -1;
if (lexer->cursor > lexer->buffer_last)
{
- *id = 110;
- *byte_position = lexer->buffer_last - lexer->buffer + 1;
+ *id = 119;
+ *byte_position = lexer->buffer_last - lexer->buffer + 2;
*byte_length = 0;
- *char_position = lexer->char_token_start;
+ *char_position = lexer->char_pos;
*char_length = 0;
*line_start = lexer->line;
+ *line_length = 0;
return status;
}
lexer->byte_token_start = lexer->cursor;
lexer->char_token_start = lexer->char_pos;
- if (*lexer->cursor == 0x0A)
- lexer->line_token_start = lexer->line-1;
- else
- lexer->line_token_start = lexer->line;
+ lexer->line_token_start = lexer->line;
while (*id == -1 && status == 0)
{
-#line 153 "../ada_re2c.c"
+#line 170 "ada_annex_p_re2c.c"
{
YYCTYPE yych;
unsigned int yyaccept = 0;
YYDEBUG(0, *YYCURSOR);
- yych = YYPEEK ();
+ yych = YYPEEK();
switch (yych) {
- case 0x04: goto yy4;
+ case 0x00:
+ case 0x01:
+ case 0x02:
+ case 0x03:
+ case 0x05:
+ case 0x06:
+ case 0x07:
+ case 0x08:
case '\t':
- case ' ': goto yy6;
- case '\n': goto yy9;
- case '\r': goto yy11;
+ case '\v':
+ case '\f':
+ case 0x0E:
+ case 0x0F:
+ case ' ': goto yy2;
+ case 0x04: goto yy5;
+ case '\n': goto yy7;
+ case '\r': goto yy9;
case '"': goto yy12;
case '#': goto yy13;
case '$':
@@ -244,10 +273,10 @@ int ada_next_token
case 'x': goto yy70;
case '[': goto yy71;
case ']': goto yy73;
- case '{': goto yy75;
+ case '_': goto yy75;
+ case '{': goto yy77;
case '|': goto yy78;
case 0xC2:
- case 0xC3:
case 0xC4:
case 0xC5:
case 0xC6:
@@ -276,7 +305,8 @@ int ada_next_token
case 0xDD:
case 0xDE:
case 0xDF: goto yy80;
- case 0xE0: goto yy81;
+ case 0xC3: goto yy81;
+ case 0xE0: goto yy82;
case 0xE1:
case 0xE2:
case 0xE3:
@@ -291,71 +321,87 @@ int ada_next_token
case 0xEC:
case 0xED:
case 0xEE:
- case 0xEF: goto yy82;
- case 0xF0: goto yy83;
+ case 0xEF: goto yy83;
+ case 0xF0: goto yy84;
case 0xF1:
case 0xF2:
- case 0xF3: goto yy84;
- case 0xF4: goto yy85;
- default: goto yy2;
+ case 0xF3: goto yy85;
+ case 0xF4: goto yy86;
+ default: goto yy10;
}
yy2:
- YYDEBUG(2, YYPEEK ());
- YYSKIP ();
+ YYDEBUG(2, YYPEEK());
+ yyaccept = 0;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
yy3:
- YYDEBUG(3, YYPEEK ());
-#line 382 "../ada.re2c"
- {status = ERROR_unrecognized_character; continue;}
-#line 310 "../ada_re2c.c"
-yy4:
- YYDEBUG(4, YYPEEK ());
- YYSKIP ();
- YYDEBUG(5, YYPEEK ());
-#line 380 "../ada.re2c"
- {*id = 110; continue;}
-#line 317 "../ada_re2c.c"
-yy6:
- YYDEBUG(6, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
- YYDEBUG(7, YYPEEK ());
+ YYDEBUG(3, YYPEEK());
switch (yych) {
+ case 0x00:
+ case 0x01:
+ case 0x02:
+ case 0x03:
+ case 0x05:
+ case 0x06:
+ case 0x07:
+ case 0x08:
case '\t':
- case ' ': goto yy6;
- default: goto yy8;
+ case '\v':
+ case '\f':
+ case '\r':
+ case 0x0E:
+ case 0x0F:
+ case ' ': goto yy2;
+ case 0xC3: goto yy87;
+ default: goto yy4;
}
-yy8:
- YYDEBUG(8, YYPEEK ());
-#line 264 "../ada.re2c"
+yy4:
+ YYDEBUG(4, YYPEEK());
+#line 290 "ada_annex_p.re2c"
{ lexer->byte_token_start = lexer->cursor;
lexer->char_token_start = lexer->char_pos;
- if (*lexer->cursor == 0x0A)
- lexer->line_token_start = lexer->line-1;
- else
- lexer->line_token_start = lexer->line;
+ lexer->line_token_start = lexer->line;
continue; }
-#line 338 "../ada_re2c.c"
+#line 367 "ada_annex_p_re2c.c"
+yy5:
+ YYDEBUG(5, YYPEEK());
+ YYSKIP();
+ YYDEBUG(6, YYPEEK());
+#line 412 "ada_annex_p.re2c"
+ {*id = 119; continue;}
+#line 374 "ada_annex_p_re2c.c"
+yy7:
+ YYDEBUG(7, YYPEEK());
+ YYSKIP();
+ YYDEBUG(8, YYPEEK());
+#line 294 "ada_annex_p.re2c"
+ {*id = 1; lexer->line++; continue;}
+#line 381 "ada_annex_p_re2c.c"
yy9:
- YYDEBUG(9, YYPEEK ());
- YYSKIP ();
- YYDEBUG(10, YYPEEK ());
-#line 271 "../ada.re2c"
- {*id = 1; continue;}
-#line 345 "../ada_re2c.c"
-yy11:
- YYDEBUG(11, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+ YYDEBUG(9, YYPEEK());
+ yyaccept = 0;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
- case '\n': goto yy9;
+ case '\n': goto yy7;
default: goto yy3;
}
+yy10:
+ YYDEBUG(10, YYPEEK());
+ YYSKIP();
+yy11:
+ YYDEBUG(11, YYPEEK());
+#line 414 "ada_annex_p.re2c"
+ {status = ERROR_unrecognized_character; continue;}
+#line 399 "ada_annex_p_re2c.c"
yy12:
- YYDEBUG(12, YYPEEK ());
- yyaccept = 0;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYDEBUG(12, YYPEEK());
+ yyaccept = 1;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case ' ':
case '!':
@@ -503,28 +549,28 @@ yy12:
case 0xF1:
case 0xF2:
case 0xF3:
- case 0xF4: goto yy87;
- default: goto yy3;
+ case 0xF4: goto yy90;
+ default: goto yy11;
}
yy13:
- YYDEBUG(13, YYPEEK ());
- yyaccept = 0;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYDEBUG(13, YYPEEK());
+ yyaccept = 1;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
- case 'e': goto yy99;
- case 'i': goto yy100;
- default: goto yy3;
+ case 'e': goto yy101;
+ case 'i': goto yy102;
+ default: goto yy11;
}
yy14:
- YYDEBUG(14, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYDEBUG(14, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
yy15:
- YYDEBUG(15, YYPEEK ());
+ YYDEBUG(15, YYPEEK());
switch (yych) {
case '0':
case '1':
@@ -589,7 +635,7 @@ yy15:
case 'x':
case 'y':
case 'z': goto yy14;
- case '[': goto yy101;
+ case '[': goto yy103;
case 0xC2:
case 0xC3:
case 0xC4:
@@ -619,8 +665,8 @@ yy15:
case 0xDC:
case 0xDD:
case 0xDE:
- case 0xDF: goto yy102;
- case 0xE0: goto yy103;
+ case 0xDF: goto yy104;
+ case 0xE0: goto yy105;
case 0xE1:
case 0xE2:
case 0xE3:
@@ -635,32 +681,32 @@ yy15:
case 0xEC:
case 0xED:
case 0xEE:
- case 0xEF: goto yy104;
- case 0xF0: goto yy105;
+ case 0xEF: goto yy106;
+ case 0xF0: goto yy107;
case 0xF1:
case 0xF2:
- case 0xF3: goto yy106;
- case 0xF4: goto yy107;
+ case 0xF3: goto yy108;
+ case 0xF4: goto yy109;
default: goto yy16;
}
yy16:
- YYDEBUG(16, YYPEEK ());
-#line 377 "../ada.re2c"
- {*id = 107; continue;}
-#line 651 "../ada_re2c.c"
+ YYDEBUG(16, YYPEEK());
+#line 409 "ada_annex_p.re2c"
+ {*id = 116; continue;}
+#line 697 "ada_annex_p_re2c.c"
yy17:
- YYDEBUG(17, YYPEEK ());
- YYSKIP ();
- YYDEBUG(18, YYPEEK ());
-#line 350 "../ada.re2c"
- {*id = 80; continue;}
-#line 658 "../ada_re2c.c"
+ YYDEBUG(17, YYPEEK());
+ YYSKIP();
+ YYDEBUG(18, YYPEEK());
+#line 382 "ada_annex_p.re2c"
+ {*id = 89; continue;}
+#line 704 "ada_annex_p_re2c.c"
yy19:
- YYDEBUG(19, YYPEEK ());
- yyaccept = 2;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYDEBUG(19, YYPEEK());
+ yyaccept = 3;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case ' ':
case '!':
@@ -755,11 +801,11 @@ yy19:
case '|':
case '}':
case '~':
- case 0x7F: goto yy108;
+ case 0x7F: goto yy110;
case '(':
- YYBACKUPCTX ();
- goto yy109;
- case '[': goto yy110;
+ YYBACKUPCTX();
+ goto yy111;
+ case '[': goto yy112;
case 0xC2:
case 0xC3:
case 0xC4:
@@ -789,8 +835,8 @@ yy19:
case 0xDC:
case 0xDD:
case 0xDE:
- case 0xDF: goto yy111;
- case 0xE0: goto yy112;
+ case 0xDF: goto yy113;
+ case 0xE0: goto yy114;
case 0xE1:
case 0xE2:
case 0xE3:
@@ -805,113 +851,115 @@ yy19:
case 0xEC:
case 0xED:
case 0xEE:
- case 0xEF: goto yy113;
- case 0xF0: goto yy114;
+ case 0xEF: goto yy115;
+ case 0xF0: goto yy116;
case 0xF1:
case 0xF2:
- case 0xF3: goto yy115;
- case 0xF4: goto yy116;
+ case 0xF3: goto yy117;
+ case 0xF4: goto yy118;
default: goto yy20;
}
yy20:
- YYDEBUG(20, YYPEEK ());
-#line 374 "../ada.re2c"
- {*id = 104; continue;}
-#line 821 "../ada_re2c.c"
+ YYDEBUG(20, YYPEEK());
+#line 406 "ada_annex_p.re2c"
+ {*id = 113; continue;}
+#line 867 "ada_annex_p_re2c.c"
yy21:
- YYDEBUG(21, YYPEEK ());
- YYSKIP ();
- YYDEBUG(22, YYPEEK ());
-#line 346 "../ada.re2c"
- {*id = 76; continue;}
-#line 828 "../ada_re2c.c"
+ YYDEBUG(21, YYPEEK());
+ YYSKIP();
+ YYDEBUG(22, YYPEEK());
+#line 378 "ada_annex_p.re2c"
+ {*id = 85; continue;}
+#line 874 "ada_annex_p_re2c.c"
yy23:
- YYDEBUG(23, YYPEEK ());
- YYSKIP ();
- YYDEBUG(24, YYPEEK ());
-#line 348 "../ada.re2c"
- {*id = 78; continue;}
-#line 835 "../ada_re2c.c"
+ YYDEBUG(23, YYPEEK());
+ YYSKIP();
+ YYDEBUG(24, YYPEEK());
+#line 380 "ada_annex_p.re2c"
+ {*id = 87; continue;}
+#line 881 "ada_annex_p_re2c.c"
yy25:
- YYDEBUG(25, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+ YYDEBUG(25, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case '*': goto yy117;
+ case '*': goto yy119;
default: goto yy26;
}
yy26:
- YYDEBUG(26, YYPEEK ());
-#line 372 "../ada.re2c"
- {*id = 102; continue;}
-#line 848 "../ada_re2c.c"
+ YYDEBUG(26, YYPEEK());
+#line 404 "ada_annex_p.re2c"
+ {*id = 111; continue;}
+#line 894 "ada_annex_p_re2c.c"
yy27:
- YYDEBUG(27, YYPEEK ());
- YYSKIP ();
- YYDEBUG(28, YYPEEK ());
-#line 368 "../ada.re2c"
- {*id = 98; continue;}
-#line 855 "../ada_re2c.c"
+ YYDEBUG(27, YYPEEK());
+ YYSKIP();
+ YYDEBUG(28, YYPEEK());
+#line 400 "ada_annex_p.re2c"
+ {*id = 107; continue;}
+#line 901 "ada_annex_p_re2c.c"
yy29:
- YYDEBUG(29, YYPEEK ());
- YYSKIP ();
- YYDEBUG(30, YYPEEK ());
-#line 356 "../ada.re2c"
- {*id = 86; continue;}
-#line 862 "../ada_re2c.c"
+ YYDEBUG(29, YYPEEK());
+ YYSKIP();
+ YYDEBUG(30, YYPEEK());
+#line 388 "ada_annex_p.re2c"
+ {*id = 95; continue;}
+#line 908 "ada_annex_p_re2c.c"
yy31:
- YYDEBUG(31, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+ YYDEBUG(31, YYPEEK());
+ yyaccept = 4;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
- case '-': goto yy119;
+ case '-': goto yy121;
default: goto yy32;
}
yy32:
- YYDEBUG(32, YYPEEK ());
-#line 367 "../ada.re2c"
- {*id = 97; continue;}
-#line 875 "../ada_re2c.c"
+ YYDEBUG(32, YYPEEK());
+#line 399 "ada_annex_p.re2c"
+ {*id = 106; continue;}
+#line 923 "ada_annex_p_re2c.c"
yy33:
- YYDEBUG(33, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+ YYDEBUG(33, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case '.': goto yy121;
+ case '.': goto yy123;
default: goto yy34;
}
yy34:
- YYDEBUG(34, YYPEEK ());
-#line 357 "../ada.re2c"
- {*id = 87; continue;}
-#line 888 "../ada_re2c.c"
+ YYDEBUG(34, YYPEEK());
+#line 389 "ada_annex_p.re2c"
+ {*id = 96; continue;}
+#line 936 "ada_annex_p_re2c.c"
yy35:
- YYDEBUG(35, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+ YYDEBUG(35, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case '=': goto yy123;
+ case '=': goto yy125;
default: goto yy36;
}
yy36:
- YYDEBUG(36, YYPEEK ());
-#line 370 "../ada.re2c"
- {*id = 100; continue;}
-#line 901 "../ada_re2c.c"
+ YYDEBUG(36, YYPEEK());
+#line 402 "ada_annex_p.re2c"
+ {*id = 109; continue;}
+#line 949 "ada_annex_p_re2c.c"
yy37:
- YYDEBUG(37, YYPEEK ());
- yyaccept = 3;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
- YYDEBUG(38, YYPEEK ());
+ YYDEBUG(37, YYPEEK());
+ yyaccept = 5;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ YYDEBUG(38, YYPEEK());
switch (yych) {
- case '#': goto yy125;
+ case '#': goto yy127;
case '-':
- case '.':
case 'E':
- case '_':
- case 'e': goto yy126;
+ case '[':
+ case 'e': goto yy128;
+ case '.': goto yy130;
case '0':
case '1':
case '2':
@@ -922,384 +970,413 @@ yy37:
case '7':
case '8':
case '9': goto yy37;
+ case '_': goto yy75;
default: goto yy39;
}
yy39:
- YYDEBUG(39, YYPEEK ());
-#line 376 "../ada.re2c"
- {*id = 106; continue;}
-#line 932 "../ada_re2c.c"
+ YYDEBUG(39, YYPEEK());
+#line 408 "ada_annex_p.re2c"
+ {*id = 115; continue;}
+#line 981 "ada_annex_p_re2c.c"
yy40:
- YYDEBUG(40, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+ YYDEBUG(40, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case '=': goto yy128;
+ case '=': goto yy131;
default: goto yy41;
}
yy41:
- YYDEBUG(41, YYPEEK ());
-#line 354 "../ada.re2c"
- {*id = 84; continue;}
-#line 945 "../ada_re2c.c"
+ YYDEBUG(41, YYPEEK());
+#line 386 "ada_annex_p.re2c"
+ {*id = 93; continue;}
+#line 994 "ada_annex_p_re2c.c"
yy42:
- YYDEBUG(42, YYPEEK ());
- YYSKIP ();
- YYDEBUG(43, YYPEEK ());
-#line 369 "../ada.re2c"
- {*id = 99; continue;}
-#line 952 "../ada_re2c.c"
+ YYDEBUG(42, YYPEEK());
+ YYSKIP();
+ YYDEBUG(43, YYPEEK());
+#line 401 "ada_annex_p.re2c"
+ {*id = 108; continue;}
+#line 1001 "ada_annex_p_re2c.c"
yy44:
- YYDEBUG(44, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+ YYDEBUG(44, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case '<': goto yy130;
- case '=': goto yy132;
- case '>': goto yy134;
+ case '<': goto yy133;
+ case '=': goto yy135;
+ case '>': goto yy137;
default: goto yy45;
}
yy45:
- YYDEBUG(45, YYPEEK ());
-#line 364 "../ada.re2c"
- {*id = 94; continue;}
-#line 967 "../ada_re2c.c"
+ YYDEBUG(45, YYPEEK());
+#line 396 "ada_annex_p.re2c"
+ {*id = 103; continue;}
+#line 1016 "ada_annex_p_re2c.c"
yy46:
- YYDEBUG(46, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+ YYDEBUG(46, YYPEEK());
+ yyaccept = 6;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
- case '>': goto yy136;
+ case '=': goto yy139;
+ case '>': goto yy140;
default: goto yy47;
}
yy47:
- YYDEBUG(47, YYPEEK ());
-#line 359 "../ada.re2c"
- {*id = 89; continue;}
-#line 980 "../ada_re2c.c"
+ YYDEBUG(47, YYPEEK());
+#line 391 "ada_annex_p.re2c"
+ {*id = 98; continue;}
+#line 1032 "ada_annex_p_re2c.c"
yy48:
- YYDEBUG(48, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+ YYDEBUG(48, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case '=': goto yy138;
- case '>': goto yy140;
+ case '=': goto yy142;
+ case '>': goto yy144;
default: goto yy49;
}
yy49:
- YYDEBUG(49, YYPEEK ());
-#line 361 "../ada.re2c"
- {*id = 91; continue;}
-#line 994 "../ada_re2c.c"
+ YYDEBUG(49, YYPEEK());
+#line 393 "ada_annex_p.re2c"
+ {*id = 100; continue;}
+#line 1046 "ada_annex_p_re2c.c"
yy50:
- YYDEBUG(50, YYPEEK ());
- YYSKIP ();
- YYDEBUG(51, YYPEEK ());
-#line 351 "../ada.re2c"
- {*id = 81; continue;}
-#line 1001 "../ada_re2c.c"
+ YYDEBUG(50, YYPEEK());
+ YYSKIP();
+ YYDEBUG(51, YYPEEK());
+#line 383 "ada_annex_p.re2c"
+ {*id = 90; continue;}
+#line 1053 "ada_annex_p_re2c.c"
yy52:
- YYDEBUG(52, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYDEBUG(52, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'B':
- case 'b': goto yy142;
+ case 'b': goto yy146;
case 'C':
- case 'c': goto yy143;
+ case 'c': goto yy147;
case 'L':
- case 'l': goto yy144;
+ case 'l': goto yy148;
case 'N':
- case 'n': goto yy145;
+ case 'n': goto yy149;
case 'R':
- case 'r': goto yy146;
+ case 'r': goto yy150;
case 'T':
- case 't': goto yy147;
+ case 't': goto yy151;
default: goto yy15;
}
yy53:
- YYDEBUG(53, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYDEBUG(53, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy149;
+ case 'e': goto yy153;
case 'O':
- case 'o': goto yy150;
+ case 'o': goto yy154;
default: goto yy15;
}
yy54:
- YYDEBUG(54, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYDEBUG(54, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'A':
- case 'a': goto yy151;
+ case 'a': goto yy155;
case 'O':
- case 'o': goto yy152;
+ case 'o': goto yy156;
default: goto yy15;
}
yy55:
- YYDEBUG(55, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYDEBUG(55, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy153;
+ case 'e': goto yy157;
case 'I':
- case 'i': goto yy154;
+ case 'i': goto yy158;
case 'O':
- case 'o': goto yy155;
+ case 'o': goto yy159;
default: goto yy15;
}
yy56:
- YYDEBUG(56, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYDEBUG(56, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'L':
- case 'l': goto yy157;
+ case 'l': goto yy161;
case 'N':
- case 'n': goto yy158;
+ case 'n': goto yy162;
case 'X':
- case 'x': goto yy159;
+ case 'x': goto yy163;
default: goto yy15;
}
yy57:
- YYDEBUG(57, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYDEBUG(57, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'O':
- case 'o': goto yy160;
+ case 'o': goto yy164;
case 'U':
- case 'u': goto yy161;
+ case 'u': goto yy165;
default: goto yy15;
}
yy58:
- YYDEBUG(58, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYDEBUG(58, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy162;
+ case 'e': goto yy166;
case 'O':
- case 'o': goto yy163;
+ case 'o': goto yy167;
default: goto yy15;
}
yy59:
- YYDEBUG(59, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYDEBUG(59, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'F':
- case 'f': goto yy164;
+ case 'f': goto yy168;
case 'N':
- case 'n': goto yy166;
+ case 'n': goto yy170;
case 'S':
- case 's': goto yy168;
+ case 's': goto yy172;
default: goto yy15;
}
yy60:
- YYDEBUG(60, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYDEBUG(60, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'I':
- case 'i': goto yy170;
+ case 'i': goto yy174;
case 'O':
- case 'o': goto yy171;
+ case 'o': goto yy175;
default: goto yy15;
}
yy61:
- YYDEBUG(61, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYDEBUG(61, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'O':
- case 'o': goto yy172;
+ case 'o': goto yy176;
default: goto yy15;
}
yy62:
- YYDEBUG(62, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYDEBUG(62, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy173;
+ case 'e': goto yy177;
case 'O':
- case 'o': goto yy174;
+ case 'o': goto yy178;
case 'U':
- case 'u': goto yy175;
+ case 'u': goto yy179;
default: goto yy15;
}
yy63:
- YYDEBUG(63, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYDEBUG(63, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'F':
- case 'f': goto yy176;
+ case 'f': goto yy180;
case 'R':
- case 'r': goto yy178;
+ case 'r': goto yy182;
case 'T':
- case 't': goto yy180;
+ case 't': goto yy184;
case 'U':
- case 'u': goto yy181;
+ case 'u': goto yy185;
case 'V':
- case 'v': goto yy182;
+ case 'v': goto yy186;
default: goto yy15;
}
yy64:
- YYDEBUG(64, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYDEBUG(64, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'A':
- case 'a': goto yy183;
+ case 'a': goto yy187;
case 'R':
- case 'r': goto yy184;
+ case 'r': goto yy188;
default: goto yy15;
}
yy65:
- YYDEBUG(65, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYDEBUG(65, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'A':
- case 'a': goto yy185;
+ case 'a': goto yy189;
case 'E':
- case 'e': goto yy186;
+ case 'e': goto yy190;
default: goto yy15;
}
yy66:
- YYDEBUG(66, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYDEBUG(66, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy187;
+ case 'e': goto yy191;
case 'O':
- case 'o': goto yy188;
+ case 'o': goto yy192;
case 'U':
- case 'u': goto yy189;
+ case 'u': goto yy193;
case 'Y':
- case 'y': goto yy190;
+ case 'y': goto yy194;
default: goto yy15;
}
yy67:
- YYDEBUG(67, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYDEBUG(67, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'A':
- case 'a': goto yy191;
+ case 'a': goto yy195;
case 'E':
- case 'e': goto yy192;
+ case 'e': goto yy196;
case 'H':
- case 'h': goto yy193;
+ case 'h': goto yy197;
case 'Y':
- case 'y': goto yy194;
+ case 'y': goto yy198;
default: goto yy15;
}
yy68:
- YYDEBUG(68, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYDEBUG(68, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'N':
- case 'n': goto yy195;
+ case 'n': goto yy199;
case 'S':
- case 's': goto yy196;
+ case 's': goto yy200;
default: goto yy15;
}
yy69:
- YYDEBUG(69, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYDEBUG(69, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'H':
- case 'h': goto yy197;
+ case 'h': goto yy201;
case 'I':
- case 'i': goto yy198;
+ case 'i': goto yy202;
default: goto yy15;
}
yy70:
- YYDEBUG(70, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYDEBUG(70, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'O':
- case 'o': goto yy199;
+ case 'o': goto yy203;
default: goto yy15;
}
yy71:
- YYDEBUG(71, YYPEEK ());
- yyaccept = 4;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYDEBUG(71, YYPEEK());
+ yyaccept = 7;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
- case '"': goto yy200;
+ case '"': goto yy204;
default: goto yy72;
}
yy72:
- YYDEBUG(72, YYPEEK ());
-#line 347 "../ada.re2c"
- {*id = 77; continue;}
-#line 1289 "../ada_re2c.c"
+ YYDEBUG(72, YYPEEK());
+#line 379 "ada_annex_p.re2c"
+ {*id = 86; continue;}
+#line 1341 "ada_annex_p_re2c.c"
yy73:
- YYDEBUG(73, YYPEEK ());
- YYSKIP ();
- YYDEBUG(74, YYPEEK ());
-#line 349 "../ada.re2c"
- {*id = 79; continue;}
-#line 1296 "../ada_re2c.c"
+ YYDEBUG(73, YYPEEK());
+ YYSKIP();
+ YYDEBUG(74, YYPEEK());
+#line 381 "ada_annex_p.re2c"
+ {*id = 88; continue;}
+#line 1348 "ada_annex_p_re2c.c"
yy75:
- YYDEBUG(75, YYPEEK ());
+ YYDEBUG(75, YYPEEK());
yyaccept = 5;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
- YYDEBUG(76, YYPEEK ());
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ YYDEBUG(76, YYPEEK());
+ switch (yych) {
+ case '-':
+ case 'E':
+ case '[':
+ case 'e': goto yy128;
+ case '.': goto yy130;
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
+ case '_': goto yy75;
+ default: goto yy39;
+ }
+yy77:
+ YYDEBUG(77, YYPEEK());
+ yyaccept = 1;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 0x00:
case 0x01:
@@ -1424,8 +1501,9 @@ yy75:
case 'z':
case '{':
case '|':
+ case '}':
case '~':
- case 0x7F: goto yy75;
+ case 0x7F:
case 0xC2:
case 0xC3:
case 0xC4:
@@ -1455,8 +1533,8 @@ yy75:
case 0xDC:
case 0xDD:
case 0xDE:
- case 0xDF: goto yy201;
- case 0xE0: goto yy202;
+ case 0xDF:
+ case 0xE0:
case 0xE1:
case 0xE2:
case 0xE3:
@@ -1471,30 +1549,25 @@ yy75:
case 0xEC:
case 0xED:
case 0xEE:
- case 0xEF: goto yy203;
- case 0xF0: goto yy204;
+ case 0xEF:
+ case 0xF0:
case 0xF1:
case 0xF2:
- case 0xF3: goto yy205;
+ case 0xF3:
case 0xF4: goto yy206;
- default: goto yy77;
+ default: goto yy11;
}
-yy77:
- YYDEBUG(77, YYPEEK ());
-#line 272 "../ada.re2c"
- {*id = 2; continue;}
-#line 1487 "../ada_re2c.c"
yy78:
- YYDEBUG(78, YYPEEK ());
- YYSKIP ();
- YYDEBUG(79, YYPEEK ());
-#line 352 "../ada.re2c"
- {*id = 82; continue;}
-#line 1494 "../ada_re2c.c"
+ YYDEBUG(78, YYPEEK());
+ YYSKIP();
+ YYDEBUG(79, YYPEEK());
+#line 384 "ada_annex_p.re2c"
+ {*id = 91; continue;}
+#line 1567 "ada_annex_p_re2c.c"
yy80:
- YYDEBUG(80, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+ YYDEBUG(80, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -1560,15 +1633,45 @@ yy80:
case 0xBD:
case 0xBE:
case 0xBF: goto yy14;
- default: goto yy3;
+ default: goto yy11;
}
yy81:
- YYDEBUG(81, YYPEEK ());
- yyaccept = 0;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYDEBUG(81, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
case 0xA0:
case 0xA1:
case 0xA2:
@@ -1599,16 +1702,57 @@ yy81:
case 0xBB:
case 0xBC:
case 0xBD:
- case 0xBE:
- case 0xBF: goto yy102;
- default: goto yy3;
+ case 0xBE: goto yy14;
+ case 0xBF: goto yy215;
+ default: goto yy11;
}
yy82:
- YYDEBUG(82, YYPEEK ());
- yyaccept = 0;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYDEBUG(82, YYPEEK());
+ yyaccept = 1;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy104;
+ default: goto yy11;
+ }
+yy83:
+ YYDEBUG(83, YYPEEK());
+ yyaccept = 1;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -1673,15 +1817,15 @@ yy82:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy102;
- default: goto yy3;
+ case 0xBF: goto yy104;
+ default: goto yy11;
}
-yy83:
- YYDEBUG(83, YYPEEK ());
- yyaccept = 0;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy84:
+ YYDEBUG(84, YYPEEK());
+ yyaccept = 1;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 0x90:
case 0x91:
@@ -1730,15 +1874,15 @@ yy83:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy104;
- default: goto yy3;
+ case 0xBF: goto yy106;
+ default: goto yy11;
}
-yy84:
- YYDEBUG(84, YYPEEK ());
- yyaccept = 0;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy85:
+ YYDEBUG(85, YYPEEK());
+ yyaccept = 1;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -1803,15 +1947,15 @@ yy84:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy104;
- default: goto yy3;
+ case 0xBF: goto yy106;
+ default: goto yy11;
}
-yy85:
- YYDEBUG(85, YYPEEK ());
- yyaccept = 0;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy86:
+ YYDEBUG(86, YYPEEK());
+ yyaccept = 1;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -1828,15 +1972,200 @@ yy85:
case 0x8C:
case 0x8D:
case 0x8E:
- case 0x8F: goto yy104;
- default: goto yy3;
+ case 0x8F: goto yy106;
+ default: goto yy11;
}
-yy86:
- YYDEBUG(86, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
yy87:
- YYDEBUG(87, YYPEEK ());
+ YYDEBUG(87, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0xBF: goto yy2;
+ default: goto yy88;
+ }
+yy88:
+ YYDEBUG(88, YYPEEK());
+ YYRESTORE();
+ switch (yyaccept) {
+ case 0:
+ goto yy4;
+ case 1:
+ goto yy11;
+ case 2:
+ goto yy16;
+ case 3:
+ goto yy20;
+ case 4:
+ goto yy32;
+ case 5:
+ goto yy39;
+ case 6:
+ goto yy47;
+ case 7:
+ goto yy72;
+ case 8:
+ goto yy92;
+ case 9:
+ goto yy134;
+ case 10:
+ goto yy145;
+ case 11:
+ goto yy152;
+ case 12:
+ goto yy160;
+ case 13:
+ goto yy169;
+ case 14:
+ goto yy171;
+ case 15:
+ goto yy173;
+ case 16:
+ goto yy181;
+ case 17:
+ goto yy183;
+ case 18:
+ goto yy222;
+ case 19:
+ goto yy240;
+ case 20:
+ goto yy244;
+ case 21:
+ goto yy246;
+ case 22:
+ goto yy257;
+ case 23:
+ goto yy262;
+ case 24:
+ goto yy270;
+ case 25:
+ goto yy272;
+ case 26:
+ goto yy274;
+ case 27:
+ goto yy278;
+ case 28:
+ goto yy289;
+ case 29:
+ goto yy306;
+ case 30:
+ goto yy311;
+ case 31:
+ goto yy348;
+ case 32:
+ goto yy350;
+ case 33:
+ goto yy357;
+ case 34:
+ goto yy362;
+ case 35:
+ goto yy366;
+ case 36:
+ goto yy370;
+ case 37:
+ goto yy372;
+ case 38:
+ goto yy391;
+ case 39:
+ goto yy396;
+ case 40:
+ goto yy399;
+ case 41:
+ goto yy401;
+ case 42:
+ goto yy404;
+ case 43:
+ goto yy407;
+ case 44:
+ goto yy422;
+ case 45:
+ goto yy428;
+ case 46:
+ goto yy430;
+ case 47:
+ goto yy434;
+ case 48:
+ goto yy436;
+ case 49:
+ goto yy439;
+ case 50:
+ goto yy441;
+ case 51:
+ goto yy456;
+ case 52:
+ goto yy458;
+ case 53:
+ goto yy471;
+ case 54:
+ goto yy473;
+ case 55:
+ goto yy492;
+ case 56:
+ goto yy494;
+ case 57:
+ goto yy499;
+ case 58:
+ goto yy506;
+ case 59:
+ goto yy511;
+ case 60:
+ goto yy516;
+ case 61:
+ goto yy520;
+ case 62:
+ goto yy523;
+ case 63:
+ goto yy528;
+ case 64:
+ goto yy549;
+ case 65:
+ goto yy552;
+ case 66:
+ goto yy556;
+ case 67:
+ goto yy559;
+ case 68:
+ goto yy562;
+ case 69:
+ goto yy565;
+ case 70:
+ goto yy569;
+ case 71:
+ goto yy571;
+ case 72:
+ goto yy573;
+ case 73:
+ goto yy576;
+ case 74:
+ goto yy612;
+ case 75:
+ goto yy614;
+ case 76:
+ goto yy617;
+ case 77:
+ goto yy621;
+ case 78:
+ goto yy625;
+ case 79:
+ goto yy629;
+ case 80:
+ goto yy631;
+ case 81:
+ goto yy634;
+ case 82:
+ goto yy636;
+ case 83:
+ goto yy639;
+ case 84:
+ goto yy641;
+ default:
+ goto yy645;
+ }
+yy89:
+ YYDEBUG(89, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+yy90:
+ YYDEBUG(90, YYPEEK());
switch (yych) {
case ' ':
case '!':
@@ -1931,9 +2260,9 @@ yy87:
case '|':
case '}':
case '~':
- case 0x7F: goto yy86;
- case '"': goto yy89;
- case '[': goto yy91;
+ case 0x7F: goto yy89;
+ case '"': goto yy91;
+ case '[': goto yy93;
case 0xC2:
case 0xC3:
case 0xC4:
@@ -1963,8 +2292,8 @@ yy87:
case 0xDC:
case 0xDD:
case 0xDE:
- case 0xDF: goto yy93;
- case 0xE0: goto yy94;
+ case 0xDF: goto yy95;
+ case 0xE0: goto yy96;
case 0xE1:
case 0xE2:
case 0xE3:
@@ -1979,120 +2308,34 @@ yy87:
case 0xEC:
case 0xED:
case 0xEE:
- case 0xEF: goto yy95;
- case 0xF0: goto yy96;
+ case 0xEF: goto yy97;
+ case 0xF0: goto yy98;
case 0xF1:
case 0xF2:
- case 0xF3: goto yy97;
- case 0xF4: goto yy98;
+ case 0xF3: goto yy99;
+ case 0xF4: goto yy100;
default: goto yy88;
}
-yy88:
- YYDEBUG(88, YYPEEK ());
- YYRESTORE ();
- switch (yyaccept) {
- case 0: goto yy3;
- case 1: goto yy16;
- case 2: goto yy20;
- case 3: goto yy39;
- case 4: goto yy72;
- case 5: goto yy77;
- case 6: goto yy90;
- case 7: goto yy148;
- case 8: goto yy156;
- case 9: goto yy165;
- case 10: goto yy167;
- case 11: goto yy169;
- case 12: goto yy177;
- case 13: goto yy179;
- case 14: goto yy211;
- case 15: goto yy226;
- case 16: goto yy230;
- case 17: goto yy232;
- case 18: goto yy243;
- case 19: goto yy248;
- case 20: goto yy256;
- case 21: goto yy258;
- case 22: goto yy260;
- case 23: goto yy264;
- case 24: goto yy274;
- case 25: goto yy291;
- case 26: goto yy296;
- case 27: goto yy320;
- case 28: goto yy322;
- case 29: goto yy329;
- case 30: goto yy334;
- case 31: goto yy338;
- case 32: goto yy342;
- case 33: goto yy344;
- case 34: goto yy362;
- case 35: goto yy367;
- case 36: goto yy370;
- case 37: goto yy372;
- case 38: goto yy375;
- case 39: goto yy378;
- case 40: goto yy386;
- case 41: goto yy392;
- case 42: goto yy394;
- case 43: goto yy398;
- case 44: goto yy400;
- case 45: goto yy403;
- case 46: goto yy405;
- case 47: goto yy419;
- case 48: goto yy421;
- case 49: goto yy434;
- case 50: goto yy436;
- case 51: goto yy441;
- case 52: goto yy443;
- case 53: goto yy448;
- case 54: goto yy455;
- case 55: goto yy459;
- case 56: goto yy464;
- case 57: goto yy468;
- case 58: goto yy471;
- case 59: goto yy476;
- case 60: goto yy481;
- case 61: goto yy484;
- case 62: goto yy488;
- case 63: goto yy491;
- case 64: goto yy494;
- case 65: goto yy496;
- case 66: goto yy500;
- case 67: goto yy502;
- case 68: goto yy504;
- case 69: goto yy507;
- case 70: goto yy511;
- case 71: goto yy513;
- case 72: goto yy516;
- case 73: goto yy522;
- case 74: goto yy526;
- case 75: goto yy528;
- case 76: goto yy531;
- case 77: goto yy533;
- case 78: goto yy536;
- case 79: goto yy538;
- default: goto yy542;
- }
-yy89:
- YYDEBUG(89, YYPEEK ());
- yyaccept = 6;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy91:
+ YYDEBUG(91, YYPEEK());
+ yyaccept = 8;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
- case '"': goto yy86;
- default: goto yy90;
+ case '"': goto yy89;
+ default: goto yy92;
}
-yy90:
- YYDEBUG(90, YYPEEK ());
-#line 378 "../ada.re2c"
- {*id = 108; continue;}
-#line 2091 "../ada_re2c.c"
-yy91:
- YYDEBUG(91, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
- YYDEBUG(92, YYPEEK ());
+yy92:
+ YYDEBUG(92, YYPEEK());
+#line 410 "ada_annex_p.re2c"
+ {*id = 117; continue;}
+#line 2334 "ada_annex_p_re2c.c"
+yy93:
+ YYDEBUG(93, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ YYDEBUG(94, YYPEEK());
switch (yych) {
case ' ':
case '!':
@@ -2187,9 +2430,9 @@ yy91:
case '|':
case '}':
case '~':
- case 0x7F: goto yy86;
- case '"': goto yy207;
- case '[': goto yy91;
+ case 0x7F: goto yy89;
+ case '"': goto yy216;
+ case '[': goto yy93;
case 0xC2:
case 0xC3:
case 0xC4:
@@ -2219,8 +2462,8 @@ yy91:
case 0xDC:
case 0xDD:
case 0xDE:
- case 0xDF: goto yy93;
- case 0xE0: goto yy94;
+ case 0xDF: goto yy95;
+ case 0xE0: goto yy96;
case 0xE1:
case 0xE2:
case 0xE3:
@@ -2235,18 +2478,18 @@ yy91:
case 0xEC:
case 0xED:
case 0xEE:
- case 0xEF: goto yy95;
- case 0xF0: goto yy96;
+ case 0xEF: goto yy97;
+ case 0xF0: goto yy98;
case 0xF1:
case 0xF2:
- case 0xF3: goto yy97;
- case 0xF4: goto yy98;
+ case 0xF3: goto yy99;
+ case 0xF4: goto yy100;
default: goto yy88;
}
-yy93:
- YYDEBUG(93, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy95:
+ YYDEBUG(95, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -2311,13 +2554,13 @@ yy93:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy86;
+ case 0xBF: goto yy89;
default: goto yy88;
}
-yy94:
- YYDEBUG(94, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy96:
+ YYDEBUG(96, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0xA0:
case 0xA1:
@@ -2350,13 +2593,13 @@ yy94:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy93;
+ case 0xBF: goto yy95;
default: goto yy88;
}
-yy95:
- YYDEBUG(95, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy97:
+ YYDEBUG(97, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -2421,13 +2664,13 @@ yy95:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy93;
+ case 0xBF: goto yy95;
default: goto yy88;
}
-yy96:
- YYDEBUG(96, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy98:
+ YYDEBUG(98, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x90:
case 0x91:
@@ -2476,13 +2719,13 @@ yy96:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy95;
+ case 0xBF: goto yy97;
default: goto yy88;
}
-yy97:
- YYDEBUG(97, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy99:
+ YYDEBUG(99, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -2547,13 +2790,13 @@ yy97:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy95;
+ case 0xBF: goto yy97;
default: goto yy88;
}
-yy98:
- YYDEBUG(98, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy100:
+ YYDEBUG(100, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -2570,38 +2813,38 @@ yy98:
case 0x8C:
case 0x8D:
case 0x8E:
- case 0x8F: goto yy95;
+ case 0x8F: goto yy97;
default: goto yy88;
}
-yy99:
- YYDEBUG(99, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy101:
+ YYDEBUG(101, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case 'l': goto yy208;
- case 'n': goto yy209;
+ case 'l': goto yy217;
+ case 'n': goto yy218;
default: goto yy88;
}
-yy100:
- YYDEBUG(100, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy102:
+ YYDEBUG(102, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case 'f': goto yy119;
+ case 'f': goto yy219;
default: goto yy88;
}
-yy101:
- YYDEBUG(101, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy103:
+ YYDEBUG(103, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case '"': goto yy200;
+ case '"': goto yy204;
default: goto yy88;
}
-yy102:
- YYDEBUG(102, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy104:
+ YYDEBUG(104, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -2669,10 +2912,10 @@ yy102:
case 0xBF: goto yy14;
default: goto yy88;
}
-yy103:
- YYDEBUG(103, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy105:
+ YYDEBUG(105, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0xA0:
case 0xA1:
@@ -2705,13 +2948,13 @@ yy103:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy102;
+ case 0xBF: goto yy104;
default: goto yy88;
}
-yy104:
- YYDEBUG(104, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy106:
+ YYDEBUG(106, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -2776,13 +3019,13 @@ yy104:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy102;
+ case 0xBF: goto yy104;
default: goto yy88;
}
-yy105:
- YYDEBUG(105, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy107:
+ YYDEBUG(107, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x90:
case 0x91:
@@ -2831,13 +3074,13 @@ yy105:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy104;
+ case 0xBF: goto yy106;
default: goto yy88;
}
-yy106:
- YYDEBUG(106, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy108:
+ YYDEBUG(108, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -2902,13 +3145,13 @@ yy106:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy104;
+ case 0xBF: goto yy106;
default: goto yy88;
}
-yy107:
- YYDEBUG(107, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy109:
+ YYDEBUG(109, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -2925,38 +3168,38 @@ yy107:
case 0x8C:
case 0x8D:
case 0x8E:
- case 0x8F: goto yy104;
+ case 0x8F: goto yy106;
default: goto yy88;
}
-yy108:
- YYDEBUG(108, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy110:
+ YYDEBUG(110, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case '\'': goto yy210;
+ case '\'': goto yy221;
default: goto yy88;
}
-yy109:
- YYDEBUG(109, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy111:
+ YYDEBUG(111, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case '\'': goto yy212;
+ case '\'': goto yy223;
default: goto yy88;
}
-yy110:
- YYDEBUG(110, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy112:
+ YYDEBUG(112, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case '"': goto yy213;
- case '\'': goto yy210;
+ case '"': goto yy224;
+ case '\'': goto yy221;
default: goto yy88;
}
-yy111:
- YYDEBUG(111, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy113:
+ YYDEBUG(113, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -3021,13 +3264,13 @@ yy111:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy108;
+ case 0xBF: goto yy110;
default: goto yy88;
}
-yy112:
- YYDEBUG(112, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy114:
+ YYDEBUG(114, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0xA0:
case 0xA1:
@@ -3060,13 +3303,13 @@ yy112:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy111;
+ case 0xBF: goto yy113;
default: goto yy88;
}
-yy113:
- YYDEBUG(113, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy115:
+ YYDEBUG(115, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -3131,13 +3374,13 @@ yy113:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy111;
+ case 0xBF: goto yy113;
default: goto yy88;
}
-yy114:
- YYDEBUG(114, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy116:
+ YYDEBUG(116, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x90:
case 0x91:
@@ -3186,13 +3429,13 @@ yy114:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy113;
+ case 0xBF: goto yy115;
default: goto yy88;
}
-yy115:
- YYDEBUG(115, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy117:
+ YYDEBUG(117, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -3257,13 +3500,13 @@ yy115:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy113;
+ case 0xBF: goto yy115;
default: goto yy88;
}
-yy116:
- YYDEBUG(116, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy118:
+ YYDEBUG(118, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -3280,23 +3523,21 @@ yy116:
case 0x8C:
case 0x8D:
case 0x8E:
- case 0x8F: goto yy113;
+ case 0x8F: goto yy115;
default: goto yy88;
}
-yy117:
- YYDEBUG(117, YYPEEK ());
- YYSKIP ();
- YYDEBUG(118, YYPEEK ());
-#line 373 "../ada.re2c"
- {*id = 103; continue;}
-#line 3293 "../ada_re2c.c"
yy119:
- YYDEBUG(119, YYPEEK ());
- yyaccept = 5;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
- YYDEBUG(120, YYPEEK ());
+ YYDEBUG(119, YYPEEK());
+ YYSKIP();
+ YYDEBUG(120, YYPEEK());
+#line 405 "ada_annex_p.re2c"
+ {*id = 112; continue;}
+#line 3536 "ada_annex_p_re2c.c"
+yy121:
+ YYDEBUG(121, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ YYDEBUG(122, YYPEEK());
switch (yych) {
case 0x00:
case 0x01:
@@ -3423,7 +3664,9 @@ yy119:
case '|':
case '}':
case '~':
- case 0x7F: goto yy119;
+ case 0x7F: goto yy121;
+ case 0x04:
+ case '\n': goto yy225;
case 0xC2:
case 0xC3:
case 0xC4:
@@ -3453,8 +3696,8 @@ yy119:
case 0xDC:
case 0xDD:
case 0xDE:
- case 0xDF: goto yy214;
- case 0xE0: goto yy215;
+ case 0xDF: goto yy227;
+ case 0xE0: goto yy228;
case 0xE1:
case 0xE2:
case 0xE3:
@@ -3469,47 +3712,64 @@ yy119:
case 0xEC:
case 0xED:
case 0xEE:
- case 0xEF: goto yy216;
- case 0xF0: goto yy217;
+ case 0xEF: goto yy229;
+ case 0xF0: goto yy230;
case 0xF1:
case 0xF2:
- case 0xF3: goto yy218;
- case 0xF4: goto yy219;
- default: goto yy77;
+ case 0xF3: goto yy231;
+ case 0xF4: goto yy232;
+ default: goto yy88;
}
-yy121:
- YYDEBUG(121, YYPEEK ());
- YYSKIP ();
- YYDEBUG(122, YYPEEK ());
-#line 358 "../ada.re2c"
- {*id = 88; continue;}
-#line 3487 "../ada_re2c.c"
yy123:
- YYDEBUG(123, YYPEEK ());
- YYSKIP ();
- YYDEBUG(124, YYPEEK ());
-#line 371 "../ada.re2c"
- {*id = 101; continue;}
-#line 3494 "../ada_re2c.c"
+ YYDEBUG(123, YYPEEK());
+ YYSKIP();
+ YYDEBUG(124, YYPEEK());
+#line 390 "ada_annex_p.re2c"
+ {*id = 97; continue;}
+#line 3730 "ada_annex_p_re2c.c"
yy125:
- YYDEBUG(125, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+ YYDEBUG(125, YYPEEK());
+ YYSKIP();
+ YYDEBUG(126, YYPEEK());
+#line 403 "ada_annex_p.re2c"
+ {*id = 110; continue;}
+#line 3737 "ada_annex_p_re2c.c"
+yy127:
+ YYDEBUG(127, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case '#': goto yy88;
- default: goto yy221;
+ default: goto yy234;
}
-yy126:
- YYDEBUG(126, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
- YYDEBUG(127, YYPEEK ());
+yy128:
+ YYDEBUG(128, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ YYDEBUG(129, YYPEEK());
switch (yych) {
case '-':
- case '.':
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
case 'E':
+ case '[':
case '_':
- case 'e': goto yy126;
+ case 'e': goto yy128;
+ default: goto yy39;
+ }
+yy130:
+ YYDEBUG(130, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
case '0':
case '1':
case '2':
@@ -3519,123 +3779,147 @@ yy126:
case '6':
case '7':
case '8':
- case '9': goto yy222;
+ case '9': goto yy128;
default: goto yy88;
}
-yy128:
- YYDEBUG(128, YYPEEK ());
- YYSKIP ();
- YYDEBUG(129, YYPEEK ());
-#line 355 "../ada.re2c"
- {*id = 85; continue;}
-#line 3532 "../ada_re2c.c"
-yy130:
- YYDEBUG(130, YYPEEK ());
- YYSKIP ();
- YYDEBUG(131, YYPEEK ());
-#line 366 "../ada.re2c"
- {*id = 96; continue;}
-#line 3539 "../ada_re2c.c"
-yy132:
- YYDEBUG(132, YYPEEK ());
- YYSKIP ();
- YYDEBUG(133, YYPEEK ());
-#line 365 "../ada.re2c"
- {*id = 95; continue;}
-#line 3546 "../ada_re2c.c"
+yy131:
+ YYDEBUG(131, YYPEEK());
+ YYSKIP();
+ YYDEBUG(132, YYPEEK());
+#line 387 "ada_annex_p.re2c"
+ {*id = 94; continue;}
+#line 3792 "ada_annex_p_re2c.c"
+yy133:
+ YYDEBUG(133, YYPEEK());
+ yyaccept = 9;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case '<': goto yy235;
+ default: goto yy134;
+ }
yy134:
- YYDEBUG(134, YYPEEK ());
- YYSKIP ();
- YYDEBUG(135, YYPEEK ());
-#line 353 "../ada.re2c"
- {*id = 83; continue;}
-#line 3553 "../ada_re2c.c"
-yy136:
- YYDEBUG(136, YYPEEK ());
- YYSKIP ();
- YYDEBUG(137, YYPEEK ());
-#line 360 "../ada.re2c"
- {*id = 90; continue;}
-#line 3560 "../ada_re2c.c"
-yy138:
- YYDEBUG(138, YYPEEK ());
- YYSKIP ();
- YYDEBUG(139, YYPEEK ());
-#line 362 "../ada.re2c"
- {*id = 92; continue;}
-#line 3567 "../ada_re2c.c"
+ YYDEBUG(134, YYPEEK());
+#line 398 "ada_annex_p.re2c"
+ {*id = 105; continue;}
+#line 3807 "ada_annex_p_re2c.c"
+yy135:
+ YYDEBUG(135, YYPEEK());
+ YYSKIP();
+ YYDEBUG(136, YYPEEK());
+#line 397 "ada_annex_p.re2c"
+ {*id = 104; continue;}
+#line 3814 "ada_annex_p_re2c.c"
+yy137:
+ YYDEBUG(137, YYPEEK());
+ YYSKIP();
+ YYDEBUG(138, YYPEEK());
+#line 385 "ada_annex_p.re2c"
+ {*id = 92; continue;}
+#line 3821 "ada_annex_p_re2c.c"
+yy139:
+ YYDEBUG(139, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case '=': goto yy236;
+ default: goto yy88;
+ }
yy140:
- YYDEBUG(140, YYPEEK ());
- YYSKIP ();
- YYDEBUG(141, YYPEEK ());
-#line 363 "../ada.re2c"
- {*id = 93; continue;}
-#line 3574 "../ada_re2c.c"
+ YYDEBUG(140, YYPEEK());
+ YYSKIP();
+ YYDEBUG(141, YYPEEK());
+#line 392 "ada_annex_p.re2c"
+ {*id = 99; continue;}
+#line 3836 "ada_annex_p_re2c.c"
yy142:
- YYDEBUG(142, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYDEBUG(142, YYPEEK());
+ YYSKIP();
+ YYDEBUG(143, YYPEEK());
+#line 394 "ada_annex_p.re2c"
+ {*id = 101; continue;}
+#line 3843 "ada_annex_p_re2c.c"
+yy144:
+ YYDEBUG(144, YYPEEK());
+ yyaccept = 10;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case '>': goto yy237;
+ default: goto yy145;
+ }
+yy145:
+ YYDEBUG(145, YYPEEK());
+#line 395 "ada_annex_p.re2c"
+ {*id = 102; continue;}
+#line 3858 "ada_annex_p_re2c.c"
+yy146:
+ YYDEBUG(146, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'O':
- case 'o': goto yy224;
+ case 'o': goto yy238;
case 'S':
- case 's': goto yy225;
+ case 's': goto yy239;
default: goto yy15;
}
-yy143:
- YYDEBUG(143, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy147:
+ YYDEBUG(147, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'C':
- case 'c': goto yy227;
+ case 'c': goto yy241;
default: goto yy15;
}
-yy144:
- YYDEBUG(144, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy148:
+ YYDEBUG(148, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'I':
- case 'i': goto yy228;
+ case 'i': goto yy242;
case 'L':
- case 'l': goto yy229;
+ case 'l': goto yy243;
default: goto yy15;
}
-yy145:
- YYDEBUG(145, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy149:
+ YYDEBUG(149, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'D':
- case 'd': goto yy231;
+ case 'd': goto yy245;
default: goto yy15;
}
-yy146:
- YYDEBUG(146, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy150:
+ YYDEBUG(150, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'R':
- case 'r': goto yy233;
+ case 'r': goto yy247;
default: goto yy15;
}
-yy147:
- YYDEBUG(147, YYPEEK ());
- yyaccept = 7;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy151:
+ YYDEBUG(151, YYPEEK());
+ yyaccept = 11;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -3752,87 +4036,87 @@ yy147:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy148;
+ default: goto yy152;
}
-yy148:
- YYDEBUG(148, YYPEEK ());
-#line 282 "../ada.re2c"
- {*id = 12; continue;}
-#line 3762 "../ada_re2c.c"
-yy149:
- YYDEBUG(149, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy152:
+ YYDEBUG(152, YYPEEK());
+#line 304 "ada_annex_p.re2c"
+ {*id = 11; continue;}
+#line 4046 "ada_annex_p_re2c.c"
+yy153:
+ YYDEBUG(153, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'G':
- case 'g': goto yy234;
+ case 'g': goto yy248;
default: goto yy15;
}
-yy150:
- YYDEBUG(150, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy154:
+ YYDEBUG(154, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'D':
- case 'd': goto yy235;
+ case 'd': goto yy249;
default: goto yy15;
}
-yy151:
- YYDEBUG(151, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy155:
+ YYDEBUG(155, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'S':
- case 's': goto yy236;
+ case 's': goto yy250;
default: goto yy15;
}
-yy152:
- YYDEBUG(152, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy156:
+ YYDEBUG(156, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'N':
- case 'n': goto yy237;
+ case 'n': goto yy251;
default: goto yy15;
}
-yy153:
- YYDEBUG(153, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy157:
+ YYDEBUG(157, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'C':
- case 'c': goto yy238;
+ case 'c': goto yy252;
case 'L':
- case 'l': goto yy239;
+ case 'l': goto yy253;
default: goto yy15;
}
-yy154:
- YYDEBUG(154, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy158:
+ YYDEBUG(158, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'G':
- case 'g': goto yy240;
+ case 'g': goto yy254;
default: goto yy15;
}
-yy155:
- YYDEBUG(155, YYPEEK ());
- yyaccept = 8;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy159:
+ YYDEBUG(159, YYPEEK());
+ yyaccept = 12;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -3949,100 +4233,100 @@ yy155:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy156;
+ default: goto yy160;
}
-yy156:
- YYDEBUG(156, YYPEEK ());
-#line 291 "../ada.re2c"
- {*id = 21; continue;}
-#line 3959 "../ada_re2c.c"
-yy157:
- YYDEBUG(157, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy160:
+ YYDEBUG(160, YYPEEK());
+#line 326 "ada_annex_p.re2c"
+ {*id = 33; continue;}
+#line 4243 "ada_annex_p_re2c.c"
+yy161:
+ YYDEBUG(161, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'S':
- case 's': goto yy241;
+ case 's': goto yy255;
default: goto yy15;
}
-yy158:
- YYDEBUG(158, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy162:
+ YYDEBUG(162, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'D':
- case 'd': goto yy242;
+ case 'd': goto yy256;
case 'T':
- case 't': goto yy244;
+ case 't': goto yy258;
default: goto yy15;
}
-yy159:
- YYDEBUG(159, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy163:
+ YYDEBUG(163, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'C':
- case 'c': goto yy245;
+ case 'c': goto yy259;
case 'I':
- case 'i': goto yy246;
+ case 'i': goto yy260;
default: goto yy15;
}
-yy160:
- YYDEBUG(160, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy164:
+ YYDEBUG(164, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'R':
- case 'r': goto yy247;
+ case 'r': goto yy261;
default: goto yy15;
}
-yy161:
- YYDEBUG(161, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy165:
+ YYDEBUG(165, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'N':
- case 'n': goto yy249;
+ case 'n': goto yy263;
default: goto yy15;
}
-yy162:
- YYDEBUG(162, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy166:
+ YYDEBUG(166, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'N':
- case 'n': goto yy250;
+ case 'n': goto yy264;
default: goto yy15;
}
-yy163:
- YYDEBUG(163, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy167:
+ YYDEBUG(167, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'T':
- case 't': goto yy251;
+ case 't': goto yy265;
default: goto yy15;
}
-yy164:
- YYDEBUG(164, YYPEEK ());
- yyaccept = 9;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy168:
+ YYDEBUG(168, YYPEEK());
+ yyaccept = 13;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -4159,19 +4443,19 @@ yy164:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy165;
+ default: goto yy169;
}
-yy165:
- YYDEBUG(165, YYPEEK ());
-#line 302 "../ada.re2c"
- {*id = 32; continue;}
-#line 4169 "../ada_re2c.c"
-yy166:
- YYDEBUG(166, YYPEEK ());
- yyaccept = 10;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy169:
+ YYDEBUG(169, YYPEEK());
+#line 335 "ada_annex_p.re2c"
+ {*id = 42; continue;}
+#line 4453 "ada_annex_p_re2c.c"
+yy170:
+ YYDEBUG(170, YYPEEK());
+ yyaccept = 14;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -4287,20 +4571,20 @@ yy166:
case 0xF3:
case 0xF4: goto yy15;
case 'T':
- case 't': goto yy252;
- default: goto yy167;
+ case 't': goto yy266;
+ default: goto yy171;
}
-yy167:
- YYDEBUG(167, YYPEEK ());
-#line 303 "../ada.re2c"
- {*id = 33; continue;}
-#line 4298 "../ada_re2c.c"
-yy168:
- YYDEBUG(168, YYPEEK ());
- yyaccept = 11;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy171:
+ YYDEBUG(171, YYPEEK());
+#line 340 "ada_annex_p.re2c"
+ {*id = 47; continue;}
+#line 4582 "ada_annex_p_re2c.c"
+yy172:
+ YYDEBUG(172, YYPEEK());
+ yyaccept = 15;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -4417,85 +4701,85 @@ yy168:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy169;
+ default: goto yy173;
}
-yy169:
- YYDEBUG(169, YYPEEK ());
-#line 305 "../ada.re2c"
- {*id = 35; continue;}
-#line 4427 "../ada_re2c.c"
-yy170:
- YYDEBUG(170, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy173:
+ YYDEBUG(173, YYPEEK());
+#line 375 "ada_annex_p.re2c"
+ {*id = 82; continue;}
+#line 4711 "ada_annex_p_re2c.c"
+yy174:
+ YYDEBUG(174, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'M':
- case 'm': goto yy253;
+ case 'm': goto yy267;
default: goto yy15;
}
-yy171:
- YYDEBUG(171, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy175:
+ YYDEBUG(175, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'O':
- case 'o': goto yy254;
+ case 'o': goto yy268;
default: goto yy15;
}
-yy172:
- YYDEBUG(172, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy176:
+ YYDEBUG(176, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'D':
- case 'd': goto yy255;
+ case 'd': goto yy269;
default: goto yy15;
}
-yy173:
- YYDEBUG(173, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy177:
+ YYDEBUG(177, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'W':
- case 'w': goto yy257;
+ case 'w': goto yy271;
default: goto yy15;
}
-yy174:
- YYDEBUG(174, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy178:
+ YYDEBUG(178, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'T':
- case 't': goto yy259;
+ case 't': goto yy273;
default: goto yy15;
}
-yy175:
- YYDEBUG(175, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy179:
+ YYDEBUG(179, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'L':
- case 'l': goto yy261;
+ case 'l': goto yy275;
default: goto yy15;
}
-yy176:
- YYDEBUG(176, YYPEEK ());
- yyaccept = 12;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy180:
+ YYDEBUG(180, YYPEEK());
+ yyaccept = 16;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -4612,19 +4896,19 @@ yy176:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy177;
+ default: goto yy181;
}
-yy177:
- YYDEBUG(177, YYPEEK ());
-#line 312 "../ada.re2c"
- {*id = 42; continue;}
-#line 4622 "../ada_re2c.c"
-yy178:
- YYDEBUG(178, YYPEEK ());
- yyaccept = 13;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy181:
+ YYDEBUG(181, YYPEEK());
+#line 362 "ada_annex_p.re2c"
+ {*id = 69; continue;}
+#line 4906 "ada_annex_p_re2c.c"
+yy182:
+ YYDEBUG(182, YYPEEK());
+ yyaccept = 17;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -4741,259 +5025,261 @@ yy178:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy179;
+ default: goto yy183;
}
-yy179:
- YYDEBUG(179, YYPEEK ());
-#line 313 "../ada.re2c"
- {*id = 43; continue;}
-#line 4751 "../ada_re2c.c"
-yy180:
- YYDEBUG(180, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy183:
+ YYDEBUG(183, YYPEEK());
+#line 342 "ada_annex_p.re2c"
+ {*id = 49; continue;}
+#line 5035 "ada_annex_p_re2c.c"
+yy184:
+ YYDEBUG(184, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'H':
- case 'h': goto yy262;
+ case 'h': goto yy276;
default: goto yy15;
}
-yy181:
- YYDEBUG(181, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy185:
+ YYDEBUG(185, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'T':
- case 't': goto yy263;
+ case 't': goto yy277;
default: goto yy15;
}
-yy182:
- YYDEBUG(182, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy186:
+ YYDEBUG(186, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy265;
+ case 'e': goto yy279;
default: goto yy15;
}
-yy183:
- YYDEBUG(183, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy187:
+ YYDEBUG(187, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'C':
- case 'c': goto yy266;
+ case 'c': goto yy280;
+ case 'R':
+ case 'r': goto yy281;
default: goto yy15;
}
-yy184:
- YYDEBUG(184, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy188:
+ YYDEBUG(188, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'A':
- case 'a': goto yy267;
+ case 'a': goto yy282;
case 'I':
- case 'i': goto yy268;
+ case 'i': goto yy283;
case 'O':
- case 'o': goto yy269;
+ case 'o': goto yy284;
default: goto yy15;
}
-yy185:
- YYDEBUG(185, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy189:
+ YYDEBUG(189, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'I':
- case 'i': goto yy270;
+ case 'i': goto yy285;
case 'N':
- case 'n': goto yy271;
+ case 'n': goto yy286;
default: goto yy15;
}
-yy186:
- YYDEBUG(186, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy190:
+ YYDEBUG(190, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'C':
- case 'c': goto yy272;
+ case 'c': goto yy287;
case 'M':
- case 'm': goto yy273;
+ case 'm': goto yy288;
case 'N':
- case 'n': goto yy275;
+ case 'n': goto yy290;
case 'Q':
- case 'q': goto yy276;
+ case 'q': goto yy291;
case 'T':
- case 't': goto yy277;
+ case 't': goto yy292;
case 'V':
- case 'v': goto yy278;
+ case 'v': goto yy293;
default: goto yy15;
}
-yy187:
- YYDEBUG(187, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy191:
+ YYDEBUG(191, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'L':
- case 'l': goto yy279;
+ case 'l': goto yy294;
case 'P':
- case 'p': goto yy280;
+ case 'p': goto yy295;
default: goto yy15;
}
-yy188:
- YYDEBUG(188, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy192:
+ YYDEBUG(192, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'M':
- case 'm': goto yy281;
+ case 'm': goto yy296;
default: goto yy15;
}
-yy189:
- YYDEBUG(189, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy193:
+ YYDEBUG(193, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'B':
- case 'b': goto yy282;
+ case 'b': goto yy297;
default: goto yy15;
}
-yy190:
- YYDEBUG(190, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy194:
+ YYDEBUG(194, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'N':
- case 'n': goto yy283;
+ case 'n': goto yy298;
default: goto yy15;
}
-yy191:
- YYDEBUG(191, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy195:
+ YYDEBUG(195, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'G':
- case 'g': goto yy284;
+ case 'g': goto yy299;
case 'S':
- case 's': goto yy285;
+ case 's': goto yy300;
default: goto yy15;
}
-yy192:
- YYDEBUG(192, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy196:
+ YYDEBUG(196, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'R':
- case 'r': goto yy286;
+ case 'r': goto yy301;
default: goto yy15;
}
-yy193:
- YYDEBUG(193, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy197:
+ YYDEBUG(197, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy287;
+ case 'e': goto yy302;
default: goto yy15;
}
-yy194:
- YYDEBUG(194, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy198:
+ YYDEBUG(198, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'P':
- case 'p': goto yy288;
+ case 'p': goto yy303;
default: goto yy15;
}
-yy195:
- YYDEBUG(195, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy199:
+ YYDEBUG(199, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'T':
- case 't': goto yy289;
+ case 't': goto yy304;
default: goto yy15;
}
-yy196:
- YYDEBUG(196, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy200:
+ YYDEBUG(200, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy290;
+ case 'e': goto yy305;
default: goto yy15;
}
-yy197:
- YYDEBUG(197, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy201:
+ YYDEBUG(201, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy292;
+ case 'e': goto yy307;
case 'I':
- case 'i': goto yy293;
+ case 'i': goto yy308;
default: goto yy15;
}
-yy198:
- YYDEBUG(198, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy202:
+ YYDEBUG(202, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'T':
- case 't': goto yy294;
+ case 't': goto yy309;
default: goto yy15;
}
-yy199:
- YYDEBUG(199, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy203:
+ YYDEBUG(203, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'R':
- case 'r': goto yy295;
+ case 'r': goto yy310;
default: goto yy15;
}
-yy200:
- YYDEBUG(200, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy204:
+ YYDEBUG(204, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -5016,13 +5302,206 @@ yy200:
case 'c':
case 'd':
case 'e':
- case 'f': goto yy297;
+ case 'f': goto yy312;
default: goto yy88;
}
-yy201:
- YYDEBUG(201, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy205:
+ YYDEBUG(205, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+yy206:
+ YYDEBUG(206, YYPEEK());
+ switch (yych) {
+ case 0x00:
+ case 0x01:
+ case 0x02:
+ case 0x03:
+ case 0x05:
+ case 0x06:
+ case 0x07:
+ case 0x08:
+ case '\t':
+ case '\v':
+ case '\f':
+ case '\r':
+ case 0x0E:
+ case 0x0F:
+ case 0x10:
+ case 0x11:
+ case 0x12:
+ case 0x13:
+ case 0x14:
+ case 0x15:
+ case 0x16:
+ case 0x17:
+ case 0x18:
+ case 0x19:
+ case 0x1A:
+ case 0x1B:
+ case 0x1C:
+ case 0x1D:
+ case 0x1E:
+ case 0x1F:
+ case ' ':
+ case '!':
+ case '"':
+ case '#':
+ case '$':
+ case '%':
+ case '&':
+ case '\'':
+ case '(':
+ case ')':
+ case '*':
+ case '+':
+ case ',':
+ case '-':
+ case '.':
+ case '/':
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
+ case ':':
+ case ';':
+ case '<':
+ case '=':
+ case '>':
+ case '?':
+ case '@':
+ case 'A':
+ case 'B':
+ case 'C':
+ case 'D':
+ case 'E':
+ case 'F':
+ case 'G':
+ case 'H':
+ case 'I':
+ case 'J':
+ case 'K':
+ case 'L':
+ case 'M':
+ case 'N':
+ case 'O':
+ case 'P':
+ case 'Q':
+ case 'R':
+ case 'S':
+ case 'T':
+ case 'U':
+ case 'V':
+ case 'W':
+ case 'X':
+ case 'Y':
+ case 'Z':
+ case '[':
+ case '\\':
+ case ']':
+ case '^':
+ case '_':
+ case '`':
+ case 'a':
+ case 'b':
+ case 'c':
+ case 'd':
+ case 'e':
+ case 'f':
+ case 'g':
+ case 'h':
+ case 'i':
+ case 'j':
+ case 'k':
+ case 'l':
+ case 'm':
+ case 'n':
+ case 'o':
+ case 'p':
+ case 'q':
+ case 'r':
+ case 's':
+ case 't':
+ case 'u':
+ case 'v':
+ case 'w':
+ case 'x':
+ case 'y':
+ case 'z':
+ case '{':
+ case '|':
+ case '~':
+ case 0x7F: goto yy205;
+ case '}': goto yy207;
+ case 0xC2:
+ case 0xC3:
+ case 0xC4:
+ case 0xC5:
+ case 0xC6:
+ case 0xC7:
+ case 0xC8:
+ case 0xC9:
+ case 0xCA:
+ case 0xCB:
+ case 0xCC:
+ case 0xCD:
+ case 0xCE:
+ case 0xCF:
+ case 0xD0:
+ case 0xD1:
+ case 0xD2:
+ case 0xD3:
+ case 0xD4:
+ case 0xD5:
+ case 0xD6:
+ case 0xD7:
+ case 0xD8:
+ case 0xD9:
+ case 0xDA:
+ case 0xDB:
+ case 0xDC:
+ case 0xDD:
+ case 0xDE:
+ case 0xDF: goto yy209;
+ case 0xE0: goto yy210;
+ case 0xE1:
+ case 0xE2:
+ case 0xE3:
+ case 0xE4:
+ case 0xE5:
+ case 0xE6:
+ case 0xE7:
+ case 0xE8:
+ case 0xE9:
+ case 0xEA:
+ case 0xEB:
+ case 0xEC:
+ case 0xED:
+ case 0xEE:
+ case 0xEF: goto yy211;
+ case 0xF0: goto yy212;
+ case 0xF1:
+ case 0xF2:
+ case 0xF3: goto yy213;
+ case 0xF4: goto yy214;
+ default: goto yy88;
+ }
+yy207:
+ YYDEBUG(207, YYPEEK());
+ YYSKIP();
+ YYDEBUG(208, YYPEEK());
+#line 303 "ada_annex_p.re2c"
+ {*id = 10; if (lexer->cursor[-1] == 0x0a || (lexer->cursor[-1] == 0x0d
&& lexer->cursor[-2] == 0x0a)) lexer->line++; continue;}
+#line 5501 "ada_annex_p_re2c.c"
+yy209:
+ YYDEBUG(209, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -5087,13 +5566,13 @@ yy201:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy75;
+ case 0xBF: goto yy205;
default: goto yy88;
}
-yy202:
- YYDEBUG(202, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy210:
+ YYDEBUG(210, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0xA0:
case 0xA1:
@@ -5126,13 +5605,13 @@ yy202:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy201;
+ case 0xBF: goto yy209;
default: goto yy88;
}
-yy203:
- YYDEBUG(203, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy211:
+ YYDEBUG(211, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -5197,13 +5676,13 @@ yy203:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy201;
+ case 0xBF: goto yy209;
default: goto yy88;
}
-yy204:
- YYDEBUG(204, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy212:
+ YYDEBUG(212, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x90:
case 0x91:
@@ -5252,13 +5731,13 @@ yy204:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy203;
+ case 0xBF: goto yy211;
default: goto yy88;
}
-yy205:
- YYDEBUG(205, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy213:
+ YYDEBUG(213, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -5323,13 +5802,13 @@ yy205:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy203;
+ case 0xBF: goto yy211;
default: goto yy88;
}
-yy206:
- YYDEBUG(206, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy214:
+ YYDEBUG(214, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -5346,25 +5825,164 @@ yy206:
case 0x8C:
case 0x8D:
case 0x8E:
- case 0x8F: goto yy203;
+ case 0x8F: goto yy211;
default: goto yy88;
}
-yy207:
- YYDEBUG(207, YYPEEK ());
- yyaccept = 6;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy215:
+ YYDEBUG(215, YYPEEK());
+ yyaccept = 0;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
- case '"': goto yy86;
- case '0':
- case '1':
- case '2':
- case '3':
- case '4':
- case '5':
- case '6':
- case '7':
+ case 0x00:
+ case 0x01:
+ case 0x02:
+ case 0x03:
+ case 0x05:
+ case 0x06:
+ case 0x07:
+ case 0x08:
+ case '\t':
+ case '\v':
+ case '\f':
+ case '\r':
+ case 0x0E:
+ case 0x0F:
+ case ' ': goto yy2;
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
+ case 'A':
+ case 'B':
+ case 'C':
+ case 'D':
+ case 'E':
+ case 'F':
+ case 'G':
+ case 'H':
+ case 'I':
+ case 'J':
+ case 'K':
+ case 'L':
+ case 'M':
+ case 'N':
+ case 'O':
+ case 'P':
+ case 'Q':
+ case 'R':
+ case 'S':
+ case 'T':
+ case 'U':
+ case 'V':
+ case 'W':
+ case 'X':
+ case 'Y':
+ case 'Z':
+ case '_':
+ case 'a':
+ case 'b':
+ case 'c':
+ case 'd':
+ case 'e':
+ case 'f':
+ case 'g':
+ case 'h':
+ case 'i':
+ case 'j':
+ case 'k':
+ case 'l':
+ case 'm':
+ case 'n':
+ case 'o':
+ case 'p':
+ case 'q':
+ case 'r':
+ case 's':
+ case 't':
+ case 'u':
+ case 'v':
+ case 'w':
+ case 'x':
+ case 'y':
+ case 'z': goto yy14;
+ case '[': goto yy103;
+ case 0xC2:
+ case 0xC4:
+ case 0xC5:
+ case 0xC6:
+ case 0xC7:
+ case 0xC8:
+ case 0xC9:
+ case 0xCA:
+ case 0xCB:
+ case 0xCC:
+ case 0xCD:
+ case 0xCE:
+ case 0xCF:
+ case 0xD0:
+ case 0xD1:
+ case 0xD2:
+ case 0xD3:
+ case 0xD4:
+ case 0xD5:
+ case 0xD6:
+ case 0xD7:
+ case 0xD8:
+ case 0xD9:
+ case 0xDA:
+ case 0xDB:
+ case 0xDC:
+ case 0xDD:
+ case 0xDE:
+ case 0xDF: goto yy104;
+ case 0xC3: goto yy314;
+ case 0xE0: goto yy105;
+ case 0xE1:
+ case 0xE2:
+ case 0xE3:
+ case 0xE4:
+ case 0xE5:
+ case 0xE6:
+ case 0xE7:
+ case 0xE8:
+ case 0xE9:
+ case 0xEA:
+ case 0xEB:
+ case 0xEC:
+ case 0xED:
+ case 0xEE:
+ case 0xEF: goto yy106;
+ case 0xF0: goto yy107;
+ case 0xF1:
+ case 0xF2:
+ case 0xF3: goto yy108;
+ case 0xF4: goto yy109;
+ default: goto yy4;
+ }
+yy216:
+ YYDEBUG(216, YYPEEK());
+ yyaccept = 8;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case '"': goto yy89;
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
case '8':
case '9':
case 'A':
@@ -5378,40 +5996,61 @@ yy207:
case 'c':
case 'd':
case 'e':
- case 'f': goto yy299;
- default: goto yy90;
+ case 'f': goto yy315;
+ default: goto yy92;
}
-yy208:
- YYDEBUG(208, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy217:
+ YYDEBUG(217, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case 's': goto yy301;
+ case 's': goto yy317;
default: goto yy88;
}
-yy209:
- YYDEBUG(209, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy218:
+ YYDEBUG(218, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case 'd': goto yy119;
+ case 'd': goto yy318;
default: goto yy88;
}
-yy210:
- YYDEBUG(210, YYPEEK ());
- YYSKIP ();
-yy211:
- YYDEBUG(211, YYPEEK ());
-#line 379 "../ada.re2c"
- {*id = 109; continue;}
-#line 5408 "../ada_re2c.c"
-yy212:
- YYDEBUG(212, YYPEEK ());
- yyaccept = 14;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy219:
+ YYDEBUG(219, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ YYDEBUG(220, YYPEEK());
switch (yych) {
+ case 0x00:
+ case 0x01:
+ case 0x02:
+ case 0x03:
+ case 0x05:
+ case 0x06:
+ case 0x07:
+ case 0x08:
+ case '\t':
+ case '\v':
+ case '\f':
+ case '\r':
+ case 0x0E:
+ case 0x0F:
+ case 0x10:
+ case 0x11:
+ case 0x12:
+ case 0x13:
+ case 0x14:
+ case 0x15:
+ case 0x16:
+ case 0x17:
+ case 0x18:
+ case 0x19:
+ case 0x1A:
+ case 0x1B:
+ case 0x1C:
+ case 0x1D:
+ case 0x1E:
+ case 0x1F:
case ' ':
case '!':
case '"':
@@ -5471,6 +6110,7 @@ yy212:
case 'X':
case 'Y':
case 'Z':
+ case '[':
case '\\':
case ']':
case '^':
@@ -5506,8 +6146,9 @@ yy212:
case '|':
case '}':
case '~':
- case 0x7F: goto yy302;
- case '[': goto yy303;
+ case 0x7F: goto yy219;
+ case 0x04:
+ case '\n': goto yy319;
case 0xC2:
case 0xC3:
case 0xC4:
@@ -5537,8 +6178,8 @@ yy212:
case 0xDC:
case 0xDD:
case 0xDE:
- case 0xDF: goto yy304;
- case 0xE0: goto yy305;
+ case 0xDF: goto yy321;
+ case 0xE0: goto yy322;
case 0xE1:
case 0xE2:
case 0xE3:
@@ -5553,106 +6194,238 @@ yy212:
case 0xEC:
case 0xED:
case 0xEE:
- case 0xEF: goto yy306;
- case 0xF0: goto yy307;
+ case 0xEF: goto yy323;
+ case 0xF0: goto yy324;
case 0xF1:
case 0xF2:
- case 0xF3: goto yy308;
- case 0xF4: goto yy309;
- default: goto yy211;
- }
-yy213:
- YYDEBUG(213, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
- switch (yych) {
- case '"': goto yy88;
- default: goto yy311;
- }
-yy214:
- YYDEBUG(214, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
- switch (yych) {
- case 0x80:
- case 0x81:
- case 0x82:
- case 0x83:
- case 0x84:
- case 0x85:
- case 0x86:
- case 0x87:
- case 0x88:
- case 0x89:
- case 0x8A:
- case 0x8B:
- case 0x8C:
- case 0x8D:
- case 0x8E:
- case 0x8F:
- case 0x90:
- case 0x91:
- case 0x92:
- case 0x93:
- case 0x94:
- case 0x95:
- case 0x96:
- case 0x97:
- case 0x98:
- case 0x99:
- case 0x9A:
- case 0x9B:
- case 0x9C:
- case 0x9D:
- case 0x9E:
- case 0x9F:
- case 0xA0:
- case 0xA1:
- case 0xA2:
- case 0xA3:
- case 0xA4:
- case 0xA5:
- case 0xA6:
- case 0xA7:
- case 0xA8:
- case 0xA9:
- case 0xAA:
- case 0xAB:
- case 0xAC:
- case 0xAD:
- case 0xAE:
- case 0xAF:
- case 0xB0:
- case 0xB1:
- case 0xB2:
- case 0xB3:
- case 0xB4:
- case 0xB5:
- case 0xB6:
- case 0xB7:
- case 0xB8:
- case 0xB9:
- case 0xBA:
- case 0xBB:
- case 0xBC:
- case 0xBD:
- case 0xBE:
- case 0xBF: goto yy119;
+ case 0xF3: goto yy325;
+ case 0xF4: goto yy326;
default: goto yy88;
}
-yy215:
- YYDEBUG(215, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy221:
+ YYDEBUG(221, YYPEEK());
+ YYSKIP();
+yy222:
+ YYDEBUG(222, YYPEEK());
+#line 411 "ada_annex_p.re2c"
+ {*id = 118; continue;}
+#line 6213 "ada_annex_p_re2c.c"
+yy223:
+ YYDEBUG(223, YYPEEK());
+ yyaccept = 18;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
- case 0xA0:
- case 0xA1:
- case 0xA2:
- case 0xA3:
- case 0xA4:
- case 0xA5:
- case 0xA6:
- case 0xA7:
+ case ' ':
+ case '!':
+ case '"':
+ case '#':
+ case '$':
+ case '%':
+ case '&':
+ case '\'':
+ case '(':
+ case ')':
+ case '*':
+ case '+':
+ case ',':
+ case '-':
+ case '.':
+ case '/':
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
+ case ':':
+ case ';':
+ case '<':
+ case '=':
+ case '>':
+ case '?':
+ case '@':
+ case 'A':
+ case 'B':
+ case 'C':
+ case 'D':
+ case 'E':
+ case 'F':
+ case 'G':
+ case 'H':
+ case 'I':
+ case 'J':
+ case 'K':
+ case 'L':
+ case 'M':
+ case 'N':
+ case 'O':
+ case 'P':
+ case 'Q':
+ case 'R':
+ case 'S':
+ case 'T':
+ case 'U':
+ case 'V':
+ case 'W':
+ case 'X':
+ case 'Y':
+ case 'Z':
+ case '\\':
+ case ']':
+ case '^':
+ case '_':
+ case '`':
+ case 'a':
+ case 'b':
+ case 'c':
+ case 'd':
+ case 'e':
+ case 'f':
+ case 'g':
+ case 'h':
+ case 'i':
+ case 'j':
+ case 'k':
+ case 'l':
+ case 'm':
+ case 'n':
+ case 'o':
+ case 'p':
+ case 'q':
+ case 'r':
+ case 's':
+ case 't':
+ case 'u':
+ case 'v':
+ case 'w':
+ case 'x':
+ case 'y':
+ case 'z':
+ case '{':
+ case '|':
+ case '}':
+ case '~':
+ case 0x7F: goto yy327;
+ case '[': goto yy328;
+ case 0xC2:
+ case 0xC3:
+ case 0xC4:
+ case 0xC5:
+ case 0xC6:
+ case 0xC7:
+ case 0xC8:
+ case 0xC9:
+ case 0xCA:
+ case 0xCB:
+ case 0xCC:
+ case 0xCD:
+ case 0xCE:
+ case 0xCF:
+ case 0xD0:
+ case 0xD1:
+ case 0xD2:
+ case 0xD3:
+ case 0xD4:
+ case 0xD5:
+ case 0xD6:
+ case 0xD7:
+ case 0xD8:
+ case 0xD9:
+ case 0xDA:
+ case 0xDB:
+ case 0xDC:
+ case 0xDD:
+ case 0xDE:
+ case 0xDF: goto yy329;
+ case 0xE0: goto yy330;
+ case 0xE1:
+ case 0xE2:
+ case 0xE3:
+ case 0xE4:
+ case 0xE5:
+ case 0xE6:
+ case 0xE7:
+ case 0xE8:
+ case 0xE9:
+ case 0xEA:
+ case 0xEB:
+ case 0xEC:
+ case 0xED:
+ case 0xEE:
+ case 0xEF: goto yy331;
+ case 0xF0: goto yy332;
+ case 0xF1:
+ case 0xF2:
+ case 0xF3: goto yy333;
+ case 0xF4: goto yy334;
+ default: goto yy222;
+ }
+yy224:
+ YYDEBUG(224, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case '"': goto yy88;
+ default: goto yy336;
+ }
+yy225:
+ YYDEBUG(225, YYPEEK());
+ YYSKIP();
+ YYDEBUG(226, YYPEEK());
+#line 295 "ada_annex_p.re2c"
+ {*id = 2; if (lexer->cursor[-1] == 0x0a || (lexer->cursor[-1] == 0x0d
&& lexer->cursor[-2] == 0x0a)) lexer->line++; continue;}
+#line 6384 "ada_annex_p_re2c.c"
+yy227:
+ YYDEBUG(227, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
case 0xA8:
case 0xA9:
case 0xAA:
@@ -5676,13 +6449,52 @@ yy215:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy214;
+ case 0xBF: goto yy121;
default: goto yy88;
}
-yy216:
- YYDEBUG(216, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy228:
+ YYDEBUG(228, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy227;
+ default: goto yy88;
+ }
+yy229:
+ YYDEBUG(229, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -5747,13 +6559,13 @@ yy216:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy214;
+ case 0xBF: goto yy227;
default: goto yy88;
}
-yy217:
- YYDEBUG(217, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy230:
+ YYDEBUG(230, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x90:
case 0x91:
@@ -5802,13 +6614,13 @@ yy217:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy216;
+ case 0xBF: goto yy229;
default: goto yy88;
}
-yy218:
- YYDEBUG(218, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy231:
+ YYDEBUG(231, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -5873,13 +6685,13 @@ yy218:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy216;
+ case 0xBF: goto yy229;
default: goto yy88;
}
-yy219:
- YYDEBUG(219, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy232:
+ YYDEBUG(232, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -5896,17 +6708,17 @@ yy219:
case 0x8C:
case 0x8D:
case 0x8E:
- case 0x8F: goto yy216;
+ case 0x8F: goto yy229;
default: goto yy88;
}
-yy220:
- YYDEBUG(220, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
-yy221:
- YYDEBUG(221, YYPEEK ());
+yy233:
+ YYDEBUG(233, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+yy234:
+ YYDEBUG(234, YYPEEK());
switch (yych) {
- case '#': goto yy312;
+ case '#': goto yy337;
case '-':
case '.':
case '0':
@@ -5931,51 +6743,50 @@ yy221:
case 'c':
case 'd':
case 'e':
- case 'f': goto yy220;
+ case 'f': goto yy233;
default: goto yy88;
}
-yy222:
- YYDEBUG(222, YYPEEK ());
- yyaccept = 3;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
- YYDEBUG(223, YYPEEK ());
+yy235:
+ YYDEBUG(235, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case '-':
- case '.':
- case 'E':
- case '_':
- case 'e': goto yy126;
- case '0':
- case '1':
- case '2':
- case '3':
- case '4':
- case '5':
- case '6':
- case '7':
- case '8':
- case '9': goto yy222;
- default: goto yy39;
+ case '<': goto yy338;
+ default: goto yy88;
}
-yy224:
- YYDEBUG(224, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy236:
+ YYDEBUG(236, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case 'R':
- case 'r': goto yy313;
- default: goto yy15;
+ case '=': goto yy339;
+ default: goto yy88;
}
-yy225:
- YYDEBUG(225, YYPEEK ());
- yyaccept = 15;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy237:
+ YYDEBUG(237, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case '>': goto yy340;
+ default: goto yy88;
+ }
+yy238:
+ YYDEBUG(238, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'R':
+ case 'r': goto yy341;
+ default: goto yy15;
+ }
+yy239:
+ YYDEBUG(239, YYPEEK());
+ yyaccept = 19;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -6091,42 +6902,42 @@ yy225:
case 0xF3:
case 0xF4: goto yy15;
case 'T':
- case 't': goto yy314;
- default: goto yy226;
- }
-yy226:
- YYDEBUG(226, YYPEEK ());
-#line 273 "../ada.re2c"
- {*id = 3; continue;}
-#line 6102 "../ada_re2c.c"
-yy227:
- YYDEBUG(227, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ case 't': goto yy342;
+ default: goto yy240;
+ }
+yy240:
+ YYDEBUG(240, YYPEEK());
+#line 339 "ada_annex_p.re2c"
+ {*id = 46; continue;}
+#line 6913 "ada_annex_p_re2c.c"
+yy241:
+ YYDEBUG(241, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy315;
+ case 'e': goto yy343;
default: goto yy15;
}
-yy228:
- YYDEBUG(228, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy242:
+ YYDEBUG(242, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'A':
- case 'a': goto yy316;
+ case 'a': goto yy344;
default: goto yy15;
}
-yy229:
- YYDEBUG(229, YYPEEK ());
- yyaccept = 16;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy243:
+ YYDEBUG(243, YYPEEK());
+ yyaccept = 20;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -6243,19 +7054,19 @@ yy229:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy230;
+ default: goto yy244;
}
-yy230:
- YYDEBUG(230, YYPEEK ());
-#line 279 "../ada.re2c"
- {*id = 9; continue;}
-#line 6253 "../ada_re2c.c"
-yy231:
- YYDEBUG(231, YYPEEK ());
- yyaccept = 17;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy244:
+ YYDEBUG(244, YYPEEK());
+#line 348 "ada_annex_p.re2c"
+ {*id = 55; continue;}
+#line 7064 "ada_annex_p_re2c.c"
+yy245:
+ YYDEBUG(245, YYPEEK());
+ yyaccept = 21;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -6372,122 +7183,122 @@ yy231:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy232;
+ default: goto yy246;
}
-yy232:
- YYDEBUG(232, YYPEEK ());
-#line 280 "../ada.re2c"
- {*id = 10; continue;}
-#line 6382 "../ada_re2c.c"
-yy233:
- YYDEBUG(233, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy246:
+ YYDEBUG(246, YYPEEK());
+#line 368 "ada_annex_p.re2c"
+ {*id = 75; continue;}
+#line 7193 "ada_annex_p_re2c.c"
+yy247:
+ YYDEBUG(247, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'A':
- case 'a': goto yy317;
+ case 'a': goto yy345;
default: goto yy15;
}
-yy234:
- YYDEBUG(234, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy248:
+ YYDEBUG(248, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'I':
- case 'i': goto yy318;
+ case 'i': goto yy346;
default: goto yy15;
}
-yy235:
- YYDEBUG(235, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy249:
+ YYDEBUG(249, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'Y':
- case 'y': goto yy319;
+ case 'y': goto yy347;
default: goto yy15;
}
-yy236:
- YYDEBUG(236, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy250:
+ YYDEBUG(250, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy321;
+ case 'e': goto yy349;
default: goto yy15;
}
-yy237:
- YYDEBUG(237, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy251:
+ YYDEBUG(251, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'S':
- case 's': goto yy323;
+ case 's': goto yy351;
default: goto yy15;
}
-yy238:
- YYDEBUG(238, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy252:
+ YYDEBUG(252, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'L':
- case 'l': goto yy324;
+ case 'l': goto yy352;
default: goto yy15;
}
-yy239:
- YYDEBUG(239, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy253:
+ YYDEBUG(253, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'A':
- case 'a': goto yy325;
+ case 'a': goto yy353;
case 'T':
- case 't': goto yy326;
+ case 't': goto yy354;
default: goto yy15;
}
-yy240:
- YYDEBUG(240, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy254:
+ YYDEBUG(254, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'I':
- case 'i': goto yy327;
+ case 'i': goto yy355;
default: goto yy15;
}
-yy241:
- YYDEBUG(241, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy255:
+ YYDEBUG(255, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy328;
+ case 'e': goto yy356;
case 'I':
- case 'i': goto yy330;
+ case 'i': goto yy358;
default: goto yy15;
}
-yy242:
- YYDEBUG(242, YYPEEK ());
- yyaccept = 18;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy256:
+ YYDEBUG(256, YYPEEK());
+ yyaccept = 22;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -6604,52 +7415,52 @@ yy242:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy243;
+ default: goto yy257;
}
-yy243:
- YYDEBUG(243, YYPEEK ());
-#line 294 "../ada.re2c"
- {*id = 24; continue;}
-#line 6614 "../ada_re2c.c"
-yy244:
- YYDEBUG(244, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy257:
+ YYDEBUG(257, YYPEEK());
+#line 359 "ada_annex_p.re2c"
+ {*id = 66; continue;}
+#line 7425 "ada_annex_p_re2c.c"
+yy258:
+ YYDEBUG(258, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'R':
- case 'r': goto yy331;
+ case 'r': goto yy359;
default: goto yy15;
}
-yy245:
- YYDEBUG(245, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy259:
+ YYDEBUG(259, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy332;
+ case 'e': goto yy360;
default: goto yy15;
}
-yy246:
- YYDEBUG(246, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy260:
+ YYDEBUG(260, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'T':
- case 't': goto yy333;
+ case 't': goto yy361;
default: goto yy15;
}
-yy247:
- YYDEBUG(247, YYPEEK ());
- yyaccept = 19;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy261:
+ YYDEBUG(261, YYPEEK());
+ yyaccept = 23;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -6766,85 +7577,85 @@ yy247:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy248;
+ default: goto yy262;
}
-yy248:
- YYDEBUG(248, YYPEEK ());
-#line 298 "../ada.re2c"
- {*id = 28; continue;}
-#line 6776 "../ada_re2c.c"
-yy249:
- YYDEBUG(249, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy262:
+ YYDEBUG(262, YYPEEK());
+#line 344 "ada_annex_p.re2c"
+ {*id = 51; continue;}
+#line 7587 "ada_annex_p_re2c.c"
+yy263:
+ YYDEBUG(263, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'C':
- case 'c': goto yy335;
+ case 'c': goto yy363;
default: goto yy15;
}
-yy250:
- YYDEBUG(250, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy264:
+ YYDEBUG(264, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy336;
+ case 'e': goto yy364;
default: goto yy15;
}
-yy251:
- YYDEBUG(251, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy265:
+ YYDEBUG(265, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'O':
- case 'o': goto yy337;
+ case 'o': goto yy365;
default: goto yy15;
}
-yy252:
- YYDEBUG(252, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy266:
+ YYDEBUG(266, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy339;
+ case 'e': goto yy367;
default: goto yy15;
}
-yy253:
- YYDEBUG(253, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy267:
+ YYDEBUG(267, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'I':
- case 'i': goto yy340;
+ case 'i': goto yy368;
default: goto yy15;
}
-yy254:
- YYDEBUG(254, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy268:
+ YYDEBUG(268, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'P':
- case 'p': goto yy341;
+ case 'p': goto yy369;
default: goto yy15;
}
-yy255:
- YYDEBUG(255, YYPEEK ());
- yyaccept = 20;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy269:
+ YYDEBUG(269, YYPEEK());
+ yyaccept = 24;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -6961,19 +7772,19 @@ yy255:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy256;
+ default: goto yy270;
}
-yy256:
- YYDEBUG(256, YYPEEK ());
-#line 308 "../ada.re2c"
- {*id = 38; continue;}
-#line 6971 "../ada_re2c.c"
-yy257:
- YYDEBUG(257, YYPEEK ());
- yyaccept = 21;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy270:
+ YYDEBUG(270, YYPEEK());
+#line 366 "ada_annex_p.re2c"
+ {*id = 73; continue;}
+#line 7782 "ada_annex_p_re2c.c"
+yy271:
+ YYDEBUG(271, YYPEEK());
+ yyaccept = 25;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -7090,19 +7901,19 @@ yy257:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy258;
+ default: goto yy272;
}
-yy258:
- YYDEBUG(258, YYPEEK ());
-#line 309 "../ada.re2c"
- {*id = 39; continue;}
-#line 7100 "../ada_re2c.c"
-yy259:
- YYDEBUG(259, YYPEEK ());
- yyaccept = 22;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy272:
+ YYDEBUG(272, YYPEEK());
+#line 369 "ada_annex_p.re2c"
+ {*id = 76; continue;}
+#line 7911 "ada_annex_p_re2c.c"
+yy273:
+ YYDEBUG(273, YYPEEK());
+ yyaccept = 26;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -7219,41 +8030,41 @@ yy259:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy260;
+ default: goto yy274;
}
-yy260:
- YYDEBUG(260, YYPEEK ());
-#line 310 "../ada.re2c"
- {*id = 40; continue;}
-#line 7229 "../ada_re2c.c"
-yy261:
- YYDEBUG(261, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy274:
+ YYDEBUG(274, YYPEEK());
+#line 345 "ada_annex_p.re2c"
+ {*id = 52; continue;}
+#line 8040 "ada_annex_p_re2c.c"
+yy275:
+ YYDEBUG(275, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'L':
- case 'l': goto yy343;
+ case 'l': goto yy371;
default: goto yy15;
}
-yy262:
- YYDEBUG(262, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy276:
+ YYDEBUG(276, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy345;
+ case 'e': goto yy373;
default: goto yy15;
}
-yy263:
- YYDEBUG(263, YYPEEK ());
- yyaccept = 23;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy277:
+ YYDEBUG(277, YYPEEK());
+ yyaccept = 27;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -7370,109 +8181,120 @@ yy263:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy264;
+ default: goto yy278;
}
-yy264:
- YYDEBUG(264, YYPEEK ());
-#line 315 "../ada.re2c"
- {*id = 45; continue;}
-#line 7380 "../ada_re2c.c"
-yy265:
- YYDEBUG(265, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy278:
+ YYDEBUG(278, YYPEEK());
+#line 322 "ada_annex_p.re2c"
+ {*id = 29; continue;}
+#line 8191 "ada_annex_p_re2c.c"
+yy279:
+ YYDEBUG(279, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'R':
- case 'r': goto yy346;
+ case 'r': goto yy374;
default: goto yy15;
}
-yy266:
- YYDEBUG(266, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy280:
+ YYDEBUG(280, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'K':
- case 'k': goto yy347;
+ case 'k': goto yy375;
default: goto yy15;
}
-yy267:
- YYDEBUG(267, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy281:
+ YYDEBUG(281, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'A':
+ case 'a': goto yy376;
+ default: goto yy15;
+ }
+yy282:
+ YYDEBUG(282, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'G':
- case 'g': goto yy348;
+ case 'g': goto yy377;
default: goto yy15;
}
-yy268:
- YYDEBUG(268, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy283:
+ YYDEBUG(283, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'V':
- case 'v': goto yy349;
+ case 'v': goto yy378;
default: goto yy15;
}
-yy269:
- YYDEBUG(269, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy284:
+ YYDEBUG(284, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'C':
- case 'c': goto yy350;
+ case 'c': goto yy379;
case 'T':
- case 't': goto yy351;
+ case 't': goto yy380;
default: goto yy15;
}
-yy270:
- YYDEBUG(270, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy285:
+ YYDEBUG(285, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'S':
- case 's': goto yy352;
+ case 's': goto yy381;
default: goto yy15;
}
-yy271:
- YYDEBUG(271, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy286:
+ YYDEBUG(286, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'G':
- case 'g': goto yy353;
+ case 'g': goto yy382;
default: goto yy15;
}
-yy272:
- YYDEBUG(272, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy287:
+ YYDEBUG(287, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'O':
- case 'o': goto yy354;
+ case 'o': goto yy383;
default: goto yy15;
}
-yy273:
- YYDEBUG(273, YYPEEK ());
- yyaccept = 24;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy288:
+ YYDEBUG(288, YYPEEK());
+ yyaccept = 28;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -7589,184 +8411,184 @@ yy273:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy274;
+ default: goto yy289;
}
-yy274:
- YYDEBUG(274, YYPEEK ());
-#line 325 "../ada.re2c"
- {*id = 55; continue;}
-#line 7599 "../ada_re2c.c"
-yy275:
- YYDEBUG(275, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy289:
+ YYDEBUG(289, YYPEEK());
+#line 338 "ada_annex_p.re2c"
+ {*id = 45; continue;}
+#line 8421 "ada_annex_p_re2c.c"
+yy290:
+ YYDEBUG(290, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'A':
- case 'a': goto yy355;
+ case 'a': goto yy384;
default: goto yy15;
}
-yy276:
- YYDEBUG(276, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy291:
+ YYDEBUG(291, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'U':
- case 'u': goto yy356;
+ case 'u': goto yy385;
default: goto yy15;
}
-yy277:
- YYDEBUG(277, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy292:
+ YYDEBUG(292, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'U':
- case 'u': goto yy357;
+ case 'u': goto yy386;
default: goto yy15;
}
-yy278:
- YYDEBUG(278, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy293:
+ YYDEBUG(293, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy358;
+ case 'e': goto yy387;
default: goto yy15;
}
-yy279:
- YYDEBUG(279, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy294:
+ YYDEBUG(294, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy359;
+ case 'e': goto yy388;
default: goto yy15;
}
-yy280:
- YYDEBUG(280, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy295:
+ YYDEBUG(295, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'A':
- case 'a': goto yy360;
+ case 'a': goto yy389;
default: goto yy15;
}
-yy281:
- YYDEBUG(281, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy296:
+ YYDEBUG(296, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy361;
+ case 'e': goto yy390;
default: goto yy15;
}
-yy282:
- YYDEBUG(282, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy297:
+ YYDEBUG(297, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'T':
- case 't': goto yy363;
+ case 't': goto yy392;
default: goto yy15;
}
-yy283:
- YYDEBUG(283, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy298:
+ YYDEBUG(298, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'C':
- case 'c': goto yy364;
+ case 'c': goto yy393;
default: goto yy15;
}
-yy284:
- YYDEBUG(284, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy299:
+ YYDEBUG(299, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'G':
- case 'g': goto yy365;
+ case 'g': goto yy394;
default: goto yy15;
}
-yy285:
- YYDEBUG(285, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy300:
+ YYDEBUG(300, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'K':
- case 'k': goto yy366;
+ case 'k': goto yy395;
default: goto yy15;
}
-yy286:
- YYDEBUG(286, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy301:
+ YYDEBUG(301, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'M':
- case 'm': goto yy368;
+ case 'm': goto yy397;
default: goto yy15;
}
-yy287:
- YYDEBUG(287, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy302:
+ YYDEBUG(302, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'N':
- case 'n': goto yy369;
+ case 'n': goto yy398;
default: goto yy15;
}
-yy288:
- YYDEBUG(288, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy303:
+ YYDEBUG(303, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy371;
+ case 'e': goto yy400;
default: goto yy15;
}
-yy289:
- YYDEBUG(289, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
- switch (yych) {
+yy304:
+ YYDEBUG(304, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
case 'I':
- case 'i': goto yy373;
+ case 'i': goto yy402;
default: goto yy15;
}
-yy290:
- YYDEBUG(290, YYPEEK ());
- yyaccept = 25;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy305:
+ YYDEBUG(305, YYPEEK());
+ yyaccept = 29;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -7883,52 +8705,52 @@ yy290:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy291;
+ default: goto yy306;
}
-yy291:
- YYDEBUG(291, YYPEEK ());
-#line 341 "../ada.re2c"
- {*id = 71; continue;}
-#line 7893 "../ada_re2c.c"
-yy292:
- YYDEBUG(292, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy306:
+ YYDEBUG(306, YYPEEK());
+#line 343 "ada_annex_p.re2c"
+ {*id = 50; continue;}
+#line 8715 "ada_annex_p_re2c.c"
+yy307:
+ YYDEBUG(307, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'N':
- case 'n': goto yy374;
+ case 'n': goto yy403;
default: goto yy15;
}
-yy293:
- YYDEBUG(293, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy308:
+ YYDEBUG(308, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'L':
- case 'l': goto yy376;
+ case 'l': goto yy405;
default: goto yy15;
}
-yy294:
- YYDEBUG(294, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy309:
+ YYDEBUG(309, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'H':
- case 'h': goto yy377;
+ case 'h': goto yy406;
default: goto yy15;
}
-yy295:
- YYDEBUG(295, YYPEEK ());
- yyaccept = 26;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy310:
+ YYDEBUG(310, YYPEEK());
+ yyaccept = 30;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -8045,20 +8867,20 @@ yy295:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy296;
+ default: goto yy311;
}
-yy296:
- YYDEBUG(296, YYPEEK ());
-#line 345 "../ada.re2c"
- {*id = 75; continue;}
-#line 8055 "../ada_re2c.c"
-yy297:
- YYDEBUG(297, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
- YYDEBUG(298, YYPEEK ());
+yy311:
+ YYDEBUG(311, YYPEEK());
+#line 341 "ada_annex_p.re2c"
+ {*id = 48; continue;}
+#line 8877 "ada_annex_p_re2c.c"
+yy312:
+ YYDEBUG(312, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ YYDEBUG(313, YYPEEK());
switch (yych) {
- case '"': goto yy379;
+ case '"': goto yy408;
case '0':
case '1':
case '2':
@@ -8080,16 +8902,87 @@ yy297:
case 'c':
case 'd':
case 'e':
- case 'f': goto yy297;
+ case 'f': goto yy312;
default: goto yy88;
}
-yy299:
- YYDEBUG(299, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
- YYDEBUG(300, YYPEEK ());
+yy314:
+ YYDEBUG(314, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE: goto yy14;
+ case 0xBF: goto yy215;
+ default: goto yy88;
+ }
+yy315:
+ YYDEBUG(315, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ YYDEBUG(316, YYPEEK());
switch (yych) {
- case '"': goto yy380;
+ case '"': goto yy409;
case '0':
case '1':
case '2':
@@ -8111,39 +9004,37 @@ yy299:
case 'c':
case 'd':
case 'e':
- case 'f': goto yy299;
- default: goto yy88;
- }
-yy301:
- YYDEBUG(301, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
- switch (yych) {
- case 'e': goto yy119;
- case 'i': goto yy100;
+ case 'f': goto yy315;
default: goto yy88;
}
-yy302:
- YYDEBUG(302, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy317:
+ YYDEBUG(317, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case '\'': goto yy381;
+ case 'e': goto yy410;
+ case 'i': goto yy412;
default: goto yy88;
}
-yy303:
- YYDEBUG(303, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy318:
+ YYDEBUG(318, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case '"': goto yy383;
- case '\'': goto yy381;
+ case ' ': goto yy413;
default: goto yy88;
}
-yy304:
- YYDEBUG(304, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy319:
+ YYDEBUG(319, YYPEEK());
+ YYSKIP();
+ YYDEBUG(320, YYPEEK());
+#line 296 "ada_annex_p.re2c"
+ {*id = 3; if (lexer->cursor[-1] == 0x0a || (lexer->cursor[-1] == 0x0d
&& lexer->cursor[-2] == 0x0a)) lexer->line++; continue;}
+#line 9034 "ada_annex_p_re2c.c"
+yy321:
+ YYDEBUG(321, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -8208,13 +9099,13 @@ yy304:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy302;
+ case 0xBF: goto yy219;
default: goto yy88;
}
-yy305:
- YYDEBUG(305, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy322:
+ YYDEBUG(322, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0xA0:
case 0xA1:
@@ -8247,13 +9138,13 @@ yy305:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy304;
+ case 0xBF: goto yy321;
default: goto yy88;
}
-yy306:
- YYDEBUG(306, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy323:
+ YYDEBUG(323, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -8318,13 +9209,13 @@ yy306:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy304;
+ case 0xBF: goto yy321;
default: goto yy88;
}
-yy307:
- YYDEBUG(307, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy324:
+ YYDEBUG(324, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x90:
case 0x91:
@@ -8373,13 +9264,13 @@ yy307:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy306;
+ case 0xBF: goto yy323;
default: goto yy88;
}
-yy308:
- YYDEBUG(308, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy325:
+ YYDEBUG(325, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -8444,13 +9335,13 @@ yy308:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy306;
+ case 0xBF: goto yy323;
default: goto yy88;
}
-yy309:
- YYDEBUG(309, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy326:
+ YYDEBUG(326, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -8467,142 +9358,513 @@ yy309:
case 0x8C:
case 0x8D:
case 0x8E:
- case 0x8F: goto yy306;
+ case 0x8F: goto yy323;
default: goto yy88;
}
-yy310:
- YYDEBUG(310, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
-yy311:
- YYDEBUG(311, YYPEEK ());
+yy327:
+ YYDEBUG(327, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case '"': goto yy384;
- case '0':
- case '1':
- case '2':
- case '3':
- case '4':
- case '5':
- case '6':
- case '7':
- case '8':
- case '9':
- case 'A':
- case 'B':
- case 'C':
- case 'D':
- case 'E':
- case 'F':
- case 'a':
- case 'b':
- case 'c':
- case 'd':
- case 'e':
- case 'f': goto yy310;
+ case '\'': goto yy414;
default: goto yy88;
}
-yy312:
- YYDEBUG(312, YYPEEK ());
- YYSKIP ();
- goto yy39;
-yy313:
- YYDEBUG(313, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
- switch (yych) {
- case 'T':
- case 't': goto yy385;
- default: goto yy15;
- }
-yy314:
- YYDEBUG(314, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
- switch (yych) {
- case 'R':
- case 'r': goto yy387;
- default: goto yy15;
- }
-yy315:
- YYDEBUG(315, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
- switch (yych) {
- case 'P':
- case 'p': goto yy388;
- case 'S':
- case 's': goto yy389;
- default: goto yy15;
- }
-yy316:
- YYDEBUG(316, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
- switch (yych) {
- case 'S':
- case 's': goto yy390;
- default: goto yy15;
- }
-yy317:
- YYDEBUG(317, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy328:
+ YYDEBUG(328, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case 'Y':
- case 'y': goto yy391;
- default: goto yy15;
+ case '"': goto yy416;
+ case '\'': goto yy414;
+ default: goto yy88;
}
-yy318:
- YYDEBUG(318, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy329:
+ YYDEBUG(329, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case 'N':
- case 'n': goto yy393;
- default: goto yy15;
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy327;
+ default: goto yy88;
}
-yy319:
- YYDEBUG(319, YYPEEK ());
- yyaccept = 27;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy330:
+ YYDEBUG(330, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case '0':
- case '1':
- case '2':
- case '3':
- case '4':
- case '5':
- case '6':
- case '7':
- case '8':
- case '9':
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy329;
+ default: goto yy88;
+ }
+yy331:
+ YYDEBUG(331, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy329;
+ default: goto yy88;
+ }
+yy332:
+ YYDEBUG(332, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy331;
+ default: goto yy88;
+ }
+yy333:
+ YYDEBUG(333, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy331;
+ default: goto yy88;
+ }
+yy334:
+ YYDEBUG(334, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F: goto yy331;
+ default: goto yy88;
+ }
+yy335:
+ YYDEBUG(335, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+yy336:
+ YYDEBUG(336, YYPEEK());
+ switch (yych) {
+ case '"': goto yy417;
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
case 'A':
case 'B':
case 'C':
case 'D':
case 'E':
case 'F':
- case 'G':
- case 'H':
- case 'I':
- case 'J':
- case 'K':
- case 'L':
+ case 'a':
+ case 'b':
+ case 'c':
+ case 'd':
+ case 'e':
+ case 'f': goto yy335;
+ default: goto yy88;
+ }
+yy337:
+ YYDEBUG(337, YYPEEK());
+ YYSKIP();
+ goto yy39;
+yy338:
+ YYDEBUG(338, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case '<': goto yy418;
+ default: goto yy88;
+ }
+yy339:
+ YYDEBUG(339, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case '=': goto yy419;
+ default: goto yy88;
+ }
+yy340:
+ YYDEBUG(340, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case '>': goto yy420;
+ default: goto yy88;
+ }
+yy341:
+ YYDEBUG(341, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'T':
+ case 't': goto yy421;
+ default: goto yy15;
+ }
+yy342:
+ YYDEBUG(342, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'R':
+ case 'r': goto yy423;
+ default: goto yy15;
+ }
+yy343:
+ YYDEBUG(343, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'P':
+ case 'p': goto yy424;
+ case 'S':
+ case 's': goto yy425;
+ default: goto yy15;
+ }
+yy344:
+ YYDEBUG(344, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'S':
+ case 's': goto yy426;
+ default: goto yy15;
+ }
+yy345:
+ YYDEBUG(345, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'Y':
+ case 'y': goto yy427;
+ default: goto yy15;
+ }
+yy346:
+ YYDEBUG(346, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'N':
+ case 'n': goto yy429;
+ default: goto yy15;
+ }
+yy347:
+ YYDEBUG(347, YYPEEK());
+ yyaccept = 31;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
+ case 'A':
+ case 'B':
+ case 'C':
+ case 'D':
+ case 'E':
+ case 'F':
+ case 'G':
+ case 'H':
+ case 'I':
+ case 'J':
+ case 'K':
+ case 'L':
case 'M':
case 'N':
case 'O':
@@ -8696,19 +9958,19 @@ yy319:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy320;
+ default: goto yy348;
}
-yy320:
- YYDEBUG(320, YYPEEK ());
-#line 284 "../ada.re2c"
- {*id = 14; continue;}
-#line 8706 "../ada_re2c.c"
-yy321:
- YYDEBUG(321, YYPEEK ());
- yyaccept = 28;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy348:
+ YYDEBUG(348, YYPEEK());
+#line 319 "ada_annex_p.re2c"
+ {*id = 26; continue;}
+#line 9968 "ada_annex_p_re2c.c"
+yy349:
+ YYDEBUG(349, YYPEEK());
+ yyaccept = 32;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -8825,74 +10087,74 @@ yy321:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy322;
+ default: goto yy350;
}
-yy322:
- YYDEBUG(322, YYPEEK ());
-#line 285 "../ada.re2c"
- {*id = 15; continue;}
-#line 8835 "../ada_re2c.c"
-yy323:
- YYDEBUG(323, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy350:
+ YYDEBUG(350, YYPEEK());
+#line 357 "ada_annex_p.re2c"
+ {*id = 64; continue;}
+#line 10097 "ada_annex_p_re2c.c"
+yy351:
+ YYDEBUG(351, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'T':
- case 't': goto yy395;
+ case 't': goto yy431;
default: goto yy15;
}
-yy324:
- YYDEBUG(324, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy352:
+ YYDEBUG(352, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'A':
- case 'a': goto yy396;
+ case 'a': goto yy432;
default: goto yy15;
}
-yy325:
- YYDEBUG(325, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy353:
+ YYDEBUG(353, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'Y':
- case 'y': goto yy397;
+ case 'y': goto yy433;
default: goto yy15;
}
-yy326:
- YYDEBUG(326, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy354:
+ YYDEBUG(354, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'A':
- case 'a': goto yy399;
+ case 'a': goto yy435;
default: goto yy15;
}
-yy327:
- YYDEBUG(327, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy355:
+ YYDEBUG(355, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'T':
- case 't': goto yy401;
+ case 't': goto yy437;
default: goto yy15;
}
-yy328:
- YYDEBUG(328, YYPEEK ());
- yyaccept = 29;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy356:
+ YYDEBUG(356, YYPEEK());
+ yyaccept = 33;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -9009,52 +10271,52 @@ yy328:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy329;
+ default: goto yy357;
}
-yy329:
- YYDEBUG(329, YYPEEK ());
-#line 292 "../ada.re2c"
- {*id = 22; continue;}
-#line 9019 "../ada_re2c.c"
-yy330:
- YYDEBUG(330, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy357:
+ YYDEBUG(357, YYPEEK());
+#line 334 "ada_annex_p.re2c"
+ {*id = 41; continue;}
+#line 10281 "ada_annex_p_re2c.c"
+yy358:
+ YYDEBUG(358, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'F':
- case 'f': goto yy402;
+ case 'f': goto yy438;
default: goto yy15;
}
-yy331:
- YYDEBUG(331, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy359:
+ YYDEBUG(359, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'Y':
- case 'y': goto yy404;
+ case 'y': goto yy440;
default: goto yy15;
}
-yy332:
- YYDEBUG(332, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy360:
+ YYDEBUG(360, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'P':
- case 'p': goto yy406;
+ case 'p': goto yy442;
default: goto yy15;
}
-yy333:
- YYDEBUG(333, YYPEEK ());
- yyaccept = 30;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy361:
+ YYDEBUG(361, YYPEEK());
+ yyaccept = 34;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -9171,41 +10433,41 @@ yy333:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy334;
+ default: goto yy362;
}
-yy334:
- YYDEBUG(334, YYPEEK ());
-#line 297 "../ada.re2c"
- {*id = 27; continue;}
-#line 9181 "../ada_re2c.c"
-yy335:
- YYDEBUG(335, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy362:
+ YYDEBUG(362, YYPEEK());
+#line 325 "ada_annex_p.re2c"
+ {*id = 32; continue;}
+#line 10443 "ada_annex_p_re2c.c"
+yy363:
+ YYDEBUG(363, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'T':
- case 't': goto yy407;
+ case 't': goto yy443;
default: goto yy15;
}
-yy336:
- YYDEBUG(336, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy364:
+ YYDEBUG(364, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'R':
- case 'r': goto yy408;
+ case 'r': goto yy444;
default: goto yy15;
}
-yy337:
- YYDEBUG(337, YYPEEK ());
- yyaccept = 31;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy365:
+ YYDEBUG(365, YYPEEK());
+ yyaccept = 35;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -9322,41 +10584,41 @@ yy337:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy338;
+ default: goto yy366;
}
-yy338:
- YYDEBUG(338, YYPEEK ());
-#line 301 "../ada.re2c"
- {*id = 31; continue;}
-#line 9332 "../ada_re2c.c"
-yy339:
- YYDEBUG(339, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy366:
+ YYDEBUG(366, YYPEEK());
+#line 324 "ada_annex_p.re2c"
+ {*id = 31; continue;}
+#line 10594 "ada_annex_p_re2c.c"
+yy367:
+ YYDEBUG(367, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'R':
- case 'r': goto yy409;
+ case 'r': goto yy445;
default: goto yy15;
}
-yy340:
- YYDEBUG(340, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy368:
+ YYDEBUG(368, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'T':
- case 't': goto yy410;
+ case 't': goto yy446;
default: goto yy15;
}
-yy341:
- YYDEBUG(341, YYPEEK ());
- yyaccept = 32;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy369:
+ YYDEBUG(369, YYPEEK());
+ yyaccept = 36;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -9473,19 +10735,19 @@ yy341:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy342;
+ default: goto yy370;
}
-yy342:
- YYDEBUG(342, YYPEEK ());
-#line 307 "../ada.re2c"
- {*id = 37; continue;}
-#line 9483 "../ada_re2c.c"
-yy343:
- YYDEBUG(343, YYPEEK ());
- yyaccept = 33;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy370:
+ YYDEBUG(370, YYPEEK());
+#line 329 "ada_annex_p.re2c"
+ {*id = 36; continue;}
+#line 10745 "ada_annex_p_re2c.c"
+yy371:
+ YYDEBUG(371, YYPEEK());
+ yyaccept = 37;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -9602,195 +10864,206 @@ yy343:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy344;
+ default: goto yy372;
}
-yy344:
- YYDEBUG(344, YYPEEK ());
-#line 311 "../ada.re2c"
- {*id = 41; continue;}
-#line 9612 "../ada_re2c.c"
-yy345:
- YYDEBUG(345, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy372:
+ YYDEBUG(372, YYPEEK());
+#line 358 "ada_annex_p.re2c"
+ {*id = 65; continue;}
+#line 10874 "ada_annex_p_re2c.c"
+yy373:
+ YYDEBUG(373, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'R':
- case 'r': goto yy411;
+ case 'r': goto yy447;
default: goto yy15;
}
-yy346:
- YYDEBUG(346, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy374:
+ YYDEBUG(374, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'R':
- case 'r': goto yy412;
+ case 'r': goto yy448;
default: goto yy15;
}
-yy347:
- YYDEBUG(347, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy375:
+ YYDEBUG(375, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'A':
- case 'a': goto yy413;
+ case 'a': goto yy449;
default: goto yy15;
}
-yy348:
- YYDEBUG(348, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy376:
+ YYDEBUG(376, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'L':
+ case 'l': goto yy450;
+ default: goto yy15;
+ }
+yy377:
+ YYDEBUG(377, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'M':
- case 'm': goto yy414;
+ case 'm': goto yy451;
default: goto yy15;
}
-yy349:
- YYDEBUG(349, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy378:
+ YYDEBUG(378, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'A':
- case 'a': goto yy415;
+ case 'a': goto yy452;
default: goto yy15;
}
-yy350:
- YYDEBUG(350, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy379:
+ YYDEBUG(379, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy416;
+ case 'e': goto yy453;
default: goto yy15;
}
-yy351:
- YYDEBUG(351, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy380:
+ YYDEBUG(380, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy417;
+ case 'e': goto yy454;
default: goto yy15;
}
-yy352:
- YYDEBUG(352, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy381:
+ YYDEBUG(381, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy418;
+ case 'e': goto yy455;
default: goto yy15;
}
-yy353:
- YYDEBUG(353, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy382:
+ YYDEBUG(382, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy420;
+ case 'e': goto yy457;
default: goto yy15;
}
-yy354:
- YYDEBUG(354, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy383:
+ YYDEBUG(383, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'R':
- case 'r': goto yy422;
+ case 'r': goto yy459;
default: goto yy15;
}
-yy355:
- YYDEBUG(355, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy384:
+ YYDEBUG(384, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'M':
- case 'm': goto yy423;
+ case 'm': goto yy460;
default: goto yy15;
}
-yy356:
- YYDEBUG(356, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy385:
+ YYDEBUG(385, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy424;
+ case 'e': goto yy461;
default: goto yy15;
}
-yy357:
- YYDEBUG(357, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy386:
+ YYDEBUG(386, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'R':
- case 'r': goto yy425;
+ case 'r': goto yy462;
default: goto yy15;
}
-yy358:
- YYDEBUG(358, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy387:
+ YYDEBUG(387, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'R':
- case 'r': goto yy426;
+ case 'r': goto yy463;
default: goto yy15;
}
-yy359:
- YYDEBUG(359, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy388:
+ YYDEBUG(388, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'C':
- case 'c': goto yy427;
+ case 'c': goto yy464;
default: goto yy15;
}
-yy360:
- YYDEBUG(360, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy389:
+ YYDEBUG(389, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'R':
- case 'r': goto yy428;
+ case 'r': goto yy465;
default: goto yy15;
}
-yy361:
- YYDEBUG(361, YYPEEK ());
- yyaccept = 34;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy390:
+ YYDEBUG(390, YYPEEK());
+ yyaccept = 38;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -9907,52 +11180,52 @@ yy361:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy362;
+ default: goto yy391;
}
-yy362:
- YYDEBUG(362, YYPEEK ());
-#line 332 "../ada.re2c"
- {*id = 62; continue;}
-#line 9917 "../ada_re2c.c"
-yy363:
- YYDEBUG(363, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy391:
+ YYDEBUG(391, YYPEEK());
+#line 333 "ada_annex_p.re2c"
+ {*id = 40; continue;}
+#line 11190 "ada_annex_p_re2c.c"
+yy392:
+ YYDEBUG(392, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'Y':
- case 'y': goto yy429;
+ case 'y': goto yy466;
default: goto yy15;
}
-yy364:
- YYDEBUG(364, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy393:
+ YYDEBUG(393, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'H':
- case 'h': goto yy430;
+ case 'h': goto yy467;
default: goto yy15;
}
-yy365:
- YYDEBUG(365, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy394:
+ YYDEBUG(394, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy431;
+ case 'e': goto yy468;
default: goto yy15;
}
-yy366:
- YYDEBUG(366, YYPEEK ());
- yyaccept = 35;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy395:
+ YYDEBUG(395, YYPEEK());
+ yyaccept = 39;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -10069,30 +11342,30 @@ yy366:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy367;
+ default: goto yy396;
}
-yy367:
- YYDEBUG(367, YYPEEK ());
-#line 336 "../ada.re2c"
- {*id = 66; continue;}
-#line 10079 "../ada_re2c.c"
-yy368:
- YYDEBUG(368, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy396:
+ YYDEBUG(396, YYPEEK());
+#line 353 "ada_annex_p.re2c"
+ {*id = 60; continue;}
+#line 11352 "ada_annex_p_re2c.c"
+yy397:
+ YYDEBUG(397, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'I':
- case 'i': goto yy432;
+ case 'i': goto yy469;
default: goto yy15;
}
-yy369:
- YYDEBUG(369, YYPEEK ());
- yyaccept = 36;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy398:
+ YYDEBUG(398, YYPEEK());
+ yyaccept = 40;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -10209,19 +11482,19 @@ yy369:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy370;
+ default: goto yy399;
}
-yy370:
- YYDEBUG(370, YYPEEK ());
-#line 338 "../ada.re2c"
- {*id = 68; continue;}
-#line 10219 "../ada_re2c.c"
-yy371:
- YYDEBUG(371, YYPEEK ());
- yyaccept = 37;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy399:
+ YYDEBUG(399, YYPEEK());
+#line 336 "ada_annex_p.re2c"
+ {*id = 43; continue;}
+#line 11492 "ada_annex_p_re2c.c"
+yy400:
+ YYDEBUG(400, YYPEEK());
+ yyaccept = 41;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -10338,30 +11611,30 @@ yy371:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy372;
+ default: goto yy401;
}
-yy372:
- YYDEBUG(372, YYPEEK ());
-#line 339 "../ada.re2c"
- {*id = 69; continue;}
-#line 10348 "../ada_re2c.c"
-yy373:
- YYDEBUG(373, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy401:
+ YYDEBUG(401, YYPEEK());
+#line 376 "ada_annex_p.re2c"
+ {*id = 83; continue;}
+#line 11621 "ada_annex_p_re2c.c"
+yy402:
+ YYDEBUG(402, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'L':
- case 'l': goto yy433;
+ case 'l': goto yy470;
default: goto yy15;
}
-yy374:
- YYDEBUG(374, YYPEEK ());
- yyaccept = 38;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy403:
+ YYDEBUG(403, YYPEEK());
+ yyaccept = 42;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -10478,30 +11751,30 @@ yy374:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy375;
+ default: goto yy404;
}
-yy375:
- YYDEBUG(375, YYPEEK ());
-#line 342 "../ada.re2c"
- {*id = 72; continue;}
-#line 10488 "../ada_re2c.c"
-yy376:
- YYDEBUG(376, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy404:
+ YYDEBUG(404, YYPEEK());
+#line 356 "ada_annex_p.re2c"
+ {*id = 63; continue;}
+#line 11761 "ada_annex_p_re2c.c"
+yy405:
+ YYDEBUG(405, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy435;
+ case 'e': goto yy472;
default: goto yy15;
}
-yy377:
- YYDEBUG(377, YYPEEK ());
- yyaccept = 39;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy406:
+ YYDEBUG(406, YYPEEK());
+ yyaccept = 43;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -10618,60 +11891,81 @@ yy377:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy378;
+ default: goto yy407;
}
-yy378:
- YYDEBUG(378, YYPEEK ());
-#line 344 "../ada.re2c"
- {*id = 74; continue;}
-#line 10628 "../ada_re2c.c"
-yy379:
- YYDEBUG(379, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy407:
+ YYDEBUG(407, YYPEEK());
+#line 354 "ada_annex_p.re2c"
+ {*id = 61; continue;}
+#line 11901 "ada_annex_p_re2c.c"
+yy408:
+ YYDEBUG(408, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case ']': goto yy14;
default: goto yy88;
}
-yy380:
- YYDEBUG(380, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
- switch (yych) {
- case ']': goto yy86;
- default: goto yy88;
- }
-yy381:
- YYDEBUG(381, YYPEEK ());
- YYSKIP ();
- YYDEBUG(382, YYPEEK ());
- YYRESTORECTX ();
-#line 375 "../ada.re2c"
- {*id = 105; continue;}
-#line 10652 "../ada_re2c.c"
-yy383:
- YYDEBUG(383, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
- switch (yych) {
- case '"': goto yy88;
- default: goto yy438;
- }
-yy384:
- YYDEBUG(384, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy409:
+ YYDEBUG(409, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case ']': goto yy108;
+ case ']': goto yy89;
default: goto yy88;
}
-yy385:
- YYDEBUG(385, YYPEEK ());
- yyaccept = 40;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy410:
+ YYDEBUG(410, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ YYDEBUG(411, YYPEEK());
switch (yych) {
+ case 0x00:
+ case 0x01:
+ case 0x02:
+ case 0x03:
+ case 0x05:
+ case 0x06:
+ case 0x07:
+ case 0x08:
+ case '\t':
+ case '\v':
+ case '\f':
+ case '\r':
+ case 0x0E:
+ case 0x0F:
+ case 0x10:
+ case 0x11:
+ case 0x12:
+ case 0x13:
+ case 0x14:
+ case 0x15:
+ case 0x16:
+ case 0x17:
+ case 0x18:
+ case 0x19:
+ case 0x1A:
+ case 0x1B:
+ case 0x1C:
+ case 0x1D:
+ case 0x1E:
+ case 0x1F:
+ case ' ':
+ case '!':
+ case '"':
+ case '#':
+ case '$':
+ case '%':
+ case '&':
+ case '\'':
+ case '(':
+ case ')':
+ case '*':
+ case '+':
+ case ',':
+ case '-':
+ case '.':
+ case '/':
case '0':
case '1':
case '2':
@@ -10682,6 +11976,13 @@ yy385:
case '7':
case '8':
case '9':
+ case ':':
+ case ';':
+ case '<':
+ case '=':
+ case '>':
+ case '?':
+ case '@':
case 'A':
case 'B':
case 'C':
@@ -10709,7 +12010,11 @@ yy385:
case 'Y':
case 'Z':
case '[':
+ case '\\':
+ case ']':
+ case '^':
case '_':
+ case '`':
case 'a':
case 'b':
case 'c':
@@ -10736,6 +12041,13 @@ yy385:
case 'x':
case 'y':
case 'z':
+ case '{':
+ case '|':
+ case '}':
+ case '~':
+ case 0x7F: goto yy410;
+ case 0x04:
+ case '\n': goto yy474;
case 0xC2:
case 0xC3:
case 0xC4:
@@ -10765,8 +12077,8 @@ yy385:
case 0xDC:
case 0xDD:
case 0xDE:
- case 0xDF:
- case 0xE0:
+ case 0xDF: goto yy476;
+ case 0xE0: goto yy477;
case 0xE1:
case 0xE2:
case 0xE3:
@@ -10781,69 +12093,84 @@ yy385:
case 0xEC:
case 0xED:
case 0xEE:
- case 0xEF:
- case 0xF0:
+ case 0xEF: goto yy478;
+ case 0xF0: goto yy479;
case 0xF1:
case 0xF2:
- case 0xF3:
- case 0xF4: goto yy15;
- default: goto yy386;
+ case 0xF3: goto yy480;
+ case 0xF4: goto yy481;
+ default: goto yy88;
}
-yy386:
- YYDEBUG(386, YYPEEK ());
-#line 275 "../ada.re2c"
- {*id = 5; continue;}
-#line 10797 "../ada_re2c.c"
-yy387:
- YYDEBUG(387, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy412:
+ YYDEBUG(412, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case 'A':
- case 'a': goto yy439;
- default: goto yy15;
+ case 'f': goto yy482;
+ default: goto yy88;
}
-yy388:
- YYDEBUG(388, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy413:
+ YYDEBUG(413, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case 'T':
- case 't': goto yy440;
- default: goto yy15;
+ case 'i': goto yy484;
+ default: goto yy88;
}
-yy389:
- YYDEBUG(389, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy414:
+ YYDEBUG(414, YYPEEK());
+ YYSKIP();
+ YYDEBUG(415, YYPEEK());
+ YYRESTORECTX();
+#line 407 "ada_annex_p.re2c"
+ {*id = 114; continue;}
+#line 12128 "ada_annex_p_re2c.c"
+yy416:
+ YYDEBUG(416, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case 'S':
- case 's': goto yy442;
- default: goto yy15;
+ case '"': goto yy88;
+ default: goto yy486;
}
-yy390:
- YYDEBUG(390, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy417:
+ YYDEBUG(417, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case 'E':
- case 'e': goto yy444;
- default: goto yy15;
+ case ']': goto yy110;
+ default: goto yy88;
}
-yy391:
- YYDEBUG(391, YYPEEK ());
- yyaccept = 41;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy418:
+ YYDEBUG(418, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case '<': goto yy487;
+ default: goto yy88;
+ }
+yy419:
+ YYDEBUG(419, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case '=': goto yy488;
+ default: goto yy88;
+ }
+yy420:
+ YYDEBUG(420, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case '>': goto yy489;
+ default: goto yy88;
+ }
+yy421:
+ YYDEBUG(421, YYPEEK());
+ yyaccept = 44;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -10960,19 +12287,63 @@ yy391:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy392;
+ default: goto yy422;
}
-yy392:
- YYDEBUG(392, YYPEEK ());
-#line 281 "../ada.re2c"
- {*id = 11; continue;}
-#line 10970 "../ada_re2c.c"
-yy393:
- YYDEBUG(393, YYPEEK ());
- yyaccept = 42;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy422:
+ YYDEBUG(422, YYPEEK());
+#line 311 "ada_annex_p.re2c"
+ {*id = 18; continue;}
+#line 12297 "ada_annex_p_re2c.c"
+yy423:
+ YYDEBUG(423, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'A':
+ case 'a': goto yy490;
+ default: goto yy15;
+ }
+yy424:
+ YYDEBUG(424, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'T':
+ case 't': goto yy491;
+ default: goto yy15;
+ }
+yy425:
+ YYDEBUG(425, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'S':
+ case 's': goto yy493;
+ default: goto yy15;
+ }
+yy426:
+ YYDEBUG(426, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'E':
+ case 'e': goto yy495;
+ default: goto yy15;
+ }
+yy427:
+ YYDEBUG(427, YYPEEK());
+ yyaccept = 45;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -11089,41 +12460,19 @@ yy393:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy394;
- }
-yy394:
- YYDEBUG(394, YYPEEK ());
-#line 283 "../ada.re2c"
- {*id = 13; continue;}
-#line 11099 "../ada_re2c.c"
-yy395:
- YYDEBUG(395, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
- switch (yych) {
- case 'A':
- case 'a': goto yy445;
- default: goto yy15;
- }
-yy396:
- YYDEBUG(396, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
- switch (yych) {
- case 'R':
- case 'r': goto yy446;
- default: goto yy15;
+ default: goto yy428;
}
-yy397:
- YYDEBUG(397, YYPEEK ());
- yyaccept = 43;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy428:
+ YYDEBUG(428, YYPEEK());
+#line 363 "ada_annex_p.re2c"
+ {*id = 70; continue;}
+#line 12470 "ada_annex_p_re2c.c"
+yy429:
+ YYDEBUG(429, YYPEEK());
+ yyaccept = 46;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -11240,19 +12589,41 @@ yy397:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy398;
+ default: goto yy430;
}
-yy398:
- YYDEBUG(398, YYPEEK ());
-#line 288 "../ada.re2c"
- {*id = 18; continue;}
-#line 11250 "../ada_re2c.c"
-yy399:
- YYDEBUG(399, YYPEEK ());
- yyaccept = 44;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy430:
+ YYDEBUG(430, YYPEEK());
+#line 331 "ada_annex_p.re2c"
+ {*id = 38; continue;}
+#line 12599 "ada_annex_p_re2c.c"
+yy431:
+ YYDEBUG(431, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'A':
+ case 'a': goto yy496;
+ default: goto yy15;
+ }
+yy432:
+ YYDEBUG(432, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'R':
+ case 'r': goto yy497;
+ default: goto yy15;
+ }
+yy433:
+ YYDEBUG(433, YYPEEK());
+ yyaccept = 47;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -11369,30 +12740,19 @@ yy399:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy400;
- }
-yy400:
- YYDEBUG(400, YYPEEK ());
-#line 289 "../ada.re2c"
- {*id = 19; continue;}
-#line 11379 "../ada_re2c.c"
-yy401:
- YYDEBUG(401, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
- switch (yych) {
- case 'S':
- case 's': goto yy447;
- default: goto yy15;
+ default: goto yy434;
}
-yy402:
- YYDEBUG(402, YYPEEK ());
- yyaccept = 45;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy434:
+ YYDEBUG(434, YYPEEK());
+#line 310 "ada_annex_p.re2c"
+ {*id = 17; continue;}
+#line 12750 "ada_annex_p_re2c.c"
+yy435:
+ YYDEBUG(435, YYPEEK());
+ yyaccept = 48;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -11509,19 +12869,30 @@ yy402:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy403;
+ default: goto yy436;
}
-yy403:
- YYDEBUG(403, YYPEEK ());
-#line 293 "../ada.re2c"
- {*id = 23; continue;}
-#line 11519 "../ada_re2c.c"
-yy404:
- YYDEBUG(404, YYPEEK ());
- yyaccept = 46;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy436:
+ YYDEBUG(436, YYPEEK());
+#line 364 "ada_annex_p.re2c"
+ {*id = 71; continue;}
+#line 12879 "ada_annex_p_re2c.c"
+yy437:
+ YYDEBUG(437, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'S':
+ case 's': goto yy498;
+ default: goto yy15;
+ }
+yy438:
+ YYDEBUG(438, YYPEEK());
+ yyaccept = 49;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -11638,151 +13009,291 @@ yy404:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy405;
+ default: goto yy439;
}
-yy405:
- YYDEBUG(405, YYPEEK ());
-#line 295 "../ada.re2c"
- {*id = 25; continue;}
-#line 11648 "../ada_re2c.c"
-yy406:
- YYDEBUG(406, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy439:
+ YYDEBUG(439, YYPEEK());
+#line 337 "ada_annex_p.re2c"
+ {*id = 44; continue;}
+#line 13019 "ada_annex_p_re2c.c"
+yy440:
+ YYDEBUG(440, YYPEEK());
+ yyaccept = 50;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
+ case 'A':
+ case 'B':
+ case 'C':
+ case 'D':
+ case 'E':
+ case 'F':
+ case 'G':
+ case 'H':
+ case 'I':
+ case 'J':
+ case 'K':
+ case 'L':
+ case 'M':
+ case 'N':
+ case 'O':
+ case 'P':
+ case 'Q':
+ case 'R':
+ case 'S':
+ case 'T':
+ case 'U':
+ case 'V':
+ case 'W':
+ case 'X':
+ case 'Y':
+ case 'Z':
+ case '[':
+ case '_':
+ case 'a':
+ case 'b':
+ case 'c':
+ case 'd':
+ case 'e':
+ case 'f':
+ case 'g':
+ case 'h':
+ case 'i':
+ case 'j':
+ case 'k':
+ case 'l':
+ case 'm':
+ case 'n':
+ case 'o':
+ case 'p':
+ case 'q':
+ case 'r':
+ case 's':
+ case 't':
+ case 'u':
+ case 'v':
+ case 'w':
+ case 'x':
+ case 'y':
+ case 'z':
+ case 0xC2:
+ case 0xC3:
+ case 0xC4:
+ case 0xC5:
+ case 0xC6:
+ case 0xC7:
+ case 0xC8:
+ case 0xC9:
+ case 0xCA:
+ case 0xCB:
+ case 0xCC:
+ case 0xCD:
+ case 0xCE:
+ case 0xCF:
+ case 0xD0:
+ case 0xD1:
+ case 0xD2:
+ case 0xD3:
+ case 0xD4:
+ case 0xD5:
+ case 0xD6:
+ case 0xD7:
+ case 0xD8:
+ case 0xD9:
+ case 0xDA:
+ case 0xDB:
+ case 0xDC:
+ case 0xDD:
+ case 0xDE:
+ case 0xDF:
+ case 0xE0:
+ case 0xE1:
+ case 0xE2:
+ case 0xE3:
+ case 0xE4:
+ case 0xE5:
+ case 0xE6:
+ case 0xE7:
+ case 0xE8:
+ case 0xE9:
+ case 0xEA:
+ case 0xEB:
+ case 0xEC:
+ case 0xED:
+ case 0xEE:
+ case 0xEF:
+ case 0xF0:
+ case 0xF1:
+ case 0xF2:
+ case 0xF3:
+ case 0xF4: goto yy15;
+ default: goto yy441;
+ }
+yy441:
+ YYDEBUG(441, YYPEEK());
+#line 314 "ada_annex_p.re2c"
+ {*id = 21; continue;}
+#line 13148 "ada_annex_p_re2c.c"
+yy442:
+ YYDEBUG(442, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'T':
- case 't': goto yy449;
+ case 't': goto yy500;
default: goto yy15;
}
-yy407:
- YYDEBUG(407, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy443:
+ YYDEBUG(443, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'I':
- case 'i': goto yy450;
+ case 'i': goto yy501;
default: goto yy15;
}
-yy408:
- YYDEBUG(408, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy444:
+ YYDEBUG(444, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'I':
- case 'i': goto yy451;
+ case 'i': goto yy502;
default: goto yy15;
}
-yy409:
- YYDEBUG(409, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy445:
+ YYDEBUG(445, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'F':
- case 'f': goto yy452;
+ case 'f': goto yy503;
default: goto yy15;
}
-yy410:
- YYDEBUG(410, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy446:
+ YYDEBUG(446, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy453;
+ case 'e': goto yy504;
default: goto yy15;
}
-yy411:
- YYDEBUG(411, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy447:
+ YYDEBUG(447, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'S':
- case 's': goto yy454;
+ case 's': goto yy505;
default: goto yy15;
}
-yy412:
- YYDEBUG(412, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy448:
+ YYDEBUG(448, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'I':
- case 'i': goto yy456;
+ case 'i': goto yy507;
default: goto yy15;
}
-yy413:
- YYDEBUG(413, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy449:
+ YYDEBUG(449, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'G':
- case 'g': goto yy457;
+ case 'g': goto yy508;
default: goto yy15;
}
-yy414:
- YYDEBUG(414, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy450:
+ YYDEBUG(450, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'L':
+ case 'l': goto yy509;
+ default: goto yy15;
+ }
+yy451:
+ YYDEBUG(451, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'A':
- case 'a': goto yy458;
+ case 'a': goto yy510;
default: goto yy15;
}
-yy415:
- YYDEBUG(415, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy452:
+ YYDEBUG(452, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'T':
- case 't': goto yy460;
+ case 't': goto yy512;
default: goto yy15;
}
-yy416:
- YYDEBUG(416, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy453:
+ YYDEBUG(453, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'D':
- case 'd': goto yy461;
+ case 'd': goto yy513;
default: goto yy15;
}
-yy417:
- YYDEBUG(417, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy454:
+ YYDEBUG(454, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'C':
- case 'c': goto yy462;
+ case 'c': goto yy514;
default: goto yy15;
}
-yy418:
- YYDEBUG(418, YYPEEK ());
- yyaccept = 47;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy455:
+ YYDEBUG(455, YYPEEK());
+ yyaccept = 51;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -11899,19 +13410,19 @@ yy418:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy419;
+ default: goto yy456;
}
-yy419:
- YYDEBUG(419, YYPEEK ());
-#line 322 "../ada.re2c"
- {*id = 52; continue;}
-#line 11909 "../ada_re2c.c"
-yy420:
- YYDEBUG(420, YYPEEK ());
- yyaccept = 48;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy456:
+ YYDEBUG(456, YYPEEK());
+#line 305 "ada_annex_p.re2c"
+ {*id = 12; continue;}
+#line 13420 "ada_annex_p_re2c.c"
+yy457:
+ YYDEBUG(457, YYPEEK());
+ yyaccept = 52;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -12028,140 +13539,140 @@ yy420:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy421;
+ default: goto yy458;
}
-yy421:
- YYDEBUG(421, YYPEEK ());
-#line 323 "../ada.re2c"
- {*id = 53; continue;}
-#line 12038 "../ada_re2c.c"
-yy422:
- YYDEBUG(422, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy458:
+ YYDEBUG(458, YYPEEK());
+#line 367 "ada_annex_p.re2c"
+ {*id = 74; continue;}
+#line 13549 "ada_annex_p_re2c.c"
+yy459:
+ YYDEBUG(459, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'D':
- case 'd': goto yy463;
+ case 'd': goto yy515;
default: goto yy15;
}
-yy423:
- YYDEBUG(423, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy460:
+ YYDEBUG(460, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy465;
+ case 'e': goto yy517;
default: goto yy15;
}
-yy424:
- YYDEBUG(424, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy461:
+ YYDEBUG(461, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'U':
- case 'u': goto yy466;
+ case 'u': goto yy518;
default: goto yy15;
}
-yy425:
- YYDEBUG(425, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy462:
+ YYDEBUG(462, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'N':
- case 'n': goto yy467;
+ case 'n': goto yy519;
default: goto yy15;
}
-yy426:
- YYDEBUG(426, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy463:
+ YYDEBUG(463, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'S':
- case 's': goto yy469;
+ case 's': goto yy521;
default: goto yy15;
}
-yy427:
- YYDEBUG(427, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy464:
+ YYDEBUG(464, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'T':
- case 't': goto yy470;
+ case 't': goto yy522;
default: goto yy15;
}
-yy428:
- YYDEBUG(428, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy465:
+ YYDEBUG(465, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'A':
- case 'a': goto yy472;
+ case 'a': goto yy524;
default: goto yy15;
}
-yy429:
- YYDEBUG(429, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy466:
+ YYDEBUG(466, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'P':
- case 'p': goto yy473;
+ case 'p': goto yy525;
default: goto yy15;
}
-yy430:
- YYDEBUG(430, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy467:
+ YYDEBUG(467, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'R':
- case 'r': goto yy474;
+ case 'r': goto yy526;
default: goto yy15;
}
-yy431:
- YYDEBUG(431, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy468:
+ YYDEBUG(468, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'D':
- case 'd': goto yy475;
+ case 'd': goto yy527;
default: goto yy15;
}
-yy432:
- YYDEBUG(432, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy469:
+ YYDEBUG(469, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'N':
- case 'n': goto yy477;
+ case 'n': goto yy529;
default: goto yy15;
}
-yy433:
- YYDEBUG(433, YYPEEK ());
- yyaccept = 49;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy470:
+ YYDEBUG(470, YYPEEK());
+ yyaccept = 53;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -12278,21 +13789,21 @@ yy433:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy434;
+ default: goto yy471;
}
-yy434:
- YYDEBUG(434, YYPEEK ());
-#line 340 "../ada.re2c"
- {*id = 70; continue;}
-#line 12288 "../ada_re2c.c"
-yy435:
- YYDEBUG(435, YYPEEK ());
- yyaccept = 50;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
- switch (yych) {
- case '0':
+yy471:
+ YYDEBUG(471, YYPEEK());
+#line 309 "ada_annex_p.re2c"
+ {*id = 16; continue;}
+#line 13799 "ada_annex_p_re2c.c"
+yy472:
+ YYDEBUG(472, YYPEEK());
+ yyaccept = 54;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case '0':
case '1':
case '2':
case '3':
@@ -12407,192 +13918,402 @@ yy435:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy436;
+ default: goto yy473;
}
-yy436:
- YYDEBUG(436, YYPEEK ());
-#line 343 "../ada.re2c"
- {*id = 73; continue;}
-#line 12417 "../ada_re2c.c"
-yy437:
- YYDEBUG(437, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
-yy438:
- YYDEBUG(438, YYPEEK ());
+yy473:
+ YYDEBUG(473, YYPEEK());
+#line 328 "ada_annex_p.re2c"
+ {*id = 35; continue;}
+#line 13928 "ada_annex_p_re2c.c"
+yy474:
+ YYDEBUG(474, YYPEEK());
+ YYSKIP();
+ YYDEBUG(475, YYPEEK());
+#line 298 "ada_annex_p.re2c"
+ {*id = 5; if (lexer->cursor[-1] == 0x0a || (lexer->cursor[-1] == 0x0d
&& lexer->cursor[-2] == 0x0a)) lexer->line++; continue;}
+#line 13935 "ada_annex_p_re2c.c"
+yy476:
+ YYDEBUG(476, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case '"': goto yy478;
- case '0':
- case '1':
- case '2':
- case '3':
- case '4':
- case '5':
- case '6':
- case '7':
- case '8':
- case '9':
- case 'A':
- case 'B':
- case 'C':
- case 'D':
- case 'E':
- case 'F':
- case 'a':
- case 'b':
- case 'c':
- case 'd':
- case 'e':
- case 'f': goto yy437;
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy410;
default: goto yy88;
}
-yy439:
- YYDEBUG(439, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy477:
+ YYDEBUG(477, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case 'C':
- case 'c': goto yy479;
- default: goto yy15;
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy476;
+ default: goto yy88;
}
-yy440:
- YYDEBUG(440, YYPEEK ());
- yyaccept = 51;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy478:
+ YYDEBUG(478, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case '0':
- case '1':
- case '2':
- case '3':
- case '4':
- case '5':
- case '6':
- case '7':
- case '8':
- case '9':
- case 'A':
- case 'B':
- case 'C':
- case 'D':
- case 'E':
- case 'F':
- case 'G':
- case 'H':
- case 'I':
- case 'J':
- case 'K':
- case 'L':
- case 'M':
- case 'N':
- case 'O':
- case 'P':
- case 'Q':
- case 'R':
- case 'S':
- case 'T':
- case 'U':
- case 'V':
- case 'W':
- case 'X':
- case 'Y':
- case 'Z':
- case '[':
- case '_':
- case 'a':
- case 'b':
- case 'c':
- case 'd':
- case 'e':
- case 'f':
- case 'g':
- case 'h':
- case 'i':
- case 'j':
- case 'k':
- case 'l':
- case 'm':
- case 'n':
- case 'o':
- case 'p':
- case 'q':
- case 'r':
- case 's':
- case 't':
- case 'u':
- case 'v':
- case 'w':
- case 'x':
- case 'y':
- case 'z':
- case 0xC2:
- case 0xC3:
- case 0xC4:
- case 0xC5:
- case 0xC6:
- case 0xC7:
- case 0xC8:
- case 0xC9:
- case 0xCA:
- case 0xCB:
- case 0xCC:
- case 0xCD:
- case 0xCE:
- case 0xCF:
- case 0xD0:
- case 0xD1:
- case 0xD2:
- case 0xD3:
- case 0xD4:
- case 0xD5:
- case 0xD6:
- case 0xD7:
- case 0xD8:
- case 0xD9:
- case 0xDA:
- case 0xDB:
- case 0xDC:
- case 0xDD:
- case 0xDE:
- case 0xDF:
- case 0xE0:
- case 0xE1:
- case 0xE2:
- case 0xE3:
- case 0xE4:
- case 0xE5:
- case 0xE6:
- case 0xE7:
- case 0xE8:
- case 0xE9:
- case 0xEA:
- case 0xEB:
- case 0xEC:
- case 0xED:
- case 0xEE:
- case 0xEF:
- case 0xF0:
- case 0xF1:
- case 0xF2:
- case 0xF3:
- case 0xF4: goto yy15;
- default: goto yy441;
- }
-yy441:
- YYDEBUG(441, YYPEEK ());
-#line 274 "../ada.re2c"
- {*id = 4; continue;}
-#line 12589 "../ada_re2c.c"
-yy442:
- YYDEBUG(442, YYPEEK ());
- yyaccept = 52;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy476;
+ default: goto yy88;
+ }
+yy479:
+ YYDEBUG(479, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy478;
+ default: goto yy88;
+ }
+yy480:
+ YYDEBUG(480, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy478;
+ default: goto yy88;
+ }
+yy481:
+ YYDEBUG(481, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F: goto yy478;
+ default: goto yy88;
+ }
+yy482:
+ YYDEBUG(482, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ YYDEBUG(483, YYPEEK());
switch (yych) {
+ case 0x00:
+ case 0x01:
+ case 0x02:
+ case 0x03:
+ case 0x05:
+ case 0x06:
+ case 0x07:
+ case 0x08:
+ case '\t':
+ case '\v':
+ case '\f':
+ case '\r':
+ case 0x0E:
+ case 0x0F:
+ case 0x10:
+ case 0x11:
+ case 0x12:
+ case 0x13:
+ case 0x14:
+ case 0x15:
+ case 0x16:
+ case 0x17:
+ case 0x18:
+ case 0x19:
+ case 0x1A:
+ case 0x1B:
+ case 0x1C:
+ case 0x1D:
+ case 0x1E:
+ case 0x1F:
+ case ' ':
+ case '!':
+ case '"':
+ case '#':
+ case '$':
+ case '%':
+ case '&':
+ case '\'':
+ case '(':
+ case ')':
+ case '*':
+ case '+':
+ case ',':
+ case '-':
+ case '.':
+ case '/':
case '0':
case '1':
case '2':
@@ -12603,6 +14324,13 @@ yy442:
case '7':
case '8':
case '9':
+ case ':':
+ case ';':
+ case '<':
+ case '=':
+ case '>':
+ case '?':
+ case '@':
case 'A':
case 'B':
case 'C':
@@ -12630,7 +14358,11 @@ yy442:
case 'Y':
case 'Z':
case '[':
+ case '\\':
+ case ']':
+ case '^':
case '_':
+ case '`':
case 'a':
case 'b':
case 'c':
@@ -12657,6 +14389,13 @@ yy442:
case 'x':
case 'y':
case 'z':
+ case '{':
+ case '|':
+ case '}':
+ case '~':
+ case 0x7F: goto yy482;
+ case 0x04:
+ case '\n': goto yy530;
case 0xC2:
case 0xC3:
case 0xC4:
@@ -12686,8 +14425,8 @@ yy442:
case 0xDC:
case 0xDD:
case 0xDE:
- case 0xDF:
- case 0xE0:
+ case 0xDF: goto yy532;
+ case 0xE0: goto yy533;
case 0xE1:
case 0xE2:
case 0xE3:
@@ -12702,58 +14441,95 @@ yy442:
case 0xEC:
case 0xED:
case 0xEE:
- case 0xEF:
- case 0xF0:
+ case 0xEF: goto yy534;
+ case 0xF0: goto yy535;
case 0xF1:
case 0xF2:
- case 0xF3:
- case 0xF4: goto yy15;
- default: goto yy443;
+ case 0xF3: goto yy536;
+ case 0xF4: goto yy537;
+ default: goto yy88;
}
-yy443:
- YYDEBUG(443, YYPEEK ());
-#line 277 "../ada.re2c"
- {*id = 7; continue;}
-#line 12718 "../ada_re2c.c"
-yy444:
- YYDEBUG(444, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy484:
+ YYDEBUG(484, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'f': goto yy538;
+ default: goto yy88;
+ }
+yy485:
+ YYDEBUG(485, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+yy486:
+ YYDEBUG(486, YYPEEK());
switch (yych) {
+ case '"': goto yy540;
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
+ case 'A':
+ case 'B':
+ case 'C':
case 'D':
- case 'd': goto yy480;
- default: goto yy15;
+ case 'E':
+ case 'F':
+ case 'a':
+ case 'b':
+ case 'c':
+ case 'd':
+ case 'e':
+ case 'f': goto yy485;
+ default: goto yy88;
}
-yy445:
- YYDEBUG(445, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy487:
+ YYDEBUG(487, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case 'N':
- case 'n': goto yy482;
- default: goto yy15;
+ case '<': goto yy541;
+ default: goto yy88;
}
-yy446:
- YYDEBUG(446, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy488:
+ YYDEBUG(488, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case 'E':
- case 'e': goto yy483;
+ case '=': goto yy543;
+ default: goto yy88;
+ }
+yy489:
+ YYDEBUG(489, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case '>': goto yy545;
+ default: goto yy88;
+ }
+yy490:
+ YYDEBUG(490, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'C':
+ case 'c': goto yy547;
default: goto yy15;
}
-yy447:
- YYDEBUG(447, YYPEEK ());
- yyaccept = 53;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy491:
+ YYDEBUG(491, YYPEEK());
+ yyaccept = 55;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -12870,74 +14646,19 @@ yy447:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy448;
- }
-yy448:
- YYDEBUG(448, YYPEEK ());
-#line 290 "../ada.re2c"
- {*id = 20; continue;}
-#line 12880 "../ada_re2c.c"
-yy449:
- YYDEBUG(449, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
- switch (yych) {
- case 'I':
- case 'i': goto yy485;
- default: goto yy15;
- }
-yy450:
- YYDEBUG(450, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
- switch (yych) {
- case 'O':
- case 'o': goto yy486;
- default: goto yy15;
- }
-yy451:
- YYDEBUG(451, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
- switch (yych) {
- case 'C':
- case 'c': goto yy487;
- default: goto yy15;
- }
-yy452:
- YYDEBUG(452, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
- switch (yych) {
- case 'A':
- case 'a': goto yy489;
- default: goto yy15;
- }
-yy453:
- YYDEBUG(453, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
- switch (yych) {
- case 'D':
- case 'd': goto yy490;
- default: goto yy15;
+ default: goto yy492;
}
-yy454:
- YYDEBUG(454, YYPEEK ());
- yyaccept = 54;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy492:
+ YYDEBUG(492, YYPEEK());
+#line 313 "ada_annex_p.re2c"
+ {*id = 20; continue;}
+#line 14656 "ada_annex_p_re2c.c"
+yy493:
+ YYDEBUG(493, YYPEEK());
+ yyaccept = 56;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -13054,41 +14775,52 @@ yy454:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy455;
+ default: goto yy494;
}
-yy455:
- YYDEBUG(455, YYPEEK ());
-#line 314 "../ada.re2c"
- {*id = 44; continue;}
-#line 13064 "../ada_re2c.c"
-yy456:
- YYDEBUG(456, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy494:
+ YYDEBUG(494, YYPEEK());
+#line 349 "ada_annex_p.re2c"
+ {*id = 56; continue;}
+#line 14785 "ada_annex_p_re2c.c"
+yy495:
+ YYDEBUG(495, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'D':
- case 'd': goto yy492;
+ case 'd': goto yy548;
default: goto yy15;
}
-yy457:
- YYDEBUG(457, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy496:
+ YYDEBUG(496, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'N':
+ case 'n': goto yy550;
+ default: goto yy15;
+ }
+yy497:
+ YYDEBUG(497, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy493;
+ case 'e': goto yy551;
default: goto yy15;
}
-yy458:
- YYDEBUG(458, YYPEEK ());
- yyaccept = 55;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy498:
+ YYDEBUG(498, YYPEEK());
+ yyaccept = 57;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -13205,52 +14937,74 @@ yy458:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy459;
+ default: goto yy499;
}
-yy459:
- YYDEBUG(459, YYPEEK ());
-#line 318 "../ada.re2c"
- {*id = 48; continue;}
-#line 13215 "../ada_re2c.c"
-yy460:
- YYDEBUG(460, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy499:
+ YYDEBUG(499, YYPEEK());
+#line 365 "ada_annex_p.re2c"
+ {*id = 72; continue;}
+#line 14947 "ada_annex_p_re2c.c"
+yy500:
+ YYDEBUG(500, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
- case 'E':
- case 'e': goto yy495;
+ case 'I':
+ case 'i': goto yy553;
default: goto yy15;
}
-yy461:
- YYDEBUG(461, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy501:
+ YYDEBUG(501, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
- case 'U':
- case 'u': goto yy497;
+ case 'O':
+ case 'o': goto yy554;
default: goto yy15;
}
-yy462:
- YYDEBUG(462, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy502:
+ YYDEBUG(502, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
- case 'T':
- case 't': goto yy498;
+ case 'C':
+ case 'c': goto yy555;
default: goto yy15;
}
-yy463:
- YYDEBUG(463, YYPEEK ());
- yyaccept = 56;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy503:
+ YYDEBUG(503, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'A':
+ case 'a': goto yy557;
+ default: goto yy15;
+ }
+yy504:
+ YYDEBUG(504, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'D':
+ case 'd': goto yy558;
+ default: goto yy15;
+ }
+yy505:
+ YYDEBUG(505, YYPEEK());
+ yyaccept = 58;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -13367,41 +15121,52 @@ yy463:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy464;
+ default: goto yy506;
}
-yy464:
- YYDEBUG(464, YYPEEK ());
-#line 324 "../ada.re2c"
- {*id = 54; continue;}
-#line 13377 "../ada_re2c.c"
-yy465:
- YYDEBUG(465, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy506:
+ YYDEBUG(506, YYPEEK());
+#line 355 "ada_annex_p.re2c"
+ {*id = 62; continue;}
+#line 15131 "ada_annex_p_re2c.c"
+yy507:
+ YYDEBUG(507, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
- case 'S':
- case 's': goto yy499;
+ case 'D':
+ case 'd': goto yy560;
default: goto yy15;
}
-yy466:
- YYDEBUG(466, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy508:
+ YYDEBUG(508, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy501;
+ case 'e': goto yy561;
default: goto yy15;
}
-yy467:
- YYDEBUG(467, YYPEEK ());
- yyaccept = 57;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy509:
+ YYDEBUG(509, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'E':
+ case 'e': goto yy563;
+ default: goto yy15;
+ }
+yy510:
+ YYDEBUG(510, YYPEEK());
+ yyaccept = 59;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -13518,30 +15283,52 @@ yy467:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy468;
+ default: goto yy511;
}
-yy468:
- YYDEBUG(468, YYPEEK ());
-#line 328 "../ada.re2c"
- {*id = 58; continue;}
-#line 13528 "../ada_re2c.c"
-yy469:
- YYDEBUG(469, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy511:
+ YYDEBUG(511, YYPEEK());
+#line 377 "ada_annex_p.re2c"
+ {*id = 84; continue;}
+#line 15293 "ada_annex_p_re2c.c"
+yy512:
+ YYDEBUG(512, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy503;
+ case 'e': goto yy564;
default: goto yy15;
}
-yy470:
- YYDEBUG(470, YYPEEK ());
- yyaccept = 58;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy513:
+ YYDEBUG(513, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'U':
+ case 'u': goto yy566;
+ default: goto yy15;
+ }
+yy514:
+ YYDEBUG(514, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'T':
+ case 't': goto yy567;
+ default: goto yy15;
+ }
+yy515:
+ YYDEBUG(515, YYPEEK());
+ yyaccept = 60;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -13658,52 +15445,41 @@ yy470:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy471;
+ default: goto yy516;
}
-yy471:
- YYDEBUG(471, YYPEEK ());
-#line 331 "../ada.re2c"
- {*id = 61; continue;}
-#line 13668 "../ada_re2c.c"
-yy472:
- YYDEBUG(472, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy516:
+ YYDEBUG(516, YYPEEK());
+#line 360 "ada_annex_p.re2c"
+ {*id = 67; continue;}
+#line 15455 "ada_annex_p_re2c.c"
+yy517:
+ YYDEBUG(517, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
- case 'T':
- case 't': goto yy505;
+ case 'S':
+ case 's': goto yy568;
default: goto yy15;
}
-yy473:
- YYDEBUG(473, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy518:
+ YYDEBUG(518, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy506;
- default: goto yy15;
- }
-yy474:
- YYDEBUG(474, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
- switch (yych) {
- case 'O':
- case 'o': goto yy508;
+ case 'e': goto yy570;
default: goto yy15;
}
-yy475:
- YYDEBUG(475, YYPEEK ());
- yyaccept = 59;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy519:
+ YYDEBUG(519, YYPEEK());
+ yyaccept = 61;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -13820,49 +15596,30 @@ yy475:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy476;
- }
-yy476:
- YYDEBUG(476, YYPEEK ());
-#line 335 "../ada.re2c"
- {*id = 65; continue;}
-#line 13830 "../ada_re2c.c"
-yy477:
- YYDEBUG(477, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
- switch (yych) {
- case 'A':
- case 'a': goto yy509;
- default: goto yy15;
- }
-yy478:
- YYDEBUG(478, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
- switch (yych) {
- case ']': goto yy302;
- default: goto yy88;
+ default: goto yy520;
}
-yy479:
- YYDEBUG(479, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy520:
+ YYDEBUG(520, YYPEEK());
+#line 323 "ada_annex_p.re2c"
+ {*id = 30; continue;}
+#line 15606 "ada_annex_p_re2c.c"
+yy521:
+ YYDEBUG(521, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
- case 'T':
- case 't': goto yy510;
+ case 'E':
+ case 'e': goto yy572;
default: goto yy15;
}
-yy480:
- YYDEBUG(480, YYPEEK ());
- yyaccept = 60;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy522:
+ YYDEBUG(522, YYPEEK());
+ yyaccept = 62;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -13979,181 +15736,52 @@ yy480:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy481;
+ default: goto yy523;
}
-yy481:
- YYDEBUG(481, YYPEEK ());
-#line 278 "../ada.re2c"
- {*id = 8; continue;}
-#line 13989 "../ada_re2c.c"
-yy482:
- YYDEBUG(482, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy523:
+ YYDEBUG(523, YYPEEK());
+#line 308 "ada_annex_p.re2c"
+ {*id = 15; continue;}
+#line 15746 "ada_annex_p_re2c.c"
+yy524:
+ YYDEBUG(524, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'T':
- case 't': goto yy512;
+ case 't': goto yy574;
default: goto yy15;
}
-yy483:
- YYDEBUG(483, YYPEEK ());
- yyaccept = 61;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy525:
+ YYDEBUG(525, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
- case '0':
- case '1':
- case '2':
- case '3':
- case '4':
- case '5':
- case '6':
- case '7':
- case '8':
- case '9':
- case 'A':
- case 'B':
- case 'C':
- case 'D':
case 'E':
- case 'F':
- case 'G':
- case 'H':
- case 'I':
- case 'J':
- case 'K':
- case 'L':
- case 'M':
- case 'N':
- case 'O':
- case 'P':
- case 'Q':
- case 'R':
- case 'S':
- case 'T':
- case 'U':
- case 'V':
- case 'W':
- case 'X':
- case 'Y':
- case 'Z':
- case '[':
- case '_':
- case 'a':
- case 'b':
- case 'c':
- case 'd':
- case 'e':
- case 'f':
- case 'g':
- case 'h':
- case 'i':
- case 'j':
- case 'k':
- case 'l':
- case 'm':
- case 'n':
- case 'o':
- case 'p':
- case 'q':
- case 'r':
- case 's':
- case 't':
- case 'u':
- case 'v':
- case 'w':
- case 'x':
- case 'y':
- case 'z':
- case 0xC2:
- case 0xC3:
- case 0xC4:
- case 0xC5:
- case 0xC6:
- case 0xC7:
- case 0xC8:
- case 0xC9:
- case 0xCA:
- case 0xCB:
- case 0xCC:
- case 0xCD:
- case 0xCE:
- case 0xCF:
- case 0xD0:
- case 0xD1:
- case 0xD2:
- case 0xD3:
- case 0xD4:
- case 0xD5:
- case 0xD6:
- case 0xD7:
- case 0xD8:
- case 0xD9:
- case 0xDA:
- case 0xDB:
- case 0xDC:
- case 0xDD:
- case 0xDE:
- case 0xDF:
- case 0xE0:
- case 0xE1:
- case 0xE2:
- case 0xE3:
- case 0xE4:
- case 0xE5:
- case 0xE6:
- case 0xE7:
- case 0xE8:
- case 0xE9:
- case 0xEA:
- case 0xEB:
- case 0xEC:
- case 0xED:
- case 0xEE:
- case 0xEF:
- case 0xF0:
- case 0xF1:
- case 0xF2:
- case 0xF3:
- case 0xF4: goto yy15;
- default: goto yy484;
- }
-yy484:
- YYDEBUG(484, YYPEEK ());
-#line 287 "../ada.re2c"
- {*id = 17; continue;}
-#line 14129 "../ada_re2c.c"
-yy485:
- YYDEBUG(485, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
- switch (yych) {
- case 'O':
- case 'o': goto yy514;
+ case 'e': goto yy575;
default: goto yy15;
}
-yy486:
- YYDEBUG(486, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy526:
+ YYDEBUG(526, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
- case 'N':
- case 'n': goto yy515;
+ case 'O':
+ case 'o': goto yy577;
default: goto yy15;
}
-yy487:
- YYDEBUG(487, YYPEEK ());
- yyaccept = 62;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy527:
+ YYDEBUG(527, YYPEEK());
+ yyaccept = 63;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -14270,489 +15898,462 @@ yy487:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy488;
+ default: goto yy528;
}
-yy488:
- YYDEBUG(488, YYPEEK ());
-#line 300 "../ada.re2c"
- {*id = 30; continue;}
-#line 14280 "../ada_re2c.c"
-yy489:
- YYDEBUG(489, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy528:
+ YYDEBUG(528, YYPEEK());
+#line 361 "ada_annex_p.re2c"
+ {*id = 68; continue;}
+#line 15908 "ada_annex_p_re2c.c"
+yy529:
+ YYDEBUG(529, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
- case 'C':
- case 'c': goto yy517;
+ case 'A':
+ case 'a': goto yy578;
default: goto yy15;
}
-yy490:
- YYDEBUG(490, YYPEEK ());
- yyaccept = 63;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy530:
+ YYDEBUG(530, YYPEEK());
+ YYSKIP();
+ YYDEBUG(531, YYPEEK());
+#line 297 "ada_annex_p.re2c"
+ {*id = 4; if (lexer->cursor[-1] == 0x0a || (lexer->cursor[-1] == 0x0d
&& lexer->cursor[-2] == 0x0a)) lexer->line++; continue;}
+#line 15926 "ada_annex_p_re2c.c"
+yy532:
+ YYDEBUG(532, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case '0':
- case '1':
- case '2':
- case '3':
- case '4':
- case '5':
- case '6':
- case '7':
- case '8':
- case '9':
- case 'A':
- case 'B':
- case 'C':
- case 'D':
- case 'E':
- case 'F':
- case 'G':
- case 'H':
- case 'I':
- case 'J':
- case 'K':
- case 'L':
- case 'M':
- case 'N':
- case 'O':
- case 'P':
- case 'Q':
- case 'R':
- case 'S':
- case 'T':
- case 'U':
- case 'V':
- case 'W':
- case 'X':
- case 'Y':
- case 'Z':
- case '[':
- case '_':
- case 'a':
- case 'b':
- case 'c':
- case 'd':
- case 'e':
- case 'f':
- case 'g':
- case 'h':
- case 'i':
- case 'j':
- case 'k':
- case 'l':
- case 'm':
- case 'n':
- case 'o':
- case 'p':
- case 'q':
- case 'r':
- case 's':
- case 't':
- case 'u':
- case 'v':
- case 'w':
- case 'x':
- case 'y':
- case 'z':
- case 0xC2:
- case 0xC3:
- case 0xC4:
- case 0xC5:
- case 0xC6:
- case 0xC7:
- case 0xC8:
- case 0xC9:
- case 0xCA:
- case 0xCB:
- case 0xCC:
- case 0xCD:
- case 0xCE:
- case 0xCF:
- case 0xD0:
- case 0xD1:
- case 0xD2:
- case 0xD3:
- case 0xD4:
- case 0xD5:
- case 0xD6:
- case 0xD7:
- case 0xD8:
- case 0xD9:
- case 0xDA:
- case 0xDB:
- case 0xDC:
- case 0xDD:
- case 0xDE:
- case 0xDF:
- case 0xE0:
- case 0xE1:
- case 0xE2:
- case 0xE3:
- case 0xE4:
- case 0xE5:
- case 0xE6:
- case 0xE7:
- case 0xE8:
- case 0xE9:
- case 0xEA:
- case 0xEB:
- case 0xEC:
- case 0xED:
- case 0xEE:
- case 0xEF:
- case 0xF0:
- case 0xF1:
- case 0xF2:
- case 0xF3:
- case 0xF4: goto yy15;
- default: goto yy491;
- }
-yy491:
- YYDEBUG(491, YYPEEK ());
-#line 306 "../ada.re2c"
- {*id = 36; continue;}
-#line 14420 "../ada_re2c.c"
-yy492:
- YYDEBUG(492, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
- switch (yych) {
- case 'I':
- case 'i': goto yy518;
- default: goto yy15;
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy482;
+ default: goto yy88;
}
-yy493:
- YYDEBUG(493, YYPEEK ());
- yyaccept = 64;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy533:
+ YYDEBUG(533, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case '0':
- case '1':
- case '2':
- case '3':
- case '4':
- case '5':
- case '6':
- case '7':
- case '8':
- case '9':
- case 'A':
- case 'B':
- case 'C':
- case 'D':
- case 'E':
- case 'F':
- case 'G':
- case 'H':
- case 'I':
- case 'J':
- case 'K':
- case 'L':
- case 'M':
- case 'N':
- case 'O':
- case 'P':
- case 'Q':
- case 'R':
- case 'S':
- case 'T':
- case 'U':
- case 'V':
- case 'W':
- case 'X':
- case 'Y':
- case 'Z':
- case '[':
- case '_':
- case 'a':
- case 'b':
- case 'c':
- case 'd':
- case 'e':
- case 'f':
- case 'g':
- case 'h':
- case 'i':
- case 'j':
- case 'k':
- case 'l':
- case 'm':
- case 'n':
- case 'o':
- case 'p':
- case 'q':
- case 'r':
- case 's':
- case 't':
- case 'u':
- case 'v':
- case 'w':
- case 'x':
- case 'y':
- case 'z':
- case 0xC2:
- case 0xC3:
- case 0xC4:
- case 0xC5:
- case 0xC6:
- case 0xC7:
- case 0xC8:
- case 0xC9:
- case 0xCA:
- case 0xCB:
- case 0xCC:
- case 0xCD:
- case 0xCE:
- case 0xCF:
- case 0xD0:
- case 0xD1:
- case 0xD2:
- case 0xD3:
- case 0xD4:
- case 0xD5:
- case 0xD6:
- case 0xD7:
- case 0xD8:
- case 0xD9:
- case 0xDA:
- case 0xDB:
- case 0xDC:
- case 0xDD:
- case 0xDE:
- case 0xDF:
- case 0xE0:
- case 0xE1:
- case 0xE2:
- case 0xE3:
- case 0xE4:
- case 0xE5:
- case 0xE6:
- case 0xE7:
- case 0xE8:
- case 0xE9:
- case 0xEA:
- case 0xEB:
- case 0xEC:
- case 0xED:
- case 0xEE:
- case 0xEF:
- case 0xF0:
- case 0xF1:
- case 0xF2:
- case 0xF3:
- case 0xF4: goto yy15;
- default: goto yy494;
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy532;
+ default: goto yy88;
}
-yy494:
- YYDEBUG(494, YYPEEK ());
-#line 317 "../ada.re2c"
- {*id = 47; continue;}
-#line 14560 "../ada_re2c.c"
-yy495:
- YYDEBUG(495, YYPEEK ());
- yyaccept = 65;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy534:
+ YYDEBUG(534, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case '0':
- case '1':
- case '2':
- case '3':
- case '4':
- case '5':
- case '6':
- case '7':
- case '8':
- case '9':
- case 'A':
- case 'B':
- case 'C':
- case 'D':
- case 'E':
- case 'F':
- case 'G':
- case 'H':
- case 'I':
- case 'J':
- case 'K':
- case 'L':
- case 'M':
- case 'N':
- case 'O':
- case 'P':
- case 'Q':
- case 'R':
- case 'S':
- case 'T':
- case 'U':
- case 'V':
- case 'W':
- case 'X':
- case 'Y':
- case 'Z':
- case '[':
- case '_':
- case 'a':
- case 'b':
- case 'c':
- case 'd':
- case 'e':
- case 'f':
- case 'g':
- case 'h':
- case 'i':
- case 'j':
- case 'k':
- case 'l':
- case 'm':
- case 'n':
- case 'o':
- case 'p':
- case 'q':
- case 'r':
- case 's':
- case 't':
- case 'u':
- case 'v':
- case 'w':
- case 'x':
- case 'y':
- case 'z':
- case 0xC2:
- case 0xC3:
- case 0xC4:
- case 0xC5:
- case 0xC6:
- case 0xC7:
- case 0xC8:
- case 0xC9:
- case 0xCA:
- case 0xCB:
- case 0xCC:
- case 0xCD:
- case 0xCE:
- case 0xCF:
- case 0xD0:
- case 0xD1:
- case 0xD2:
- case 0xD3:
- case 0xD4:
- case 0xD5:
- case 0xD6:
- case 0xD7:
- case 0xD8:
- case 0xD9:
- case 0xDA:
- case 0xDB:
- case 0xDC:
- case 0xDD:
- case 0xDE:
- case 0xDF:
- case 0xE0:
- case 0xE1:
- case 0xE2:
- case 0xE3:
- case 0xE4:
- case 0xE5:
- case 0xE6:
- case 0xE7:
- case 0xE8:
- case 0xE9:
- case 0xEA:
- case 0xEB:
- case 0xEC:
- case 0xED:
- case 0xEE:
- case 0xEF:
- case 0xF0:
- case 0xF1:
- case 0xF2:
- case 0xF3:
- case 0xF4: goto yy15;
- default: goto yy496;
- }
-yy496:
- YYDEBUG(496, YYPEEK ());
-#line 319 "../ada.re2c"
- {*id = 49; continue;}
-#line 14689 "../ada_re2c.c"
-yy497:
- YYDEBUG(497, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
- switch (yych) {
- case 'R':
- case 'r': goto yy519;
- default: goto yy15;
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy532;
+ default: goto yy88;
}
-yy498:
- YYDEBUG(498, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy535:
+ YYDEBUG(535, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case 'E':
- case 'e': goto yy520;
- default: goto yy15;
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy534;
+ default: goto yy88;
}
-yy499:
- YYDEBUG(499, YYPEEK ());
- yyaccept = 66;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy536:
+ YYDEBUG(536, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case '0':
- case '1':
- case '2':
- case '3':
- case '4':
- case '5':
- case '6':
- case '7':
- case '8':
- case '9':
- case 'A':
- case 'B':
- case 'C':
- case 'D':
- case 'E':
- case 'F':
- case 'G':
- case 'H':
- case 'I':
- case 'J':
- case 'K':
- case 'L':
- case 'M':
- case 'N':
- case 'O':
- case 'P':
- case 'Q':
- case 'R':
- case 'S':
- case 'T':
- case 'U':
- case 'V':
- case 'W':
- case 'X':
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy534;
+ default: goto yy88;
+ }
+yy537:
+ YYDEBUG(537, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F: goto yy534;
+ default: goto yy88;
+ }
+yy538:
+ YYDEBUG(538, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ YYDEBUG(539, YYPEEK());
+ switch (yych) {
+ case 0x00:
+ case 0x01:
+ case 0x02:
+ case 0x03:
+ case 0x05:
+ case 0x06:
+ case 0x07:
+ case 0x08:
+ case '\t':
+ case '\v':
+ case '\f':
+ case '\r':
+ case 0x0E:
+ case 0x0F:
+ case 0x10:
+ case 0x11:
+ case 0x12:
+ case 0x13:
+ case 0x14:
+ case 0x15:
+ case 0x16:
+ case 0x17:
+ case 0x18:
+ case 0x19:
+ case 0x1A:
+ case 0x1B:
+ case 0x1C:
+ case 0x1D:
+ case 0x1E:
+ case 0x1F:
+ case ' ':
+ case '!':
+ case '"':
+ case '#':
+ case '$':
+ case '%':
+ case '&':
+ case '\'':
+ case '(':
+ case ')':
+ case '*':
+ case '+':
+ case ',':
+ case '-':
+ case '.':
+ case '/':
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
+ case ':':
+ case ';':
+ case '<':
+ case '=':
+ case '>':
+ case '?':
+ case '@':
+ case 'A':
+ case 'B':
+ case 'C':
+ case 'D':
+ case 'E':
+ case 'F':
+ case 'G':
+ case 'H':
+ case 'I':
+ case 'J':
+ case 'K':
+ case 'L':
+ case 'M':
+ case 'N':
+ case 'O':
+ case 'P':
+ case 'Q':
+ case 'R':
+ case 'S':
+ case 'T':
+ case 'U':
+ case 'V':
+ case 'W':
+ case 'X':
case 'Y':
case 'Z':
case '[':
+ case '\\':
+ case ']':
+ case '^':
case '_':
+ case '`':
case 'a':
case 'b':
case 'c':
@@ -14779,6 +16380,13 @@ yy499:
case 'x':
case 'y':
case 'z':
+ case '{':
+ case '|':
+ case '}':
+ case '~':
+ case 0x7F: goto yy538;
+ case 0x04:
+ case '\n': goto yy579;
case 0xC2:
case 0xC3:
case 0xC4:
@@ -14808,8 +16416,8 @@ yy499:
case 0xDC:
case 0xDD:
case 0xDE:
- case 0xDF:
- case 0xE0:
+ case 0xDF: goto yy581;
+ case 0xE0: goto yy582;
case 0xE1:
case 0xE2:
case 0xE3:
@@ -14824,26 +16432,74 @@ yy499:
case 0xEC:
case 0xED:
case 0xEE:
- case 0xEF:
- case 0xF0:
+ case 0xEF: goto yy583;
+ case 0xF0: goto yy584;
case 0xF1:
case 0xF2:
- case 0xF3:
- case 0xF4: goto yy15;
- default: goto yy500;
+ case 0xF3: goto yy585;
+ case 0xF4: goto yy586;
+ default: goto yy88;
}
-yy500:
- YYDEBUG(500, YYPEEK ());
-#line 326 "../ada.re2c"
- {*id = 56; continue;}
-#line 14840 "../ada_re2c.c"
-yy501:
- YYDEBUG(501, YYPEEK ());
- yyaccept = 67;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy540:
+ YYDEBUG(540, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
+ case ']': goto yy327;
+ default: goto yy88;
+ }
+yy541:
+ YYDEBUG(541, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ YYDEBUG(542, YYPEEK());
+ switch (yych) {
+ case 0x00:
+ case 0x01:
+ case 0x02:
+ case 0x03:
+ case 0x05:
+ case 0x06:
+ case 0x07:
+ case 0x08:
+ case '\t':
+ case '\v':
+ case '\f':
+ case '\r':
+ case 0x0E:
+ case 0x0F:
+ case 0x10:
+ case 0x11:
+ case 0x12:
+ case 0x13:
+ case 0x14:
+ case 0x15:
+ case 0x16:
+ case 0x17:
+ case 0x18:
+ case 0x19:
+ case 0x1A:
+ case 0x1B:
+ case 0x1C:
+ case 0x1D:
+ case 0x1E:
+ case 0x1F:
+ case ' ':
+ case '!':
+ case '"':
+ case '#':
+ case '$':
+ case '%':
+ case '&':
+ case '\'':
+ case '(':
+ case ')':
+ case '*':
+ case '+':
+ case ',':
+ case '-':
+ case '.':
+ case '/':
case '0':
case '1':
case '2':
@@ -14854,6 +16510,13 @@ yy501:
case '7':
case '8':
case '9':
+ case ':':
+ case ';':
+ case '<':
+ case '=':
+ case '>':
+ case '?':
+ case '@':
case 'A':
case 'B':
case 'C':
@@ -14881,7 +16544,11 @@ yy501:
case 'Y':
case 'Z':
case '[':
+ case '\\':
+ case ']':
+ case '^':
case '_':
+ case '`':
case 'a':
case 'b':
case 'c':
@@ -14908,9 +16575,16 @@ yy501:
case 'x':
case 'y':
case 'z':
- case 0xC2:
- case 0xC3:
- case 0xC4:
+ case '{':
+ case '|':
+ case '}':
+ case '~':
+ case 0x7F: goto yy541;
+ case 0x04:
+ case '\n': goto yy587;
+ case 0xC2:
+ case 0xC3:
+ case 0xC4:
case 0xC5:
case 0xC6:
case 0xC7:
@@ -14937,8 +16611,8 @@ yy501:
case 0xDC:
case 0xDD:
case 0xDE:
- case 0xDF:
- case 0xE0:
+ case 0xDF: goto yy589;
+ case 0xE0: goto yy590;
case 0xE1:
case 0xE2:
case 0xE3:
@@ -14953,25 +16627,3164 @@ yy501:
case 0xEC:
case 0xED:
case 0xEE:
- case 0xEF:
- case 0xF0:
+ case 0xEF: goto yy591;
+ case 0xF0: goto yy592;
case 0xF1:
case 0xF2:
- case 0xF3:
- case 0xF4: goto yy15;
- default: goto yy502;
+ case 0xF3: goto yy593;
+ case 0xF4: goto yy594;
+ default: goto yy88;
+ }
+yy543:
+ YYDEBUG(543, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ YYDEBUG(544, YYPEEK());
+ switch (yych) {
+ case 0x00:
+ case 0x01:
+ case 0x02:
+ case 0x03:
+ case 0x05:
+ case 0x06:
+ case 0x07:
+ case 0x08:
+ case '\t':
+ case '\v':
+ case '\f':
+ case '\r':
+ case 0x0E:
+ case 0x0F:
+ case 0x10:
+ case 0x11:
+ case 0x12:
+ case 0x13:
+ case 0x14:
+ case 0x15:
+ case 0x16:
+ case 0x17:
+ case 0x18:
+ case 0x19:
+ case 0x1A:
+ case 0x1B:
+ case 0x1C:
+ case 0x1D:
+ case 0x1E:
+ case 0x1F:
+ case ' ':
+ case '!':
+ case '"':
+ case '#':
+ case '$':
+ case '%':
+ case '&':
+ case '\'':
+ case '(':
+ case ')':
+ case '*':
+ case '+':
+ case ',':
+ case '-':
+ case '.':
+ case '/':
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
+ case ':':
+ case ';':
+ case '<':
+ case '=':
+ case '>':
+ case '?':
+ case '@':
+ case 'A':
+ case 'B':
+ case 'C':
+ case 'D':
+ case 'E':
+ case 'F':
+ case 'G':
+ case 'H':
+ case 'I':
+ case 'J':
+ case 'K':
+ case 'L':
+ case 'M':
+ case 'N':
+ case 'O':
+ case 'P':
+ case 'Q':
+ case 'R':
+ case 'S':
+ case 'T':
+ case 'U':
+ case 'V':
+ case 'W':
+ case 'X':
+ case 'Y':
+ case 'Z':
+ case '[':
+ case '\\':
+ case ']':
+ case '^':
+ case '_':
+ case '`':
+ case 'a':
+ case 'b':
+ case 'c':
+ case 'd':
+ case 'e':
+ case 'f':
+ case 'g':
+ case 'h':
+ case 'i':
+ case 'j':
+ case 'k':
+ case 'l':
+ case 'm':
+ case 'n':
+ case 'o':
+ case 'p':
+ case 'q':
+ case 'r':
+ case 's':
+ case 't':
+ case 'u':
+ case 'v':
+ case 'w':
+ case 'x':
+ case 'y':
+ case 'z':
+ case '{':
+ case '|':
+ case '}':
+ case '~':
+ case 0x7F: goto yy543;
+ case 0x04:
+ case '\n': goto yy595;
+ case 0xC2:
+ case 0xC3:
+ case 0xC4:
+ case 0xC5:
+ case 0xC6:
+ case 0xC7:
+ case 0xC8:
+ case 0xC9:
+ case 0xCA:
+ case 0xCB:
+ case 0xCC:
+ case 0xCD:
+ case 0xCE:
+ case 0xCF:
+ case 0xD0:
+ case 0xD1:
+ case 0xD2:
+ case 0xD3:
+ case 0xD4:
+ case 0xD5:
+ case 0xD6:
+ case 0xD7:
+ case 0xD8:
+ case 0xD9:
+ case 0xDA:
+ case 0xDB:
+ case 0xDC:
+ case 0xDD:
+ case 0xDE:
+ case 0xDF: goto yy597;
+ case 0xE0: goto yy598;
+ case 0xE1:
+ case 0xE2:
+ case 0xE3:
+ case 0xE4:
+ case 0xE5:
+ case 0xE6:
+ case 0xE7:
+ case 0xE8:
+ case 0xE9:
+ case 0xEA:
+ case 0xEB:
+ case 0xEC:
+ case 0xED:
+ case 0xEE:
+ case 0xEF: goto yy599;
+ case 0xF0: goto yy600;
+ case 0xF1:
+ case 0xF2:
+ case 0xF3: goto yy601;
+ case 0xF4: goto yy602;
+ default: goto yy88;
+ }
+yy545:
+ YYDEBUG(545, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ YYDEBUG(546, YYPEEK());
+ switch (yych) {
+ case 0x00:
+ case 0x01:
+ case 0x02:
+ case 0x03:
+ case 0x05:
+ case 0x06:
+ case 0x07:
+ case 0x08:
+ case '\t':
+ case '\v':
+ case '\f':
+ case '\r':
+ case 0x0E:
+ case 0x0F:
+ case 0x10:
+ case 0x11:
+ case 0x12:
+ case 0x13:
+ case 0x14:
+ case 0x15:
+ case 0x16:
+ case 0x17:
+ case 0x18:
+ case 0x19:
+ case 0x1A:
+ case 0x1B:
+ case 0x1C:
+ case 0x1D:
+ case 0x1E:
+ case 0x1F:
+ case ' ':
+ case '!':
+ case '"':
+ case '#':
+ case '$':
+ case '%':
+ case '&':
+ case '\'':
+ case '(':
+ case ')':
+ case '*':
+ case '+':
+ case ',':
+ case '-':
+ case '.':
+ case '/':
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
+ case ':':
+ case ';':
+ case '<':
+ case '=':
+ case '>':
+ case '?':
+ case '@':
+ case 'A':
+ case 'B':
+ case 'C':
+ case 'D':
+ case 'E':
+ case 'F':
+ case 'G':
+ case 'H':
+ case 'I':
+ case 'J':
+ case 'K':
+ case 'L':
+ case 'M':
+ case 'N':
+ case 'O':
+ case 'P':
+ case 'Q':
+ case 'R':
+ case 'S':
+ case 'T':
+ case 'U':
+ case 'V':
+ case 'W':
+ case 'X':
+ case 'Y':
+ case 'Z':
+ case '[':
+ case '\\':
+ case ']':
+ case '^':
+ case '_':
+ case '`':
+ case 'a':
+ case 'b':
+ case 'c':
+ case 'd':
+ case 'e':
+ case 'f':
+ case 'g':
+ case 'h':
+ case 'i':
+ case 'j':
+ case 'k':
+ case 'l':
+ case 'm':
+ case 'n':
+ case 'o':
+ case 'p':
+ case 'q':
+ case 'r':
+ case 's':
+ case 't':
+ case 'u':
+ case 'v':
+ case 'w':
+ case 'x':
+ case 'y':
+ case 'z':
+ case '{':
+ case '|':
+ case '}':
+ case '~':
+ case 0x7F: goto yy545;
+ case 0x04:
+ case '\n': goto yy603;
+ case 0xC2:
+ case 0xC3:
+ case 0xC4:
+ case 0xC5:
+ case 0xC6:
+ case 0xC7:
+ case 0xC8:
+ case 0xC9:
+ case 0xCA:
+ case 0xCB:
+ case 0xCC:
+ case 0xCD:
+ case 0xCE:
+ case 0xCF:
+ case 0xD0:
+ case 0xD1:
+ case 0xD2:
+ case 0xD3:
+ case 0xD4:
+ case 0xD5:
+ case 0xD6:
+ case 0xD7:
+ case 0xD8:
+ case 0xD9:
+ case 0xDA:
+ case 0xDB:
+ case 0xDC:
+ case 0xDD:
+ case 0xDE:
+ case 0xDF: goto yy605;
+ case 0xE0: goto yy606;
+ case 0xE1:
+ case 0xE2:
+ case 0xE3:
+ case 0xE4:
+ case 0xE5:
+ case 0xE6:
+ case 0xE7:
+ case 0xE8:
+ case 0xE9:
+ case 0xEA:
+ case 0xEB:
+ case 0xEC:
+ case 0xED:
+ case 0xEE:
+ case 0xEF: goto yy607;
+ case 0xF0: goto yy608;
+ case 0xF1:
+ case 0xF2:
+ case 0xF3: goto yy609;
+ case 0xF4: goto yy610;
+ default: goto yy88;
+ }
+yy547:
+ YYDEBUG(547, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'T':
+ case 't': goto yy611;
+ default: goto yy15;
+ }
+yy548:
+ YYDEBUG(548, YYPEEK());
+ yyaccept = 64;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
+ case 'A':
+ case 'B':
+ case 'C':
+ case 'D':
+ case 'E':
+ case 'F':
+ case 'G':
+ case 'H':
+ case 'I':
+ case 'J':
+ case 'K':
+ case 'L':
+ case 'M':
+ case 'N':
+ case 'O':
+ case 'P':
+ case 'Q':
+ case 'R':
+ case 'S':
+ case 'T':
+ case 'U':
+ case 'V':
+ case 'W':
+ case 'X':
+ case 'Y':
+ case 'Z':
+ case '[':
+ case '_':
+ case 'a':
+ case 'b':
+ case 'c':
+ case 'd':
+ case 'e':
+ case 'f':
+ case 'g':
+ case 'h':
+ case 'i':
+ case 'j':
+ case 'k':
+ case 'l':
+ case 'm':
+ case 'n':
+ case 'o':
+ case 'p':
+ case 'q':
+ case 'r':
+ case 's':
+ case 't':
+ case 'u':
+ case 'v':
+ case 'w':
+ case 'x':
+ case 'y':
+ case 'z':
+ case 0xC2:
+ case 0xC3:
+ case 0xC4:
+ case 0xC5:
+ case 0xC6:
+ case 0xC7:
+ case 0xC8:
+ case 0xC9:
+ case 0xCA:
+ case 0xCB:
+ case 0xCC:
+ case 0xCD:
+ case 0xCE:
+ case 0xCF:
+ case 0xD0:
+ case 0xD1:
+ case 0xD2:
+ case 0xD3:
+ case 0xD4:
+ case 0xD5:
+ case 0xD6:
+ case 0xD7:
+ case 0xD8:
+ case 0xD9:
+ case 0xDA:
+ case 0xDB:
+ case 0xDC:
+ case 0xDD:
+ case 0xDE:
+ case 0xDF:
+ case 0xE0:
+ case 0xE1:
+ case 0xE2:
+ case 0xE3:
+ case 0xE4:
+ case 0xE5:
+ case 0xE6:
+ case 0xE7:
+ case 0xE8:
+ case 0xE9:
+ case 0xEA:
+ case 0xEB:
+ case 0xEC:
+ case 0xED:
+ case 0xEE:
+ case 0xEF:
+ case 0xF0:
+ case 0xF1:
+ case 0xF2:
+ case 0xF3:
+ case 0xF4: goto yy15;
+ default: goto yy549;
+ }
+yy549:
+ YYDEBUG(549, YYPEEK());
+#line 373 "ada_annex_p.re2c"
+ {*id = 80; continue;}
+#line 17152 "ada_annex_p_re2c.c"
+yy550:
+ YYDEBUG(550, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'T':
+ case 't': goto yy613;
+ default: goto yy15;
+ }
+yy551:
+ YYDEBUG(551, YYPEEK());
+ yyaccept = 65;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
+ case 'A':
+ case 'B':
+ case 'C':
+ case 'D':
+ case 'E':
+ case 'F':
+ case 'G':
+ case 'H':
+ case 'I':
+ case 'J':
+ case 'K':
+ case 'L':
+ case 'M':
+ case 'N':
+ case 'O':
+ case 'P':
+ case 'Q':
+ case 'R':
+ case 'S':
+ case 'T':
+ case 'U':
+ case 'V':
+ case 'W':
+ case 'X':
+ case 'Y':
+ case 'Z':
+ case '[':
+ case '_':
+ case 'a':
+ case 'b':
+ case 'c':
+ case 'd':
+ case 'e':
+ case 'f':
+ case 'g':
+ case 'h':
+ case 'i':
+ case 'j':
+ case 'k':
+ case 'l':
+ case 'm':
+ case 'n':
+ case 'o':
+ case 'p':
+ case 'q':
+ case 'r':
+ case 's':
+ case 't':
+ case 'u':
+ case 'v':
+ case 'w':
+ case 'x':
+ case 'y':
+ case 'z':
+ case 0xC2:
+ case 0xC3:
+ case 0xC4:
+ case 0xC5:
+ case 0xC6:
+ case 0xC7:
+ case 0xC8:
+ case 0xC9:
+ case 0xCA:
+ case 0xCB:
+ case 0xCC:
+ case 0xCD:
+ case 0xCE:
+ case 0xCF:
+ case 0xD0:
+ case 0xD1:
+ case 0xD2:
+ case 0xD3:
+ case 0xD4:
+ case 0xD5:
+ case 0xD6:
+ case 0xD7:
+ case 0xD8:
+ case 0xD9:
+ case 0xDA:
+ case 0xDB:
+ case 0xDC:
+ case 0xDD:
+ case 0xDE:
+ case 0xDF:
+ case 0xE0:
+ case 0xE1:
+ case 0xE2:
+ case 0xE3:
+ case 0xE4:
+ case 0xE5:
+ case 0xE6:
+ case 0xE7:
+ case 0xE8:
+ case 0xE9:
+ case 0xEA:
+ case 0xEB:
+ case 0xEC:
+ case 0xED:
+ case 0xEE:
+ case 0xEF:
+ case 0xF0:
+ case 0xF1:
+ case 0xF2:
+ case 0xF3:
+ case 0xF4: goto yy15;
+ default: goto yy552;
+ }
+yy552:
+ YYDEBUG(552, YYPEEK());
+#line 332 "ada_annex_p.re2c"
+ {*id = 39; continue;}
+#line 17292 "ada_annex_p_re2c.c"
+yy553:
+ YYDEBUG(553, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'O':
+ case 'o': goto yy615;
+ default: goto yy15;
+ }
+yy554:
+ YYDEBUG(554, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'N':
+ case 'n': goto yy616;
+ default: goto yy15;
+ }
+yy555:
+ YYDEBUG(555, YYPEEK());
+ yyaccept = 66;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
+ case 'A':
+ case 'B':
+ case 'C':
+ case 'D':
+ case 'E':
+ case 'F':
+ case 'G':
+ case 'H':
+ case 'I':
+ case 'J':
+ case 'K':
+ case 'L':
+ case 'M':
+ case 'N':
+ case 'O':
+ case 'P':
+ case 'Q':
+ case 'R':
+ case 'S':
+ case 'T':
+ case 'U':
+ case 'V':
+ case 'W':
+ case 'X':
+ case 'Y':
+ case 'Z':
+ case '[':
+ case '_':
+ case 'a':
+ case 'b':
+ case 'c':
+ case 'd':
+ case 'e':
+ case 'f':
+ case 'g':
+ case 'h':
+ case 'i':
+ case 'j':
+ case 'k':
+ case 'l':
+ case 'm':
+ case 'n':
+ case 'o':
+ case 'p':
+ case 'q':
+ case 'r':
+ case 's':
+ case 't':
+ case 'u':
+ case 'v':
+ case 'w':
+ case 'x':
+ case 'y':
+ case 'z':
+ case 0xC2:
+ case 0xC3:
+ case 0xC4:
+ case 0xC5:
+ case 0xC6:
+ case 0xC7:
+ case 0xC8:
+ case 0xC9:
+ case 0xCA:
+ case 0xCB:
+ case 0xCC:
+ case 0xCD:
+ case 0xCE:
+ case 0xCF:
+ case 0xD0:
+ case 0xD1:
+ case 0xD2:
+ case 0xD3:
+ case 0xD4:
+ case 0xD5:
+ case 0xD6:
+ case 0xD7:
+ case 0xD8:
+ case 0xD9:
+ case 0xDA:
+ case 0xDB:
+ case 0xDC:
+ case 0xDD:
+ case 0xDE:
+ case 0xDF:
+ case 0xE0:
+ case 0xE1:
+ case 0xE2:
+ case 0xE3:
+ case 0xE4:
+ case 0xE5:
+ case 0xE6:
+ case 0xE7:
+ case 0xE8:
+ case 0xE9:
+ case 0xEA:
+ case 0xEB:
+ case 0xEC:
+ case 0xED:
+ case 0xEE:
+ case 0xEF:
+ case 0xF0:
+ case 0xF1:
+ case 0xF2:
+ case 0xF3:
+ case 0xF4: goto yy15;
+ default: goto yy556;
+ }
+yy556:
+ YYDEBUG(556, YYPEEK());
+#line 315 "ada_annex_p.re2c"
+ {*id = 22; continue;}
+#line 17443 "ada_annex_p_re2c.c"
+yy557:
+ YYDEBUG(557, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'C':
+ case 'c': goto yy618;
+ default: goto yy15;
+ }
+yy558:
+ YYDEBUG(558, YYPEEK());
+ yyaccept = 67;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
+ case 'A':
+ case 'B':
+ case 'C':
+ case 'D':
+ case 'E':
+ case 'F':
+ case 'G':
+ case 'H':
+ case 'I':
+ case 'J':
+ case 'K':
+ case 'L':
+ case 'M':
+ case 'N':
+ case 'O':
+ case 'P':
+ case 'Q':
+ case 'R':
+ case 'S':
+ case 'T':
+ case 'U':
+ case 'V':
+ case 'W':
+ case 'X':
+ case 'Y':
+ case 'Z':
+ case '[':
+ case '_':
+ case 'a':
+ case 'b':
+ case 'c':
+ case 'd':
+ case 'e':
+ case 'f':
+ case 'g':
+ case 'h':
+ case 'i':
+ case 'j':
+ case 'k':
+ case 'l':
+ case 'm':
+ case 'n':
+ case 'o':
+ case 'p':
+ case 'q':
+ case 'r':
+ case 's':
+ case 't':
+ case 'u':
+ case 'v':
+ case 'w':
+ case 'x':
+ case 'y':
+ case 'z':
+ case 0xC2:
+ case 0xC3:
+ case 0xC4:
+ case 0xC5:
+ case 0xC6:
+ case 0xC7:
+ case 0xC8:
+ case 0xC9:
+ case 0xCA:
+ case 0xCB:
+ case 0xCC:
+ case 0xCD:
+ case 0xCE:
+ case 0xCF:
+ case 0xD0:
+ case 0xD1:
+ case 0xD2:
+ case 0xD3:
+ case 0xD4:
+ case 0xD5:
+ case 0xD6:
+ case 0xD7:
+ case 0xD8:
+ case 0xD9:
+ case 0xDA:
+ case 0xDB:
+ case 0xDC:
+ case 0xDD:
+ case 0xDE:
+ case 0xDF:
+ case 0xE0:
+ case 0xE1:
+ case 0xE2:
+ case 0xE3:
+ case 0xE4:
+ case 0xE5:
+ case 0xE6:
+ case 0xE7:
+ case 0xE8:
+ case 0xE9:
+ case 0xEA:
+ case 0xEB:
+ case 0xEC:
+ case 0xED:
+ case 0xEE:
+ case 0xEF:
+ case 0xF0:
+ case 0xF1:
+ case 0xF2:
+ case 0xF3:
+ case 0xF4: goto yy15;
+ default: goto yy559;
+ }
+yy559:
+ YYDEBUG(559, YYPEEK());
+#line 370 "ada_annex_p.re2c"
+ {*id = 77; continue;}
+#line 17583 "ada_annex_p_re2c.c"
+yy560:
+ YYDEBUG(560, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'I':
+ case 'i': goto yy619;
+ default: goto yy15;
+ }
+yy561:
+ YYDEBUG(561, YYPEEK());
+ yyaccept = 68;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
+ case 'A':
+ case 'B':
+ case 'C':
+ case 'D':
+ case 'E':
+ case 'F':
+ case 'G':
+ case 'H':
+ case 'I':
+ case 'J':
+ case 'K':
+ case 'L':
+ case 'M':
+ case 'N':
+ case 'O':
+ case 'P':
+ case 'Q':
+ case 'R':
+ case 'S':
+ case 'T':
+ case 'U':
+ case 'V':
+ case 'W':
+ case 'X':
+ case 'Y':
+ case 'Z':
+ case '[':
+ case '_':
+ case 'a':
+ case 'b':
+ case 'c':
+ case 'd':
+ case 'e':
+ case 'f':
+ case 'g':
+ case 'h':
+ case 'i':
+ case 'j':
+ case 'k':
+ case 'l':
+ case 'm':
+ case 'n':
+ case 'o':
+ case 'p':
+ case 'q':
+ case 'r':
+ case 's':
+ case 't':
+ case 'u':
+ case 'v':
+ case 'w':
+ case 'x':
+ case 'y':
+ case 'z':
+ case 0xC2:
+ case 0xC3:
+ case 0xC4:
+ case 0xC5:
+ case 0xC6:
+ case 0xC7:
+ case 0xC8:
+ case 0xC9:
+ case 0xCA:
+ case 0xCB:
+ case 0xCC:
+ case 0xCD:
+ case 0xCE:
+ case 0xCF:
+ case 0xD0:
+ case 0xD1:
+ case 0xD2:
+ case 0xD3:
+ case 0xD4:
+ case 0xD5:
+ case 0xD6:
+ case 0xD7:
+ case 0xD8:
+ case 0xD9:
+ case 0xDA:
+ case 0xDB:
+ case 0xDC:
+ case 0xDD:
+ case 0xDE:
+ case 0xDF:
+ case 0xE0:
+ case 0xE1:
+ case 0xE2:
+ case 0xE3:
+ case 0xE4:
+ case 0xE5:
+ case 0xE6:
+ case 0xE7:
+ case 0xE8:
+ case 0xE9:
+ case 0xEA:
+ case 0xEB:
+ case 0xEC:
+ case 0xED:
+ case 0xEE:
+ case 0xEF:
+ case 0xF0:
+ case 0xF1:
+ case 0xF2:
+ case 0xF3:
+ case 0xF4: goto yy15;
+ default: goto yy562;
+ }
+yy562:
+ YYDEBUG(562, YYPEEK());
+#line 321 "ada_annex_p.re2c"
+ {*id = 28; continue;}
+#line 17723 "ada_annex_p_re2c.c"
+yy563:
+ YYDEBUG(563, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'L':
+ case 'l': goto yy620;
+ default: goto yy15;
+ }
+yy564:
+ YYDEBUG(564, YYPEEK());
+ yyaccept = 69;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
+ case 'A':
+ case 'B':
+ case 'C':
+ case 'D':
+ case 'E':
+ case 'F':
+ case 'G':
+ case 'H':
+ case 'I':
+ case 'J':
+ case 'K':
+ case 'L':
+ case 'M':
+ case 'N':
+ case 'O':
+ case 'P':
+ case 'Q':
+ case 'R':
+ case 'S':
+ case 'T':
+ case 'U':
+ case 'V':
+ case 'W':
+ case 'X':
+ case 'Y':
+ case 'Z':
+ case '[':
+ case '_':
+ case 'a':
+ case 'b':
+ case 'c':
+ case 'd':
+ case 'e':
+ case 'f':
+ case 'g':
+ case 'h':
+ case 'i':
+ case 'j':
+ case 'k':
+ case 'l':
+ case 'm':
+ case 'n':
+ case 'o':
+ case 'p':
+ case 'q':
+ case 'r':
+ case 's':
+ case 't':
+ case 'u':
+ case 'v':
+ case 'w':
+ case 'x':
+ case 'y':
+ case 'z':
+ case 0xC2:
+ case 0xC3:
+ case 0xC4:
+ case 0xC5:
+ case 0xC6:
+ case 0xC7:
+ case 0xC8:
+ case 0xC9:
+ case 0xCA:
+ case 0xCB:
+ case 0xCC:
+ case 0xCD:
+ case 0xCE:
+ case 0xCF:
+ case 0xD0:
+ case 0xD1:
+ case 0xD2:
+ case 0xD3:
+ case 0xD4:
+ case 0xD5:
+ case 0xD6:
+ case 0xD7:
+ case 0xD8:
+ case 0xD9:
+ case 0xDA:
+ case 0xDB:
+ case 0xDC:
+ case 0xDD:
+ case 0xDE:
+ case 0xDF:
+ case 0xE0:
+ case 0xE1:
+ case 0xE2:
+ case 0xE3:
+ case 0xE4:
+ case 0xE5:
+ case 0xE6:
+ case 0xE7:
+ case 0xE8:
+ case 0xE9:
+ case 0xEA:
+ case 0xEB:
+ case 0xEC:
+ case 0xED:
+ case 0xEE:
+ case 0xEF:
+ case 0xF0:
+ case 0xF1:
+ case 0xF2:
+ case 0xF3:
+ case 0xF4: goto yy15;
+ default: goto yy565;
+ }
+yy565:
+ YYDEBUG(565, YYPEEK());
+#line 320 "ada_annex_p.re2c"
+ {*id = 27; continue;}
+#line 17863 "ada_annex_p_re2c.c"
+yy566:
+ YYDEBUG(566, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'R':
+ case 'r': goto yy622;
+ default: goto yy15;
+ }
+yy567:
+ YYDEBUG(567, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'E':
+ case 'e': goto yy623;
+ default: goto yy15;
+ }
+yy568:
+ YYDEBUG(568, YYPEEK());
+ yyaccept = 70;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
+ case 'A':
+ case 'B':
+ case 'C':
+ case 'D':
+ case 'E':
+ case 'F':
+ case 'G':
+ case 'H':
+ case 'I':
+ case 'J':
+ case 'K':
+ case 'L':
+ case 'M':
+ case 'N':
+ case 'O':
+ case 'P':
+ case 'Q':
+ case 'R':
+ case 'S':
+ case 'T':
+ case 'U':
+ case 'V':
+ case 'W':
+ case 'X':
+ case 'Y':
+ case 'Z':
+ case '[':
+ case '_':
+ case 'a':
+ case 'b':
+ case 'c':
+ case 'd':
+ case 'e':
+ case 'f':
+ case 'g':
+ case 'h':
+ case 'i':
+ case 'j':
+ case 'k':
+ case 'l':
+ case 'm':
+ case 'n':
+ case 'o':
+ case 'p':
+ case 'q':
+ case 'r':
+ case 's':
+ case 't':
+ case 'u':
+ case 'v':
+ case 'w':
+ case 'x':
+ case 'y':
+ case 'z':
+ case 0xC2:
+ case 0xC3:
+ case 0xC4:
+ case 0xC5:
+ case 0xC6:
+ case 0xC7:
+ case 0xC8:
+ case 0xC9:
+ case 0xCA:
+ case 0xCB:
+ case 0xCC:
+ case 0xCD:
+ case 0xCE:
+ case 0xCF:
+ case 0xD0:
+ case 0xD1:
+ case 0xD2:
+ case 0xD3:
+ case 0xD4:
+ case 0xD5:
+ case 0xD6:
+ case 0xD7:
+ case 0xD8:
+ case 0xD9:
+ case 0xDA:
+ case 0xDB:
+ case 0xDC:
+ case 0xDD:
+ case 0xDE:
+ case 0xDF:
+ case 0xE0:
+ case 0xE1:
+ case 0xE2:
+ case 0xE3:
+ case 0xE4:
+ case 0xE5:
+ case 0xE6:
+ case 0xE7:
+ case 0xE8:
+ case 0xE9:
+ case 0xEA:
+ case 0xEB:
+ case 0xEC:
+ case 0xED:
+ case 0xEE:
+ case 0xEF:
+ case 0xF0:
+ case 0xF1:
+ case 0xF2:
+ case 0xF3:
+ case 0xF4: goto yy15;
+ default: goto yy569;
+ }
+yy569:
+ YYDEBUG(569, YYPEEK());
+#line 317 "ada_annex_p.re2c"
+ {*id = 24; continue;}
+#line 18014 "ada_annex_p_re2c.c"
+yy570:
+ YYDEBUG(570, YYPEEK());
+ yyaccept = 71;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
+ case 'A':
+ case 'B':
+ case 'C':
+ case 'D':
+ case 'E':
+ case 'F':
+ case 'G':
+ case 'H':
+ case 'I':
+ case 'J':
+ case 'K':
+ case 'L':
+ case 'M':
+ case 'N':
+ case 'O':
+ case 'P':
+ case 'Q':
+ case 'R':
+ case 'S':
+ case 'T':
+ case 'U':
+ case 'V':
+ case 'W':
+ case 'X':
+ case 'Y':
+ case 'Z':
+ case '[':
+ case '_':
+ case 'a':
+ case 'b':
+ case 'c':
+ case 'd':
+ case 'e':
+ case 'f':
+ case 'g':
+ case 'h':
+ case 'i':
+ case 'j':
+ case 'k':
+ case 'l':
+ case 'm':
+ case 'n':
+ case 'o':
+ case 'p':
+ case 'q':
+ case 'r':
+ case 's':
+ case 't':
+ case 'u':
+ case 'v':
+ case 'w':
+ case 'x':
+ case 'y':
+ case 'z':
+ case 0xC2:
+ case 0xC3:
+ case 0xC4:
+ case 0xC5:
+ case 0xC6:
+ case 0xC7:
+ case 0xC8:
+ case 0xC9:
+ case 0xCA:
+ case 0xCB:
+ case 0xCC:
+ case 0xCD:
+ case 0xCE:
+ case 0xCF:
+ case 0xD0:
+ case 0xD1:
+ case 0xD2:
+ case 0xD3:
+ case 0xD4:
+ case 0xD5:
+ case 0xD6:
+ case 0xD7:
+ case 0xD8:
+ case 0xD9:
+ case 0xDA:
+ case 0xDB:
+ case 0xDC:
+ case 0xDD:
+ case 0xDE:
+ case 0xDF:
+ case 0xE0:
+ case 0xE1:
+ case 0xE2:
+ case 0xE3:
+ case 0xE4:
+ case 0xE5:
+ case 0xE6:
+ case 0xE7:
+ case 0xE8:
+ case 0xE9:
+ case 0xEA:
+ case 0xEB:
+ case 0xEC:
+ case 0xED:
+ case 0xEE:
+ case 0xEF:
+ case 0xF0:
+ case 0xF1:
+ case 0xF2:
+ case 0xF3:
+ case 0xF4: goto yy15;
+ default: goto yy571;
+ }
+yy571:
+ YYDEBUG(571, YYPEEK());
+#line 312 "ada_annex_p.re2c"
+ {*id = 19; continue;}
+#line 18143 "ada_annex_p_re2c.c"
+yy572:
+ YYDEBUG(572, YYPEEK());
+ yyaccept = 72;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
+ case 'A':
+ case 'B':
+ case 'C':
+ case 'D':
+ case 'E':
+ case 'F':
+ case 'G':
+ case 'H':
+ case 'I':
+ case 'J':
+ case 'K':
+ case 'L':
+ case 'M':
+ case 'N':
+ case 'O':
+ case 'P':
+ case 'Q':
+ case 'R':
+ case 'S':
+ case 'T':
+ case 'U':
+ case 'V':
+ case 'W':
+ case 'X':
+ case 'Y':
+ case 'Z':
+ case '[':
+ case '_':
+ case 'a':
+ case 'b':
+ case 'c':
+ case 'd':
+ case 'e':
+ case 'f':
+ case 'g':
+ case 'h':
+ case 'i':
+ case 'j':
+ case 'k':
+ case 'l':
+ case 'm':
+ case 'n':
+ case 'o':
+ case 'p':
+ case 'q':
+ case 'r':
+ case 's':
+ case 't':
+ case 'u':
+ case 'v':
+ case 'w':
+ case 'x':
+ case 'y':
+ case 'z':
+ case 0xC2:
+ case 0xC3:
+ case 0xC4:
+ case 0xC5:
+ case 0xC6:
+ case 0xC7:
+ case 0xC8:
+ case 0xC9:
+ case 0xCA:
+ case 0xCB:
+ case 0xCC:
+ case 0xCD:
+ case 0xCE:
+ case 0xCF:
+ case 0xD0:
+ case 0xD1:
+ case 0xD2:
+ case 0xD3:
+ case 0xD4:
+ case 0xD5:
+ case 0xD6:
+ case 0xD7:
+ case 0xD8:
+ case 0xD9:
+ case 0xDA:
+ case 0xDB:
+ case 0xDC:
+ case 0xDD:
+ case 0xDE:
+ case 0xDF:
+ case 0xE0:
+ case 0xE1:
+ case 0xE2:
+ case 0xE3:
+ case 0xE4:
+ case 0xE5:
+ case 0xE6:
+ case 0xE7:
+ case 0xE8:
+ case 0xE9:
+ case 0xEA:
+ case 0xEB:
+ case 0xEC:
+ case 0xED:
+ case 0xEE:
+ case 0xEF:
+ case 0xF0:
+ case 0xF1:
+ case 0xF2:
+ case 0xF3:
+ case 0xF4: goto yy15;
+ default: goto yy573;
+ }
+yy573:
+ YYDEBUG(573, YYPEEK());
+#line 327 "ada_annex_p.re2c"
+ {*id = 34; continue;}
+#line 18272 "ada_annex_p_re2c.c"
+yy574:
+ YYDEBUG(574, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'E':
+ case 'e': goto yy624;
+ default: goto yy15;
+ }
+yy575:
+ YYDEBUG(575, YYPEEK());
+ yyaccept = 73;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
+ case 'A':
+ case 'B':
+ case 'C':
+ case 'D':
+ case 'E':
+ case 'F':
+ case 'G':
+ case 'H':
+ case 'I':
+ case 'J':
+ case 'K':
+ case 'L':
+ case 'M':
+ case 'N':
+ case 'O':
+ case 'P':
+ case 'Q':
+ case 'R':
+ case 'S':
+ case 'T':
+ case 'U':
+ case 'V':
+ case 'W':
+ case 'X':
+ case 'Y':
+ case 'Z':
+ case '[':
+ case '_':
+ case 'a':
+ case 'b':
+ case 'c':
+ case 'd':
+ case 'e':
+ case 'f':
+ case 'g':
+ case 'h':
+ case 'i':
+ case 'j':
+ case 'k':
+ case 'l':
+ case 'm':
+ case 'n':
+ case 'o':
+ case 'p':
+ case 'q':
+ case 'r':
+ case 's':
+ case 't':
+ case 'u':
+ case 'v':
+ case 'w':
+ case 'x':
+ case 'y':
+ case 'z':
+ case 0xC2:
+ case 0xC3:
+ case 0xC4:
+ case 0xC5:
+ case 0xC6:
+ case 0xC7:
+ case 0xC8:
+ case 0xC9:
+ case 0xCA:
+ case 0xCB:
+ case 0xCC:
+ case 0xCD:
+ case 0xCE:
+ case 0xCF:
+ case 0xD0:
+ case 0xD1:
+ case 0xD2:
+ case 0xD3:
+ case 0xD4:
+ case 0xD5:
+ case 0xD6:
+ case 0xD7:
+ case 0xD8:
+ case 0xD9:
+ case 0xDA:
+ case 0xDB:
+ case 0xDC:
+ case 0xDD:
+ case 0xDE:
+ case 0xDF:
+ case 0xE0:
+ case 0xE1:
+ case 0xE2:
+ case 0xE3:
+ case 0xE4:
+ case 0xE5:
+ case 0xE6:
+ case 0xE7:
+ case 0xE8:
+ case 0xE9:
+ case 0xEA:
+ case 0xEB:
+ case 0xEC:
+ case 0xED:
+ case 0xEE:
+ case 0xEF:
+ case 0xF0:
+ case 0xF1:
+ case 0xF2:
+ case 0xF3:
+ case 0xF4: goto yy15;
+ default: goto yy576;
+ }
+yy576:
+ YYDEBUG(576, YYPEEK());
+#line 374 "ada_annex_p.re2c"
+ {*id = 81; continue;}
+#line 18412 "ada_annex_p_re2c.c"
+yy577:
+ YYDEBUG(577, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'N':
+ case 'n': goto yy626;
+ default: goto yy15;
+ }
+yy578:
+ YYDEBUG(578, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'T':
+ case 't': goto yy627;
+ default: goto yy15;
+ }
+yy579:
+ YYDEBUG(579, YYPEEK());
+ YYSKIP();
+ YYDEBUG(580, YYPEEK());
+#line 299 "ada_annex_p.re2c"
+ {*id = 6; if (lexer->cursor[-1] == 0x0a || (lexer->cursor[-1] == 0x0d
&& lexer->cursor[-2] == 0x0a)) lexer->line++; continue;}
+#line 18441 "ada_annex_p_re2c.c"
+yy581:
+ YYDEBUG(581, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy538;
+ default: goto yy88;
+ }
+yy582:
+ YYDEBUG(582, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy581;
+ default: goto yy88;
+ }
+yy583:
+ YYDEBUG(583, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy581;
+ default: goto yy88;
+ }
+yy584:
+ YYDEBUG(584, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy583;
+ default: goto yy88;
+ }
+yy585:
+ YYDEBUG(585, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy583;
+ default: goto yy88;
+ }
+yy586:
+ YYDEBUG(586, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F: goto yy583;
+ default: goto yy88;
+ }
+yy587:
+ YYDEBUG(587, YYPEEK());
+ YYSKIP();
+ YYDEBUG(588, YYPEEK());
+#line 300 "ada_annex_p.re2c"
+ {*id = 7; if (lexer->cursor[-1] == 0x0a || (lexer->cursor[-1] == 0x0d
&& lexer->cursor[-2] == 0x0a)) lexer->line++; continue;}
+#line 18778 "ada_annex_p_re2c.c"
+yy589:
+ YYDEBUG(589, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy541;
+ default: goto yy88;
+ }
+yy590:
+ YYDEBUG(590, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy589;
+ default: goto yy88;
+ }
+yy591:
+ YYDEBUG(591, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy589;
+ default: goto yy88;
+ }
+yy592:
+ YYDEBUG(592, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy591;
+ default: goto yy88;
+ }
+yy593:
+ YYDEBUG(593, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy591;
+ default: goto yy88;
+ }
+yy594:
+ YYDEBUG(594, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F: goto yy591;
+ default: goto yy88;
+ }
+yy595:
+ YYDEBUG(595, YYPEEK());
+ YYSKIP();
+ YYDEBUG(596, YYPEEK());
+#line 302 "ada_annex_p.re2c"
+ {*id = 9; if (lexer->cursor[-1] == 0x0a || (lexer->cursor[-1] == 0x0d
&& lexer->cursor[-2] == 0x0a)) lexer->line++; continue;}
+#line 19115 "ada_annex_p_re2c.c"
+yy597:
+ YYDEBUG(597, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy543;
+ default: goto yy88;
+ }
+yy598:
+ YYDEBUG(598, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy597;
+ default: goto yy88;
+ }
+yy599:
+ YYDEBUG(599, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy597;
+ default: goto yy88;
+ }
+yy600:
+ YYDEBUG(600, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy599;
+ default: goto yy88;
+ }
+yy601:
+ YYDEBUG(601, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy599;
+ default: goto yy88;
+ }
+yy602:
+ YYDEBUG(602, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F: goto yy599;
+ default: goto yy88;
+ }
+yy603:
+ YYDEBUG(603, YYPEEK());
+ YYSKIP();
+ YYDEBUG(604, YYPEEK());
+#line 301 "ada_annex_p.re2c"
+ {*id = 8; if (lexer->cursor[-1] == 0x0a || (lexer->cursor[-1] == 0x0d
&& lexer->cursor[-2] == 0x0a)) lexer->line++; continue;}
+#line 19452 "ada_annex_p_re2c.c"
+yy605:
+ YYDEBUG(605, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy545;
+ default: goto yy88;
+ }
+yy606:
+ YYDEBUG(606, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy605;
+ default: goto yy88;
+ }
+yy607:
+ YYDEBUG(607, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy605;
+ default: goto yy88;
+ }
+yy608:
+ YYDEBUG(608, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy607;
+ default: goto yy88;
+ }
+yy609:
+ YYDEBUG(609, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy607;
+ default: goto yy88;
}
-yy502:
- YYDEBUG(502, YYPEEK ());
-#line 327 "../ada.re2c"
- {*id = 57; continue;}
-#line 14969 "../ada_re2c.c"
-yy503:
- YYDEBUG(503, YYPEEK ());
- yyaccept = 68;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy610:
+ YYDEBUG(610, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F: goto yy607;
+ default: goto yy88;
+ }
+yy611:
+ YYDEBUG(611, YYPEEK());
+ yyaccept = 74;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -15088,30 +19901,19 @@ yy503:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy504;
- }
-yy504:
- YYDEBUG(504, YYPEEK ());
-#line 329 "../ada.re2c"
- {*id = 59; continue;}
-#line 15098 "../ada_re2c.c"
-yy505:
- YYDEBUG(505, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
- switch (yych) {
- case 'E':
- case 'e': goto yy521;
- default: goto yy15;
- }
-yy506:
- YYDEBUG(506, YYPEEK ());
- yyaccept = 69;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ default: goto yy612;
+ }
+yy612:
+ YYDEBUG(612, YYPEEK());
+#line 371 "ada_annex_p.re2c"
+ {*id = 78; continue;}
+#line 19911 "ada_annex_p_re2c.c"
+yy613:
+ YYDEBUG(613, YYPEEK());
+ yyaccept = 75;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -15228,41 +20030,30 @@ yy506:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy507;
- }
-yy507:
- YYDEBUG(507, YYPEEK ());
-#line 333 "../ada.re2c"
- {*id = 63; continue;}
-#line 15238 "../ada_re2c.c"
-yy508:
- YYDEBUG(508, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ default: goto yy614;
+ }
+yy614:
+ YYDEBUG(614, YYPEEK());
+#line 372 "ada_annex_p.re2c"
+ {*id = 79; continue;}
+#line 20040 "ada_annex_p_re2c.c"
+yy615:
+ YYDEBUG(615, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'N':
- case 'n': goto yy523;
- default: goto yy15;
- }
-yy509:
- YYDEBUG(509, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
- switch (yych) {
- case 'T':
- case 't': goto yy524;
+ case 'n': goto yy628;
default: goto yy15;
}
-yy510:
- YYDEBUG(510, YYPEEK ());
- yyaccept = 70;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy616:
+ YYDEBUG(616, YYPEEK());
+ yyaccept = 76;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -15379,159 +20170,41 @@ yy510:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy511;
- }
-yy511:
- YYDEBUG(511, YYPEEK ());
-#line 276 "../ada.re2c"
- {*id = 6; continue;}
-#line 15389 "../ada_re2c.c"
-yy512:
- YYDEBUG(512, YYPEEK ());
- yyaccept = 71;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ default: goto yy617;
+ }
+yy617:
+ YYDEBUG(617, YYPEEK());
+#line 346 "ada_annex_p.re2c"
+ {*id = 53; continue;}
+#line 20180 "ada_annex_p_re2c.c"
+yy618:
+ YYDEBUG(618, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
- case '0':
- case '1':
- case '2':
- case '3':
- case '4':
- case '5':
- case '6':
- case '7':
- case '8':
- case '9':
- case 'A':
- case 'B':
- case 'C':
- case 'D':
case 'E':
- case 'F':
- case 'G':
- case 'H':
- case 'I':
- case 'J':
- case 'K':
- case 'L':
- case 'M':
- case 'N':
- case 'O':
- case 'P':
- case 'Q':
- case 'R':
- case 'S':
- case 'T':
- case 'U':
- case 'V':
- case 'W':
- case 'X':
- case 'Y':
- case 'Z':
- case '[':
- case '_':
- case 'a':
- case 'b':
- case 'c':
- case 'd':
- case 'e':
- case 'f':
- case 'g':
- case 'h':
- case 'i':
- case 'j':
- case 'k':
- case 'l':
- case 'm':
- case 'n':
- case 'o':
- case 'p':
- case 'q':
- case 'r':
- case 's':
- case 't':
- case 'u':
- case 'v':
- case 'w':
- case 'x':
- case 'y':
- case 'z':
- case 0xC2:
- case 0xC3:
- case 0xC4:
- case 0xC5:
- case 0xC6:
- case 0xC7:
- case 0xC8:
- case 0xC9:
- case 0xCA:
- case 0xCB:
- case 0xCC:
- case 0xCD:
- case 0xCE:
- case 0xCF:
- case 0xD0:
- case 0xD1:
- case 0xD2:
- case 0xD3:
- case 0xD4:
- case 0xD5:
- case 0xD6:
- case 0xD7:
- case 0xD8:
- case 0xD9:
- case 0xDA:
- case 0xDB:
- case 0xDC:
- case 0xDD:
- case 0xDE:
- case 0xDF:
- case 0xE0:
- case 0xE1:
- case 0xE2:
- case 0xE3:
- case 0xE4:
- case 0xE5:
- case 0xE6:
- case 0xE7:
- case 0xE8:
- case 0xE9:
- case 0xEA:
- case 0xEB:
- case 0xEC:
- case 0xED:
- case 0xEE:
- case 0xEF:
- case 0xF0:
- case 0xF1:
- case 0xF2:
- case 0xF3:
- case 0xF4: goto yy15;
- default: goto yy513;
+ case 'e': goto yy630;
+ default: goto yy15;
}
-yy513:
- YYDEBUG(513, YYPEEK ());
-#line 286 "../ada.re2c"
- {*id = 16; continue;}
-#line 15518 "../ada_re2c.c"
-yy514:
- YYDEBUG(514, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy619:
+ YYDEBUG(619, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'N':
- case 'n': goto yy525;
+ case 'n': goto yy632;
default: goto yy15;
}
-yy515:
- YYDEBUG(515, YYPEEK ());
- yyaccept = 72;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy620:
+ YYDEBUG(620, YYPEEK());
+ yyaccept = 77;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -15648,63 +20321,41 @@ yy515:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy516;
- }
-yy516:
- YYDEBUG(516, YYPEEK ());
-#line 299 "../ada.re2c"
- {*id = 29; continue;}
-#line 15658 "../ada_re2c.c"
-yy517:
- YYDEBUG(517, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
- switch (yych) {
- case 'E':
- case 'e': goto yy527;
- default: goto yy15;
- }
-yy518:
- YYDEBUG(518, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
- switch (yych) {
- case 'N':
- case 'n': goto yy529;
- default: goto yy15;
- }
-yy519:
- YYDEBUG(519, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ default: goto yy621;
+ }
+yy621:
+ YYDEBUG(621, YYPEEK());
+#line 330 "ada_annex_p.re2c"
+ {*id = 37; continue;}
+#line 20331 "ada_annex_p_re2c.c"
+yy622:
+ YYDEBUG(622, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy530;
+ case 'e': goto yy633;
default: goto yy15;
}
-yy520:
- YYDEBUG(520, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy623:
+ YYDEBUG(623, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'D':
- case 'd': goto yy532;
+ case 'd': goto yy635;
default: goto yy15;
}
-yy521:
- YYDEBUG(521, YYPEEK ());
- yyaccept = 73;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy624:
+ YYDEBUG(624, YYPEEK());
+ yyaccept = 78;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -15821,41 +20472,41 @@ yy521:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy522;
- }
-yy522:
- YYDEBUG(522, YYPEEK ());
-#line 330 "../ada.re2c"
- {*id = 60; continue;}
-#line 15831 "../ada_re2c.c"
-yy523:
- YYDEBUG(523, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ default: goto yy625;
+ }
+yy625:
+ YYDEBUG(625, YYPEEK());
+#line 306 "ada_annex_p.re2c"
+ {*id = 13; continue;}
+#line 20482 "ada_annex_p_re2c.c"
+yy626:
+ YYDEBUG(626, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'I':
- case 'i': goto yy534;
+ case 'i': goto yy637;
default: goto yy15;
}
-yy524:
- YYDEBUG(524, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy627:
+ YYDEBUG(627, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy535;
+ case 'e': goto yy638;
default: goto yy15;
}
-yy525:
- YYDEBUG(525, YYPEEK ());
- yyaccept = 74;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy628:
+ YYDEBUG(628, YYPEEK());
+ yyaccept = 79;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -15972,19 +20623,19 @@ yy525:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy526;
- }
-yy526:
- YYDEBUG(526, YYPEEK ());
-#line 296 "../ada.re2c"
- {*id = 26; continue;}
-#line 15982 "../ada_re2c.c"
-yy527:
- YYDEBUG(527, YYPEEK ());
- yyaccept = 75;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ default: goto yy629;
+ }
+yy629:
+ YYDEBUG(629, YYPEEK());
+#line 316 "ada_annex_p.re2c"
+ {*id = 23; continue;}
+#line 20633 "ada_annex_p_re2c.c"
+yy630:
+ YYDEBUG(630, YYPEEK());
+ yyaccept = 80;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -16101,30 +20752,30 @@ yy527:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy528;
- }
-yy528:
- YYDEBUG(528, YYPEEK ());
-#line 304 "../ada.re2c"
- {*id = 34; continue;}
-#line 16111 "../ada_re2c.c"
-yy529:
- YYDEBUG(529, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ default: goto yy631;
+ }
+yy631:
+ YYDEBUG(631, YYPEEK());
+#line 350 "ada_annex_p.re2c"
+ {*id = 57; continue;}
+#line 20762 "ada_annex_p_re2c.c"
+yy632:
+ YYDEBUG(632, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'G':
- case 'g': goto yy537;
+ case 'g': goto yy640;
default: goto yy15;
}
-yy530:
- YYDEBUG(530, YYPEEK ());
- yyaccept = 76;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy633:
+ YYDEBUG(633, YYPEEK());
+ yyaccept = 81;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -16241,19 +20892,19 @@ yy530:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy531;
- }
-yy531:
- YYDEBUG(531, YYPEEK ());
-#line 320 "../ada.re2c"
- {*id = 50; continue;}
-#line 16251 "../ada_re2c.c"
-yy532:
- YYDEBUG(532, YYPEEK ());
- yyaccept = 77;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ default: goto yy634;
+ }
+yy634:
+ YYDEBUG(634, YYPEEK());
+#line 347 "ada_annex_p.re2c"
+ {*id = 54; continue;}
+#line 20902 "ada_annex_p_re2c.c"
+yy635:
+ YYDEBUG(635, YYPEEK());
+ yyaccept = 82;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -16370,30 +21021,30 @@ yy532:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy533;
- }
-yy533:
- YYDEBUG(533, YYPEEK ());
-#line 321 "../ada.re2c"
- {*id = 51; continue;}
-#line 16380 "../ada_re2c.c"
-yy534:
- YYDEBUG(534, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ default: goto yy636;
+ }
+yy636:
+ YYDEBUG(636, YYPEEK());
+#line 352 "ada_annex_p.re2c"
+ {*id = 59; continue;}
+#line 21031 "ada_annex_p_re2c.c"
+yy637:
+ YYDEBUG(637, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'Z':
- case 'z': goto yy539;
+ case 'z': goto yy642;
default: goto yy15;
}
-yy535:
- YYDEBUG(535, YYPEEK ());
- yyaccept = 78;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy638:
+ YYDEBUG(638, YYPEEK());
+ yyaccept = 83;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -16510,19 +21161,19 @@ yy535:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy536;
- }
-yy536:
- YYDEBUG(536, YYPEEK ());
-#line 337 "../ada.re2c"
- {*id = 67; continue;}
-#line 16520 "../ada_re2c.c"
-yy537:
- YYDEBUG(537, YYPEEK ());
- yyaccept = 79;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ default: goto yy639;
+ }
+yy639:
+ YYDEBUG(639, YYPEEK());
+#line 307 "ada_annex_p.re2c"
+ {*id = 14; continue;}
+#line 21171 "ada_annex_p_re2c.c"
+yy640:
+ YYDEBUG(640, YYPEEK());
+ yyaccept = 84;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -16639,41 +21290,41 @@ yy537:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy538;
- }
-yy538:
- YYDEBUG(538, YYPEEK ());
-#line 316 "../ada.re2c"
- {*id = 46; continue;}
-#line 16649 "../ada_re2c.c"
-yy539:
- YYDEBUG(539, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ default: goto yy641;
+ }
+yy641:
+ YYDEBUG(641, YYPEEK());
+#line 318 "ada_annex_p.re2c"
+ {*id = 25; continue;}
+#line 21300 "ada_annex_p_re2c.c"
+yy642:
+ YYDEBUG(642, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy540;
+ case 'e': goto yy643;
default: goto yy15;
}
-yy540:
- YYDEBUG(540, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy643:
+ YYDEBUG(643, YYPEEK());
+ yyaccept = 2;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'D':
- case 'd': goto yy541;
+ case 'd': goto yy644;
default: goto yy15;
}
-yy541:
- YYDEBUG(541, YYPEEK ());
- yyaccept = 80;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy644:
+ YYDEBUG(644, YYPEEK());
+ yyaccept = 85;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -16790,15 +21441,15 @@ yy541:
case 0xF2:
case 0xF3:
case 0xF4: goto yy15;
- default: goto yy542;
+ default: goto yy645;
}
-yy542:
- YYDEBUG(542, YYPEEK ());
-#line 334 "../ada.re2c"
- {*id = 64; continue;}
-#line 16800 "../ada_re2c.c"
+yy645:
+ YYDEBUG(645, YYPEEK());
+#line 351 "ada_annex_p.re2c"
+ {*id = 58; continue;}
+#line 21451 "ada_annex_p_re2c.c"
}
-#line 383 "../ada.re2c"
+#line 415 "ada_annex_p.re2c"
}
/* lexer->cursor and lexer ->char_pos are one char past end of token */
@@ -16807,5 +21458,6 @@ yy542:
*char_position = lexer->char_token_start;
*char_length = lexer->char_pos - lexer->char_token_start;
*line_start = lexer->line_token_start;
+ *line_length = lexer->line - lexer->line_token_start;
return status;
}
diff --git a/ada_re2c_c.ads b/ada_annex_p_re2c_c.ads
similarity index 59%
rename from ada_re2c_c.ads
rename to ada_annex_p_re2c_c.ads
index 4a24ed2bf8..6af9451ba1 100644
--- a/ada_re2c_c.ads
+++ b/ada_annex_p_re2c_c.ads
@@ -1,8 +1,8 @@
--- generated parser support file.
--- command line: wisitoken-bnf-generate.exe --generate LALR Ada_Emacs re2c
PROCESS ada.wy
+-- generated parser support file. -*- buffer-read-only:t -*-
+-- command line: wisitoken-bnf-generate.exe --generate LALR Ada_Emacs re2c
PROCESS ada_annex_p.wy
--
--- Copyright (C) 2013 - 2020 Free Software Foundation, Inc.
+-- Copyright (C) 2013 - 2022 Free Software Foundation, Inc.
-- This program is free software; you can redistribute it and/or
-- modify it under the terms of the GNU General Public License as
@@ -20,28 +20,42 @@
with Interfaces.C;
with WisiToken;
with System;
-package ada_re2c_c is
+package ada_annex_p_re2c_c is
function New_Lexer
(Buffer : in System.Address;
- Length : in Interfaces.C.size_t;
- Verbosity : in Interfaces.C.int)
+ Length : in Interfaces.C.size_t)
return System.Address
with Import => True,
Convention => C,
- External_Name => "ada_new_lexer";
- -- Create the lexer object, passing it the full text to process.
+ External_Name => "ada_annex_p_new_lexer";
+ -- Create the lexer object, passing it the text buffer.
procedure Free_Lexer (Lexer : in out System.Address)
with Import => True,
Convention => C,
- External_Name => "ada_free_lexer";
+ External_Name => "ada_annex_p_free_lexer";
-- Free the lexer object
procedure Reset_Lexer (Lexer : in System.Address)
with Import => True,
Convention => C,
- External_Name => "ada_reset_lexer";
+ External_Name => "ada_annex_p_reset_lexer";
+
+ procedure Set_Verbosity
+ (Lexer : in System.Address;
+ Verbosity : in Interfaces.C.int)
+ with Import => True,
+ Convention => C,
+ External_Name => "ada_annex_p_set_verbosity";
+ procedure Set_Position
+ (Lexer : in System.Address;
+ Byte_Position : in Interfaces.C.size_t;
+ Char_Position : in Interfaces.C.size_t;
+ Line : in Interfaces.C.int)
+ with Import => True,
+ Convention => C,
+ External_Name => "ada_annex_p_set_position";
function Next_Token
(Lexer : in System.Address;
@@ -50,10 +64,11 @@ package ada_re2c_c is
Byte_Length : out Interfaces.C.size_t;
Char_Position : out Interfaces.C.size_t;
Char_Length : out Interfaces.C.size_t;
- Line_Start : out Interfaces.C.int)
+ Line_Start : out Interfaces.C.int;
+ Line_Length : out Interfaces.C.int)
return Interfaces.C.int
with Import => True,
Convention => C,
- External_Name => "ada_next_token";
+ External_Name => "ada_annex_p_next_token";
-end ada_re2c_c;
+end ada_annex_p_re2c_c;
diff --git a/ada_lr1_parse_table.txt.gz b/ada_lr1_parse_table.txt.gz
deleted file mode 100644
index a5c7877260..0000000000
Binary files a/ada_lr1_parse_table.txt.gz and /dev/null differ
diff --git a/ada_mode_wisi_lalr_parse.ads b/ada_mode_wisi_lalr_parse.ads
index fb83eafa4d..e5ff9dc821 100644
--- a/ada_mode_wisi_lalr_parse.ads
+++ b/ada_mode_wisi_lalr_parse.ads
@@ -2,7 +2,7 @@
--
-- External process parser for Ada mode
--
--- Copyright (C) 2017 - 2019 Free Software Foundation, Inc.
+-- Copyright (C) 2017 - 2020, 2022 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or
-- modify it under terms of the GNU General Public License as
@@ -18,8 +18,8 @@
pragma License (GPL);
-with Ada_Process_Actions;
-with Ada_Process_LALR_Main;
+with Ada_Annex_P_Process_Actions;
+with Ada_Annex_P_Process_LALR_Main;
with Gen_Emacs_Wisi_LR_Parse;
with WisiToken.Parse.LR.McKenzie_Recover.Ada;
with Wisi.Ada;
@@ -27,9 +27,12 @@ procedure Ada_Mode_Wisi_LALR_Parse is new
Gen_Emacs_Wisi_LR_Parse
(Parse_Data_Type => Wisi.Ada.Parse_Data_Type,
Language_Protocol_Version => Wisi.Ada.Language_Protocol_Version,
Name => "Ada_mode_wisi_lalr_parse",
- Descriptor => Ada_Process_Actions.Descriptor,
- Partial_Parse_Active => Ada_Process_Actions.Partial_Parse_Active,
+ Descriptor =>
Ada_Annex_P_Process_Actions.Descriptor'Access,
+ Partial_Parse_Active =>
Ada_Annex_P_Process_Actions.Partial_Parse_Active'Access,
+ Partial_Parse_Byte_Goal =>
Ada_Annex_P_Process_Actions.Partial_Parse_Byte_Goal'Access,
Language_Fixes =>
WisiToken.Parse.LR.McKenzie_Recover.Ada.Language_Fixes'Access,
Language_Matching_Begin_Tokens =>
WisiToken.Parse.LR.McKenzie_Recover.Ada.Matching_Begin_Tokens'Access,
Language_String_ID_Set =>
WisiToken.Parse.LR.McKenzie_Recover.Ada.String_ID_Set'Access,
- Create_Parser => Ada_Process_LALR_Main.Create_Parser);
+ Create_Lexer =>
Ada_Annex_P_Process_LALR_Main.Create_Lexer,
+ Create_Parse_Table =>
Ada_Annex_P_Process_LALR_Main.Create_Parse_Table,
+ Create_Productions =>
Ada_Annex_P_Process_LALR_Main.Create_Productions);
diff --git a/ada_mode_wisi_lr1_parse.ads b/ada_mode_wisi_lr1_parse.ads
index e86387d67c..5c9aca0dfb 100644
--- a/ada_mode_wisi_lr1_parse.ads
+++ b/ada_mode_wisi_lr1_parse.ads
@@ -2,7 +2,7 @@
--
-- External process parser for Ada mode
--
--- Copyright (C) 2017 - 2019 Free Software Foundation, Inc.
+-- Copyright (C) 2017 - 2020, 2022 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or
-- modify it under terms of the GNU General Public License as
@@ -18,19 +18,22 @@
pragma License (GPL);
-with Ada_Process_Actions;
-with Ada_Process_LR1_Main;
+with Ada_Annex_P_Process_Actions;
+with Ada_Annex_P_Process_LR1_Main;
with Gen_Emacs_Wisi_LR_Text_Rep_Parse;
with WisiToken.Parse.LR.McKenzie_Recover.Ada;
with Wisi.Ada;
procedure Ada_Mode_Wisi_LR1_Parse is new Gen_Emacs_Wisi_LR_Text_Rep_Parse
(Parse_Data_Type => Wisi.Ada.Parse_Data_Type,
- Language_Protocol_Version => Wisi.Ada.Language_Protocol_Version,
Name => "Ada_mode_wisi_lr1_parse",
- Descriptor => Ada_Process_Actions.Descriptor,
- Partial_Parse_Active => Ada_Process_Actions.Partial_Parse_Active,
+ Language_Protocol_Version => Wisi.Ada.Language_Protocol_Version,
+ Descriptor =>
Ada_Annex_P_Process_Actions.Descriptor'Access,
+ Partial_Parse_Active =>
Ada_Annex_P_Process_Actions.Partial_Parse_Active'Access,
+ Partial_Parse_Byte_Goal =>
Ada_Annex_P_Process_Actions.Partial_Parse_Byte_Goal'Access,
Language_Fixes =>
WisiToken.Parse.LR.McKenzie_Recover.Ada.Language_Fixes'Access,
Language_Matching_Begin_Tokens =>
WisiToken.Parse.LR.McKenzie_Recover.Ada.Matching_Begin_Tokens'Access,
Language_String_ID_Set =>
WisiToken.Parse.LR.McKenzie_Recover.Ada.String_ID_Set'Access,
- Text_Rep_File_Name => "ada_lr1_parse_table.txt",
- Create_Parser => Ada_Process_LR1_Main.Create_Parser);
+ Text_Rep_File_Name => "ada_annex_p_lr1_parse_table.txt",
+ Create_Lexer => Ada_Annex_P_Process_LR1_Main.Create_Lexer,
+ Create_Parse_Table =>
Ada_Annex_P_Process_LR1_Main.Create_Parse_Table,
+ Create_Productions =>
Ada_Annex_P_Process_LR1_Main.Create_Productions);
diff --git a/ada_mode_wisi_parse.gpr.gp b/ada_mode_wisi_parse.gpr.gp
index b39f5130b4..d5ee96a0fe 100644
--- a/ada_mode_wisi_parse.gpr.gp
+++ b/ada_mode_wisi_parse.gpr.gp
@@ -2,7 +2,7 @@
--
-- build ada_mode_wisi_parse and other executables
--
--- Copyright (C) 2014, 2018, 2019 Free Software Foundation, Inc.
+-- Copyright (C) 2014, 2018 - 2020 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or
-- modify it under terms of the GNU General Public License as
@@ -16,11 +16,6 @@
-- the Free Software Foundation, 51 Franklin Street, Suite 500, Boston,
-- MA 02110-1335, USA.
-#if ELPA="yes"
-with "wisi";
-#else
-with "wisitoken";
-#end if;
with "standard_common";
with "gnatcoll";
with "gnatcoll_sqlite";
@@ -31,6 +26,7 @@ with "gnat_util";
#if HAVE_LIBADALANG="yes"
with "libadalang";
#end if;
+with "wisi";
project Ada_Mode_Wisi_Parse is
for Main use
@@ -38,12 +34,12 @@ project Ada_Mode_Wisi_Parse is
"ada_mode_wisi_lr1_parse.ads",
"run_ada_lalr_parse.ads",
"run_ada_lr1_parse.ads",
-#if ELPA="no"
- #if HAVE_LIBADALANG="yes"
- "dump_libadalang_corrected.adb",
- #end if;
- "dump_wisitoken_corrected.adb",
-#end if;
+-- #if ELPA="no"
+-- #if HAVE_LIBADALANG="yes"
+-- "dump_libadalang_corrected.adb",
+-- #end if;
+-- "dump_wisitoken_corrected.adb", FIXME: broken by wisitoken changes
+-- #end if;
"gpr_mode_wisi_parse.ads",
"run_gpr_parse.ads",
"gpr_query.adb"
@@ -70,52 +66,60 @@ project Ada_Mode_Wisi_Parse is
for Default_Switches ("Ada") use
Standard_Common.Compiler.Common_Switches &
Standard_Common.Compiler.Style_Checks &
- Standard_Common.Compiler.Debug_Switches & "-gnat2020";
+ Standard_Common.Compiler.Debug_Switches;
-- Generated files; lines too long, don't need debug
for Switches ("ada_process_actions.adb") use
Standard_Common.Compiler.Common_Switches &
Standard_Common.Compiler.Base_Style_Checks &
- Standard_Common.Compiler.Base_Release_Switches & ("-O1");
+ Standard_Common.Compiler.Base_Release_Switches & ("-O1",
"-gnat2020");
for Switches ("ada_process_main.adb") use
Standard_Common.Compiler.Common_Switches &
Standard_Common.Compiler.Base_Style_Checks &
- Standard_Common.Compiler.Base_Release_Switches & ("-O1");
-
- for Switches ("gpr_process_actions.adb") use
- Standard_Common.Compiler.Common_Switches &
- Standard_Common.Compiler.Base_Style_Checks &
- Standard_Common.Compiler.Base_Release_Switches & ("-O1");
+ Standard_Common.Compiler.Base_Release_Switches & ("-O1",
"-gnat2020");
for Switches ("gpr_process_main.adb") use
Standard_Common.Compiler.Common_Switches &
Standard_Common.Compiler.Base_Style_Checks &
- Standard_Common.Compiler.Base_Release_Switches & ("-O1");
+ Standard_Common.Compiler.Base_Release_Switches & ("-O1",
"-gnat2020");
for Default_Switches ("C") use
Standard_Common.Compiler.Debug_Switches_C;
+ for Switches ("gpr_query.adb") use
+ -- WORKAROUND: GNAT Community 2021 reports that gnatcoll 21.2 is
missing an "overrides" somewhere
+ Standard_Common.Compiler.Common_Switches &
+ "-gnaty3abcefhiklnprtx" & -- not overrding --
Standard_Common.Compiler.Base_Style_Checks &
+ Standard_Common.Compiler.Debug_Switches;
+
when "Normal" =>
for Default_Switches ("Ada") use
Standard_Common.Compiler.Common_Switches &
Standard_Common.Compiler.Style_Checks &
- Standard_Common.Compiler.Release_Switches & "-gnat2020";
+ Standard_Common.Compiler.Release_Switches;
for Switches ("ada_process_actions.adb") use
Standard_Common.Compiler.Common_Switches &
Standard_Common.Compiler.Base_Style_Checks &
- Standard_Common.Compiler.Base_Release_Switches & ("-O1");
+ Standard_Common.Compiler.Base_Release_Switches & ("-O1",
"-gnat2020");
for Switches ("ada_process_main.adb") use
Standard_Common.Compiler.Common_Switches &
Standard_Common.Compiler.Base_Style_Checks &
- Standard_Common.Compiler.Base_Release_Switches & ("-O1");
+ Standard_Common.Compiler.Base_Release_Switches & ("-O1",
"-gnat2020");
for Switches ("gpr_process.adb") use
Standard_Common.Compiler.Common_Switches &
Standard_Common.Compiler.Base_Style_Checks &
- Standard_Common.Compiler.Base_Release_Switches & ("-O1");
+ Standard_Common.Compiler.Base_Release_Switches & ("-O1",
"-gnat2020");
+ for Switches ("gpr_query.adb") use
+ -- WORKAROUND: GNAT Community 2021 with gnatcoll 21.2 and -gnat2020
reports a missing "overrides"
+ -- AdaCore ticket U618-051
+ Standard_Common.Compiler.Common_Switches &
+ "-gnaty3abcefhiklnprtx" & "-gnatyM120" & -- not overriding
+ Standard_Common.Compiler.Release_Switches;
+
for Default_Switches ("C") use
Standard_Common.Compiler.Release_Switches_C;
end case;
@@ -140,7 +144,7 @@ project Ada_Mode_Wisi_Parse is
package Install is
for Required_Artifacts ("bin") use
- ("ada_lr1_parse_table.txt");
+ ("ada_annex_p_lr1_parse_table.txt");
end Install;
end Ada_Mode_Wisi_Parse;
diff --git a/ada_process_actions.adb b/ada_process_actions.adb
deleted file mode 100644
index e3767c7334..0000000000
--- a/ada_process_actions.adb
+++ /dev/null
@@ -1,5237 +0,0 @@
--- generated parser support file.
--- command line: wisitoken-bnf-generate.exe --generate LR1 Ada_Emacs re2c
PROCESS text_rep ada.wy
---
-
--- Copyright (C) 2013 - 2020 Free Software Foundation, Inc.
-
--- This program is free software; you can redistribute it and/or
--- modify it under the terms of the GNU General Public License as
--- published by the Free Software Foundation; either version 3, or (at
--- your option) any later version.
---
--- This software is distributed in the hope that it will be useful,
--- but WITHOUT ANY WARRANTY; without even the implied warranty of
--- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
--- General Public License for more details.
---
--- You should have received a copy of the GNU General Public License
--- along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>.
-
-with Wisi; use Wisi;
-with Wisi.Ada; use Wisi.Ada;
-package body Ada_Process_Actions is
-
- use WisiToken.Semantic_Checks;
- use all type Motion_Param_Array;
-
- procedure abstract_subprogram_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (2, Statement_Override), (6,
- Statement_End)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int, Ada_Indent_Broken))),
- (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end abstract_subprogram_declaration_0;
-
- procedure accept_statement_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (5, Motion), (9, Statement_End)));
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (5, Invalid_Token_ID) & (6, 72) &
- (9, Invalid_Token_ID)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, 3, 1), (8,
3, 1)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (True, (Simple, (Label => None)), (Simple,
(Int, Ada_Indent))), (True, (Simple, (Int,
- Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label
=> None))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end accept_statement_0;
-
- function accept_statement_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Nonterm, Recover_Active);
- begin
- return Match_Names (Lexer, Descriptor, Tokens, 2, 8, End_Names_Optional);
- end accept_statement_0_check;
-
- procedure accept_statement_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (5, Statement_End)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3,
1)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end accept_statement_1;
-
- procedure access_definition_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (False, (Simple, (Label => None))), (False,
(Simple, (Label => None))), (False, (Simple,
- (Anchored_2, 4, Ada_Indent_Broken)))));
- end case;
- end access_definition_0;
-
- procedure access_definition_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (False, (Simple, (Label => None))), (False,
(Simple, (Label => None))), (False, (Simple,
- (Anchored_2, 4, Ada_Indent_Broken)))));
- end case;
- end access_definition_1;
-
- procedure access_definition_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (4, 1,
2)));
- when Indent =>
- null;
- end case;
- end access_definition_2;
-
- procedure actual_parameter_part_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (True, (Simple,
- (Anchored_0, 1, 1)), (Simple, (Anchored_0, 1, 1))), (False, (Simple,
(Anchored_0, 1, 0)))));
- end case;
- end actual_parameter_part_0;
-
- procedure actual_parameter_part_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (True, (Simple,
- (Anchored_0, 1, 1)), (Simple, (Anchored_0, 1, 1))), (False, (Simple,
(Anchored_0, 1, 0)))));
- end case;
- end actual_parameter_part_1;
-
- procedure aggregate_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (True, (Simple,
- (Anchored_0, 1, 1)), (Simple, (Anchored_0, 1, 1))), (False, (Simple,
(Anchored_0, 1, 0)))));
- end case;
- end aggregate_0;
-
- procedure aggregate_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 1))), (False,
(Simple, (Label => None))), (False,
- (Simple, (Label => None))), (False, (Simple, (Anchored_0, 1, 0)))));
- end case;
- end aggregate_2;
-
- procedure aggregate_3
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 1))), (True,
(Simple, (Anchored_0, 1, 1)), (Simple,
- (Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 0)))));
- end case;
- end aggregate_3;
-
- procedure aggregate_4
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 1))), (False,
(Simple, (Anchored_0, 1, 1))), (True,
- (Simple, (Anchored_0, 1, 1)), (Simple, (Anchored_0, 1, 1))), (False,
(Simple, (Anchored_0, 1, 0)))));
- end case;
- end aggregate_4;
-
- procedure aggregate_5
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 1))), (False,
(Simple, (Anchored_0, 1, 1))), (True,
- (Simple, (Anchored_0, 1, 1)), (Simple, (Anchored_0, 1, 1))), (False,
(Simple, (Anchored_0, 1, 0)))));
- end case;
- end aggregate_5;
-
- procedure aggregate_6
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (True, (Simple,
- (Anchored_0, 1, 1)), (Simple, (Anchored_0, 1, 1))), (False, (Simple,
(Anchored_0, 1, 0)))));
- end case;
- end aggregate_6;
-
- procedure array_type_definition_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (False, (Simple, (Anchored_0, 2, 1))), (False,
(Simple, (Anchored_0, 2, 0))), (False,
- (Simple, (Label => None))), (False, (Simple, (Label => None)))));
- end case;
- end array_type_definition_0;
-
- procedure array_type_definition_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (False, (Simple, (Anchored_0, 2, 1))), (False,
(Simple, (Anchored_0, 2, 0))), (False,
- (Simple, (Label => None))), (False, (Simple, (Label => None)))));
- end case;
- end array_type_definition_1;
-
- procedure aspect_clause_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (5, Statement_End)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end aspect_clause_0;
-
- procedure aspect_specification_opt_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken)))));
- end case;
- end aspect_specification_opt_0;
-
- procedure assignment_statement_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (4, Statement_End)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Hanging_0, (Anchored_1, 2,
Ada_Indent_Broken), (Anchored_1, 3,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end assignment_statement_0;
-
- procedure association_opt_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (True, (Hanging_3, (Anchored_1, 2,
Ada_Indent_Broken), (Anchored_1, 2, 2 *
- Ada_Indent_Broken)), (Hanging_3, (Anchored_1, 2, Ada_Indent_Broken),
(Anchored_1, 2, 2 *
- Ada_Indent_Broken)))));
- end case;
- end association_opt_0;
-
- procedure association_opt_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False,
(Hanging_0, (Label => None), (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(True, (Hanging_3, (Anchored_1, 2,
- Ada_Indent_Broken), (Anchored_1, 2, 2 * Ada_Indent_Broken)),
(Hanging_3, (Anchored_1, 2, Ada_Indent_Broken),
- (Anchored_1, 2, 2 * Ada_Indent_Broken)))));
- end case;
- end association_opt_2;
-
- procedure association_opt_3
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False,
(Hanging_0, (Label => None), (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Label => None)))));
- end case;
- end association_opt_3;
-
- procedure association_opt_4
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, (1 => (True,
(Hanging_0, (Label => None), (Int,
- Ada_Indent_Broken)), (Hanging_0, (Label => None), (Int,
Ada_Indent_Broken)))));
- end case;
- end association_opt_4;
-
- procedure association_opt_6
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (False, (Simple, (Label => None))), (False,
(Hanging_0, (Label => None), (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(True, (Hanging_0, (Label => None), (Int,
- Ada_Indent_Broken)), (Hanging_0, (Label => None), (Int,
Ada_Indent_Broken)))));
- end case;
- end association_opt_6;
-
- procedure association_opt_7
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Hanging_0,
- (Label => None), (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (True, (Hanging_0,
- (Label => None), (Int, Ada_Indent_Broken)), (Hanging_0, (Label =>
None), (Int, Ada_Indent_Broken)))));
- end case;
- end association_opt_7;
-
- procedure asynchronous_select_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (3, Motion), (8, Statement_End)));
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (3, Invalid_Token_ID) & (8,
- Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (True, (Simple, (Int,
- Ada_Indent)), (Simple, (Int, Ada_Indent))), (True, (Simple, (Label =>
None)), (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(True, (Simple, (Int, Ada_Indent)),
- (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))),
(False, (Simple, (Int, Ada_Indent_Broken))),
- (False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end asynchronous_select_0;
-
- procedure at_clause_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (6, Statement_End)));
- when Face =>
- null;
- when Indent =>
- null;
- end case;
- end at_clause_0;
-
- procedure block_label_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Int, Ada_Indent_Label))), (False,
- (Simple, (Label => None)))));
- end case;
- end block_label_0;
-
- function block_label_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Lexer, Recover_Active);
- begin
- return Propagate_Name (Nonterm, Tokens, 1);
- end block_label_0_check;
-
- function block_label_opt_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Lexer, Recover_Active);
- begin
- return Propagate_Name (Nonterm, Tokens, 1);
- end block_label_opt_0_check;
-
- procedure block_statement_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (2, Motion), (4, Motion), (8,
- Statement_End)));
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((2,
Invalid_Token_ID) & (4, Invalid_Token_ID) & (5, 72) &
- (8, Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label
- => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label =>
- None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False,
(Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end block_statement_0;
-
- function block_statement_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Nonterm, Recover_Active);
- begin
- return Match_Names (Lexer, Descriptor, Tokens, 1, 7, End_Names_Optional);
- end block_statement_0_check;
-
- procedure block_statement_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (2, Motion), (6, Statement_End)));
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((2,
Invalid_Token_ID) & (3, 72) & (6, Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label
- => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False,
(Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end block_statement_1;
-
- function block_statement_1_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Nonterm, Recover_Active);
- begin
- return Match_Names (Lexer, Descriptor, Tokens, 1, 5, End_Names_Optional);
- end block_statement_1_check;
-
- procedure case_expression_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1,
Motion)));
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (4, Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))),
(False, (Simple, (Int, Ada_Indent_When)))));
- end case;
- end case_expression_0;
-
- procedure case_expression_alternative_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1,
Motion)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Hanging_0, (Anchored_1, 1,
- Ada_Indent), (Anchored_1, 1, Ada_Indent + Ada_Indent_Broken)))));
- end case;
- end case_expression_alternative_0;
-
- procedure case_expression_alternative_list_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (3, Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- null;
- end case;
- end case_expression_alternative_list_0;
-
- procedure case_statement_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (7, Statement_End)));
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (4, Invalid_Token_ID) & (7,
- Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))),
(True, (Simple, (Int, Ada_Indent_When)),
- (Simple, (Int, Ada_Indent_When))), (False, (Simple, (Label =>
None))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end case_statement_0;
-
- procedure case_statement_alternative_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1,
Motion)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (True, (Simple, (Int, Ada_Indent)),
- (Simple, (Int, Ada_Indent)))));
- end case;
- end case_statement_alternative_0;
-
- procedure case_statement_alternative_list_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (2, Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- null;
- end case;
- end case_statement_alternative_list_0;
-
- procedure compilation_unit_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Int, 0))), (False, (Simple, (Int,
- 0)))));
- end case;
- end compilation_unit_2;
-
- procedure compilation_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Int, 0))), (True, (Simple, (Int, 0)),
- (Simple, (Int, 0)))));
- end case;
- end compilation_0;
-
- procedure compilation_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, (1 => (True,
(Simple, (Int, 0)), (Simple, (Int, 0)))));
- end case;
- end compilation_1;
-
- function compilation_1_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Lexer, Tokens);
- begin
- return Terminate_Partial_Parse (Partial_Parse_Active,
Partial_Parse_Byte_Goal, Recover_Active, Nonterm);
- end compilation_1_check;
-
- procedure component_clause_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (8, Statement_End)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int,
- Ada_Indent_Broken)))));
- end case;
- end component_clause_0;
-
- procedure component_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (7, Statement_End)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 4,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end component_declaration_0;
-
- procedure component_declaration_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (5, Statement_End)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end component_declaration_1;
-
- procedure component_list_4
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (2, Statement_End)));
- when Face =>
- null;
- when Indent =>
- null;
- end case;
- end component_list_4;
-
- procedure conditional_entry_call_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (3, Motion), (7, Statement_End)));
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (3, Invalid_Token_ID) & (7,
- Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (True, (Simple, (Int,
- Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label
=> None))), (True, (Simple, (Int,
- Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label
=> None))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end conditional_entry_call_0;
-
- procedure declaration_9
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (6, Statement_End)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False,
(Hanging_0, (Label => None), (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Anchored_1, 4,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end declaration_9;
-
- procedure delay_statement_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (4, Statement_End)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken)))));
- end case;
- end delay_statement_0;
-
- procedure delay_statement_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (3, Statement_End)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end delay_statement_1;
-
- procedure derived_type_definition_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1,
2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (False, (Simple, (Label => None))), (False,
(Simple, (Label => None))), (True, (Simple,
- (Label => None)), (Simple, (Language, Ada_Indent_Record_1'Access, 69
& 6 & 0))), (False, (Simple, (Label =>
- None)))));
- end case;
- end derived_type_definition_0;
-
- procedure derived_type_definition_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1,
2)));
- when Indent =>
- null;
- end case;
- end derived_type_definition_1;
-
- procedure discriminant_part_opt_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 0)))));
- end case;
- end discriminant_part_opt_1;
-
- procedure elsif_expression_item_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Motion),
(3, Motion)));
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (3, Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (True, (Simple, (Int,
- Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken))), (False,
(Simple, (Label => None))), (False, (Simple,
- (Int, Ada_Indent)))));
- end case;
- end elsif_expression_item_0;
-
- procedure elsif_expression_list_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (2, Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- null;
- end case;
- end elsif_expression_list_0;
-
- procedure elsif_statement_item_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Motion),
(3, Motion)));
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (3, Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (True, (Simple, (Int,
- Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken))), (False,
(Simple, (Label => None))), (True, (Simple,
- (Int, Ada_Indent)), (Simple, (Int, Ada_Indent)))));
- end case;
- end elsif_statement_item_0;
-
- procedure elsif_statement_list_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (2, Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- null;
- end case;
- end elsif_statement_list_0;
-
- procedure entry_body_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (4, Motion), (6, Motion), (8,
- Motion), (12, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (4, Invalid_Token_ID) & (6,
- Invalid_Token_ID) & (8, Invalid_Token_ID) & (9, 72) & (12,
Invalid_Token_ID)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, 3, 1),
(11, 3, 1)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 4,
Ada_Indent_Broken))), (False, (Simple, (Label =>
- None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label => None))),
- (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))),
(False, (Simple, (Label => None))), (False,
- (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end entry_body_0;
-
- function entry_body_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Nonterm, Recover_Active);
- begin
- return Match_Names (Lexer, Descriptor, Tokens, 2, 11,
End_Names_Optional);
- end entry_body_0_check;
-
- procedure entry_body_formal_part_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 1))), (False,
(Simple, (Anchored_0, 1, 1))), (False,
- (Simple, (Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 0))),
(False, (Simple, (Int,
- Ada_Indent_Broken)))));
- end case;
- end entry_body_formal_part_0;
-
- procedure entry_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (2, Statement_Override), (8,
- Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 3,
1)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int, Ada_Indent_Broken))),
- (False, (Simple, (Anchored_0, 4, 1))), (False, (Simple, (Anchored_0,
4, 0))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int,
- Ada_Indent_Broken)))));
- end case;
- end entry_declaration_0;
-
- procedure entry_declaration_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (2, Statement_Override), (6,
- Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 3,
1)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int, Ada_Indent_Broken))),
- (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end entry_declaration_1;
-
- procedure enumeration_representation_clause_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (5, Statement_End)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 1,
2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Hanging_3,
- (Int, Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken))), (False,
(Simple, (Int, Ada_Indent_Broken))), (False,
- (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end enumeration_representation_clause_0;
-
- procedure enumeration_type_definition_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 0)))));
- end case;
- end enumeration_type_definition_0;
-
- procedure exception_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (4, Statement_End)));
- when Face =>
- null;
- when Indent =>
- null;
- end case;
- end exception_declaration_0;
-
- procedure exception_handler_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1,
Motion)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(True, (Simple, (Int, Ada_Indent)),
- (Simple, (Int, Ada_Indent)))));
- end case;
- end exception_handler_0;
-
- procedure exception_handler_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1,
Motion)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (True, (Simple, (Int, Ada_Indent)),
- (Simple, (Int, Ada_Indent)))));
- end case;
- end exception_handler_1;
-
- procedure exception_handler_list_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (2, Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- null;
- end case;
- end exception_handler_list_0;
-
- procedure exit_statement_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (5, Statement_End)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (False, (Simple, (Label => None))), (False,
(Simple, (Int, Ada_Indent_Broken))), (False,
- (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end exit_statement_0;
-
- procedure exit_statement_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (3, Statement_End)));
- when Face =>
- null;
- when Indent =>
- null;
- end case;
- end exit_statement_1;
-
- procedure expression_function_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (2, Statement_Override), (6,
- Statement_End)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (False, (Simple, (Label => None))), (False,
(Simple, (Int, Ada_Indent_Broken))), (False,
- (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end expression_function_declaration_0;
-
- procedure extended_return_object_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int, Ada_Indent_Broken))),
- (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple,
- (Anchored_1, 6, Ada_Indent_Broken)))));
- end case;
- end extended_return_object_declaration_0;
-
- procedure extended_return_object_declaration_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int, Ada_Indent_Broken))),
- (False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end extended_return_object_declaration_1;
-
- procedure extended_return_statement_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (3, Motion), (7, Statement_End)));
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (3, Invalid_Token_ID) & (4, 72) &
- (7, Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((True, (Simple,
(Label => None)), (Simple, (Int,
- Ada_Indent))), (False, (Simple, (Int, Ada_Indent_Broken))), (False,
(Simple, (Label => None))), (True,
- (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))), (False,
(Simple, (Label => None))), (False,
- (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end extended_return_statement_0;
-
- procedure extended_return_statement_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (3, Statement_End)));
- when Face =>
- null;
- when Indent =>
- null;
- end case;
- end extended_return_statement_1;
-
- procedure formal_object_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (9, Statement_End)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (5, 1,
2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Hanging_3, (Int, Ada_Indent_Broken),
(Int, 2 * Ada_Indent_Broken))), (False,
- (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 6,
Ada_Indent_Broken))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end formal_object_declaration_0;
-
- procedure formal_object_declaration_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (8, Statement_End)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Anchored_1, 5,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int,
- Ada_Indent_Broken)))));
- end case;
- end formal_object_declaration_1;
-
- procedure formal_object_declaration_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (7, Statement_End)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (5, 1,
2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Hanging_3, (Int, Ada_Indent_Broken),
(Int, 2 * Ada_Indent_Broken))), (False,
- (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end formal_object_declaration_2;
-
- procedure formal_object_declaration_3
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (6, Statement_End)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int,
- Ada_Indent_Broken)))));
- end case;
- end formal_object_declaration_3;
-
- procedure formal_part_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1,
Misc)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 0)))));
- end case;
- end formal_part_0;
-
- procedure formal_subprogram_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (7, Statement_End)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int, Ada_Indent_Broken))),
- (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple,
- (Int, Ada_Indent_Broken)))));
- end case;
- end formal_subprogram_declaration_0;
-
- procedure formal_subprogram_declaration_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (6, Statement_End)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int, Ada_Indent_Broken))),
- (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end formal_subprogram_declaration_1;
-
- procedure formal_subprogram_declaration_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (6, Statement_End)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int,
- Ada_Indent_Broken)))));
- end case;
- end formal_subprogram_declaration_2;
-
- procedure formal_subprogram_declaration_3
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (4, Statement_End)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end formal_subprogram_declaration_3;
-
- procedure formal_type_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (7, Statement_End)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3,
2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end formal_type_declaration_0;
-
- procedure formal_type_declaration_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (7, Statement_End)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3,
2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end formal_type_declaration_1;
-
- procedure formal_type_declaration_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (5, Statement_End)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3,
2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end formal_type_declaration_2;
-
- procedure formal_derived_type_definition_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1,
2)));
- when Indent =>
- null;
- end case;
- end formal_derived_type_definition_0;
-
- procedure formal_derived_type_definition_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1,
2)));
- when Indent =>
- null;
- end case;
- end formal_derived_type_definition_1;
-
- procedure formal_package_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (9, Statement_End)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 1, 1), (6,
1, 1)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Hanging_3, (Int,
Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken))),
- (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Hanging_3,
- (Int, Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken))), (False,
(Simple, (Int, Ada_Indent_Broken))), (False,
- (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end formal_package_declaration_0;
-
- procedure full_type_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (7, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3,
2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (True, (Simple, (Int,
- Ada_Indent_Broken)), (Simple, (Language, Ada_Indent_Record_1'Access,
69 & 5 & Ada_Indent_Broken))), (False,
- (Hanging_3, (Int, Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken))),
(False, (Simple, (Label => None))),
- (False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end full_type_declaration_0;
-
- procedure function_specification_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1,
Statement_Start)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 1,
1)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Hanging_3,
- (Int, Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken))), (False,
(Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end function_specification_0;
-
- function function_specification_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Lexer, Recover_Active);
- begin
- return Propagate_Name (Nonterm, Tokens, 2);
- end function_specification_0_check;
-
- procedure generic_formal_part_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1,
Statement_Start)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent)))));
- end case;
- end generic_formal_part_0;
-
- procedure generic_formal_part_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1,
Statement_Start)));
- when Face =>
- null;
- when Indent =>
- null;
- end case;
- end generic_formal_part_1;
-
- procedure generic_instantiation_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (7, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, 1, 1), (5,
1, 1)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Hanging_3,
- (Int, Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken))), (False,
(Simple, (Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Hanging_3, (Int,
Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken))),
- (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end generic_instantiation_0;
-
- procedure generic_instantiation_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (2, Statement_Override), (8,
- Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 1, 1), (6,
1, 1)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (False, (Hanging_3, (Int, Ada_Indent_Broken),
(Int, 2 * Ada_Indent_Broken))), (False,
- (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Hanging_3, (Int,
- Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False,
- (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end generic_instantiation_1;
-
- procedure generic_instantiation_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (2, Statement_Override), (8,
- Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 1, 1), (6,
1, 1)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (False, (Hanging_3, (Int, Ada_Indent_Broken),
(Int, 2 * Ada_Indent_Broken))), (False,
- (Simple, (Label => None))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Hanging_3, (Int,
- Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False,
- (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end generic_instantiation_2;
-
- procedure generic_package_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (3, Statement_End)));
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (2, Invalid_Token_ID) & (3,
- Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((True, (Simple,
(Label => None)), (Simple, (Int,
- Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken)))));
- end case;
- end generic_package_declaration_0;
-
- procedure generic_renaming_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (7, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 1, 1), (5,
1, 1)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (False, (Hanging_3, (Int, Ada_Indent_Broken),
(Int, 2 * Ada_Indent_Broken))), (False,
- (Simple, (Int, Ada_Indent_Broken))), (False, (Hanging_3, (Int,
Ada_Indent_Broken), (Int, 2 *
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int,
- Ada_Indent_Broken)))));
- end case;
- end generic_renaming_declaration_0;
-
- procedure generic_renaming_declaration_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (7, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 1, 1), (5,
1, 1)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (False, (Hanging_3, (Int, Ada_Indent_Broken),
(Int, 2 * Ada_Indent_Broken))), (False,
- (Simple, (Language, Ada_Indent_Renames_0'Access, +3))), (False,
(Hanging_3, (Int, Ada_Indent_Broken), (Int, 2
- * Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int,
- Ada_Indent_Broken)))));
- end case;
- end generic_renaming_declaration_1;
-
- procedure generic_renaming_declaration_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (7, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 1, 1), (5,
1, 1)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (False, (Hanging_3, (Int, Ada_Indent_Broken),
(Int, 2 * Ada_Indent_Broken))), (False,
- (Simple, (Language, Ada_Indent_Renames_0'Access, +3))), (False,
(Hanging_3, (Int, Ada_Indent_Broken), (Int, 2
- * Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int,
- Ada_Indent_Broken)))));
- end case;
- end generic_renaming_declaration_2;
-
- procedure generic_subprogram_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (2, Statement_Override), (4,
- Statement_End)));
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (2, Invalid_Token_ID) & (4,
- Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- null;
- end case;
- end generic_subprogram_declaration_0;
-
- procedure goto_label_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3,
0)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Int, Ada_Indent_Label))), (False,
- (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end goto_label_0;
-
- procedure handled_sequence_of_statements_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((True, (Simple,
(Label => None)), (Simple, (Label =>
- None))), (False, (Simple, (Int, -Ada_Indent))), (True, (Simple, (Int,
Ada_Indent_When - Ada_Indent)), (Simple,
- (Int, Ada_Indent_When - Ada_Indent)))));
- end case;
- end handled_sequence_of_statements_0;
-
- procedure identifier_list_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end identifier_list_0;
-
- procedure identifier_list_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 1);
- when Face =>
- null;
- when Indent =>
- null;
- end case;
- end identifier_list_1;
-
- function identifier_opt_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Lexer, Recover_Active);
- begin
- return Propagate_Name (Nonterm, Tokens, 1);
- end identifier_opt_0_check;
-
- procedure if_expression_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Motion),
(3, Motion), (6, Motion)));
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (3, Invalid_Token_ID) & (5,
- Invalid_Token_ID) & (6, Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (True, (Simple, (Int,
- Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken))), (False,
(Simple, (Label => None))), (False, (Simple,
- (Int, Ada_Indent))), (False, (Simple, (Label => None))), (False,
(Simple, (Label => None))), (False, (Simple,
- (Int, Ada_Indent)))));
- end case;
- end if_expression_0;
-
- procedure if_expression_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Motion),
(3, Motion), (5, Motion)));
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (3, Invalid_Token_ID) & (5,
- Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (True, (Simple, (Int,
- Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken))), (False,
(Simple, (Label => None))), (False, (Simple,
- (Int, Ada_Indent))), (False, (Simple, (Label => None))), (False,
(Simple, (Int, Ada_Indent)))));
- end case;
- end if_expression_1;
-
- procedure if_expression_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Motion),
(3, Motion)));
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (3, Invalid_Token_ID) & (5,
- Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (True, (Simple, (Int,
- Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken))), (False,
(Simple, (Label => None))), (False, (Simple,
- (Int, Ada_Indent))), (False, (Simple, (Label => None)))));
- end case;
- end if_expression_2;
-
- procedure if_expression_3
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Motion),
(3, Motion)));
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (3, Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (True, (Simple, (Int,
- Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken))), (False,
(Simple, (Label => None))), (False, (Simple,
- (Int, Ada_Indent)))));
- end case;
- end if_expression_3;
-
- procedure if_statement_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (3, Motion), (6, Motion), (10,
- Statement_End)));
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (3, Invalid_Token_ID) & (5,
- Invalid_Token_ID) & (6, Invalid_Token_ID) & (10, Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (True, (Hanging_2,
- (Int, Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken)), (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple,
- (Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label
- => None))), (False, (Simple, (Label => None))), (True, (Simple, (Int,
Ada_Indent)), (Simple, (Int,
- Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False,
- (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end if_statement_0;
-
- procedure if_statement_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (3, Motion), (5, Motion), (9,
- Statement_End)));
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (3, Invalid_Token_ID) & (5,
- Invalid_Token_ID) & (9, Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (True, (Hanging_2,
- (Int, Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken)), (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple,
- (Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label
- => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label =>
- None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False,
(Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end if_statement_1;
-
- procedure if_statement_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (3, Motion), (8, Statement_End)));
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (3, Invalid_Token_ID) & (5,
- Invalid_Token_ID) & (8, Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (True, (Hanging_2,
- (Int, Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken)), (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple,
- (Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label
- => None))), (False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple,
- (Int, Ada_Indent_Broken)))));
- end case;
- end if_statement_2;
-
- procedure if_statement_3
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (3, Motion), (7, Statement_End)));
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (3, Invalid_Token_ID) & (7,
- Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (True, (Hanging_2,
- (Int, Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken)), (Simple,
(Int, Ada_Indent_Broken))), (False, (Simple,
- (Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label
- => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False,
(Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end if_statement_3;
-
- procedure incomplete_type_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (6, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3,
2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int,
- Ada_Indent_Broken)))));
- end case;
- end incomplete_type_declaration_0;
-
- procedure incomplete_type_declaration_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (3, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3,
2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken)))));
- end case;
- end incomplete_type_declaration_1;
-
- procedure index_constraint_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 0)))));
- end case;
- end index_constraint_0;
-
- procedure interface_list_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1,
2)));
- when Indent =>
- null;
- end case;
- end interface_list_0;
-
- procedure interface_list_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, 1,
2)));
- when Indent =>
- null;
- end case;
- end interface_list_1;
-
- procedure iteration_scheme_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (True, (Simple, (Int,
- Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end iteration_scheme_0;
-
- procedure iteration_scheme_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (True, (Simple, (Int,
- Ada_Indent_Broken)), (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end iteration_scheme_1;
-
- procedure iterator_specification_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Remove_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => 4));
- when Indent =>
- null;
- end case;
- end iterator_specification_2;
-
- procedure iterator_specification_5
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Remove_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => 3));
- when Indent =>
- null;
- end case;
- end iterator_specification_5;
-
- procedure loop_statement_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (2, Statement_Override), (3,
- Motion), (8, Statement_End)));
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((2,
Invalid_Token_ID) & (3, Invalid_Token_ID) & (8,
- Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (False, (Simple, (Label => None))), (True,
(Simple, (Int, Ada_Indent)), (Simple, (Int,
- Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False,
- (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end loop_statement_0;
-
- function loop_statement_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Nonterm, Recover_Active);
- begin
- return Match_Names (Lexer, Descriptor, Tokens, 1, 7, End_Names_Optional);
- end loop_statement_0_check;
-
- procedure loop_statement_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (2, Statement_Override), (4,
- Motion), (7, Statement_End)));
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((2,
Invalid_Token_ID) & (4, Invalid_Token_ID) & (7,
- Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label
- => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False,
(Simple, (Int, Ada_Indent_Broken))), (False,
- (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end loop_statement_1;
-
- function loop_statement_1_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Nonterm, Recover_Active);
- begin
- return Match_Names (Lexer, Descriptor, Tokens, 1, 6, End_Names_Optional);
- end loop_statement_1_check;
-
- procedure name_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Anchored_1, 1, Ada_Indent_Broken))), (False, (Hanging_0,
(Anchored_0, 2, 1), (Anchored_0, 2, 1 +
- Ada_Indent_Broken))), (False, (Simple, (Anchored_0, 2, 0)))));
- end case;
- end name_0;
-
- procedure name_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple, (if
- Ada_Indent_Hanging_Rel_Exp then (Anchored_0, 1, Ada_Indent_Broken)
else (Anchored_1, 1,
- Ada_Indent_Broken))))));
- end case;
- end name_1;
-
- function name_2_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Lexer, Recover_Active);
- begin
- return Propagate_Name (Nonterm, Tokens, 1);
- end name_2_check;
-
- procedure name_5
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Mark_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1,
Suffix)));
- when Indent =>
- null;
- end case;
- end name_5;
-
- function name_5_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Lexer, Recover_Active);
- begin
- return Propagate_Name (Nonterm, Tokens, 1);
- end name_5_check;
-
- function name_7_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Lexer, Recover_Active);
- begin
- return Propagate_Name (Nonterm, Tokens, 1);
- end name_7_check;
-
- function name_opt_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Lexer, Recover_Active);
- begin
- return Propagate_Name (Nonterm, Tokens, 1);
- end name_opt_0_check;
-
- procedure null_exclusion_opt_name_type_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, 3,
2)));
- when Indent =>
- null;
- end case;
- end null_exclusion_opt_name_type_0;
-
- procedure null_exclusion_opt_name_type_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, 1,
2)));
- when Indent =>
- null;
- end case;
- end null_exclusion_opt_name_type_1;
-
- procedure null_exclusion_opt_name_type_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 3,
2)));
- when Indent =>
- null;
- end case;
- end null_exclusion_opt_name_type_2;
-
- procedure null_exclusion_opt_name_type_3
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1,
2)));
- when Indent =>
- null;
- end case;
- end null_exclusion_opt_name_type_3;
-
- procedure null_procedure_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (2, Statement_Override), (6,
- Statement_End)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int, Ada_Indent_Broken))),
- (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end null_procedure_declaration_0;
-
- procedure object_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (9, Statement_End)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Hanging_3, (Int, Ada_Indent_Broken),
(Int, 2 * Ada_Indent_Broken))), (False,
- (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Anchored_2, 6,
Ada_Indent_Broken))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end object_declaration_0;
-
- procedure object_declaration_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (9, Statement_End)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 6,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end object_declaration_1;
-
- procedure object_declaration_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (9, Statement_End)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 6,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end object_declaration_2;
-
- procedure object_declaration_3
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (7, Statement_End)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Hanging_3, (Int, Ada_Indent_Broken),
(Int, 2 * Ada_Indent_Broken))), (False,
- (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end object_declaration_3;
-
- procedure object_declaration_4
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (7, Statement_End)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end object_declaration_4;
-
- procedure object_declaration_5
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (7, Statement_End)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end object_declaration_5;
-
- procedure object_renaming_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (8, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 1);
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (4, 1,
2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Hanging_3, (Int,
- Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False,
- (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end object_renaming_declaration_0;
-
- procedure object_renaming_declaration_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (7, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 1);
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Hanging_3, (Int, Ada_Indent_Broken),
(Int, 2 * Ada_Indent_Broken))), (False,
- (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end object_renaming_declaration_1;
-
- procedure object_renaming_declaration_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (7, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 1);
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (5, 1,
3)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Hanging_3, (Int, Ada_Indent_Broken),
(Int, 2 * Ada_Indent_Broken))), (False,
- (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end object_renaming_declaration_2;
-
- procedure overriding_indicator_opt_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (2, Statement_Override)));
- when Face =>
- null;
- when Indent =>
- null;
- end case;
- end overriding_indicator_opt_0;
-
- procedure overriding_indicator_opt_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1,
Statement_Start)));
- when Face =>
- null;
- when Indent =>
- null;
- end case;
- end overriding_indicator_opt_1;
-
- procedure package_body_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (5, Motion), (7, Motion), (11,
- Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (5, Invalid_Token_ID) & (7,
- Invalid_Token_ID) & (8, 72) & (11, Invalid_Token_ID)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 1, 1),
(10, 1, 1)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Hanging_3, (Int,
Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken))),
- (False, (Simple, (Label => None))), (False, (Simple, (Label =>
None))), (True, (Simple, (Int, Ada_Indent)),
- (Simple, (Int, Ada_Indent))), (False, (Simple, (Label => None))),
(True, (Simple, (Int, Ada_Indent)), (Simple,
- (Int, Ada_Indent))), (False, (Simple, (Label => None))), (False,
(Hanging_3, (Int, Ada_Indent_Broken), (Int, 2
- * Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end package_body_0;
-
- function package_body_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Nonterm, Recover_Active);
- begin
- return Match_Names (Lexer, Descriptor, Tokens, 3, 10,
End_Names_Optional);
- end package_body_0_check;
-
- procedure package_body_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (5, Motion), (9, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (5, Invalid_Token_ID) & (9,
- Invalid_Token_ID)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 1, 1), (8,
1, 1)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Hanging_3, (Int,
Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken))),
- (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Label
=> None))), (True, (Simple, (Int,
- Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label
=> None))), (False, (Hanging_3, (Int,
- Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken))), (False, (Simple,
(Int, Ada_Indent_Broken)))));
- end case;
- end package_body_1;
-
- function package_body_1_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Nonterm, Recover_Active);
- begin
- return Match_Names (Lexer, Descriptor, Tokens, 3, 8, End_Names_Optional);
- end package_body_1_check;
-
- procedure package_body_stub_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (7, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1,
1)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Hanging_3, (Int,
Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken))),
- (False, (Simple, (Label => None))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end package_body_stub_0;
-
- procedure package_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (2, Statement_End)));
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (2, Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- null;
- end case;
- end package_declaration_0;
-
- procedure package_renaming_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (6, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, 1, 1), (4,
1, 1)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Hanging_3,
- (Int, Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken))), (False,
(Simple, (Int, Ada_Indent_Broken))), (False,
- (Hanging_3, (Int, Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken))),
(False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end package_renaming_declaration_0;
-
- procedure package_specification_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (4, Motion), (6, Motion)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (4, Invalid_Token_ID) & (6,
- Invalid_Token_ID)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, 1, 1), (9,
1, 1)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Hanging_3,
- (Int, Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken))), (False,
(Simple, (Int, Ada_Indent_Broken))), (False,
- (Simple, (Label => None))), (True, (Simple, (Int, Ada_Indent)),
(Simple, (Int, Ada_Indent))), (False, (Simple,
- (Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label
- => None))), (False, (Hanging_3, (Int, Ada_Indent_Broken), (Int, 2 *
Ada_Indent_Broken)))));
- end case;
- end package_specification_0;
-
- function package_specification_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Nonterm, Recover_Active);
- begin
- return Match_Names (Lexer, Descriptor, Tokens, 2, 9, End_Names_Optional);
- end package_specification_0_check;
-
- procedure package_specification_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (4, Motion)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (4, Invalid_Token_ID)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, 1, 1), (7,
1, 1)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Hanging_3,
- (Int, Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken))), (False,
(Simple, (Int, Ada_Indent_Broken))), (False,
- (Simple, (Label => None))), (True, (Simple, (Int, Ada_Indent)),
(Simple, (Int, Ada_Indent))), (False, (Simple,
- (Label => None))), (False, (Hanging_3, (Int, Ada_Indent_Broken),
(Int, 2 * Ada_Indent_Broken)))));
- end case;
- end package_specification_1;
-
- function package_specification_1_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Nonterm, Recover_Active);
- begin
- return Match_Names (Lexer, Descriptor, Tokens, 2, 7, End_Names_Optional);
- end package_specification_1_check;
-
- procedure parameter_and_result_profile_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Language, Ada_Indent_Return_0'Access, 1 & 0)))));
- end case;
- end parameter_and_result_profile_0;
-
- procedure parameter_specification_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (6, 1,
2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Hanging_3, (Int,
- Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False,
- (Simple, (Anchored_1, 7, Ada_Indent_Broken)))));
- end case;
- end parameter_specification_0;
-
- procedure parameter_specification_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (6, 1,
2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Hanging_3, (Int,
- Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken)))));
- end case;
- end parameter_specification_1;
-
- procedure parameter_specification_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Anchored_1, 5,
- Ada_Indent_Broken)))));
- end case;
- end parameter_specification_2;
-
- procedure parameter_specification_3
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken)))));
- end case;
- end parameter_specification_3;
-
- procedure paren_expression_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Hanging_0,
- (Anchored_0, 1, 1), (Anchored_0, 1, 1 + Ada_Indent_Broken))), (False,
(Simple, (Anchored_0, 1, 0)))));
- end case;
- end paren_expression_0;
-
- procedure pragma_g_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (6, Statement_End)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3,
1)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Anchored_0, 3,
- 1))), (False, (Simple, (Anchored_0, 3, 0))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end pragma_g_0;
-
- procedure pragma_g_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (6, Statement_End)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3,
1)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Anchored_0, 3,
- 1))), (False, (Simple, (Anchored_0, 3, 0))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end pragma_g_1;
-
- procedure pragma_g_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (3, Statement_End)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3,
1)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end pragma_g_2;
-
- procedure primary_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, 3,
0)));
- when Indent =>
- null;
- end case;
- end primary_0;
-
- procedure primary_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, (1 => (False,
(Simple, (Language,
- Ada_Indent_Aggregate'Access, Null_Args)))));
- end case;
- end primary_2;
-
- procedure primary_4
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 1,
2)));
- when Indent =>
- null;
- end case;
- end primary_4;
-
- procedure private_extension_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (12, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3,
2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False,
(Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end private_extension_declaration_0;
-
- procedure private_type_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (8, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3,
2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None))),
- (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple,
- (Label => None))), (False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end private_type_declaration_0;
-
- procedure procedure_call_statement_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (2, Statement_End)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False,
(Hanging_1, (Label => None), (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end procedure_call_statement_0;
-
- procedure procedure_specification_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1,
Statement_Start)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 1,
1)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Hanging_3,
- (Int, Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken))), (False,
(Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end procedure_specification_0;
-
- function procedure_specification_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Lexer, Recover_Active);
- begin
- return Propagate_Name (Nonterm, Tokens, 2);
- end procedure_specification_0_check;
-
- procedure protected_body_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (5, Motion), (9, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (5, Invalid_Token_ID) & (9,
- Invalid_Token_ID)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 3, 2), (8,
3, 2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Label => None))),
- (False, (Simple, (Label => None))), (False, (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label => None))),
- (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end protected_body_0;
-
- function protected_body_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Nonterm, Recover_Active);
- begin
- return Match_Names (Lexer, Descriptor, Tokens, 3, 8, End_Names_Optional);
- end protected_body_0_check;
-
- procedure protected_body_stub_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (7, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 3,
2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end protected_body_stub_0;
-
- procedure protected_definition_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2,
Motion)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (5, 3,
2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((True, (Simple,
(Int, Ada_Indent)), (Simple, (Int,
- Ada_Indent))), (False, (Simple, (Label => None))), (True, (Simple,
(Int, Ada_Indent)), (Simple, (Int,
- Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple,
(Label => None)))));
- end case;
- end protected_definition_0;
-
- function protected_definition_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Lexer, Recover_Active);
- begin
- return Propagate_Name (Nonterm, Tokens, 5);
- end protected_definition_0_check;
-
- procedure protected_definition_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 3,
2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((True, (Simple,
(Int, Ada_Indent)), (Simple, (Int,
- Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple,
(Label => None)))));
- end case;
- end protected_definition_1;
-
- function protected_definition_1_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Lexer, Recover_Active);
- begin
- return Propagate_Name (Nonterm, Tokens, 3);
- end protected_definition_1_check;
-
- procedure protected_type_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (6, Motion), (11,
- Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (6, Invalid_Token_ID) & (10, 49) &
- (11, Invalid_Token_ID)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 3,
2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False,
(Simple, (Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False,
(Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end protected_type_declaration_0;
-
- function protected_type_declaration_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Nonterm, Recover_Active);
- begin
- return Match_Names (Lexer, Descriptor, Tokens, 3, 10,
End_Names_Optional);
- end protected_type_declaration_0_check;
-
- procedure protected_type_declaration_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (6, Motion), (8, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (6, Invalid_Token_ID) & (7, 49) &
- (8, Invalid_Token_ID)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 3,
2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Label => None))), (True,
(Simple, (Label => None)), (Simple, (Int,
- Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple,
(Int, Ada_Indent_Broken)))));
- end case;
- end protected_type_declaration_1;
-
- function protected_type_declaration_1_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Nonterm, Recover_Active);
- begin
- return Match_Names (Lexer, Descriptor, Tokens, 3, 7, End_Names_Optional);
- end protected_type_declaration_1_check;
-
- procedure qualified_expression_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, 1,
2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (False, (Simple, (if Ada_Indent_Hanging_Rel_Exp
then (Anchored_0, 1, Ada_Indent_Broken)
- else (Anchored_1, 1, Ada_Indent_Broken))))));
- end case;
- end qualified_expression_0;
-
- procedure quantified_expression_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 4,
Ada_Indent_Broken)))));
- end case;
- end quantified_expression_0;
-
- procedure raise_expression_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Anchored_1, 3,
- Ada_Indent_Broken)))));
- end case;
- end raise_expression_0;
-
- procedure raise_statement_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (5, Statement_End)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Hanging_3,
- (Int, Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken))), (False,
(Simple, (Int, Ada_Indent_Broken))), (False,
- (Simple, (Anchored_1, 3, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end raise_statement_0;
-
- procedure raise_statement_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (3, Statement_End)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Hanging_3,
- (Int, Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken))), (False,
(Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end raise_statement_1;
-
- procedure raise_statement_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (2, Statement_End)));
- when Face =>
- null;
- when Indent =>
- null;
- end case;
- end raise_statement_2;
-
- procedure range_g_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Anchored_0, 4, 1))), (False,
(Simple, (Anchored_0, 4, 0)))));
- end case;
- end range_g_0;
-
- procedure record_definition_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((True, (Simple,
(Language, Ada_Indent_Record_1'Access, 69
- & 1 & 0)), (Simple, (Language, Ada_Indent_Record_1'Access, 69 & 1 &
Ada_Indent))), (True, (Simple, (Language,
- Ada_Indent_Record_1'Access, 69 & 1 & Ada_Indent)), (Simple,
(Language, Ada_Indent_Record_1'Access, 69 & 1 &
- Ada_Indent))), (False, (Simple, (Language,
Ada_Indent_Record_1'Access, 69 & 1 & 0))), (False, (Simple, (Label
- => None)))));
- end case;
- end record_definition_0;
-
- procedure record_representation_clause_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (5, Statement_End)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 1,
2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Hanging_3,
- (Int, Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken))), (False,
(Simple, (Int, Ada_Indent_Broken))), (True,
- (Simple, (Language, Ada_Indent_Record_1'Access, 28 & 4 & 0)),
(Simple, (Language, Ada_Indent_Record_1'Access,
- 28 & 4 & Ada_Indent))), (False, (Simple, (Language,
Ada_Indent_Record_0'Access, 1 & 4 & Ada_Indent))), (True,
- (Simple, (Language, Ada_Indent_Record_1'Access, 28 & 4 &
Ada_Indent)), (Simple, (Language,
- Ada_Indent_Record_1'Access, 28 & 4 & Ada_Indent))), (False, (Simple,
(Language, Ada_Indent_Record_1'Access, 28
- & 4 & 0))), (False, (Simple, (Int, Ada_Indent_Broken))), (False,
(Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end record_representation_clause_0;
-
- procedure requeue_statement_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (5, Statement_End)));
- when Face =>
- null;
- when Indent =>
- null;
- end case;
- end requeue_statement_0;
-
- procedure requeue_statement_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (3, Statement_End)));
- when Face =>
- null;
- when Indent =>
- null;
- end case;
- end requeue_statement_1;
-
- procedure result_profile_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1,
2)));
- when Indent =>
- Indent_Action_1 (Parse_Data, Tree, Nonterm, Tokens, 1, ((False,
(Simple, (Label => None))), (False, (Simple,
- (Anchored_3, 1, Ada_Indent_Broken))), (False, (Simple, (Anchored_4,
1, Ada_Indent_Broken)))));
- end case;
- end result_profile_0;
-
- procedure result_profile_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_1 (Parse_Data, Tree, Nonterm, Tokens, 1, ((False,
(Simple, (Label => None))), (False, (Simple,
- (Anchored_4, 1, Ada_Indent_Broken)))));
- end case;
- end result_profile_1;
-
- procedure selected_component_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Mark_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Prefix),
(3, Suffix)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end selected_component_0;
-
- function selected_component_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Lexer, Recover_Active);
- begin
- return Merge_Names (Nonterm, Tokens, 1, 3);
- end selected_component_0_check;
-
- procedure selected_component_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Mark_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1,
Prefix)));
- when Indent =>
- null;
- end case;
- end selected_component_1;
-
- procedure selected_component_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Mark_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1,
Prefix)));
- when Indent =>
- null;
- end case;
- end selected_component_2;
-
- function selected_component_2_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Lexer, Recover_Active);
- begin
- return Merge_Names (Nonterm, Tokens, 1, 3);
- end selected_component_2_check;
-
- procedure selected_component_3
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Mark_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1,
Prefix)));
- when Indent =>
- null;
- end case;
- end selected_component_3;
-
- procedure selective_accept_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (3, Motion), (7, Statement_End)));
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (2, 43) & (3, Invalid_Token_ID) &
- (7, Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((True, (Simple,
(Label => None)), (Simple, (Int,
- Ada_Indent))), (True, (Simple, (Label => None)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label =>
- None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label => None))),
- (False, (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end selective_accept_0;
-
- procedure selective_accept_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (5, Statement_End)));
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (2, 43) & (5, Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((True, (Simple,
(Label => None)), (Simple, (Int,
- Ada_Indent))), (True, (Simple, (Label => None)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label =>
- None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False,
(Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end selective_accept_1;
-
- procedure select_alternative_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1,
Motion)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent))),
- (False, (Simple, (Int, Ada_Indent)))));
- end case;
- end select_alternative_0;
-
- procedure select_alternative_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, Motion),
(4, Statement_Start), (5, Statement_End)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent))),
- (False, (Simple, (Label => None)))));
- end case;
- end select_alternative_1;
-
- procedure select_alternative_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1,
Motion)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent)))));
- end case;
- end select_alternative_2;
-
- procedure select_alternative_4
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (2, Statement_End)));
- when Face =>
- null;
- when Indent =>
- null;
- end case;
- end select_alternative_4;
-
- procedure select_alternative_list_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2,
Motion)));
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, 43) & (2,
Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (False, (Simple, (Int, Ada_Indent)))));
- end case;
- end select_alternative_list_0;
-
- procedure select_alternative_list_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, (1 => (False,
(Simple, (Int, Ada_Indent)))));
- end case;
- end select_alternative_list_1;
-
- procedure simple_return_statement_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (3, Statement_End)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end simple_return_statement_0;
-
- procedure simple_statement_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (2, Statement_End)));
- when Face =>
- null;
- when Indent =>
- null;
- end case;
- end simple_statement_0;
-
- procedure simple_statement_3
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (3, Statement_End)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3,
0)));
- when Indent =>
- null;
- end case;
- end simple_statement_3;
-
- procedure simple_statement_8
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (3, Statement_End)));
- when Face =>
- null;
- when Indent =>
- null;
- end case;
- end simple_statement_8;
-
- procedure single_protected_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (4, Motion), (7, Motion), (9,
- Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (4, Invalid_Token_ID) & (7,
- Invalid_Token_ID) & (8, 49) & (9, Invalid_Token_ID)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3,
2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))),
(False, (Simple, (Label => None))), (False,
- (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False,
(Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end single_protected_declaration_0;
-
- function single_protected_declaration_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Nonterm, Recover_Active);
- begin
- return Match_Names (Lexer, Descriptor, Tokens, 2, 8, End_Names_Optional);
- end single_protected_declaration_0_check;
-
- procedure single_protected_declaration_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (4, Motion), (6, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (4, Invalid_Token_ID) & (5, 49) &
- (6, Invalid_Token_ID)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3,
2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))),
(True, (Simple, (Label => None)), (Simple,
- (Int, Ada_Indent))), (False, (Simple, (Label => None))), (False,
(Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end single_protected_declaration_1;
-
- function single_protected_declaration_1_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Nonterm, Recover_Active);
- begin
- return Match_Names (Lexer, Descriptor, Tokens, 2, 5, End_Names_Optional);
- end single_protected_declaration_1_check;
-
- procedure single_task_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (4, Motion), (11,
- Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (4, Invalid_Token_ID) & (8, 49) &
- (11, Invalid_Token_ID)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, 3, 2), (9,
3, 2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))),
(False, (Simple, (Label => None))), (False,
- (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False,
(Simple, (Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end single_task_declaration_0;
-
- function single_task_declaration_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Nonterm, Recover_Active);
- begin
- return Match_Names (Lexer, Descriptor, Tokens, 2, 10,
End_Names_Optional);
- end single_task_declaration_0_check;
-
- procedure single_task_declaration_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (4, Motion), (8, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (4, Invalid_Token_ID) & (5, 49) &
- (8, Invalid_Token_ID)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, 3, 2), (6,
3, 2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))),
(True, (Simple, (Label => None)), (Simple,
- (Int, Ada_Indent))), (False, (Simple, (Label => None))), (False,
(Simple, (Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end single_task_declaration_1;
-
- function single_task_declaration_1_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Nonterm, Recover_Active);
- begin
- return Match_Names (Lexer, Descriptor, Tokens, 2, 7, End_Names_Optional);
- end single_task_declaration_1_check;
-
- procedure single_task_declaration_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (4, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3,
2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken)))));
- end case;
- end single_task_declaration_2;
-
- procedure subprogram_body_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (2, Statement_Override), (4,
- Motion), (6, Motion), (10, Statement_End)));
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (2, Invalid_Token_ID) & (4,
- Invalid_Token_ID) & (6, Invalid_Token_ID) & (7, 72) & (10,
Invalid_Token_ID)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (9, 1,
1)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (True, (Simple,
- (Label => None)), (Simple, (Int, Ada_Indent))), (False, (Simple,
(Label => None))), (False, (Simple, (Label =>
- None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label => None))),
- (True, (Simple, (Int, Ada_Indent)), (Simple, (Int, Ada_Indent))),
(False, (Simple, (Label => None))), (False,
- (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end subprogram_body_0;
-
- function subprogram_body_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Nonterm, Recover_Active);
- begin
- return Match_Names (Lexer, Descriptor, Tokens, 2, 9, End_Names_Optional);
- end subprogram_body_0_check;
-
- procedure subprogram_body_stub_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (2, Statement_Override), (6,
- Statement_End)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (False, (Simple, (Label => None))), (False,
(Simple, (Int, Ada_Indent_Broken))), (False,
- (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end subprogram_body_stub_0;
-
- procedure subprogram_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (2, Statement_Override), (4,
- Statement_End)));
- when Face =>
- null;
- when Indent =>
- null;
- end case;
- end subprogram_declaration_0;
-
- procedure subprogram_default_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, 1,
1)));
- when Indent =>
- null;
- end case;
- end subprogram_default_0;
-
- procedure subprogram_renaming_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (2, Statement_Override), (6,
- Statement_End)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (4, 1,
1)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (False, (Simple, (Language,
Ada_Indent_Renames_0'Access, +2))), (False, (Hanging_3, (Int,
- Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken))), (False, (Simple,
(Int, Ada_Indent_Broken))), (False,
- (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end subprogram_renaming_declaration_0;
-
- function subprogram_specification_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Lexer, Recover_Active);
- begin
- return Propagate_Name (Nonterm, Tokens, 1);
- end subprogram_specification_0_check;
-
- function subprogram_specification_1_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Lexer, Recover_Active);
- begin
- return Propagate_Name (Nonterm, Tokens, 1);
- end subprogram_specification_1_check;
-
- procedure subtype_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (6, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 3,
2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False,
(Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end subtype_declaration_0;
-
- procedure subtype_indication_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1,
2)));
- when Indent =>
- null;
- end case;
- end subtype_indication_0;
-
- procedure subtype_indication_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 1,
2)));
- when Indent =>
- null;
- end case;
- end subtype_indication_1;
-
- procedure subtype_indication_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, 1,
2)));
- when Indent =>
- null;
- end case;
- end subtype_indication_2;
-
- procedure subtype_indication_3
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1, 1,
2)));
- when Indent =>
- null;
- end case;
- end subtype_indication_3;
-
- procedure subunit_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (5, Statement_Override)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Hanging_3,
- (Int, Ada_Indent_Broken), (Int, 2 * Ada_Indent_Broken))), (False,
(Simple, (Anchored_0, 2, 1))), (False,
- (Simple, (Anchored_0, 2, 0))), (False, (Simple, (Label => None)))));
- end case;
- end subunit_0;
-
- procedure task_body_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (5, Motion), (7, Motion), (11,
- Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (5, Invalid_Token_ID) & (7,
- Invalid_Token_ID) & (8, 72) & (11, Invalid_Token_ID)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 3, 2),
(10, 3, 2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Label => None))), (False,
- (Simple, (Label => None))), (True, (Simple, (Int, Ada_Indent)),
(Simple, (Int, Ada_Indent))), (False, (Simple,
- (Label => None))), (True, (Simple, (Int, Ada_Indent)), (Simple, (Int,
Ada_Indent))), (False, (Simple, (Label
- => None))), (False, (Simple, (Int, Ada_Indent_Broken))), (False,
(Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end task_body_0;
-
- function task_body_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Nonterm, Recover_Active);
- begin
- return Match_Names (Lexer, Descriptor, Tokens, 3, 10,
End_Names_Optional);
- end task_body_0_check;
-
- procedure task_body_stub_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (7, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 3,
2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Label => None))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Label => None))), (False,
- (Simple, (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken)))));
- end case;
- end task_body_stub_0;
-
- procedure task_definition_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2,
Motion)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((True, (Simple,
(Int, Ada_Indent)), (Simple, (Int,
- Ada_Indent))), (False, (Simple, (Label => None))), (True, (Simple,
(Int, Ada_Indent)), (Simple, (Int,
- Ada_Indent)))));
- end case;
- end task_definition_0;
-
- procedure task_definition_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- null;
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, (1 => (True,
(Simple, (Int, Ada_Indent)), (Simple, (Int,
- Ada_Indent)))));
- end case;
- end task_definition_1;
-
- procedure task_type_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (6, Motion), (9, Motion), (13,
- Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (6, Invalid_Token_ID) & (9,
- Invalid_Token_ID) & (10, 49) & (13, Invalid_Token_ID)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 3, 2),
(12, 3, 2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False,
(Simple, (Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Label => None))), (False,
(Simple, (Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end task_type_declaration_0;
-
- function task_type_declaration_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Nonterm, Recover_Active);
- begin
- return Match_Names (Lexer, Descriptor, Tokens, 3, 12,
End_Names_Optional);
- end task_type_declaration_0_check;
-
- procedure task_type_declaration_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (6, Motion), (10,
- Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (6, Invalid_Token_ID) & (7, 49) &
- (10, Invalid_Token_ID)));
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((3, 3, 2), (9,
3, 2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Label => None))), (True,
(Simple, (Label => None)), (Simple, (Int,
- Ada_Indent))), (False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end task_type_declaration_1;
-
- function task_type_declaration_1_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
- is
- pragma Unreferenced (Nonterm, Recover_Active);
- begin
- return Match_Names (Lexer, Descriptor, Tokens, 3, 9, End_Names_Optional);
- end task_type_declaration_1_check;
-
- procedure task_type_declaration_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (6, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 3);
- when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3, 3,
2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken))),
(False, (Simple, (Int,
- Ada_Indent_Broken)))));
- end case;
- end task_type_declaration_2;
-
- procedure timed_entry_call_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (3, Motion), (6, Statement_End)));
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (3, Invalid_Token_ID) & (6,
- Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (True, (Simple, (Int,
- Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label
=> None))), (True, (Simple, (Int,
- Ada_Indent)), (Simple, (Int, Ada_Indent))), (False, (Simple, (Label
=> None))), (False, (Simple, (Int,
- Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end timed_entry_call_0;
-
- procedure variant_part_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (7, Statement_End)));
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (4, Invalid_Token_ID) & (7,
- Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Label => None))),
(False, (Simple, (Int, Ada_Indent_When))),
- (False, (Simple, (Label => None))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Broken)))));
- end case;
- end variant_part_0;
-
- procedure variant_list_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Motion_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Invalid_Token_ID) & (2, Invalid_Token_ID)));
- when Face =>
- null;
- when Indent =>
- null;
- end case;
- end variant_list_0;
-
- procedure variant_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1,
Motion)));
- when Face =>
- null;
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Hanging_0,
- (Label => None), (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent))), (True, (Simple, (Int,
- Ada_Indent)), (Simple, (Int, Ada_Indent)))));
- end case;
- end variant_0;
-
- procedure use_clause_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (5, Statement_End)));
- when Face =>
- Face_Apply_List_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (4,
1, 2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_Use))), (False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end use_clause_0;
-
- procedure use_clause_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (4, Statement_End)));
- when Face =>
- Face_Apply_List_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3,
1, 2)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int, Ada_Indent_Use))),
(False, (Simple, (Int,
- Ada_Indent_Broken)))));
- end case;
- end use_clause_1;
-
- procedure use_clause_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (3, Statement_End)));
- when Face =>
- Face_Apply_List_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2,
1, 1)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Use))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end use_clause_2;
-
- procedure with_clause_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (5, Statement_End)));
- when Face =>
- Face_Apply_List_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (4,
1, 1)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_Broken))), (False, (Simple, (Int,
- Ada_Indent_With))), (False, (Simple, (Int, Ada_Indent_Broken)))));
- end case;
- end with_clause_0;
-
- procedure with_clause_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (4, Statement_End)));
- when Face =>
- Face_Apply_List_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3,
1, 1)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_With))), (False, (Simple, (Int,
- Ada_Indent_Broken)))));
- end case;
- end with_clause_1;
-
- procedure with_clause_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (4, Statement_End)));
- when Face =>
- Face_Apply_List_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (3,
1, 1)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_Broken))), (False, (Simple, (Int,
Ada_Indent_With))), (False, (Simple, (Int,
- Ada_Indent_Broken)))));
- end case;
- end with_clause_2;
-
- procedure with_clause_3
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
- is
- Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
- begin
- case Parse_Data.Post_Parse_Action is
- when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (3, Statement_End)));
- when Face =>
- Face_Apply_List_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2,
1, 1)));
- when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Label => None))), (False, (Simple,
- (Int, Ada_Indent_With))), (False, (Simple, (Int,
Ada_Indent_Broken)))));
- end case;
- end with_clause_3;
-
-end Ada_Process_Actions;
diff --git a/ada_process_actions.ads b/ada_process_actions.ads
deleted file mode 100644
index 3266c0bd38..0000000000
--- a/ada_process_actions.ads
+++ /dev/null
@@ -1,2108 +0,0 @@
--- generated parser support file.
--- command line: wisitoken-bnf-generate.exe --generate LR1 Ada_Emacs re2c
PROCESS text_rep ada.wy
---
-
--- Copyright (C) 2013 - 2020 Free Software Foundation, Inc.
-
--- This program is free software; you can redistribute it and/or
--- modify it under the terms of the GNU General Public License as
--- published by the Free Software Foundation; either version 3, or (at
--- your option) any later version.
---
--- This software is distributed in the hope that it will be useful,
--- but WITHOUT ANY WARRANTY; without even the implied warranty of
--- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
--- General Public License for more details.
---
--- You should have received a copy of the GNU General Public License
--- along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>.
-
-with WisiToken.Syntax_Trees;
-with WisiToken.Lexer;
-with WisiToken.Semantic_Checks;
-package Ada_Process_Actions is
-
- Descriptor : aliased WisiToken.Descriptor :=
- (First_Terminal => 3,
- Last_Terminal => 110,
- First_Nonterminal => 111,
- Last_Nonterminal => 335,
- EOI_ID => 110,
- Accept_ID => 111,
- Case_Insensitive => True,
- New_Line_ID => 1,
- String_1_ID => 109,
- String_2_ID => 108,
- Image =>
- (new String'("WHITESPACE"),
- new String'("NEW_LINE"),
- new String'("COMMENT"),
- new String'("ABS"),
- new String'("ACCEPT"),
- new String'("ABORT"),
- new String'("ABSTRACT"),
- new String'("ACCESS"),
- new String'("ALIASED"),
- new String'("ALL"),
- new String'("AND"),
- new String'("ARRAY"),
- new String'("AT"),
- new String'("BEGIN"),
- new String'("BODY"),
- new String'("CASE"),
- new String'("CONSTANT"),
- new String'("DECLARE"),
- new String'("DELAY"),
- new String'("DELTA"),
- new String'("DIGITS"),
- new String'("DO"),
- new String'("ELSE"),
- new String'("ELSIF"),
- new String'("END"),
- new String'("ENTRY"),
- new String'("EXCEPTION"),
- new String'("EXIT"),
- new String'("FOR"),
- new String'("FUNCTION"),
- new String'("GENERIC"),
- new String'("GOTO"),
- new String'("IF"),
- new String'("IN"),
- new String'("INTERFACE"),
- new String'("IS"),
- new String'("LIMITED"),
- new String'("LOOP"),
- new String'("MOD"),
- new String'("NEW"),
- new String'("NOT"),
- new String'("NULL"),
- new String'("OF"),
- new String'("OR"),
- new String'("OTHERS"),
- new String'("OUT"),
- new String'("OVERRIDING"),
- new String'("PACKAGE"),
- new String'("PRAGMA"),
- new String'("PRIVATE"),
- new String'("PROCEDURE"),
- new String'("PROTECTED"),
- new String'("RAISE"),
- new String'("RANGE"),
- new String'("RECORD"),
- new String'("REM"),
- new String'("RENAMES"),
- new String'("REQUEUE"),
- new String'("RETURN"),
- new String'("REVERSE"),
- new String'("SEPARATE"),
- new String'("SELECT"),
- new String'("SOME"),
- new String'("SUBTYPE"),
- new String'("SYNCHRONIZED"),
- new String'("TAGGED"),
- new String'("TASK"),
- new String'("TERMINATE"),
- new String'("THEN"),
- new String'("TYPE"),
- new String'("UNTIL"),
- new String'("USE"),
- new String'("WHEN"),
- new String'("WHILE"),
- new String'("WITH"),
- new String'("XOR"),
- new String'("LEFT_PAREN"),
- new String'("LEFT_SQUARE_BRACKET"),
- new String'("RIGHT_PAREN"),
- new String'("RIGHT_SQUARE_BRACKET"),
- new String'("AMPERSAND"),
- new String'("AT_SIGN"),
- new String'("BAR"),
- new String'("BOX"),
- new String'("COLON"),
- new String'("COLON_EQUAL"),
- new String'("COMMA"),
- new String'("DOT"),
- new String'("DOT_DOT"),
- new String'("EQUAL"),
- new String'("EQUAL_GREATER"),
- new String'("GREATER"),
- new String'("GREATER_EQUAL"),
- new String'("GREATER_GREATER"),
- new String'("LESS"),
- new String'("LESS_EQUAL"),
- new String'("LESS_LESS"),
- new String'("MINUS"),
- new String'("PLUS"),
- new String'("SEMICOLON"),
- new String'("SLASH"),
- new String'("SLASH_EQUAL"),
- new String'("STAR"),
- new String'("STAR_STAR"),
- new String'("TICK_1"),
- new String'("TICK_2"),
- new String'("NUMERIC_LITERAL"),
- new String'("IDENTIFIER"),
- new String'("STRING_LITERAL"),
- new String'("CHARACTER_LITERAL"),
- new String'("Wisi_EOI"),
- new String'("wisitoken_accept"),
- new String'("abstract_limited_synchronized_opt"),
- new String'("abstract_limited_opt"),
- new String'("abstract_tagged_limited_opt"),
- new String'("abstract_subprogram_declaration"),
- new String'("accept_statement"),
- new String'("access_definition"),
- new String'("actual_parameter_part"),
- new String'("actual_parameter_part_opt"),
- new String'("aggregate"),
- new String'("aliased_opt"),
- new String'("and_interface_list_opt"),
- new String'("array_type_definition"),
- new String'("aspect_clause"),
- new String'("aspect_specification_opt"),
- new String'("assignment_statement"),
- new String'("association_opt"),
- new String'("association_list"),
- new String'("asynchronous_select"),
- new String'("at_clause"),
- new String'("attribute_reference"),
- new String'("attribute_designator"),
- new String'("binary_adding_operator"),
- new String'("block_label"),
- new String'("block_label_opt"),
- new String'("block_statement"),
- new String'("body_g"),
- new String'("body_stub"),
- new String'("case_expression"),
- new String'("case_expression_alternative"),
- new String'("case_expression_alternative_list"),
- new String'("case_statement"),
- new String'("case_statement_alternative"),
- new String'("case_statement_alternative_list"),
- new String'("compilation_unit"),
- new String'("compilation"),
- new String'("component_clause"),
- new String'("component_clause_list"),
- new String'("component_declaration"),
- new String'("component_definition"),
- new String'("component_item"),
- new String'("component_list"),
- new String'("component_list_opt"),
- new String'("compound_statement"),
- new String'("conditional_entry_call"),
- new String'("conditional_quantified_expression"),
- new String'("constant_opt"),
- new String'("constraint"),
- new String'("constraint_opt"),
- new String'("declaration"),
- new String'("declarations"),
- new String'("declarative_part_opt"),
- new String'("delay_alternative"),
- new String'("delay_statement"),
- new String'("derived_type_definition"),
- new String'("direct_name"),
- new String'("direct_name_opt"),
- new String'("discrete_choice"),
- new String'("discrete_choice_list"),
- new String'("discrete_subtype_definition"),
- new String'("discrete_subtype_definition_list"),
- new String'("discriminant_part_opt"),
- new String'("discriminant_specification_opt"),
- new String'("discriminant_specification_list"),
- new String'("elsif_expression_item"),
- new String'("elsif_expression_list"),
- new String'("elsif_statement_item"),
- new String'("elsif_statement_list"),
- new String'("entry_body"),
- new String'("entry_body_formal_part"),
- new String'("entry_call_alternative"),
- new String'("entry_declaration"),
- new String'("enumeration_literal"),
- new String'("enumeration_literal_list"),
- new String'("enumeration_representation_clause"),
- new String'("enumeration_type_definition"),
- new String'("exception_choice"),
- new String'("exception_choice_list"),
- new String'("exception_declaration"),
- new String'("exception_handler"),
- new String'("exception_handler_list"),
- new String'("exception_handler_list_opt"),
- new String'("exit_statement"),
- new String'("expression"),
- new String'("expression_opt"),
- new String'("expression_function_declaration"),
- new String'("extended_return_object_declaration"),
- new String'("extended_return_object_declaration_opt"),
- new String'("extended_return_statement"),
- new String'("factor"),
- new String'("formal_object_declaration"),
- new String'("formal_part"),
- new String'("formal_subprogram_declaration"),
- new String'("formal_type_declaration"),
- new String'("formal_type_definition"),
- new String'("formal_derived_type_definition"),
- new String'("formal_package_declaration"),
- new String'("formal_package_actual_part"),
- new String'("full_type_declaration"),
- new String'("function_specification"),
- new String'("general_access_modifier_opt"),
- new String'("generic_declaration"),
- new String'("generic_formal_part"),
- new String'("generic_formal_parameter_declarations"),
- new String'("generic_formal_parameter_declaration"),
- new String'("generic_instantiation"),
- new String'("generic_package_declaration"),
- new String'("generic_renaming_declaration"),
- new String'("generic_subprogram_declaration"),
- new String'("goto_label"),
- new String'("handled_sequence_of_statements"),
- new String'("identifier_list"),
- new String'("identifier_opt"),
- new String'("if_expression"),
- new String'("if_statement"),
- new String'("incomplete_type_declaration"),
- new String'("index_constraint"),
- new String'("index_subtype_definition"),
- new String'("index_subtype_definition_list"),
- new String'("interface_list"),
- new String'("interface_type_definition"),
- new String'("iteration_scheme"),
- new String'("iterator_specification"),
- new String'("iterator_specification_opt"),
- new String'("loop_statement"),
- new String'("membership_choice_list"),
- new String'("membership_choice"),
- new String'("mod_clause_opt"),
- new String'("mode_opt"),
- new String'("multiplying_operator"),
- new String'("name_list"),
- new String'("name"),
- new String'("name_opt"),
- new String'("null_exclusion_opt"),
- new String'("null_exclusion_opt_name_type"),
- new String'("null_procedure_declaration"),
- new String'("object_declaration"),
- new String'("object_renaming_declaration"),
- new String'("overriding_indicator_opt"),
- new String'("package_body"),
- new String'("package_body_stub"),
- new String'("package_declaration"),
- new String'("package_renaming_declaration"),
- new String'("package_specification"),
- new String'("parameter_and_result_profile"),
- new String'("parameter_profile_opt"),
- new String'("parameter_specification"),
- new String'("parameter_specification_list"),
- new String'("paren_expression"),
- new String'("pragma_g"),
- new String'("primary"),
- new String'("private_extension_declaration"),
- new String'("private_type_declaration"),
- new String'("procedure_call_statement"),
- new String'("procedure_specification"),
- new String'("proper_body"),
- new String'("protected_body"),
- new String'("protected_body_stub"),
- new String'("protected_definition"),
- new String'("protected_operation_item"),
- new String'("protected_operation_item_list"),
- new String'("protected_operation_item_list_opt"),
- new String'("protected_opt"),
- new String'("protected_type_declaration"),
- new String'("qualified_expression"),
- new String'("quantified_expression"),
- new String'("quantifier"),
- new String'("raise_expression"),
- new String'("raise_statement"),
- new String'("range_g"),
- new String'("range_list"),
- new String'("real_range_specification_opt"),
- new String'("record_definition"),
- new String'("record_representation_clause"),
- new String'("relation_and_list"),
- new String'("relation_and_then_list"),
- new String'("relation_or_list"),
- new String'("relation_or_else_list"),
- new String'("relation_xor_list"),
- new String'("relation"),
- new String'("relational_operator"),
- new String'("renaming_declaration"),
- new String'("requeue_statement"),
- new String'("result_profile"),
- new String'("return_subtype_indication"),
- new String'("selected_component"),
- new String'("selective_accept"),
- new String'("select_alternative"),
- new String'("select_alternative_list"),
- new String'("select_alternative_list_opt"),
- new String'("select_statement"),
- new String'("sequence_of_statements"),
- new String'("sequence_of_statements_opt"),
- new String'("simple_expression"),
- new String'("simple_return_statement"),
- new String'("simple_statement"),
- new String'("single_protected_declaration"),
- new String'("single_task_declaration"),
- new String'("statement"),
- new String'("subprogram_body"),
- new String'("subprogram_body_stub"),
- new String'("subprogram_declaration"),
- new String'("subprogram_default"),
- new String'("subprogram_renaming_declaration"),
- new String'("subprogram_specification"),
- new String'("subtype_declaration"),
- new String'("subtype_indication"),
- new String'("subunit"),
- new String'("task_body"),
- new String'("task_body_stub"),
- new String'("task_definition"),
- new String'("task_type_declaration"),
- new String'("term"),
- new String'("term_list"),
- new String'("tick"),
- new String'("timed_entry_call"),
- new String'("triggering_alternative"),
- new String'("type_declaration"),
- new String'("type_definition"),
- new String'("variant_part"),
- new String'("variant_list"),
- new String'("variant"),
- new String'("unary_adding_operator"),
- new String'("use_clause"),
- new String'("with_clause")),
- Terminal_Image_Width => 20,
- Image_Width => 38,
- Last_Lookahead => 110);
-
- type Token_Enum_ID is
- (WHITESPACE_ID,
- NEW_LINE_ID,
- COMMENT_ID,
- ABS_ID,
- ACCEPT_ID,
- ABORT_ID,
- ABSTRACT_ID,
- ACCESS_ID,
- ALIASED_ID,
- ALL_ID,
- AND_ID,
- ARRAY_ID,
- AT_ID,
- BEGIN_ID,
- BODY_ID,
- CASE_ID,
- CONSTANT_ID,
- DECLARE_ID,
- DELAY_ID,
- DELTA_ID,
- DIGITS_ID,
- DO_ID,
- ELSE_ID,
- ELSIF_ID,
- END_ID,
- ENTRY_ID,
- EXCEPTION_ID,
- EXIT_ID,
- FOR_ID,
- FUNCTION_ID,
- GENERIC_ID,
- GOTO_ID,
- IF_ID,
- IN_ID,
- INTERFACE_ID,
- IS_ID,
- LIMITED_ID,
- LOOP_ID,
- MOD_ID,
- NEW_ID,
- NOT_ID,
- NULL_ID,
- OF_ID,
- OR_ID,
- OTHERS_ID,
- OUT_ID,
- OVERRIDING_ID,
- PACKAGE_ID,
- PRAGMA_ID,
- PRIVATE_ID,
- PROCEDURE_ID,
- PROTECTED_ID,
- RAISE_ID,
- RANGE_ID,
- RECORD_ID,
- REM_ID,
- RENAMES_ID,
- REQUEUE_ID,
- RETURN_ID,
- REVERSE_ID,
- SEPARATE_ID,
- SELECT_ID,
- SOME_ID,
- SUBTYPE_ID,
- SYNCHRONIZED_ID,
- TAGGED_ID,
- TASK_ID,
- TERMINATE_ID,
- THEN_ID,
- TYPE_ID,
- UNTIL_ID,
- USE_ID,
- WHEN_ID,
- WHILE_ID,
- WITH_ID,
- XOR_ID,
- LEFT_PAREN_ID,
- LEFT_SQUARE_BRACKET_ID,
- RIGHT_PAREN_ID,
- RIGHT_SQUARE_BRACKET_ID,
- AMPERSAND_ID,
- AT_SIGN_ID,
- BAR_ID,
- BOX_ID,
- COLON_ID,
- COLON_EQUAL_ID,
- COMMA_ID,
- DOT_ID,
- DOT_DOT_ID,
- EQUAL_ID,
- EQUAL_GREATER_ID,
- GREATER_ID,
- GREATER_EQUAL_ID,
- GREATER_GREATER_ID,
- LESS_ID,
- LESS_EQUAL_ID,
- LESS_LESS_ID,
- MINUS_ID,
- PLUS_ID,
- SEMICOLON_ID,
- SLASH_ID,
- SLASH_EQUAL_ID,
- STAR_ID,
- STAR_STAR_ID,
- TICK_1_ID,
- TICK_2_ID,
- NUMERIC_LITERAL_ID,
- IDENTIFIER_ID,
- STRING_LITERAL_ID,
- CHARACTER_LITERAL_ID,
- Wisi_EOI_ID,
- wisitoken_accept_ID,
- abstract_limited_synchronized_opt_ID,
- abstract_limited_opt_ID,
- abstract_tagged_limited_opt_ID,
- abstract_subprogram_declaration_ID,
- accept_statement_ID,
- access_definition_ID,
- actual_parameter_part_ID,
- actual_parameter_part_opt_ID,
- aggregate_ID,
- aliased_opt_ID,
- and_interface_list_opt_ID,
- array_type_definition_ID,
- aspect_clause_ID,
- aspect_specification_opt_ID,
- assignment_statement_ID,
- association_opt_ID,
- association_list_ID,
- asynchronous_select_ID,
- at_clause_ID,
- attribute_reference_ID,
- attribute_designator_ID,
- binary_adding_operator_ID,
- block_label_ID,
- block_label_opt_ID,
- block_statement_ID,
- body_g_ID,
- body_stub_ID,
- case_expression_ID,
- case_expression_alternative_ID,
- case_expression_alternative_list_ID,
- case_statement_ID,
- case_statement_alternative_ID,
- case_statement_alternative_list_ID,
- compilation_unit_ID,
- compilation_ID,
- component_clause_ID,
- component_clause_list_ID,
- component_declaration_ID,
- component_definition_ID,
- component_item_ID,
- component_list_ID,
- component_list_opt_ID,
- compound_statement_ID,
- conditional_entry_call_ID,
- conditional_quantified_expression_ID,
- constant_opt_ID,
- constraint_ID,
- constraint_opt_ID,
- declaration_ID,
- declarations_ID,
- declarative_part_opt_ID,
- delay_alternative_ID,
- delay_statement_ID,
- derived_type_definition_ID,
- direct_name_ID,
- direct_name_opt_ID,
- discrete_choice_ID,
- discrete_choice_list_ID,
- discrete_subtype_definition_ID,
- discrete_subtype_definition_list_ID,
- discriminant_part_opt_ID,
- discriminant_specification_opt_ID,
- discriminant_specification_list_ID,
- elsif_expression_item_ID,
- elsif_expression_list_ID,
- elsif_statement_item_ID,
- elsif_statement_list_ID,
- entry_body_ID,
- entry_body_formal_part_ID,
- entry_call_alternative_ID,
- entry_declaration_ID,
- enumeration_literal_ID,
- enumeration_literal_list_ID,
- enumeration_representation_clause_ID,
- enumeration_type_definition_ID,
- exception_choice_ID,
- exception_choice_list_ID,
- exception_declaration_ID,
- exception_handler_ID,
- exception_handler_list_ID,
- exception_handler_list_opt_ID,
- exit_statement_ID,
- expression_ID,
- expression_opt_ID,
- expression_function_declaration_ID,
- extended_return_object_declaration_ID,
- extended_return_object_declaration_opt_ID,
- extended_return_statement_ID,
- factor_ID,
- formal_object_declaration_ID,
- formal_part_ID,
- formal_subprogram_declaration_ID,
- formal_type_declaration_ID,
- formal_type_definition_ID,
- formal_derived_type_definition_ID,
- formal_package_declaration_ID,
- formal_package_actual_part_ID,
- full_type_declaration_ID,
- function_specification_ID,
- general_access_modifier_opt_ID,
- generic_declaration_ID,
- generic_formal_part_ID,
- generic_formal_parameter_declarations_ID,
- generic_formal_parameter_declaration_ID,
- generic_instantiation_ID,
- generic_package_declaration_ID,
- generic_renaming_declaration_ID,
- generic_subprogram_declaration_ID,
- goto_label_ID,
- handled_sequence_of_statements_ID,
- identifier_list_ID,
- identifier_opt_ID,
- if_expression_ID,
- if_statement_ID,
- incomplete_type_declaration_ID,
- index_constraint_ID,
- index_subtype_definition_ID,
- index_subtype_definition_list_ID,
- interface_list_ID,
- interface_type_definition_ID,
- iteration_scheme_ID,
- iterator_specification_ID,
- iterator_specification_opt_ID,
- loop_statement_ID,
- membership_choice_list_ID,
- membership_choice_ID,
- mod_clause_opt_ID,
- mode_opt_ID,
- multiplying_operator_ID,
- name_list_ID,
- name_ID,
- name_opt_ID,
- null_exclusion_opt_ID,
- null_exclusion_opt_name_type_ID,
- null_procedure_declaration_ID,
- object_declaration_ID,
- object_renaming_declaration_ID,
- overriding_indicator_opt_ID,
- package_body_ID,
- package_body_stub_ID,
- package_declaration_ID,
- package_renaming_declaration_ID,
- package_specification_ID,
- parameter_and_result_profile_ID,
- parameter_profile_opt_ID,
- parameter_specification_ID,
- parameter_specification_list_ID,
- paren_expression_ID,
- pragma_g_ID,
- primary_ID,
- private_extension_declaration_ID,
- private_type_declaration_ID,
- procedure_call_statement_ID,
- procedure_specification_ID,
- proper_body_ID,
- protected_body_ID,
- protected_body_stub_ID,
- protected_definition_ID,
- protected_operation_item_ID,
- protected_operation_item_list_ID,
- protected_operation_item_list_opt_ID,
- protected_opt_ID,
- protected_type_declaration_ID,
- qualified_expression_ID,
- quantified_expression_ID,
- quantifier_ID,
- raise_expression_ID,
- raise_statement_ID,
- range_g_ID,
- range_list_ID,
- real_range_specification_opt_ID,
- record_definition_ID,
- record_representation_clause_ID,
- relation_and_list_ID,
- relation_and_then_list_ID,
- relation_or_list_ID,
- relation_or_else_list_ID,
- relation_xor_list_ID,
- relation_ID,
- relational_operator_ID,
- renaming_declaration_ID,
- requeue_statement_ID,
- result_profile_ID,
- return_subtype_indication_ID,
- selected_component_ID,
- selective_accept_ID,
- select_alternative_ID,
- select_alternative_list_ID,
- select_alternative_list_opt_ID,
- select_statement_ID,
- sequence_of_statements_ID,
- sequence_of_statements_opt_ID,
- simple_expression_ID,
- simple_return_statement_ID,
- simple_statement_ID,
- single_protected_declaration_ID,
- single_task_declaration_ID,
- statement_ID,
- subprogram_body_ID,
- subprogram_body_stub_ID,
- subprogram_declaration_ID,
- subprogram_default_ID,
- subprogram_renaming_declaration_ID,
- subprogram_specification_ID,
- subtype_declaration_ID,
- subtype_indication_ID,
- subunit_ID,
- task_body_ID,
- task_body_stub_ID,
- task_definition_ID,
- task_type_declaration_ID,
- term_ID,
- term_list_ID,
- tick_ID,
- timed_entry_call_ID,
- triggering_alternative_ID,
- type_declaration_ID,
- type_definition_ID,
- variant_part_ID,
- variant_list_ID,
- variant_ID,
- unary_adding_operator_ID,
- use_clause_ID,
- with_clause_ID);
-
- type Token_Enum_ID_Array is array (Positive range <>) of Token_Enum_ID;
- use all type WisiToken.Token_ID;
- function "+" (Item : in Token_Enum_ID) return WisiToken.Token_ID
- is (WisiToken.Token_ID'First + Token_Enum_ID'Pos (Item));
- function To_Token_Enum (Item : in WisiToken.Token_ID) return Token_Enum_ID
- is (Token_Enum_ID'Val (Item - WisiToken.Token_ID'First));
- function "-" (Item : in WisiToken.Token_ID) return Token_Enum_ID renames
To_Token_Enum;
-
- procedure abstract_subprogram_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure accept_statement_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure accept_statement_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure access_definition_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure access_definition_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure access_definition_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure actual_parameter_part_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure actual_parameter_part_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure aggregate_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure aggregate_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure aggregate_3
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure aggregate_4
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure aggregate_5
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure aggregate_6
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure array_type_definition_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure array_type_definition_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure aspect_clause_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure aspect_specification_opt_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure assignment_statement_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure association_opt_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure association_opt_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure association_opt_3
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure association_opt_4
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure association_opt_6
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure association_opt_7
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure asynchronous_select_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure at_clause_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure block_label_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure block_statement_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure block_statement_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure case_expression_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure case_expression_alternative_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure case_expression_alternative_list_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure case_statement_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure case_statement_alternative_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure case_statement_alternative_list_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure compilation_unit_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure compilation_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure compilation_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure component_clause_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure component_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure component_declaration_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure component_list_4
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure conditional_entry_call_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure declaration_9
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure delay_statement_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure delay_statement_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure derived_type_definition_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure derived_type_definition_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure discriminant_part_opt_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure elsif_expression_item_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure elsif_expression_list_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure elsif_statement_item_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure elsif_statement_list_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure entry_body_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure entry_body_formal_part_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure entry_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure entry_declaration_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure enumeration_representation_clause_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure enumeration_type_definition_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure exception_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure exception_handler_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure exception_handler_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure exception_handler_list_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure exit_statement_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure exit_statement_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure expression_function_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure extended_return_object_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure extended_return_object_declaration_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure extended_return_statement_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure extended_return_statement_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure formal_object_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure formal_object_declaration_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure formal_object_declaration_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure formal_object_declaration_3
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure formal_part_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure formal_subprogram_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure formal_subprogram_declaration_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure formal_subprogram_declaration_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure formal_subprogram_declaration_3
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure formal_type_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure formal_type_declaration_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure formal_type_declaration_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure formal_derived_type_definition_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure formal_derived_type_definition_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure formal_package_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure full_type_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure function_specification_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure generic_formal_part_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure generic_formal_part_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure generic_instantiation_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure generic_instantiation_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure generic_instantiation_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure generic_package_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure generic_renaming_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure generic_renaming_declaration_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure generic_renaming_declaration_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure generic_subprogram_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure goto_label_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure handled_sequence_of_statements_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure identifier_list_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure identifier_list_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure if_expression_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure if_expression_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure if_expression_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure if_expression_3
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure if_statement_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure if_statement_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure if_statement_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure if_statement_3
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure incomplete_type_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure incomplete_type_declaration_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure index_constraint_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure interface_list_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure interface_list_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure iteration_scheme_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure iteration_scheme_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure iterator_specification_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure iterator_specification_5
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure loop_statement_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure loop_statement_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure name_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure name_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure name_5
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure null_exclusion_opt_name_type_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure null_exclusion_opt_name_type_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure null_exclusion_opt_name_type_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure null_exclusion_opt_name_type_3
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure null_procedure_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure object_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure object_declaration_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure object_declaration_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure object_declaration_3
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure object_declaration_4
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure object_declaration_5
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure object_renaming_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure object_renaming_declaration_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure object_renaming_declaration_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure overriding_indicator_opt_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure overriding_indicator_opt_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure package_body_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure package_body_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure package_body_stub_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure package_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure package_renaming_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure package_specification_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure package_specification_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure parameter_and_result_profile_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure parameter_specification_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure parameter_specification_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure parameter_specification_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure parameter_specification_3
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure paren_expression_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure pragma_g_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure pragma_g_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure pragma_g_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure primary_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure primary_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure primary_4
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure private_extension_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure private_type_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure procedure_call_statement_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure procedure_specification_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure protected_body_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure protected_body_stub_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure protected_definition_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure protected_definition_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure protected_type_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure protected_type_declaration_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure qualified_expression_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure quantified_expression_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure raise_expression_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure raise_statement_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure raise_statement_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure raise_statement_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure range_g_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure record_definition_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure record_representation_clause_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure requeue_statement_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure requeue_statement_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure result_profile_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure result_profile_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure selected_component_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure selected_component_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure selected_component_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure selected_component_3
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure selective_accept_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure selective_accept_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure select_alternative_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure select_alternative_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure select_alternative_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure select_alternative_4
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure select_alternative_list_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure select_alternative_list_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure simple_return_statement_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure simple_statement_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure simple_statement_3
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure simple_statement_8
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure single_protected_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure single_protected_declaration_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure single_task_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure single_task_declaration_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure single_task_declaration_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure subprogram_body_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure subprogram_body_stub_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure subprogram_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure subprogram_default_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure subprogram_renaming_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure subtype_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure subtype_indication_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure subtype_indication_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure subtype_indication_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure subtype_indication_3
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure subunit_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure task_body_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure task_body_stub_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure task_definition_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure task_definition_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure task_type_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure task_type_declaration_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure task_type_declaration_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure timed_entry_call_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure variant_part_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure variant_list_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure variant_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure use_clause_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure use_clause_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure use_clause_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure with_clause_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure with_clause_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure with_clause_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- procedure with_clause_3
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
- function accept_statement_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function block_label_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function block_label_opt_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function block_statement_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function block_statement_1_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function compilation_1_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function entry_body_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function function_specification_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function identifier_opt_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function loop_statement_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function loop_statement_1_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function name_2_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function name_5_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function name_7_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function name_opt_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function package_body_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function package_body_1_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function package_specification_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function package_specification_1_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function procedure_specification_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function protected_body_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function protected_definition_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function protected_definition_1_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function protected_type_declaration_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function protected_type_declaration_1_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function selected_component_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function selected_component_2_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function single_protected_declaration_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function single_protected_declaration_1_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function single_task_declaration_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function single_task_declaration_1_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function subprogram_body_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function subprogram_specification_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function subprogram_specification_1_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function task_body_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function task_type_declaration_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
- function task_type_declaration_1_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
- Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
-
- Partial_Parse_Active : Boolean := False;
- Partial_Parse_Byte_Goal : WisiToken.Buffer_Pos := WisiToken.Buffer_Pos'Last;
-end Ada_Process_Actions;
diff --git a/ada_process_lalr_main.adb b/ada_process_lalr_main.adb
deleted file mode 100644
index 6c39695dc7..0000000000
--- a/ada_process_lalr_main.adb
+++ /dev/null
@@ -1,16487 +0,0 @@
--- generated parser support file.
--- command line: wisitoken-bnf-generate.exe --generate LALR Ada_Emacs re2c
PROCESS ada.wy
---
-
--- Copyright (C) 2013 - 2020 Free Software Foundation, Inc.
-
--- This program is free software; you can redistribute it and/or
--- modify it under the terms of the GNU General Public License as
--- published by the Free Software Foundation; either version 3, or (at
--- your option) any later version.
---
--- This software is distributed in the hope that it will be useful,
--- but WITHOUT ANY WARRANTY; without even the implied warranty of
--- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
--- General Public License for more details.
---
--- You should have received a copy of the GNU General Public License
--- along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>.
-
-with Ada_Process_Actions; use Ada_Process_Actions;
-with WisiToken.Lexer.re2c;
-with ada_re2c_c;
-package body Ada_Process_LALR_Main is
-
- package Lexer is new WisiToken.Lexer.re2c
- (ada_re2c_c.New_Lexer,
- ada_re2c_c.Free_Lexer,
- ada_re2c_c.Reset_Lexer,
- ada_re2c_c.Next_Token);
-
- procedure Create_Parser
- (Parser : out WisiToken.Parse.LR.Parser.Parser;
- Language_Fixes : in
WisiToken.Parse.LR.Parser.Language_Fixes_Access;
- Language_Matching_Begin_Tokens : in
WisiToken.Parse.LR.Parser.Language_Matching_Begin_Tokens_Access;
- Language_String_ID_Set : in
WisiToken.Parse.LR.Parser.Language_String_ID_Set_Access;
- Trace : not null access WisiToken.Trace'Class;
- User_Data : in
WisiToken.Syntax_Trees.User_Data_Access)
- is
- use WisiToken.Parse.LR;
- McKenzie_Param : constant McKenzie_Param_Type :=
- (First_Terminal => 3,
- Last_Terminal => 110,
- First_Nonterminal => 111,
- Last_Nonterminal => 335,
- Insert =>
- (4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 4, 4, 4, 4, 4, 4, 4, 4, 3,
4, 4, 4, 4, 4, 4, 4, 2, 4, 4, 4, 4, 4, 4,
- 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
- 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4),
- Delete =>
- (4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
- 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
- 4, 4, 4, 1, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4),
- Push_Back =>
- (2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2),
- Undo_Reduce =>
- (2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2),
- Minimal_Complete_Cost_Delta => -3,
- Fast_Forward => 2,
- Matching_Begin => 3,
- Ignore_Check_Fail => 2,
- Task_Count => 0,
- Check_Limit => 4,
- Check_Delta_Limit => 100,
- Enqueue_Limit => 58000);
-
- Table : constant Parse_Table_Ptr := new Parse_Table
- (State_First => 0,
- State_Last => 1302,
- First_Terminal => 3,
- Last_Terminal => 110,
- First_Nonterminal => 111,
- Last_Nonterminal => 335);
- begin
- Table.McKenzie_Param := McKenzie_Param;
- declare
- procedure Subr_1
- is begin
- Table.States (0).Action_List.Set_Capacity (39);
- Add_Action (Table.States (0), 4, (116, 0), 1);
- Add_Action (Table.States (0), 5, (306, 8), 2);
- Add_Action (Table.States (0), 13, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (0), 15, (142, 0), 3);
- Add_Action (Table.States (0), 17, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (0), 18, (164, 0), 4);
- Add_Action (Table.States (0), 25, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (0), 27, (193, 0), 5);
- Add_Action (Table.States (0), 28, (124, 0), 6);
- Add_Conflict (Table.States (0), 28, (135, 1), 0, null, null);
- Add_Action (Table.States (0), 29, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (0), 30, (213, 0), 8);
- Add_Action (Table.States (0), 31, (306, 3), 9);
- Add_Action (Table.States (0), 32, (225, 0), 10);
- Add_Action (Table.States (0), 36, (335, 0), 11);
- Add_Action (Table.States (0), 37, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (0), 40, (249, 0), 12);
- Add_Action (Table.States (0), 41, (306, 0), 13);
- Add_Action (Table.States (0), 46, (249, 1), 14);
- Add_Action (Table.States (0), 47, (216, 0), 15);
- Add_Action (Table.States (0), 48, (260, 0), 16);
- Add_Action (Table.States (0), 49, (145, 2), 17);
- Add_Action (Table.States (0), 50, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (0), 51, (267, 0), 19);
- Add_Action (Table.States (0), 52, (279, 0), 20);
- Add_Action (Table.States (0), 57, (293, 0), 21);
- Add_Action (Table.States (0), 58, (199, 0), 22);
- Add_Action (Table.States (0), 60, (318, 0), 23);
- Add_Action (Table.States (0), 61, (129, 0), 24);
- Add_Action (Table.States (0), 63, (316, 0), 25);
- Add_Action (Table.States (0), 66, (308, 0), 26);
- Add_Action (Table.States (0), 69, (209, 0), 27);
- Add_Action (Table.States (0), 71, (334, 0), 28);
- Add_Action (Table.States (0), 73, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (0), 74, (335, 3), 30);
- Add_Action (Table.States (0), 81, (242, 8), 31);
- Add_Action (Table.States (0), 96, (220, 0), 32);
- Add_Action (Table.States (0), 107, (134, 0), 33);
- Add_Action (Table.States (0), 108, (242, 7), 34);
- Add_Action (Table.States (0), 109, (242, 6), 35);
- Table.States (0).Goto_List.Set_Capacity (83);
- Add_Goto (Table.States (0), 115, 36);
- Add_Goto (Table.States (0), 116, 37);
- Add_Goto (Table.States (0), 124, 38);
- Add_Goto (Table.States (0), 126, 39);
- Add_Goto (Table.States (0), 129, 40);
- Add_Goto (Table.States (0), 130, 41);
- Add_Goto (Table.States (0), 131, 42);
- Add_Goto (Table.States (0), 134, 43);
- Add_Goto (Table.States (0), 135, 44);
- Add_Goto (Table.States (0), 136, 45);
- Add_Goto (Table.States (0), 137, 46);
- Add_Goto (Table.States (0), 138, 47);
- Add_Goto (Table.States (0), 142, 48);
- Add_Goto (Table.States (0), 145, 49);
- Add_Goto (Table.States (0), 146, 50);
- Add_Goto (Table.States (0), 154, 51);
- Add_Goto (Table.States (0), 155, 52);
- Add_Goto (Table.States (0), 160, 53);
- Add_Goto (Table.States (0), 164, 54);
- Add_Goto (Table.States (0), 182, 55);
- Add_Goto (Table.States (0), 185, 56);
- Add_Goto (Table.States (0), 189, 57);
- Add_Goto (Table.States (0), 193, 58);
- Add_Goto (Table.States (0), 196, 59);
- Add_Goto (Table.States (0), 199, 60);
- Add_Goto (Table.States (0), 209, 61);
- Add_Goto (Table.States (0), 210, 62);
- Add_Goto (Table.States (0), 212, 63);
- Add_Goto (Table.States (0), 213, 64);
- Add_Goto (Table.States (0), 216, 65);
- Add_Goto (Table.States (0), 217, 66);
- Add_Goto (Table.States (0), 218, 67);
- Add_Goto (Table.States (0), 219, 68);
- Add_Goto (Table.States (0), 220, 69);
- Add_Goto (Table.States (0), 222, 70);
- Add_Goto (Table.States (0), 225, 71);
- Add_Goto (Table.States (0), 226, 72);
- Add_Goto (Table.States (0), 235, 73);
- Add_Goto (Table.States (0), 242, 74);
- Add_Goto (Table.States (0), 246, 75);
- Add_Goto (Table.States (0), 247, 76);
- Add_Goto (Table.States (0), 248, 77);
- Add_Goto (Table.States (0), 249, 78);
- Add_Goto (Table.States (0), 250, 79);
- Add_Goto (Table.States (0), 251, 80);
- Add_Goto (Table.States (0), 252, 81);
- Add_Goto (Table.States (0), 253, 82);
- Add_Goto (Table.States (0), 254, 83);
- Add_Goto (Table.States (0), 260, 84);
- Add_Goto (Table.States (0), 262, 85);
- Add_Goto (Table.States (0), 263, 86);
- Add_Goto (Table.States (0), 264, 87);
- Add_Goto (Table.States (0), 265, 88);
- Add_Goto (Table.States (0), 266, 89);
- Add_Goto (Table.States (0), 267, 90);
- Add_Goto (Table.States (0), 268, 91);
- Add_Goto (Table.States (0), 274, 92);
- Add_Goto (Table.States (0), 275, 93);
- Add_Goto (Table.States (0), 279, 94);
- Add_Goto (Table.States (0), 284, 95);
- Add_Goto (Table.States (0), 292, 96);
- Add_Goto (Table.States (0), 293, 97);
- Add_Goto (Table.States (0), 296, 98);
- Add_Goto (Table.States (0), 297, 99);
- Add_Goto (Table.States (0), 301, 100);
- Add_Goto (Table.States (0), 305, 101);
- Add_Goto (Table.States (0), 306, 102);
- Add_Goto (Table.States (0), 307, 103);
- Add_Goto (Table.States (0), 308, 104);
- Add_Goto (Table.States (0), 309, 105);
- Add_Goto (Table.States (0), 310, 106);
- Add_Goto (Table.States (0), 311, 107);
- Add_Goto (Table.States (0), 312, 108);
- Add_Goto (Table.States (0), 314, 109);
- Add_Goto (Table.States (0), 316, 110);
- Add_Goto (Table.States (0), 318, 111);
- Add_Goto (Table.States (0), 319, 112);
- Add_Goto (Table.States (0), 320, 113);
- Add_Goto (Table.States (0), 322, 114);
- Add_Goto (Table.States (0), 326, 115);
- Add_Goto (Table.States (0), 328, 116);
- Add_Goto (Table.States (0), 334, 117);
- Add_Goto (Table.States (0), 335, 118);
- Table.States (1).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1), 107, (116, 0), 119);
- Table.States (1).Kernel := To_Vector ((((116, 0), 4, 4,
(2147483647, 0), 0), ((116, 1), 4, 2,
- (2147483647, 0), 0)));
- Table.States (1).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (116, 0), 107, 119)));
- Table.States (2).Action_List.Set_Capacity (4);
- Add_Action (Table.States (2), 81, (242, 8), 31);
- Add_Action (Table.States (2), 107, (242, 5), 120);
- Add_Action (Table.States (2), 108, (242, 7), 34);
- Add_Action (Table.States (2), 109, (242, 6), 35);
- Table.States (2).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (2), 131, 42);
- Add_Goto (Table.States (2), 242, 121);
- Add_Goto (Table.States (2), 275, 93);
- Add_Goto (Table.States (2), 296, 98);
- Table.States (2).Kernel := To_Vector ((0 => ((306, 8), 5, 2,
(2147483647, 0), 0)));
- Table.States (2).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (3).Action_List.Set_Capacity (15);
- Add_Action (Table.States (3), 3, (200, 2), 122);
- Add_Action (Table.States (3), 35, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (3), 39, (261, 4), 123);
- Add_Action (Table.States (3), 40, (200, 3), 124);
- Add_Action (Table.States (3), 41, (261, 1), 125);
- Add_Action (Table.States (3), 52, (278, 0), 126);
- Add_Action (Table.States (3), 76, (120, 0), 127);
- Add_Action (Table.States (3), 77, (120, 5), 128);
- Add_Action (Table.States (3), 81, (242, 8), 31);
- Add_Action (Table.States (3), 97, (333, 1), 129);
- Add_Action (Table.States (3), 98, (333, 0), 130);
- Add_Action (Table.States (3), 106, (261, 0), 131);
- Add_Action (Table.States (3), 107, (242, 5), 120);
- Add_Action (Table.States (3), 108, (242, 7), 34);
- Add_Action (Table.States (3), 109, (242, 6), 35);
- Table.States (3).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (3), 120, 132);
- Add_Goto (Table.States (3), 131, 42);
- Add_Goto (Table.States (3), 194, 133);
- Add_Goto (Table.States (3), 195, 134);
- Add_Goto (Table.States (3), 200, 135);
- Add_Goto (Table.States (3), 242, 136);
- Add_Goto (Table.States (3), 261, 137);
- Add_Goto (Table.States (3), 275, 93);
- Add_Goto (Table.States (3), 278, 138);
- Add_Goto (Table.States (3), 285, 139);
- Add_Goto (Table.States (3), 286, 140);
- Add_Goto (Table.States (3), 287, 141);
- Add_Goto (Table.States (3), 288, 142);
- Add_Goto (Table.States (3), 289, 143);
- Add_Goto (Table.States (3), 290, 144);
- Add_Goto (Table.States (3), 296, 98);
- Add_Goto (Table.States (3), 304, 145);
- Add_Goto (Table.States (3), 323, 146);
- Add_Goto (Table.States (3), 324, 147);
- Add_Goto (Table.States (3), 333, 148);
- Table.States (3).Kernel := To_Vector ((0 => ((142, 0), 15, 6,
(2147483647, 0), 0)));
- Table.States (3).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (4).Action_List.Set_Capacity (16);
- Add_Action (Table.States (4), 3, (200, 2), 122);
- Add_Action (Table.States (4), 39, (261, 4), 123);
- Add_Action (Table.States (4), 40, (200, 3), 124);
- Add_Action (Table.States (4), 41, (261, 1), 125);
- Add_Action (Table.States (4), 52, (278, 0), 126);
- Add_Action (Table.States (4), 70, (164, 0), 149);
- Add_Action (Table.States (4), 76, (120, 0), 127);
- Add_Action (Table.States (4), 77, (120, 5), 128);
- Add_Action (Table.States (4), 81, (242, 8), 31);
- Add_Action (Table.States (4), 97, (333, 1), 129);
- Add_Action (Table.States (4), 98, (333, 0), 130);
- Add_Action (Table.States (4), 99, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (4), 106, (261, 0), 131);
- Add_Action (Table.States (4), 107, (242, 5), 120);
- Add_Action (Table.States (4), 108, (242, 7), 34);
- Add_Action (Table.States (4), 109, (242, 6), 35);
- Table.States (4).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (4), 120, 132);
- Add_Goto (Table.States (4), 131, 42);
- Add_Goto (Table.States (4), 194, 133);
- Add_Goto (Table.States (4), 195, 150);
- Add_Goto (Table.States (4), 200, 135);
- Add_Goto (Table.States (4), 242, 136);
- Add_Goto (Table.States (4), 261, 137);
- Add_Goto (Table.States (4), 275, 93);
- Add_Goto (Table.States (4), 278, 138);
- Add_Goto (Table.States (4), 285, 139);
- Add_Goto (Table.States (4), 286, 140);
- Add_Goto (Table.States (4), 287, 141);
- Add_Goto (Table.States (4), 288, 142);
- Add_Goto (Table.States (4), 289, 143);
- Add_Goto (Table.States (4), 290, 144);
- Add_Goto (Table.States (4), 296, 98);
- Add_Goto (Table.States (4), 304, 145);
- Add_Goto (Table.States (4), 323, 146);
- Add_Goto (Table.States (4), 324, 147);
- Add_Goto (Table.States (4), 333, 148);
- Table.States (4).Kernel := To_Vector ((((164, 0), 18, 2,
(2147483647, 0), 0), ((164, 1), 18, 1,
- (2147483647, 0), 0)));
- Table.States (4).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (5).Action_List.Set_Capacity (3);
- Add_Action (Table.States (5), 72, Reduce, (223, 1), 0, null,
null);
- Add_Action (Table.States (5), 99, Reduce, (223, 1), 0, null,
null);
- Add_Action (Table.States (5), 107, (223, 0), 151);
- Table.States (5).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (5), 223, 152);
- Table.States (5).Kernel := To_Vector ((((193, 0), 27, 2,
(2147483647, 0), 0), ((193, 1), 27, 1,
- (2147483647, 0), 0)));
- Table.States (5).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (223, 1), 0)));
- Table.States (6).Action_List.Set_Capacity (4);
- Add_Action (Table.States (6), 81, (242, 8), 31);
- Add_Action (Table.States (6), 107, (166, 0), 153);
- Add_Action (Table.States (6), 108, (166, 1), 154);
- Add_Action (Table.States (6), 109, (242, 6), 35);
- Table.States (6).Goto_List.Set_Capacity (7);
- Add_Goto (Table.States (6), 131, 155);
- Add_Goto (Table.States (6), 166, 156);
- Add_Goto (Table.States (6), 233, 157);
- Add_Goto (Table.States (6), 234, 158);
- Add_Goto (Table.States (6), 242, 159);
- Add_Goto (Table.States (6), 275, 93);
- Add_Goto (Table.States (6), 296, 98);
- Table.States (6).Kernel := To_Vector ((((124, 0), 28, 5,
(2147483647, 0), 0), ((130, 0), 28, 4,
- (2147483647, 0), 0), ((185, 0), 28, 5, (2147483647, 0), 0),
((232, 1), 28, 0, (234, 1), 0), ((284,
- 0), 28, 14, (2147483647, 0), 0)));
- Table.States (6).Minimal_Complete_Actions := To_Vector (((Shift,
(166, 0), 107, 153), (Reduce, (234, 1),
- 0)));
- Table.States (7).Action_List.Set_Capacity (4);
- Add_Action (Table.States (7), 81, (242, 8), 31);
- Add_Action (Table.States (7), 107, (242, 5), 120);
- Add_Action (Table.States (7), 108, (242, 7), 34);
- Add_Action (Table.States (7), 109, (242, 6), 35);
- Table.States (7).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (7), 131, 42);
- Add_Goto (Table.States (7), 242, 160);
- Add_Goto (Table.States (7), 275, 93);
- Add_Goto (Table.States (7), 296, 98);
- Table.States (7).Kernel := To_Vector ((0 => ((210, 0), 29, 2,
(2147483647, 0), 0)));
- Table.States (7).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (8).Action_List.Set_Capacity (8);
- Add_Action (Table.States (8), 29, (218, 2), 161);
- Add_Conflict (Table.States (8), 29, (213, 1), 1,
generic_formal_part_1'Access, null);
- Add_Action (Table.States (8), 47, (218, 0), 162);
- Add_Conflict (Table.States (8), 47, (213, 1), 1,
generic_formal_part_1'Access, null);
- Add_Action (Table.States (8), 48, (260, 0), 16);
- Add_Action (Table.States (8), 50, (218, 1), 163);
- Add_Conflict (Table.States (8), 50, (213, 1), 1,
generic_formal_part_1'Access, null);
- Add_Action (Table.States (8), 69, (204, 0), 164);
- Add_Action (Table.States (8), 71, (334, 0), 28);
- Add_Action (Table.States (8), 74, (203, 0), 165);
- Add_Action (Table.States (8), 107, (222, 1), 166);
- Table.States (8).Goto_List.Set_Capacity (9);
- Add_Goto (Table.States (8), 201, 167);
- Add_Goto (Table.States (8), 203, 168);
- Add_Goto (Table.States (8), 204, 169);
- Add_Goto (Table.States (8), 207, 170);
- Add_Goto (Table.States (8), 214, 171);
- Add_Goto (Table.States (8), 215, 172);
- Add_Goto (Table.States (8), 222, 173);
- Add_Goto (Table.States (8), 260, 174);
- Add_Goto (Table.States (8), 334, 175);
- Table.States (8).Kernel := To_Vector ((((213, 0), 30, 3,
(2147483647, 0), 0), ((213, 1), 30, 0, (213,
- 1), 1), ((218, 0), 30, 5, (2147483647, 0), 0), ((218, 1), 30,
5, (2147483647, 0), 0), ((218, 2),
- 30, 5, (2147483647, 0), 0)));
- Table.States (8).Minimal_Complete_Actions := To_Vector (((Shift,
(204, 0), 69, 164), (Reduce, (213, 1),
- 1)));
- Table.States (9).Action_List.Set_Capacity (1);
- Add_Action (Table.States (9), 107, (306, 3), 176);
- Table.States (9).Kernel := To_Vector ((0 => ((306, 3), 31, 2,
(2147483647, 0), 0)));
- Table.States (9).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (306, 3), 107, 176)));
- Table.States (10).Action_List.Set_Capacity (15);
- Add_Action (Table.States (10), 3, (200, 2), 122);
- Add_Action (Table.States (10), 39, (261, 4), 123);
- Add_Action (Table.States (10), 40, (200, 3), 124);
- Add_Action (Table.States (10), 41, (261, 1), 125);
- Add_Action (Table.States (10), 52, (278, 0), 126);
- Add_Action (Table.States (10), 68, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (10), 76, (120, 0), 127);
- Add_Action (Table.States (10), 77, (120, 5), 128);
- Add_Action (Table.States (10), 81, (242, 8), 31);
- Add_Action (Table.States (10), 97, (333, 1), 129);
- Add_Action (Table.States (10), 98, (333, 0), 130);
- Add_Action (Table.States (10), 106, (261, 0), 131);
- Add_Action (Table.States (10), 107, (242, 5), 120);
- Add_Action (Table.States (10), 108, (242, 7), 34);
- Add_Action (Table.States (10), 109, (242, 6), 35);
- Table.States (10).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (10), 120, 132);
- Add_Goto (Table.States (10), 131, 42);
- Add_Goto (Table.States (10), 194, 133);
- Add_Goto (Table.States (10), 195, 177);
- Add_Goto (Table.States (10), 200, 135);
- Add_Goto (Table.States (10), 242, 136);
- Add_Goto (Table.States (10), 261, 137);
- Add_Goto (Table.States (10), 275, 93);
- Add_Goto (Table.States (10), 278, 138);
- Add_Goto (Table.States (10), 285, 139);
- Add_Goto (Table.States (10), 286, 140);
- Add_Goto (Table.States (10), 287, 141);
- Add_Goto (Table.States (10), 288, 142);
- Add_Goto (Table.States (10), 289, 143);
- Add_Goto (Table.States (10), 290, 144);
- Add_Goto (Table.States (10), 296, 98);
- Add_Goto (Table.States (10), 304, 145);
- Add_Goto (Table.States (10), 323, 146);
- Add_Goto (Table.States (10), 324, 147);
- Add_Goto (Table.States (10), 333, 148);
- Table.States (10).Kernel := To_Vector ((((225, 0), 32, 7,
(2147483647, 0), 0), ((225, 1), 32, 5,
- (2147483647, 0), 0), ((225, 2), 32, 6, (2147483647, 0), 0),
((225, 3), 32, 4, (2147483647, 0), 0)));
- Table.States (10).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (11).Action_List.Set_Capacity (2);
- Add_Action (Table.States (11), 49, (335, 0), 178);
- Add_Action (Table.States (11), 74, (335, 1), 179);
- Table.States (11).Kernel := To_Vector ((((335, 0), 36, 4,
(2147483647, 0), 0), ((335, 1), 36, 3,
- (2147483647, 0), 0)));
- Table.States (11).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (335, 1), 74, 179)));
- Table.States (12).Action_List.Set_Capacity (1);
- Add_Action (Table.States (12), 46, (249, 0), 180);
- Table.States (12).Kernel := To_Vector ((0 => ((249, 0), 40, 1,
(2147483647, 0), 0)));
- Table.States (12).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (249, 0), 46, 180)));
- Table.States (13).Action_List.Set_Capacity (1);
- Add_Action (Table.States (13), 99, (306, 0), 181);
- Table.States (13).Kernel := To_Vector ((0 => ((306, 0), 41, 1,
(2147483647, 0), 0)));
- Table.States (13).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (306, 0), 99, 181)));
- Table.States (14).Action_List.Set_Capacity (3);
- Add_Action (Table.States (14), (25, 29, 50), (249, 1), 1,
overriding_indicator_opt_1'Access, null);
- Table.States (14).Kernel := To_Vector ((0 => ((249, 1), 46, 0,
(249, 1), 1)));
- Table.States (14).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (249, 1), 1)));
- Table.States (15).Action_List.Set_Capacity (5);
- Add_Action (Table.States (15), 14, (250, 0), 182);
- Add_Action (Table.States (15), 81, (242, 8), 31);
- Add_Action (Table.States (15), 107, (242, 5), 120);
- Add_Action (Table.States (15), 108, (242, 7), 34);
- Add_Action (Table.States (15), 109, (242, 6), 35);
- Table.States (15).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (15), 131, 42);
- Add_Goto (Table.States (15), 242, 183);
- Add_Goto (Table.States (15), 275, 93);
- Add_Goto (Table.States (15), 296, 98);
- Table.States (15).Kernel := To_Vector ((((216, 0), 47, 5,
(2147483647, 0), 0), ((250, 0), 47, 6,
- (2147483647, 0), 0), ((250, 1), 47, 5, (2147483647, 0), 0),
((251, 0), 47, 5, (2147483647, 0), 0),
- ((253, 0), 47, 4, (2147483647, 0), 0), ((254, 0), 47, 4,
(2147483647, 0), 0), ((254, 1), 47, 3,
- (2147483647, 0), 0)));
- Table.States (15).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (16).Action_List.Set_Capacity (1);
- Add_Action (Table.States (16), 107, (260, 0), 184);
- Table.States (16).Kernel := To_Vector ((((260, 0), 48, 4,
(2147483647, 0), 0), ((260, 1), 48, 6,
- (2147483647, 0), 0), ((260, 2), 48, 2, (2147483647, 0), 0)));
- Table.States (16).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (260, 0), 107, 184)));
- Table.States (17).Action_List.Set_Capacity (15);
- Add_Action (Table.States (17), 25, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (17), 28, (124, 0), 185);
- Add_Action (Table.States (17), 29, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (17), 30, (213, 0), 8);
- Add_Action (Table.States (17), 40, (249, 0), 12);
- Add_Action (Table.States (17), 46, (249, 1), 14);
- Add_Action (Table.States (17), 47, (216, 0), 15);
- Add_Action (Table.States (17), 50, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (17), 51, (267, 0), 19);
- Add_Action (Table.States (17), 63, (316, 0), 25);
- Add_Action (Table.States (17), 66, (308, 0), 26);
- Add_Action (Table.States (17), 69, (209, 0), 27);
- Add_Action (Table.States (17), 71, (334, 0), 28);
- Add_Action (Table.States (17), 74, (335, 2), 186);
- Add_Action (Table.States (17), 107, (222, 1), 187);
- Table.States (17).Goto_List.Set_Capacity (50);
- Add_Goto (Table.States (17), 115, 36);
- Add_Goto (Table.States (17), 124, 38);
- Add_Goto (Table.States (17), 130, 41);
- Add_Goto (Table.States (17), 137, 46);
- Add_Goto (Table.States (17), 138, 47);
- Add_Goto (Table.States (17), 160, 188);
- Add_Goto (Table.States (17), 182, 55);
- Add_Goto (Table.States (17), 185, 56);
- Add_Goto (Table.States (17), 189, 57);
- Add_Goto (Table.States (17), 196, 59);
- Add_Goto (Table.States (17), 209, 61);
- Add_Goto (Table.States (17), 210, 62);
- Add_Goto (Table.States (17), 212, 63);
- Add_Goto (Table.States (17), 213, 64);
- Add_Goto (Table.States (17), 216, 65);
- Add_Goto (Table.States (17), 217, 66);
- Add_Goto (Table.States (17), 218, 67);
- Add_Goto (Table.States (17), 219, 68);
- Add_Goto (Table.States (17), 222, 70);
- Add_Goto (Table.States (17), 226, 72);
- Add_Goto (Table.States (17), 246, 75);
- Add_Goto (Table.States (17), 247, 76);
- Add_Goto (Table.States (17), 248, 77);
- Add_Goto (Table.States (17), 249, 78);
- Add_Goto (Table.States (17), 250, 79);
- Add_Goto (Table.States (17), 251, 80);
- Add_Goto (Table.States (17), 252, 81);
- Add_Goto (Table.States (17), 253, 82);
- Add_Goto (Table.States (17), 254, 83);
- Add_Goto (Table.States (17), 262, 85);
- Add_Goto (Table.States (17), 263, 86);
- Add_Goto (Table.States (17), 265, 88);
- Add_Goto (Table.States (17), 266, 89);
- Add_Goto (Table.States (17), 267, 90);
- Add_Goto (Table.States (17), 268, 91);
- Add_Goto (Table.States (17), 274, 92);
- Add_Goto (Table.States (17), 284, 95);
- Add_Goto (Table.States (17), 292, 96);
- Add_Goto (Table.States (17), 307, 103);
- Add_Goto (Table.States (17), 308, 104);
- Add_Goto (Table.States (17), 310, 106);
- Add_Goto (Table.States (17), 311, 107);
- Add_Goto (Table.States (17), 312, 108);
- Add_Goto (Table.States (17), 314, 109);
- Add_Goto (Table.States (17), 316, 110);
- Add_Goto (Table.States (17), 319, 112);
- Add_Goto (Table.States (17), 320, 113);
- Add_Goto (Table.States (17), 322, 114);
- Add_Goto (Table.States (17), 328, 116);
- Add_Goto (Table.States (17), 334, 117);
- Table.States (17).Kernel := To_Vector ((((145, 2), 49, 3,
(2147483647, 0), 0), ((335, 2), 49, 3,
- (2147483647, 0), 0)));
- Table.States (17).Minimal_Complete_Actions := To_Vector (((Reduce,
(249, 2), 0), (Shift, (335, 2), 74,
- 186)));
- Table.States (18).Action_List.Set_Capacity (4);
- Add_Action (Table.States (18), 81, (242, 8), 31);
- Add_Action (Table.States (18), 107, (242, 5), 120);
- Add_Action (Table.States (18), 108, (242, 7), 34);
- Add_Action (Table.States (18), 109, (242, 6), 35);
- Table.States (18).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (18), 131, 42);
- Add_Goto (Table.States (18), 242, 189);
- Add_Goto (Table.States (18), 275, 93);
- Add_Goto (Table.States (18), 296, 98);
- Table.States (18).Kernel := To_Vector ((0 => ((265, 0), 50, 1,
(2147483647, 0), 0)));
- Table.States (18).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (19).Action_List.Set_Capacity (3);
- Add_Action (Table.States (19), 14, (267, 0), 190);
- Add_Action (Table.States (19), 69, (274, 0), 191);
- Add_Action (Table.States (19), 107, (307, 0), 192);
- Table.States (19).Kernel := To_Vector ((((267, 0), 51, 5,
(2147483647, 0), 0), ((268, 0), 51, 5,
- (2147483647, 0), 0), ((274, 0), 51, 8, (2147483647, 0), 0),
((274, 1), 51, 5, (2147483647, 0), 0),
- ((307, 0), 51, 7, (2147483647, 0), 0), ((307, 1), 51, 4,
(2147483647, 0), 0)));
- Table.States (19).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (307, 0), 107, 192)));
- Table.States (20).Action_List.Set_Capacity (5);
- Add_Action (Table.States (20), 81, (242, 8), 31);
- Add_Action (Table.States (20), 99, (279, 2), 193);
- Add_Action (Table.States (20), 107, (242, 5), 120);
- Add_Action (Table.States (20), 108, (242, 7), 34);
- Add_Action (Table.States (20), 109, (242, 6), 35);
- Table.States (20).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (20), 131, 42);
- Add_Goto (Table.States (20), 242, 194);
- Add_Goto (Table.States (20), 275, 93);
- Add_Goto (Table.States (20), 296, 98);
- Table.States (20).Kernel := To_Vector ((((279, 0), 52, 3,
(2147483647, 0), 0), ((279, 1), 52, 2,
- (2147483647, 0), 0), ((279, 2), 52, 1, (2147483647, 0), 0)));
- Table.States (20).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (279, 2), 99, 193)));
- Table.States (21).Action_List.Set_Capacity (4);
- Add_Action (Table.States (21), 81, (242, 8), 31);
- Add_Action (Table.States (21), 107, (242, 5), 120);
- Add_Action (Table.States (21), 108, (242, 7), 34);
- Add_Action (Table.States (21), 109, (242, 6), 35);
- Table.States (21).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (21), 131, 42);
- Add_Goto (Table.States (21), 242, 195);
- Add_Goto (Table.States (21), 275, 93);
- Add_Goto (Table.States (21), 296, 98);
- Table.States (21).Kernel := To_Vector ((((293, 0), 57, 4,
(2147483647, 0), 0), ((293, 1), 57, 2,
- (2147483647, 0), 0)));
- Table.States (21).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (22).Action_List.Set_Capacity (16);
- Add_Action (Table.States (22), 3, (200, 2), 122);
- Add_Action (Table.States (22), 21, Reduce, (198, 1), 0, null,
null);
- Add_Action (Table.States (22), 39, (261, 4), 123);
- Add_Action (Table.States (22), 40, (200, 3), 124);
- Add_Action (Table.States (22), 41, (261, 1), 125);
- Add_Action (Table.States (22), 52, (278, 0), 126);
- Add_Action (Table.States (22), 76, (120, 0), 127);
- Add_Action (Table.States (22), 77, (120, 5), 128);
- Add_Action (Table.States (22), 81, (242, 8), 31);
- Add_Action (Table.States (22), 97, (333, 1), 129);
- Add_Action (Table.States (22), 98, (333, 0), 130);
- Add_Action (Table.States (22), 99, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (22), 106, (261, 0), 131);
- Add_Action (Table.States (22), 107, (197, 0), 196);
- Add_Action (Table.States (22), 108, (242, 7), 34);
- Add_Action (Table.States (22), 109, (242, 6), 35);
- Table.States (22).Goto_List.Set_Capacity (22);
- Add_Goto (Table.States (22), 120, 132);
- Add_Goto (Table.States (22), 131, 42);
- Add_Goto (Table.States (22), 194, 133);
- Add_Goto (Table.States (22), 195, 197);
- Add_Goto (Table.States (22), 197, 198);
- Add_Goto (Table.States (22), 198, 199);
- Add_Goto (Table.States (22), 200, 135);
- Add_Goto (Table.States (22), 242, 136);
- Add_Goto (Table.States (22), 261, 137);
- Add_Goto (Table.States (22), 275, 93);
- Add_Goto (Table.States (22), 278, 138);
- Add_Goto (Table.States (22), 285, 139);
- Add_Goto (Table.States (22), 286, 140);
- Add_Goto (Table.States (22), 287, 141);
- Add_Goto (Table.States (22), 288, 142);
- Add_Goto (Table.States (22), 289, 143);
- Add_Goto (Table.States (22), 290, 144);
- Add_Goto (Table.States (22), 296, 98);
- Add_Goto (Table.States (22), 304, 145);
- Add_Goto (Table.States (22), 323, 146);
- Add_Goto (Table.States (22), 324, 147);
- Add_Goto (Table.States (22), 333, 148);
- Table.States (22).Kernel := To_Vector ((((199, 0), 58, 4,
(2147483647, 0), 0), ((199, 1), 58, 4,
- (2147483647, 0), 0), ((305, 0), 58, 1, (2147483647, 0), 0)));
- Table.States (22).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (23).Action_List.Set_Capacity (1);
- Add_Action (Table.States (23), 76, (318, 0), 200);
- Table.States (23).Kernel := To_Vector ((0 => ((318, 0), 60, 9,
(2147483647, 0), 0)));
- Table.States (23).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (318, 0), 76, 200)));
- Table.States (24).Action_List.Set_Capacity (10);
- Add_Action (Table.States (24), 4, (116, 0), 1);
- Add_Action (Table.States (24), 18, (164, 0), 4);
- Add_Action (Table.States (24), 22, Reduce, (300, 1), 0, null,
null);
- Add_Action (Table.States (24), 24, Reduce, (300, 1), 0, null,
null);
- Add_Action (Table.States (24), 67, (298, 4), 201);
- Add_Action (Table.States (24), 72, (298, 0), 202);
- Add_Action (Table.States (24), 81, (242, 8), 31);
- Add_Action (Table.States (24), 107, (242, 5), 120);
- Add_Action (Table.States (24), 108, (242, 7), 34);
- Add_Action (Table.States (24), 109, (242, 6), 35);
- Table.States (24).Goto_List.Set_Capacity (13);
- Add_Goto (Table.States (24), 116, 203);
- Add_Goto (Table.States (24), 131, 42);
- Add_Goto (Table.States (24), 163, 204);
- Add_Goto (Table.States (24), 164, 205);
- Add_Goto (Table.States (24), 181, 206);
- Add_Goto (Table.States (24), 242, 207);
- Add_Goto (Table.States (24), 264, 208);
- Add_Goto (Table.States (24), 275, 93);
- Add_Goto (Table.States (24), 296, 98);
- Add_Goto (Table.States (24), 298, 209);
- Add_Goto (Table.States (24), 299, 210);
- Add_Goto (Table.States (24), 300, 211);
- Add_Goto (Table.States (24), 327, 212);
- Table.States (24).Kernel := To_Vector ((((129, 0), 61, 6,
(2147483647, 0), 0), ((155, 0), 61, 5,
- (2147483647, 0), 0), ((297, 0), 61, 4, (2147483647, 0), 0),
((297, 1), 61, 3, (2147483647, 0), 0),
- ((326, 0), 61, 7, (2147483647, 0), 0)));
- Table.States (24).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (300, 1), 0)));
- Table.States (25).Action_List.Set_Capacity (1);
- Add_Action (Table.States (25), 107, (316, 0), 213);
- Table.States (25).Kernel := To_Vector ((0 => ((316, 0), 63, 4,
(2147483647, 0), 0)));
- Table.States (25).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (316, 0), 107, 213)));
- Table.States (26).Action_List.Set_Capacity (3);
- Add_Action (Table.States (26), 14, (319, 0), 214);
- Add_Action (Table.States (26), 69, (322, 0), 215);
- Add_Action (Table.States (26), 107, (308, 0), 216);
- Table.States (26).Kernel := To_Vector ((((308, 0), 66, 7,
(2147483647, 0), 0), ((308, 1), 66, 4,
- (2147483647, 0), 0), ((308, 2), 66, 2, (2147483647, 0), 0),
((319, 0), 66, 6, (2147483647, 0), 0),
- ((320, 0), 66, 5, (2147483647, 0), 0), ((322, 0), 66, 8,
(2147483647, 0), 0), ((322, 1), 66, 5,
- (2147483647, 0), 0), ((322, 2), 66, 3, (2147483647, 0), 0)));
- Table.States (26).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (308, 0), 107, 216)));
- Table.States (27).Action_List.Set_Capacity (1);
- Add_Action (Table.States (27), 107, (209, 0), 217);
- Table.States (27).Kernel := To_Vector ((((209, 0), 69, 4,
(2147483647, 0), 0), ((226, 0), 69, 4,
- (2147483647, 0), 0), ((226, 1), 69, 2, (2147483647, 0), 0),
((262, 0), 69, 7, (2147483647, 0), 0),
- ((263, 0), 69, 4, (2147483647, 0), 0)));
- Table.States (27).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (209, 0), 107, 217)));
- Table.States (28).Action_List.Set_Capacity (6);
- Add_Action (Table.States (28), 9, (334, 0), 218);
- Add_Action (Table.States (28), 69, (334, 1), 219);
- Add_Action (Table.States (28), 81, (242, 8), 31);
- Add_Action (Table.States (28), 107, (242, 5), 120);
- Add_Action (Table.States (28), 108, (242, 7), 34);
- Add_Action (Table.States (28), 109, (242, 6), 35);
- Table.States (28).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (28), 131, 42);
- Add_Goto (Table.States (28), 241, 220);
- Add_Goto (Table.States (28), 242, 221);
- Add_Goto (Table.States (28), 275, 93);
- Add_Goto (Table.States (28), 296, 98);
- Table.States (28).Kernel := To_Vector ((((334, 0), 71, 4,
(2147483647, 0), 0), ((334, 1), 71, 3,
- (2147483647, 0), 0), ((334, 2), 71, 2, (2147483647, 0), 0)));
- Table.States (28).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (29).Action_List.Set_Capacity (15);
- Add_Action (Table.States (29), 3, (200, 2), 122);
- Add_Action (Table.States (29), 37, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (29), 39, (261, 4), 123);
- Add_Action (Table.States (29), 40, (200, 3), 124);
- Add_Action (Table.States (29), 41, (261, 1), 125);
- Add_Action (Table.States (29), 52, (278, 0), 126);
- Add_Action (Table.States (29), 76, (120, 0), 127);
- Add_Action (Table.States (29), 77, (120, 5), 128);
- Add_Action (Table.States (29), 81, (242, 8), 31);
- Add_Action (Table.States (29), 97, (333, 1), 129);
- Add_Action (Table.States (29), 98, (333, 0), 130);
- Add_Action (Table.States (29), 106, (261, 0), 131);
- Add_Action (Table.States (29), 107, (242, 5), 120);
- Add_Action (Table.States (29), 108, (242, 7), 34);
- Add_Action (Table.States (29), 109, (242, 6), 35);
- Table.States (29).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (29), 120, 132);
- Add_Goto (Table.States (29), 131, 42);
- Add_Goto (Table.States (29), 194, 133);
- Add_Goto (Table.States (29), 195, 222);
- Add_Goto (Table.States (29), 200, 135);
- Add_Goto (Table.States (29), 242, 136);
- Add_Goto (Table.States (29), 261, 137);
- Add_Goto (Table.States (29), 275, 93);
- Add_Goto (Table.States (29), 278, 138);
- Add_Goto (Table.States (29), 285, 139);
- Add_Goto (Table.States (29), 286, 140);
- Add_Goto (Table.States (29), 287, 141);
- Add_Goto (Table.States (29), 288, 142);
- Add_Goto (Table.States (29), 289, 143);
- Add_Goto (Table.States (29), 290, 144);
- Add_Goto (Table.States (29), 296, 98);
- Add_Goto (Table.States (29), 304, 145);
- Add_Goto (Table.States (29), 323, 146);
- Add_Goto (Table.States (29), 324, 147);
- Add_Goto (Table.States (29), 333, 148);
- Table.States (29).Kernel := To_Vector ((0 => ((232, 0), 73, 0,
(195, 1), 0)));
- Table.States (29).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (30).Action_List.Set_Capacity (4);
- Add_Action (Table.States (30), 81, (242, 8), 31);
- Add_Action (Table.States (30), 107, (242, 5), 120);
- Add_Action (Table.States (30), 108, (242, 7), 34);
- Add_Action (Table.States (30), 109, (242, 6), 35);
- Table.States (30).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (30), 131, 42);
- Add_Goto (Table.States (30), 241, 223);
- Add_Goto (Table.States (30), 242, 221);
- Add_Goto (Table.States (30), 275, 93);
- Add_Goto (Table.States (30), 296, 98);
- Table.States (30).Kernel := To_Vector ((0 => ((335, 3), 74, 2,
(2147483647, 0), 0)));
- Table.States (30).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (31).Action_List.Set_Capacity (65);
- Add_Action (Table.States (31), (4, 5, 10, 13, 15, 17, 18, 20, 21,
22, 23, 27, 28, 31, 32, 33, 35, 37, 38,
- 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74,
75, 76, 78, 79, 80, 81, 82, 85, 86, 87, 88,
- 89, 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104,
105, 107, 108, 109), (242, 8), 1, null,
- null);
- Table.States (31).Kernel := To_Vector ((0 => ((242, 8), 81, 0,
(242, 8), 1)));
- Table.States (31).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (242, 8), 1)));
- Table.States (32).Action_List.Set_Capacity (1);
- Add_Action (Table.States (32), 107, (220, 0), 224);
- Table.States (32).Kernel := To_Vector ((0 => ((220, 0), 96, 2,
(2147483647, 0), 0)));
- Table.States (32).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (220, 0), 107, 224)));
- Table.States (33).Action_List.Set_Capacity (8);
- Add_Action (Table.States (33), 76, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (33), 84, (134, 0), 225);
- Add_Conflict (Table.States (33), 84, (222, 1), 1,
identifier_list_1'Access, null);
- Add_Action (Table.States (33), 85, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (33), 86, Reduce, (222, 1), 1,
identifier_list_1'Access, null);
- Add_Action (Table.States (33), 87, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (33), 99, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (33), 104, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (33), 105, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Table.States (33).Kernel := To_Vector ((((134, 0), 107, 1,
(2147483647, 0), 0), ((222, 1), 107, 0,
- (222, 1), 1), ((242, 5), 107, 0, (242, 5), 1), ((248, 0),
107, 5, (2147483647, 0), 0), ((248, 1),
- 107, 6, (2147483647, 0), 0), ((248, 2), 107, 5, (2147483647,
0), 0)));
- Table.States (33).Minimal_Complete_Actions := To_Vector (((Shift,
(134, 0), 84, 225), (Reduce, (222, 1),
- 1), (Reduce, (242, 5), 1)));
- Table.States (34).Action_List.Set_Capacity (64);
- Add_Action (Table.States (34), (4, 5, 10, 13, 15, 17, 18, 20, 21,
22, 23, 27, 28, 31, 32, 33, 35, 37, 38,
- 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 73, 74, 75,
76, 78, 79, 80, 81, 82, 85, 86, 87, 88, 89,
- 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105,
107, 108, 109), (242, 7), 1, null,
- name_7_check'Access);
- Table.States (34).Kernel := To_Vector ((0 => ((242, 7), 108, 0,
(242, 7), 1)));
- Table.States (34).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (242, 7), 1)));
- Table.States (35).Action_List.Set_Capacity (65);
- Add_Action (Table.States (35), (4, 5, 10, 13, 15, 17, 18, 20, 21,
22, 23, 27, 28, 31, 32, 33, 35, 37, 38,
- 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74,
75, 76, 78, 79, 80, 81, 82, 85, 86, 87, 88,
- 89, 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104,
105, 107, 108, 109), (242, 6), 1, null,
- null);
- Table.States (35).Kernel := To_Vector ((0 => ((242, 6), 109, 0,
(242, 6), 1)));
- Table.States (35).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (242, 6), 1)));
- Table.States (36).Action_List.Set_Capacity (41);
- Add_Action (Table.States (36), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (160, 0), 1,
- null, null);
- Table.States (36).Kernel := To_Vector ((0 => ((160, 0), 115, 0,
(160, 0), 1)));
- Table.States (36).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (160, 0), 1)));
- Table.States (37).Action_List.Set_Capacity (47);
- Add_Action (Table.States (37), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (154, 5), 1, null, null);
- Table.States (37).Kernel := To_Vector ((0 => ((154, 5), 116, 0,
(154, 5), 1)));
- Table.States (37).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (154, 5), 1)));
- Table.States (38).Action_List.Set_Capacity (41);
- Add_Action (Table.States (38), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (160, 1), 1,
- null, null);
- Table.States (38).Kernel := To_Vector ((0 => ((160, 1), 124, 0,
(160, 1), 1)));
- Table.States (38).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (160, 1), 1)));
- Table.States (39).Action_List.Set_Capacity (47);
- Add_Action (Table.States (39), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (306, 1), 1, null, null);
- Table.States (39).Kernel := To_Vector ((0 => ((306, 1), 126, 0,
(306, 1), 1)));
- Table.States (39).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (306, 1), 1)));
- Table.States (40).Action_List.Set_Capacity (47);
- Add_Action (Table.States (40), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (301, 3), 1, null, null);
- Table.States (40).Kernel := To_Vector ((0 => ((301, 3), 129, 0,
(301, 3), 1)));
- Table.States (40).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (301, 3), 1)));
- Table.States (41).Action_List.Set_Capacity (42);
- Add_Action (Table.States (41), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 72, 73,
74, 81, 96, 107, 108, 109, 110), (124, 3),
- 1, null, null);
- Table.States (41).Kernel := To_Vector ((0 => ((124, 3), 130, 0,
(124, 3), 1)));
- Table.States (41).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (124, 3), 1)));
- Table.States (42).Action_List.Set_Capacity (64);
- Add_Action (Table.States (42), (4, 5, 10, 13, 15, 17, 18, 20, 21,
22, 23, 27, 28, 31, 32, 33, 35, 37, 38,
- 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 73, 74, 75,
76, 78, 79, 80, 81, 82, 85, 86, 87, 88, 89,
- 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105,
107, 108, 109), (242, 3), 1, null, null);
- Table.States (42).Kernel := To_Vector ((0 => ((242, 3), 131, 0,
(242, 3), 1)));
- Table.States (42).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (242, 3), 1)));
- Table.States (43).Action_List.Set_Capacity (5);
- Add_Action (Table.States (43), (13, 17, 28, 37, 73), (135, 0), 1,
null, block_label_opt_0_check'Access);
- Table.States (43).Kernel := To_Vector ((0 => ((135, 0), 134, 0,
(135, 0), 1)));
- Table.States (43).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (135, 0), 1)));
- Table.States (44).Action_List.Set_Capacity (5);
- Add_Action (Table.States (44), 13, (136, 1), 226);
- Add_Action (Table.States (44), 17, (136, 0), 227);
- Add_Action (Table.States (44), 28, (232, 1), 228);
- Add_Action (Table.States (44), 37, (235, 1), 229);
- Add_Action (Table.States (44), 73, (232, 0), 29);
- Table.States (44).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (44), 232, 230);
- Table.States (44).Kernel := To_Vector ((((136, 0), 135, 4,
(2147483647, 0), 0), ((136, 1), 135, 3,
- (2147483647, 0), 0), ((235, 0), 135, 5, (2147483647, 0), 0),
((235, 1), 135, 4, (2147483647, 0),
- 0)));
- Table.States (44).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (136, 1), 13, 226)));
- Table.States (45).Action_List.Set_Capacity (47);
- Add_Action (Table.States (45), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (154, 3), 1, null, null);
- Table.States (45).Kernel := To_Vector ((0 => ((154, 3), 136, 0,
(154, 3), 1)));
- Table.States (45).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (154, 3), 1)));
- Table.States (46).Action_List.Set_Capacity (41);
- Add_Action (Table.States (46), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (160, 2), 1,
- null, null);
- Table.States (46).Kernel := To_Vector ((0 => ((160, 2), 137, 0,
(160, 2), 1)));
- Table.States (46).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (160, 2), 1)));
- end Subr_1;
- procedure Subr_2
- is begin
- Table.States (47).Action_List.Set_Capacity (41);
- Add_Action (Table.States (47), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (137, 1), 1,
- null, null);
- Table.States (47).Kernel := To_Vector ((0 => ((137, 1), 138, 0,
(137, 1), 1)));
- Table.States (47).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (137, 1), 1)));
- Table.States (48).Action_List.Set_Capacity (47);
- Add_Action (Table.States (48), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (154, 1), 1, null, null);
- Table.States (48).Kernel := To_Vector ((0 => ((154, 1), 142, 0,
(154, 1), 1)));
- Table.States (48).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (154, 1), 1)));
- Table.States (49).Action_List.Set_Capacity (40);
- Add_Action (Table.States (49), (4, 5, 13, 15, 17, 18, 25, 27, 28,
29, 30, 31, 32, 36, 37, 40, 41, 46, 47,
- 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 81,
96, 107, 108, 109, 110), (146, 1), 1,
- compilation_1'Access, compilation_1_check'Access);
- Table.States (49).Kernel := To_Vector ((0 => ((146, 1), 145, 0,
(146, 1), 1)));
- Table.States (49).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (146, 1), 1)));
- Table.States (50).Action_List.Set_Capacity (40);
- Add_Action (Table.States (50), 4, (116, 0), 1);
- Add_Action (Table.States (50), 5, (306, 8), 2);
- Add_Action (Table.States (50), 13, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (50), 15, (142, 0), 3);
- Add_Action (Table.States (50), 17, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (50), 18, (164, 0), 4);
- Add_Action (Table.States (50), 25, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (50), 27, (193, 0), 5);
- Add_Action (Table.States (50), 28, (124, 0), 6);
- Add_Conflict (Table.States (50), 28, (135, 1), 0, null, null);
- Add_Action (Table.States (50), 29, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (50), 30, (213, 0), 8);
- Add_Action (Table.States (50), 31, (306, 3), 9);
- Add_Action (Table.States (50), 32, (225, 0), 10);
- Add_Action (Table.States (50), 36, (335, 0), 11);
- Add_Action (Table.States (50), 37, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (50), 40, (249, 0), 12);
- Add_Action (Table.States (50), 41, (306, 0), 13);
- Add_Action (Table.States (50), 46, (249, 1), 14);
- Add_Action (Table.States (50), 47, (216, 0), 15);
- Add_Action (Table.States (50), 48, (260, 0), 16);
- Add_Action (Table.States (50), 49, (145, 2), 17);
- Add_Action (Table.States (50), 50, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (50), 51, (267, 0), 19);
- Add_Action (Table.States (50), 52, (279, 0), 20);
- Add_Action (Table.States (50), 57, (293, 0), 21);
- Add_Action (Table.States (50), 58, (199, 0), 22);
- Add_Action (Table.States (50), 60, (318, 0), 23);
- Add_Action (Table.States (50), 61, (129, 0), 24);
- Add_Action (Table.States (50), 63, (316, 0), 25);
- Add_Action (Table.States (50), 66, (308, 0), 26);
- Add_Action (Table.States (50), 69, (209, 0), 27);
- Add_Action (Table.States (50), 71, (334, 0), 28);
- Add_Action (Table.States (50), 73, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (50), 74, (335, 3), 30);
- Add_Action (Table.States (50), 81, (242, 8), 31);
- Add_Action (Table.States (50), 96, (220, 0), 32);
- Add_Action (Table.States (50), 107, (134, 0), 33);
- Add_Action (Table.States (50), 108, (242, 7), 34);
- Add_Action (Table.States (50), 109, (242, 6), 35);
- Add_Action (Table.States (50), 110, Accept_It, (111, 0), 1, null,
null);
- Table.States (50).Goto_List.Set_Capacity (82);
- Add_Goto (Table.States (50), 115, 36);
- Add_Goto (Table.States (50), 116, 37);
- Add_Goto (Table.States (50), 124, 38);
- Add_Goto (Table.States (50), 126, 39);
- Add_Goto (Table.States (50), 129, 40);
- Add_Goto (Table.States (50), 130, 41);
- Add_Goto (Table.States (50), 131, 42);
- Add_Goto (Table.States (50), 134, 43);
- Add_Goto (Table.States (50), 135, 44);
- Add_Goto (Table.States (50), 136, 45);
- Add_Goto (Table.States (50), 137, 46);
- Add_Goto (Table.States (50), 138, 47);
- Add_Goto (Table.States (50), 142, 48);
- Add_Goto (Table.States (50), 145, 231);
- Add_Goto (Table.States (50), 154, 51);
- Add_Goto (Table.States (50), 155, 52);
- Add_Goto (Table.States (50), 160, 53);
- Add_Goto (Table.States (50), 164, 54);
- Add_Goto (Table.States (50), 182, 55);
- Add_Goto (Table.States (50), 185, 56);
- Add_Goto (Table.States (50), 189, 57);
- Add_Goto (Table.States (50), 193, 58);
- Add_Goto (Table.States (50), 196, 59);
- Add_Goto (Table.States (50), 199, 60);
- Add_Goto (Table.States (50), 209, 61);
- Add_Goto (Table.States (50), 210, 62);
- Add_Goto (Table.States (50), 212, 63);
- Add_Goto (Table.States (50), 213, 64);
- Add_Goto (Table.States (50), 216, 65);
- Add_Goto (Table.States (50), 217, 66);
- Add_Goto (Table.States (50), 218, 67);
- Add_Goto (Table.States (50), 219, 68);
- Add_Goto (Table.States (50), 220, 69);
- Add_Goto (Table.States (50), 222, 70);
- Add_Goto (Table.States (50), 225, 71);
- Add_Goto (Table.States (50), 226, 72);
- Add_Goto (Table.States (50), 235, 73);
- Add_Goto (Table.States (50), 242, 74);
- Add_Goto (Table.States (50), 246, 75);
- Add_Goto (Table.States (50), 247, 76);
- Add_Goto (Table.States (50), 248, 77);
- Add_Goto (Table.States (50), 249, 78);
- Add_Goto (Table.States (50), 250, 79);
- Add_Goto (Table.States (50), 251, 80);
- Add_Goto (Table.States (50), 252, 81);
- Add_Goto (Table.States (50), 253, 82);
- Add_Goto (Table.States (50), 254, 83);
- Add_Goto (Table.States (50), 260, 84);
- Add_Goto (Table.States (50), 262, 85);
- Add_Goto (Table.States (50), 263, 86);
- Add_Goto (Table.States (50), 264, 87);
- Add_Goto (Table.States (50), 265, 88);
- Add_Goto (Table.States (50), 266, 89);
- Add_Goto (Table.States (50), 267, 90);
- Add_Goto (Table.States (50), 268, 91);
- Add_Goto (Table.States (50), 274, 92);
- Add_Goto (Table.States (50), 275, 93);
- Add_Goto (Table.States (50), 279, 94);
- Add_Goto (Table.States (50), 284, 95);
- Add_Goto (Table.States (50), 292, 96);
- Add_Goto (Table.States (50), 293, 97);
- Add_Goto (Table.States (50), 296, 98);
- Add_Goto (Table.States (50), 297, 99);
- Add_Goto (Table.States (50), 301, 100);
- Add_Goto (Table.States (50), 305, 101);
- Add_Goto (Table.States (50), 306, 102);
- Add_Goto (Table.States (50), 307, 103);
- Add_Goto (Table.States (50), 308, 104);
- Add_Goto (Table.States (50), 309, 105);
- Add_Goto (Table.States (50), 310, 106);
- Add_Goto (Table.States (50), 311, 107);
- Add_Goto (Table.States (50), 312, 108);
- Add_Goto (Table.States (50), 314, 109);
- Add_Goto (Table.States (50), 316, 110);
- Add_Goto (Table.States (50), 318, 111);
- Add_Goto (Table.States (50), 319, 112);
- Add_Goto (Table.States (50), 320, 113);
- Add_Goto (Table.States (50), 322, 114);
- Add_Goto (Table.States (50), 326, 115);
- Add_Goto (Table.States (50), 328, 116);
- Add_Goto (Table.States (50), 334, 117);
- Add_Goto (Table.States (50), 335, 118);
- Table.States (51).Action_List.Set_Capacity (47);
- Add_Action (Table.States (51), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (309, 2), 1, null, null);
- Table.States (51).Kernel := To_Vector ((0 => ((309, 2), 154, 0,
(309, 2), 1)));
- Table.States (51).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (309, 2), 1)));
- Table.States (52).Action_List.Set_Capacity (47);
- Add_Action (Table.States (52), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (301, 2), 1, null, null);
- Table.States (52).Kernel := To_Vector ((0 => ((301, 2), 155, 0,
(301, 2), 1)));
- Table.States (52).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (301, 2), 1)));
- Table.States (53).Action_List.Set_Capacity (40);
- Add_Action (Table.States (53), (4, 5, 13, 15, 17, 18, 25, 27, 28,
29, 30, 31, 32, 36, 37, 40, 41, 46, 47,
- 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 81,
96, 107, 108, 109, 110), (145, 3), 1,
- null, null);
- Table.States (53).Kernel := To_Vector ((0 => ((145, 3), 160, 0,
(145, 3), 1)));
- Table.States (53).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (145, 3), 1)));
- Table.States (54).Action_List.Set_Capacity (47);
- Add_Action (Table.States (54), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (306, 7), 1, null, null);
- Table.States (54).Kernel := To_Vector ((0 => ((306, 7), 164, 0,
(306, 7), 1)));
- Table.States (54).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (306, 7), 1)));
- Table.States (55).Action_List.Set_Capacity (41);
- Add_Action (Table.States (55), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (160, 3), 1,
- null, null);
- Table.States (55).Kernel := To_Vector ((0 => ((160, 3), 182, 0,
(160, 3), 1)));
- Table.States (55).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (160, 3), 1)));
- Table.States (56).Action_List.Set_Capacity (42);
- Add_Action (Table.States (56), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 72, 73,
74, 81, 96, 107, 108, 109, 110), (124, 1),
- 1, null, null);
- Table.States (56).Kernel := To_Vector ((0 => ((124, 1), 185, 0,
(124, 1), 1)));
- Table.States (56).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (124, 1), 1)));
- Table.States (57).Action_List.Set_Capacity (41);
- Add_Action (Table.States (57), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (160, 4), 1,
- null, null);
- Table.States (57).Kernel := To_Vector ((0 => ((160, 4), 189, 0,
(160, 4), 1)));
- Table.States (57).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (160, 4), 1)));
- Table.States (58).Action_List.Set_Capacity (47);
- Add_Action (Table.States (58), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (306, 2), 1, null, null);
- Table.States (58).Kernel := To_Vector ((0 => ((306, 2), 193, 0,
(306, 2), 1)));
- Table.States (58).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (306, 2), 1)));
- Table.States (59).Action_List.Set_Capacity (41);
- Add_Action (Table.States (59), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (160, 5), 1,
- null, null);
- Table.States (59).Kernel := To_Vector ((0 => ((160, 5), 196, 0,
(160, 5), 1)));
- Table.States (59).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (160, 5), 1)));
- Table.States (60).Action_List.Set_Capacity (47);
- Add_Action (Table.States (60), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (154, 4), 1, null, null);
- Table.States (60).Kernel := To_Vector ((0 => ((154, 4), 199, 0,
(154, 4), 1)));
- Table.States (60).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (154, 4), 1)));
- Table.States (61).Action_List.Set_Capacity (41);
- Add_Action (Table.States (61), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (328, 0), 1,
- null, null);
- Table.States (61).Kernel := To_Vector ((0 => ((328, 0), 209, 0,
(328, 0), 1)));
- Table.States (61).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 0), 1)));
- Table.States (62).Action_List.Set_Capacity (3);
- Add_Action (Table.States (62), (35, 74, 99), (315, 1), 1, null,
subprogram_specification_1_check'Access);
- Table.States (62).Kernel := To_Vector ((0 => ((315, 1), 210, 0,
(315, 1), 1)));
- Table.States (62).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (315, 1), 1)));
- Table.States (63).Action_List.Set_Capacity (41);
- Add_Action (Table.States (63), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (160, 6), 1,
- null, null);
- Table.States (63).Kernel := To_Vector ((0 => ((160, 6), 212, 0,
(160, 6), 1)));
- Table.States (63).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (160, 6), 1)));
- Table.States (64).Action_List.Set_Capacity (3);
- Add_Action (Table.States (64), 29, (210, 0), 7);
- Add_Action (Table.States (64), 47, (254, 0), 232);
- Add_Action (Table.States (64), 50, (265, 0), 18);
- Table.States (64).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (64), 210, 62);
- Add_Goto (Table.States (64), 254, 233);
- Add_Goto (Table.States (64), 265, 88);
- Add_Goto (Table.States (64), 315, 234);
- Table.States (64).Kernel := To_Vector ((((217, 0), 213, 5,
(2147483647, 0), 0), ((219, 0), 213, 3,
- (2147483647, 0), 0)));
- Table.States (64).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (265, 0), 50, 18)));
- Table.States (65).Action_List.Set_Capacity (41);
- Add_Action (Table.States (65), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (160, 7), 1,
- null, null);
- Table.States (65).Kernel := To_Vector ((0 => ((160, 7), 216, 0,
(160, 7), 1)));
- Table.States (65).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (160, 7), 1)));
- Table.States (66).Action_List.Set_Capacity (41);
- Add_Action (Table.States (66), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (212, 1), 1,
- null, null);
- Table.States (66).Kernel := To_Vector ((0 => ((212, 1), 217, 0,
(212, 1), 1)));
- Table.States (66).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (212, 1), 1)));
- Table.States (67).Action_List.Set_Capacity (41);
- Add_Action (Table.States (67), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (292, 3), 1,
- null, null);
- Table.States (67).Kernel := To_Vector ((0 => ((292, 3), 218, 0,
(292, 3), 1)));
- Table.States (67).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (292, 3), 1)));
- Table.States (68).Action_List.Set_Capacity (41);
- Add_Action (Table.States (68), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (212, 0), 1,
- null, null);
- Table.States (68).Kernel := To_Vector ((0 => ((212, 0), 219, 0,
(212, 0), 1)));
- Table.States (68).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (212, 0), 1)));
- Table.States (69).Action_List.Set_Capacity (47);
- Add_Action (Table.States (69), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (309, 0), 1, null, null);
- Table.States (69).Kernel := To_Vector ((0 => ((309, 0), 220, 0,
(309, 0), 1)));
- Table.States (69).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (309, 0), 1)));
- Table.States (70).Action_List.Set_Capacity (2);
- Add_Action (Table.States (70), 84, (160, 9), 235);
- Add_Action (Table.States (70), 86, (222, 0), 236);
- Table.States (70).Kernel := To_Vector ((((160, 9), 222, 4,
(2147483647, 0), 0), ((189, 0), 222, 3,
- (2147483647, 0), 0), ((222, 0), 222, 2, (2147483647, 0), 0),
((247, 0), 222, 4, (2147483647, 0), 0),
- ((247, 1), 222, 5, (2147483647, 0), 0), ((247, 2), 222, 11,
(2147483647, 0), 0), ((247, 3), 222, 3,
- (2147483647, 0), 0), ((247, 4), 222, 4, (2147483647, 0), 0),
((247, 5), 222, 10, (2147483647, 0),
- 0)));
- Table.States (70).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (160, 9), 84, 235)));
- Table.States (71).Action_List.Set_Capacity (47);
- Add_Action (Table.States (71), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (154, 0), 1, null, null);
- Table.States (71).Kernel := To_Vector ((0 => ((154, 0), 225, 0,
(154, 0), 1)));
- Table.States (71).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (154, 0), 1)));
- Table.States (72).Action_List.Set_Capacity (41);
- Add_Action (Table.States (72), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (328, 1), 1,
- null, null);
- Table.States (72).Kernel := To_Vector ((0 => ((328, 1), 226, 0,
(328, 1), 1)));
- Table.States (72).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 1), 1)));
- Table.States (73).Action_List.Set_Capacity (47);
- Add_Action (Table.States (73), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (154, 2), 1, null, null);
- Table.States (73).Kernel := To_Vector ((0 => ((154, 2), 235, 0,
(154, 2), 1)));
- Table.States (73).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (154, 2), 1)));
- Table.States (74).Action_List.Set_Capacity (6);
- Add_Action (Table.States (74), 76, (118, 0), 237);
- Add_Action (Table.States (74), 85, (126, 0), 238);
- Add_Action (Table.States (74), 87, (296, 0), 239);
- Add_Action (Table.States (74), 99, (264, 0), 240);
- Add_Action (Table.States (74), 104, (325, 0), 241);
- Add_Action (Table.States (74), 105, (325, 1), 242);
- Table.States (74).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (74), 118, 243);
- Add_Goto (Table.States (74), 325, 244);
- Table.States (74).Kernel := To_Vector ((((126, 0), 242, 2,
(2147483647, 0), 0), ((131, 0), 242, 2,
- (2147483647, 0), 0), ((242, 0), 242, 5, (2147483647, 0), 0),
((242, 1), 242, 2, (2147483647, 0), 0),
- ((264, 0), 242, 1, (2147483647, 0), 0), ((275, 0), 242, 3,
(2147483647, 0), 0), ((296, 0), 242, 2,
- (2147483647, 0), 0), ((296, 1), 242, 2, (2147483647, 0), 0),
((296, 2), 242, 2, (2147483647, 0), 0),
- ((296, 3), 242, 2, (2147483647, 0), 0)));
- Table.States (74).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (264, 0), 99, 240)));
- Table.States (75).Action_List.Set_Capacity (41);
- Add_Action (Table.States (75), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (160, 8), 1,
- null, null);
- Table.States (75).Kernel := To_Vector ((0 => ((160, 8), 246, 0,
(160, 8), 1)));
- Table.States (75).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (160, 8), 1)));
- Table.States (76).Action_List.Set_Capacity (41);
- Add_Action (Table.States (76), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (160, 10), 1,
- null, null);
- Table.States (76).Kernel := To_Vector ((0 => ((160, 10), 247, 0,
(160, 10), 1)));
- Table.States (76).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (160, 10), 1)));
- Table.States (77).Action_List.Set_Capacity (41);
- Add_Action (Table.States (77), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (292, 0), 1,
- null, null);
- Table.States (77).Kernel := To_Vector ((0 => ((292, 0), 248, 0,
(292, 0), 1)));
- Table.States (77).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (292, 0), 1)));
- Table.States (78).Action_List.Set_Capacity (3);
- Add_Action (Table.States (78), 25, (182, 0), 245);
- Add_Action (Table.States (78), 29, (210, 0), 246);
- Add_Action (Table.States (78), 50, (216, 1), 247);
- Table.States (78).Goto_List.Set_Capacity (3);
- Add_Goto (Table.States (78), 210, 248);
- Add_Goto (Table.States (78), 265, 249);
- Add_Goto (Table.States (78), 315, 250);
- Table.States (78).Kernel := To_Vector ((((115, 0), 249, 5,
(2147483647, 0), 0), ((182, 0), 249, 6,
- (2147483647, 0), 0), ((182, 1), 249, 3, (2147483647, 0), 0),
((196, 0), 249, 7, (2147483647, 0), 0),
- ((216, 1), 249, 6, (2147483647, 0), 0), ((216, 2), 249, 6,
(2147483647, 0), 0), ((246, 0), 249, 5,
- (2147483647, 0), 0), ((310, 0), 249, 6, (2147483647, 0), 0),
((311, 0), 249, 5, (2147483647, 0), 0),
- ((312, 0), 249, 3, (2147483647, 0), 0), ((314, 0), 249, 5,
(2147483647, 0), 0)));
- Table.States (78).Minimal_Complete_Actions := To_Vector (((Shift,
(182, 0), 25, 245), (Shift, (216, 1),
- 50, 247)));
- Table.States (79).Action_List.Set_Capacity (41);
- Add_Action (Table.States (79), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (266, 1), 1,
- null, null);
- Table.States (79).Kernel := To_Vector ((0 => ((266, 1), 250, 0,
(266, 1), 1)));
- Table.States (79).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (266, 1), 1)));
- Table.States (80).Action_List.Set_Capacity (41);
- Add_Action (Table.States (80), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (138, 1), 1,
- null, null);
- Table.States (80).Kernel := To_Vector ((0 => ((138, 1), 251, 0,
(138, 1), 1)));
- Table.States (80).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (138, 1), 1)));
- Table.States (81).Action_List.Set_Capacity (41);
- Add_Action (Table.States (81), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (160, 11), 1,
- null, null);
- Table.States (81).Kernel := To_Vector ((0 => ((160, 11), 252, 0,
(160, 11), 1)));
- Table.States (81).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (160, 11), 1)));
- Table.States (82).Action_List.Set_Capacity (41);
- Add_Action (Table.States (82), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (292, 1), 1,
- null, null);
- Table.States (82).Kernel := To_Vector ((0 => ((292, 1), 253, 0,
(292, 1), 1)));
- Table.States (82).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (292, 1), 1)));
- Table.States (83).Action_List.Set_Capacity (1);
- Add_Action (Table.States (83), 99, (252, 0), 251);
- Table.States (83).Kernel := To_Vector ((0 => ((252, 0), 254, 1,
(2147483647, 0), 0)));
- Table.States (83).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (252, 0), 99, 251)));
- Table.States (84).Action_List.Set_Capacity (47);
- Add_Action (Table.States (84), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (306, 10), 1, null, null);
- Table.States (84).Kernel := To_Vector ((0 => ((306, 10), 260, 0,
(306, 10), 1)));
- Table.States (84).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (306, 10), 1)));
- Table.States (85).Action_List.Set_Capacity (41);
- Add_Action (Table.States (85), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (328, 3), 1,
- null, null);
- Table.States (85).Kernel := To_Vector ((0 => ((328, 3), 262, 0,
(328, 3), 1)));
- Table.States (85).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 3), 1)));
- Table.States (86).Action_List.Set_Capacity (41);
- Add_Action (Table.States (86), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (328, 2), 1,
- null, null);
- Table.States (86).Kernel := To_Vector ((0 => ((328, 2), 263, 0,
(328, 2), 1)));
- Table.States (86).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (328, 2), 1)));
- Table.States (87).Action_List.Set_Capacity (47);
- Add_Action (Table.States (87), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (306, 4), 1, null, null);
- Table.States (87).Kernel := To_Vector ((0 => ((306, 4), 264, 0,
(306, 4), 1)));
- Table.States (87).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (306, 4), 1)));
- Table.States (88).Action_List.Set_Capacity (3);
- Add_Action (Table.States (88), (35, 74, 99), (315, 0), 1, null,
subprogram_specification_0_check'Access);
- Table.States (88).Kernel := To_Vector ((0 => ((315, 0), 265, 0,
(315, 0), 1)));
- Table.States (88).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (315, 0), 1)));
- Table.States (89).Action_List.Set_Capacity (41);
- Add_Action (Table.States (89), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (137, 0), 1,
- null, null);
- Table.States (89).Kernel := To_Vector ((0 => ((137, 0), 266, 0,
(137, 0), 1)));
- Table.States (89).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (137, 0), 1)));
- Table.States (90).Action_List.Set_Capacity (41);
- Add_Action (Table.States (90), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (266, 3), 1,
- null, null);
- Table.States (90).Kernel := To_Vector ((0 => ((266, 3), 267, 0,
(266, 3), 1)));
- Table.States (90).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (266, 3), 1)));
- Table.States (91).Action_List.Set_Capacity (41);
- Add_Action (Table.States (91), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (138, 3), 1,
- null, null);
- Table.States (91).Kernel := To_Vector ((0 => ((138, 3), 268, 0,
(138, 3), 1)));
- Table.States (91).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (138, 3), 1)));
- Table.States (92).Action_List.Set_Capacity (41);
- Add_Action (Table.States (92), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (209, 2), 1,
- null, null);
- Table.States (92).Kernel := To_Vector ((0 => ((209, 2), 274, 0,
(209, 2), 1)));
- Table.States (92).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (209, 2), 1)));
- Table.States (93).Action_List.Set_Capacity (65);
- Add_Action (Table.States (93), (4, 5, 10, 13, 15, 17, 18, 20, 21,
22, 23, 27, 28, 31, 32, 33, 35, 37, 38,
- 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74,
75, 76, 78, 79, 80, 81, 82, 85, 86, 87, 88,
- 89, 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104,
105, 107, 108, 109), (242, 4), 1, null,
- null);
- Table.States (93).Kernel := To_Vector ((0 => ((242, 4), 275, 0,
(242, 4), 1)));
- Table.States (93).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (242, 4), 1)));
- Table.States (94).Action_List.Set_Capacity (47);
- Add_Action (Table.States (94), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (306, 9), 1, null, null);
- Table.States (94).Kernel := To_Vector ((0 => ((306, 9), 279, 0,
(306, 9), 1)));
- Table.States (94).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (306, 9), 1)));
- Table.States (95).Action_List.Set_Capacity (42);
- Add_Action (Table.States (95), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 72, 73,
74, 81, 96, 107, 108, 109, 110), (124, 2),
- 1, null, null);
- Table.States (95).Kernel := To_Vector ((0 => ((124, 2), 284, 0,
(124, 2), 1)));
- Table.States (95).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (124, 2), 1)));
- Table.States (96).Action_List.Set_Capacity (41);
- Add_Action (Table.States (96), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (160, 12), 1,
- null, null);
- Table.States (96).Kernel := To_Vector ((0 => ((160, 12), 292, 0,
(160, 12), 1)));
- Table.States (96).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (160, 12), 1)));
- Table.States (97).Action_List.Set_Capacity (47);
- Add_Action (Table.States (97), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (306, 6), 1, null, null);
- Table.States (97).Kernel := To_Vector ((0 => ((306, 6), 293, 0,
(306, 6), 1)));
- Table.States (97).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (306, 6), 1)));
- Table.States (98).Action_List.Set_Capacity (65);
- Add_Action (Table.States (98), (4, 5, 10, 13, 15, 17, 18, 20, 21,
22, 23, 27, 28, 31, 32, 33, 35, 37, 38,
- 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74,
75, 76, 78, 79, 80, 81, 82, 85, 86, 87, 88,
- 89, 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104,
105, 107, 108, 109), (242, 2), 1, null,
- name_2_check'Access);
- Table.States (98).Kernel := To_Vector ((0 => ((242, 2), 296, 0,
(242, 2), 1)));
- Table.States (98).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (242, 2), 1)));
- Table.States (99).Action_List.Set_Capacity (47);
- Add_Action (Table.States (99), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (301, 0), 1, null, null);
- Table.States (99).Kernel := To_Vector ((0 => ((301, 0), 297, 0,
(301, 0), 1)));
- Table.States (99).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (301, 0), 1)));
- Table.States (100).Action_List.Set_Capacity (47);
- Add_Action (Table.States (100), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (154, 6), 1, null, null);
- Table.States (100).Kernel := To_Vector ((0 => ((154, 6), 301, 0,
(154, 6), 1)));
- Table.States (100).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (154, 6), 1)));
- Table.States (101).Action_List.Set_Capacity (47);
- Add_Action (Table.States (101), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (306, 5), 1, null, null);
- Table.States (101).Kernel := To_Vector ((0 => ((306, 5), 305, 0,
(306, 5), 1)));
- Table.States (101).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (306, 5), 1)));
- Table.States (102).Action_List.Set_Capacity (47);
- Add_Action (Table.States (102), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (309, 1), 1, null, null);
- Table.States (102).Kernel := To_Vector ((0 => ((309, 1), 306, 0,
(309, 1), 1)));
- Table.States (102).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (309, 1), 1)));
- Table.States (103).Action_List.Set_Capacity (41);
- Add_Action (Table.States (103), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (247, 7), 1,
- null, null);
- Table.States (103).Kernel := To_Vector ((0 => ((247, 7), 307, 0,
(247, 7), 1)));
- Table.States (103).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (247, 7), 1)));
- Table.States (104).Action_List.Set_Capacity (41);
- Add_Action (Table.States (104), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (247, 6), 1,
- null, null);
- Table.States (104).Kernel := To_Vector ((0 => ((247, 6), 308, 0,
(247, 6), 1)));
- Table.States (104).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (247, 6), 1)));
- Table.States (105).Action_List.Set_Capacity (40);
- Add_Action (Table.States (105), (4, 5, 13, 15, 17, 18, 25, 27, 28,
29, 30, 31, 32, 36, 37, 40, 41, 46, 47,
- 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 81,
96, 107, 108, 109, 110), (145, 4), 1,
- null, null);
- Table.States (105).Kernel := To_Vector ((0 => ((145, 4), 309, 0,
(145, 4), 1)));
- Table.States (105).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (145, 4), 1)));
- Table.States (106).Action_List.Set_Capacity (41);
- Add_Action (Table.States (106), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (266, 0), 1,
- null, null);
- Table.States (106).Kernel := To_Vector ((0 => ((266, 0), 310, 0,
(266, 0), 1)));
- Table.States (106).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (266, 0), 1)));
- Table.States (107).Action_List.Set_Capacity (41);
- Add_Action (Table.States (107), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (138, 0), 1,
- null, null);
- Table.States (107).Kernel := To_Vector ((0 => ((138, 0), 311, 0,
(138, 0), 1)));
- Table.States (107).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (138, 0), 1)));
- Table.States (108).Action_List.Set_Capacity (41);
- Add_Action (Table.States (108), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (160, 13), 1,
- null, null);
- Table.States (108).Kernel := To_Vector ((0 => ((160, 13), 312,
0, (160, 13), 1)));
- Table.States (108).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (160, 13), 1)));
- Table.States (109).Action_List.Set_Capacity (41);
- Add_Action (Table.States (109), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (292, 2), 1,
- null, null);
- Table.States (109).Kernel := To_Vector ((0 => ((292, 2), 314, 0,
(292, 2), 1)));
- Table.States (109).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (292, 2), 1)));
- Table.States (110).Action_List.Set_Capacity (41);
- Add_Action (Table.States (110), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (160, 14), 1,
- null, null);
- Table.States (110).Kernel := To_Vector ((0 => ((160, 14), 316,
0, (160, 14), 1)));
- Table.States (110).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (160, 14), 1)));
- Table.States (111).Action_List.Set_Capacity (40);
- Add_Action (Table.States (111), (4, 5, 13, 15, 17, 18, 25, 27, 28,
29, 30, 31, 32, 36, 37, 40, 41, 46, 47,
- 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 81,
96, 107, 108, 109, 110), (145, 1), 1,
- null, null);
- Table.States (111).Kernel := To_Vector ((0 => ((145, 1), 318, 0,
(145, 1), 1)));
- Table.States (111).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (145, 1), 1)));
- Table.States (112).Action_List.Set_Capacity (41);
- Add_Action (Table.States (112), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (266, 2), 1,
- null, null);
- Table.States (112).Kernel := To_Vector ((0 => ((266, 2), 319, 0,
(266, 2), 1)));
- Table.States (112).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (266, 2), 1)));
- Table.States (113).Action_List.Set_Capacity (41);
- Add_Action (Table.States (113), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (138, 2), 1,
- null, null);
- Table.States (113).Kernel := To_Vector ((0 => ((138, 2), 320, 0,
(138, 2), 1)));
- Table.States (113).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (138, 2), 1)));
- Table.States (114).Action_List.Set_Capacity (41);
- Add_Action (Table.States (114), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (209, 1), 1,
- null, null);
- Table.States (114).Kernel := To_Vector ((0 => ((209, 1), 322, 0,
(209, 1), 1)));
- Table.States (114).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (209, 1), 1)));
- Table.States (115).Action_List.Set_Capacity (47);
- Add_Action (Table.States (115), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (301, 1), 1, null, null);
- Table.States (115).Kernel := To_Vector ((0 => ((301, 1), 326, 0,
(301, 1), 1)));
- Table.States (115).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (301, 1), 1)));
- Table.States (116).Action_List.Set_Capacity (41);
- Add_Action (Table.States (116), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (160, 15), 1,
- null, null);
- Table.States (116).Kernel := To_Vector ((0 => ((160, 15), 328,
0, (160, 15), 1)));
- Table.States (116).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (160, 15), 1)));
- Table.States (117).Action_List.Set_Capacity (41);
- Add_Action (Table.States (117), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (160, 16), 1,
- null, null);
- Table.States (117).Kernel := To_Vector ((0 => ((160, 16), 334,
0, (160, 16), 1)));
- Table.States (117).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (160, 16), 1)));
- Table.States (118).Action_List.Set_Capacity (40);
- Add_Action (Table.States (118), (4, 5, 13, 15, 17, 18, 25, 27, 28,
29, 30, 31, 32, 36, 37, 40, 41, 46, 47,
- 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 81,
96, 107, 108, 109, 110), (145, 0), 1,
- null, null);
- Table.States (118).Kernel := To_Vector ((0 => ((145, 0), 335, 0,
(145, 0), 1)));
- Table.States (118).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (145, 0), 1)));
- Table.States (119).Action_List.Set_Capacity (3);
- Add_Action (Table.States (119), 21, Reduce, (119, 1), 0, null,
null);
- Add_Action (Table.States (119), 76, (118, 0), 252);
- Add_Conflict (Table.States (119), 76, (119, 1), 0, null, null);
- Add_Action (Table.States (119), 99, Reduce, (119, 1), 0, null,
null);
- Table.States (119).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (119), 118, 253);
- Add_Goto (Table.States (119), 119, 254);
- Table.States (119).Kernel := To_Vector ((((116, 0), 107, 3,
(2147483647, 0), 0), ((116, 1), 107, 1,
- (2147483647, 0), 0)));
- Table.States (119).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (119, 1), 0)));
- Table.States (120).Action_List.Set_Capacity (64);
- Add_Action (Table.States (120), (4, 5, 10, 13, 15, 17, 18, 20, 21,
22, 23, 27, 28, 31, 32, 33, 35, 37, 38,
- 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 73, 74, 75,
76, 78, 79, 80, 81, 82, 85, 86, 87, 88, 89,
- 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105,
107, 108, 109), (242, 5), 1,
- name_5'Access, name_5_check'Access);
- Table.States (120).Kernel := To_Vector ((0 => ((242, 5), 107, 0,
(242, 5), 1)));
- Table.States (120).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (242, 5), 1)));
- Table.States (121).Action_List.Set_Capacity (5);
- Add_Action (Table.States (121), 76, (118, 0), 237);
- Add_Action (Table.States (121), 87, (296, 0), 239);
- Add_Action (Table.States (121), 99, (306, 8), 255);
- Add_Action (Table.States (121), 104, (325, 0), 241);
- Add_Action (Table.States (121), 105, (325, 1), 242);
- Table.States (121).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (121), 118, 243);
- Add_Goto (Table.States (121), 325, 244);
- Table.States (121).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((242, 0), 242, 5,
- (2147483647, 0), 0), ((242, 1), 242, 2, (2147483647, 0), 0),
((275, 0), 242, 3, (2147483647, 0), 0),
- ((296, 0), 242, 2, (2147483647, 0), 0), ((296, 1), 242, 2,
(2147483647, 0), 0), ((296, 2), 242, 2,
- (2147483647, 0), 0), ((296, 3), 242, 2, (2147483647, 0), 0),
((306, 8), 242, 1, (2147483647, 0),
- 0)));
- Table.States (121).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (306, 8), 99, 255)));
- Table.States (122).Action_List.Set_Capacity (9);
- Add_Action (Table.States (122), 39, (261, 4), 123);
- Add_Action (Table.States (122), 41, (261, 1), 125);
- Add_Action (Table.States (122), 76, (120, 0), 127);
- Add_Action (Table.States (122), 77, (120, 5), 128);
- Add_Action (Table.States (122), 81, (242, 8), 31);
- Add_Action (Table.States (122), 106, (261, 0), 131);
- Add_Action (Table.States (122), 107, (242, 5), 120);
- Add_Action (Table.States (122), 108, (242, 7), 34);
- Add_Action (Table.States (122), 109, (242, 6), 35);
- Table.States (122).Goto_List.Set_Capacity (6);
- Add_Goto (Table.States (122), 120, 132);
- Add_Goto (Table.States (122), 131, 42);
- Add_Goto (Table.States (122), 242, 136);
- Add_Goto (Table.States (122), 261, 256);
- Add_Goto (Table.States (122), 275, 93);
- Add_Goto (Table.States (122), 296, 98);
- Table.States (122).Kernel := To_Vector ((0 => ((200, 2), 3, 1,
(2147483647, 0), 0)));
- Table.States (122).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (123).Action_List.Set_Capacity (4);
- Add_Action (Table.States (123), 81, (242, 8), 31);
- Add_Action (Table.States (123), 107, (242, 5), 120);
- Add_Action (Table.States (123), 108, (242, 7), 34);
- Add_Action (Table.States (123), 109, (242, 6), 35);
- Table.States (123).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (123), 131, 42);
- Add_Goto (Table.States (123), 242, 257);
- Add_Goto (Table.States (123), 275, 93);
- Add_Goto (Table.States (123), 296, 98);
- Table.States (123).Kernel := To_Vector ((0 => ((261, 4), 39, 1,
(2147483647, 0), 0)));
- Table.States (123).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (124).Action_List.Set_Capacity (9);
- Add_Action (Table.States (124), 39, (261, 4), 123);
- Add_Action (Table.States (124), 41, (261, 1), 125);
- Add_Action (Table.States (124), 76, (120, 0), 127);
- Add_Action (Table.States (124), 77, (120, 5), 128);
- Add_Action (Table.States (124), 81, (242, 8), 31);
- Add_Action (Table.States (124), 106, (261, 0), 131);
- Add_Action (Table.States (124), 107, (242, 5), 120);
- Add_Action (Table.States (124), 108, (242, 7), 34);
- Add_Action (Table.States (124), 109, (242, 6), 35);
- Table.States (124).Goto_List.Set_Capacity (6);
- Add_Goto (Table.States (124), 120, 132);
- Add_Goto (Table.States (124), 131, 42);
- Add_Goto (Table.States (124), 242, 136);
- Add_Goto (Table.States (124), 261, 258);
- Add_Goto (Table.States (124), 275, 93);
- Add_Goto (Table.States (124), 296, 98);
- Table.States (124).Kernel := To_Vector ((0 => ((200, 3), 40, 1,
(2147483647, 0), 0)));
- Table.States (124).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (125).Action_List.Set_Capacity (37);
- Add_Action (Table.States (125), (10, 20, 21, 22, 23, 33, 35, 37,
38, 40, 42, 43, 53, 55, 68, 74, 75, 78,
- 79, 80, 82, 85, 86, 88, 89, 90, 91, 92, 94, 95, 97, 98, 99, 100,
101, 102, 103), (261, 1), 1, null, null);
- Table.States (125).Kernel := To_Vector ((0 => ((261, 1), 41, 0,
(261, 1), 1)));
- Table.States (125).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (261, 1), 1)));
- Table.States (126).Action_List.Set_Capacity (4);
- Add_Action (Table.States (126), 81, (242, 8), 31);
- Add_Action (Table.States (126), 107, (242, 5), 120);
- Add_Action (Table.States (126), 108, (242, 7), 34);
- Add_Action (Table.States (126), 109, (242, 6), 35);
- Table.States (126).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (126), 131, 42);
- Add_Goto (Table.States (126), 242, 259);
- Add_Goto (Table.States (126), 275, 93);
- Add_Goto (Table.States (126), 296, 98);
- Table.States (126).Kernel := To_Vector ((((278, 0), 52, 2,
(2147483647, 0), 0), ((278, 1), 52, 1,
- (2147483647, 0), 0)));
- Table.States (126).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (127).Action_List.Set_Capacity (23);
- Add_Action (Table.States (127), 3, (200, 2), 122);
- Add_Action (Table.States (127), 15, (139, 0), 260);
- Add_Action (Table.States (127), 28, (127, 6), 261);
- Add_Action (Table.States (127), 32, (224, 0), 262);
- Add_Action (Table.States (127), 39, (261, 4), 123);
- Add_Action (Table.States (127), 40, (168, 1), 263);
- Add_Action (Table.States (127), 41, (120, 1), 264);
- Add_Action (Table.States (127), 44, (168, 3), 265);
- Add_Action (Table.States (127), 52, (278, 0), 126);
- Add_Action (Table.States (127), 74, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (127), 76, (120, 0), 127);
- Add_Action (Table.States (127), 77, (120, 5), 128);
- Add_Action (Table.States (127), 78, Reduce, (127, 5), 0, null,
null);
- Add_Action (Table.States (127), 81, (242, 8), 31);
- Add_Action (Table.States (127), 82, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (127), 86, Reduce, (127, 5), 0, null,
null);
- Add_Action (Table.States (127), 90, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (127), 97, (333, 1), 129);
- Add_Action (Table.States (127), 98, (333, 0), 130);
- Add_Action (Table.States (127), 106, (261, 0), 131);
- Add_Action (Table.States (127), 107, (242, 5), 120);
- Add_Action (Table.States (127), 108, (242, 7), 34);
- Add_Action (Table.States (127), 109, (127, 0), 266);
- Table.States (127).Goto_List.Set_Capacity (29);
- Add_Goto (Table.States (127), 120, 132);
- Add_Goto (Table.States (127), 127, 267);
- Add_Goto (Table.States (127), 128, 268);
- Add_Goto (Table.States (127), 131, 42);
- Add_Goto (Table.States (127), 139, 269);
- Add_Goto (Table.States (127), 156, 270);
- Add_Goto (Table.States (127), 168, 271);
- Add_Goto (Table.States (127), 169, 272);
- Add_Goto (Table.States (127), 194, 273);
- Add_Goto (Table.States (127), 195, 274);
- Add_Goto (Table.States (127), 200, 135);
- Add_Goto (Table.States (127), 224, 275);
- Add_Goto (Table.States (127), 242, 276);
- Add_Goto (Table.States (127), 261, 137);
- Add_Goto (Table.States (127), 275, 93);
- Add_Goto (Table.States (127), 276, 277);
- Add_Goto (Table.States (127), 278, 138);
- Add_Goto (Table.States (127), 280, 278);
- Add_Goto (Table.States (127), 285, 139);
- Add_Goto (Table.States (127), 286, 140);
- Add_Goto (Table.States (127), 287, 141);
- Add_Goto (Table.States (127), 288, 142);
- Add_Goto (Table.States (127), 289, 143);
- Add_Goto (Table.States (127), 290, 144);
- Add_Goto (Table.States (127), 296, 98);
- Add_Goto (Table.States (127), 304, 279);
- Add_Goto (Table.States (127), 323, 146);
- Add_Goto (Table.States (127), 324, 147);
- Add_Goto (Table.States (127), 333, 148);
- Table.States (127).Kernel := To_Vector ((((120, 0), 76, 1,
(2147483647, 0), 0), ((120, 1), 76, 3,
- (2147483647, 0), 0), ((120, 2), 76, 4, (2147483647, 0), 0),
((120, 3), 76, 2, (2147483647, 0), 0),
- ((120, 4), 76, 4, (2147483647, 0), 0), ((120, 6), 76, 3,
(2147483647, 0), 0)));
- Table.States (127).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (128, 1), 0)));
- Table.States (128).Action_List.Set_Capacity (14);
- Add_Action (Table.States (128), 3, (200, 2), 122);
- Add_Action (Table.States (128), 39, (261, 4), 123);
- Add_Action (Table.States (128), 40, (200, 3), 124);
- Add_Action (Table.States (128), 41, (261, 1), 125);
- Add_Action (Table.States (128), 52, (278, 0), 126);
- Add_Action (Table.States (128), 76, (120, 0), 127);
- Add_Action (Table.States (128), 77, (120, 5), 128);
- Add_Action (Table.States (128), 81, (242, 8), 31);
- Add_Action (Table.States (128), 97, (333, 1), 129);
- Add_Action (Table.States (128), 98, (333, 0), 130);
- Add_Action (Table.States (128), 106, (261, 0), 131);
- Add_Action (Table.States (128), 107, (242, 5), 120);
- Add_Action (Table.States (128), 108, (242, 7), 34);
- Add_Action (Table.States (128), 109, (242, 6), 35);
- Table.States (128).Goto_List.Set_Capacity (19);
- Add_Goto (Table.States (128), 120, 132);
- Add_Goto (Table.States (128), 131, 42);
- Add_Goto (Table.States (128), 194, 280);
- Add_Goto (Table.States (128), 200, 135);
- Add_Goto (Table.States (128), 242, 136);
- Add_Goto (Table.States (128), 261, 137);
- Add_Goto (Table.States (128), 275, 93);
- Add_Goto (Table.States (128), 278, 138);
- Add_Goto (Table.States (128), 285, 139);
- Add_Goto (Table.States (128), 286, 140);
- Add_Goto (Table.States (128), 287, 141);
- Add_Goto (Table.States (128), 288, 142);
- Add_Goto (Table.States (128), 289, 143);
- Add_Goto (Table.States (128), 290, 144);
- Add_Goto (Table.States (128), 296, 98);
- Add_Goto (Table.States (128), 304, 145);
- Add_Goto (Table.States (128), 323, 146);
- Add_Goto (Table.States (128), 324, 147);
- Add_Goto (Table.States (128), 333, 148);
- Table.States (128).Kernel := To_Vector ((0 => ((120, 5), 77, 4,
(2147483647, 0), 0)));
- Table.States (128).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (129).Action_List.Set_Capacity (11);
- Add_Action (Table.States (129), (3, 39, 40, 41, 76, 77, 81, 106,
107, 108, 109), (333, 1), 1, null, null);
- Table.States (129).Kernel := To_Vector ((0 => ((333, 1), 97, 0,
(333, 1), 1)));
- Table.States (129).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (333, 1), 1)));
- Table.States (130).Action_List.Set_Capacity (11);
- Add_Action (Table.States (130), (3, 39, 40, 41, 76, 77, 81, 106,
107, 108, 109), (333, 0), 1, null, null);
- Table.States (130).Kernel := To_Vector ((0 => ((333, 0), 98, 0,
(333, 0), 1)));
- Table.States (130).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (333, 0), 1)));
- Table.States (131).Action_List.Set_Capacity (37);
- Add_Action (Table.States (131), (10, 20, 21, 22, 23, 33, 35, 37,
38, 40, 42, 43, 53, 55, 68, 74, 75, 78,
- 79, 80, 82, 85, 86, 88, 89, 90, 91, 92, 94, 95, 97, 98, 99, 100,
101, 102, 103), (261, 0), 1,
- primary_0'Access, null);
- Table.States (131).Kernel := To_Vector ((0 => ((261, 0), 106, 0,
(261, 0), 1)));
- Table.States (131).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (261, 0), 1)));
- Table.States (132).Action_List.Set_Capacity (37);
- Add_Action (Table.States (132), (10, 20, 21, 22, 23, 33, 35, 37,
38, 40, 42, 43, 53, 55, 68, 74, 75, 78,
- 79, 80, 82, 85, 86, 88, 89, 90, 91, 92, 94, 95, 97, 98, 99, 100,
101, 102, 103), (261, 2), 1,
- primary_2'Access, null);
- Table.States (132).Kernel := To_Vector ((0 => ((261, 2), 120, 0,
(261, 2), 1)));
- Table.States (132).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (261, 2), 1)));
- Table.States (133).Action_List.Set_Capacity (18);
- Add_Action (Table.States (133), (10, 20, 21, 22, 23, 35, 37, 43,
53, 68, 74, 75, 78, 79, 82, 86, 90, 99),
- (195, 0), 1, null, null);
- Table.States (133).Kernel := To_Vector ((0 => ((195, 0), 194, 0,
(195, 0), 1)));
- Table.States (133).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 0), 1)));
- Table.States (134).Action_List.Set_Capacity (1);
- Add_Action (Table.States (134), 35, (142, 0), 281);
- Table.States (134).Kernel := To_Vector ((0 => ((142, 0), 195, 6,
(2147483647, 0), 0)));
- Table.States (134).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (142, 0), 35, 281)));
- end Subr_2;
- procedure Subr_3
- is begin
- Table.States (135).Action_List.Set_Capacity (36);
- Add_Action (Table.States (135), (10, 20, 21, 22, 23, 33, 35, 37,
38, 40, 42, 43, 53, 55, 68, 74, 75, 78,
- 79, 80, 82, 85, 86, 88, 89, 90, 91, 92, 94, 95, 97, 98, 99, 100,
101, 102), (323, 1), 1, null, null);
- Table.States (135).Kernel := To_Vector ((0 => ((323, 1), 200, 0,
(323, 1), 1)));
- Table.States (135).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (323, 1), 1)));
- Table.States (136).Action_List.Set_Capacity (41);
- Add_Action (Table.States (136), 10, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 20, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 21, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 22, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 23, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 33, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 35, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 37, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 38, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 40, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 42, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 43, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 53, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 55, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 68, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 74, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 75, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 76, (118, 0), 237);
- Add_Action (Table.States (136), 78, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 79, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 80, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 82, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 85, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 86, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 87, (296, 0), 239);
- Add_Action (Table.States (136), 88, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 89, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 90, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 91, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 92, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 94, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 95, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 97, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 98, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 99, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 100, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 101, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 102, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 103, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (136), 104, (325, 0), 241);
- Add_Action (Table.States (136), 105, (325, 1), 242);
- Table.States (136).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (136), 118, 243);
- Add_Goto (Table.States (136), 325, 244);
- Table.States (136).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((242, 0), 242, 5,
- (2147483647, 0), 0), ((242, 1), 242, 2, (2147483647, 0), 0),
((261, 3), 242, 0, (261, 3), 1), ((275,
- 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (136).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (261, 3), 1)));
- Table.States (137).Action_List.Set_Capacity (37);
- Add_Action (Table.States (137), 10, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 20, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 21, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 22, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 23, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 33, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 35, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 37, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 38, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 40, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 42, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 43, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 53, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 55, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 68, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 74, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 75, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 78, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 79, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 80, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 82, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 85, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 86, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 88, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 89, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 90, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 91, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 92, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 94, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 95, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 97, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 98, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 99, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 100, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 101, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 102, Reduce, (200, 1), 1, null,
null);
- Add_Action (Table.States (137), 103, (200, 0), 282);
- Table.States (137).Kernel := To_Vector ((((200, 0), 261, 2,
(2147483647, 0), 0), ((200, 1), 261, 0,
- (200, 1), 1)));
- Table.States (137).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (200, 1), 1)));
- Table.States (138).Action_List.Set_Capacity (18);
- Add_Action (Table.States (138), (10, 20, 21, 22, 23, 35, 37, 43,
53, 68, 74, 75, 78, 79, 82, 86, 90, 99),
- (290, 4), 1, null, null);
- Table.States (138).Kernel := To_Vector ((0 => ((290, 4), 278, 0,
(290, 4), 1)));
- Table.States (138).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (290, 4), 1)));
- Table.States (139).Action_List.Set_Capacity (18);
- Add_Action (Table.States (139), 10, (285, 0), 283);
- Add_Conflict (Table.States (139), 10, (194, 1), 1, null, null);
- Add_Action (Table.States (139), 20, Reduce, (194, 1), 1, null,
null);
- Add_Action (Table.States (139), 21, Reduce, (194, 1), 1, null,
null);
- Add_Action (Table.States (139), 22, Reduce, (194, 1), 1, null,
null);
- Add_Action (Table.States (139), 23, Reduce, (194, 1), 1, null,
null);
- Add_Action (Table.States (139), 35, Reduce, (194, 1), 1, null,
null);
- Add_Action (Table.States (139), 37, Reduce, (194, 1), 1, null,
null);
- Add_Action (Table.States (139), 43, Reduce, (194, 1), 1, null,
null);
- Add_Action (Table.States (139), 53, Reduce, (194, 1), 1, null,
null);
- Add_Action (Table.States (139), 68, Reduce, (194, 1), 1, null,
null);
- Add_Action (Table.States (139), 74, Reduce, (194, 1), 1, null,
null);
- Add_Action (Table.States (139), 75, Reduce, (194, 1), 1, null,
null);
- Add_Action (Table.States (139), 78, Reduce, (194, 1), 1, null,
null);
- Add_Action (Table.States (139), 79, Reduce, (194, 1), 1, null,
null);
- Add_Action (Table.States (139), 82, Reduce, (194, 1), 1, null,
null);
- Add_Action (Table.States (139), 86, Reduce, (194, 1), 1, null,
null);
- Add_Action (Table.States (139), 90, Reduce, (194, 1), 1, null,
null);
- Add_Action (Table.States (139), 99, Reduce, (194, 1), 1, null,
null);
- Table.States (139).Kernel := To_Vector ((((194, 1), 285, 0,
(194, 1), 1), ((285, 0), 285, 2,
- (2147483647, 0), 0)));
- Table.States (139).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (194, 1), 1)));
- Table.States (140).Action_List.Set_Capacity (18);
- Add_Action (Table.States (140), 10, (286, 0), 284);
- Add_Conflict (Table.States (140), 10, (194, 2), 1, null, null);
- Add_Action (Table.States (140), 20, Reduce, (194, 2), 1, null,
null);
- Add_Action (Table.States (140), 21, Reduce, (194, 2), 1, null,
null);
- Add_Action (Table.States (140), 22, Reduce, (194, 2), 1, null,
null);
- Add_Action (Table.States (140), 23, Reduce, (194, 2), 1, null,
null);
- Add_Action (Table.States (140), 35, Reduce, (194, 2), 1, null,
null);
- Add_Action (Table.States (140), 37, Reduce, (194, 2), 1, null,
null);
- Add_Action (Table.States (140), 43, Reduce, (194, 2), 1, null,
null);
- Add_Action (Table.States (140), 53, Reduce, (194, 2), 1, null,
null);
- Add_Action (Table.States (140), 68, Reduce, (194, 2), 1, null,
null);
- Add_Action (Table.States (140), 74, Reduce, (194, 2), 1, null,
null);
- Add_Action (Table.States (140), 75, Reduce, (194, 2), 1, null,
null);
- Add_Action (Table.States (140), 78, Reduce, (194, 2), 1, null,
null);
- Add_Action (Table.States (140), 79, Reduce, (194, 2), 1, null,
null);
- Add_Action (Table.States (140), 82, Reduce, (194, 2), 1, null,
null);
- Add_Action (Table.States (140), 86, Reduce, (194, 2), 1, null,
null);
- Add_Action (Table.States (140), 90, Reduce, (194, 2), 1, null,
null);
- Add_Action (Table.States (140), 99, Reduce, (194, 2), 1, null,
null);
- Table.States (140).Kernel := To_Vector ((((194, 2), 286, 0,
(194, 2), 1), ((286, 0), 286, 3,
- (2147483647, 0), 0)));
- Table.States (140).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (194, 2), 1)));
- Table.States (141).Action_List.Set_Capacity (18);
- Add_Action (Table.States (141), 10, Reduce, (194, 3), 1, null,
null);
- Add_Action (Table.States (141), 20, Reduce, (194, 3), 1, null,
null);
- Add_Action (Table.States (141), 21, Reduce, (194, 3), 1, null,
null);
- Add_Action (Table.States (141), 22, Reduce, (194, 3), 1, null,
null);
- Add_Action (Table.States (141), 23, Reduce, (194, 3), 1, null,
null);
- Add_Action (Table.States (141), 35, Reduce, (194, 3), 1, null,
null);
- Add_Action (Table.States (141), 37, Reduce, (194, 3), 1, null,
null);
- Add_Action (Table.States (141), 43, (287, 0), 285);
- Add_Conflict (Table.States (141), 43, (194, 3), 1, null, null);
- Add_Action (Table.States (141), 53, Reduce, (194, 3), 1, null,
null);
- Add_Action (Table.States (141), 68, Reduce, (194, 3), 1, null,
null);
- Add_Action (Table.States (141), 74, Reduce, (194, 3), 1, null,
null);
- Add_Action (Table.States (141), 75, Reduce, (194, 3), 1, null,
null);
- Add_Action (Table.States (141), 78, Reduce, (194, 3), 1, null,
null);
- Add_Action (Table.States (141), 79, Reduce, (194, 3), 1, null,
null);
- Add_Action (Table.States (141), 82, Reduce, (194, 3), 1, null,
null);
- Add_Action (Table.States (141), 86, Reduce, (194, 3), 1, null,
null);
- Add_Action (Table.States (141), 90, Reduce, (194, 3), 1, null,
null);
- Add_Action (Table.States (141), 99, Reduce, (194, 3), 1, null,
null);
- Table.States (141).Kernel := To_Vector ((((194, 3), 287, 0,
(194, 3), 1), ((287, 0), 287, 2,
- (2147483647, 0), 0)));
- Table.States (141).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (194, 3), 1)));
- Table.States (142).Action_List.Set_Capacity (18);
- Add_Action (Table.States (142), 10, Reduce, (194, 4), 1, null,
null);
- Add_Action (Table.States (142), 20, Reduce, (194, 4), 1, null,
null);
- Add_Action (Table.States (142), 21, Reduce, (194, 4), 1, null,
null);
- Add_Action (Table.States (142), 22, Reduce, (194, 4), 1, null,
null);
- Add_Action (Table.States (142), 23, Reduce, (194, 4), 1, null,
null);
- Add_Action (Table.States (142), 35, Reduce, (194, 4), 1, null,
null);
- Add_Action (Table.States (142), 37, Reduce, (194, 4), 1, null,
null);
- Add_Action (Table.States (142), 43, (288, 0), 286);
- Add_Conflict (Table.States (142), 43, (194, 4), 1, null, null);
- Add_Action (Table.States (142), 53, Reduce, (194, 4), 1, null,
null);
- Add_Action (Table.States (142), 68, Reduce, (194, 4), 1, null,
null);
- Add_Action (Table.States (142), 74, Reduce, (194, 4), 1, null,
null);
- Add_Action (Table.States (142), 75, Reduce, (194, 4), 1, null,
null);
- Add_Action (Table.States (142), 78, Reduce, (194, 4), 1, null,
null);
- Add_Action (Table.States (142), 79, Reduce, (194, 4), 1, null,
null);
- Add_Action (Table.States (142), 82, Reduce, (194, 4), 1, null,
null);
- Add_Action (Table.States (142), 86, Reduce, (194, 4), 1, null,
null);
- Add_Action (Table.States (142), 90, Reduce, (194, 4), 1, null,
null);
- Add_Action (Table.States (142), 99, Reduce, (194, 4), 1, null,
null);
- Table.States (142).Kernel := To_Vector ((((194, 4), 288, 0,
(194, 4), 1), ((288, 0), 288, 3,
- (2147483647, 0), 0)));
- Table.States (142).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (194, 4), 1)));
- Table.States (143).Action_List.Set_Capacity (18);
- Add_Action (Table.States (143), 10, Reduce, (194, 5), 1, null,
null);
- Add_Action (Table.States (143), 20, Reduce, (194, 5), 1, null,
null);
- Add_Action (Table.States (143), 21, Reduce, (194, 5), 1, null,
null);
- Add_Action (Table.States (143), 22, Reduce, (194, 5), 1, null,
null);
- Add_Action (Table.States (143), 23, Reduce, (194, 5), 1, null,
null);
- Add_Action (Table.States (143), 35, Reduce, (194, 5), 1, null,
null);
- Add_Action (Table.States (143), 37, Reduce, (194, 5), 1, null,
null);
- Add_Action (Table.States (143), 43, Reduce, (194, 5), 1, null,
null);
- Add_Action (Table.States (143), 53, Reduce, (194, 5), 1, null,
null);
- Add_Action (Table.States (143), 68, Reduce, (194, 5), 1, null,
null);
- Add_Action (Table.States (143), 74, Reduce, (194, 5), 1, null,
null);
- Add_Action (Table.States (143), 75, (289, 0), 287);
- Add_Conflict (Table.States (143), 75, (194, 5), 1, null, null);
- Add_Action (Table.States (143), 78, Reduce, (194, 5), 1, null,
null);
- Add_Action (Table.States (143), 79, Reduce, (194, 5), 1, null,
null);
- Add_Action (Table.States (143), 82, Reduce, (194, 5), 1, null,
null);
- Add_Action (Table.States (143), 86, Reduce, (194, 5), 1, null,
null);
- Add_Action (Table.States (143), 90, Reduce, (194, 5), 1, null,
null);
- Add_Action (Table.States (143), 99, Reduce, (194, 5), 1, null,
null);
- Table.States (143).Kernel := To_Vector ((((194, 5), 289, 0,
(194, 5), 1), ((289, 0), 289, 2,
- (2147483647, 0), 0)));
- Table.States (143).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (194, 5), 1)));
- Table.States (144).Action_List.Set_Capacity (18);
- Add_Action (Table.States (144), 10, (285, 1), 288);
- Add_Conflict (Table.States (144), 10, (194, 0), 1, null, null);
- Add_Action (Table.States (144), 20, Reduce, (194, 0), 1, null,
null);
- Add_Action (Table.States (144), 21, Reduce, (194, 0), 1, null,
null);
- Add_Action (Table.States (144), 22, Reduce, (194, 0), 1, null,
null);
- Add_Action (Table.States (144), 23, Reduce, (194, 0), 1, null,
null);
- Add_Action (Table.States (144), 35, Reduce, (194, 0), 1, null,
null);
- Add_Action (Table.States (144), 37, Reduce, (194, 0), 1, null,
null);
- Add_Action (Table.States (144), 43, (287, 1), 289);
- Add_Conflict (Table.States (144), 43, (194, 0), 1, null, null);
- Add_Action (Table.States (144), 53, Reduce, (194, 0), 1, null,
null);
- Add_Action (Table.States (144), 68, Reduce, (194, 0), 1, null,
null);
- Add_Action (Table.States (144), 74, Reduce, (194, 0), 1, null,
null);
- Add_Action (Table.States (144), 75, (289, 1), 290);
- Add_Conflict (Table.States (144), 75, (194, 0), 1, null, null);
- Add_Action (Table.States (144), 78, Reduce, (194, 0), 1, null,
null);
- Add_Action (Table.States (144), 79, Reduce, (194, 0), 1, null,
null);
- Add_Action (Table.States (144), 82, Reduce, (194, 0), 1, null,
null);
- Add_Action (Table.States (144), 86, Reduce, (194, 0), 1, null,
null);
- Add_Action (Table.States (144), 90, Reduce, (194, 0), 1, null,
null);
- Add_Action (Table.States (144), 99, Reduce, (194, 0), 1, null,
null);
- Table.States (144).Kernel := To_Vector ((((194, 0), 290, 0,
(194, 0), 1), ((285, 1), 290, 2,
- (2147483647, 0), 0), ((286, 1), 290, 3, (2147483647, 0), 0),
((287, 1), 290, 2, (2147483647, 0), 0),
- ((288, 1), 290, 3, (2147483647, 0), 0), ((289, 1), 290, 2,
(2147483647, 0), 0)));
- Table.States (144).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (194, 0), 1)));
- Table.States (145).Action_List.Set_Capacity (26);
- Add_Action (Table.States (145), 10, Reduce, (290, 3), 1, null,
null);
- Add_Action (Table.States (145), 20, Reduce, (290, 3), 1, null,
null);
- Add_Action (Table.States (145), 21, Reduce, (290, 3), 1, null,
null);
- Add_Action (Table.States (145), 22, Reduce, (290, 3), 1, null,
null);
- Add_Action (Table.States (145), 23, Reduce, (290, 3), 1, null,
null);
- Add_Action (Table.States (145), 33, (290, 1), 291);
- Add_Action (Table.States (145), 35, Reduce, (290, 3), 1, null,
null);
- Add_Action (Table.States (145), 37, Reduce, (290, 3), 1, null,
null);
- Add_Action (Table.States (145), 40, (290, 0), 292);
- Add_Action (Table.States (145), 43, Reduce, (290, 3), 1, null,
null);
- Add_Action (Table.States (145), 53, Reduce, (290, 3), 1, null,
null);
- Add_Action (Table.States (145), 68, Reduce, (290, 3), 1, null,
null);
- Add_Action (Table.States (145), 74, Reduce, (290, 3), 1, null,
null);
- Add_Action (Table.States (145), 75, Reduce, (290, 3), 1, null,
null);
- Add_Action (Table.States (145), 78, Reduce, (290, 3), 1, null,
null);
- Add_Action (Table.States (145), 79, Reduce, (290, 3), 1, null,
null);
- Add_Action (Table.States (145), 82, Reduce, (290, 3), 1, null,
null);
- Add_Action (Table.States (145), 86, Reduce, (290, 3), 1, null,
null);
- Add_Action (Table.States (145), 89, (291, 0), 293);
- Add_Action (Table.States (145), 90, Reduce, (290, 3), 1, null,
null);
- Add_Action (Table.States (145), 91, (291, 4), 294);
- Add_Action (Table.States (145), 92, (291, 5), 295);
- Add_Action (Table.States (145), 94, (291, 2), 296);
- Add_Action (Table.States (145), 95, (291, 3), 297);
- Add_Action (Table.States (145), 99, Reduce, (290, 3), 1, null,
null);
- Add_Action (Table.States (145), 101, (291, 1), 298);
- Table.States (145).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (145), 291, 299);
- Table.States (145).Kernel := To_Vector ((((290, 0), 304, 3,
(2147483647, 0), 0), ((290, 1), 304, 2,
- (2147483647, 0), 0), ((290, 2), 304, 2, (2147483647, 0), 0),
((290, 3), 304, 0, (290, 3), 1)));
- Table.States (145).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (290, 3), 1)));
- Table.States (146).Action_List.Set_Capacity (36);
- Add_Action (Table.States (146), 10, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 20, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 21, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 22, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 23, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 33, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 35, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 37, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 38, (240, 2), 300);
- Add_Action (Table.States (146), 40, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 42, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 43, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 53, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 55, (240, 3), 301);
- Add_Action (Table.States (146), 68, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 74, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 75, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 78, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 79, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 80, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 82, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 85, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 86, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 88, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 89, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 90, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 91, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 92, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 94, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 95, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 97, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 98, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 99, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 100, (240, 1), 302);
- Add_Action (Table.States (146), 101, Reduce, (324, 1), 1, null,
null);
- Add_Action (Table.States (146), 102, (240, 0), 303);
- Table.States (146).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (146), 240, 304);
- Table.States (146).Kernel := To_Vector ((((323, 0), 323, 2,
(2147483647, 0), 0), ((324, 1), 323, 0,
- (324, 1), 1)));
- Table.States (146).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (324, 1), 1)));
- Table.States (147).Action_List.Set_Capacity (32);
- Add_Action (Table.States (147), 10, Reduce, (304, 1), 1, null,
null);
- Add_Action (Table.States (147), 20, Reduce, (304, 1), 1, null,
null);
- Add_Action (Table.States (147), 21, Reduce, (304, 1), 1, null,
null);
- Add_Action (Table.States (147), 22, Reduce, (304, 1), 1, null,
null);
- Add_Action (Table.States (147), 23, Reduce, (304, 1), 1, null,
null);
- Add_Action (Table.States (147), 33, Reduce, (304, 1), 1, null,
null);
- Add_Action (Table.States (147), 35, Reduce, (304, 1), 1, null,
null);
- Add_Action (Table.States (147), 37, Reduce, (304, 1), 1, null,
null);
- Add_Action (Table.States (147), 40, Reduce, (304, 1), 1, null,
null);
- Add_Action (Table.States (147), 42, Reduce, (304, 1), 1, null,
null);
- Add_Action (Table.States (147), 43, Reduce, (304, 1), 1, null,
null);
- Add_Action (Table.States (147), 53, Reduce, (304, 1), 1, null,
null);
- Add_Action (Table.States (147), 68, Reduce, (304, 1), 1, null,
null);
- Add_Action (Table.States (147), 74, Reduce, (304, 1), 1, null,
null);
- Add_Action (Table.States (147), 75, Reduce, (304, 1), 1, null,
null);
- Add_Action (Table.States (147), 78, Reduce, (304, 1), 1, null,
null);
- Add_Action (Table.States (147), 79, Reduce, (304, 1), 1, null,
null);
- Add_Action (Table.States (147), 80, (133, 2), 305);
- Add_Action (Table.States (147), 82, Reduce, (304, 1), 1, null,
null);
- Add_Action (Table.States (147), 85, Reduce, (304, 1), 1, null,
null);
- Add_Action (Table.States (147), 86, Reduce, (304, 1), 1, null,
null);
- Add_Action (Table.States (147), 88, Reduce, (304, 1), 1, null,
null);
- Add_Action (Table.States (147), 89, Reduce, (304, 1), 1, null,
null);
- Add_Action (Table.States (147), 90, Reduce, (304, 1), 1, null,
null);
- Add_Action (Table.States (147), 91, Reduce, (304, 1), 1, null,
null);
- Add_Action (Table.States (147), 92, Reduce, (304, 1), 1, null,
null);
- Add_Action (Table.States (147), 94, Reduce, (304, 1), 1, null,
null);
- Add_Action (Table.States (147), 95, Reduce, (304, 1), 1, null,
null);
- Add_Action (Table.States (147), 97, (133, 1), 306);
- Add_Action (Table.States (147), 98, (133, 0), 307);
- Add_Action (Table.States (147), 99, Reduce, (304, 1), 1, null,
null);
- Add_Action (Table.States (147), 101, Reduce, (304, 1), 1, null,
null);
- Table.States (147).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (147), 133, 308);
- Table.States (147).Kernel := To_Vector ((((304, 1), 324, 0,
(304, 1), 1), ((324, 0), 324, 2,
- (2147483647, 0), 0)));
- Table.States (147).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (304, 1), 1)));
- Table.States (148).Action_List.Set_Capacity (11);
- Add_Action (Table.States (148), 3, (200, 2), 122);
- Add_Action (Table.States (148), 39, (261, 4), 123);
- Add_Action (Table.States (148), 40, (200, 3), 124);
- Add_Action (Table.States (148), 41, (261, 1), 125);
- Add_Action (Table.States (148), 76, (120, 0), 127);
- Add_Action (Table.States (148), 77, (120, 5), 128);
- Add_Action (Table.States (148), 81, (242, 8), 31);
- Add_Action (Table.States (148), 106, (261, 0), 131);
- Add_Action (Table.States (148), 107, (242, 5), 120);
- Add_Action (Table.States (148), 108, (242, 7), 34);
- Add_Action (Table.States (148), 109, (242, 6), 35);
- Table.States (148).Goto_List.Set_Capacity (9);
- Add_Goto (Table.States (148), 120, 132);
- Add_Goto (Table.States (148), 131, 42);
- Add_Goto (Table.States (148), 200, 135);
- Add_Goto (Table.States (148), 242, 136);
- Add_Goto (Table.States (148), 261, 137);
- Add_Goto (Table.States (148), 275, 93);
- Add_Goto (Table.States (148), 296, 98);
- Add_Goto (Table.States (148), 323, 146);
- Add_Goto (Table.States (148), 324, 309);
- Table.States (148).Kernel := To_Vector ((0 => ((304, 0), 333, 1,
(2147483647, 0), 0)));
- Table.States (148).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (149).Action_List.Set_Capacity (15);
- Add_Action (Table.States (149), 3, (200, 2), 122);
- Add_Action (Table.States (149), 39, (261, 4), 123);
- Add_Action (Table.States (149), 40, (200, 3), 124);
- Add_Action (Table.States (149), 41, (261, 1), 125);
- Add_Action (Table.States (149), 52, (278, 0), 126);
- Add_Action (Table.States (149), 76, (120, 0), 127);
- Add_Action (Table.States (149), 77, (120, 5), 128);
- Add_Action (Table.States (149), 81, (242, 8), 31);
- Add_Action (Table.States (149), 97, (333, 1), 129);
- Add_Action (Table.States (149), 98, (333, 0), 130);
- Add_Action (Table.States (149), 99, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (149), 106, (261, 0), 131);
- Add_Action (Table.States (149), 107, (242, 5), 120);
- Add_Action (Table.States (149), 108, (242, 7), 34);
- Add_Action (Table.States (149), 109, (242, 6), 35);
- Table.States (149).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (149), 120, 132);
- Add_Goto (Table.States (149), 131, 42);
- Add_Goto (Table.States (149), 194, 133);
- Add_Goto (Table.States (149), 195, 310);
- Add_Goto (Table.States (149), 200, 135);
- Add_Goto (Table.States (149), 242, 136);
- Add_Goto (Table.States (149), 261, 137);
- Add_Goto (Table.States (149), 275, 93);
- Add_Goto (Table.States (149), 278, 138);
- Add_Goto (Table.States (149), 285, 139);
- Add_Goto (Table.States (149), 286, 140);
- Add_Goto (Table.States (149), 287, 141);
- Add_Goto (Table.States (149), 288, 142);
- Add_Goto (Table.States (149), 289, 143);
- Add_Goto (Table.States (149), 290, 144);
- Add_Goto (Table.States (149), 296, 98);
- Add_Goto (Table.States (149), 304, 145);
- Add_Goto (Table.States (149), 323, 146);
- Add_Goto (Table.States (149), 324, 147);
- Add_Goto (Table.States (149), 333, 148);
- Table.States (149).Kernel := To_Vector ((0 => ((164, 0), 70, 1,
(2147483647, 0), 0)));
- Table.States (149).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (150).Action_List.Set_Capacity (1);
- Add_Action (Table.States (150), 99, (164, 1), 311);
- Table.States (150).Kernel := To_Vector ((0 => ((164, 1), 195, 1,
(2147483647, 0), 0)));
- Table.States (150).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (164, 1), 99, 311)));
- Table.States (151).Action_List.Set_Capacity (2);
- Add_Action (Table.States (151), (72, 99), (223, 0), 1, null,
identifier_opt_0_check'Access);
- Table.States (151).Kernel := To_Vector ((0 => ((223, 0), 107, 0,
(223, 0), 1)));
- Table.States (151).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (223, 0), 1)));
- Table.States (152).Action_List.Set_Capacity (2);
- Add_Action (Table.States (152), 72, (193, 0), 312);
- Add_Action (Table.States (152), 99, (193, 1), 313);
- Table.States (152).Kernel := To_Vector ((((193, 0), 223, 2,
(2147483647, 0), 0), ((193, 1), 223, 1,
- (2147483647, 0), 0)));
- Table.States (152).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (193, 1), 99, 313)));
- Table.States (153).Action_List.Set_Capacity (8);
- Add_Action (Table.States (153), 33, (233, 2), 314);
- Add_Action (Table.States (153), 42, (233, 3), 315);
- Add_Action (Table.States (153), 71, Reduce, (166, 0), 1, null,
null);
- Add_Conflict (Table.States (153), 71, (242, 5), 1, name_5'Access,
name_5_check'Access);
- Add_Action (Table.States (153), 76, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (153), 84, (233, 0), 316);
- Add_Action (Table.States (153), 87, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (153), 104, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (153), 105, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Table.States (153).Kernel := To_Vector ((((166, 0), 107, 0,
(166, 0), 1), ((233, 0), 107, 5,
- (2147483647, 0), 0), ((233, 1), 107, 4, (2147483647, 0), 0),
((233, 2), 107, 3, (2147483647, 0), 0),
- ((233, 3), 107, 3, (2147483647, 0), 0), ((233, 4), 107, 2,
(2147483647, 0), 0), ((233, 5), 107, 2,
- (2147483647, 0), 0), ((242, 5), 107, 0, (242, 5), 1)));
- Table.States (153).Minimal_Complete_Actions := To_Vector
(((Reduce, (166, 0), 1), (Shift, (233, 3), 42,
- 315), (Shift, (233, 2), 33, 314), (Reduce, (242, 5), 1)));
- Table.States (154).Action_List.Set_Capacity (5);
- Add_Action (Table.States (154), 71, Reduce, (166, 1), 1, null,
null);
- Add_Conflict (Table.States (154), 71, (242, 7), 1, null,
name_7_check'Access);
- Add_Action (Table.States (154), 76, Reduce, (242, 7), 1, null,
name_7_check'Access);
- Add_Action (Table.States (154), 87, Reduce, (242, 7), 1, null,
name_7_check'Access);
- Add_Action (Table.States (154), 104, Reduce, (242, 7), 1, null,
name_7_check'Access);
- Add_Action (Table.States (154), 105, Reduce, (242, 7), 1, null,
name_7_check'Access);
- Table.States (154).Kernel := To_Vector ((((166, 1), 108, 0,
(166, 1), 1), ((242, 7), 108, 0, (242, 7),
- 1)));
- Table.States (154).Minimal_Complete_Actions := To_Vector
(((Reduce, (166, 1), 1), (Reduce, (242, 7),
- 1)));
- Table.States (155).Action_List.Set_Capacity (5);
- Add_Action (Table.States (155), 71, (124, 0), 317);
- Add_Conflict (Table.States (155), 71, (242, 3), 1, null, null);
- Add_Action (Table.States (155), 76, Reduce, (242, 3), 1, null,
null);
- Add_Action (Table.States (155), 87, Reduce, (242, 3), 1, null,
null);
- Add_Action (Table.States (155), 104, Reduce, (242, 3), 1, null,
null);
- Add_Action (Table.States (155), 105, Reduce, (242, 3), 1, null,
null);
- Table.States (155).Kernel := To_Vector ((((124, 0), 131, 2,
(2147483647, 0), 0), ((242, 3), 131, 0,
- (242, 3), 1)));
- Table.States (155).Minimal_Complete_Actions := To_Vector (((Shift,
(124, 0), 71, 317), (Reduce, (242, 3),
- 1)));
- Table.States (156).Action_List.Set_Capacity (1);
- Add_Action (Table.States (156), 71, (130, 0), 318);
- Table.States (156).Kernel := To_Vector ((0 => ((130, 0), 166, 3,
(2147483647, 0), 0)));
- Table.States (156).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (130, 0), 71, 318)));
- Table.States (157).Action_List.Set_Capacity (1);
- Add_Action (Table.States (157), (1 => 37), (234, 0), 1, null,
null);
- Table.States (157).Kernel := To_Vector ((0 => ((234, 0), 233, 0,
(234, 0), 1)));
- Table.States (157).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (234, 0), 1)));
- Table.States (158).Action_List.Set_Capacity (1);
- Add_Action (Table.States (158), (1 => 37), (232, 1), 2,
iteration_scheme_1'Access, null);
- Table.States (158).Kernel := To_Vector ((0 => ((232, 1), 234, 0,
(232, 1), 2)));
- Table.States (158).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (232, 1), 2)));
- Table.States (159).Action_List.Set_Capacity (5);
- Add_Action (Table.States (159), 71, (185, 0), 319);
- Add_Action (Table.States (159), 76, (118, 0), 237);
- Add_Action (Table.States (159), 87, (296, 0), 239);
- Add_Action (Table.States (159), 104, (325, 0), 241);
- Add_Action (Table.States (159), 105, (325, 1), 242);
- Table.States (159).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (159), 118, 243);
- Add_Goto (Table.States (159), 325, 244);
- Table.States (159).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((185, 0), 242, 4,
- (2147483647, 0), 0), ((242, 0), 242, 5, (2147483647, 0), 0),
((242, 1), 242, 2, (2147483647, 0), 0),
- ((275, 0), 242, 3, (2147483647, 0), 0), ((284, 0), 242, 13,
(2147483647, 0), 0), ((296, 0), 242, 2,
- (2147483647, 0), 0), ((296, 1), 242, 2, (2147483647, 0), 0),
((296, 2), 242, 2, (2147483647, 0), 0),
- ((296, 3), 242, 2, (2147483647, 0), 0)));
- Table.States (159).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (185, 0), 71, 319)));
- Table.States (160).Action_List.Set_Capacity (5);
- Add_Action (Table.States (160), 58, (294, 0), 320);
- Add_Action (Table.States (160), 76, (118, 0), 321);
- Add_Action (Table.States (160), 87, (296, 0), 239);
- Add_Action (Table.States (160), 104, (325, 0), 241);
- Add_Action (Table.States (160), 105, (325, 1), 242);
- Table.States (160).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (160), 118, 243);
- Add_Goto (Table.States (160), 202, 322);
- Add_Goto (Table.States (160), 255, 323);
- Add_Goto (Table.States (160), 294, 324);
- Add_Goto (Table.States (160), 325, 244);
- Table.States (160).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((210, 0), 242, 1,
- (2147483647, 0), 0), ((242, 0), 242, 5, (2147483647, 0), 0),
((242, 1), 242, 2, (2147483647, 0), 0),
- ((275, 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (160).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (294, 0), 58, 320)));
- Table.States (161).Action_List.Set_Capacity (4);
- Add_Action (Table.States (161), 81, (242, 8), 31);
- Add_Action (Table.States (161), 107, (242, 5), 120);
- Add_Action (Table.States (161), 108, (242, 7), 34);
- Add_Action (Table.States (161), 109, (242, 6), 35);
- Table.States (161).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (161), 131, 42);
- Add_Goto (Table.States (161), 242, 325);
- Add_Goto (Table.States (161), 275, 93);
- Add_Goto (Table.States (161), 296, 98);
- Table.States (161).Kernel := To_Vector ((0 => ((218, 2), 29, 4,
(2147483647, 0), 0)));
- Table.States (161).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (162).Action_List.Set_Capacity (4);
- Add_Action (Table.States (162), 81, (242, 8), 31);
- Add_Action (Table.States (162), 107, (242, 5), 120);
- Add_Action (Table.States (162), 108, (242, 7), 34);
- Add_Action (Table.States (162), 109, (242, 6), 35);
- Table.States (162).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (162), 131, 42);
- Add_Goto (Table.States (162), 242, 326);
- Add_Goto (Table.States (162), 275, 93);
- Add_Goto (Table.States (162), 296, 98);
- Table.States (162).Kernel := To_Vector ((0 => ((218, 0), 47, 4,
(2147483647, 0), 0)));
- Table.States (162).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (163).Action_List.Set_Capacity (4);
- Add_Action (Table.States (163), 81, (242, 8), 31);
- Add_Action (Table.States (163), 107, (242, 5), 120);
- Add_Action (Table.States (163), 108, (242, 7), 34);
- Add_Action (Table.States (163), 109, (242, 6), 35);
- Table.States (163).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (163), 131, 42);
- Add_Goto (Table.States (163), 242, 327);
- Add_Goto (Table.States (163), 275, 93);
- Add_Goto (Table.States (163), 296, 98);
- Table.States (163).Kernel := To_Vector ((0 => ((218, 1), 50, 4,
(2147483647, 0), 0)));
- Table.States (163).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (164).Action_List.Set_Capacity (1);
- Add_Action (Table.States (164), 107, (204, 0), 328);
- Table.States (164).Kernel := To_Vector ((((204, 0), 69, 4,
(2147483647, 0), 0), ((204, 1), 69, 4,
- (2147483647, 0), 0), ((204, 2), 69, 2, (2147483647, 0), 0)));
- Table.States (164).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (204, 0), 107, 328)));
- Table.States (165).Action_List.Set_Capacity (3);
- Add_Action (Table.States (165), 29, (210, 0), 7);
- Add_Action (Table.States (165), 47, (207, 0), 329);
- Add_Action (Table.States (165), 50, (265, 0), 18);
- Table.States (165).Goto_List.Set_Capacity (3);
- Add_Goto (Table.States (165), 210, 62);
- Add_Goto (Table.States (165), 265, 88);
- Add_Goto (Table.States (165), 315, 330);
- Table.States (165).Kernel := To_Vector ((((203, 0), 74, 6,
(2147483647, 0), 0), ((203, 1), 74, 5,
- (2147483647, 0), 0), ((203, 2), 74, 5, (2147483647, 0), 0),
((203, 3), 74, 3, (2147483647, 0), 0),
- ((207, 0), 74, 6, (2147483647, 0), 0)));
- Table.States (165).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (265, 0), 50, 18)));
- Table.States (166).Action_List.Set_Capacity (2);
- Add_Action (Table.States (166), (84, 86), (222, 1), 1,
identifier_list_1'Access, null);
- Table.States (166).Kernel := To_Vector ((0 => ((222, 1), 107, 0,
(222, 1), 1)));
- Table.States (166).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (222, 1), 1)));
- Table.States (167).Action_List.Set_Capacity (8);
- Add_Action (Table.States (167), (29, 47, 48, 50, 69, 71, 74, 107),
(215, 0), 1, null, null);
- Table.States (167).Kernel := To_Vector ((0 => ((215, 0), 201, 0,
(215, 0), 1)));
- Table.States (167).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (215, 0), 1)));
- Table.States (168).Action_List.Set_Capacity (8);
- Add_Action (Table.States (168), (29, 47, 48, 50, 69, 71, 74, 107),
(215, 2), 1, null, null);
- Table.States (168).Kernel := To_Vector ((0 => ((215, 2), 203, 0,
(215, 2), 1)));
- Table.States (168).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (215, 2), 1)));
- Table.States (169).Action_List.Set_Capacity (8);
- Add_Action (Table.States (169), (29, 47, 48, 50, 69, 71, 74, 107),
(215, 1), 1, null, null);
- Table.States (169).Kernel := To_Vector ((0 => ((215, 1), 204, 0,
(215, 1), 1)));
- Table.States (169).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (215, 1), 1)));
- Table.States (170).Action_List.Set_Capacity (8);
- Add_Action (Table.States (170), (29, 47, 48, 50, 69, 71, 74, 107),
(215, 3), 1, null, null);
- Table.States (170).Kernel := To_Vector ((0 => ((215, 3), 207, 0,
(215, 3), 1)));
- Table.States (170).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (215, 3), 1)));
- Table.States (171).Action_List.Set_Capacity (8);
- Add_Action (Table.States (171), 29, Reduce, (213, 0), 2,
generic_formal_part_0'Access, null);
- Add_Action (Table.States (171), 47, Reduce, (213, 0), 2,
generic_formal_part_0'Access, null);
- Add_Action (Table.States (171), 48, (260, 0), 16);
- Add_Action (Table.States (171), 50, Reduce, (213, 0), 2,
generic_formal_part_0'Access, null);
- Add_Action (Table.States (171), 69, (204, 0), 164);
- Add_Action (Table.States (171), 71, (334, 0), 28);
- Add_Action (Table.States (171), 74, (203, 0), 165);
- Add_Action (Table.States (171), 107, (222, 1), 166);
- Table.States (171).Goto_List.Set_Capacity (8);
- Add_Goto (Table.States (171), 201, 167);
- Add_Goto (Table.States (171), 203, 168);
- Add_Goto (Table.States (171), 204, 169);
- Add_Goto (Table.States (171), 207, 170);
- Add_Goto (Table.States (171), 215, 331);
- Add_Goto (Table.States (171), 222, 173);
- Add_Goto (Table.States (171), 260, 174);
- Add_Goto (Table.States (171), 334, 175);
- Table.States (171).Kernel := To_Vector ((((213, 0), 214, 0,
(213, 0), 2), ((214, 0), 214, 3,
- (2147483647, 0), 0)));
- Table.States (171).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (213, 0), 2)));
- Table.States (172).Action_List.Set_Capacity (8);
- Add_Action (Table.States (172), (29, 47, 48, 50, 69, 71, 74, 107),
(214, 1), 1, null, null);
- Table.States (172).Kernel := To_Vector ((0 => ((214, 1), 215, 0,
(214, 1), 1)));
- Table.States (172).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (214, 1), 1)));
- Table.States (173).Action_List.Set_Capacity (2);
- Add_Action (Table.States (173), 84, (201, 0), 332);
- Add_Action (Table.States (173), 86, (222, 0), 236);
- Table.States (173).Kernel := To_Vector ((((201, 0), 222, 4,
(2147483647, 0), 0), ((201, 1), 222, 5,
- (2147483647, 0), 0), ((201, 2), 222, 3, (2147483647, 0), 0),
((201, 3), 222, 4, (2147483647, 0), 0),
- ((222, 0), 222, 2, (2147483647, 0), 0)));
- Table.States (173).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (201, 0), 84, 332)));
- end Subr_3;
- procedure Subr_4
- is begin
- Table.States (174).Action_List.Set_Capacity (8);
- Add_Action (Table.States (174), (29, 47, 48, 50, 69, 71, 74, 107),
(215, 4), 1, null, null);
- Table.States (174).Kernel := To_Vector ((0 => ((215, 4), 260, 0,
(215, 4), 1)));
- Table.States (174).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (215, 4), 1)));
- Table.States (175).Action_List.Set_Capacity (8);
- Add_Action (Table.States (175), (29, 47, 48, 50, 69, 71, 74, 107),
(215, 5), 1, null, null);
- Table.States (175).Kernel := To_Vector ((0 => ((215, 5), 334, 0,
(215, 5), 1)));
- Table.States (175).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (215, 5), 1)));
- Table.States (176).Action_List.Set_Capacity (1);
- Add_Action (Table.States (176), 99, (306, 3), 333);
- Table.States (176).Kernel := To_Vector ((0 => ((306, 3), 107, 1,
(2147483647, 0), 0)));
- Table.States (176).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (306, 3), 99, 333)));
- Table.States (177).Action_List.Set_Capacity (1);
- Add_Action (Table.States (177), 68, (225, 0), 334);
- Table.States (177).Kernel := To_Vector ((((225, 0), 195, 7,
(2147483647, 0), 0), ((225, 1), 195, 5,
- (2147483647, 0), 0), ((225, 2), 195, 6, (2147483647, 0), 0),
((225, 3), 195, 4, (2147483647, 0),
- 0)));
- Table.States (177).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (225, 0), 68, 334)));
- Table.States (178).Action_List.Set_Capacity (1);
- Add_Action (Table.States (178), 74, (335, 0), 335);
- Table.States (178).Kernel := To_Vector ((0 => ((335, 0), 49, 3,
(2147483647, 0), 0)));
- Table.States (178).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (335, 0), 74, 335)));
- Table.States (179).Action_List.Set_Capacity (4);
- Add_Action (Table.States (179), 81, (242, 8), 31);
- Add_Action (Table.States (179), 107, (242, 5), 120);
- Add_Action (Table.States (179), 108, (242, 7), 34);
- Add_Action (Table.States (179), 109, (242, 6), 35);
- Table.States (179).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (179), 131, 42);
- Add_Goto (Table.States (179), 241, 336);
- Add_Goto (Table.States (179), 242, 221);
- Add_Goto (Table.States (179), 275, 93);
- Add_Goto (Table.States (179), 296, 98);
- Table.States (179).Kernel := To_Vector ((0 => ((335, 1), 74, 2,
(2147483647, 0), 0)));
- Table.States (179).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (180).Action_List.Set_Capacity (3);
- Add_Action (Table.States (180), (25, 29, 50), (249, 0), 2,
overriding_indicator_opt_0'Access, null);
- Table.States (180).Kernel := To_Vector ((0 => ((249, 0), 46, 0,
(249, 0), 2)));
- Table.States (180).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (249, 0), 2)));
- Table.States (181).Action_List.Set_Capacity (47);
- Add_Action (Table.States (181), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (306, 0), 2, simple_statement_0'Access, null);
- Table.States (181).Kernel := To_Vector ((0 => ((306, 0), 99, 0,
(306, 0), 2)));
- Table.States (181).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (306, 0), 2)));
- Table.States (182).Action_List.Set_Capacity (4);
- Add_Action (Table.States (182), 81, (242, 8), 31);
- Add_Action (Table.States (182), 107, (242, 5), 120);
- Add_Action (Table.States (182), 108, (242, 7), 34);
- Add_Action (Table.States (182), 109, (242, 6), 35);
- Table.States (182).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (182), 131, 42);
- Add_Goto (Table.States (182), 242, 337);
- Add_Goto (Table.States (182), 275, 93);
- Add_Goto (Table.States (182), 296, 98);
- Table.States (182).Kernel := To_Vector ((((250, 0), 14, 5,
(2147483647, 0), 0), ((250, 1), 14, 4,
- (2147483647, 0), 0), ((251, 0), 14, 4, (2147483647, 0), 0)));
- Table.States (182).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (183).Action_List.Set_Capacity (7);
- Add_Action (Table.States (183), 35, (216, 0), 338);
- Add_Conflict (Table.States (183), 35, (125, 1), 0, null, null);
- Add_Action (Table.States (183), 56, (253, 0), 339);
- Add_Action (Table.States (183), 74, (125, 0), 340);
- Add_Action (Table.States (183), 76, (118, 0), 237);
- Add_Action (Table.States (183), 87, (296, 0), 239);
- Add_Action (Table.States (183), 104, (325, 0), 241);
- Add_Action (Table.States (183), 105, (325, 1), 242);
- Table.States (183).Goto_List.Set_Capacity (3);
- Add_Goto (Table.States (183), 118, 243);
- Add_Goto (Table.States (183), 125, 341);
- Add_Goto (Table.States (183), 325, 244);
- Table.States (183).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((216, 0), 242, 4,
- (2147483647, 0), 0), ((242, 0), 242, 5, (2147483647, 0), 0),
((242, 1), 242, 2, (2147483647, 0), 0),
- ((253, 0), 242, 3, (2147483647, 0), 0), ((254, 0), 242, 3,
(2147483647, 0), 0), ((254, 1), 242, 2,
- (2147483647, 0), 0), ((275, 0), 242, 3, (2147483647, 0), 0),
((296, 0), 242, 2, (2147483647, 0), 0),
- ((296, 1), 242, 2, (2147483647, 0), 0), ((296, 2), 242, 2,
(2147483647, 0), 0), ((296, 3), 242, 2,
- (2147483647, 0), 0)));
- Table.States (183).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (184).Action_List.Set_Capacity (2);
- Add_Action (Table.States (184), 76, (260, 0), 342);
- Add_Action (Table.States (184), 99, (260, 2), 343);
- Table.States (184).Kernel := To_Vector ((((260, 0), 107, 3,
(2147483647, 0), 0), ((260, 1), 107, 5,
- (2147483647, 0), 0), ((260, 2), 107, 1, (2147483647, 0), 0)));
- Table.States (184).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (260, 2), 99, 343)));
- Table.States (185).Action_List.Set_Capacity (4);
- Add_Action (Table.States (185), 81, (242, 8), 31);
- Add_Action (Table.States (185), 107, (166, 0), 344);
- Add_Action (Table.States (185), 108, (166, 1), 154);
- Add_Action (Table.States (185), 109, (242, 6), 35);
- Table.States (185).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (185), 131, 155);
- Add_Goto (Table.States (185), 166, 156);
- Add_Goto (Table.States (185), 242, 159);
- Add_Goto (Table.States (185), 275, 93);
- Add_Goto (Table.States (185), 296, 98);
- Table.States (185).Kernel := To_Vector ((((124, 0), 28, 5,
(2147483647, 0), 0), ((130, 0), 28, 4,
- (2147483647, 0), 0), ((185, 0), 28, 5, (2147483647, 0), 0),
((284, 0), 28, 14, (2147483647, 0), 0)));
- Table.States (185).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (166, 0), 107, 344)));
- Table.States (186).Action_List.Set_Capacity (4);
- Add_Action (Table.States (186), 81, (242, 8), 31);
- Add_Action (Table.States (186), 107, (242, 5), 120);
- Add_Action (Table.States (186), 108, (242, 7), 34);
- Add_Action (Table.States (186), 109, (242, 6), 35);
- Table.States (186).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (186), 131, 42);
- Add_Goto (Table.States (186), 241, 345);
- Add_Goto (Table.States (186), 242, 221);
- Add_Goto (Table.States (186), 275, 93);
- Add_Goto (Table.States (186), 296, 98);
- Table.States (186).Kernel := To_Vector ((0 => ((335, 2), 74, 2,
(2147483647, 0), 0)));
- Table.States (186).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (187).Action_List.Set_Capacity (2);
- Add_Action (Table.States (187), 84, (248, 0), 346);
- Add_Conflict (Table.States (187), 84, (222, 1), 1,
identifier_list_1'Access, null);
- Add_Action (Table.States (187), 86, Reduce, (222, 1), 1,
identifier_list_1'Access, null);
- Table.States (187).Kernel := To_Vector ((((222, 1), 107, 0,
(222, 1), 1), ((248, 0), 107, 5,
- (2147483647, 0), 0), ((248, 1), 107, 6, (2147483647, 0), 0),
((248, 2), 107, 5, (2147483647, 0),
- 0)));
- Table.States (187).Minimal_Complete_Actions := To_Vector
(((Reduce, (222, 1), 1), (Shift, (248, 0), 84,
- 346)));
- Table.States (188).Action_List.Set_Capacity (40);
- Add_Action (Table.States (188), (4, 5, 13, 15, 17, 18, 25, 27, 28,
29, 30, 31, 32, 36, 37, 40, 41, 46, 47,
- 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 81,
96, 107, 108, 109, 110), (145, 2), 2,
- compilation_unit_2'Access, null);
- Table.States (188).Kernel := To_Vector ((0 => ((145, 2), 160, 0,
(145, 2), 2)));
- Table.States (188).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (145, 2), 2)));
- Table.States (189).Action_List.Set_Capacity (7);
- Add_Action (Table.States (189), 35, Reduce, (256, 1), 0, null,
null);
- Add_Action (Table.States (189), 74, Reduce, (256, 1), 0, null,
null);
- Add_Action (Table.States (189), 76, (118, 0), 321);
- Add_Action (Table.States (189), 87, (296, 0), 239);
- Add_Action (Table.States (189), 99, Reduce, (256, 1), 0, null,
null);
- Add_Action (Table.States (189), 104, (325, 0), 241);
- Add_Action (Table.States (189), 105, (325, 1), 242);
- Table.States (189).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (189), 118, 243);
- Add_Goto (Table.States (189), 202, 347);
- Add_Goto (Table.States (189), 256, 348);
- Add_Goto (Table.States (189), 325, 244);
- Table.States (189).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((242, 0), 242, 5,
- (2147483647, 0), 0), ((242, 1), 242, 2, (2147483647, 0), 0),
((265, 0), 242, 0, (256, 1), 0), ((275,
- 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (189).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (256, 1), 0)));
- Table.States (190).Action_List.Set_Capacity (1);
- Add_Action (Table.States (190), 107, (267, 0), 349);
- Table.States (190).Kernel := To_Vector ((((267, 0), 14, 4,
(2147483647, 0), 0), ((268, 0), 14, 4,
- (2147483647, 0), 0)));
- Table.States (190).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (267, 0), 107, 349)));
- Table.States (191).Action_List.Set_Capacity (1);
- Add_Action (Table.States (191), 107, (274, 0), 350);
- Table.States (191).Kernel := To_Vector ((((274, 0), 69, 7,
(2147483647, 0), 0), ((274, 1), 69, 4,
- (2147483647, 0), 0)));
- Table.States (191).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (274, 0), 107, 350)));
- Table.States (192).Action_List.Set_Capacity (2);
- Add_Action (Table.States (192), 35, Reduce, (125, 1), 0, null,
null);
- Add_Action (Table.States (192), 74, (125, 0), 340);
- Table.States (192).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (192), 125, 351);
- Table.States (192).Kernel := To_Vector ((((307, 0), 107, 6,
(2147483647, 0), 0), ((307, 1), 107, 3,
- (2147483647, 0), 0)));
- Table.States (192).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (193).Action_List.Set_Capacity (47);
- Add_Action (Table.States (193), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (279, 2), 2, raise_statement_2'Access, null);
- Table.States (193).Kernel := To_Vector ((0 => ((279, 2), 99, 0,
(279, 2), 2)));
- Table.States (193).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (279, 2), 2)));
- Table.States (194).Action_List.Set_Capacity (6);
- Add_Action (Table.States (194), 74, (279, 0), 352);
- Add_Action (Table.States (194), 76, (118, 0), 237);
- Add_Action (Table.States (194), 87, (296, 0), 239);
- Add_Action (Table.States (194), 99, (279, 1), 353);
- Add_Action (Table.States (194), 104, (325, 0), 241);
- Add_Action (Table.States (194), 105, (325, 1), 242);
- Table.States (194).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (194), 118, 243);
- Add_Goto (Table.States (194), 325, 244);
- Table.States (194).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((242, 0), 242, 5,
- (2147483647, 0), 0), ((242, 1), 242, 2, (2147483647, 0), 0),
((275, 0), 242, 3, (2147483647, 0), 0),
- ((279, 0), 242, 2, (2147483647, 0), 0), ((279, 1), 242, 1,
(2147483647, 0), 0), ((296, 0), 242, 2,
- (2147483647, 0), 0), ((296, 1), 242, 2, (2147483647, 0), 0),
((296, 2), 242, 2, (2147483647, 0), 0),
- ((296, 3), 242, 2, (2147483647, 0), 0)));
- Table.States (194).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (279, 1), 99, 353)));
- Table.States (195).Action_List.Set_Capacity (6);
- Add_Action (Table.States (195), 74, (293, 0), 354);
- Add_Action (Table.States (195), 76, (118, 0), 237);
- Add_Action (Table.States (195), 87, (296, 0), 239);
- Add_Action (Table.States (195), 99, (293, 1), 355);
- Add_Action (Table.States (195), 104, (325, 0), 241);
- Add_Action (Table.States (195), 105, (325, 1), 242);
- Table.States (195).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (195), 118, 243);
- Add_Goto (Table.States (195), 325, 244);
- Table.States (195).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((242, 0), 242, 5,
- (2147483647, 0), 0), ((242, 1), 242, 2, (2147483647, 0), 0),
((275, 0), 242, 3, (2147483647, 0), 0),
- ((293, 0), 242, 3, (2147483647, 0), 0), ((293, 1), 242, 1,
(2147483647, 0), 0), ((296, 0), 242, 2,
- (2147483647, 0), 0), ((296, 1), 242, 2, (2147483647, 0), 0),
((296, 2), 242, 2, (2147483647, 0), 0),
- ((296, 3), 242, 2, (2147483647, 0), 0)));
- Table.States (195).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (293, 1), 99, 355)));
- Table.States (196).Action_List.Set_Capacity (25);
- Add_Action (Table.States (196), 10, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (196), 33, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (196), 38, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (196), 40, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (196), 43, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (196), 55, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (196), 75, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (196), 76, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (196), 80, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (196), 84, (197, 0), 356);
- Add_Action (Table.States (196), 87, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (196), 89, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (196), 91, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (196), 92, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (196), 94, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (196), 95, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (196), 97, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (196), 98, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (196), 99, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (196), 100, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (196), 101, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (196), 102, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (196), 103, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (196), 104, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (196), 105, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Table.States (196).Kernel := To_Vector ((((197, 0), 107, 3,
(2147483647, 0), 0), ((197, 1), 107, 2,
- (2147483647, 0), 0), ((242, 5), 107, 0, (242, 5), 1)));
- Table.States (196).Minimal_Complete_Actions := To_Vector (((Shift,
(197, 0), 84, 356), (Reduce, (242, 5),
- 1)));
- Table.States (197).Action_List.Set_Capacity (1);
- Add_Action (Table.States (197), 99, (305, 0), 357);
- Table.States (197).Kernel := To_Vector ((0 => ((305, 0), 195, 1,
(2147483647, 0), 0)));
- Table.States (197).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (305, 0), 99, 357)));
- Table.States (198).Action_List.Set_Capacity (2);
- Add_Action (Table.States (198), 21, Reduce, (198, 0), 1, null,
null);
- Add_Action (Table.States (198), 99, (199, 1), 358);
- Table.States (198).Kernel := To_Vector ((((198, 0), 197, 0,
(198, 0), 1), ((199, 1), 197, 1,
- (2147483647, 0), 0)));
- Table.States (198).Minimal_Complete_Actions := To_Vector
(((Reduce, (198, 0), 1), (Shift, (199, 1), 99,
- 358)));
- Table.States (199).Action_List.Set_Capacity (1);
- Add_Action (Table.States (199), 21, (199, 0), 359);
- Table.States (199).Kernel := To_Vector ((0 => ((199, 0), 198, 4,
(2147483647, 0), 0)));
- Table.States (199).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (199, 0), 21, 359)));
- Table.States (200).Action_List.Set_Capacity (4);
- Add_Action (Table.States (200), 81, (242, 8), 31);
- Add_Action (Table.States (200), 107, (242, 5), 120);
- Add_Action (Table.States (200), 108, (242, 7), 34);
- Add_Action (Table.States (200), 109, (242, 6), 35);
- Table.States (200).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (200), 131, 42);
- Add_Goto (Table.States (200), 242, 360);
- Add_Goto (Table.States (200), 275, 93);
- Add_Goto (Table.States (200), 296, 98);
- Table.States (200).Kernel := To_Vector ((0 => ((318, 0), 76, 8,
(2147483647, 0), 0)));
- Table.States (200).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (201).Action_List.Set_Capacity (1);
- Add_Action (Table.States (201), 99, (298, 4), 361);
- Table.States (201).Kernel := To_Vector ((0 => ((298, 4), 67, 1,
(2147483647, 0), 0)));
- Table.States (201).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (298, 4), 99, 361)));
- Table.States (202).Action_List.Set_Capacity (15);
- Add_Action (Table.States (202), 3, (200, 2), 122);
- Add_Action (Table.States (202), 39, (261, 4), 123);
- Add_Action (Table.States (202), 40, (200, 3), 124);
- Add_Action (Table.States (202), 41, (261, 1), 125);
- Add_Action (Table.States (202), 52, (278, 0), 126);
- Add_Action (Table.States (202), 76, (120, 0), 127);
- Add_Action (Table.States (202), 77, (120, 5), 128);
- Add_Action (Table.States (202), 81, (242, 8), 31);
- Add_Action (Table.States (202), 90, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (202), 97, (333, 1), 129);
- Add_Action (Table.States (202), 98, (333, 0), 130);
- Add_Action (Table.States (202), 106, (261, 0), 131);
- Add_Action (Table.States (202), 107, (242, 5), 120);
- Add_Action (Table.States (202), 108, (242, 7), 34);
- Add_Action (Table.States (202), 109, (242, 6), 35);
- Table.States (202).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (202), 120, 132);
- Add_Goto (Table.States (202), 131, 42);
- Add_Goto (Table.States (202), 194, 133);
- Add_Goto (Table.States (202), 195, 362);
- Add_Goto (Table.States (202), 200, 135);
- Add_Goto (Table.States (202), 242, 136);
- Add_Goto (Table.States (202), 261, 137);
- Add_Goto (Table.States (202), 275, 93);
- Add_Goto (Table.States (202), 278, 138);
- Add_Goto (Table.States (202), 285, 139);
- Add_Goto (Table.States (202), 286, 140);
- Add_Goto (Table.States (202), 287, 141);
- Add_Goto (Table.States (202), 288, 142);
- Add_Goto (Table.States (202), 289, 143);
- Add_Goto (Table.States (202), 290, 144);
- Add_Goto (Table.States (202), 296, 98);
- Add_Goto (Table.States (202), 304, 145);
- Add_Goto (Table.States (202), 323, 146);
- Add_Goto (Table.States (202), 324, 147);
- Add_Goto (Table.States (202), 333, 148);
- Table.States (202).Kernel := To_Vector ((((298, 0), 72, 4,
(2147483647, 0), 0), ((298, 1), 72, 3,
- (2147483647, 0), 0), ((298, 2), 72, 3, (2147483647, 0), 0)));
- Table.States (202).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (203).Action_List.Set_Capacity (26);
- Add_Action (Table.States (203), 4, (116, 0), 1);
- Add_Action (Table.States (203), 5, (306, 8), 2);
- Add_Action (Table.States (203), 13, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (203), 15, (142, 0), 3);
- Add_Action (Table.States (203), 17, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (203), 18, (164, 0), 4);
- Add_Action (Table.States (203), 22, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (203), 24, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (203), 27, (193, 0), 5);
- Add_Action (Table.States (203), 28, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (203), 31, (306, 3), 9);
- Add_Action (Table.States (203), 32, (225, 0), 10);
- Add_Action (Table.States (203), 37, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (203), 41, (306, 0), 13);
- Add_Action (Table.States (203), 43, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (203), 48, (260, 0), 16);
- Add_Action (Table.States (203), 52, (279, 0), 20);
- Add_Action (Table.States (203), 57, (293, 0), 21);
- Add_Action (Table.States (203), 58, (199, 0), 22);
- Add_Action (Table.States (203), 61, (129, 0), 24);
- Add_Action (Table.States (203), 73, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (203), 81, (242, 8), 31);
- Add_Action (Table.States (203), 96, (220, 0), 32);
- Add_Action (Table.States (203), 107, (134, 0), 363);
- Add_Action (Table.States (203), 108, (242, 7), 34);
- Add_Action (Table.States (203), 109, (242, 6), 35);
- Table.States (203).Goto_List.Set_Capacity (31);
- Add_Goto (Table.States (203), 116, 37);
- Add_Goto (Table.States (203), 126, 39);
- Add_Goto (Table.States (203), 129, 40);
- Add_Goto (Table.States (203), 131, 42);
- Add_Goto (Table.States (203), 134, 43);
- Add_Goto (Table.States (203), 135, 44);
- Add_Goto (Table.States (203), 136, 45);
- Add_Goto (Table.States (203), 142, 48);
- Add_Goto (Table.States (203), 154, 51);
- Add_Goto (Table.States (203), 155, 52);
- Add_Goto (Table.States (203), 164, 54);
- Add_Goto (Table.States (203), 193, 58);
- Add_Goto (Table.States (203), 199, 60);
- Add_Goto (Table.States (203), 220, 69);
- Add_Goto (Table.States (203), 225, 71);
- Add_Goto (Table.States (203), 235, 73);
- Add_Goto (Table.States (203), 242, 74);
- Add_Goto (Table.States (203), 260, 84);
- Add_Goto (Table.States (203), 264, 87);
- Add_Goto (Table.States (203), 275, 93);
- Add_Goto (Table.States (203), 279, 94);
- Add_Goto (Table.States (203), 293, 97);
- Add_Goto (Table.States (203), 296, 98);
- Add_Goto (Table.States (203), 297, 99);
- Add_Goto (Table.States (203), 301, 100);
- Add_Goto (Table.States (203), 302, 364);
- Add_Goto (Table.States (203), 303, 365);
- Add_Goto (Table.States (203), 305, 101);
- Add_Goto (Table.States (203), 306, 102);
- Add_Goto (Table.States (203), 309, 366);
- Add_Goto (Table.States (203), 326, 115);
- Table.States (203).Kernel := To_Vector ((0 => ((298, 3), 116, 0,
(303, 1), 0)));
- Table.States (203).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (303, 1), 0)));
- Table.States (204).Action_List.Set_Capacity (3);
- Add_Action (Table.States (204), (22, 24, 43), (298, 5), 1, null,
null);
- Table.States (204).Kernel := To_Vector ((0 => ((298, 5), 163, 0,
(298, 5), 1)));
- Table.States (204).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (298, 5), 1)));
- Table.States (205).Action_List.Set_Capacity (27);
- Add_Action (Table.States (205), 4, (116, 0), 1);
- Add_Action (Table.States (205), 5, (306, 8), 2);
- Add_Action (Table.States (205), 13, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (205), 15, (142, 0), 3);
- Add_Action (Table.States (205), 17, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (205), 18, (164, 0), 4);
- Add_Action (Table.States (205), 22, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (205), 24, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (205), 27, (193, 0), 5);
- Add_Action (Table.States (205), 28, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (205), 31, (306, 3), 9);
- Add_Action (Table.States (205), 32, (225, 0), 10);
- Add_Action (Table.States (205), 37, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (205), 41, (306, 0), 13);
- Add_Action (Table.States (205), 43, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (205), 48, (260, 0), 16);
- Add_Action (Table.States (205), 52, (279, 0), 20);
- Add_Action (Table.States (205), 57, (293, 0), 21);
- Add_Action (Table.States (205), 58, (199, 0), 22);
- Add_Action (Table.States (205), 61, (129, 0), 24);
- Add_Action (Table.States (205), 68, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (205), 73, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (205), 81, (242, 8), 31);
- Add_Action (Table.States (205), 96, (220, 0), 32);
- Add_Action (Table.States (205), 107, (134, 0), 363);
- Add_Action (Table.States (205), 108, (242, 7), 34);
- Add_Action (Table.States (205), 109, (242, 6), 35);
- Table.States (205).Goto_List.Set_Capacity (31);
- Add_Goto (Table.States (205), 116, 37);
- Add_Goto (Table.States (205), 126, 39);
- Add_Goto (Table.States (205), 129, 40);
- Add_Goto (Table.States (205), 131, 42);
- Add_Goto (Table.States (205), 134, 43);
- Add_Goto (Table.States (205), 135, 44);
- Add_Goto (Table.States (205), 136, 45);
- Add_Goto (Table.States (205), 142, 48);
- Add_Goto (Table.States (205), 154, 51);
- Add_Goto (Table.States (205), 155, 52);
- Add_Goto (Table.States (205), 164, 54);
- Add_Goto (Table.States (205), 193, 58);
- Add_Goto (Table.States (205), 199, 60);
- Add_Goto (Table.States (205), 220, 69);
- Add_Goto (Table.States (205), 225, 71);
- Add_Goto (Table.States (205), 235, 73);
- Add_Goto (Table.States (205), 242, 74);
- Add_Goto (Table.States (205), 260, 84);
- Add_Goto (Table.States (205), 264, 87);
- Add_Goto (Table.States (205), 275, 93);
- Add_Goto (Table.States (205), 279, 94);
- Add_Goto (Table.States (205), 293, 97);
- Add_Goto (Table.States (205), 296, 98);
- Add_Goto (Table.States (205), 297, 99);
- Add_Goto (Table.States (205), 301, 100);
- Add_Goto (Table.States (205), 302, 364);
- Add_Goto (Table.States (205), 303, 367);
- Add_Goto (Table.States (205), 305, 101);
- Add_Goto (Table.States (205), 306, 102);
- Add_Goto (Table.States (205), 309, 366);
- Add_Goto (Table.States (205), 326, 115);
- Table.States (205).Kernel := To_Vector ((((163, 0), 164, 0,
(303, 1), 0), ((327, 2), 164, 0, (303, 1),
- 0)));
- Table.States (205).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (303, 1), 0)));
- Table.States (206).Action_List.Set_Capacity (2);
- Add_Action (Table.States (206), 22, (155, 0), 368);
- Add_Action (Table.States (206), 43, (326, 0), 369);
- Table.States (206).Kernel := To_Vector ((((155, 0), 181, 4,
(2147483647, 0), 0), ((326, 0), 181, 6,
- (2147483647, 0), 0)));
- Table.States (206).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (155, 0), 22, 368)));
- Table.States (207).Action_List.Set_Capacity (31);
- Add_Action (Table.States (207), 4, (116, 0), 1);
- Add_Action (Table.States (207), 5, (306, 8), 2);
- Add_Action (Table.States (207), 13, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (207), 15, (142, 0), 3);
- Add_Action (Table.States (207), 17, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (207), 18, (164, 0), 4);
- Add_Action (Table.States (207), 22, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (207), 27, (193, 0), 5);
- Add_Action (Table.States (207), 28, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (207), 31, (306, 3), 9);
- Add_Action (Table.States (207), 32, (225, 0), 10);
- Add_Action (Table.States (207), 37, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (207), 41, (306, 0), 13);
- Add_Action (Table.States (207), 43, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (207), 48, (260, 0), 16);
- Add_Action (Table.States (207), 52, (279, 0), 20);
- Add_Action (Table.States (207), 57, (293, 0), 21);
- Add_Action (Table.States (207), 58, (199, 0), 22);
- Add_Action (Table.States (207), 61, (129, 0), 24);
- Add_Action (Table.States (207), 68, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (207), 73, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (207), 76, (118, 0), 237);
- Add_Action (Table.States (207), 81, (242, 8), 31);
- Add_Action (Table.States (207), 87, (296, 0), 239);
- Add_Action (Table.States (207), 96, (220, 0), 32);
- Add_Action (Table.States (207), 99, (264, 0), 240);
- Add_Action (Table.States (207), 104, (325, 0), 241);
- Add_Action (Table.States (207), 105, (325, 1), 242);
- Add_Action (Table.States (207), 107, (134, 0), 363);
- Add_Action (Table.States (207), 108, (242, 7), 34);
- Add_Action (Table.States (207), 109, (242, 6), 35);
- Table.States (207).Goto_List.Set_Capacity (33);
- Add_Goto (Table.States (207), 116, 37);
- Add_Goto (Table.States (207), 118, 243);
- Add_Goto (Table.States (207), 126, 39);
- Add_Goto (Table.States (207), 129, 40);
- Add_Goto (Table.States (207), 131, 42);
- Add_Goto (Table.States (207), 134, 43);
- Add_Goto (Table.States (207), 135, 44);
- Add_Goto (Table.States (207), 136, 45);
- Add_Goto (Table.States (207), 142, 48);
- Add_Goto (Table.States (207), 154, 51);
- Add_Goto (Table.States (207), 155, 52);
- Add_Goto (Table.States (207), 164, 54);
- Add_Goto (Table.States (207), 193, 58);
- Add_Goto (Table.States (207), 199, 60);
- Add_Goto (Table.States (207), 220, 69);
- Add_Goto (Table.States (207), 225, 71);
- Add_Goto (Table.States (207), 235, 73);
- Add_Goto (Table.States (207), 242, 74);
- Add_Goto (Table.States (207), 260, 84);
- Add_Goto (Table.States (207), 264, 87);
- Add_Goto (Table.States (207), 275, 93);
- Add_Goto (Table.States (207), 279, 94);
- Add_Goto (Table.States (207), 293, 97);
- Add_Goto (Table.States (207), 296, 98);
- Add_Goto (Table.States (207), 297, 99);
- Add_Goto (Table.States (207), 301, 100);
- Add_Goto (Table.States (207), 302, 364);
- Add_Goto (Table.States (207), 303, 370);
- Add_Goto (Table.States (207), 305, 101);
- Add_Goto (Table.States (207), 306, 102);
- Add_Goto (Table.States (207), 309, 366);
- Add_Goto (Table.States (207), 325, 244);
- Add_Goto (Table.States (207), 326, 115);
- Table.States (207).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((181, 1), 242, 0,
- (303, 1), 0), ((242, 0), 242, 5, (2147483647, 0), 0), ((242,
1), 242, 2, (2147483647, 0), 0), ((264,
- 0), 242, 1, (2147483647, 0), 0), ((275, 0), 242, 3,
(2147483647, 0), 0), ((296, 0), 242, 2,
- (2147483647, 0), 0), ((296, 1), 242, 2, (2147483647, 0), 0),
((296, 2), 242, 2, (2147483647, 0), 0),
- ((296, 3), 242, 2, (2147483647, 0), 0), ((327, 1), 242, 0,
(303, 1), 0)));
- Table.States (207).Minimal_Complete_Actions := To_Vector
(((Reduce, (303, 1), 0), (Shift, (264, 0), 99,
- 240)));
- Table.States (208).Action_List.Set_Capacity (26);
- Add_Action (Table.States (208), 4, (116, 0), 1);
- Add_Action (Table.States (208), 5, (306, 8), 2);
- Add_Action (Table.States (208), 13, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (208), 15, (142, 0), 3);
- Add_Action (Table.States (208), 17, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (208), 18, (164, 0), 4);
- Add_Action (Table.States (208), 22, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (208), 27, (193, 0), 5);
- Add_Action (Table.States (208), 28, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (208), 31, (306, 3), 9);
- Add_Action (Table.States (208), 32, (225, 0), 10);
- Add_Action (Table.States (208), 37, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (208), 41, (306, 0), 13);
- Add_Action (Table.States (208), 43, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (208), 48, (260, 0), 16);
- Add_Action (Table.States (208), 52, (279, 0), 20);
- Add_Action (Table.States (208), 57, (293, 0), 21);
- Add_Action (Table.States (208), 58, (199, 0), 22);
- Add_Action (Table.States (208), 61, (129, 0), 24);
- Add_Action (Table.States (208), 68, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (208), 73, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (208), 81, (242, 8), 31);
- Add_Action (Table.States (208), 96, (220, 0), 32);
- Add_Action (Table.States (208), 107, (134, 0), 363);
- Add_Action (Table.States (208), 108, (242, 7), 34);
- Add_Action (Table.States (208), 109, (242, 6), 35);
- Table.States (208).Goto_List.Set_Capacity (31);
- Add_Goto (Table.States (208), 116, 37);
- Add_Goto (Table.States (208), 126, 39);
- Add_Goto (Table.States (208), 129, 40);
- Add_Goto (Table.States (208), 131, 42);
- Add_Goto (Table.States (208), 134, 43);
- Add_Goto (Table.States (208), 135, 44);
- Add_Goto (Table.States (208), 136, 45);
- Add_Goto (Table.States (208), 142, 48);
- Add_Goto (Table.States (208), 154, 51);
- Add_Goto (Table.States (208), 155, 52);
- Add_Goto (Table.States (208), 164, 54);
- Add_Goto (Table.States (208), 193, 58);
- Add_Goto (Table.States (208), 199, 60);
- Add_Goto (Table.States (208), 220, 69);
- Add_Goto (Table.States (208), 225, 71);
- Add_Goto (Table.States (208), 235, 73);
- Add_Goto (Table.States (208), 242, 74);
- Add_Goto (Table.States (208), 260, 84);
- Add_Goto (Table.States (208), 264, 87);
- Add_Goto (Table.States (208), 275, 93);
- Add_Goto (Table.States (208), 279, 94);
- Add_Goto (Table.States (208), 293, 97);
- Add_Goto (Table.States (208), 296, 98);
- Add_Goto (Table.States (208), 297, 99);
- Add_Goto (Table.States (208), 301, 100);
- Add_Goto (Table.States (208), 302, 364);
- Add_Goto (Table.States (208), 303, 371);
- Add_Goto (Table.States (208), 305, 101);
- Add_Goto (Table.States (208), 306, 102);
- Add_Goto (Table.States (208), 309, 366);
- Add_Goto (Table.States (208), 326, 115);
- Table.States (208).Kernel := To_Vector ((((181, 0), 264, 0,
(303, 1), 0), ((327, 0), 264, 0, (303, 1),
- 0)));
- Table.States (208).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (303, 1), 0)));
- Table.States (209).Action_List.Set_Capacity (3);
- Add_Action (Table.States (209), (22, 24, 43), (299, 1), 1,
select_alternative_list_1'Access, null);
- Table.States (209).Kernel := To_Vector ((0 => ((299, 1), 298, 0,
(299, 1), 1)));
- Table.States (209).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (299, 1), 1)));
- Table.States (210).Action_List.Set_Capacity (3);
- Add_Action (Table.States (210), 22, Reduce, (300, 0), 1, null,
null);
- Add_Action (Table.States (210), 24, Reduce, (300, 0), 1, null,
null);
- Add_Action (Table.States (210), 43, (299, 0), 372);
- Table.States (210).Kernel := To_Vector ((((299, 0), 299, 3,
(2147483647, 0), 0), ((300, 0), 299, 0,
- (300, 0), 1)));
- Table.States (210).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (300, 0), 1)));
- Table.States (211).Action_List.Set_Capacity (2);
- Add_Action (Table.States (211), 22, (297, 0), 373);
- Add_Action (Table.States (211), 24, (297, 1), 374);
- Table.States (211).Kernel := To_Vector ((((297, 0), 300, 4,
(2147483647, 0), 0), ((297, 1), 300, 3,
- (2147483647, 0), 0)));
- Table.States (211).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (297, 1), 24, 374)));
- Table.States (212).Action_List.Set_Capacity (1);
- Add_Action (Table.States (212), 68, (129, 0), 375);
- Table.States (212).Kernel := To_Vector ((0 => ((129, 0), 327, 5,
(2147483647, 0), 0)));
- Table.States (212).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (129, 0), 68, 375)));
- Table.States (213).Action_List.Set_Capacity (1);
- Add_Action (Table.States (213), 35, (316, 0), 376);
- Table.States (213).Kernel := To_Vector ((0 => ((316, 0), 107, 3,
(2147483647, 0), 0)));
- Table.States (213).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (316, 0), 35, 376)));
- Table.States (214).Action_List.Set_Capacity (1);
- Add_Action (Table.States (214), 107, (319, 0), 377);
- Table.States (214).Kernel := To_Vector ((((319, 0), 14, 5,
(2147483647, 0), 0), ((320, 0), 14, 4,
- (2147483647, 0), 0)));
- Table.States (214).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (319, 0), 107, 377)));
- Table.States (215).Action_List.Set_Capacity (1);
- Add_Action (Table.States (215), 107, (322, 0), 378);
- Table.States (215).Kernel := To_Vector ((((322, 0), 69, 7,
(2147483647, 0), 0), ((322, 1), 69, 4,
- (2147483647, 0), 0), ((322, 2), 69, 2, (2147483647, 0), 0)));
- Table.States (215).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (322, 0), 107, 378)));
- Table.States (216).Action_List.Set_Capacity (3);
- Add_Action (Table.States (216), 35, Reduce, (125, 1), 0, null,
null);
- Add_Action (Table.States (216), 74, (125, 0), 340);
- Add_Action (Table.States (216), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (216).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (216), 125, 379);
- Table.States (216).Kernel := To_Vector ((((308, 0), 107, 6,
(2147483647, 0), 0), ((308, 1), 107, 3,
- (2147483647, 0), 0), ((308, 2), 107, 1, (2147483647, 0), 0)));
- Table.States (216).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (217).Action_List.Set_Capacity (3);
- Add_Action (Table.States (217), 35, Reduce, (172, 2), 0, null,
null);
- Add_Action (Table.States (217), 76, (172, 0), 380);
- Add_Action (Table.States (217), 99, Reduce, (172, 2), 0, null,
null);
- Table.States (217).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (217), 172, 381);
- Table.States (217).Kernel := To_Vector ((((209, 0), 107, 3,
(2147483647, 0), 0), ((226, 0), 107, 3,
- (2147483647, 0), 0), ((226, 1), 107, 1, (2147483647, 0), 0),
((262, 0), 107, 6, (2147483647, 0), 0),
- ((263, 0), 107, 3, (2147483647, 0), 0)));
- Table.States (217).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (172, 2), 0)));
- Table.States (218).Action_List.Set_Capacity (1);
- Add_Action (Table.States (218), 69, (334, 0), 382);
- Table.States (218).Kernel := To_Vector ((0 => ((334, 0), 9, 3,
(2147483647, 0), 0)));
- Table.States (218).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (334, 0), 69, 382)));
- Table.States (219).Action_List.Set_Capacity (4);
- Add_Action (Table.States (219), 81, (242, 8), 31);
- Add_Action (Table.States (219), 107, (242, 5), 120);
- Add_Action (Table.States (219), 108, (242, 7), 34);
- Add_Action (Table.States (219), 109, (242, 6), 35);
- Table.States (219).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (219), 131, 42);
- Add_Goto (Table.States (219), 241, 383);
- Add_Goto (Table.States (219), 242, 221);
- Add_Goto (Table.States (219), 275, 93);
- Add_Goto (Table.States (219), 296, 98);
- Table.States (219).Kernel := To_Vector ((0 => ((334, 1), 69, 2,
(2147483647, 0), 0)));
- Table.States (219).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (220).Action_List.Set_Capacity (2);
- Add_Action (Table.States (220), 86, (241, 0), 384);
- Add_Action (Table.States (220), 99, (334, 2), 385);
- Table.States (220).Kernel := To_Vector ((((241, 0), 241, 2,
(2147483647, 0), 0), ((334, 2), 241, 1,
- (2147483647, 0), 0)));
- Table.States (220).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (334, 2), 99, 385)));
- Table.States (221).Action_List.Set_Capacity (6);
- Add_Action (Table.States (221), 76, (118, 0), 237);
- Add_Action (Table.States (221), 86, Reduce, (241, 1), 1, null,
null);
- Add_Action (Table.States (221), 87, (296, 0), 239);
- Add_Action (Table.States (221), 99, Reduce, (241, 1), 1, null,
null);
- Add_Action (Table.States (221), 104, (325, 0), 241);
- Add_Action (Table.States (221), 105, (325, 1), 242);
- Table.States (221).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (221), 118, 243);
- Add_Goto (Table.States (221), 325, 244);
- Table.States (221).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((241, 1), 242, 0,
- (241, 1), 1), ((242, 0), 242, 5, (2147483647, 0), 0), ((242,
1), 242, 2, (2147483647, 0), 0), ((275,
- 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (221).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (241, 1), 1)));
- Table.States (222).Action_List.Set_Capacity (1);
- Add_Action (Table.States (222), (1 => 37), (232, 0), 2,
iteration_scheme_0'Access, null);
- Table.States (222).Kernel := To_Vector ((0 => ((232, 0), 195, 0,
(232, 0), 2)));
- Table.States (222).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (232, 0), 2)));
- Table.States (223).Action_List.Set_Capacity (2);
- Add_Action (Table.States (223), 86, (241, 0), 384);
- Add_Action (Table.States (223), 99, (335, 3), 386);
- Table.States (223).Kernel := To_Vector ((((241, 0), 241, 2,
(2147483647, 0), 0), ((335, 3), 241, 1,
- (2147483647, 0), 0)));
- Table.States (223).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (335, 3), 99, 386)));
- Table.States (224).Action_List.Set_Capacity (1);
- Add_Action (Table.States (224), 93, (220, 0), 387);
- Table.States (224).Kernel := To_Vector ((0 => ((220, 0), 107, 1,
(2147483647, 0), 0)));
- Table.States (224).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (220, 0), 93, 387)));
- Table.States (225).Action_List.Set_Capacity (12);
- Add_Action (Table.States (225), 7, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (225), 13, Reduce, (134, 0), 2,
block_label_0'Access,
- block_label_0_check'Access);
- Add_Action (Table.States (225), 17, Reduce, (134, 0), 2,
block_label_0'Access,
- block_label_0_check'Access);
- Add_Action (Table.States (225), 26, (248, 2), 388);
- Add_Action (Table.States (225), 28, Reduce, (134, 0), 2,
block_label_0'Access,
- block_label_0_check'Access);
- Add_Action (Table.States (225), 37, Reduce, (134, 0), 2,
block_label_0'Access,
- block_label_0_check'Access);
- Add_Action (Table.States (225), 40, (244, 0), 389);
- Add_Action (Table.States (225), 73, Reduce, (134, 0), 2,
block_label_0'Access,
- block_label_0_check'Access);
- Add_Action (Table.States (225), 81, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (225), 107, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (225), 108, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (225), 109, Reduce, (244, 1), 0, null,
null);
- Table.States (225).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (225), 117, 390);
- Add_Goto (Table.States (225), 244, 391);
- Table.States (225).Kernel := To_Vector ((((134, 0), 84, 0, (134,
0), 2), ((248, 0), 84, 4,
- (2147483647, 0), 0), ((248, 1), 84, 5, (2147483647, 0), 0),
((248, 2), 84, 4, (2147483647, 0), 0)));
- Table.States (225).Minimal_Complete_Actions := To_Vector
(((Reduce, (134, 0), 2), (Reduce, (244, 1), 0),
- (Shift, (248, 2), 26, 388)));
- Table.States (226).Action_List.Set_Capacity (25);
- Add_Action (Table.States (226), 4, (116, 0), 1);
- Add_Action (Table.States (226), 5, (306, 8), 2);
- Add_Action (Table.States (226), 13, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (226), 15, (142, 0), 3);
- Add_Action (Table.States (226), 17, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (226), 18, (164, 0), 4);
- Add_Action (Table.States (226), 24, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (226), 26, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (226), 27, (193, 0), 5);
- Add_Action (Table.States (226), 28, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (226), 31, (306, 3), 9);
- Add_Action (Table.States (226), 32, (225, 0), 10);
- Add_Action (Table.States (226), 37, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (226), 41, (306, 0), 13);
- Add_Action (Table.States (226), 48, (260, 0), 16);
- Add_Action (Table.States (226), 52, (279, 0), 20);
- Add_Action (Table.States (226), 57, (293, 0), 21);
- Add_Action (Table.States (226), 58, (199, 0), 22);
- Add_Action (Table.States (226), 61, (129, 0), 24);
- Add_Action (Table.States (226), 73, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (226), 81, (242, 8), 31);
- Add_Action (Table.States (226), 96, (220, 0), 32);
- Add_Action (Table.States (226), 107, (134, 0), 363);
- Add_Action (Table.States (226), 108, (242, 7), 34);
- Add_Action (Table.States (226), 109, (242, 6), 35);
- Table.States (226).Goto_List.Set_Capacity (32);
- Add_Goto (Table.States (226), 116, 37);
- Add_Goto (Table.States (226), 126, 39);
- Add_Goto (Table.States (226), 129, 40);
- Add_Goto (Table.States (226), 131, 42);
- Add_Goto (Table.States (226), 134, 43);
- Add_Goto (Table.States (226), 135, 44);
- Add_Goto (Table.States (226), 136, 45);
- Add_Goto (Table.States (226), 142, 48);
- Add_Goto (Table.States (226), 154, 51);
- Add_Goto (Table.States (226), 155, 52);
- Add_Goto (Table.States (226), 164, 54);
- Add_Goto (Table.States (226), 193, 58);
- Add_Goto (Table.States (226), 199, 60);
- Add_Goto (Table.States (226), 220, 69);
- Add_Goto (Table.States (226), 221, 392);
- Add_Goto (Table.States (226), 225, 71);
- Add_Goto (Table.States (226), 235, 73);
- Add_Goto (Table.States (226), 242, 74);
- Add_Goto (Table.States (226), 260, 84);
- Add_Goto (Table.States (226), 264, 87);
- Add_Goto (Table.States (226), 275, 93);
- Add_Goto (Table.States (226), 279, 94);
- Add_Goto (Table.States (226), 293, 97);
- Add_Goto (Table.States (226), 296, 98);
- Add_Goto (Table.States (226), 297, 99);
- Add_Goto (Table.States (226), 301, 100);
- Add_Goto (Table.States (226), 302, 364);
- Add_Goto (Table.States (226), 303, 393);
- Add_Goto (Table.States (226), 305, 101);
- Add_Goto (Table.States (226), 306, 102);
- Add_Goto (Table.States (226), 309, 366);
- Add_Goto (Table.States (226), 326, 115);
- Table.States (226).Kernel := To_Vector ((0 => ((136, 1), 13, 2,
(2147483647, 0), 0)));
- Table.States (226).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (221, 1), 0)));
- end Subr_4;
- procedure Subr_5
- is begin
- Table.States (227).Action_List.Set_Capacity (16);
- Add_Action (Table.States (227), 13, Reduce, (162, 1), 0, null,
null);
- Add_Action (Table.States (227), 25, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (227), 28, (124, 0), 185);
- Add_Action (Table.States (227), 29, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (227), 30, (213, 0), 8);
- Add_Action (Table.States (227), 40, (249, 0), 12);
- Add_Action (Table.States (227), 46, (249, 1), 14);
- Add_Action (Table.States (227), 47, (216, 0), 15);
- Add_Action (Table.States (227), 48, (260, 0), 16);
- Add_Action (Table.States (227), 50, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (227), 51, (267, 0), 19);
- Add_Action (Table.States (227), 63, (316, 0), 25);
- Add_Action (Table.States (227), 66, (308, 0), 26);
- Add_Action (Table.States (227), 69, (209, 0), 27);
- Add_Action (Table.States (227), 71, (334, 0), 28);
- Add_Action (Table.States (227), 107, (222, 1), 187);
- Table.States (227).Goto_List.Set_Capacity (53);
- Add_Goto (Table.States (227), 115, 36);
- Add_Goto (Table.States (227), 124, 38);
- Add_Goto (Table.States (227), 130, 41);
- Add_Goto (Table.States (227), 137, 46);
- Add_Goto (Table.States (227), 138, 47);
- Add_Goto (Table.States (227), 160, 394);
- Add_Goto (Table.States (227), 161, 395);
- Add_Goto (Table.States (227), 162, 396);
- Add_Goto (Table.States (227), 182, 55);
- Add_Goto (Table.States (227), 185, 56);
- Add_Goto (Table.States (227), 189, 57);
- Add_Goto (Table.States (227), 196, 59);
- Add_Goto (Table.States (227), 209, 61);
- Add_Goto (Table.States (227), 210, 62);
- Add_Goto (Table.States (227), 212, 63);
- Add_Goto (Table.States (227), 213, 64);
- Add_Goto (Table.States (227), 216, 65);
- Add_Goto (Table.States (227), 217, 66);
- Add_Goto (Table.States (227), 218, 67);
- Add_Goto (Table.States (227), 219, 68);
- Add_Goto (Table.States (227), 222, 70);
- Add_Goto (Table.States (227), 226, 72);
- Add_Goto (Table.States (227), 246, 75);
- Add_Goto (Table.States (227), 247, 76);
- Add_Goto (Table.States (227), 248, 77);
- Add_Goto (Table.States (227), 249, 78);
- Add_Goto (Table.States (227), 250, 79);
- Add_Goto (Table.States (227), 251, 80);
- Add_Goto (Table.States (227), 252, 81);
- Add_Goto (Table.States (227), 253, 82);
- Add_Goto (Table.States (227), 254, 83);
- Add_Goto (Table.States (227), 260, 397);
- Add_Goto (Table.States (227), 262, 85);
- Add_Goto (Table.States (227), 263, 86);
- Add_Goto (Table.States (227), 265, 88);
- Add_Goto (Table.States (227), 266, 89);
- Add_Goto (Table.States (227), 267, 90);
- Add_Goto (Table.States (227), 268, 91);
- Add_Goto (Table.States (227), 274, 92);
- Add_Goto (Table.States (227), 284, 95);
- Add_Goto (Table.States (227), 292, 96);
- Add_Goto (Table.States (227), 307, 103);
- Add_Goto (Table.States (227), 308, 104);
- Add_Goto (Table.States (227), 310, 106);
- Add_Goto (Table.States (227), 311, 107);
- Add_Goto (Table.States (227), 312, 108);
- Add_Goto (Table.States (227), 314, 109);
- Add_Goto (Table.States (227), 316, 110);
- Add_Goto (Table.States (227), 319, 112);
- Add_Goto (Table.States (227), 320, 113);
- Add_Goto (Table.States (227), 322, 114);
- Add_Goto (Table.States (227), 328, 116);
- Add_Goto (Table.States (227), 334, 117);
- Table.States (227).Kernel := To_Vector ((0 => ((136, 0), 17, 3,
(2147483647, 0), 0)));
- Table.States (227).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (162, 1), 0)));
- Table.States (228).Action_List.Set_Capacity (2);
- Add_Action (Table.States (228), 37, Reduce, (234, 1), 0, null,
null);
- Add_Action (Table.States (228), 107, (233, 0), 398);
- Table.States (228).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (228), 233, 157);
- Add_Goto (Table.States (228), 234, 158);
- Table.States (228).Kernel := To_Vector ((0 => ((232, 1), 28, 0,
(234, 1), 0)));
- Table.States (228).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (234, 1), 0)));
- Table.States (229).Action_List.Set_Capacity (24);
- Add_Action (Table.States (229), 4, (116, 0), 1);
- Add_Action (Table.States (229), 5, (306, 8), 2);
- Add_Action (Table.States (229), 13, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (229), 15, (142, 0), 3);
- Add_Action (Table.States (229), 17, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (229), 18, (164, 0), 4);
- Add_Action (Table.States (229), 24, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (229), 27, (193, 0), 5);
- Add_Action (Table.States (229), 28, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (229), 31, (306, 3), 9);
- Add_Action (Table.States (229), 32, (225, 0), 10);
- Add_Action (Table.States (229), 37, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (229), 41, (306, 0), 13);
- Add_Action (Table.States (229), 48, (260, 0), 16);
- Add_Action (Table.States (229), 52, (279, 0), 20);
- Add_Action (Table.States (229), 57, (293, 0), 21);
- Add_Action (Table.States (229), 58, (199, 0), 22);
- Add_Action (Table.States (229), 61, (129, 0), 24);
- Add_Action (Table.States (229), 73, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (229), 81, (242, 8), 31);
- Add_Action (Table.States (229), 96, (220, 0), 32);
- Add_Action (Table.States (229), 107, (134, 0), 363);
- Add_Action (Table.States (229), 108, (242, 7), 34);
- Add_Action (Table.States (229), 109, (242, 6), 35);
- Table.States (229).Goto_List.Set_Capacity (31);
- Add_Goto (Table.States (229), 116, 37);
- Add_Goto (Table.States (229), 126, 39);
- Add_Goto (Table.States (229), 129, 40);
- Add_Goto (Table.States (229), 131, 42);
- Add_Goto (Table.States (229), 134, 43);
- Add_Goto (Table.States (229), 135, 44);
- Add_Goto (Table.States (229), 136, 45);
- Add_Goto (Table.States (229), 142, 48);
- Add_Goto (Table.States (229), 154, 51);
- Add_Goto (Table.States (229), 155, 52);
- Add_Goto (Table.States (229), 164, 54);
- Add_Goto (Table.States (229), 193, 58);
- Add_Goto (Table.States (229), 199, 60);
- Add_Goto (Table.States (229), 220, 69);
- Add_Goto (Table.States (229), 225, 71);
- Add_Goto (Table.States (229), 235, 73);
- Add_Goto (Table.States (229), 242, 74);
- Add_Goto (Table.States (229), 260, 84);
- Add_Goto (Table.States (229), 264, 87);
- Add_Goto (Table.States (229), 275, 93);
- Add_Goto (Table.States (229), 279, 94);
- Add_Goto (Table.States (229), 293, 97);
- Add_Goto (Table.States (229), 296, 98);
- Add_Goto (Table.States (229), 297, 99);
- Add_Goto (Table.States (229), 301, 100);
- Add_Goto (Table.States (229), 302, 364);
- Add_Goto (Table.States (229), 303, 399);
- Add_Goto (Table.States (229), 305, 101);
- Add_Goto (Table.States (229), 306, 102);
- Add_Goto (Table.States (229), 309, 366);
- Add_Goto (Table.States (229), 326, 115);
- Table.States (229).Kernel := To_Vector ((0 => ((235, 1), 37, 3,
(2147483647, 0), 0)));
- Table.States (229).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (303, 1), 0)));
- Table.States (230).Action_List.Set_Capacity (1);
- Add_Action (Table.States (230), 37, (235, 0), 400);
- Table.States (230).Kernel := To_Vector ((0 => ((235, 0), 232, 4,
(2147483647, 0), 0)));
- Table.States (230).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (235, 0), 37, 400)));
- Table.States (231).Action_List.Set_Capacity (40);
- Add_Action (Table.States (231), (4, 5, 13, 15, 17, 18, 25, 27, 28,
29, 30, 31, 32, 36, 37, 40, 41, 46, 47,
- 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 81,
96, 107, 108, 109, 110), (146, 0), 2,
- compilation_0'Access, null);
- Table.States (231).Kernel := To_Vector ((0 => ((146, 0), 145, 0,
(146, 0), 2)));
- Table.States (231).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (146, 0), 2)));
- Table.States (232).Action_List.Set_Capacity (4);
- Add_Action (Table.States (232), 81, (242, 8), 31);
- Add_Action (Table.States (232), 107, (242, 5), 120);
- Add_Action (Table.States (232), 108, (242, 7), 34);
- Add_Action (Table.States (232), 109, (242, 6), 35);
- Table.States (232).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (232), 131, 42);
- Add_Goto (Table.States (232), 242, 401);
- Add_Goto (Table.States (232), 275, 93);
- Add_Goto (Table.States (232), 296, 98);
- Table.States (232).Kernel := To_Vector ((((254, 0), 47, 4,
(2147483647, 0), 0), ((254, 1), 47, 3,
- (2147483647, 0), 0)));
- Table.States (232).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (233).Action_List.Set_Capacity (1);
- Add_Action (Table.States (233), 99, (217, 0), 402);
- Table.States (233).Kernel := To_Vector ((0 => ((217, 0), 254, 1,
(2147483647, 0), 0)));
- Table.States (233).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (217, 0), 99, 402)));
- Table.States (234).Action_List.Set_Capacity (2);
- Add_Action (Table.States (234), 74, (125, 0), 340);
- Add_Action (Table.States (234), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (234).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (234), 125, 403);
- Table.States (234).Kernel := To_Vector ((0 => ((219, 0), 315, 1,
(2147483647, 0), 0)));
- Table.States (234).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (235).Action_List.Set_Capacity (13);
- Add_Action (Table.States (235), 7, Reduce, (121, 1), 0, null,
null);
- Add_Action (Table.States (235), 8, (121, 0), 404);
- Add_Action (Table.States (235), 11, Reduce, (121, 1), 0, null,
null);
- Add_Action (Table.States (235), 16, (160, 9), 405);
- Add_Conflict (Table.States (235), 16, (121, 1), 0, null, null);
- Add_Action (Table.States (235), 26, (189, 0), 406);
- Add_Action (Table.States (235), 40, Reduce, (121, 1), 0, null,
null);
- Add_Action (Table.States (235), 74, Reduce, (121, 1), 0, null,
null);
- Add_Action (Table.States (235), 81, Reduce, (121, 1), 0, null,
null);
- Add_Action (Table.States (235), 85, Reduce, (121, 1), 0, null,
null);
- Add_Action (Table.States (235), 99, Reduce, (121, 1), 0, null,
null);
- Add_Action (Table.States (235), 107, Reduce, (121, 1), 0, null,
null);
- Add_Action (Table.States (235), 108, Reduce, (121, 1), 0, null,
null);
- Add_Action (Table.States (235), 109, Reduce, (121, 1), 0, null,
null);
- Table.States (235).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (235), 121, 407);
- Table.States (235).Kernel := To_Vector ((((160, 9), 84, 3,
(2147483647, 0), 0), ((189, 0), 84, 2,
- (2147483647, 0), 0), ((247, 0), 84, 3, (2147483647, 0), 0),
((247, 1), 84, 4, (2147483647, 0), 0),
- ((247, 2), 84, 10, (2147483647, 0), 0), ((247, 3), 84, 2,
(2147483647, 0), 0), ((247, 4), 84, 3,
- (2147483647, 0), 0), ((247, 5), 84, 9, (2147483647, 0), 0)));
- Table.States (235).Minimal_Complete_Actions := To_Vector (((Shift,
(189, 0), 26, 406), (Reduce, (121, 1),
- 0)));
- Table.States (236).Action_List.Set_Capacity (1);
- Add_Action (Table.States (236), 107, (222, 0), 408);
- Table.States (236).Kernel := To_Vector ((0 => ((222, 0), 86, 1,
(2147483647, 0), 0)));
- Table.States (236).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (222, 0), 107, 408)));
- Table.States (237).Action_List.Set_Capacity (22);
- Add_Action (Table.States (237), 3, (200, 2), 122);
- Add_Action (Table.States (237), 15, (139, 0), 260);
- Add_Action (Table.States (237), 28, (127, 6), 261);
- Add_Action (Table.States (237), 32, (224, 0), 262);
- Add_Action (Table.States (237), 39, (261, 4), 123);
- Add_Action (Table.States (237), 40, (168, 1), 263);
- Add_Action (Table.States (237), 41, (261, 1), 125);
- Add_Action (Table.States (237), 44, (168, 3), 265);
- Add_Action (Table.States (237), 52, (278, 0), 126);
- Add_Action (Table.States (237), 76, (120, 0), 127);
- Add_Action (Table.States (237), 77, (120, 5), 128);
- Add_Action (Table.States (237), 78, Reduce, (127, 5), 0, null,
null);
- Add_Action (Table.States (237), 81, (242, 8), 31);
- Add_Action (Table.States (237), 82, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (237), 86, Reduce, (127, 5), 0, null,
null);
- Add_Action (Table.States (237), 90, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (237), 97, (333, 1), 129);
- Add_Action (Table.States (237), 98, (333, 0), 130);
- Add_Action (Table.States (237), 106, (261, 0), 131);
- Add_Action (Table.States (237), 107, (242, 5), 120);
- Add_Action (Table.States (237), 108, (242, 7), 34);
- Add_Action (Table.States (237), 109, (127, 0), 266);
- Table.States (237).Goto_List.Set_Capacity (29);
- Add_Goto (Table.States (237), 120, 132);
- Add_Goto (Table.States (237), 127, 267);
- Add_Goto (Table.States (237), 128, 409);
- Add_Goto (Table.States (237), 131, 42);
- Add_Goto (Table.States (237), 139, 269);
- Add_Goto (Table.States (237), 156, 410);
- Add_Goto (Table.States (237), 168, 271);
- Add_Goto (Table.States (237), 169, 272);
- Add_Goto (Table.States (237), 194, 411);
- Add_Goto (Table.States (237), 200, 135);
- Add_Goto (Table.States (237), 224, 275);
- Add_Goto (Table.States (237), 242, 276);
- Add_Goto (Table.States (237), 261, 137);
- Add_Goto (Table.States (237), 275, 93);
- Add_Goto (Table.States (237), 276, 277);
- Add_Goto (Table.States (237), 278, 138);
- Add_Goto (Table.States (237), 280, 412);
- Add_Goto (Table.States (237), 281, 413);
- Add_Goto (Table.States (237), 285, 139);
- Add_Goto (Table.States (237), 286, 140);
- Add_Goto (Table.States (237), 287, 141);
- Add_Goto (Table.States (237), 288, 142);
- Add_Goto (Table.States (237), 289, 143);
- Add_Goto (Table.States (237), 290, 144);
- Add_Goto (Table.States (237), 296, 98);
- Add_Goto (Table.States (237), 304, 279);
- Add_Goto (Table.States (237), 323, 146);
- Add_Goto (Table.States (237), 324, 147);
- Add_Goto (Table.States (237), 333, 148);
- Table.States (237).Kernel := To_Vector ((((118, 0), 76, 1,
(2147483647, 0), 0), ((118, 1), 76, 3,
- (2147483647, 0), 0), ((242, 0), 76, 4, (2147483647, 0), 0)));
- Table.States (237).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (128, 1), 0)));
- Table.States (238).Action_List.Set_Capacity (15);
- Add_Action (Table.States (238), 3, (200, 2), 122);
- Add_Action (Table.States (238), 39, (261, 4), 123);
- Add_Action (Table.States (238), 40, (200, 3), 124);
- Add_Action (Table.States (238), 41, (261, 1), 125);
- Add_Action (Table.States (238), 52, (278, 0), 126);
- Add_Action (Table.States (238), 76, (120, 0), 127);
- Add_Action (Table.States (238), 77, (120, 5), 128);
- Add_Action (Table.States (238), 81, (242, 8), 31);
- Add_Action (Table.States (238), 97, (333, 1), 129);
- Add_Action (Table.States (238), 98, (333, 0), 130);
- Add_Action (Table.States (238), 99, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (238), 106, (261, 0), 131);
- Add_Action (Table.States (238), 107, (242, 5), 120);
- Add_Action (Table.States (238), 108, (242, 7), 34);
- Add_Action (Table.States (238), 109, (242, 6), 35);
- Table.States (238).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (238), 120, 132);
- Add_Goto (Table.States (238), 131, 42);
- Add_Goto (Table.States (238), 194, 133);
- Add_Goto (Table.States (238), 195, 414);
- Add_Goto (Table.States (238), 200, 135);
- Add_Goto (Table.States (238), 242, 136);
- Add_Goto (Table.States (238), 261, 137);
- Add_Goto (Table.States (238), 275, 93);
- Add_Goto (Table.States (238), 278, 138);
- Add_Goto (Table.States (238), 285, 139);
- Add_Goto (Table.States (238), 286, 140);
- Add_Goto (Table.States (238), 287, 141);
- Add_Goto (Table.States (238), 288, 142);
- Add_Goto (Table.States (238), 289, 143);
- Add_Goto (Table.States (238), 290, 144);
- Add_Goto (Table.States (238), 296, 98);
- Add_Goto (Table.States (238), 304, 145);
- Add_Goto (Table.States (238), 323, 146);
- Add_Goto (Table.States (238), 324, 147);
- Add_Goto (Table.States (238), 333, 148);
- Table.States (238).Kernel := To_Vector ((0 => ((126, 0), 85, 1,
(2147483647, 0), 0)));
- Table.States (238).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (239).Action_List.Set_Capacity (4);
- Add_Action (Table.States (239), 9, (296, 3), 415);
- Add_Action (Table.States (239), 107, (296, 0), 416);
- Add_Action (Table.States (239), 108, (296, 2), 417);
- Add_Action (Table.States (239), 109, (296, 1), 418);
- Table.States (239).Kernel := To_Vector ((((296, 0), 87, 1,
(2147483647, 0), 0), ((296, 1), 87, 1,
- (2147483647, 0), 0), ((296, 2), 87, 1, (2147483647, 0), 0),
((296, 3), 87, 1, (2147483647, 0), 0)));
- Table.States (240).Action_List.Set_Capacity (47);
- Add_Action (Table.States (240), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (264, 0), 2, procedure_call_statement_0'Access, null);
- Table.States (240).Kernel := To_Vector ((0 => ((264, 0), 99, 0,
(264, 0), 2)));
- Table.States (240).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (264, 0), 2)));
- Table.States (241).Action_List.Set_Capacity (8);
- Add_Action (Table.States (241), (7, 19, 20, 38, 53, 76, 77, 107),
(325, 0), 1, null, null);
- Table.States (241).Kernel := To_Vector ((0 => ((325, 0), 104, 0,
(325, 0), 1)));
- Table.States (241).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (325, 0), 1)));
- Table.States (242).Action_List.Set_Capacity (8);
- Add_Action (Table.States (242), (7, 19, 20, 38, 53, 76, 77, 107),
(325, 1), 1, null, null);
- Table.States (242).Kernel := To_Vector ((0 => ((325, 1), 105, 0,
(325, 1), 1)));
- Table.States (242).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (325, 1), 1)));
- Table.States (243).Action_List.Set_Capacity (65);
- Add_Action (Table.States (243), (4, 5, 10, 13, 15, 17, 18, 20, 21,
22, 23, 27, 28, 31, 32, 33, 35, 37, 38,
- 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74,
75, 76, 78, 79, 80, 81, 82, 85, 86, 87, 88,
- 89, 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104,
105, 107, 108, 109), (242, 1), 2,
- name_1'Access, null);
- Table.States (243).Kernel := To_Vector ((0 => ((242, 1), 118, 0,
(242, 1), 2)));
- Table.States (243).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (242, 1), 2)));
- Table.States (244).Action_List.Set_Capacity (7);
- Add_Action (Table.States (244), 7, (132, 2), 419);
- Add_Action (Table.States (244), 19, (132, 3), 420);
- Add_Action (Table.States (244), 20, (132, 4), 421);
- Add_Action (Table.States (244), 38, (132, 5), 422);
- Add_Action (Table.States (244), 76, (120, 0), 127);
- Add_Action (Table.States (244), 77, (120, 5), 128);
- Add_Action (Table.States (244), 107, (132, 0), 423);
- Table.States (244).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (244), 120, 424);
- Add_Goto (Table.States (244), 132, 425);
- Table.States (244).Kernel := To_Vector ((((131, 0), 325, 1,
(2147483647, 0), 0), ((275, 0), 325, 2,
- (2147483647, 0), 0)));
- Table.States (245).Action_List.Set_Capacity (1);
- Add_Action (Table.States (245), 107, (182, 0), 426);
- Table.States (245).Kernel := To_Vector ((((182, 0), 25, 5,
(2147483647, 0), 0), ((182, 1), 25, 2,
- (2147483647, 0), 0)));
- Table.States (245).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (182, 0), 107, 426)));
- Table.States (246).Action_List.Set_Capacity (4);
- Add_Action (Table.States (246), 81, (242, 8), 31);
- Add_Action (Table.States (246), 107, (242, 5), 120);
- Add_Action (Table.States (246), 108, (242, 7), 34);
- Add_Action (Table.States (246), 109, (242, 6), 35);
- Table.States (246).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (246), 131, 42);
- Add_Goto (Table.States (246), 242, 427);
- Add_Goto (Table.States (246), 275, 93);
- Add_Goto (Table.States (246), 296, 98);
- Table.States (246).Kernel := To_Vector ((((210, 0), 29, 2,
(2147483647, 0), 0), ((216, 2), 29, 5,
- (2147483647, 0), 0)));
- Table.States (246).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (247).Action_List.Set_Capacity (4);
- Add_Action (Table.States (247), 81, (242, 8), 31);
- Add_Action (Table.States (247), 107, (242, 5), 120);
- Add_Action (Table.States (247), 108, (242, 7), 34);
- Add_Action (Table.States (247), 109, (242, 6), 35);
- Table.States (247).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (247), 131, 42);
- Add_Goto (Table.States (247), 242, 428);
- Add_Goto (Table.States (247), 275, 93);
- Add_Goto (Table.States (247), 296, 98);
- Table.States (247).Kernel := To_Vector ((((216, 1), 50, 5,
(2147483647, 0), 0), ((265, 0), 50, 1,
- (2147483647, 0), 0)));
- Table.States (247).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (248).Action_List.Set_Capacity (4);
- Add_Action (Table.States (248), 35, (196, 0), 429);
- Add_Conflict (Table.States (248), 35, (315, 1), 1, null,
subprogram_specification_1_check'Access);
- Add_Action (Table.States (248), 56, Reduce, (315, 1), 1, null,
subprogram_specification_1_check'Access);
- Add_Action (Table.States (248), 74, Reduce, (315, 1), 1, null,
subprogram_specification_1_check'Access);
- Add_Action (Table.States (248), 99, Reduce, (315, 1), 1, null,
subprogram_specification_1_check'Access);
- Table.States (248).Kernel := To_Vector ((((196, 0), 210, 4,
(2147483647, 0), 0), ((315, 1), 210, 0,
- (315, 1), 1)));
- Table.States (248).Minimal_Complete_Actions := To_Vector (((Shift,
(196, 0), 35, 429), (Reduce, (315, 1),
- 1)));
- Table.States (249).Action_List.Set_Capacity (4);
- Add_Action (Table.States (249), 35, (246, 0), 430);
- Add_Conflict (Table.States (249), 35, (315, 0), 1, null,
subprogram_specification_0_check'Access);
- Add_Action (Table.States (249), 56, Reduce, (315, 0), 1, null,
subprogram_specification_0_check'Access);
- Add_Action (Table.States (249), 74, Reduce, (315, 0), 1, null,
subprogram_specification_0_check'Access);
- Add_Action (Table.States (249), 99, Reduce, (315, 0), 1, null,
subprogram_specification_0_check'Access);
- Table.States (249).Kernel := To_Vector ((((246, 0), 265, 3,
(2147483647, 0), 0), ((315, 0), 265, 0,
- (315, 0), 1)));
- Table.States (249).Minimal_Complete_Actions := To_Vector (((Shift,
(246, 0), 35, 430), (Reduce, (315, 0),
- 1)));
- Table.States (250).Action_List.Set_Capacity (4);
- Add_Action (Table.States (250), 35, (115, 0), 431);
- Add_Conflict (Table.States (250), 35, (125, 1), 0, null, null);
- Add_Action (Table.States (250), 56, (314, 0), 432);
- Add_Action (Table.States (250), 74, (125, 0), 340);
- Add_Action (Table.States (250), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (250).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (250), 125, 433);
- Table.States (250).Kernel := To_Vector ((((115, 0), 315, 3,
(2147483647, 0), 0), ((310, 0), 315, 4,
- (2147483647, 0), 0), ((311, 0), 315, 3, (2147483647, 0), 0),
((312, 0), 315, 1, (2147483647, 0), 0),
- ((314, 0), 315, 3, (2147483647, 0), 0)));
- Table.States (250).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (251).Action_List.Set_Capacity (41);
- Add_Action (Table.States (251), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (252, 0), 2,
- package_declaration_0'Access, null);
- Table.States (251).Kernel := To_Vector ((0 => ((252, 0), 99, 0,
(252, 0), 2)));
- Table.States (251).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (252, 0), 2)));
- Table.States (252).Action_List.Set_Capacity (22);
- Add_Action (Table.States (252), 3, (200, 2), 122);
- Add_Action (Table.States (252), 15, (139, 0), 260);
- Add_Action (Table.States (252), 28, (127, 6), 261);
- Add_Action (Table.States (252), 32, (224, 0), 262);
- Add_Action (Table.States (252), 39, (261, 4), 123);
- Add_Action (Table.States (252), 40, (168, 1), 263);
- Add_Action (Table.States (252), 41, (261, 1), 125);
- Add_Action (Table.States (252), 44, (168, 3), 265);
- Add_Action (Table.States (252), 52, (278, 0), 126);
- Add_Action (Table.States (252), 76, (120, 0), 127);
- Add_Action (Table.States (252), 77, (120, 5), 128);
- Add_Action (Table.States (252), 78, Reduce, (127, 5), 0, null,
null);
- Add_Action (Table.States (252), 81, (242, 8), 31);
- Add_Action (Table.States (252), 82, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (252), 86, Reduce, (127, 5), 0, null,
null);
- Add_Action (Table.States (252), 90, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (252), 97, (333, 1), 129);
- Add_Action (Table.States (252), 98, (333, 0), 130);
- Add_Action (Table.States (252), 106, (261, 0), 131);
- Add_Action (Table.States (252), 107, (242, 5), 120);
- Add_Action (Table.States (252), 108, (242, 7), 34);
- Add_Action (Table.States (252), 109, (127, 0), 266);
- Table.States (252).Goto_List.Set_Capacity (28);
- Add_Goto (Table.States (252), 120, 132);
- Add_Goto (Table.States (252), 127, 267);
- Add_Goto (Table.States (252), 128, 409);
- Add_Goto (Table.States (252), 131, 42);
- Add_Goto (Table.States (252), 139, 269);
- Add_Goto (Table.States (252), 156, 410);
- Add_Goto (Table.States (252), 168, 271);
- Add_Goto (Table.States (252), 169, 272);
- Add_Goto (Table.States (252), 194, 411);
- Add_Goto (Table.States (252), 200, 135);
- Add_Goto (Table.States (252), 224, 275);
- Add_Goto (Table.States (252), 242, 276);
- Add_Goto (Table.States (252), 261, 137);
- Add_Goto (Table.States (252), 275, 93);
- Add_Goto (Table.States (252), 276, 277);
- Add_Goto (Table.States (252), 278, 138);
- Add_Goto (Table.States (252), 280, 278);
- Add_Goto (Table.States (252), 285, 139);
- Add_Goto (Table.States (252), 286, 140);
- Add_Goto (Table.States (252), 287, 141);
- Add_Goto (Table.States (252), 288, 142);
- Add_Goto (Table.States (252), 289, 143);
- Add_Goto (Table.States (252), 290, 144);
- Add_Goto (Table.States (252), 296, 98);
- Add_Goto (Table.States (252), 304, 279);
- Add_Goto (Table.States (252), 323, 146);
- Add_Goto (Table.States (252), 324, 147);
- Add_Goto (Table.States (252), 333, 148);
- Table.States (252).Kernel := To_Vector ((((118, 0), 76, 1,
(2147483647, 0), 0), ((118, 1), 76, 3,
- (2147483647, 0), 0)));
- Table.States (252).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (128, 1), 0)));
- Table.States (253).Action_List.Set_Capacity (3);
- Add_Action (Table.States (253), (21, 76, 99), (119, 0), 1, null,
null);
- Table.States (253).Kernel := To_Vector ((0 => ((119, 0), 118, 0,
(119, 0), 1)));
- Table.States (253).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (119, 0), 1)));
- Table.States (254).Action_List.Set_Capacity (3);
- Add_Action (Table.States (254), 21, Reduce, (256, 1), 0, null,
null);
- Add_Action (Table.States (254), 76, (202, 0), 434);
- Add_Action (Table.States (254), 99, Reduce, (256, 1), 0, null,
null);
- Table.States (254).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (254), 202, 347);
- Add_Goto (Table.States (254), 256, 435);
- Table.States (254).Kernel := To_Vector ((((116, 0), 119, 3,
(2147483647, 0), 0), ((116, 1), 119, 1,
- (2147483647, 0), 0)));
- Table.States (254).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (256, 1), 0)));
- Table.States (255).Action_List.Set_Capacity (47);
- Add_Action (Table.States (255), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (306, 8), 3, simple_statement_8'Access, null);
- Table.States (255).Kernel := To_Vector ((0 => ((306, 8), 99, 0,
(306, 8), 3)));
- Table.States (255).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (306, 8), 3)));
- Table.States (256).Action_List.Set_Capacity (36);
- Add_Action (Table.States (256), (10, 20, 21, 22, 23, 33, 35, 37,
38, 40, 42, 43, 53, 55, 68, 74, 75, 78,
- 79, 80, 82, 85, 86, 88, 89, 90, 91, 92, 94, 95, 97, 98, 99, 100,
101, 102), (200, 2), 2, null, null);
- Table.States (256).Kernel := To_Vector ((0 => ((200, 2), 261, 0,
(200, 2), 2)));
- Table.States (256).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (200, 2), 2)));
- Table.States (257).Action_List.Set_Capacity (41);
- Add_Action (Table.States (257), 10, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 20, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 21, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 22, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 23, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 33, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 35, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 37, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 38, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 40, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 42, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 43, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 53, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 55, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 68, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 74, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 75, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 76, (118, 0), 237);
- Add_Action (Table.States (257), 78, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 79, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 80, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 82, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 85, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 86, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 87, (296, 0), 239);
- Add_Action (Table.States (257), 88, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 89, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 90, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 91, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 92, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 94, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 95, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 97, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 98, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 99, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 100, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 101, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 102, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 103, Reduce, (261, 4), 2,
primary_4'Access, null);
- Add_Action (Table.States (257), 104, (325, 0), 241);
- Add_Action (Table.States (257), 105, (325, 1), 242);
- Table.States (257).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (257), 118, 243);
- Add_Goto (Table.States (257), 325, 244);
- Table.States (257).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((242, 0), 242, 5,
- (2147483647, 0), 0), ((242, 1), 242, 2, (2147483647, 0), 0),
((261, 4), 242, 0, (261, 4), 2), ((275,
- 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (257).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (261, 4), 2)));
- Table.States (258).Action_List.Set_Capacity (36);
- Add_Action (Table.States (258), (10, 20, 21, 22, 23, 33, 35, 37,
38, 40, 42, 43, 53, 55, 68, 74, 75, 78,
- 79, 80, 82, 85, 86, 88, 89, 90, 91, 92, 94, 95, 97, 98, 99, 100,
101, 102), (200, 3), 2, null, null);
- Table.States (258).Kernel := To_Vector ((0 => ((200, 3), 261, 0,
(200, 3), 2)));
- Table.States (258).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (200, 3), 2)));
- Table.States (259).Action_List.Set_Capacity (22);
- Add_Action (Table.States (259), 10, Reduce, (278, 1), 2, null,
null);
- Add_Action (Table.States (259), 20, Reduce, (278, 1), 2, null,
null);
- Add_Action (Table.States (259), 21, Reduce, (278, 1), 2, null,
null);
- Add_Action (Table.States (259), 22, Reduce, (278, 1), 2, null,
null);
- Add_Action (Table.States (259), 23, Reduce, (278, 1), 2, null,
null);
- Add_Action (Table.States (259), 35, Reduce, (278, 1), 2, null,
null);
- Add_Action (Table.States (259), 37, Reduce, (278, 1), 2, null,
null);
- Add_Action (Table.States (259), 43, Reduce, (278, 1), 2, null,
null);
- Add_Action (Table.States (259), 53, Reduce, (278, 1), 2, null,
null);
- Add_Action (Table.States (259), 68, Reduce, (278, 1), 2, null,
null);
- Add_Action (Table.States (259), 74, (278, 0), 436);
- Add_Conflict (Table.States (259), 74, (278, 1), 2, null, null);
- Add_Action (Table.States (259), 75, Reduce, (278, 1), 2, null,
null);
- Add_Action (Table.States (259), 76, (118, 0), 237);
- Add_Action (Table.States (259), 78, Reduce, (278, 1), 2, null,
null);
- Add_Action (Table.States (259), 79, Reduce, (278, 1), 2, null,
null);
- Add_Action (Table.States (259), 82, Reduce, (278, 1), 2, null,
null);
- Add_Action (Table.States (259), 86, Reduce, (278, 1), 2, null,
null);
- Add_Action (Table.States (259), 87, (296, 0), 239);
- Add_Action (Table.States (259), 90, Reduce, (278, 1), 2, null,
null);
- Add_Action (Table.States (259), 99, Reduce, (278, 1), 2, null,
null);
- Add_Action (Table.States (259), 104, (325, 0), 241);
- Add_Action (Table.States (259), 105, (325, 1), 242);
- Table.States (259).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (259), 118, 243);
- Add_Goto (Table.States (259), 325, 244);
- Table.States (259).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((242, 0), 242, 5,
- (2147483647, 0), 0), ((242, 1), 242, 2, (2147483647, 0), 0),
((275, 0), 242, 3, (2147483647, 0), 0),
- ((278, 0), 242, 1, (2147483647, 0), 0), ((278, 1), 242, 0,
(278, 1), 2), ((296, 0), 242, 2,
- (2147483647, 0), 0), ((296, 1), 242, 2, (2147483647, 0), 0),
((296, 2), 242, 2, (2147483647, 0), 0),
- ((296, 3), 242, 2, (2147483647, 0), 0)));
- Table.States (259).Minimal_Complete_Actions := To_Vector (((Shift,
(278, 0), 74, 436), (Reduce, (278, 1),
- 2)));
- Table.States (260).Action_List.Set_Capacity (15);
- Add_Action (Table.States (260), 3, (200, 2), 122);
- Add_Action (Table.States (260), 35, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (260), 39, (261, 4), 123);
- Add_Action (Table.States (260), 40, (200, 3), 124);
- Add_Action (Table.States (260), 41, (261, 1), 125);
- Add_Action (Table.States (260), 52, (278, 0), 126);
- Add_Action (Table.States (260), 76, (120, 0), 127);
- Add_Action (Table.States (260), 77, (120, 5), 128);
- Add_Action (Table.States (260), 81, (242, 8), 31);
- Add_Action (Table.States (260), 97, (333, 1), 129);
- Add_Action (Table.States (260), 98, (333, 0), 130);
- Add_Action (Table.States (260), 106, (261, 0), 131);
- Add_Action (Table.States (260), 107, (242, 5), 120);
- Add_Action (Table.States (260), 108, (242, 7), 34);
- Add_Action (Table.States (260), 109, (242, 6), 35);
- Table.States (260).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (260), 120, 132);
- Add_Goto (Table.States (260), 131, 42);
- Add_Goto (Table.States (260), 194, 133);
- Add_Goto (Table.States (260), 195, 437);
- Add_Goto (Table.States (260), 200, 135);
- Add_Goto (Table.States (260), 242, 136);
- Add_Goto (Table.States (260), 261, 137);
- Add_Goto (Table.States (260), 275, 93);
- Add_Goto (Table.States (260), 278, 138);
- Add_Goto (Table.States (260), 285, 139);
- Add_Goto (Table.States (260), 286, 140);
- Add_Goto (Table.States (260), 287, 141);
- Add_Goto (Table.States (260), 288, 142);
- Add_Goto (Table.States (260), 289, 143);
- Add_Goto (Table.States (260), 290, 144);
- Add_Goto (Table.States (260), 296, 98);
- Add_Goto (Table.States (260), 304, 145);
- Add_Goto (Table.States (260), 323, 146);
- Add_Goto (Table.States (260), 324, 147);
- Add_Goto (Table.States (260), 333, 148);
- Table.States (260).Kernel := To_Vector ((0 => ((139, 0), 15, 3,
(2147483647, 0), 0)));
- Table.States (260).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (261).Action_List.Set_Capacity (3);
- Add_Action (Table.States (261), 9, (277, 0), 438);
- Add_Action (Table.States (261), 62, (277, 1), 439);
- Add_Action (Table.States (261), 107, (127, 6), 440);
- Table.States (261).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (261), 233, 441);
- Add_Goto (Table.States (261), 277, 442);
- Table.States (261).Kernel := To_Vector ((((127, 6), 28, 4,
(2147483647, 0), 0), ((127, 7), 28, 5,
- (2147483647, 0), 0), ((276, 0), 28, 5, (2147483647, 0), 0)));
- Table.States (261).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (127, 6), 107, 440)));
- Table.States (262).Action_List.Set_Capacity (15);
- Add_Action (Table.States (262), 3, (200, 2), 122);
- Add_Action (Table.States (262), 39, (261, 4), 123);
- Add_Action (Table.States (262), 40, (200, 3), 124);
- Add_Action (Table.States (262), 41, (261, 1), 125);
- Add_Action (Table.States (262), 52, (278, 0), 126);
- Add_Action (Table.States (262), 68, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (262), 76, (120, 0), 127);
- Add_Action (Table.States (262), 77, (120, 5), 128);
- Add_Action (Table.States (262), 81, (242, 8), 31);
- Add_Action (Table.States (262), 97, (333, 1), 129);
- Add_Action (Table.States (262), 98, (333, 0), 130);
- Add_Action (Table.States (262), 106, (261, 0), 131);
- Add_Action (Table.States (262), 107, (242, 5), 120);
- Add_Action (Table.States (262), 108, (242, 7), 34);
- Add_Action (Table.States (262), 109, (242, 6), 35);
- Table.States (262).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (262), 120, 132);
- Add_Goto (Table.States (262), 131, 42);
- Add_Goto (Table.States (262), 194, 133);
- Add_Goto (Table.States (262), 195, 443);
- Add_Goto (Table.States (262), 200, 135);
- Add_Goto (Table.States (262), 242, 136);
- Add_Goto (Table.States (262), 261, 137);
- Add_Goto (Table.States (262), 275, 93);
- Add_Goto (Table.States (262), 278, 138);
- Add_Goto (Table.States (262), 285, 139);
- Add_Goto (Table.States (262), 286, 140);
- Add_Goto (Table.States (262), 287, 141);
- Add_Goto (Table.States (262), 288, 142);
- Add_Goto (Table.States (262), 289, 143);
- Add_Goto (Table.States (262), 290, 144);
- Add_Goto (Table.States (262), 296, 98);
- Add_Goto (Table.States (262), 304, 145);
- Add_Goto (Table.States (262), 323, 146);
- Add_Goto (Table.States (262), 324, 147);
- Add_Goto (Table.States (262), 333, 148);
- Table.States (262).Kernel := To_Vector ((((224, 0), 32, 4,
(2147483647, 0), 0), ((224, 1), 32, 2,
- (2147483647, 0), 0), ((224, 2), 32, 3, (2147483647, 0), 0),
((224, 3), 32, 1, (2147483647, 0), 0)));
- Table.States (262).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (263).Action_List.Set_Capacity (9);
- Add_Action (Table.States (263), 39, (261, 4), 123);
- Add_Action (Table.States (263), 41, (168, 1), 444);
- Add_Action (Table.States (263), 76, (120, 0), 127);
- Add_Action (Table.States (263), 77, (120, 5), 128);
- Add_Action (Table.States (263), 81, (242, 8), 31);
- Add_Action (Table.States (263), 106, (261, 0), 131);
- Add_Action (Table.States (263), 107, (242, 5), 120);
- Add_Action (Table.States (263), 108, (242, 7), 34);
- Add_Action (Table.States (263), 109, (242, 6), 35);
- Table.States (263).Goto_List.Set_Capacity (6);
- Add_Goto (Table.States (263), 120, 132);
- Add_Goto (Table.States (263), 131, 42);
- Add_Goto (Table.States (263), 242, 136);
- Add_Goto (Table.States (263), 261, 258);
- Add_Goto (Table.States (263), 275, 93);
- Add_Goto (Table.States (263), 296, 98);
- Table.States (263).Kernel := To_Vector ((((168, 1), 40, 2,
(2147483647, 0), 0), ((200, 3), 40, 1,
- (2147483647, 0), 0)));
- Table.States (263).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (264).Action_List.Set_Capacity (26);
- Add_Action (Table.States (264), 10, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (264), 33, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (264), 38, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (264), 40, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (264), 43, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (264), 54, (120, 1), 445);
- Add_Action (Table.States (264), 55, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (264), 74, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (264), 75, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (264), 78, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (264), 80, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (264), 82, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (264), 86, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (264), 88, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (264), 89, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (264), 90, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (264), 91, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (264), 92, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (264), 94, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (264), 95, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (264), 97, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (264), 98, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (264), 100, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (264), 101, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (264), 102, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (264), 103, Reduce, (261, 1), 1, null,
null);
- Table.States (264).Kernel := To_Vector ((((120, 1), 41, 2,
(2147483647, 0), 0), ((261, 1), 41, 0,
- (261, 1), 1)));
- Table.States (264).Minimal_Complete_Actions := To_Vector (((Shift,
(120, 1), 54, 445), (Reduce, (261, 1),
- 1)));
- end Subr_5;
- procedure Subr_6
- is begin
- Table.States (265).Action_List.Set_Capacity (2);
- Add_Action (Table.States (265), (82, 90), (168, 3), 1, null,
null);
- Table.States (265).Kernel := To_Vector ((0 => ((168, 3), 44, 0,
(168, 3), 1)));
- Table.States (265).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (168, 3), 1)));
- Table.States (266).Action_List.Set_Capacity (33);
- Add_Action (Table.States (266), 10, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 33, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 35, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 38, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 40, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 43, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 53, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 55, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 74, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 75, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 76, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 78, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 79, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 80, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 82, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 86, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 87, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 88, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 89, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 90, (127, 0), 446);
- Add_Conflict (Table.States (266), 90, (242, 6), 1, null, null);
- Add_Action (Table.States (266), 91, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 92, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 94, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 95, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 97, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 98, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 99, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 100, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 101, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 102, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 103, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 104, Reduce, (242, 6), 1, null,
null);
- Add_Action (Table.States (266), 105, Reduce, (242, 6), 1, null,
null);
- Table.States (266).Kernel := To_Vector ((((127, 0), 109, 1,
(2147483647, 0), 0), ((127, 1), 109, 2,
- (2147483647, 0), 0), ((242, 6), 109, 0, (242, 6), 1)));
- Table.States (266).Minimal_Complete_Actions := To_Vector (((Shift,
(127, 0), 90, 446), (Reduce, (242, 6),
- 1)));
- Table.States (267).Action_List.Set_Capacity (5);
- Add_Action (Table.States (267), (35, 78, 79, 86, 99), (128, 1),
1, null, null);
- Table.States (267).Kernel := To_Vector ((0 => ((128, 1), 127, 0,
(128, 1), 1)));
- Table.States (267).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (128, 1), 1)));
- Table.States (268).Action_List.Set_Capacity (2);
- Add_Action (Table.States (268), 78, (120, 0), 447);
- Add_Action (Table.States (268), 86, (128, 0), 448);
- Table.States (268).Kernel := To_Vector ((((120, 0), 128, 1,
(2147483647, 0), 0), ((128, 0), 128, 1,
- (2147483647, 0), 0)));
- Table.States (268).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (120, 0), 78, 447)));
- Table.States (269).Action_List.Set_Capacity (1);
- Add_Action (Table.States (269), (1 => 78), (156, 1), 1, null,
null);
- Table.States (269).Kernel := To_Vector ((0 => ((156, 1), 139, 0,
(156, 1), 1)));
- Table.States (269).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (156, 1), 1)));
- Table.States (270).Action_List.Set_Capacity (1);
- Add_Action (Table.States (270), 78, (120, 6), 449);
- Table.States (270).Kernel := To_Vector ((0 => ((120, 6), 156, 1,
(2147483647, 0), 0)));
- Table.States (270).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (120, 6), 78, 449)));
- Table.States (271).Action_List.Set_Capacity (2);
- Add_Action (Table.States (271), (82, 90), (169, 1), 1, null,
null);
- Table.States (271).Kernel := To_Vector ((0 => ((169, 1), 168, 0,
(169, 1), 1)));
- Table.States (271).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (169, 1), 1)));
- Table.States (272).Action_List.Set_Capacity (2);
- Add_Action (Table.States (272), 82, (169, 0), 450);
- Add_Action (Table.States (272), 90, (127, 2), 451);
- Table.States (272).Kernel := To_Vector ((((127, 2), 169, 1,
(2147483647, 0), 0), ((127, 3), 169, 2,
- (2147483647, 0), 0), ((169, 0), 169, 2, (2147483647, 0), 0)));
- Table.States (273).Action_List.Set_Capacity (5);
- Add_Action (Table.States (273), 74, (120, 4), 452);
- Add_Conflict (Table.States (273), 74, (195, 0), 1, null, null);
- Add_Action (Table.States (273), 78, Reduce, (127, 4), 1,
association_opt_4'Access, null);
- Add_Conflict (Table.States (273), 78, (195, 0), 1, null, null);
- Add_Action (Table.States (273), 82, Reduce, (168, 0), 1, null,
null);
- Add_Action (Table.States (273), 86, Reduce, (127, 4), 1,
association_opt_4'Access, null);
- Add_Action (Table.States (273), 90, Reduce, (168, 0), 1, null,
null);
- Table.States (273).Kernel := To_Vector ((((120, 4), 194, 3,
(2147483647, 0), 0), ((127, 4), 194, 0,
- (127, 4), 1), ((168, 0), 194, 0, (168, 0), 1), ((195, 0),
194, 0, (195, 0), 1)));
- Table.States (273).Minimal_Complete_Actions := To_Vector (((Shift,
(120, 4), 74, 452), (Reduce, (127, 4),
- 1), (Reduce, (168, 0), 1), (Reduce, (195, 0), 1)));
- Table.States (274).Action_List.Set_Capacity (1);
- Add_Action (Table.States (274), 74, (120, 2), 453);
- Table.States (274).Kernel := To_Vector ((((120, 2), 195, 4,
(2147483647, 0), 0), ((120, 3), 195, 2,
- (2147483647, 0), 0)));
- Table.States (274).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (120, 2), 74, 453)));
- Table.States (275).Action_List.Set_Capacity (1);
- Add_Action (Table.States (275), (1 => 78), (156, 0), 1, null,
null);
- Table.States (275).Kernel := To_Vector ((0 => ((156, 0), 224, 0,
(156, 0), 1)));
- Table.States (275).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (156, 0), 1)));
- Table.States (276).Action_List.Set_Capacity (39);
- Add_Action (Table.States (276), 10, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 20, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 21, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 22, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 23, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 33, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 35, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 37, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 38, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 40, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 43, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 53, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 55, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 68, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 74, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 75, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 76, (118, 0), 237);
- Add_Action (Table.States (276), 78, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 79, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 80, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 82, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 86, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 87, (296, 0), 239);
- Add_Action (Table.States (276), 88, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 89, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 90, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 91, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 92, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 94, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 95, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 97, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 98, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 99, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 100, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 101, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 102, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 103, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (276), 104, (325, 0), 241);
- Add_Action (Table.States (276), 105, (325, 1), 242);
- Table.States (276).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (276), 118, 243);
- Add_Goto (Table.States (276), 325, 454);
- Table.States (276).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((242, 0), 242, 5,
- (2147483647, 0), 0), ((242, 1), 242, 2, (2147483647, 0), 0),
((261, 3), 242, 0, (261, 3), 1), ((275,
- 0), 242, 3, (2147483647, 0), 0), ((280, 0), 242, 4,
(2147483647, 0), 0), ((280, 1), 242, 2,
- (2147483647, 0), 0), ((296, 0), 242, 2, (2147483647, 0), 0),
((296, 1), 242, 2, (2147483647, 0), 0),
- ((296, 2), 242, 2, (2147483647, 0), 0), ((296, 3), 242, 2,
(2147483647, 0), 0)));
- Table.States (276).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (261, 3), 1)));
- Table.States (277).Action_List.Set_Capacity (1);
- Add_Action (Table.States (277), (1 => 78), (156, 2), 1, null,
null);
- Table.States (277).Kernel := To_Vector ((0 => ((156, 2), 276, 0,
(156, 2), 1)));
- Table.States (277).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (156, 2), 1)));
- Table.States (278).Action_List.Set_Capacity (2);
- Add_Action (Table.States (278), (82, 90), (168, 2), 1, null,
null);
- Table.States (278).Kernel := To_Vector ((0 => ((168, 2), 280, 0,
(168, 2), 1)));
- Table.States (278).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (168, 2), 1)));
- Table.States (279).Action_List.Set_Capacity (20);
- Add_Action (Table.States (279), 10, Reduce, (290, 3), 1, null,
null);
- Add_Action (Table.States (279), 33, (290, 1), 291);
- Add_Action (Table.States (279), 35, Reduce, (290, 3), 1, null,
null);
- Add_Action (Table.States (279), 40, (290, 0), 292);
- Add_Action (Table.States (279), 43, Reduce, (290, 3), 1, null,
null);
- Add_Action (Table.States (279), 74, Reduce, (290, 3), 1, null,
null);
- Add_Action (Table.States (279), 75, Reduce, (290, 3), 1, null,
null);
- Add_Action (Table.States (279), 78, Reduce, (290, 3), 1, null,
null);
- Add_Action (Table.States (279), 79, Reduce, (290, 3), 1, null,
null);
- Add_Action (Table.States (279), 82, Reduce, (290, 3), 1, null,
null);
- Add_Action (Table.States (279), 86, Reduce, (290, 3), 1, null,
null);
- Add_Action (Table.States (279), 88, (280, 2), 455);
- Add_Action (Table.States (279), 89, (291, 0), 293);
- Add_Action (Table.States (279), 90, Reduce, (290, 3), 1, null,
null);
- Add_Action (Table.States (279), 91, (291, 4), 294);
- Add_Action (Table.States (279), 92, (291, 5), 295);
- Add_Action (Table.States (279), 94, (291, 2), 296);
- Add_Action (Table.States (279), 95, (291, 3), 297);
- Add_Action (Table.States (279), 99, Reduce, (290, 3), 1, null,
null);
- Add_Action (Table.States (279), 101, (291, 1), 298);
- Table.States (279).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (279), 291, 299);
- Table.States (279).Kernel := To_Vector ((((280, 2), 304, 2,
(2147483647, 0), 0), ((290, 0), 304, 3,
- (2147483647, 0), 0), ((290, 1), 304, 2, (2147483647, 0), 0),
((290, 2), 304, 2, (2147483647, 0), 0),
- ((290, 3), 304, 0, (290, 3), 1)));
- Table.States (279).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (290, 3), 1)));
- Table.States (280).Action_List.Set_Capacity (1);
- Add_Action (Table.States (280), 74, (120, 5), 456);
- Table.States (280).Kernel := To_Vector ((0 => ((120, 5), 194, 3,
(2147483647, 0), 0)));
- Table.States (280).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (120, 5), 74, 456)));
- Table.States (281).Action_List.Set_Capacity (1);
- Add_Action (Table.States (281), 72, (143, 0), 457);
- Table.States (281).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (281), 143, 458);
- Add_Goto (Table.States (281), 144, 459);
- Table.States (281).Kernel := To_Vector ((0 => ((142, 0), 35, 5,
(2147483647, 0), 0)));
- Table.States (281).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (143, 0), 72, 457)));
- Table.States (282).Action_List.Set_Capacity (9);
- Add_Action (Table.States (282), 39, (261, 4), 123);
- Add_Action (Table.States (282), 41, (261, 1), 125);
- Add_Action (Table.States (282), 76, (120, 0), 127);
- Add_Action (Table.States (282), 77, (120, 5), 128);
- Add_Action (Table.States (282), 81, (242, 8), 31);
- Add_Action (Table.States (282), 106, (261, 0), 131);
- Add_Action (Table.States (282), 107, (242, 5), 120);
- Add_Action (Table.States (282), 108, (242, 7), 34);
- Add_Action (Table.States (282), 109, (242, 6), 35);
- Table.States (282).Goto_List.Set_Capacity (6);
- Add_Goto (Table.States (282), 120, 132);
- Add_Goto (Table.States (282), 131, 42);
- Add_Goto (Table.States (282), 242, 136);
- Add_Goto (Table.States (282), 261, 460);
- Add_Goto (Table.States (282), 275, 93);
- Add_Goto (Table.States (282), 296, 98);
- Table.States (282).Kernel := To_Vector ((0 => ((200, 0), 103, 1,
(2147483647, 0), 0)));
- Table.States (282).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (283).Action_List.Set_Capacity (14);
- Add_Action (Table.States (283), 3, (200, 2), 122);
- Add_Action (Table.States (283), 39, (261, 4), 123);
- Add_Action (Table.States (283), 40, (200, 3), 124);
- Add_Action (Table.States (283), 41, (261, 1), 125);
- Add_Action (Table.States (283), 52, (278, 0), 126);
- Add_Action (Table.States (283), 76, (120, 0), 127);
- Add_Action (Table.States (283), 77, (120, 5), 128);
- Add_Action (Table.States (283), 81, (242, 8), 31);
- Add_Action (Table.States (283), 97, (333, 1), 129);
- Add_Action (Table.States (283), 98, (333, 0), 130);
- Add_Action (Table.States (283), 106, (261, 0), 131);
- Add_Action (Table.States (283), 107, (242, 5), 120);
- Add_Action (Table.States (283), 108, (242, 7), 34);
- Add_Action (Table.States (283), 109, (242, 6), 35);
- Table.States (283).Goto_List.Set_Capacity (13);
- Add_Goto (Table.States (283), 120, 132);
- Add_Goto (Table.States (283), 131, 42);
- Add_Goto (Table.States (283), 200, 135);
- Add_Goto (Table.States (283), 242, 136);
- Add_Goto (Table.States (283), 261, 137);
- Add_Goto (Table.States (283), 275, 93);
- Add_Goto (Table.States (283), 278, 138);
- Add_Goto (Table.States (283), 290, 461);
- Add_Goto (Table.States (283), 296, 98);
- Add_Goto (Table.States (283), 304, 145);
- Add_Goto (Table.States (283), 323, 146);
- Add_Goto (Table.States (283), 324, 147);
- Add_Goto (Table.States (283), 333, 148);
- Table.States (283).Kernel := To_Vector ((0 => ((285, 0), 10, 1,
(2147483647, 0), 0)));
- Table.States (283).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (284).Action_List.Set_Capacity (1);
- Add_Action (Table.States (284), 68, (286, 0), 462);
- Table.States (284).Kernel := To_Vector ((0 => ((286, 0), 10, 2,
(2147483647, 0), 0)));
- Table.States (284).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (286, 0), 68, 462)));
- Table.States (285).Action_List.Set_Capacity (14);
- Add_Action (Table.States (285), 3, (200, 2), 122);
- Add_Action (Table.States (285), 39, (261, 4), 123);
- Add_Action (Table.States (285), 40, (200, 3), 124);
- Add_Action (Table.States (285), 41, (261, 1), 125);
- Add_Action (Table.States (285), 52, (278, 0), 126);
- Add_Action (Table.States (285), 76, (120, 0), 127);
- Add_Action (Table.States (285), 77, (120, 5), 128);
- Add_Action (Table.States (285), 81, (242, 8), 31);
- Add_Action (Table.States (285), 97, (333, 1), 129);
- Add_Action (Table.States (285), 98, (333, 0), 130);
- Add_Action (Table.States (285), 106, (261, 0), 131);
- Add_Action (Table.States (285), 107, (242, 5), 120);
- Add_Action (Table.States (285), 108, (242, 7), 34);
- Add_Action (Table.States (285), 109, (242, 6), 35);
- Table.States (285).Goto_List.Set_Capacity (13);
- Add_Goto (Table.States (285), 120, 132);
- Add_Goto (Table.States (285), 131, 42);
- Add_Goto (Table.States (285), 200, 135);
- Add_Goto (Table.States (285), 242, 136);
- Add_Goto (Table.States (285), 261, 137);
- Add_Goto (Table.States (285), 275, 93);
- Add_Goto (Table.States (285), 278, 138);
- Add_Goto (Table.States (285), 290, 463);
- Add_Goto (Table.States (285), 296, 98);
- Add_Goto (Table.States (285), 304, 145);
- Add_Goto (Table.States (285), 323, 146);
- Add_Goto (Table.States (285), 324, 147);
- Add_Goto (Table.States (285), 333, 148);
- Table.States (285).Kernel := To_Vector ((0 => ((287, 0), 43, 1,
(2147483647, 0), 0)));
- Table.States (285).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (286).Action_List.Set_Capacity (1);
- Add_Action (Table.States (286), 22, (288, 0), 464);
- Table.States (286).Kernel := To_Vector ((0 => ((288, 0), 43, 2,
(2147483647, 0), 0)));
- Table.States (286).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (288, 0), 22, 464)));
- Table.States (287).Action_List.Set_Capacity (14);
- Add_Action (Table.States (287), 3, (200, 2), 122);
- Add_Action (Table.States (287), 39, (261, 4), 123);
- Add_Action (Table.States (287), 40, (200, 3), 124);
- Add_Action (Table.States (287), 41, (261, 1), 125);
- Add_Action (Table.States (287), 52, (278, 0), 126);
- Add_Action (Table.States (287), 76, (120, 0), 127);
- Add_Action (Table.States (287), 77, (120, 5), 128);
- Add_Action (Table.States (287), 81, (242, 8), 31);
- Add_Action (Table.States (287), 97, (333, 1), 129);
- Add_Action (Table.States (287), 98, (333, 0), 130);
- Add_Action (Table.States (287), 106, (261, 0), 131);
- Add_Action (Table.States (287), 107, (242, 5), 120);
- Add_Action (Table.States (287), 108, (242, 7), 34);
- Add_Action (Table.States (287), 109, (242, 6), 35);
- Table.States (287).Goto_List.Set_Capacity (13);
- Add_Goto (Table.States (287), 120, 132);
- Add_Goto (Table.States (287), 131, 42);
- Add_Goto (Table.States (287), 200, 135);
- Add_Goto (Table.States (287), 242, 136);
- Add_Goto (Table.States (287), 261, 137);
- Add_Goto (Table.States (287), 275, 93);
- Add_Goto (Table.States (287), 278, 138);
- Add_Goto (Table.States (287), 290, 465);
- Add_Goto (Table.States (287), 296, 98);
- Add_Goto (Table.States (287), 304, 145);
- Add_Goto (Table.States (287), 323, 146);
- Add_Goto (Table.States (287), 324, 147);
- Add_Goto (Table.States (287), 333, 148);
- Table.States (287).Kernel := To_Vector ((0 => ((289, 0), 75, 1,
(2147483647, 0), 0)));
- Table.States (287).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (288).Action_List.Set_Capacity (15);
- Add_Action (Table.States (288), 3, (200, 2), 122);
- Add_Action (Table.States (288), 39, (261, 4), 123);
- Add_Action (Table.States (288), 40, (200, 3), 124);
- Add_Action (Table.States (288), 41, (261, 1), 125);
- Add_Action (Table.States (288), 52, (278, 0), 126);
- Add_Action (Table.States (288), 68, (286, 1), 466);
- Add_Action (Table.States (288), 76, (120, 0), 127);
- Add_Action (Table.States (288), 77, (120, 5), 128);
- Add_Action (Table.States (288), 81, (242, 8), 31);
- Add_Action (Table.States (288), 97, (333, 1), 129);
- Add_Action (Table.States (288), 98, (333, 0), 130);
- Add_Action (Table.States (288), 106, (261, 0), 131);
- Add_Action (Table.States (288), 107, (242, 5), 120);
- Add_Action (Table.States (288), 108, (242, 7), 34);
- Add_Action (Table.States (288), 109, (242, 6), 35);
- Table.States (288).Goto_List.Set_Capacity (13);
- Add_Goto (Table.States (288), 120, 132);
- Add_Goto (Table.States (288), 131, 42);
- Add_Goto (Table.States (288), 200, 135);
- Add_Goto (Table.States (288), 242, 136);
- Add_Goto (Table.States (288), 261, 137);
- Add_Goto (Table.States (288), 275, 93);
- Add_Goto (Table.States (288), 278, 138);
- Add_Goto (Table.States (288), 290, 467);
- Add_Goto (Table.States (288), 296, 98);
- Add_Goto (Table.States (288), 304, 145);
- Add_Goto (Table.States (288), 323, 146);
- Add_Goto (Table.States (288), 324, 147);
- Add_Goto (Table.States (288), 333, 148);
- Table.States (288).Kernel := To_Vector ((((285, 1), 10, 1,
(2147483647, 0), 0), ((286, 1), 10, 2,
- (2147483647, 0), 0)));
- Table.States (289).Action_List.Set_Capacity (15);
- Add_Action (Table.States (289), 3, (200, 2), 122);
- Add_Action (Table.States (289), 22, (288, 1), 468);
- Add_Action (Table.States (289), 39, (261, 4), 123);
- Add_Action (Table.States (289), 40, (200, 3), 124);
- Add_Action (Table.States (289), 41, (261, 1), 125);
- Add_Action (Table.States (289), 52, (278, 0), 126);
- Add_Action (Table.States (289), 76, (120, 0), 127);
- Add_Action (Table.States (289), 77, (120, 5), 128);
- Add_Action (Table.States (289), 81, (242, 8), 31);
- Add_Action (Table.States (289), 97, (333, 1), 129);
- Add_Action (Table.States (289), 98, (333, 0), 130);
- Add_Action (Table.States (289), 106, (261, 0), 131);
- Add_Action (Table.States (289), 107, (242, 5), 120);
- Add_Action (Table.States (289), 108, (242, 7), 34);
- Add_Action (Table.States (289), 109, (242, 6), 35);
- Table.States (289).Goto_List.Set_Capacity (13);
- Add_Goto (Table.States (289), 120, 132);
- Add_Goto (Table.States (289), 131, 42);
- Add_Goto (Table.States (289), 200, 135);
- Add_Goto (Table.States (289), 242, 136);
- Add_Goto (Table.States (289), 261, 137);
- Add_Goto (Table.States (289), 275, 93);
- Add_Goto (Table.States (289), 278, 138);
- Add_Goto (Table.States (289), 290, 469);
- Add_Goto (Table.States (289), 296, 98);
- Add_Goto (Table.States (289), 304, 145);
- Add_Goto (Table.States (289), 323, 146);
- Add_Goto (Table.States (289), 324, 147);
- Add_Goto (Table.States (289), 333, 148);
- Table.States (289).Kernel := To_Vector ((((287, 1), 43, 1,
(2147483647, 0), 0), ((288, 1), 43, 2,
- (2147483647, 0), 0)));
- Table.States (290).Action_List.Set_Capacity (14);
- Add_Action (Table.States (290), 3, (200, 2), 122);
- Add_Action (Table.States (290), 39, (261, 4), 123);
- Add_Action (Table.States (290), 40, (200, 3), 124);
- Add_Action (Table.States (290), 41, (261, 1), 125);
- Add_Action (Table.States (290), 52, (278, 0), 126);
- Add_Action (Table.States (290), 76, (120, 0), 127);
- Add_Action (Table.States (290), 77, (120, 5), 128);
- Add_Action (Table.States (290), 81, (242, 8), 31);
- Add_Action (Table.States (290), 97, (333, 1), 129);
- Add_Action (Table.States (290), 98, (333, 0), 130);
- Add_Action (Table.States (290), 106, (261, 0), 131);
- Add_Action (Table.States (290), 107, (242, 5), 120);
- Add_Action (Table.States (290), 108, (242, 7), 34);
- Add_Action (Table.States (290), 109, (242, 6), 35);
- Table.States (290).Goto_List.Set_Capacity (13);
- Add_Goto (Table.States (290), 120, 132);
- Add_Goto (Table.States (290), 131, 42);
- Add_Goto (Table.States (290), 200, 135);
- Add_Goto (Table.States (290), 242, 136);
- Add_Goto (Table.States (290), 261, 137);
- Add_Goto (Table.States (290), 275, 93);
- Add_Goto (Table.States (290), 278, 138);
- Add_Goto (Table.States (290), 290, 470);
- Add_Goto (Table.States (290), 296, 98);
- Add_Goto (Table.States (290), 304, 145);
- Add_Goto (Table.States (290), 323, 146);
- Add_Goto (Table.States (290), 324, 147);
- Add_Goto (Table.States (290), 333, 148);
- Table.States (290).Kernel := To_Vector ((0 => ((289, 1), 75, 1,
(2147483647, 0), 0)));
- Table.States (290).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (291).Action_List.Set_Capacity (13);
- Add_Action (Table.States (291), 3, (200, 2), 122);
- Add_Action (Table.States (291), 39, (261, 4), 123);
- Add_Action (Table.States (291), 40, (200, 3), 124);
- Add_Action (Table.States (291), 41, (261, 1), 125);
- Add_Action (Table.States (291), 76, (120, 0), 127);
- Add_Action (Table.States (291), 77, (120, 5), 128);
- Add_Action (Table.States (291), 81, (242, 8), 31);
- Add_Action (Table.States (291), 97, (333, 1), 129);
- Add_Action (Table.States (291), 98, (333, 0), 130);
- Add_Action (Table.States (291), 106, (261, 0), 131);
- Add_Action (Table.States (291), 107, (242, 5), 120);
- Add_Action (Table.States (291), 108, (242, 7), 34);
- Add_Action (Table.States (291), 109, (242, 6), 35);
- Table.States (291).Goto_List.Set_Capacity (14);
- Add_Goto (Table.States (291), 120, 132);
- Add_Goto (Table.States (291), 131, 42);
- Add_Goto (Table.States (291), 200, 135);
- Add_Goto (Table.States (291), 236, 471);
- Add_Goto (Table.States (291), 237, 472);
- Add_Goto (Table.States (291), 242, 276);
- Add_Goto (Table.States (291), 261, 137);
- Add_Goto (Table.States (291), 275, 93);
- Add_Goto (Table.States (291), 280, 473);
- Add_Goto (Table.States (291), 296, 98);
- Add_Goto (Table.States (291), 304, 474);
- Add_Goto (Table.States (291), 323, 146);
- Add_Goto (Table.States (291), 324, 147);
- Add_Goto (Table.States (291), 333, 148);
- Table.States (291).Kernel := To_Vector ((0 => ((290, 1), 33, 1,
(2147483647, 0), 0)));
- Table.States (291).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (292).Action_List.Set_Capacity (1);
- Add_Action (Table.States (292), 33, (290, 0), 475);
- Table.States (292).Kernel := To_Vector ((0 => ((290, 0), 40, 2,
(2147483647, 0), 0)));
- Table.States (292).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (290, 0), 33, 475)));
- Table.States (293).Action_List.Set_Capacity (13);
- Add_Action (Table.States (293), (3, 39, 40, 41, 76, 77, 81, 97,
98, 106, 107, 108, 109), (291, 0), 1,
- null, null);
- Table.States (293).Kernel := To_Vector ((0 => ((291, 0), 89, 0,
(291, 0), 1)));
- Table.States (293).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (291, 0), 1)));
- Table.States (294).Action_List.Set_Capacity (13);
- Add_Action (Table.States (294), (3, 39, 40, 41, 76, 77, 81, 97,
98, 106, 107, 108, 109), (291, 4), 1,
- null, null);
- Table.States (294).Kernel := To_Vector ((0 => ((291, 4), 91, 0,
(291, 4), 1)));
- Table.States (294).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (291, 4), 1)));
- Table.States (295).Action_List.Set_Capacity (13);
- Add_Action (Table.States (295), (3, 39, 40, 41, 76, 77, 81, 97,
98, 106, 107, 108, 109), (291, 5), 1,
- null, null);
- Table.States (295).Kernel := To_Vector ((0 => ((291, 5), 92, 0,
(291, 5), 1)));
- Table.States (295).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (291, 5), 1)));
- Table.States (296).Action_List.Set_Capacity (13);
- Add_Action (Table.States (296), (3, 39, 40, 41, 76, 77, 81, 97,
98, 106, 107, 108, 109), (291, 2), 1,
- null, null);
- Table.States (296).Kernel := To_Vector ((0 => ((291, 2), 94, 0,
(291, 2), 1)));
- Table.States (296).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (291, 2), 1)));
- Table.States (297).Action_List.Set_Capacity (13);
- Add_Action (Table.States (297), (3, 39, 40, 41, 76, 77, 81, 97,
98, 106, 107, 108, 109), (291, 3), 1,
- null, null);
- Table.States (297).Kernel := To_Vector ((0 => ((291, 3), 95, 0,
(291, 3), 1)));
- Table.States (297).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (291, 3), 1)));
- Table.States (298).Action_List.Set_Capacity (13);
- Add_Action (Table.States (298), (3, 39, 40, 41, 76, 77, 81, 97,
98, 106, 107, 108, 109), (291, 1), 1,
- null, null);
- Table.States (298).Kernel := To_Vector ((0 => ((291, 1), 101, 0,
(291, 1), 1)));
- Table.States (298).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (291, 1), 1)));
- Table.States (299).Action_List.Set_Capacity (13);
- Add_Action (Table.States (299), 3, (200, 2), 122);
- Add_Action (Table.States (299), 39, (261, 4), 123);
- Add_Action (Table.States (299), 40, (200, 3), 124);
- Add_Action (Table.States (299), 41, (261, 1), 125);
- Add_Action (Table.States (299), 76, (120, 0), 127);
- Add_Action (Table.States (299), 77, (120, 5), 128);
- Add_Action (Table.States (299), 81, (242, 8), 31);
- Add_Action (Table.States (299), 97, (333, 1), 129);
- Add_Action (Table.States (299), 98, (333, 0), 130);
- Add_Action (Table.States (299), 106, (261, 0), 131);
- Add_Action (Table.States (299), 107, (242, 5), 120);
- Add_Action (Table.States (299), 108, (242, 7), 34);
- Add_Action (Table.States (299), 109, (242, 6), 35);
- Table.States (299).Goto_List.Set_Capacity (11);
- Add_Goto (Table.States (299), 120, 132);
- Add_Goto (Table.States (299), 131, 42);
- Add_Goto (Table.States (299), 200, 135);
- Add_Goto (Table.States (299), 242, 136);
- Add_Goto (Table.States (299), 261, 137);
- Add_Goto (Table.States (299), 275, 93);
- Add_Goto (Table.States (299), 296, 98);
- Add_Goto (Table.States (299), 304, 476);
- Add_Goto (Table.States (299), 323, 146);
- Add_Goto (Table.States (299), 324, 147);
- Add_Goto (Table.States (299), 333, 148);
- Table.States (299).Kernel := To_Vector ((0 => ((290, 2), 291, 1,
(2147483647, 0), 0)));
- Table.States (299).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (300).Action_List.Set_Capacity (11);
- Add_Action (Table.States (300), (3, 39, 40, 41, 76, 77, 81, 106,
107, 108, 109), (240, 2), 1, null, null);
- Table.States (300).Kernel := To_Vector ((0 => ((240, 2), 38, 0,
(240, 2), 1)));
- Table.States (300).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (240, 2), 1)));
- Table.States (301).Action_List.Set_Capacity (11);
- Add_Action (Table.States (301), (3, 39, 40, 41, 76, 77, 81, 106,
107, 108, 109), (240, 3), 1, null, null);
- Table.States (301).Kernel := To_Vector ((0 => ((240, 3), 55, 0,
(240, 3), 1)));
- Table.States (301).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (240, 3), 1)));
- Table.States (302).Action_List.Set_Capacity (11);
- Add_Action (Table.States (302), (3, 39, 40, 41, 76, 77, 81, 106,
107, 108, 109), (240, 1), 1, null, null);
- Table.States (302).Kernel := To_Vector ((0 => ((240, 1), 100, 0,
(240, 1), 1)));
- Table.States (302).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (240, 1), 1)));
- Table.States (303).Action_List.Set_Capacity (11);
- Add_Action (Table.States (303), (3, 39, 40, 41, 76, 77, 81, 106,
107, 108, 109), (240, 0), 1, null, null);
- Table.States (303).Kernel := To_Vector ((0 => ((240, 0), 102, 0,
(240, 0), 1)));
- Table.States (303).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (240, 0), 1)));
- Table.States (304).Action_List.Set_Capacity (11);
- Add_Action (Table.States (304), 3, (200, 2), 122);
- Add_Action (Table.States (304), 39, (261, 4), 123);
- Add_Action (Table.States (304), 40, (200, 3), 124);
- Add_Action (Table.States (304), 41, (261, 1), 125);
- Add_Action (Table.States (304), 76, (120, 0), 127);
- Add_Action (Table.States (304), 77, (120, 5), 128);
- Add_Action (Table.States (304), 81, (242, 8), 31);
- Add_Action (Table.States (304), 106, (261, 0), 131);
- Add_Action (Table.States (304), 107, (242, 5), 120);
- Add_Action (Table.States (304), 108, (242, 7), 34);
- Add_Action (Table.States (304), 109, (242, 6), 35);
- Table.States (304).Goto_List.Set_Capacity (7);
- Add_Goto (Table.States (304), 120, 132);
- Add_Goto (Table.States (304), 131, 42);
- Add_Goto (Table.States (304), 200, 477);
- Add_Goto (Table.States (304), 242, 136);
- Add_Goto (Table.States (304), 261, 137);
- Add_Goto (Table.States (304), 275, 93);
- Add_Goto (Table.States (304), 296, 98);
- Table.States (304).Kernel := To_Vector ((0 => ((323, 0), 240, 1,
(2147483647, 0), 0)));
- Table.States (304).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (305).Action_List.Set_Capacity (11);
- Add_Action (Table.States (305), (3, 39, 40, 41, 76, 77, 81, 106,
107, 108, 109), (133, 2), 1, null, null);
- Table.States (305).Kernel := To_Vector ((0 => ((133, 2), 80, 0,
(133, 2), 1)));
- Table.States (305).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (133, 2), 1)));
- Table.States (306).Action_List.Set_Capacity (11);
- Add_Action (Table.States (306), (3, 39, 40, 41, 76, 77, 81, 106,
107, 108, 109), (133, 1), 1, null, null);
- Table.States (306).Kernel := To_Vector ((0 => ((133, 1), 97, 0,
(133, 1), 1)));
- Table.States (306).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (133, 1), 1)));
- Table.States (307).Action_List.Set_Capacity (11);
- Add_Action (Table.States (307), (3, 39, 40, 41, 76, 77, 81, 106,
107, 108, 109), (133, 0), 1, null, null);
- Table.States (307).Kernel := To_Vector ((0 => ((133, 0), 98, 0,
(133, 0), 1)));
- Table.States (307).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (133, 0), 1)));
- Table.States (308).Action_List.Set_Capacity (11);
- Add_Action (Table.States (308), 3, (200, 2), 122);
- Add_Action (Table.States (308), 39, (261, 4), 123);
- Add_Action (Table.States (308), 40, (200, 3), 124);
- Add_Action (Table.States (308), 41, (261, 1), 125);
- Add_Action (Table.States (308), 76, (120, 0), 127);
- Add_Action (Table.States (308), 77, (120, 5), 128);
- Add_Action (Table.States (308), 81, (242, 8), 31);
- Add_Action (Table.States (308), 106, (261, 0), 131);
- Add_Action (Table.States (308), 107, (242, 5), 120);
- Add_Action (Table.States (308), 108, (242, 7), 34);
- Add_Action (Table.States (308), 109, (242, 6), 35);
- Table.States (308).Goto_List.Set_Capacity (8);
- Add_Goto (Table.States (308), 120, 132);
- Add_Goto (Table.States (308), 131, 42);
- Add_Goto (Table.States (308), 200, 135);
- Add_Goto (Table.States (308), 242, 136);
- Add_Goto (Table.States (308), 261, 137);
- Add_Goto (Table.States (308), 275, 93);
- Add_Goto (Table.States (308), 296, 98);
- Add_Goto (Table.States (308), 323, 478);
- Table.States (308).Kernel := To_Vector ((0 => ((324, 0), 133, 1,
(2147483647, 0), 0)));
- Table.States (308).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (309).Action_List.Set_Capacity (32);
- Add_Action (Table.States (309), 10, Reduce, (304, 0), 2, null,
null);
- Add_Action (Table.States (309), 20, Reduce, (304, 0), 2, null,
null);
- Add_Action (Table.States (309), 21, Reduce, (304, 0), 2, null,
null);
- Add_Action (Table.States (309), 22, Reduce, (304, 0), 2, null,
null);
- Add_Action (Table.States (309), 23, Reduce, (304, 0), 2, null,
null);
- Add_Action (Table.States (309), 33, Reduce, (304, 0), 2, null,
null);
- Add_Action (Table.States (309), 35, Reduce, (304, 0), 2, null,
null);
- Add_Action (Table.States (309), 37, Reduce, (304, 0), 2, null,
null);
- Add_Action (Table.States (309), 40, Reduce, (304, 0), 2, null,
null);
- Add_Action (Table.States (309), 42, Reduce, (304, 0), 2, null,
null);
- Add_Action (Table.States (309), 43, Reduce, (304, 0), 2, null,
null);
- Add_Action (Table.States (309), 53, Reduce, (304, 0), 2, null,
null);
- Add_Action (Table.States (309), 68, Reduce, (304, 0), 2, null,
null);
- Add_Action (Table.States (309), 74, Reduce, (304, 0), 2, null,
null);
- Add_Action (Table.States (309), 75, Reduce, (304, 0), 2, null,
null);
- Add_Action (Table.States (309), 78, Reduce, (304, 0), 2, null,
null);
- Add_Action (Table.States (309), 79, Reduce, (304, 0), 2, null,
null);
- Add_Action (Table.States (309), 80, (133, 2), 305);
- Add_Action (Table.States (309), 82, Reduce, (304, 0), 2, null,
null);
- Add_Action (Table.States (309), 85, Reduce, (304, 0), 2, null,
null);
- Add_Action (Table.States (309), 86, Reduce, (304, 0), 2, null,
null);
- Add_Action (Table.States (309), 88, Reduce, (304, 0), 2, null,
null);
- Add_Action (Table.States (309), 89, Reduce, (304, 0), 2, null,
null);
- Add_Action (Table.States (309), 90, Reduce, (304, 0), 2, null,
null);
- Add_Action (Table.States (309), 91, Reduce, (304, 0), 2, null,
null);
- Add_Action (Table.States (309), 92, Reduce, (304, 0), 2, null,
null);
- Add_Action (Table.States (309), 94, Reduce, (304, 0), 2, null,
null);
- Add_Action (Table.States (309), 95, Reduce, (304, 0), 2, null,
null);
- Add_Action (Table.States (309), 97, (133, 1), 306);
- Add_Action (Table.States (309), 98, (133, 0), 307);
- Add_Action (Table.States (309), 99, Reduce, (304, 0), 2, null,
null);
- Add_Action (Table.States (309), 101, Reduce, (304, 0), 2, null,
null);
- Table.States (309).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (309), 133, 308);
- Table.States (309).Kernel := To_Vector ((((304, 0), 324, 0,
(304, 0), 2), ((324, 0), 324, 2,
- (2147483647, 0), 0)));
- Table.States (309).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (304, 0), 2)));
- Table.States (310).Action_List.Set_Capacity (1);
- Add_Action (Table.States (310), 99, (164, 0), 479);
- Table.States (310).Kernel := To_Vector ((0 => ((164, 0), 195, 1,
(2147483647, 0), 0)));
- Table.States (310).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (164, 0), 99, 479)));
- Table.States (311).Action_List.Set_Capacity (47);
- Add_Action (Table.States (311), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (164, 1), 3, delay_statement_1'Access, null);
- Table.States (311).Kernel := To_Vector ((0 => ((164, 1), 99, 0,
(164, 1), 3)));
- Table.States (311).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (164, 1), 3)));
- Table.States (312).Action_List.Set_Capacity (15);
- Add_Action (Table.States (312), 3, (200, 2), 122);
- Add_Action (Table.States (312), 39, (261, 4), 123);
- Add_Action (Table.States (312), 40, (200, 3), 124);
- Add_Action (Table.States (312), 41, (261, 1), 125);
- Add_Action (Table.States (312), 52, (278, 0), 126);
- Add_Action (Table.States (312), 76, (120, 0), 127);
- Add_Action (Table.States (312), 77, (120, 5), 128);
- Add_Action (Table.States (312), 81, (242, 8), 31);
- Add_Action (Table.States (312), 97, (333, 1), 129);
- Add_Action (Table.States (312), 98, (333, 0), 130);
- Add_Action (Table.States (312), 99, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (312), 106, (261, 0), 131);
- Add_Action (Table.States (312), 107, (242, 5), 120);
- Add_Action (Table.States (312), 108, (242, 7), 34);
- Add_Action (Table.States (312), 109, (242, 6), 35);
- Table.States (312).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (312), 120, 132);
- Add_Goto (Table.States (312), 131, 42);
- Add_Goto (Table.States (312), 194, 133);
- Add_Goto (Table.States (312), 195, 480);
- Add_Goto (Table.States (312), 200, 135);
- Add_Goto (Table.States (312), 242, 136);
- Add_Goto (Table.States (312), 261, 137);
- Add_Goto (Table.States (312), 275, 93);
- Add_Goto (Table.States (312), 278, 138);
- Add_Goto (Table.States (312), 285, 139);
- Add_Goto (Table.States (312), 286, 140);
- Add_Goto (Table.States (312), 287, 141);
- Add_Goto (Table.States (312), 288, 142);
- Add_Goto (Table.States (312), 289, 143);
- Add_Goto (Table.States (312), 290, 144);
- Add_Goto (Table.States (312), 296, 98);
- Add_Goto (Table.States (312), 304, 145);
- Add_Goto (Table.States (312), 323, 146);
- Add_Goto (Table.States (312), 324, 147);
- Add_Goto (Table.States (312), 333, 148);
- Table.States (312).Kernel := To_Vector ((0 => ((193, 0), 72, 1,
(2147483647, 0), 0)));
- Table.States (312).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (313).Action_List.Set_Capacity (47);
- Add_Action (Table.States (313), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (193, 1), 3, exit_statement_1'Access, null);
- Table.States (313).Kernel := To_Vector ((0 => ((193, 1), 99, 0,
(193, 1), 3)));
- Table.States (313).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (193, 1), 3)));
- Table.States (314).Action_List.Set_Capacity (14);
- Add_Action (Table.States (314), 3, (200, 2), 122);
- Add_Action (Table.States (314), 39, (261, 4), 123);
- Add_Action (Table.States (314), 40, (200, 3), 481);
- Add_Action (Table.States (314), 41, (261, 1), 125);
- Add_Action (Table.States (314), 59, (233, 2), 482);
- Add_Action (Table.States (314), 76, (120, 0), 127);
- Add_Action (Table.States (314), 77, (120, 5), 128);
- Add_Action (Table.States (314), 81, (242, 8), 31);
- Add_Action (Table.States (314), 97, (333, 1), 129);
- Add_Action (Table.States (314), 98, (333, 0), 130);
- Add_Action (Table.States (314), 106, (261, 0), 131);
- Add_Action (Table.States (314), 107, (242, 5), 120);
- Add_Action (Table.States (314), 108, (242, 7), 34);
- Add_Action (Table.States (314), 109, (242, 6), 35);
- Table.States (314).Goto_List.Set_Capacity (14);
- Add_Goto (Table.States (314), 120, 132);
- Add_Goto (Table.States (314), 131, 42);
- Add_Goto (Table.States (314), 170, 483);
- Add_Goto (Table.States (314), 200, 135);
- Add_Goto (Table.States (314), 242, 484);
- Add_Goto (Table.States (314), 261, 137);
- Add_Goto (Table.States (314), 275, 93);
- Add_Goto (Table.States (314), 280, 485);
- Add_Goto (Table.States (314), 296, 98);
- Add_Goto (Table.States (314), 304, 486);
- Add_Goto (Table.States (314), 317, 487);
- Add_Goto (Table.States (314), 323, 146);
- Add_Goto (Table.States (314), 324, 147);
- Add_Goto (Table.States (314), 333, 148);
- Table.States (314).Kernel := To_Vector ((((233, 2), 33, 2,
(2147483647, 0), 0), ((233, 5), 33, 1,
- (2147483647, 0), 0)));
- Table.States (314).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- end Subr_6;
- procedure Subr_7
- is begin
- Table.States (315).Action_List.Set_Capacity (5);
- Add_Action (Table.States (315), 59, (233, 3), 488);
- Add_Action (Table.States (315), 81, (242, 8), 31);
- Add_Action (Table.States (315), 107, (242, 5), 120);
- Add_Action (Table.States (315), 108, (242, 7), 34);
- Add_Action (Table.States (315), 109, (242, 6), 35);
- Table.States (315).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (315), 131, 42);
- Add_Goto (Table.States (315), 242, 489);
- Add_Goto (Table.States (315), 275, 93);
- Add_Goto (Table.States (315), 296, 98);
- Table.States (315).Kernel := To_Vector ((((233, 3), 42, 2,
(2147483647, 0), 0), ((233, 4), 42, 1,
- (2147483647, 0), 0)));
- Table.States (315).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (316).Action_List.Set_Capacity (5);
- Add_Action (Table.States (316), 40, (317, 0), 490);
- Add_Action (Table.States (316), 81, (242, 8), 31);
- Add_Action (Table.States (316), 107, (242, 5), 120);
- Add_Action (Table.States (316), 108, (242, 7), 34);
- Add_Action (Table.States (316), 109, (242, 6), 35);
- Table.States (316).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (316), 131, 42);
- Add_Goto (Table.States (316), 242, 491);
- Add_Goto (Table.States (316), 275, 93);
- Add_Goto (Table.States (316), 296, 98);
- Add_Goto (Table.States (316), 317, 492);
- Table.States (316).Kernel := To_Vector ((((233, 0), 84, 4,
(2147483647, 0), 0), ((233, 1), 84, 3,
- (2147483647, 0), 0)));
- Table.States (316).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (317).Action_List.Set_Capacity (15);
- Add_Action (Table.States (317), 3, (200, 2), 122);
- Add_Action (Table.States (317), 39, (261, 4), 123);
- Add_Action (Table.States (317), 40, (200, 3), 124);
- Add_Action (Table.States (317), 41, (261, 1), 125);
- Add_Action (Table.States (317), 52, (278, 0), 126);
- Add_Action (Table.States (317), 76, (120, 0), 127);
- Add_Action (Table.States (317), 77, (120, 5), 128);
- Add_Action (Table.States (317), 81, (242, 8), 31);
- Add_Action (Table.States (317), 97, (333, 1), 129);
- Add_Action (Table.States (317), 98, (333, 0), 130);
- Add_Action (Table.States (317), 99, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (317), 106, (261, 0), 131);
- Add_Action (Table.States (317), 107, (242, 5), 120);
- Add_Action (Table.States (317), 108, (242, 7), 34);
- Add_Action (Table.States (317), 109, (242, 6), 35);
- Table.States (317).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (317), 120, 132);
- Add_Goto (Table.States (317), 131, 42);
- Add_Goto (Table.States (317), 194, 133);
- Add_Goto (Table.States (317), 195, 493);
- Add_Goto (Table.States (317), 200, 135);
- Add_Goto (Table.States (317), 242, 136);
- Add_Goto (Table.States (317), 261, 137);
- Add_Goto (Table.States (317), 275, 93);
- Add_Goto (Table.States (317), 278, 138);
- Add_Goto (Table.States (317), 285, 139);
- Add_Goto (Table.States (317), 286, 140);
- Add_Goto (Table.States (317), 287, 141);
- Add_Goto (Table.States (317), 288, 142);
- Add_Goto (Table.States (317), 289, 143);
- Add_Goto (Table.States (317), 290, 144);
- Add_Goto (Table.States (317), 296, 98);
- Add_Goto (Table.States (317), 304, 145);
- Add_Goto (Table.States (317), 323, 146);
- Add_Goto (Table.States (317), 324, 147);
- Add_Goto (Table.States (317), 333, 148);
- Table.States (317).Kernel := To_Vector ((0 => ((124, 0), 71, 1,
(2147483647, 0), 0)));
- Table.States (317).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (318).Action_List.Set_Capacity (1);
- Add_Action (Table.States (318), 12, (130, 0), 494);
- Table.States (318).Kernel := To_Vector ((0 => ((130, 0), 71, 2,
(2147483647, 0), 0)));
- Table.States (318).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (130, 0), 12, 494)));
- Table.States (319).Action_List.Set_Capacity (3);
- Add_Action (Table.States (319), 54, (284, 0), 495);
- Add_Action (Table.States (319), 76, (120, 0), 127);
- Add_Action (Table.States (319), 77, (120, 5), 128);
- Table.States (319).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (319), 120, 496);
- Table.States (319).Kernel := To_Vector ((((185, 0), 71, 3,
(2147483647, 0), 0), ((284, 0), 71, 12,
- (2147483647, 0), 0)));
- Table.States (319).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (120, 0), 76, 127)));
- Table.States (320).Action_List.Set_Capacity (13);
- Add_Action (Table.States (320), 7, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (320), 21, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (320), 35, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (320), 40, (244, 0), 389);
- Add_Action (Table.States (320), 56, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (320), 74, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (320), 78, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (320), 81, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (320), 85, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (320), 99, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (320), 107, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (320), 108, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (320), 109, Reduce, (244, 1), 0, null,
null);
- Table.States (320).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (320), 117, 497);
- Add_Goto (Table.States (320), 244, 498);
- Table.States (320).Kernel := To_Vector ((((294, 0), 58, 0, (244,
1), 0), ((294, 1), 58, 2,
- (2147483647, 0), 0)));
- Table.States (320).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (244, 1), 0)));
- Table.States (321).Action_List.Set_Capacity (23);
- Add_Action (Table.States (321), 3, (200, 2), 122);
- Add_Action (Table.States (321), 15, (139, 0), 260);
- Add_Action (Table.States (321), 28, (127, 6), 261);
- Add_Action (Table.States (321), 32, (224, 0), 262);
- Add_Action (Table.States (321), 39, (261, 4), 123);
- Add_Action (Table.States (321), 40, (168, 1), 263);
- Add_Action (Table.States (321), 41, (261, 1), 125);
- Add_Action (Table.States (321), 44, (168, 3), 265);
- Add_Action (Table.States (321), 52, (278, 0), 126);
- Add_Action (Table.States (321), 76, (120, 0), 127);
- Add_Action (Table.States (321), 77, (120, 5), 128);
- Add_Action (Table.States (321), 78, Reduce, (127, 5), 0, null,
null);
- Add_Conflict (Table.States (321), 78, (257, 4), 0, null, null);
- Add_Action (Table.States (321), 81, (242, 8), 31);
- Add_Action (Table.States (321), 82, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (321), 86, Reduce, (127, 5), 0, null,
null);
- Add_Action (Table.States (321), 90, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (321), 97, (333, 1), 129);
- Add_Action (Table.States (321), 98, (333, 0), 130);
- Add_Action (Table.States (321), 99, Reduce, (257, 4), 0, null,
null);
- Add_Action (Table.States (321), 106, (261, 0), 131);
- Add_Action (Table.States (321), 107, (222, 1), 499);
- Add_Action (Table.States (321), 108, (242, 7), 34);
- Add_Action (Table.States (321), 109, (127, 0), 266);
- Table.States (321).Goto_List.Set_Capacity (32);
- Add_Goto (Table.States (321), 120, 132);
- Add_Goto (Table.States (321), 127, 267);
- Add_Goto (Table.States (321), 128, 409);
- Add_Goto (Table.States (321), 131, 42);
- Add_Goto (Table.States (321), 139, 269);
- Add_Goto (Table.States (321), 156, 410);
- Add_Goto (Table.States (321), 168, 271);
- Add_Goto (Table.States (321), 169, 272);
- Add_Goto (Table.States (321), 194, 411);
- Add_Goto (Table.States (321), 200, 135);
- Add_Goto (Table.States (321), 222, 500);
- Add_Goto (Table.States (321), 224, 275);
- Add_Goto (Table.States (321), 242, 276);
- Add_Goto (Table.States (321), 257, 501);
- Add_Goto (Table.States (321), 258, 502);
- Add_Goto (Table.States (321), 261, 137);
- Add_Goto (Table.States (321), 275, 93);
- Add_Goto (Table.States (321), 276, 277);
- Add_Goto (Table.States (321), 278, 138);
- Add_Goto (Table.States (321), 280, 412);
- Add_Goto (Table.States (321), 281, 413);
- Add_Goto (Table.States (321), 285, 139);
- Add_Goto (Table.States (321), 286, 140);
- Add_Goto (Table.States (321), 287, 141);
- Add_Goto (Table.States (321), 288, 142);
- Add_Goto (Table.States (321), 289, 143);
- Add_Goto (Table.States (321), 290, 144);
- Add_Goto (Table.States (321), 296, 98);
- Add_Goto (Table.States (321), 304, 279);
- Add_Goto (Table.States (321), 323, 146);
- Add_Goto (Table.States (321), 324, 147);
- Add_Goto (Table.States (321), 333, 148);
- Table.States (321).Kernel := To_Vector ((((118, 0), 76, 1,
(2147483647, 0), 0), ((118, 1), 76, 3,
- (2147483647, 0), 0), ((202, 0), 76, 1, (2147483647, 0), 0),
((242, 0), 76, 4, (2147483647, 0), 0)));
- Table.States (321).Minimal_Complete_Actions := To_Vector
(((Reduce, (128, 1), 0), (Reduce, (258, 1),
- 0)));
- Table.States (322).Action_List.Set_Capacity (1);
- Add_Action (Table.States (322), 58, (294, 0), 320);
- Table.States (322).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (322), 294, 503);
- Table.States (322).Kernel := To_Vector ((0 => ((255, 0), 202, 1,
(2147483647, 0), 0)));
- Table.States (322).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (294, 0), 58, 320)));
- Table.States (323).Action_List.Set_Capacity (4);
- Add_Action (Table.States (323), (35, 56, 74, 99), (210, 0), 3,
function_specification_0'Access,
- function_specification_0_check'Access);
- Table.States (323).Kernel := To_Vector ((0 => ((210, 0), 255, 0,
(210, 0), 3)));
- Table.States (323).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (210, 0), 3)));
- Table.States (324).Action_List.Set_Capacity (7);
- Add_Action (Table.States (324), (21, 35, 56, 74, 78, 85, 99),
(255, 1), 1, null, null);
- Table.States (324).Kernel := To_Vector ((0 => ((255, 1), 294, 0,
(255, 1), 1)));
- Table.States (324).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (255, 1), 1)));
- Table.States (325).Action_List.Set_Capacity (5);
- Add_Action (Table.States (325), 56, (218, 2), 504);
- Add_Action (Table.States (325), 76, (118, 0), 237);
- Add_Action (Table.States (325), 87, (296, 0), 239);
- Add_Action (Table.States (325), 104, (325, 0), 241);
- Add_Action (Table.States (325), 105, (325, 1), 242);
- Table.States (325).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (325), 118, 243);
- Add_Goto (Table.States (325), 325, 244);
- Table.States (325).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((218, 2), 242, 3,
- (2147483647, 0), 0), ((242, 0), 242, 5, (2147483647, 0), 0),
((242, 1), 242, 2, (2147483647, 0), 0),
- ((275, 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (325).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (218, 2), 56, 504)));
- Table.States (326).Action_List.Set_Capacity (5);
- Add_Action (Table.States (326), 56, (218, 0), 505);
- Add_Action (Table.States (326), 76, (118, 0), 237);
- Add_Action (Table.States (326), 87, (296, 0), 239);
- Add_Action (Table.States (326), 104, (325, 0), 241);
- Add_Action (Table.States (326), 105, (325, 1), 242);
- Table.States (326).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (326), 118, 243);
- Add_Goto (Table.States (326), 325, 244);
- Table.States (326).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((218, 0), 242, 3,
- (2147483647, 0), 0), ((242, 0), 242, 5, (2147483647, 0), 0),
((242, 1), 242, 2, (2147483647, 0), 0),
- ((275, 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (326).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (218, 0), 56, 505)));
- Table.States (327).Action_List.Set_Capacity (5);
- Add_Action (Table.States (327), 56, (218, 1), 506);
- Add_Action (Table.States (327), 76, (118, 0), 237);
- Add_Action (Table.States (327), 87, (296, 0), 239);
- Add_Action (Table.States (327), 104, (325, 0), 241);
- Add_Action (Table.States (327), 105, (325, 1), 242);
- Table.States (327).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (327), 118, 243);
- Add_Goto (Table.States (327), 325, 244);
- Table.States (327).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((218, 1), 242, 3,
- (2147483647, 0), 0), ((242, 0), 242, 5, (2147483647, 0), 0),
((242, 1), 242, 2, (2147483647, 0), 0),
- ((275, 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (327).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (218, 1), 56, 506)));
- Table.States (328).Action_List.Set_Capacity (4);
- Add_Action (Table.States (328), 35, Reduce, (172, 2), 0, null,
null);
- Add_Action (Table.States (328), 74, Reduce, (172, 2), 0, null,
null);
- Add_Action (Table.States (328), 76, (172, 0), 380);
- Add_Action (Table.States (328), 99, Reduce, (172, 2), 0, null,
null);
- Table.States (328).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (328), 172, 507);
- Table.States (328).Kernel := To_Vector ((((204, 0), 107, 3,
(2147483647, 0), 0), ((204, 1), 107, 3,
- (2147483647, 0), 0), ((204, 2), 107, 1, (2147483647, 0), 0)));
- Table.States (328).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (172, 2), 0)));
- Table.States (329).Action_List.Set_Capacity (4);
- Add_Action (Table.States (329), 81, (242, 8), 31);
- Add_Action (Table.States (329), 107, (242, 5), 120);
- Add_Action (Table.States (329), 108, (242, 7), 34);
- Add_Action (Table.States (329), 109, (242, 6), 35);
- Table.States (329).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (329), 131, 42);
- Add_Goto (Table.States (329), 242, 508);
- Add_Goto (Table.States (329), 275, 93);
- Add_Goto (Table.States (329), 296, 98);
- Table.States (329).Kernel := To_Vector ((0 => ((207, 0), 47, 5,
(2147483647, 0), 0)));
- Table.States (329).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (330).Action_List.Set_Capacity (3);
- Add_Action (Table.States (330), 35, (203, 0), 509);
- Add_Action (Table.States (330), 74, (125, 0), 340);
- Add_Action (Table.States (330), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (330).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (330), 125, 510);
- Table.States (330).Kernel := To_Vector ((((203, 0), 315, 4,
(2147483647, 0), 0), ((203, 1), 315, 3,
- (2147483647, 0), 0), ((203, 2), 315, 3, (2147483647, 0), 0),
((203, 3), 315, 1, (2147483647, 0),
- 0)));
- Table.States (330).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (331).Action_List.Set_Capacity (8);
- Add_Action (Table.States (331), (29, 47, 48, 50, 69, 71, 74, 107),
(214, 0), 2, null, null);
- Table.States (331).Kernel := To_Vector ((0 => ((214, 0), 215, 0,
(214, 0), 2)));
- Table.States (331).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (214, 0), 2)));
- Table.States (332).Action_List.Set_Capacity (11);
- Add_Action (Table.States (332), 7, Reduce, (239, 3), 0, null,
null);
- Add_Action (Table.States (332), 33, (239, 0), 511);
- Add_Action (Table.States (332), 40, Reduce, (239, 3), 0, null,
null);
- Add_Action (Table.States (332), 45, (239, 2), 512);
- Add_Action (Table.States (332), 74, Reduce, (239, 3), 0, null,
null);
- Add_Action (Table.States (332), 81, Reduce, (239, 3), 0, null,
null);
- Add_Action (Table.States (332), 85, Reduce, (239, 3), 0, null,
null);
- Add_Action (Table.States (332), 99, Reduce, (239, 3), 0, null,
null);
- Add_Action (Table.States (332), 107, Reduce, (239, 3), 0, null,
null);
- Add_Action (Table.States (332), 108, Reduce, (239, 3), 0, null,
null);
- Add_Action (Table.States (332), 109, Reduce, (239, 3), 0, null,
null);
- Table.States (332).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (332), 239, 513);
- Table.States (332).Kernel := To_Vector ((((201, 0), 84, 3,
(2147483647, 0), 0), ((201, 1), 84, 4,
- (2147483647, 0), 0), ((201, 2), 84, 2, (2147483647, 0), 0),
((201, 3), 84, 3, (2147483647, 0), 0)));
- Table.States (332).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (239, 3), 0)));
- Table.States (333).Action_List.Set_Capacity (47);
- Add_Action (Table.States (333), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (306, 3), 3, simple_statement_3'Access, null);
- Table.States (333).Kernel := To_Vector ((0 => ((306, 3), 99, 0,
(306, 3), 3)));
- Table.States (333).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (306, 3), 3)));
- Table.States (334).Action_List.Set_Capacity (26);
- Add_Action (Table.States (334), 4, (116, 0), 1);
- Add_Action (Table.States (334), 5, (306, 8), 2);
- Add_Action (Table.States (334), 13, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (334), 15, (142, 0), 3);
- Add_Action (Table.States (334), 17, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (334), 18, (164, 0), 4);
- Add_Action (Table.States (334), 22, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (334), 23, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (334), 24, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (334), 27, (193, 0), 5);
- Add_Action (Table.States (334), 28, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (334), 31, (306, 3), 9);
- Add_Action (Table.States (334), 32, (225, 0), 10);
- Add_Action (Table.States (334), 37, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (334), 41, (306, 0), 13);
- Add_Action (Table.States (334), 48, (260, 0), 16);
- Add_Action (Table.States (334), 52, (279, 0), 20);
- Add_Action (Table.States (334), 57, (293, 0), 21);
- Add_Action (Table.States (334), 58, (199, 0), 22);
- Add_Action (Table.States (334), 61, (129, 0), 24);
- Add_Action (Table.States (334), 73, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (334), 81, (242, 8), 31);
- Add_Action (Table.States (334), 96, (220, 0), 32);
- Add_Action (Table.States (334), 107, (134, 0), 363);
- Add_Action (Table.States (334), 108, (242, 7), 34);
- Add_Action (Table.States (334), 109, (242, 6), 35);
- Table.States (334).Goto_List.Set_Capacity (31);
- Add_Goto (Table.States (334), 116, 37);
- Add_Goto (Table.States (334), 126, 39);
- Add_Goto (Table.States (334), 129, 40);
- Add_Goto (Table.States (334), 131, 42);
- Add_Goto (Table.States (334), 134, 43);
- Add_Goto (Table.States (334), 135, 44);
- Add_Goto (Table.States (334), 136, 45);
- Add_Goto (Table.States (334), 142, 48);
- Add_Goto (Table.States (334), 154, 51);
- Add_Goto (Table.States (334), 155, 52);
- Add_Goto (Table.States (334), 164, 54);
- Add_Goto (Table.States (334), 193, 58);
- Add_Goto (Table.States (334), 199, 60);
- Add_Goto (Table.States (334), 220, 69);
- Add_Goto (Table.States (334), 225, 71);
- Add_Goto (Table.States (334), 235, 73);
- Add_Goto (Table.States (334), 242, 74);
- Add_Goto (Table.States (334), 260, 84);
- Add_Goto (Table.States (334), 264, 87);
- Add_Goto (Table.States (334), 275, 93);
- Add_Goto (Table.States (334), 279, 94);
- Add_Goto (Table.States (334), 293, 97);
- Add_Goto (Table.States (334), 296, 98);
- Add_Goto (Table.States (334), 297, 99);
- Add_Goto (Table.States (334), 301, 100);
- Add_Goto (Table.States (334), 302, 364);
- Add_Goto (Table.States (334), 303, 514);
- Add_Goto (Table.States (334), 305, 101);
- Add_Goto (Table.States (334), 306, 102);
- Add_Goto (Table.States (334), 309, 366);
- Add_Goto (Table.States (334), 326, 115);
- Table.States (334).Kernel := To_Vector ((((225, 0), 68, 6,
(2147483647, 0), 0), ((225, 1), 68, 4,
- (2147483647, 0), 0), ((225, 2), 68, 5, (2147483647, 0), 0),
((225, 3), 68, 3, (2147483647, 0), 0)));
- Table.States (334).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (303, 1), 0)));
- Table.States (335).Action_List.Set_Capacity (4);
- Add_Action (Table.States (335), 81, (242, 8), 31);
- Add_Action (Table.States (335), 107, (242, 5), 120);
- Add_Action (Table.States (335), 108, (242, 7), 34);
- Add_Action (Table.States (335), 109, (242, 6), 35);
- Table.States (335).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (335), 131, 42);
- Add_Goto (Table.States (335), 241, 515);
- Add_Goto (Table.States (335), 242, 221);
- Add_Goto (Table.States (335), 275, 93);
- Add_Goto (Table.States (335), 296, 98);
- Table.States (335).Kernel := To_Vector ((0 => ((335, 0), 74, 2,
(2147483647, 0), 0)));
- Table.States (335).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (336).Action_List.Set_Capacity (2);
- Add_Action (Table.States (336), 86, (241, 0), 384);
- Add_Action (Table.States (336), 99, (335, 1), 516);
- Table.States (336).Kernel := To_Vector ((((241, 0), 241, 2,
(2147483647, 0), 0), ((335, 1), 241, 1,
- (2147483647, 0), 0)));
- Table.States (336).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (335, 1), 99, 516)));
- Table.States (337).Action_List.Set_Capacity (6);
- Add_Action (Table.States (337), 35, (251, 0), 517);
- Add_Conflict (Table.States (337), 35, (125, 1), 0, null, null);
- Add_Action (Table.States (337), 74, (125, 0), 340);
- Add_Action (Table.States (337), 76, (118, 0), 237);
- Add_Action (Table.States (337), 87, (296, 0), 239);
- Add_Action (Table.States (337), 104, (325, 0), 241);
- Add_Action (Table.States (337), 105, (325, 1), 242);
- Table.States (337).Goto_List.Set_Capacity (3);
- Add_Goto (Table.States (337), 118, 243);
- Add_Goto (Table.States (337), 125, 518);
- Add_Goto (Table.States (337), 325, 244);
- Table.States (337).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((242, 0), 242, 5,
- (2147483647, 0), 0), ((242, 1), 242, 2, (2147483647, 0), 0),
((250, 0), 242, 4, (2147483647, 0), 0),
- ((250, 1), 242, 3, (2147483647, 0), 0), ((251, 0), 242, 3,
(2147483647, 0), 0), ((275, 0), 242, 3,
- (2147483647, 0), 0), ((296, 0), 242, 2, (2147483647, 0), 0),
((296, 1), 242, 2, (2147483647, 0), 0),
- ((296, 2), 242, 2, (2147483647, 0), 0), ((296, 3), 242, 2,
(2147483647, 0), 0)));
- Table.States (337).Minimal_Complete_Actions := To_Vector
(((Reduce, (125, 1), 0), (Shift, (251, 0), 35,
- 517)));
- Table.States (338).Action_List.Set_Capacity (1);
- Add_Action (Table.States (338), 39, (216, 0), 519);
- Table.States (338).Kernel := To_Vector ((0 => ((216, 0), 35, 3,
(2147483647, 0), 0)));
- Table.States (338).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (216, 0), 39, 519)));
- Table.States (339).Action_List.Set_Capacity (4);
- Add_Action (Table.States (339), 81, (242, 8), 31);
- Add_Action (Table.States (339), 107, (242, 5), 120);
- Add_Action (Table.States (339), 108, (242, 7), 34);
- Add_Action (Table.States (339), 109, (242, 6), 35);
- Table.States (339).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (339), 131, 42);
- Add_Goto (Table.States (339), 242, 520);
- Add_Goto (Table.States (339), 275, 93);
- Add_Goto (Table.States (339), 296, 98);
- Table.States (339).Kernel := To_Vector ((0 => ((253, 0), 56, 2,
(2147483647, 0), 0)));
- Table.States (339).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (340).Action_List.Set_Capacity (21);
- Add_Action (Table.States (340), 3, (200, 2), 122);
- Add_Action (Table.States (340), 28, (127, 6), 521);
- Add_Action (Table.States (340), 35, Reduce, (127, 5), 0, null,
null);
- Add_Action (Table.States (340), 39, (261, 4), 123);
- Add_Action (Table.States (340), 40, (168, 1), 263);
- Add_Action (Table.States (340), 41, (261, 1), 125);
- Add_Action (Table.States (340), 44, (168, 3), 265);
- Add_Action (Table.States (340), 52, (278, 0), 126);
- Add_Action (Table.States (340), 76, (120, 0), 127);
- Add_Action (Table.States (340), 77, (120, 5), 128);
- Add_Action (Table.States (340), 81, (242, 8), 31);
- Add_Action (Table.States (340), 82, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (340), 86, Reduce, (127, 5), 0, null,
null);
- Add_Action (Table.States (340), 90, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (340), 97, (333, 1), 129);
- Add_Action (Table.States (340), 98, (333, 0), 130);
- Add_Action (Table.States (340), 99, Reduce, (127, 5), 0, null,
null);
- Add_Action (Table.States (340), 106, (261, 0), 131);
- Add_Action (Table.States (340), 107, (242, 5), 120);
- Add_Action (Table.States (340), 108, (242, 7), 34);
- Add_Action (Table.States (340), 109, (127, 0), 266);
- Table.States (340).Goto_List.Set_Capacity (24);
- Add_Goto (Table.States (340), 120, 132);
- Add_Goto (Table.States (340), 127, 267);
- Add_Goto (Table.States (340), 128, 522);
- Add_Goto (Table.States (340), 131, 42);
- Add_Goto (Table.States (340), 168, 271);
- Add_Goto (Table.States (340), 169, 272);
- Add_Goto (Table.States (340), 194, 411);
- Add_Goto (Table.States (340), 200, 135);
- Add_Goto (Table.States (340), 242, 276);
- Add_Goto (Table.States (340), 261, 137);
- Add_Goto (Table.States (340), 275, 93);
- Add_Goto (Table.States (340), 278, 138);
- Add_Goto (Table.States (340), 280, 278);
- Add_Goto (Table.States (340), 285, 139);
- Add_Goto (Table.States (340), 286, 140);
- Add_Goto (Table.States (340), 287, 141);
- Add_Goto (Table.States (340), 288, 142);
- Add_Goto (Table.States (340), 289, 143);
- Add_Goto (Table.States (340), 290, 144);
- Add_Goto (Table.States (340), 296, 98);
- Add_Goto (Table.States (340), 304, 279);
- Add_Goto (Table.States (340), 323, 146);
- Add_Goto (Table.States (340), 324, 147);
- Add_Goto (Table.States (340), 333, 148);
- Table.States (340).Kernel := To_Vector ((0 => ((125, 0), 74, 0,
(128, 1), 1)));
- Table.States (340).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (128, 1), 1)));
- Table.States (341).Action_List.Set_Capacity (1);
- Add_Action (Table.States (341), 35, (254, 0), 523);
- Table.States (341).Kernel := To_Vector ((((254, 0), 125, 3,
(2147483647, 0), 0), ((254, 1), 125, 2,
- (2147483647, 0), 0)));
- Table.States (341).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (254, 0), 35, 523)));
- Table.States (342).Action_List.Set_Capacity (22);
- Add_Action (Table.States (342), 3, (200, 2), 122);
- Add_Action (Table.States (342), 15, (139, 0), 260);
- Add_Action (Table.States (342), 28, (127, 6), 261);
- Add_Action (Table.States (342), 32, (224, 0), 262);
- Add_Action (Table.States (342), 39, (261, 4), 123);
- Add_Action (Table.States (342), 40, (168, 1), 263);
- Add_Action (Table.States (342), 41, (261, 1), 125);
- Add_Action (Table.States (342), 44, (168, 3), 265);
- Add_Action (Table.States (342), 52, (278, 0), 126);
- Add_Action (Table.States (342), 76, (120, 0), 127);
- Add_Action (Table.States (342), 77, (120, 5), 128);
- Add_Action (Table.States (342), 78, Reduce, (127, 5), 0, null,
null);
- Add_Action (Table.States (342), 81, (242, 8), 31);
- Add_Action (Table.States (342), 82, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (342), 86, Reduce, (127, 5), 0, null,
null);
- Add_Action (Table.States (342), 90, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (342), 97, (333, 1), 129);
- Add_Action (Table.States (342), 98, (333, 0), 130);
- Add_Action (Table.States (342), 106, (261, 0), 131);
- Add_Action (Table.States (342), 107, (242, 5), 120);
- Add_Action (Table.States (342), 108, (242, 7), 34);
- Add_Action (Table.States (342), 109, (127, 0), 266);
- Table.States (342).Goto_List.Set_Capacity (28);
- Add_Goto (Table.States (342), 120, 132);
- Add_Goto (Table.States (342), 127, 267);
- Add_Goto (Table.States (342), 128, 524);
- Add_Goto (Table.States (342), 131, 42);
- Add_Goto (Table.States (342), 139, 269);
- Add_Goto (Table.States (342), 156, 525);
- Add_Goto (Table.States (342), 168, 271);
- Add_Goto (Table.States (342), 169, 272);
- Add_Goto (Table.States (342), 194, 411);
- Add_Goto (Table.States (342), 200, 135);
- Add_Goto (Table.States (342), 224, 275);
- Add_Goto (Table.States (342), 242, 276);
- Add_Goto (Table.States (342), 261, 137);
- Add_Goto (Table.States (342), 275, 93);
- Add_Goto (Table.States (342), 276, 277);
- Add_Goto (Table.States (342), 278, 138);
- Add_Goto (Table.States (342), 280, 278);
- Add_Goto (Table.States (342), 285, 139);
- Add_Goto (Table.States (342), 286, 140);
- Add_Goto (Table.States (342), 287, 141);
- Add_Goto (Table.States (342), 288, 142);
- Add_Goto (Table.States (342), 289, 143);
- Add_Goto (Table.States (342), 290, 144);
- Add_Goto (Table.States (342), 296, 98);
- Add_Goto (Table.States (342), 304, 279);
- Add_Goto (Table.States (342), 323, 146);
- Add_Goto (Table.States (342), 324, 147);
- Add_Goto (Table.States (342), 333, 148);
- Table.States (342).Kernel := To_Vector ((((260, 0), 76, 2,
(2147483647, 0), 0), ((260, 1), 76, 4,
- (2147483647, 0), 0)));
- Table.States (342).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (128, 1), 0)));
- Table.States (343).Action_List.Set_Capacity (47);
- Add_Action (Table.States (343), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (260, 2), 3, pragma_g_2'Access, null);
- Table.States (343).Kernel := To_Vector ((0 => ((260, 2), 99, 0,
(260, 2), 3)));
- Table.States (343).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (260, 2), 3)));
- Table.States (344).Action_List.Set_Capacity (5);
- Add_Action (Table.States (344), 71, Reduce, (166, 0), 1, null,
null);
- Add_Conflict (Table.States (344), 71, (242, 5), 1, name_5'Access,
name_5_check'Access);
- Add_Action (Table.States (344), 76, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (344), 87, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (344), 104, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (344), 105, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Table.States (344).Kernel := To_Vector ((((166, 0), 107, 0,
(166, 0), 1), ((242, 5), 107, 0, (242, 5),
- 1)));
- Table.States (344).Minimal_Complete_Actions := To_Vector
(((Reduce, (166, 0), 1), (Reduce, (242, 5),
- 1)));
- Table.States (345).Action_List.Set_Capacity (2);
- Add_Action (Table.States (345), 86, (241, 0), 384);
- Add_Action (Table.States (345), 99, (335, 2), 526);
- Table.States (345).Kernel := To_Vector ((((241, 0), 241, 2,
(2147483647, 0), 0), ((335, 2), 241, 1,
- (2147483647, 0), 0)));
- Table.States (345).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (335, 2), 99, 526)));
- Table.States (346).Action_List.Set_Capacity (7);
- Add_Action (Table.States (346), 7, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (346), 26, (248, 2), 388);
- Add_Action (Table.States (346), 40, (244, 0), 389);
- Add_Action (Table.States (346), 81, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (346), 107, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (346), 108, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (346), 109, Reduce, (244, 1), 0, null,
null);
- Table.States (346).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (346), 117, 390);
- Add_Goto (Table.States (346), 244, 391);
- Table.States (346).Kernel := To_Vector ((((248, 0), 84, 4,
(2147483647, 0), 0), ((248, 1), 84, 5,
- (2147483647, 0), 0), ((248, 2), 84, 4, (2147483647, 0), 0)));
- Table.States (346).Minimal_Complete_Actions := To_Vector
(((Reduce, (244, 1), 0), (Shift, (248, 2), 26,
- 388)));
- Table.States (347).Action_List.Set_Capacity (8);
- Add_Action (Table.States (347), (21, 35, 56, 72, 74, 78, 85, 99),
(256, 0), 1, null, null);
- Table.States (347).Kernel := To_Vector ((0 => ((256, 0), 202, 0,
(256, 0), 1)));
- Table.States (347).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (256, 0), 1)));
- Table.States (348).Action_List.Set_Capacity (4);
- Add_Action (Table.States (348), (35, 56, 74, 99), (265, 0), 3,
procedure_specification_0'Access,
- procedure_specification_0_check'Access);
- Table.States (348).Kernel := To_Vector ((0 => ((265, 0), 256, 0,
(265, 0), 3)));
- Table.States (348).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (265, 0), 3)));
- Table.States (349).Action_List.Set_Capacity (2);
- Add_Action (Table.States (349), 35, (268, 0), 527);
- Add_Conflict (Table.States (349), 35, (125, 1), 0, null, null);
- Add_Action (Table.States (349), 74, (125, 0), 340);
- Table.States (349).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (349), 125, 528);
- Table.States (349).Kernel := To_Vector ((((267, 0), 107, 3,
(2147483647, 0), 0), ((268, 0), 107, 3,
- (2147483647, 0), 0)));
- Table.States (349).Minimal_Complete_Actions := To_Vector
(((Reduce, (125, 1), 0), (Shift, (268, 0), 35,
- 527)));
- Table.States (350).Action_List.Set_Capacity (3);
- Add_Action (Table.States (350), 35, Reduce, (172, 2), 0, null,
null);
- Add_Action (Table.States (350), 74, Reduce, (172, 2), 0, null,
null);
- Add_Action (Table.States (350), 76, (172, 0), 380);
- Table.States (350).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (350), 172, 529);
- Table.States (350).Kernel := To_Vector ((((274, 0), 107, 6,
(2147483647, 0), 0), ((274, 1), 107, 3,
- (2147483647, 0), 0)));
- Table.States (350).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (172, 2), 0)));
- Table.States (351).Action_List.Set_Capacity (1);
- Add_Action (Table.States (351), 35, (307, 0), 530);
- Table.States (351).Kernel := To_Vector ((((307, 0), 125, 6,
(2147483647, 0), 0), ((307, 1), 125, 3,
- (2147483647, 0), 0)));
- Table.States (351).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (307, 0), 35, 530)));
- Table.States (352).Action_List.Set_Capacity (15);
- Add_Action (Table.States (352), 3, (200, 2), 122);
- Add_Action (Table.States (352), 39, (261, 4), 123);
- Add_Action (Table.States (352), 40, (200, 3), 124);
- Add_Action (Table.States (352), 41, (261, 1), 125);
- Add_Action (Table.States (352), 52, (278, 0), 126);
- Add_Action (Table.States (352), 76, (120, 0), 127);
- Add_Action (Table.States (352), 77, (120, 5), 128);
- Add_Action (Table.States (352), 81, (242, 8), 31);
- Add_Action (Table.States (352), 97, (333, 1), 129);
- Add_Action (Table.States (352), 98, (333, 0), 130);
- Add_Action (Table.States (352), 99, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (352), 106, (261, 0), 131);
- Add_Action (Table.States (352), 107, (242, 5), 120);
- Add_Action (Table.States (352), 108, (242, 7), 34);
- Add_Action (Table.States (352), 109, (242, 6), 35);
- Table.States (352).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (352), 120, 132);
- Add_Goto (Table.States (352), 131, 42);
- Add_Goto (Table.States (352), 194, 133);
- Add_Goto (Table.States (352), 195, 531);
- Add_Goto (Table.States (352), 200, 135);
- Add_Goto (Table.States (352), 242, 136);
- Add_Goto (Table.States (352), 261, 137);
- Add_Goto (Table.States (352), 275, 93);
- Add_Goto (Table.States (352), 278, 138);
- Add_Goto (Table.States (352), 285, 139);
- Add_Goto (Table.States (352), 286, 140);
- Add_Goto (Table.States (352), 287, 141);
- Add_Goto (Table.States (352), 288, 142);
- Add_Goto (Table.States (352), 289, 143);
- Add_Goto (Table.States (352), 290, 144);
- Add_Goto (Table.States (352), 296, 98);
- Add_Goto (Table.States (352), 304, 145);
- Add_Goto (Table.States (352), 323, 146);
- Add_Goto (Table.States (352), 324, 147);
- Add_Goto (Table.States (352), 333, 148);
- Table.States (352).Kernel := To_Vector ((0 => ((279, 0), 74, 1,
(2147483647, 0), 0)));
- Table.States (352).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (353).Action_List.Set_Capacity (47);
- Add_Action (Table.States (353), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (279, 1), 3, raise_statement_1'Access, null);
- Table.States (353).Kernel := To_Vector ((0 => ((279, 1), 99, 0,
(279, 1), 3)));
- Table.States (353).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (279, 1), 3)));
- Table.States (354).Action_List.Set_Capacity (1);
- Add_Action (Table.States (354), 5, (293, 0), 532);
- Table.States (354).Kernel := To_Vector ((0 => ((293, 0), 74, 2,
(2147483647, 0), 0)));
- Table.States (354).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (293, 0), 5, 532)));
- Table.States (355).Action_List.Set_Capacity (47);
- Add_Action (Table.States (355), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (293, 1), 3, requeue_statement_1'Access, null);
- Table.States (355).Kernel := To_Vector ((0 => ((293, 1), 99, 0,
(293, 1), 3)));
- Table.States (355).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (293, 1), 3)));
- Table.States (356).Action_List.Set_Capacity (11);
- Add_Action (Table.States (356), 7, Reduce, (121, 1), 0, null,
null);
- Add_Action (Table.States (356), 8, (121, 0), 404);
- Add_Action (Table.States (356), 16, Reduce, (121, 1), 0, null,
null);
- Add_Action (Table.States (356), 21, Reduce, (121, 1), 0, null,
null);
- Add_Action (Table.States (356), 40, Reduce, (121, 1), 0, null,
null);
- Add_Action (Table.States (356), 81, Reduce, (121, 1), 0, null,
null);
- Add_Action (Table.States (356), 85, Reduce, (121, 1), 0, null,
null);
- Add_Action (Table.States (356), 99, Reduce, (121, 1), 0, null,
null);
- Add_Action (Table.States (356), 107, Reduce, (121, 1), 0, null,
null);
- Add_Action (Table.States (356), 108, Reduce, (121, 1), 0, null,
null);
- Add_Action (Table.States (356), 109, Reduce, (121, 1), 0, null,
null);
- Table.States (356).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (356), 121, 533);
- Table.States (356).Kernel := To_Vector ((((197, 0), 84, 2,
(2147483647, 0), 0), ((197, 1), 84, 1,
- (2147483647, 0), 0)));
- Table.States (356).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (121, 1), 0)));
- Table.States (357).Action_List.Set_Capacity (47);
- Add_Action (Table.States (357), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (305, 0), 3, simple_return_statement_0'Access, null);
- Table.States (357).Kernel := To_Vector ((0 => ((305, 0), 99, 0,
(305, 0), 3)));
- Table.States (357).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (305, 0), 3)));
- Table.States (358).Action_List.Set_Capacity (47);
- Add_Action (Table.States (358), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (199, 1), 3, extended_return_statement_1'Access, null);
- Table.States (358).Kernel := To_Vector ((0 => ((199, 1), 99, 0,
(199, 1), 3)));
- Table.States (358).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (199, 1), 3)));
- Table.States (359).Action_List.Set_Capacity (25);
- Add_Action (Table.States (359), 4, (116, 0), 1);
- Add_Action (Table.States (359), 5, (306, 8), 2);
- Add_Action (Table.States (359), 13, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (359), 15, (142, 0), 3);
- Add_Action (Table.States (359), 17, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (359), 18, (164, 0), 4);
- Add_Action (Table.States (359), 24, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (359), 26, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (359), 27, (193, 0), 5);
- Add_Action (Table.States (359), 28, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (359), 31, (306, 3), 9);
- Add_Action (Table.States (359), 32, (225, 0), 10);
- Add_Action (Table.States (359), 37, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (359), 41, (306, 0), 13);
- Add_Action (Table.States (359), 48, (260, 0), 16);
- Add_Action (Table.States (359), 52, (279, 0), 20);
- Add_Action (Table.States (359), 57, (293, 0), 21);
- Add_Action (Table.States (359), 58, (199, 0), 22);
- Add_Action (Table.States (359), 61, (129, 0), 24);
- Add_Action (Table.States (359), 73, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (359), 81, (242, 8), 31);
- Add_Action (Table.States (359), 96, (220, 0), 32);
- Add_Action (Table.States (359), 107, (134, 0), 363);
- Add_Action (Table.States (359), 108, (242, 7), 34);
- Add_Action (Table.States (359), 109, (242, 6), 35);
- Table.States (359).Goto_List.Set_Capacity (32);
- Add_Goto (Table.States (359), 116, 37);
- Add_Goto (Table.States (359), 126, 39);
- Add_Goto (Table.States (359), 129, 40);
- Add_Goto (Table.States (359), 131, 42);
- Add_Goto (Table.States (359), 134, 43);
- Add_Goto (Table.States (359), 135, 44);
- Add_Goto (Table.States (359), 136, 45);
- Add_Goto (Table.States (359), 142, 48);
- Add_Goto (Table.States (359), 154, 51);
- Add_Goto (Table.States (359), 155, 52);
- Add_Goto (Table.States (359), 164, 54);
- Add_Goto (Table.States (359), 193, 58);
- Add_Goto (Table.States (359), 199, 60);
- Add_Goto (Table.States (359), 220, 69);
- Add_Goto (Table.States (359), 221, 534);
- Add_Goto (Table.States (359), 225, 71);
- Add_Goto (Table.States (359), 235, 73);
- Add_Goto (Table.States (359), 242, 74);
- Add_Goto (Table.States (359), 260, 84);
- Add_Goto (Table.States (359), 264, 87);
- Add_Goto (Table.States (359), 275, 93);
- Add_Goto (Table.States (359), 279, 94);
- Add_Goto (Table.States (359), 293, 97);
- Add_Goto (Table.States (359), 296, 98);
- Add_Goto (Table.States (359), 297, 99);
- Add_Goto (Table.States (359), 301, 100);
- Add_Goto (Table.States (359), 302, 364);
- Add_Goto (Table.States (359), 303, 393);
- Add_Goto (Table.States (359), 305, 101);
- Add_Goto (Table.States (359), 306, 102);
- Add_Goto (Table.States (359), 309, 366);
- Add_Goto (Table.States (359), 326, 115);
- Table.States (359).Kernel := To_Vector ((0 => ((199, 0), 21, 3,
(2147483647, 0), 0)));
- Table.States (359).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (221, 1), 0)));
- end Subr_7;
- procedure Subr_8
- is begin
- Table.States (360).Action_List.Set_Capacity (5);
- Add_Action (Table.States (360), 76, (118, 0), 237);
- Add_Action (Table.States (360), 78, (318, 0), 535);
- Add_Action (Table.States (360), 87, (296, 0), 239);
- Add_Action (Table.States (360), 104, (325, 0), 241);
- Add_Action (Table.States (360), 105, (325, 1), 242);
- Table.States (360).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (360), 118, 243);
- Add_Goto (Table.States (360), 325, 244);
- Table.States (360).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((242, 0), 242, 5,
- (2147483647, 0), 0), ((242, 1), 242, 2, (2147483647, 0), 0),
((275, 0), 242, 3, (2147483647, 0), 0),
- ((296, 0), 242, 2, (2147483647, 0), 0), ((296, 1), 242, 2,
(2147483647, 0), 0), ((296, 2), 242, 2,
- (2147483647, 0), 0), ((296, 3), 242, 2, (2147483647, 0), 0),
((318, 0), 242, 7, (2147483647, 0),
- 0)));
- Table.States (360).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (318, 0), 78, 535)));
- Table.States (361).Action_List.Set_Capacity (3);
- Add_Action (Table.States (361), (22, 24, 43), (298, 4), 2,
select_alternative_4'Access, null);
- Table.States (361).Kernel := To_Vector ((0 => ((298, 4), 99, 0,
(298, 4), 2)));
- Table.States (361).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (298, 4), 2)));
- Table.States (362).Action_List.Set_Capacity (1);
- Add_Action (Table.States (362), 90, (298, 0), 536);
- Table.States (362).Kernel := To_Vector ((((298, 0), 195, 4,
(2147483647, 0), 0), ((298, 1), 195, 3,
- (2147483647, 0), 0), ((298, 2), 195, 3, (2147483647, 0), 0)));
- Table.States (362).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (298, 0), 90, 536)));
- Table.States (363).Action_List.Set_Capacity (7);
- Add_Action (Table.States (363), 76, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (363), 84, (134, 0), 537);
- Add_Action (Table.States (363), 85, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (363), 87, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (363), 99, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (363), 104, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (363), 105, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Table.States (363).Kernel := To_Vector ((((134, 0), 107, 1,
(2147483647, 0), 0), ((242, 5), 107, 0,
- (242, 5), 1)));
- Table.States (363).Minimal_Complete_Actions := To_Vector (((Shift,
(134, 0), 84, 537), (Reduce, (242, 5),
- 1)));
- Table.States (364).Action_List.Set_Capacity (30);
- Add_Action (Table.States (364), 4, (116, 0), 1);
- Add_Action (Table.States (364), 5, (306, 8), 2);
- Add_Action (Table.States (364), 13, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (364), 15, (142, 0), 3);
- Add_Action (Table.States (364), 17, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (364), 18, (164, 0), 4);
- Add_Action (Table.States (364), 22, Reduce, (303, 0), 1, null,
null);
- Add_Action (Table.States (364), 23, Reduce, (303, 0), 1, null,
null);
- Add_Action (Table.States (364), 24, Reduce, (303, 0), 1, null,
null);
- Add_Action (Table.States (364), 26, Reduce, (303, 0), 1, null,
null);
- Add_Action (Table.States (364), 27, (193, 0), 5);
- Add_Action (Table.States (364), 28, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (364), 31, (306, 3), 9);
- Add_Action (Table.States (364), 32, (225, 0), 10);
- Add_Action (Table.States (364), 37, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (364), 41, (306, 0), 13);
- Add_Action (Table.States (364), 43, Reduce, (303, 0), 1, null,
null);
- Add_Action (Table.States (364), 48, (260, 0), 16);
- Add_Action (Table.States (364), 52, (279, 0), 20);
- Add_Action (Table.States (364), 57, (293, 0), 21);
- Add_Action (Table.States (364), 58, (199, 0), 22);
- Add_Action (Table.States (364), 61, (129, 0), 24);
- Add_Action (Table.States (364), 68, Reduce, (303, 0), 1, null,
null);
- Add_Action (Table.States (364), 72, Reduce, (303, 0), 1, null,
null);
- Add_Action (Table.States (364), 73, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (364), 81, (242, 8), 31);
- Add_Action (Table.States (364), 96, (220, 0), 32);
- Add_Action (Table.States (364), 107, (134, 0), 363);
- Add_Action (Table.States (364), 108, (242, 7), 34);
- Add_Action (Table.States (364), 109, (242, 6), 35);
- Table.States (364).Goto_List.Set_Capacity (29);
- Add_Goto (Table.States (364), 116, 37);
- Add_Goto (Table.States (364), 126, 39);
- Add_Goto (Table.States (364), 129, 40);
- Add_Goto (Table.States (364), 131, 42);
- Add_Goto (Table.States (364), 134, 43);
- Add_Goto (Table.States (364), 135, 44);
- Add_Goto (Table.States (364), 136, 45);
- Add_Goto (Table.States (364), 142, 48);
- Add_Goto (Table.States (364), 154, 51);
- Add_Goto (Table.States (364), 155, 52);
- Add_Goto (Table.States (364), 164, 54);
- Add_Goto (Table.States (364), 193, 58);
- Add_Goto (Table.States (364), 199, 60);
- Add_Goto (Table.States (364), 220, 69);
- Add_Goto (Table.States (364), 225, 71);
- Add_Goto (Table.States (364), 235, 73);
- Add_Goto (Table.States (364), 242, 74);
- Add_Goto (Table.States (364), 260, 84);
- Add_Goto (Table.States (364), 264, 87);
- Add_Goto (Table.States (364), 275, 93);
- Add_Goto (Table.States (364), 279, 94);
- Add_Goto (Table.States (364), 293, 97);
- Add_Goto (Table.States (364), 296, 98);
- Add_Goto (Table.States (364), 297, 99);
- Add_Goto (Table.States (364), 301, 100);
- Add_Goto (Table.States (364), 305, 101);
- Add_Goto (Table.States (364), 306, 102);
- Add_Goto (Table.States (364), 309, 538);
- Add_Goto (Table.States (364), 326, 115);
- Table.States (364).Kernel := To_Vector ((((302, 0), 302, 2,
(2147483647, 0), 0), ((303, 0), 302, 0,
- (303, 0), 1)));
- Table.States (364).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (303, 0), 1)));
- Table.States (365).Action_List.Set_Capacity (3);
- Add_Action (Table.States (365), (22, 24, 43), (298, 3), 2, null,
null);
- Table.States (365).Kernel := To_Vector ((0 => ((298, 3), 303, 0,
(298, 3), 2)));
- Table.States (365).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (298, 3), 2)));
- Table.States (366).Action_List.Set_Capacity (30);
- Add_Action (Table.States (366), (4, 5, 13, 15, 17, 18, 22, 23, 24,
26, 27, 28, 31, 32, 37, 41, 43, 48, 52,
- 57, 58, 61, 68, 72, 73, 81, 96, 107, 108, 109), (302, 1), 1,
null, null);
- Table.States (366).Kernel := To_Vector ((0 => ((302, 1), 309, 0,
(302, 1), 1)));
- Table.States (366).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (302, 1), 1)));
- Table.States (367).Action_List.Set_Capacity (4);
- Add_Action (Table.States (367), 22, Reduce, (163, 0), 2, null,
null);
- Add_Action (Table.States (367), 24, Reduce, (163, 0), 2, null,
null);
- Add_Action (Table.States (367), 43, Reduce, (163, 0), 2, null,
null);
- Add_Action (Table.States (367), 68, Reduce, (327, 2), 2, null,
null);
- Table.States (367).Kernel := To_Vector ((((163, 0), 303, 0,
(163, 0), 2), ((327, 2), 303, 0, (327, 2),
- 2)));
- Table.States (367).Minimal_Complete_Actions := To_Vector
(((Reduce, (163, 0), 2), (Reduce, (327, 2),
- 2)));
- Table.States (368).Action_List.Set_Capacity (24);
- Add_Action (Table.States (368), 4, (116, 0), 1);
- Add_Action (Table.States (368), 5, (306, 8), 2);
- Add_Action (Table.States (368), 13, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (368), 15, (142, 0), 3);
- Add_Action (Table.States (368), 17, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (368), 18, (164, 0), 4);
- Add_Action (Table.States (368), 24, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (368), 27, (193, 0), 5);
- Add_Action (Table.States (368), 28, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (368), 31, (306, 3), 9);
- Add_Action (Table.States (368), 32, (225, 0), 10);
- Add_Action (Table.States (368), 37, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (368), 41, (306, 0), 13);
- Add_Action (Table.States (368), 48, (260, 0), 16);
- Add_Action (Table.States (368), 52, (279, 0), 20);
- Add_Action (Table.States (368), 57, (293, 0), 21);
- Add_Action (Table.States (368), 58, (199, 0), 22);
- Add_Action (Table.States (368), 61, (129, 0), 24);
- Add_Action (Table.States (368), 73, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (368), 81, (242, 8), 31);
- Add_Action (Table.States (368), 96, (220, 0), 32);
- Add_Action (Table.States (368), 107, (134, 0), 363);
- Add_Action (Table.States (368), 108, (242, 7), 34);
- Add_Action (Table.States (368), 109, (242, 6), 35);
- Table.States (368).Goto_List.Set_Capacity (31);
- Add_Goto (Table.States (368), 116, 37);
- Add_Goto (Table.States (368), 126, 39);
- Add_Goto (Table.States (368), 129, 40);
- Add_Goto (Table.States (368), 131, 42);
- Add_Goto (Table.States (368), 134, 43);
- Add_Goto (Table.States (368), 135, 44);
- Add_Goto (Table.States (368), 136, 45);
- Add_Goto (Table.States (368), 142, 48);
- Add_Goto (Table.States (368), 154, 51);
- Add_Goto (Table.States (368), 155, 52);
- Add_Goto (Table.States (368), 164, 54);
- Add_Goto (Table.States (368), 193, 58);
- Add_Goto (Table.States (368), 199, 60);
- Add_Goto (Table.States (368), 220, 69);
- Add_Goto (Table.States (368), 225, 71);
- Add_Goto (Table.States (368), 235, 73);
- Add_Goto (Table.States (368), 242, 74);
- Add_Goto (Table.States (368), 260, 84);
- Add_Goto (Table.States (368), 264, 87);
- Add_Goto (Table.States (368), 275, 93);
- Add_Goto (Table.States (368), 279, 94);
- Add_Goto (Table.States (368), 293, 97);
- Add_Goto (Table.States (368), 296, 98);
- Add_Goto (Table.States (368), 297, 99);
- Add_Goto (Table.States (368), 301, 100);
- Add_Goto (Table.States (368), 302, 364);
- Add_Goto (Table.States (368), 303, 539);
- Add_Goto (Table.States (368), 305, 101);
- Add_Goto (Table.States (368), 306, 102);
- Add_Goto (Table.States (368), 309, 366);
- Add_Goto (Table.States (368), 326, 115);
- Table.States (368).Kernel := To_Vector ((0 => ((155, 0), 22, 3,
(2147483647, 0), 0)));
- Table.States (368).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (303, 1), 0)));
- Table.States (369).Action_List.Set_Capacity (1);
- Add_Action (Table.States (369), 18, (164, 0), 4);
- Table.States (369).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (369), 163, 540);
- Add_Goto (Table.States (369), 164, 541);
- Table.States (369).Kernel := To_Vector ((0 => ((326, 0), 43, 5,
(2147483647, 0), 0)));
- Table.States (369).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (164, 0), 18, 4)));
- Table.States (370).Action_List.Set_Capacity (3);
- Add_Action (Table.States (370), 22, Reduce, (181, 1), 2, null,
null);
- Add_Action (Table.States (370), 43, Reduce, (181, 1), 2, null,
null);
- Add_Action (Table.States (370), 68, Reduce, (327, 1), 2, null,
null);
- Table.States (370).Kernel := To_Vector ((((181, 1), 303, 0,
(181, 1), 2), ((327, 1), 303, 0, (327, 1),
- 2)));
- Table.States (370).Minimal_Complete_Actions := To_Vector
(((Reduce, (181, 1), 2), (Reduce, (327, 1),
- 2)));
- Table.States (371).Action_List.Set_Capacity (3);
- Add_Action (Table.States (371), 22, Reduce, (181, 0), 2, null,
null);
- Add_Action (Table.States (371), 43, Reduce, (181, 0), 2, null,
null);
- Add_Action (Table.States (371), 68, Reduce, (327, 0), 2, null,
null);
- Table.States (371).Kernel := To_Vector ((((181, 0), 303, 0,
(181, 0), 2), ((327, 0), 303, 0, (327, 0),
- 2)));
- Table.States (371).Minimal_Complete_Actions := To_Vector
(((Reduce, (181, 0), 2), (Reduce, (327, 0),
- 2)));
- Table.States (372).Action_List.Set_Capacity (4);
- Add_Action (Table.States (372), 4, (116, 0), 1);
- Add_Action (Table.States (372), 18, (164, 0), 4);
- Add_Action (Table.States (372), 67, (298, 4), 201);
- Add_Action (Table.States (372), 72, (298, 0), 202);
- Table.States (372).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (372), 116, 203);
- Add_Goto (Table.States (372), 163, 204);
- Add_Goto (Table.States (372), 164, 541);
- Add_Goto (Table.States (372), 298, 542);
- Table.States (372).Kernel := To_Vector ((0 => ((299, 0), 43, 2,
(2147483647, 0), 0)));
- Table.States (372).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (298, 4), 67, 201)));
- Table.States (373).Action_List.Set_Capacity (24);
- Add_Action (Table.States (373), 4, (116, 0), 1);
- Add_Action (Table.States (373), 5, (306, 8), 2);
- Add_Action (Table.States (373), 13, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (373), 15, (142, 0), 3);
- Add_Action (Table.States (373), 17, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (373), 18, (164, 0), 4);
- Add_Action (Table.States (373), 24, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (373), 27, (193, 0), 5);
- Add_Action (Table.States (373), 28, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (373), 31, (306, 3), 9);
- Add_Action (Table.States (373), 32, (225, 0), 10);
- Add_Action (Table.States (373), 37, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (373), 41, (306, 0), 13);
- Add_Action (Table.States (373), 48, (260, 0), 16);
- Add_Action (Table.States (373), 52, (279, 0), 20);
- Add_Action (Table.States (373), 57, (293, 0), 21);
- Add_Action (Table.States (373), 58, (199, 0), 22);
- Add_Action (Table.States (373), 61, (129, 0), 24);
- Add_Action (Table.States (373), 73, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (373), 81, (242, 8), 31);
- Add_Action (Table.States (373), 96, (220, 0), 32);
- Add_Action (Table.States (373), 107, (134, 0), 363);
- Add_Action (Table.States (373), 108, (242, 7), 34);
- Add_Action (Table.States (373), 109, (242, 6), 35);
- Table.States (373).Goto_List.Set_Capacity (31);
- Add_Goto (Table.States (373), 116, 37);
- Add_Goto (Table.States (373), 126, 39);
- Add_Goto (Table.States (373), 129, 40);
- Add_Goto (Table.States (373), 131, 42);
- Add_Goto (Table.States (373), 134, 43);
- Add_Goto (Table.States (373), 135, 44);
- Add_Goto (Table.States (373), 136, 45);
- Add_Goto (Table.States (373), 142, 48);
- Add_Goto (Table.States (373), 154, 51);
- Add_Goto (Table.States (373), 155, 52);
- Add_Goto (Table.States (373), 164, 54);
- Add_Goto (Table.States (373), 193, 58);
- Add_Goto (Table.States (373), 199, 60);
- Add_Goto (Table.States (373), 220, 69);
- Add_Goto (Table.States (373), 225, 71);
- Add_Goto (Table.States (373), 235, 73);
- Add_Goto (Table.States (373), 242, 74);
- Add_Goto (Table.States (373), 260, 84);
- Add_Goto (Table.States (373), 264, 87);
- Add_Goto (Table.States (373), 275, 93);
- Add_Goto (Table.States (373), 279, 94);
- Add_Goto (Table.States (373), 293, 97);
- Add_Goto (Table.States (373), 296, 98);
- Add_Goto (Table.States (373), 297, 99);
- Add_Goto (Table.States (373), 301, 100);
- Add_Goto (Table.States (373), 302, 364);
- Add_Goto (Table.States (373), 303, 543);
- Add_Goto (Table.States (373), 305, 101);
- Add_Goto (Table.States (373), 306, 102);
- Add_Goto (Table.States (373), 309, 366);
- Add_Goto (Table.States (373), 326, 115);
- Table.States (373).Kernel := To_Vector ((0 => ((297, 0), 22, 3,
(2147483647, 0), 0)));
- Table.States (373).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (303, 1), 0)));
- Table.States (374).Action_List.Set_Capacity (1);
- Add_Action (Table.States (374), 61, (297, 1), 544);
- Table.States (374).Kernel := To_Vector ((0 => ((297, 1), 24, 2,
(2147483647, 0), 0)));
- Table.States (374).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (297, 1), 61, 544)));
- Table.States (375).Action_List.Set_Capacity (1);
- Add_Action (Table.States (375), 5, (129, 0), 545);
- Table.States (375).Kernel := To_Vector ((0 => ((129, 0), 68, 4,
(2147483647, 0), 0)));
- Table.States (375).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (129, 0), 5, 545)));
- Table.States (376).Action_List.Set_Capacity (5);
- Add_Action (Table.States (376), 40, (317, 0), 490);
- Add_Action (Table.States (376), 81, (242, 8), 31);
- Add_Action (Table.States (376), 107, (242, 5), 120);
- Add_Action (Table.States (376), 108, (242, 7), 34);
- Add_Action (Table.States (376), 109, (242, 6), 35);
- Table.States (376).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (376), 131, 42);
- Add_Goto (Table.States (376), 242, 491);
- Add_Goto (Table.States (376), 275, 93);
- Add_Goto (Table.States (376), 296, 98);
- Add_Goto (Table.States (376), 317, 546);
- Table.States (376).Kernel := To_Vector ((0 => ((316, 0), 35, 2,
(2147483647, 0), 0)));
- Table.States (376).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (377).Action_List.Set_Capacity (2);
- Add_Action (Table.States (377), 35, (320, 0), 547);
- Add_Conflict (Table.States (377), 35, (125, 1), 0, null, null);
- Add_Action (Table.States (377), 74, (125, 0), 340);
- Table.States (377).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (377), 125, 548);
- Table.States (377).Kernel := To_Vector ((((319, 0), 107, 4,
(2147483647, 0), 0), ((320, 0), 107, 3,
- (2147483647, 0), 0)));
- Table.States (377).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (320, 0), 35, 547)));
- Table.States (378).Action_List.Set_Capacity (4);
- Add_Action (Table.States (378), 35, Reduce, (172, 2), 0, null,
null);
- Add_Action (Table.States (378), 74, Reduce, (172, 2), 0, null,
null);
- Add_Action (Table.States (378), 76, (172, 0), 380);
- Add_Action (Table.States (378), 99, Reduce, (172, 2), 0, null,
null);
- Table.States (378).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (378), 172, 549);
- Table.States (378).Kernel := To_Vector ((((322, 0), 107, 6,
(2147483647, 0), 0), ((322, 1), 107, 3,
- (2147483647, 0), 0), ((322, 2), 107, 1, (2147483647, 0), 0)));
- Table.States (378).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (172, 2), 0)));
- Table.States (379).Action_List.Set_Capacity (2);
- Add_Action (Table.States (379), 35, (308, 0), 550);
- Add_Action (Table.States (379), 99, (308, 2), 551);
- Table.States (379).Kernel := To_Vector ((((308, 0), 125, 6,
(2147483647, 0), 0), ((308, 1), 125, 3,
- (2147483647, 0), 0), ((308, 2), 125, 1, (2147483647, 0), 0)));
- Table.States (379).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (308, 2), 99, 551)));
- Table.States (380).Action_List.Set_Capacity (4);
- Add_Action (Table.States (380), 78, Reduce, (173, 4), 0, null,
null);
- Add_Action (Table.States (380), 83, (172, 0), 552);
- Add_Action (Table.States (380), 99, Reduce, (173, 4), 0, null,
null);
- Add_Action (Table.States (380), 107, (222, 1), 166);
- Table.States (380).Goto_List.Set_Capacity (3);
- Add_Goto (Table.States (380), 173, 553);
- Add_Goto (Table.States (380), 174, 554);
- Add_Goto (Table.States (380), 222, 555);
- Table.States (380).Kernel := To_Vector ((((172, 0), 76, 2,
(2147483647, 0), 0), ((172, 1), 76, 1,
- (2147483647, 0), 0)));
- Table.States (380).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (174, 1), 0)));
- Table.States (381).Action_List.Set_Capacity (2);
- Add_Action (Table.States (381), 35, (209, 0), 556);
- Add_Action (Table.States (381), 99, (226, 1), 557);
- Table.States (381).Kernel := To_Vector ((((209, 0), 172, 3,
(2147483647, 0), 0), ((226, 0), 172, 3,
- (2147483647, 0), 0), ((226, 1), 172, 1, (2147483647, 0), 0),
((262, 0), 172, 6, (2147483647, 0), 0),
- ((263, 0), 172, 3, (2147483647, 0), 0)));
- Table.States (381).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (226, 1), 99, 557)));
- Table.States (382).Action_List.Set_Capacity (4);
- Add_Action (Table.States (382), 81, (242, 8), 31);
- Add_Action (Table.States (382), 107, (242, 5), 120);
- Add_Action (Table.States (382), 108, (242, 7), 34);
- Add_Action (Table.States (382), 109, (242, 6), 35);
- Table.States (382).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (382), 131, 42);
- Add_Goto (Table.States (382), 241, 558);
- Add_Goto (Table.States (382), 242, 221);
- Add_Goto (Table.States (382), 275, 93);
- Add_Goto (Table.States (382), 296, 98);
- Table.States (382).Kernel := To_Vector ((0 => ((334, 0), 69, 2,
(2147483647, 0), 0)));
- Table.States (382).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (383).Action_List.Set_Capacity (2);
- Add_Action (Table.States (383), 86, (241, 0), 384);
- Add_Action (Table.States (383), 99, (334, 1), 559);
- Table.States (383).Kernel := To_Vector ((((241, 0), 241, 2,
(2147483647, 0), 0), ((334, 1), 241, 1,
- (2147483647, 0), 0)));
- Table.States (383).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (334, 1), 99, 559)));
- Table.States (384).Action_List.Set_Capacity (4);
- Add_Action (Table.States (384), 81, (242, 8), 31);
- Add_Action (Table.States (384), 107, (242, 5), 120);
- Add_Action (Table.States (384), 108, (242, 7), 34);
- Add_Action (Table.States (384), 109, (242, 6), 35);
- Table.States (384).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (384), 131, 42);
- Add_Goto (Table.States (384), 242, 560);
- Add_Goto (Table.States (384), 275, 93);
- Add_Goto (Table.States (384), 296, 98);
- Table.States (384).Kernel := To_Vector ((0 => ((241, 0), 86, 1,
(2147483647, 0), 0)));
- Table.States (384).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (385).Action_List.Set_Capacity (41);
- Add_Action (Table.States (385), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (334, 2), 3,
- use_clause_2'Access, null);
- Table.States (385).Kernel := To_Vector ((0 => ((334, 2), 99, 0,
(334, 2), 3)));
- Table.States (385).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (334, 2), 3)));
- Table.States (386).Action_List.Set_Capacity (40);
- Add_Action (Table.States (386), (4, 5, 13, 15, 17, 18, 25, 27, 28,
29, 30, 31, 32, 36, 37, 40, 41, 46, 47,
- 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 81,
96, 107, 108, 109, 110), (335, 3), 3,
- with_clause_3'Access, null);
- Table.States (386).Kernel := To_Vector ((0 => ((335, 3), 99, 0,
(335, 3), 3)));
- Table.States (386).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (335, 3), 3)));
- Table.States (387).Action_List.Set_Capacity (47);
- Add_Action (Table.States (387), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (220, 0), 3, goto_label_0'Access, null);
- Table.States (387).Kernel := To_Vector ((0 => ((220, 0), 93, 0,
(220, 0), 3)));
- Table.States (387).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (220, 0), 3)));
- Table.States (388).Action_List.Set_Capacity (1);
- Add_Action (Table.States (388), 56, (248, 2), 561);
- Table.States (388).Kernel := To_Vector ((0 => ((248, 2), 26, 3,
(2147483647, 0), 0)));
- Table.States (388).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (248, 2), 56, 561)));
- Table.States (389).Action_List.Set_Capacity (1);
- Add_Action (Table.States (389), 41, (244, 0), 562);
- Table.States (389).Kernel := To_Vector ((0 => ((244, 0), 40, 1,
(2147483647, 0), 0)));
- Table.States (389).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (244, 0), 41, 562)));
- Table.States (390).Action_List.Set_Capacity (1);
- Add_Action (Table.States (390), 56, (248, 1), 563);
- Table.States (390).Kernel := To_Vector ((0 => ((248, 1), 117, 3,
(2147483647, 0), 0)));
- Table.States (390).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (248, 1), 56, 563)));
- Table.States (391).Action_List.Set_Capacity (5);
- Add_Action (Table.States (391), 7, (117, 0), 564);
- Add_Action (Table.States (391), 81, (242, 8), 31);
- Add_Action (Table.States (391), 107, (242, 5), 120);
- Add_Action (Table.States (391), 108, (242, 7), 34);
- Add_Action (Table.States (391), 109, (242, 6), 35);
- Table.States (391).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (391), 131, 42);
- Add_Goto (Table.States (391), 242, 565);
- Add_Goto (Table.States (391), 275, 93);
- Add_Goto (Table.States (391), 296, 98);
- Table.States (391).Kernel := To_Vector ((((117, 0), 244, 2,
(2147483647, 0), 0), ((117, 1), 244, 3,
- (2147483647, 0), 0), ((117, 2), 244, 2, (2147483647, 0), 0),
((248, 0), 244, 4, (2147483647, 0),
- 0)));
- Table.States (391).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (117, 0), 7, 564)));
- Table.States (392).Action_List.Set_Capacity (1);
- Add_Action (Table.States (392), 24, (136, 1), 566);
- Table.States (392).Kernel := To_Vector ((0 => ((136, 1), 221, 2,
(2147483647, 0), 0)));
- Table.States (392).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (136, 1), 24, 566)));
- Table.States (393).Action_List.Set_Capacity (2);
- Add_Action (Table.States (393), 24, Reduce, (221, 1), 1, null,
null);
- Add_Action (Table.States (393), 26, (221, 0), 567);
- Table.States (393).Kernel := To_Vector ((((221, 0), 303, 1,
(2147483647, 0), 0), ((221, 1), 303, 0,
- (221, 1), 1)));
- Table.States (393).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (221, 1), 1)));
- Table.States (394).Action_List.Set_Capacity (18);
- Add_Action (Table.States (394), (13, 24, 25, 28, 29, 30, 40, 46,
47, 48, 49, 50, 51, 63, 66, 69, 71, 107),
- (161, 2), 1, null, null);
- Table.States (394).Kernel := To_Vector ((0 => ((161, 2), 160, 0,
(161, 2), 1)));
- Table.States (394).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (161, 2), 1)));
- Table.States (395).Action_List.Set_Capacity (18);
- Add_Action (Table.States (395), 13, Reduce, (162, 0), 1, null,
null);
- Add_Action (Table.States (395), 24, Reduce, (162, 0), 1, null,
null);
- Add_Action (Table.States (395), 25, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (395), 28, (124, 0), 185);
- Add_Action (Table.States (395), 29, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (395), 30, (213, 0), 8);
- Add_Action (Table.States (395), 40, (249, 0), 12);
- Add_Action (Table.States (395), 46, (249, 1), 14);
- Add_Action (Table.States (395), 47, (216, 0), 15);
- Add_Action (Table.States (395), 48, (260, 0), 16);
- Add_Action (Table.States (395), 49, Reduce, (162, 0), 1, null,
null);
- Add_Action (Table.States (395), 50, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (395), 51, (267, 0), 19);
- Add_Action (Table.States (395), 63, (316, 0), 25);
- Add_Action (Table.States (395), 66, (308, 0), 26);
- Add_Action (Table.States (395), 69, (209, 0), 27);
- Add_Action (Table.States (395), 71, (334, 0), 28);
- Add_Action (Table.States (395), 107, (222, 1), 187);
- Table.States (395).Goto_List.Set_Capacity (51);
- Add_Goto (Table.States (395), 115, 36);
- Add_Goto (Table.States (395), 124, 38);
- Add_Goto (Table.States (395), 130, 41);
- Add_Goto (Table.States (395), 137, 46);
- Add_Goto (Table.States (395), 138, 47);
- Add_Goto (Table.States (395), 160, 568);
- Add_Goto (Table.States (395), 182, 55);
- Add_Goto (Table.States (395), 185, 56);
- Add_Goto (Table.States (395), 189, 57);
- Add_Goto (Table.States (395), 196, 59);
- Add_Goto (Table.States (395), 209, 61);
- Add_Goto (Table.States (395), 210, 62);
- Add_Goto (Table.States (395), 212, 63);
- Add_Goto (Table.States (395), 213, 64);
- Add_Goto (Table.States (395), 216, 65);
- Add_Goto (Table.States (395), 217, 66);
- Add_Goto (Table.States (395), 218, 67);
- Add_Goto (Table.States (395), 219, 68);
- Add_Goto (Table.States (395), 222, 70);
- Add_Goto (Table.States (395), 226, 72);
- Add_Goto (Table.States (395), 246, 75);
- Add_Goto (Table.States (395), 247, 76);
- Add_Goto (Table.States (395), 248, 77);
- Add_Goto (Table.States (395), 249, 78);
- Add_Goto (Table.States (395), 250, 79);
- Add_Goto (Table.States (395), 251, 80);
- Add_Goto (Table.States (395), 252, 81);
- Add_Goto (Table.States (395), 253, 82);
- Add_Goto (Table.States (395), 254, 83);
- Add_Goto (Table.States (395), 260, 569);
- Add_Goto (Table.States (395), 262, 85);
- Add_Goto (Table.States (395), 263, 86);
- Add_Goto (Table.States (395), 265, 88);
- Add_Goto (Table.States (395), 266, 89);
- Add_Goto (Table.States (395), 267, 90);
- Add_Goto (Table.States (395), 268, 91);
- Add_Goto (Table.States (395), 274, 92);
- Add_Goto (Table.States (395), 284, 95);
- Add_Goto (Table.States (395), 292, 96);
- Add_Goto (Table.States (395), 307, 103);
- Add_Goto (Table.States (395), 308, 104);
- Add_Goto (Table.States (395), 310, 106);
- Add_Goto (Table.States (395), 311, 107);
- Add_Goto (Table.States (395), 312, 108);
- Add_Goto (Table.States (395), 314, 109);
- Add_Goto (Table.States (395), 316, 110);
- Add_Goto (Table.States (395), 319, 112);
- Add_Goto (Table.States (395), 320, 113);
- Add_Goto (Table.States (395), 322, 114);
- Add_Goto (Table.States (395), 328, 116);
- Add_Goto (Table.States (395), 334, 117);
- Table.States (395).Kernel := To_Vector ((((161, 0), 161, 3,
(2147483647, 0), 0), ((161, 1), 161, 3,
- (2147483647, 0), 0), ((162, 0), 161, 0, (162, 0), 1)));
- Table.States (395).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (162, 0), 1)));
- Table.States (396).Action_List.Set_Capacity (1);
- Add_Action (Table.States (396), 13, (136, 0), 570);
- Table.States (396).Kernel := To_Vector ((0 => ((136, 0), 162, 3,
(2147483647, 0), 0)));
- Table.States (396).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (136, 0), 13, 570)));
- Table.States (397).Action_List.Set_Capacity (18);
- Add_Action (Table.States (397), (13, 24, 25, 28, 29, 30, 40, 46,
47, 48, 49, 50, 51, 63, 66, 69, 71, 107),
- (161, 3), 1, null, null);
- Table.States (397).Kernel := To_Vector ((0 => ((161, 3), 260, 0,
(161, 3), 1)));
- Table.States (397).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (161, 3), 1)));
- Table.States (398).Action_List.Set_Capacity (3);
- Add_Action (Table.States (398), 33, (233, 2), 314);
- Add_Action (Table.States (398), 42, (233, 3), 315);
- Add_Action (Table.States (398), 84, (233, 0), 316);
- Table.States (398).Kernel := To_Vector ((((233, 0), 107, 5,
(2147483647, 0), 0), ((233, 1), 107, 4,
- (2147483647, 0), 0), ((233, 2), 107, 3, (2147483647, 0), 0),
((233, 3), 107, 3, (2147483647, 0), 0),
- ((233, 4), 107, 2, (2147483647, 0), 0), ((233, 5), 107, 2,
(2147483647, 0), 0)));
- Table.States (398).Minimal_Complete_Actions := To_Vector (((Shift,
(233, 3), 42, 315), (Shift, (233, 2),
- 33, 314)));
- Table.States (399).Action_List.Set_Capacity (1);
- Add_Action (Table.States (399), 24, (235, 1), 571);
- Table.States (399).Kernel := To_Vector ((0 => ((235, 1), 303, 3,
(2147483647, 0), 0)));
- Table.States (399).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (235, 1), 24, 571)));
- Table.States (400).Action_List.Set_Capacity (24);
- Add_Action (Table.States (400), 4, (116, 0), 1);
- Add_Action (Table.States (400), 5, (306, 8), 2);
- Add_Action (Table.States (400), 13, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (400), 15, (142, 0), 3);
- Add_Action (Table.States (400), 17, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (400), 18, (164, 0), 4);
- Add_Action (Table.States (400), 24, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (400), 27, (193, 0), 5);
- Add_Action (Table.States (400), 28, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (400), 31, (306, 3), 9);
- Add_Action (Table.States (400), 32, (225, 0), 10);
- Add_Action (Table.States (400), 37, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (400), 41, (306, 0), 13);
- Add_Action (Table.States (400), 48, (260, 0), 16);
- Add_Action (Table.States (400), 52, (279, 0), 20);
- Add_Action (Table.States (400), 57, (293, 0), 21);
- Add_Action (Table.States (400), 58, (199, 0), 22);
- Add_Action (Table.States (400), 61, (129, 0), 24);
- Add_Action (Table.States (400), 73, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (400), 81, (242, 8), 31);
- Add_Action (Table.States (400), 96, (220, 0), 32);
- Add_Action (Table.States (400), 107, (134, 0), 363);
- Add_Action (Table.States (400), 108, (242, 7), 34);
- Add_Action (Table.States (400), 109, (242, 6), 35);
- Table.States (400).Goto_List.Set_Capacity (31);
- Add_Goto (Table.States (400), 116, 37);
- Add_Goto (Table.States (400), 126, 39);
- Add_Goto (Table.States (400), 129, 40);
- Add_Goto (Table.States (400), 131, 42);
- Add_Goto (Table.States (400), 134, 43);
- Add_Goto (Table.States (400), 135, 44);
- Add_Goto (Table.States (400), 136, 45);
- Add_Goto (Table.States (400), 142, 48);
- Add_Goto (Table.States (400), 154, 51);
- Add_Goto (Table.States (400), 155, 52);
- Add_Goto (Table.States (400), 164, 54);
- Add_Goto (Table.States (400), 193, 58);
- Add_Goto (Table.States (400), 199, 60);
- Add_Goto (Table.States (400), 220, 69);
- Add_Goto (Table.States (400), 225, 71);
- Add_Goto (Table.States (400), 235, 73);
- Add_Goto (Table.States (400), 242, 74);
- Add_Goto (Table.States (400), 260, 84);
- Add_Goto (Table.States (400), 264, 87);
- Add_Goto (Table.States (400), 275, 93);
- Add_Goto (Table.States (400), 279, 94);
- Add_Goto (Table.States (400), 293, 97);
- Add_Goto (Table.States (400), 296, 98);
- Add_Goto (Table.States (400), 297, 99);
- Add_Goto (Table.States (400), 301, 100);
- Add_Goto (Table.States (400), 302, 364);
- Add_Goto (Table.States (400), 303, 572);
- Add_Goto (Table.States (400), 305, 101);
- Add_Goto (Table.States (400), 306, 102);
- Add_Goto (Table.States (400), 309, 366);
- Add_Goto (Table.States (400), 326, 115);
- Table.States (400).Kernel := To_Vector ((0 => ((235, 0), 37, 3,
(2147483647, 0), 0)));
- Table.States (400).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (303, 1), 0)));
- Table.States (401).Action_List.Set_Capacity (6);
- Add_Action (Table.States (401), 35, Reduce, (125, 1), 0, null,
null);
- Add_Action (Table.States (401), 74, (125, 0), 340);
- Add_Action (Table.States (401), 76, (118, 0), 237);
- Add_Action (Table.States (401), 87, (296, 0), 239);
- Add_Action (Table.States (401), 104, (325, 0), 241);
- Add_Action (Table.States (401), 105, (325, 1), 242);
- Table.States (401).Goto_List.Set_Capacity (3);
- Add_Goto (Table.States (401), 118, 243);
- Add_Goto (Table.States (401), 125, 341);
- Add_Goto (Table.States (401), 325, 244);
- Table.States (401).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((242, 0), 242, 5,
- (2147483647, 0), 0), ((242, 1), 242, 2, (2147483647, 0), 0),
((254, 0), 242, 3, (2147483647, 0), 0),
- ((254, 1), 242, 2, (2147483647, 0), 0), ((275, 0), 242, 3,
(2147483647, 0), 0), ((296, 0), 242, 2,
- (2147483647, 0), 0), ((296, 1), 242, 2, (2147483647, 0), 0),
((296, 2), 242, 2, (2147483647, 0), 0),
- ((296, 3), 242, 2, (2147483647, 0), 0)));
- Table.States (401).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (402).Action_List.Set_Capacity (41);
- Add_Action (Table.States (402), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (217, 0), 3,
- generic_package_declaration_0'Access, null);
- Table.States (402).Kernel := To_Vector ((0 => ((217, 0), 99, 0,
(217, 0), 3)));
- Table.States (402).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (217, 0), 3)));
- Table.States (403).Action_List.Set_Capacity (1);
- Add_Action (Table.States (403), 99, (219, 0), 573);
- Table.States (403).Kernel := To_Vector ((0 => ((219, 0), 125, 1,
(2147483647, 0), 0)));
- Table.States (403).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (219, 0), 99, 573)));
- Table.States (404).Action_List.Set_Capacity (15);
- Add_Action (Table.States (404), (7, 11, 16, 21, 33, 40, 45, 74,
78, 81, 85, 99, 107, 108, 109), (121, 0),
- 1, null, null);
- Table.States (404).Kernel := To_Vector ((0 => ((121, 0), 8, 0,
(121, 0), 1)));
- Table.States (404).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (121, 0), 1)));
- Table.States (405).Action_List.Set_Capacity (1);
- Add_Action (Table.States (405), 85, (160, 9), 574);
- Table.States (405).Kernel := To_Vector ((0 => ((160, 9), 16, 2,
(2147483647, 0), 0)));
- Table.States (405).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (160, 9), 85, 574)));
- Table.States (406).Action_List.Set_Capacity (1);
- Add_Action (Table.States (406), 99, (189, 0), 575);
- Table.States (406).Kernel := To_Vector ((0 => ((189, 0), 26, 1,
(2147483647, 0), 0)));
- Table.States (406).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (189, 0), 99, 575)));
- Table.States (407).Action_List.Set_Capacity (11);
- Add_Action (Table.States (407), 7, Reduce, (157, 1), 0, null,
null);
- Add_Action (Table.States (407), 11, Reduce, (157, 1), 0, null,
null);
- Add_Action (Table.States (407), 16, (157, 0), 576);
- Add_Action (Table.States (407), 40, Reduce, (157, 1), 0, null,
null);
- Add_Action (Table.States (407), 74, Reduce, (157, 1), 0, null,
null);
- Add_Action (Table.States (407), 81, Reduce, (157, 1), 0, null,
null);
- Add_Action (Table.States (407), 85, Reduce, (157, 1), 0, null,
null);
- Add_Action (Table.States (407), 99, Reduce, (157, 1), 0, null,
null);
- Add_Action (Table.States (407), 107, Reduce, (157, 1), 0, null,
null);
- Add_Action (Table.States (407), 108, Reduce, (157, 1), 0, null,
null);
- Add_Action (Table.States (407), 109, Reduce, (157, 1), 0, null,
null);
- Table.States (407).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (407), 157, 577);
- Table.States (407).Kernel := To_Vector ((((247, 0), 121, 3,
(2147483647, 0), 0), ((247, 1), 121, 4,
- (2147483647, 0), 0), ((247, 2), 121, 10, (2147483647, 0), 0),
((247, 3), 121, 2, (2147483647, 0),
- 0), ((247, 4), 121, 3, (2147483647, 0), 0), ((247, 5), 121,
9, (2147483647, 0), 0)));
- Table.States (407).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (157, 1), 0)));
- Table.States (408).Action_List.Set_Capacity (2);
- Add_Action (Table.States (408), (84, 86), (222, 0), 3,
identifier_list_0'Access, null);
- Table.States (408).Kernel := To_Vector ((0 => ((222, 0), 107, 0,
(222, 0), 3)));
- Table.States (408).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (222, 0), 3)));
- Table.States (409).Action_List.Set_Capacity (2);
- Add_Action (Table.States (409), 78, (118, 0), 578);
- Add_Action (Table.States (409), 86, (128, 0), 448);
- Table.States (409).Kernel := To_Vector ((((118, 0), 128, 1,
(2147483647, 0), 0), ((128, 0), 128, 1,
- (2147483647, 0), 0)));
- Table.States (409).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (118, 0), 78, 578)));
- Table.States (410).Action_List.Set_Capacity (1);
- Add_Action (Table.States (410), 78, (118, 1), 579);
- Table.States (410).Kernel := To_Vector ((0 => ((118, 1), 156, 1,
(2147483647, 0), 0)));
- Table.States (410).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (118, 1), 78, 579)));
- Table.States (411).Action_List.Set_Capacity (7);
- Add_Action (Table.States (411), 35, Reduce, (127, 4), 1,
association_opt_4'Access, null);
- Add_Action (Table.States (411), 78, Reduce, (127, 4), 1,
association_opt_4'Access, null);
- Add_Action (Table.States (411), 79, Reduce, (127, 4), 1,
association_opt_4'Access, null);
- Add_Action (Table.States (411), 82, Reduce, (168, 0), 1, null,
null);
- Add_Action (Table.States (411), 86, Reduce, (127, 4), 1,
association_opt_4'Access, null);
- Add_Action (Table.States (411), 90, Reduce, (168, 0), 1, null,
null);
- Add_Action (Table.States (411), 99, Reduce, (127, 4), 1,
association_opt_4'Access, null);
- Table.States (411).Kernel := To_Vector ((((127, 4), 194, 0,
(127, 4), 1), ((168, 0), 194, 0, (168, 0),
- 1)));
- Table.States (411).Minimal_Complete_Actions := To_Vector
(((Reduce, (127, 4), 1), (Reduce, (168, 0),
- 1)));
- Table.States (412).Action_List.Set_Capacity (4);
- Add_Action (Table.States (412), 78, Reduce, (281, 1), 1, null,
null);
- Add_Action (Table.States (412), 82, Reduce, (168, 2), 1, null,
null);
- Add_Action (Table.States (412), 86, Reduce, (281, 1), 1, null,
null);
- Add_Action (Table.States (412), 90, Reduce, (168, 2), 1, null,
null);
- Table.States (412).Kernel := To_Vector ((((168, 2), 280, 0,
(168, 2), 1), ((281, 1), 280, 0, (281, 1),
- 1)));
- Table.States (412).Minimal_Complete_Actions := To_Vector
(((Reduce, (168, 2), 1), (Reduce, (281, 1),
- 1)));
- Table.States (413).Action_List.Set_Capacity (2);
- Add_Action (Table.States (413), 78, (242, 0), 580);
- Add_Action (Table.States (413), 86, (281, 0), 581);
- Table.States (413).Kernel := To_Vector ((((242, 0), 281, 1,
(2147483647, 0), 0), ((281, 0), 281, 4,
- (2147483647, 0), 0)));
- Table.States (414).Action_List.Set_Capacity (1);
- Add_Action (Table.States (414), 99, (126, 0), 582);
- Table.States (414).Kernel := To_Vector ((0 => ((126, 0), 195, 1,
(2147483647, 0), 0)));
- Table.States (414).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (126, 0), 99, 582)));
- Table.States (415).Action_List.Set_Capacity (65);
- Add_Action (Table.States (415), (4, 5, 10, 13, 15, 17, 18, 20, 21,
22, 23, 27, 28, 31, 32, 33, 35, 37, 38,
- 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74,
75, 76, 78, 79, 80, 81, 82, 85, 86, 87, 88,
- 89, 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104,
105, 107, 108, 109), (296, 3), 3,
- selected_component_3'Access, null);
- Table.States (415).Kernel := To_Vector ((0 => ((296, 3), 9, 0,
(296, 3), 3)));
- Table.States (415).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (296, 3), 3)));
- Table.States (416).Action_List.Set_Capacity (65);
- Add_Action (Table.States (416), (4, 5, 10, 13, 15, 17, 18, 20, 21,
22, 23, 27, 28, 31, 32, 33, 35, 37, 38,
- 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74,
75, 76, 78, 79, 80, 81, 82, 85, 86, 87, 88,
- 89, 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104,
105, 107, 108, 109), (296, 0), 3,
- selected_component_0'Access, selected_component_0_check'Access);
- Table.States (416).Kernel := To_Vector ((0 => ((296, 0), 107, 0,
(296, 0), 3)));
- Table.States (416).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (296, 0), 3)));
- Table.States (417).Action_List.Set_Capacity (65);
- Add_Action (Table.States (417), (4, 5, 10, 13, 15, 17, 18, 20, 21,
22, 23, 27, 28, 31, 32, 33, 35, 37, 38,
- 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74,
75, 76, 78, 79, 80, 81, 82, 85, 86, 87, 88,
- 89, 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104,
105, 107, 108, 109), (296, 2), 3,
- selected_component_2'Access, selected_component_2_check'Access);
- Table.States (417).Kernel := To_Vector ((0 => ((296, 2), 108, 0,
(296, 2), 3)));
- Table.States (417).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (296, 2), 3)));
- Table.States (418).Action_List.Set_Capacity (65);
- Add_Action (Table.States (418), (4, 5, 10, 13, 15, 17, 18, 20, 21,
22, 23, 27, 28, 31, 32, 33, 35, 37, 38,
- 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74,
75, 76, 78, 79, 80, 81, 82, 85, 86, 87, 88,
- 89, 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104,
105, 107, 108, 109), (296, 1), 3,
- selected_component_1'Access, null);
- Table.States (418).Kernel := To_Vector ((0 => ((296, 1), 109, 0,
(296, 1), 3)));
- Table.States (418).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (296, 1), 3)));
- Table.States (419).Action_List.Set_Capacity (65);
- Add_Action (Table.States (419), (4, 5, 10, 13, 15, 17, 18, 20, 21,
22, 23, 27, 28, 31, 32, 33, 35, 37, 38,
- 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74,
75, 76, 78, 79, 80, 81, 82, 85, 86, 87, 88,
- 89, 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104,
105, 107, 108, 109), (132, 2), 1, null,
- null);
- Table.States (419).Kernel := To_Vector ((0 => ((132, 2), 7, 0,
(132, 2), 1)));
- Table.States (419).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (132, 2), 1)));
- Table.States (420).Action_List.Set_Capacity (65);
- Add_Action (Table.States (420), (4, 5, 10, 13, 15, 17, 18, 20, 21,
22, 23, 27, 28, 31, 32, 33, 35, 37, 38,
- 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74,
75, 76, 78, 79, 80, 81, 82, 85, 86, 87, 88,
- 89, 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104,
105, 107, 108, 109), (132, 3), 1, null,
- null);
- Table.States (420).Kernel := To_Vector ((0 => ((132, 3), 19, 0,
(132, 3), 1)));
- Table.States (420).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (132, 3), 1)));
- Table.States (421).Action_List.Set_Capacity (65);
- Add_Action (Table.States (421), (4, 5, 10, 13, 15, 17, 18, 20, 21,
22, 23, 27, 28, 31, 32, 33, 35, 37, 38,
- 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74,
75, 76, 78, 79, 80, 81, 82, 85, 86, 87, 88,
- 89, 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104,
105, 107, 108, 109), (132, 4), 1, null,
- null);
- Table.States (421).Kernel := To_Vector ((0 => ((132, 4), 20, 0,
(132, 4), 1)));
- Table.States (421).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (132, 4), 1)));
- Table.States (422).Action_List.Set_Capacity (65);
- Add_Action (Table.States (422), (4, 5, 10, 13, 15, 17, 18, 20, 21,
22, 23, 27, 28, 31, 32, 33, 35, 37, 38,
- 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74,
75, 76, 78, 79, 80, 81, 82, 85, 86, 87, 88,
- 89, 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104,
105, 107, 108, 109), (132, 5), 1, null,
- null);
- Table.States (422).Kernel := To_Vector ((0 => ((132, 5), 38, 0,
(132, 5), 1)));
- Table.States (422).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (132, 5), 1)));
- Table.States (423).Action_List.Set_Capacity (65);
- Add_Action (Table.States (423), 4, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 5, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 10, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 13, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 15, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 17, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 18, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 20, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 21, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 22, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 23, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 27, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 28, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 31, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 32, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 33, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 35, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 37, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 38, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 40, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 41, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 42, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 43, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 48, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 52, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 53, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 55, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 56, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 57, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 58, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 61, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 68, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 71, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 73, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 74, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 75, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 76, (132, 0), 583);
- Add_Conflict (Table.States (423), 76, (132, 1), 1, null, null);
- Add_Action (Table.States (423), 78, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 79, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 80, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 81, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 82, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 85, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 86, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 87, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 88, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 89, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 90, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 91, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 92, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 94, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 95, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 96, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 97, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 98, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 99, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 100, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 101, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 102, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 103, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 104, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 105, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 107, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 108, Reduce, (132, 1), 1, null,
null);
- Add_Action (Table.States (423), 109, Reduce, (132, 1), 1, null,
null);
- Table.States (423).Kernel := To_Vector ((((132, 0), 107, 3,
(2147483647, 0), 0), ((132, 1), 107, 0,
- (132, 1), 1)));
- Table.States (423).Minimal_Complete_Actions := To_Vector (((Shift,
(132, 0), 76, 583), (Reduce, (132, 1),
- 1)));
- end Subr_8;
- procedure Subr_9
- is begin
- Table.States (424).Action_List.Set_Capacity (65);
- Add_Action (Table.States (424), (4, 5, 10, 13, 15, 17, 18, 20, 21,
22, 23, 27, 28, 31, 32, 33, 35, 37, 38,
- 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74,
75, 76, 78, 79, 80, 81, 82, 85, 86, 87, 88,
- 89, 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104,
105, 107, 108, 109), (275, 0), 3,
- qualified_expression_0'Access, null);
- Table.States (424).Kernel := To_Vector ((0 => ((275, 0), 120, 0,
(275, 0), 3)));
- Table.States (424).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (275, 0), 3)));
- Table.States (425).Action_List.Set_Capacity (65);
- Add_Action (Table.States (425), (4, 5, 10, 13, 15, 17, 18, 20, 21,
22, 23, 27, 28, 31, 32, 33, 35, 37, 38,
- 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74,
75, 76, 78, 79, 80, 81, 82, 85, 86, 87, 88,
- 89, 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104,
105, 107, 108, 109), (131, 0), 3, null,
- null);
- Table.States (425).Kernel := To_Vector ((0 => ((131, 0), 132, 0,
(131, 0), 3)));
- Table.States (425).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (131, 0), 3)));
- Table.States (426).Action_List.Set_Capacity (3);
- Add_Action (Table.States (426), 74, Reduce, (256, 1), 0, null,
null);
- Add_Action (Table.States (426), 76, (182, 0), 584);
- Add_Action (Table.States (426), 99, Reduce, (256, 1), 0, null,
null);
- Table.States (426).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (426), 202, 347);
- Add_Goto (Table.States (426), 256, 585);
- Table.States (426).Kernel := To_Vector ((((182, 0), 107, 4,
(2147483647, 0), 0), ((182, 1), 107, 1,
- (2147483647, 0), 0)));
- Table.States (426).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (256, 1), 0)));
- Table.States (427).Action_List.Set_Capacity (6);
- Add_Action (Table.States (427), 35, (216, 2), 586);
- Add_Action (Table.States (427), 58, (294, 0), 320);
- Add_Action (Table.States (427), 76, (118, 0), 321);
- Add_Action (Table.States (427), 87, (296, 0), 239);
- Add_Action (Table.States (427), 104, (325, 0), 241);
- Add_Action (Table.States (427), 105, (325, 1), 242);
- Table.States (427).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (427), 118, 243);
- Add_Goto (Table.States (427), 202, 322);
- Add_Goto (Table.States (427), 255, 323);
- Add_Goto (Table.States (427), 294, 324);
- Add_Goto (Table.States (427), 325, 244);
- Table.States (427).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((210, 0), 242, 1,
- (2147483647, 0), 0), ((216, 2), 242, 4, (2147483647, 0), 0),
((242, 0), 242, 5, (2147483647, 0), 0),
- ((242, 1), 242, 2, (2147483647, 0), 0), ((275, 0), 242, 3,
(2147483647, 0), 0), ((296, 0), 242, 2,
- (2147483647, 0), 0), ((296, 1), 242, 2, (2147483647, 0), 0),
((296, 2), 242, 2, (2147483647, 0), 0),
- ((296, 3), 242, 2, (2147483647, 0), 0)));
- Table.States (427).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (294, 0), 58, 320)));
- Table.States (428).Action_List.Set_Capacity (8);
- Add_Action (Table.States (428), 35, (216, 1), 587);
- Add_Conflict (Table.States (428), 35, (256, 1), 0, null, null);
- Add_Action (Table.States (428), 56, Reduce, (256, 1), 0, null,
null);
- Add_Action (Table.States (428), 74, Reduce, (256, 1), 0, null,
null);
- Add_Action (Table.States (428), 76, (118, 0), 321);
- Add_Action (Table.States (428), 87, (296, 0), 239);
- Add_Action (Table.States (428), 99, Reduce, (256, 1), 0, null,
null);
- Add_Action (Table.States (428), 104, (325, 0), 241);
- Add_Action (Table.States (428), 105, (325, 1), 242);
- Table.States (428).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (428), 118, 243);
- Add_Goto (Table.States (428), 202, 347);
- Add_Goto (Table.States (428), 256, 348);
- Add_Goto (Table.States (428), 325, 244);
- Table.States (428).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((216, 1), 242, 4,
- (2147483647, 0), 0), ((242, 0), 242, 5, (2147483647, 0), 0),
((242, 1), 242, 2, (2147483647, 0), 0),
- ((265, 0), 242, 0, (256, 1), 0), ((275, 0), 242, 3,
(2147483647, 0), 0), ((296, 0), 242, 2,
- (2147483647, 0), 0), ((296, 1), 242, 2, (2147483647, 0), 0),
((296, 2), 242, 2, (2147483647, 0), 0),
- ((296, 3), 242, 2, (2147483647, 0), 0)));
- Table.States (428).Minimal_Complete_Actions := To_Vector (((Shift,
(216, 1), 35, 587), (Reduce, (256, 1),
- 0)));
- Table.States (429).Action_List.Set_Capacity (2);
- Add_Action (Table.States (429), 76, (120, 0), 588);
- Add_Action (Table.States (429), 77, (120, 5), 128);
- Table.States (429).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (429), 120, 589);
- Add_Goto (Table.States (429), 259, 590);
- Table.States (429).Kernel := To_Vector ((0 => ((196, 0), 35, 3,
(2147483647, 0), 0)));
- Table.States (429).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (120, 0), 76, 588)));
- Table.States (430).Action_List.Set_Capacity (1);
- Add_Action (Table.States (430), 41, (246, 0), 591);
- Table.States (430).Kernel := To_Vector ((0 => ((246, 0), 35, 2,
(2147483647, 0), 0)));
- Table.States (430).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (246, 0), 41, 591)));
- Table.States (431).Action_List.Set_Capacity (2);
- Add_Action (Table.States (431), 6, (115, 0), 592);
- Add_Action (Table.States (431), 60, (311, 0), 593);
- Table.States (431).Kernel := To_Vector ((((115, 0), 35, 2,
(2147483647, 0), 0), ((311, 0), 35, 2,
- (2147483647, 0), 0)));
- Table.States (431).Minimal_Complete_Actions := To_Vector (((Shift,
(115, 0), 6, 592), (Shift, (311, 0),
- 60, 593)));
- Table.States (432).Action_List.Set_Capacity (4);
- Add_Action (Table.States (432), 81, (242, 8), 31);
- Add_Action (Table.States (432), 107, (242, 5), 120);
- Add_Action (Table.States (432), 108, (242, 7), 34);
- Add_Action (Table.States (432), 109, (242, 6), 35);
- Table.States (432).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (432), 131, 42);
- Add_Goto (Table.States (432), 242, 594);
- Add_Goto (Table.States (432), 275, 93);
- Add_Goto (Table.States (432), 296, 98);
- Table.States (432).Kernel := To_Vector ((0 => ((314, 0), 56, 2,
(2147483647, 0), 0)));
- Table.States (432).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (433).Action_List.Set_Capacity (2);
- Add_Action (Table.States (433), 35, (310, 0), 595);
- Add_Action (Table.States (433), 99, (312, 0), 596);
- Table.States (433).Kernel := To_Vector ((((310, 0), 125, 4,
(2147483647, 0), 0), ((312, 0), 125, 1,
- (2147483647, 0), 0)));
- Table.States (433).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (312, 0), 99, 596)));
- Table.States (434).Action_List.Set_Capacity (3);
- Add_Action (Table.States (434), 78, Reduce, (257, 4), 0, null,
null);
- Add_Action (Table.States (434), 99, Reduce, (257, 4), 0, null,
null);
- Add_Action (Table.States (434), 107, (222, 1), 166);
- Table.States (434).Goto_List.Set_Capacity (3);
- Add_Goto (Table.States (434), 222, 500);
- Add_Goto (Table.States (434), 257, 501);
- Add_Goto (Table.States (434), 258, 502);
- Table.States (434).Kernel := To_Vector ((0 => ((202, 0), 76, 1,
(2147483647, 0), 0)));
- Table.States (434).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (258, 1), 0)));
- Table.States (435).Action_List.Set_Capacity (2);
- Add_Action (Table.States (435), 21, (116, 0), 597);
- Add_Action (Table.States (435), 99, (116, 1), 598);
- Table.States (435).Kernel := To_Vector ((((116, 0), 256, 3,
(2147483647, 0), 0), ((116, 1), 256, 1,
- (2147483647, 0), 0)));
- Table.States (435).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (116, 1), 99, 598)));
- Table.States (436).Action_List.Set_Capacity (32);
- Add_Action (Table.States (436), 3, (200, 2), 122);
- Add_Action (Table.States (436), 10, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (436), 20, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (436), 21, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (436), 22, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (436), 23, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (436), 35, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (436), 37, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (436), 39, (261, 4), 123);
- Add_Action (Table.States (436), 40, (200, 3), 124);
- Add_Action (Table.States (436), 41, (261, 1), 125);
- Add_Action (Table.States (436), 43, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (436), 52, (278, 0), 126);
- Add_Action (Table.States (436), 53, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (436), 68, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (436), 74, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (436), 75, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (436), 76, (120, 0), 127);
- Add_Action (Table.States (436), 77, (120, 5), 128);
- Add_Action (Table.States (436), 78, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (436), 79, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (436), 81, (242, 8), 31);
- Add_Action (Table.States (436), 82, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (436), 86, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (436), 90, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (436), 97, (333, 1), 129);
- Add_Action (Table.States (436), 98, (333, 0), 130);
- Add_Action (Table.States (436), 99, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (436), 106, (261, 0), 131);
- Add_Action (Table.States (436), 107, (242, 5), 120);
- Add_Action (Table.States (436), 108, (242, 7), 34);
- Add_Action (Table.States (436), 109, (242, 6), 35);
- Table.States (436).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (436), 120, 132);
- Add_Goto (Table.States (436), 131, 42);
- Add_Goto (Table.States (436), 194, 133);
- Add_Goto (Table.States (436), 195, 599);
- Add_Goto (Table.States (436), 200, 135);
- Add_Goto (Table.States (436), 242, 136);
- Add_Goto (Table.States (436), 261, 137);
- Add_Goto (Table.States (436), 275, 93);
- Add_Goto (Table.States (436), 278, 138);
- Add_Goto (Table.States (436), 285, 139);
- Add_Goto (Table.States (436), 286, 140);
- Add_Goto (Table.States (436), 287, 141);
- Add_Goto (Table.States (436), 288, 142);
- Add_Goto (Table.States (436), 289, 143);
- Add_Goto (Table.States (436), 290, 144);
- Add_Goto (Table.States (436), 296, 98);
- Add_Goto (Table.States (436), 304, 145);
- Add_Goto (Table.States (436), 323, 146);
- Add_Goto (Table.States (436), 324, 147);
- Add_Goto (Table.States (436), 333, 148);
- Table.States (436).Kernel := To_Vector ((0 => ((278, 0), 74, 0,
(195, 1), 0)));
- Table.States (436).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (437).Action_List.Set_Capacity (1);
- Add_Action (Table.States (437), 35, (139, 0), 600);
- Table.States (437).Kernel := To_Vector ((0 => ((139, 0), 195, 3,
(2147483647, 0), 0)));
- Table.States (437).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (139, 0), 35, 600)));
- Table.States (438).Action_List.Set_Capacity (1);
- Add_Action (Table.States (438), (1 => 107), (277, 0), 1, null,
null);
- Table.States (438).Kernel := To_Vector ((0 => ((277, 0), 9, 0,
(277, 0), 1)));
- Table.States (438).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (277, 0), 1)));
- Table.States (439).Action_List.Set_Capacity (1);
- Add_Action (Table.States (439), (1 => 107), (277, 1), 1, null,
null);
- Table.States (439).Kernel := To_Vector ((0 => ((277, 1), 62, 0,
(277, 1), 1)));
- Table.States (439).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (277, 1), 1)));
- Table.States (440).Action_List.Set_Capacity (3);
- Add_Action (Table.States (440), 33, (127, 6), 601);
- Add_Action (Table.States (440), 42, (233, 3), 315);
- Add_Action (Table.States (440), 84, (233, 0), 316);
- Table.States (440).Kernel := To_Vector ((((127, 6), 107, 3,
(2147483647, 0), 0), ((233, 0), 107, 5,
- (2147483647, 0), 0), ((233, 1), 107, 4, (2147483647, 0), 0),
((233, 2), 107, 3, (2147483647, 0), 0),
- ((233, 3), 107, 3, (2147483647, 0), 0), ((233, 4), 107, 2,
(2147483647, 0), 0), ((233, 5), 107, 2,
- (2147483647, 0), 0)));
- Table.States (440).Minimal_Complete_Actions := To_Vector (((Shift,
(233, 3), 42, 315), (Shift, (127, 6),
- 33, 601)));
- Table.States (441).Action_List.Set_Capacity (1);
- Add_Action (Table.States (441), 90, (127, 7), 602);
- Table.States (441).Kernel := To_Vector ((0 => ((127, 7), 233, 2,
(2147483647, 0), 0)));
- Table.States (441).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (127, 7), 90, 602)));
- Table.States (442).Action_List.Set_Capacity (1);
- Add_Action (Table.States (442), 107, (233, 0), 398);
- Table.States (442).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (442), 233, 603);
- Table.States (442).Kernel := To_Vector ((0 => ((276, 0), 277, 4,
(2147483647, 0), 0)));
- Table.States (442).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (233, 0), 107, 398)));
- Table.States (443).Action_List.Set_Capacity (1);
- Add_Action (Table.States (443), 68, (224, 0), 604);
- Table.States (443).Kernel := To_Vector ((((224, 0), 195, 4,
(2147483647, 0), 0), ((224, 1), 195, 2,
- (2147483647, 0), 0), ((224, 2), 195, 3, (2147483647, 0), 0),
((224, 3), 195, 1, (2147483647, 0),
- 0)));
- Table.States (443).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (224, 0), 68, 604)));
- Table.States (444).Action_List.Set_Capacity (31);
- Add_Action (Table.States (444), 10, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (444), 33, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (444), 35, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (444), 38, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (444), 40, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (444), 43, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (444), 55, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (444), 74, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (444), 75, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (444), 78, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (444), 79, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (444), 80, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (444), 81, (242, 8), 31);
- Add_Action (Table.States (444), 82, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (444), 86, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (444), 88, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (444), 89, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (444), 90, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (444), 91, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (444), 92, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (444), 94, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (444), 95, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (444), 97, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (444), 98, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (444), 99, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (444), 100, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (444), 101, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (444), 102, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (444), 107, (242, 5), 120);
- Add_Action (Table.States (444), 108, (242, 7), 34);
- Add_Action (Table.States (444), 109, (242, 6), 35);
- Table.States (444).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (444), 131, 42);
- Add_Goto (Table.States (444), 242, 605);
- Add_Goto (Table.States (444), 275, 93);
- Add_Goto (Table.States (444), 296, 98);
- Table.States (444).Kernel := To_Vector ((((168, 1), 41, 1,
(2147483647, 0), 0), ((261, 1), 41, 0,
- (261, 1), 1)));
- Table.States (444).Minimal_Complete_Actions := To_Vector (((Shift,
(242, 5), 107, 120), (Reduce, (261, 1),
- 1)));
- Table.States (445).Action_List.Set_Capacity (1);
- Add_Action (Table.States (445), 78, (120, 1), 606);
- Table.States (445).Kernel := To_Vector ((0 => ((120, 1), 54, 1,
(2147483647, 0), 0)));
- Table.States (445).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (120, 1), 78, 606)));
- Table.States (446).Action_List.Set_Capacity (20);
- Add_Action (Table.States (446), 3, (200, 2), 122);
- Add_Action (Table.States (446), 35, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (446), 39, (261, 4), 123);
- Add_Action (Table.States (446), 40, (200, 3), 124);
- Add_Action (Table.States (446), 41, (261, 1), 125);
- Add_Action (Table.States (446), 52, (278, 0), 126);
- Add_Action (Table.States (446), 76, (120, 0), 127);
- Add_Action (Table.States (446), 77, (120, 5), 128);
- Add_Action (Table.States (446), 78, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (446), 79, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (446), 81, (242, 8), 31);
- Add_Action (Table.States (446), 83, (127, 1), 607);
- Add_Action (Table.States (446), 86, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (446), 97, (333, 1), 129);
- Add_Action (Table.States (446), 98, (333, 0), 130);
- Add_Action (Table.States (446), 99, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (446), 106, (261, 0), 131);
- Add_Action (Table.States (446), 107, (242, 5), 120);
- Add_Action (Table.States (446), 108, (242, 7), 34);
- Add_Action (Table.States (446), 109, (242, 6), 35);
- Table.States (446).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (446), 120, 132);
- Add_Goto (Table.States (446), 131, 42);
- Add_Goto (Table.States (446), 194, 133);
- Add_Goto (Table.States (446), 195, 608);
- Add_Goto (Table.States (446), 200, 135);
- Add_Goto (Table.States (446), 242, 136);
- Add_Goto (Table.States (446), 261, 137);
- Add_Goto (Table.States (446), 275, 93);
- Add_Goto (Table.States (446), 278, 138);
- Add_Goto (Table.States (446), 285, 139);
- Add_Goto (Table.States (446), 286, 140);
- Add_Goto (Table.States (446), 287, 141);
- Add_Goto (Table.States (446), 288, 142);
- Add_Goto (Table.States (446), 289, 143);
- Add_Goto (Table.States (446), 290, 144);
- Add_Goto (Table.States (446), 296, 98);
- Add_Goto (Table.States (446), 304, 145);
- Add_Goto (Table.States (446), 323, 146);
- Add_Goto (Table.States (446), 324, 147);
- Add_Goto (Table.States (446), 333, 148);
- Table.States (446).Kernel := To_Vector ((((127, 0), 90, 0, (195,
1), 0), ((127, 1), 90, 1,
- (2147483647, 0), 0)));
- Table.States (446).Minimal_Complete_Actions := To_Vector
(((Reduce, (195, 1), 0), (Shift, (127, 1), 83,
- 607)));
- Table.States (447).Action_List.Set_Capacity (65);
- Add_Action (Table.States (447), (4, 5, 10, 13, 15, 17, 18, 20, 21,
22, 23, 27, 28, 31, 32, 33, 35, 37, 38,
- 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74,
75, 76, 78, 79, 80, 81, 82, 85, 86, 87, 88,
- 89, 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104,
105, 107, 108, 109), (120, 0), 3,
- aggregate_0'Access, null);
- Table.States (447).Kernel := To_Vector ((0 => ((120, 0), 78, 0,
(120, 0), 3)));
- Table.States (447).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (120, 0), 3)));
- Table.States (448).Action_List.Set_Capacity (23);
- Add_Action (Table.States (448), 3, (200, 2), 122);
- Add_Action (Table.States (448), 28, (127, 6), 521);
- Add_Action (Table.States (448), 35, Reduce, (127, 5), 0, null,
null);
- Add_Action (Table.States (448), 39, (261, 4), 123);
- Add_Action (Table.States (448), 40, (168, 1), 263);
- Add_Action (Table.States (448), 41, (261, 1), 125);
- Add_Action (Table.States (448), 44, (168, 3), 265);
- Add_Action (Table.States (448), 52, (278, 0), 126);
- Add_Action (Table.States (448), 76, (120, 0), 127);
- Add_Action (Table.States (448), 77, (120, 5), 128);
- Add_Action (Table.States (448), 78, Reduce, (127, 5), 0, null,
null);
- Add_Action (Table.States (448), 79, Reduce, (127, 5), 0, null,
null);
- Add_Action (Table.States (448), 81, (242, 8), 31);
- Add_Action (Table.States (448), 82, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (448), 86, Reduce, (127, 5), 0, null,
null);
- Add_Action (Table.States (448), 90, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (448), 97, (333, 1), 129);
- Add_Action (Table.States (448), 98, (333, 0), 130);
- Add_Action (Table.States (448), 99, Reduce, (127, 5), 0, null,
null);
- Add_Action (Table.States (448), 106, (261, 0), 131);
- Add_Action (Table.States (448), 107, (242, 5), 120);
- Add_Action (Table.States (448), 108, (242, 7), 34);
- Add_Action (Table.States (448), 109, (127, 0), 266);
- Table.States (448).Goto_List.Set_Capacity (23);
- Add_Goto (Table.States (448), 120, 132);
- Add_Goto (Table.States (448), 127, 609);
- Add_Goto (Table.States (448), 131, 42);
- Add_Goto (Table.States (448), 168, 271);
- Add_Goto (Table.States (448), 169, 272);
- Add_Goto (Table.States (448), 194, 411);
- Add_Goto (Table.States (448), 200, 135);
- Add_Goto (Table.States (448), 242, 276);
- Add_Goto (Table.States (448), 261, 137);
- Add_Goto (Table.States (448), 275, 93);
- Add_Goto (Table.States (448), 278, 138);
- Add_Goto (Table.States (448), 280, 278);
- Add_Goto (Table.States (448), 285, 139);
- Add_Goto (Table.States (448), 286, 140);
- Add_Goto (Table.States (448), 287, 141);
- Add_Goto (Table.States (448), 288, 142);
- Add_Goto (Table.States (448), 289, 143);
- Add_Goto (Table.States (448), 290, 144);
- Add_Goto (Table.States (448), 296, 98);
- Add_Goto (Table.States (448), 304, 279);
- Add_Goto (Table.States (448), 323, 146);
- Add_Goto (Table.States (448), 324, 147);
- Add_Goto (Table.States (448), 333, 148);
- Table.States (448).Kernel := To_Vector ((0 => ((128, 0), 86, 0,
(127, 5), 0)));
- Table.States (448).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (127, 5), 0)));
- Table.States (449).Action_List.Set_Capacity (65);
- Add_Action (Table.States (449), (4, 5, 10, 13, 15, 17, 18, 20, 21,
22, 23, 27, 28, 31, 32, 33, 35, 37, 38,
- 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74,
75, 76, 78, 79, 80, 81, 82, 85, 86, 87, 88,
- 89, 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104,
105, 107, 108, 109), (120, 6), 3,
- aggregate_6'Access, null);
- Table.States (449).Kernel := To_Vector ((0 => ((120, 6), 78, 0,
(120, 6), 3)));
- Table.States (449).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (120, 6), 3)));
- Table.States (450).Action_List.Set_Capacity (15);
- Add_Action (Table.States (450), 3, (200, 2), 122);
- Add_Action (Table.States (450), 39, (261, 4), 123);
- Add_Action (Table.States (450), 40, (168, 1), 263);
- Add_Action (Table.States (450), 41, (261, 1), 125);
- Add_Action (Table.States (450), 44, (168, 3), 265);
- Add_Action (Table.States (450), 52, (278, 0), 126);
- Add_Action (Table.States (450), 76, (120, 0), 127);
- Add_Action (Table.States (450), 77, (120, 5), 128);
- Add_Action (Table.States (450), 81, (242, 8), 31);
- Add_Action (Table.States (450), 97, (333, 1), 129);
- Add_Action (Table.States (450), 98, (333, 0), 130);
- Add_Action (Table.States (450), 106, (261, 0), 131);
- Add_Action (Table.States (450), 107, (242, 5), 120);
- Add_Action (Table.States (450), 108, (242, 7), 34);
- Add_Action (Table.States (450), 109, (242, 6), 35);
- Table.States (450).Goto_List.Set_Capacity (21);
- Add_Goto (Table.States (450), 120, 132);
- Add_Goto (Table.States (450), 131, 42);
- Add_Goto (Table.States (450), 168, 610);
- Add_Goto (Table.States (450), 194, 611);
- Add_Goto (Table.States (450), 200, 135);
- Add_Goto (Table.States (450), 242, 276);
- Add_Goto (Table.States (450), 261, 137);
- Add_Goto (Table.States (450), 275, 93);
- Add_Goto (Table.States (450), 278, 138);
- Add_Goto (Table.States (450), 280, 278);
- Add_Goto (Table.States (450), 285, 139);
- Add_Goto (Table.States (450), 286, 140);
- Add_Goto (Table.States (450), 287, 141);
- Add_Goto (Table.States (450), 288, 142);
- Add_Goto (Table.States (450), 289, 143);
- Add_Goto (Table.States (450), 290, 144);
- Add_Goto (Table.States (450), 296, 98);
- Add_Goto (Table.States (450), 304, 279);
- Add_Goto (Table.States (450), 323, 146);
- Add_Goto (Table.States (450), 324, 147);
- Add_Goto (Table.States (450), 333, 148);
- Table.States (450).Kernel := To_Vector ((0 => ((169, 0), 82, 1,
(2147483647, 0), 0)));
- Table.States (450).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (451).Action_List.Set_Capacity (20);
- Add_Action (Table.States (451), 3, (200, 2), 122);
- Add_Action (Table.States (451), 35, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (451), 39, (261, 4), 123);
- Add_Action (Table.States (451), 40, (200, 3), 124);
- Add_Action (Table.States (451), 41, (261, 1), 125);
- Add_Action (Table.States (451), 52, (278, 0), 126);
- Add_Action (Table.States (451), 76, (120, 0), 127);
- Add_Action (Table.States (451), 77, (120, 5), 128);
- Add_Action (Table.States (451), 78, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (451), 79, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (451), 81, (242, 8), 31);
- Add_Action (Table.States (451), 83, (127, 3), 612);
- Add_Action (Table.States (451), 86, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (451), 97, (333, 1), 129);
- Add_Action (Table.States (451), 98, (333, 0), 130);
- Add_Action (Table.States (451), 99, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (451), 106, (261, 0), 131);
- Add_Action (Table.States (451), 107, (242, 5), 120);
- Add_Action (Table.States (451), 108, (242, 7), 34);
- Add_Action (Table.States (451), 109, (242, 6), 35);
- Table.States (451).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (451), 120, 132);
- Add_Goto (Table.States (451), 131, 42);
- Add_Goto (Table.States (451), 194, 133);
- Add_Goto (Table.States (451), 195, 613);
- Add_Goto (Table.States (451), 200, 135);
- Add_Goto (Table.States (451), 242, 136);
- Add_Goto (Table.States (451), 261, 137);
- Add_Goto (Table.States (451), 275, 93);
- Add_Goto (Table.States (451), 278, 138);
- Add_Goto (Table.States (451), 285, 139);
- Add_Goto (Table.States (451), 286, 140);
- Add_Goto (Table.States (451), 287, 141);
- Add_Goto (Table.States (451), 288, 142);
- Add_Goto (Table.States (451), 289, 143);
- Add_Goto (Table.States (451), 290, 144);
- Add_Goto (Table.States (451), 296, 98);
- Add_Goto (Table.States (451), 304, 145);
- Add_Goto (Table.States (451), 323, 146);
- Add_Goto (Table.States (451), 324, 147);
- Add_Goto (Table.States (451), 333, 148);
- Table.States (451).Kernel := To_Vector ((((127, 2), 90, 0, (195,
1), 0), ((127, 3), 90, 1,
- (2147483647, 0), 0)));
- Table.States (452).Action_List.Set_Capacity (1);
- Add_Action (Table.States (452), 19, (120, 4), 614);
- Table.States (452).Kernel := To_Vector ((0 => ((120, 4), 74, 2,
(2147483647, 0), 0)));
- Table.States (452).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (120, 4), 19, 614)));
- Table.States (453).Action_List.Set_Capacity (20);
- Add_Action (Table.States (453), 3, (200, 2), 122);
- Add_Action (Table.States (453), 28, (127, 6), 521);
- Add_Action (Table.States (453), 39, (261, 4), 123);
- Add_Action (Table.States (453), 40, (168, 1), 263);
- Add_Action (Table.States (453), 41, (120, 2), 615);
- Add_Action (Table.States (453), 44, (168, 3), 265);
- Add_Action (Table.States (453), 52, (278, 0), 126);
- Add_Action (Table.States (453), 76, (120, 0), 127);
- Add_Action (Table.States (453), 77, (120, 5), 128);
- Add_Action (Table.States (453), 78, Reduce, (127, 5), 0, null,
null);
- Add_Action (Table.States (453), 81, (242, 8), 31);
- Add_Action (Table.States (453), 82, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (453), 86, Reduce, (127, 5), 0, null,
null);
- Add_Action (Table.States (453), 90, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (453), 97, (333, 1), 129);
- Add_Action (Table.States (453), 98, (333, 0), 130);
- Add_Action (Table.States (453), 106, (261, 0), 131);
- Add_Action (Table.States (453), 107, (242, 5), 120);
- Add_Action (Table.States (453), 108, (242, 7), 34);
- Add_Action (Table.States (453), 109, (127, 0), 266);
- Table.States (453).Goto_List.Set_Capacity (24);
- Add_Goto (Table.States (453), 120, 132);
- Add_Goto (Table.States (453), 127, 267);
- Add_Goto (Table.States (453), 128, 616);
- Add_Goto (Table.States (453), 131, 42);
- Add_Goto (Table.States (453), 168, 271);
- Add_Goto (Table.States (453), 169, 272);
- Add_Goto (Table.States (453), 194, 411);
- Add_Goto (Table.States (453), 200, 135);
- Add_Goto (Table.States (453), 242, 276);
- Add_Goto (Table.States (453), 261, 137);
- Add_Goto (Table.States (453), 275, 93);
- Add_Goto (Table.States (453), 278, 138);
- Add_Goto (Table.States (453), 280, 278);
- Add_Goto (Table.States (453), 285, 139);
- Add_Goto (Table.States (453), 286, 140);
- Add_Goto (Table.States (453), 287, 141);
- Add_Goto (Table.States (453), 288, 142);
- Add_Goto (Table.States (453), 289, 143);
- Add_Goto (Table.States (453), 290, 144);
- Add_Goto (Table.States (453), 296, 98);
- Add_Goto (Table.States (453), 304, 279);
- Add_Goto (Table.States (453), 323, 146);
- Add_Goto (Table.States (453), 324, 147);
- Add_Goto (Table.States (453), 333, 148);
- Table.States (453).Kernel := To_Vector ((((120, 2), 74, 3,
(2147483647, 0), 0), ((120, 3), 74, 1,
- (2147483647, 0), 0)));
- Table.States (453).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (128, 1), 0)));
- Table.States (454).Action_List.Set_Capacity (8);
- Add_Action (Table.States (454), 7, (132, 2), 419);
- Add_Action (Table.States (454), 19, (132, 3), 420);
- Add_Action (Table.States (454), 20, (132, 4), 421);
- Add_Action (Table.States (454), 38, (132, 5), 422);
- Add_Action (Table.States (454), 53, (280, 0), 617);
- Add_Action (Table.States (454), 76, (120, 0), 127);
- Add_Action (Table.States (454), 77, (120, 5), 128);
- Add_Action (Table.States (454), 107, (132, 0), 423);
- Table.States (454).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (454), 120, 424);
- Add_Goto (Table.States (454), 132, 425);
- Table.States (454).Kernel := To_Vector ((((131, 0), 325, 1,
(2147483647, 0), 0), ((275, 0), 325, 2,
- (2147483647, 0), 0), ((280, 0), 325, 3, (2147483647, 0), 0),
((280, 1), 325, 1, (2147483647, 0),
- 0)));
- Table.States (455).Action_List.Set_Capacity (13);
- Add_Action (Table.States (455), 3, (200, 2), 122);
- Add_Action (Table.States (455), 39, (261, 4), 123);
- Add_Action (Table.States (455), 40, (200, 3), 124);
- Add_Action (Table.States (455), 41, (261, 1), 125);
- Add_Action (Table.States (455), 76, (120, 0), 127);
- Add_Action (Table.States (455), 77, (120, 5), 128);
- Add_Action (Table.States (455), 81, (242, 8), 31);
- Add_Action (Table.States (455), 97, (333, 1), 129);
- Add_Action (Table.States (455), 98, (333, 0), 130);
- Add_Action (Table.States (455), 106, (261, 0), 131);
- Add_Action (Table.States (455), 107, (242, 5), 120);
- Add_Action (Table.States (455), 108, (242, 7), 34);
- Add_Action (Table.States (455), 109, (242, 6), 35);
- Table.States (455).Goto_List.Set_Capacity (11);
- Add_Goto (Table.States (455), 120, 132);
- Add_Goto (Table.States (455), 131, 42);
- Add_Goto (Table.States (455), 200, 135);
- Add_Goto (Table.States (455), 242, 136);
- Add_Goto (Table.States (455), 261, 137);
- Add_Goto (Table.States (455), 275, 93);
- Add_Goto (Table.States (455), 296, 98);
- Add_Goto (Table.States (455), 304, 618);
- Add_Goto (Table.States (455), 323, 146);
- Add_Goto (Table.States (455), 324, 147);
- Add_Goto (Table.States (455), 333, 148);
- Table.States (455).Kernel := To_Vector ((0 => ((280, 2), 88, 1,
(2147483647, 0), 0)));
- Table.States (455).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (456).Action_List.Set_Capacity (1);
- Add_Action (Table.States (456), 19, (120, 5), 619);
- Table.States (456).Kernel := To_Vector ((0 => ((120, 5), 74, 2,
(2147483647, 0), 0)));
- Table.States (456).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (120, 5), 19, 619)));
- Table.States (457).Action_List.Set_Capacity (17);
- Add_Action (Table.States (457), 3, (200, 2), 122);
- Add_Action (Table.States (457), 39, (261, 4), 123);
- Add_Action (Table.States (457), 40, (168, 1), 263);
- Add_Action (Table.States (457), 41, (261, 1), 125);
- Add_Action (Table.States (457), 44, (168, 3), 265);
- Add_Action (Table.States (457), 52, (278, 0), 126);
- Add_Action (Table.States (457), 76, (120, 0), 127);
- Add_Action (Table.States (457), 77, (120, 5), 128);
- Add_Action (Table.States (457), 81, (242, 8), 31);
- Add_Action (Table.States (457), 82, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (457), 90, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (457), 97, (333, 1), 129);
- Add_Action (Table.States (457), 98, (333, 0), 130);
- Add_Action (Table.States (457), 106, (261, 0), 131);
- Add_Action (Table.States (457), 107, (242, 5), 120);
- Add_Action (Table.States (457), 108, (242, 7), 34);
- Add_Action (Table.States (457), 109, (242, 6), 35);
- Table.States (457).Goto_List.Set_Capacity (22);
- Add_Goto (Table.States (457), 120, 132);
- Add_Goto (Table.States (457), 131, 42);
- Add_Goto (Table.States (457), 168, 271);
- Add_Goto (Table.States (457), 169, 620);
- Add_Goto (Table.States (457), 194, 611);
- Add_Goto (Table.States (457), 200, 135);
- Add_Goto (Table.States (457), 242, 276);
- Add_Goto (Table.States (457), 261, 137);
- Add_Goto (Table.States (457), 275, 93);
- Add_Goto (Table.States (457), 278, 138);
- Add_Goto (Table.States (457), 280, 278);
- Add_Goto (Table.States (457), 285, 139);
- Add_Goto (Table.States (457), 286, 140);
- Add_Goto (Table.States (457), 287, 141);
- Add_Goto (Table.States (457), 288, 142);
- Add_Goto (Table.States (457), 289, 143);
- Add_Goto (Table.States (457), 290, 144);
- Add_Goto (Table.States (457), 296, 98);
- Add_Goto (Table.States (457), 304, 279);
- Add_Goto (Table.States (457), 323, 146);
- Add_Goto (Table.States (457), 324, 147);
- Add_Goto (Table.States (457), 333, 148);
- Table.States (457).Kernel := To_Vector ((0 => ((143, 0), 72, 1,
(2147483647, 0), 0)));
- Table.States (457).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (169, 2), 0)));
- Table.States (458).Action_List.Set_Capacity (2);
- Add_Action (Table.States (458), (24, 72), (144, 1), 1, null,
null);
- Table.States (458).Kernel := To_Vector ((0 => ((144, 1), 143, 0,
(144, 1), 1)));
- Table.States (458).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (144, 1), 1)));
- Table.States (459).Action_List.Set_Capacity (2);
- Add_Action (Table.States (459), 24, (142, 0), 621);
- Add_Action (Table.States (459), 72, (143, 0), 457);
- Table.States (459).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (459), 143, 622);
- Table.States (459).Kernel := To_Vector ((((142, 0), 144, 3,
(2147483647, 0), 0), ((144, 0), 144, 2,
- (2147483647, 0), 0)));
- Table.States (459).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (142, 0), 24, 621)));
- Table.States (460).Action_List.Set_Capacity (36);
- Add_Action (Table.States (460), (10, 20, 21, 22, 23, 33, 35, 37,
38, 40, 42, 43, 53, 55, 68, 74, 75, 78,
- 79, 80, 82, 85, 86, 88, 89, 90, 91, 92, 94, 95, 97, 98, 99, 100,
101, 102), (200, 0), 3, null, null);
- Table.States (460).Kernel := To_Vector ((0 => ((200, 0), 261, 0,
(200, 0), 3)));
- Table.States (460).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (200, 0), 3)));
- Table.States (461).Action_List.Set_Capacity (18);
- Add_Action (Table.States (461), (10, 20, 21, 22, 23, 35, 37, 43,
53, 68, 74, 75, 78, 79, 82, 86, 90, 99),
- (285, 0), 3, null, null);
- Table.States (461).Kernel := To_Vector ((0 => ((285, 0), 290, 0,
(285, 0), 3)));
- Table.States (461).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (285, 0), 3)));
- Table.States (462).Action_List.Set_Capacity (14);
- Add_Action (Table.States (462), 3, (200, 2), 122);
- Add_Action (Table.States (462), 39, (261, 4), 123);
- Add_Action (Table.States (462), 40, (200, 3), 124);
- Add_Action (Table.States (462), 41, (261, 1), 125);
- Add_Action (Table.States (462), 52, (278, 0), 126);
- Add_Action (Table.States (462), 76, (120, 0), 127);
- Add_Action (Table.States (462), 77, (120, 5), 128);
- Add_Action (Table.States (462), 81, (242, 8), 31);
- Add_Action (Table.States (462), 97, (333, 1), 129);
- Add_Action (Table.States (462), 98, (333, 0), 130);
- Add_Action (Table.States (462), 106, (261, 0), 131);
- Add_Action (Table.States (462), 107, (242, 5), 120);
- Add_Action (Table.States (462), 108, (242, 7), 34);
- Add_Action (Table.States (462), 109, (242, 6), 35);
- Table.States (462).Goto_List.Set_Capacity (13);
- Add_Goto (Table.States (462), 120, 132);
- Add_Goto (Table.States (462), 131, 42);
- Add_Goto (Table.States (462), 200, 135);
- Add_Goto (Table.States (462), 242, 136);
- Add_Goto (Table.States (462), 261, 137);
- Add_Goto (Table.States (462), 275, 93);
- Add_Goto (Table.States (462), 278, 138);
- Add_Goto (Table.States (462), 290, 623);
- Add_Goto (Table.States (462), 296, 98);
- Add_Goto (Table.States (462), 304, 145);
- Add_Goto (Table.States (462), 323, 146);
- Add_Goto (Table.States (462), 324, 147);
- Add_Goto (Table.States (462), 333, 148);
- Table.States (462).Kernel := To_Vector ((0 => ((286, 0), 68, 1,
(2147483647, 0), 0)));
- Table.States (462).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (463).Action_List.Set_Capacity (18);
- Add_Action (Table.States (463), (10, 20, 21, 22, 23, 35, 37, 43,
53, 68, 74, 75, 78, 79, 82, 86, 90, 99),
- (287, 0), 3, null, null);
- Table.States (463).Kernel := To_Vector ((0 => ((287, 0), 290, 0,
(287, 0), 3)));
- Table.States (463).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (287, 0), 3)));
- Table.States (464).Action_List.Set_Capacity (14);
- Add_Action (Table.States (464), 3, (200, 2), 122);
- Add_Action (Table.States (464), 39, (261, 4), 123);
- Add_Action (Table.States (464), 40, (200, 3), 124);
- Add_Action (Table.States (464), 41, (261, 1), 125);
- Add_Action (Table.States (464), 52, (278, 0), 126);
- Add_Action (Table.States (464), 76, (120, 0), 127);
- Add_Action (Table.States (464), 77, (120, 5), 128);
- Add_Action (Table.States (464), 81, (242, 8), 31);
- Add_Action (Table.States (464), 97, (333, 1), 129);
- Add_Action (Table.States (464), 98, (333, 0), 130);
- Add_Action (Table.States (464), 106, (261, 0), 131);
- Add_Action (Table.States (464), 107, (242, 5), 120);
- Add_Action (Table.States (464), 108, (242, 7), 34);
- Add_Action (Table.States (464), 109, (242, 6), 35);
- Table.States (464).Goto_List.Set_Capacity (13);
- Add_Goto (Table.States (464), 120, 132);
- Add_Goto (Table.States (464), 131, 42);
- Add_Goto (Table.States (464), 200, 135);
- Add_Goto (Table.States (464), 242, 136);
- Add_Goto (Table.States (464), 261, 137);
- Add_Goto (Table.States (464), 275, 93);
- Add_Goto (Table.States (464), 278, 138);
- Add_Goto (Table.States (464), 290, 624);
- Add_Goto (Table.States (464), 296, 98);
- Add_Goto (Table.States (464), 304, 145);
- Add_Goto (Table.States (464), 323, 146);
- Add_Goto (Table.States (464), 324, 147);
- Add_Goto (Table.States (464), 333, 148);
- Table.States (464).Kernel := To_Vector ((0 => ((288, 0), 22, 1,
(2147483647, 0), 0)));
- Table.States (464).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (465).Action_List.Set_Capacity (18);
- Add_Action (Table.States (465), (10, 20, 21, 22, 23, 35, 37, 43,
53, 68, 74, 75, 78, 79, 82, 86, 90, 99),
- (289, 0), 3, null, null);
- Table.States (465).Kernel := To_Vector ((0 => ((289, 0), 290, 0,
(289, 0), 3)));
- Table.States (465).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (289, 0), 3)));
- Table.States (466).Action_List.Set_Capacity (14);
- Add_Action (Table.States (466), 3, (200, 2), 122);
- Add_Action (Table.States (466), 39, (261, 4), 123);
- Add_Action (Table.States (466), 40, (200, 3), 124);
- Add_Action (Table.States (466), 41, (261, 1), 125);
- Add_Action (Table.States (466), 52, (278, 0), 126);
- Add_Action (Table.States (466), 76, (120, 0), 127);
- Add_Action (Table.States (466), 77, (120, 5), 128);
- Add_Action (Table.States (466), 81, (242, 8), 31);
- Add_Action (Table.States (466), 97, (333, 1), 129);
- Add_Action (Table.States (466), 98, (333, 0), 130);
- Add_Action (Table.States (466), 106, (261, 0), 131);
- Add_Action (Table.States (466), 107, (242, 5), 120);
- Add_Action (Table.States (466), 108, (242, 7), 34);
- Add_Action (Table.States (466), 109, (242, 6), 35);
- Table.States (466).Goto_List.Set_Capacity (13);
- Add_Goto (Table.States (466), 120, 132);
- Add_Goto (Table.States (466), 131, 42);
- Add_Goto (Table.States (466), 200, 135);
- Add_Goto (Table.States (466), 242, 136);
- Add_Goto (Table.States (466), 261, 137);
- Add_Goto (Table.States (466), 275, 93);
- Add_Goto (Table.States (466), 278, 138);
- Add_Goto (Table.States (466), 290, 625);
- Add_Goto (Table.States (466), 296, 98);
- Add_Goto (Table.States (466), 304, 145);
- Add_Goto (Table.States (466), 323, 146);
- Add_Goto (Table.States (466), 324, 147);
- Add_Goto (Table.States (466), 333, 148);
- Table.States (466).Kernel := To_Vector ((0 => ((286, 1), 68, 1,
(2147483647, 0), 0)));
- Table.States (466).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- end Subr_9;
- procedure Subr_10
- is begin
- Table.States (467).Action_List.Set_Capacity (18);
- Add_Action (Table.States (467), (10, 20, 21, 22, 23, 35, 37, 43,
53, 68, 74, 75, 78, 79, 82, 86, 90, 99),
- (285, 1), 3, null, null);
- Table.States (467).Kernel := To_Vector ((0 => ((285, 1), 290, 0,
(285, 1), 3)));
- Table.States (467).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (285, 1), 3)));
- Table.States (468).Action_List.Set_Capacity (14);
- Add_Action (Table.States (468), 3, (200, 2), 122);
- Add_Action (Table.States (468), 39, (261, 4), 123);
- Add_Action (Table.States (468), 40, (200, 3), 124);
- Add_Action (Table.States (468), 41, (261, 1), 125);
- Add_Action (Table.States (468), 52, (278, 0), 126);
- Add_Action (Table.States (468), 76, (120, 0), 127);
- Add_Action (Table.States (468), 77, (120, 5), 128);
- Add_Action (Table.States (468), 81, (242, 8), 31);
- Add_Action (Table.States (468), 97, (333, 1), 129);
- Add_Action (Table.States (468), 98, (333, 0), 130);
- Add_Action (Table.States (468), 106, (261, 0), 131);
- Add_Action (Table.States (468), 107, (242, 5), 120);
- Add_Action (Table.States (468), 108, (242, 7), 34);
- Add_Action (Table.States (468), 109, (242, 6), 35);
- Table.States (468).Goto_List.Set_Capacity (13);
- Add_Goto (Table.States (468), 120, 132);
- Add_Goto (Table.States (468), 131, 42);
- Add_Goto (Table.States (468), 200, 135);
- Add_Goto (Table.States (468), 242, 136);
- Add_Goto (Table.States (468), 261, 137);
- Add_Goto (Table.States (468), 275, 93);
- Add_Goto (Table.States (468), 278, 138);
- Add_Goto (Table.States (468), 290, 626);
- Add_Goto (Table.States (468), 296, 98);
- Add_Goto (Table.States (468), 304, 145);
- Add_Goto (Table.States (468), 323, 146);
- Add_Goto (Table.States (468), 324, 147);
- Add_Goto (Table.States (468), 333, 148);
- Table.States (468).Kernel := To_Vector ((0 => ((288, 1), 22, 1,
(2147483647, 0), 0)));
- Table.States (468).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (469).Action_List.Set_Capacity (18);
- Add_Action (Table.States (469), (10, 20, 21, 22, 23, 35, 37, 43,
53, 68, 74, 75, 78, 79, 82, 86, 90, 99),
- (287, 1), 3, null, null);
- Table.States (469).Kernel := To_Vector ((0 => ((287, 1), 290, 0,
(287, 1), 3)));
- Table.States (469).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (287, 1), 3)));
- Table.States (470).Action_List.Set_Capacity (18);
- Add_Action (Table.States (470), (10, 20, 21, 22, 23, 35, 37, 43,
53, 68, 74, 75, 78, 79, 82, 86, 90, 99),
- (289, 1), 3, null, null);
- Table.States (470).Kernel := To_Vector ((0 => ((289, 1), 290, 0,
(289, 1), 3)));
- Table.States (470).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (289, 1), 3)));
- Table.States (471).Action_List.Set_Capacity (18);
- Add_Action (Table.States (471), 10, Reduce, (290, 1), 3, null,
null);
- Add_Action (Table.States (471), 20, Reduce, (290, 1), 3, null,
null);
- Add_Action (Table.States (471), 21, Reduce, (290, 1), 3, null,
null);
- Add_Action (Table.States (471), 22, Reduce, (290, 1), 3, null,
null);
- Add_Action (Table.States (471), 23, Reduce, (290, 1), 3, null,
null);
- Add_Action (Table.States (471), 35, Reduce, (290, 1), 3, null,
null);
- Add_Action (Table.States (471), 37, Reduce, (290, 1), 3, null,
null);
- Add_Action (Table.States (471), 43, Reduce, (290, 1), 3, null,
null);
- Add_Action (Table.States (471), 53, Reduce, (290, 1), 3, null,
null);
- Add_Action (Table.States (471), 68, Reduce, (290, 1), 3, null,
null);
- Add_Action (Table.States (471), 74, Reduce, (290, 1), 3, null,
null);
- Add_Action (Table.States (471), 75, Reduce, (290, 1), 3, null,
null);
- Add_Action (Table.States (471), 78, Reduce, (290, 1), 3, null,
null);
- Add_Action (Table.States (471), 79, Reduce, (290, 1), 3, null,
null);
- Add_Action (Table.States (471), 82, (236, 0), 627);
- Add_Conflict (Table.States (471), 82, (290, 1), 3, null, null);
- Add_Action (Table.States (471), 86, Reduce, (290, 1), 3, null,
null);
- Add_Action (Table.States (471), 90, Reduce, (290, 1), 3, null,
null);
- Add_Action (Table.States (471), 99, Reduce, (290, 1), 3, null,
null);
- Table.States (471).Kernel := To_Vector ((((236, 0), 236, 2,
(2147483647, 0), 0), ((290, 1), 236, 0,
- (290, 1), 3)));
- Table.States (471).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (290, 1), 3)));
- Table.States (472).Action_List.Set_Capacity (18);
- Add_Action (Table.States (472), (10, 20, 21, 22, 23, 35, 37, 43,
53, 68, 74, 75, 78, 79, 82, 86, 90, 99),
- (236, 1), 1, null, null);
- Table.States (472).Kernel := To_Vector ((0 => ((236, 1), 237, 0,
(236, 1), 1)));
- Table.States (472).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (236, 1), 1)));
- Table.States (473).Action_List.Set_Capacity (18);
- Add_Action (Table.States (473), (10, 20, 21, 22, 23, 35, 37, 43,
53, 68, 74, 75, 78, 79, 82, 86, 90, 99),
- (237, 1), 1, null, null);
- Table.States (473).Kernel := To_Vector ((0 => ((237, 1), 280, 0,
(237, 1), 1)));
- Table.States (473).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (237, 1), 1)));
- Table.States (474).Action_List.Set_Capacity (19);
- Add_Action (Table.States (474), 10, Reduce, (237, 0), 1, null,
null);
- Add_Action (Table.States (474), 20, Reduce, (237, 0), 1, null,
null);
- Add_Action (Table.States (474), 21, Reduce, (237, 0), 1, null,
null);
- Add_Action (Table.States (474), 22, Reduce, (237, 0), 1, null,
null);
- Add_Action (Table.States (474), 23, Reduce, (237, 0), 1, null,
null);
- Add_Action (Table.States (474), 35, Reduce, (237, 0), 1, null,
null);
- Add_Action (Table.States (474), 37, Reduce, (237, 0), 1, null,
null);
- Add_Action (Table.States (474), 43, Reduce, (237, 0), 1, null,
null);
- Add_Action (Table.States (474), 53, Reduce, (237, 0), 1, null,
null);
- Add_Action (Table.States (474), 68, Reduce, (237, 0), 1, null,
null);
- Add_Action (Table.States (474), 74, Reduce, (237, 0), 1, null,
null);
- Add_Action (Table.States (474), 75, Reduce, (237, 0), 1, null,
null);
- Add_Action (Table.States (474), 78, Reduce, (237, 0), 1, null,
null);
- Add_Action (Table.States (474), 79, Reduce, (237, 0), 1, null,
null);
- Add_Action (Table.States (474), 82, Reduce, (237, 0), 1, null,
null);
- Add_Action (Table.States (474), 86, Reduce, (237, 0), 1, null,
null);
- Add_Action (Table.States (474), 88, (280, 2), 455);
- Add_Action (Table.States (474), 90, Reduce, (237, 0), 1, null,
null);
- Add_Action (Table.States (474), 99, Reduce, (237, 0), 1, null,
null);
- Table.States (474).Kernel := To_Vector ((((237, 0), 304, 0,
(237, 0), 1), ((280, 2), 304, 2,
- (2147483647, 0), 0)));
- Table.States (474).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (237, 0), 1)));
- Table.States (475).Action_List.Set_Capacity (13);
- Add_Action (Table.States (475), 3, (200, 2), 122);
- Add_Action (Table.States (475), 39, (261, 4), 123);
- Add_Action (Table.States (475), 40, (200, 3), 124);
- Add_Action (Table.States (475), 41, (261, 1), 125);
- Add_Action (Table.States (475), 76, (120, 0), 127);
- Add_Action (Table.States (475), 77, (120, 5), 128);
- Add_Action (Table.States (475), 81, (242, 8), 31);
- Add_Action (Table.States (475), 97, (333, 1), 129);
- Add_Action (Table.States (475), 98, (333, 0), 130);
- Add_Action (Table.States (475), 106, (261, 0), 131);
- Add_Action (Table.States (475), 107, (242, 5), 120);
- Add_Action (Table.States (475), 108, (242, 7), 34);
- Add_Action (Table.States (475), 109, (242, 6), 35);
- Table.States (475).Goto_List.Set_Capacity (14);
- Add_Goto (Table.States (475), 120, 132);
- Add_Goto (Table.States (475), 131, 42);
- Add_Goto (Table.States (475), 200, 135);
- Add_Goto (Table.States (475), 236, 628);
- Add_Goto (Table.States (475), 237, 472);
- Add_Goto (Table.States (475), 242, 276);
- Add_Goto (Table.States (475), 261, 137);
- Add_Goto (Table.States (475), 275, 93);
- Add_Goto (Table.States (475), 280, 473);
- Add_Goto (Table.States (475), 296, 98);
- Add_Goto (Table.States (475), 304, 474);
- Add_Goto (Table.States (475), 323, 146);
- Add_Goto (Table.States (475), 324, 147);
- Add_Goto (Table.States (475), 333, 148);
- Table.States (475).Kernel := To_Vector ((0 => ((290, 0), 33, 1,
(2147483647, 0), 0)));
- Table.States (475).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (476).Action_List.Set_Capacity (18);
- Add_Action (Table.States (476), (10, 20, 21, 22, 23, 35, 37, 43,
53, 68, 74, 75, 78, 79, 82, 86, 90, 99),
- (290, 2), 3, null, null);
- Table.States (476).Kernel := To_Vector ((0 => ((290, 2), 304, 0,
(290, 2), 3)));
- Table.States (476).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (290, 2), 3)));
- Table.States (477).Action_List.Set_Capacity (36);
- Add_Action (Table.States (477), (10, 20, 21, 22, 23, 33, 35, 37,
38, 40, 42, 43, 53, 55, 68, 74, 75, 78,
- 79, 80, 82, 85, 86, 88, 89, 90, 91, 92, 94, 95, 97, 98, 99, 100,
101, 102), (323, 0), 3, null, null);
- Table.States (477).Kernel := To_Vector ((0 => ((323, 0), 200, 0,
(323, 0), 3)));
- Table.States (477).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (323, 0), 3)));
- Table.States (478).Action_List.Set_Capacity (36);
- Add_Action (Table.States (478), 10, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 20, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 21, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 22, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 23, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 33, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 35, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 37, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 38, (240, 2), 300);
- Add_Action (Table.States (478), 40, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 42, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 43, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 53, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 55, (240, 3), 301);
- Add_Action (Table.States (478), 68, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 74, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 75, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 78, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 79, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 80, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 82, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 85, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 86, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 88, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 89, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 90, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 91, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 92, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 94, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 95, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 97, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 98, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 99, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 100, (240, 1), 302);
- Add_Action (Table.States (478), 101, Reduce, (324, 0), 3, null,
null);
- Add_Action (Table.States (478), 102, (240, 0), 303);
- Table.States (478).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (478), 240, 304);
- Table.States (478).Kernel := To_Vector ((((323, 0), 323, 2,
(2147483647, 0), 0), ((324, 0), 323, 0,
- (324, 0), 3)));
- Table.States (478).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (324, 0), 3)));
- Table.States (479).Action_List.Set_Capacity (47);
- Add_Action (Table.States (479), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (164, 0), 4, delay_statement_0'Access, null);
- Table.States (479).Kernel := To_Vector ((0 => ((164, 0), 99, 0,
(164, 0), 4)));
- Table.States (479).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (164, 0), 4)));
- Table.States (480).Action_List.Set_Capacity (1);
- Add_Action (Table.States (480), 99, (193, 0), 629);
- Table.States (480).Kernel := To_Vector ((0 => ((193, 0), 195, 1,
(2147483647, 0), 0)));
- Table.States (480).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (193, 0), 99, 629)));
- Table.States (481).Action_List.Set_Capacity (9);
- Add_Action (Table.States (481), 39, (261, 4), 123);
- Add_Action (Table.States (481), 41, (261, 1), 630);
- Add_Action (Table.States (481), 76, (120, 0), 127);
- Add_Action (Table.States (481), 77, (120, 5), 128);
- Add_Action (Table.States (481), 81, (242, 8), 31);
- Add_Action (Table.States (481), 106, (261, 0), 131);
- Add_Action (Table.States (481), 107, (242, 5), 120);
- Add_Action (Table.States (481), 108, (242, 7), 34);
- Add_Action (Table.States (481), 109, (242, 6), 35);
- Table.States (481).Goto_List.Set_Capacity (6);
- Add_Goto (Table.States (481), 120, 132);
- Add_Goto (Table.States (481), 131, 42);
- Add_Goto (Table.States (481), 242, 136);
- Add_Goto (Table.States (481), 261, 258);
- Add_Goto (Table.States (481), 275, 93);
- Add_Goto (Table.States (481), 296, 98);
- Table.States (481).Kernel := To_Vector ((((200, 3), 40, 1,
(2147483647, 0), 0), ((317, 0), 40, 6,
- (2147483647, 0), 0), ((317, 1), 40, 2, (2147483647, 0), 0)));
- Table.States (481).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (482).Action_List.Set_Capacity (13);
- Add_Action (Table.States (482), 3, (200, 2), 122);
- Add_Action (Table.States (482), 39, (261, 4), 123);
- Add_Action (Table.States (482), 40, (200, 3), 481);
- Add_Action (Table.States (482), 41, (261, 1), 125);
- Add_Action (Table.States (482), 76, (120, 0), 127);
- Add_Action (Table.States (482), 77, (120, 5), 128);
- Add_Action (Table.States (482), 81, (242, 8), 31);
- Add_Action (Table.States (482), 97, (333, 1), 129);
- Add_Action (Table.States (482), 98, (333, 0), 130);
- Add_Action (Table.States (482), 106, (261, 0), 131);
- Add_Action (Table.States (482), 107, (242, 5), 120);
- Add_Action (Table.States (482), 108, (242, 7), 34);
- Add_Action (Table.States (482), 109, (242, 6), 35);
- Table.States (482).Goto_List.Set_Capacity (14);
- Add_Goto (Table.States (482), 120, 132);
- Add_Goto (Table.States (482), 131, 42);
- Add_Goto (Table.States (482), 170, 631);
- Add_Goto (Table.States (482), 200, 135);
- Add_Goto (Table.States (482), 242, 484);
- Add_Goto (Table.States (482), 261, 137);
- Add_Goto (Table.States (482), 275, 93);
- Add_Goto (Table.States (482), 280, 485);
- Add_Goto (Table.States (482), 296, 98);
- Add_Goto (Table.States (482), 304, 486);
- Add_Goto (Table.States (482), 317, 487);
- Add_Goto (Table.States (482), 323, 146);
- Add_Goto (Table.States (482), 324, 147);
- Add_Goto (Table.States (482), 333, 148);
- Table.States (482).Kernel := To_Vector ((0 => ((233, 2), 59, 1,
(2147483647, 0), 0)));
- Table.States (482).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (483).Action_List.Set_Capacity (2);
- Add_Action (Table.States (483), (37, 90), (233, 5), 3,
iterator_specification_5'Access, null);
- Table.States (483).Kernel := To_Vector ((0 => ((233, 5), 170, 0,
(233, 5), 3)));
- Table.States (483).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (233, 5), 3)));
- Table.States (484).Action_List.Set_Capacity (30);
- Add_Action (Table.States (484), 10, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (484), 33, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (484), 37, Reduce, (317, 3), 1,
subtype_indication_3'Access, null);
- Add_Action (Table.States (484), 38, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (484), 40, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (484), 43, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (484), 53, (158, 0), 632);
- Add_Action (Table.States (484), 55, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (484), 75, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (484), 76, (118, 0), 633);
- Add_Action (Table.States (484), 78, Reduce, (261, 3), 1, null,
null);
- Add_Conflict (Table.States (484), 78, (317, 3), 1,
subtype_indication_3'Access, null);
- Add_Action (Table.States (484), 80, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (484), 82, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (484), 86, Reduce, (261, 3), 1, null,
null);
- Add_Conflict (Table.States (484), 86, (317, 3), 1,
subtype_indication_3'Access, null);
- Add_Action (Table.States (484), 87, (296, 0), 239);
- Add_Action (Table.States (484), 88, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (484), 89, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (484), 90, Reduce, (261, 3), 1, null,
null);
- Add_Conflict (Table.States (484), 90, (317, 3), 1,
subtype_indication_3'Access, null);
- Add_Action (Table.States (484), 91, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (484), 92, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (484), 94, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (484), 95, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (484), 97, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (484), 98, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (484), 100, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (484), 101, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (484), 102, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (484), 103, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (484), 104, (325, 0), 241);
- Add_Action (Table.States (484), 105, (325, 1), 242);
- Table.States (484).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (484), 118, 243);
- Add_Goto (Table.States (484), 158, 634);
- Add_Goto (Table.States (484), 227, 635);
- Add_Goto (Table.States (484), 325, 454);
- Table.States (484).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((242, 0), 242, 5,
- (2147483647, 0), 0), ((242, 1), 242, 2, (2147483647, 0), 0),
((261, 3), 242, 0, (261, 3), 1), ((275,
- 0), 242, 3, (2147483647, 0), 0), ((280, 0), 242, 4,
(2147483647, 0), 0), ((280, 1), 242, 2,
- (2147483647, 0), 0), ((296, 0), 242, 2, (2147483647, 0), 0),
((296, 1), 242, 2, (2147483647, 0), 0),
- ((296, 2), 242, 2, (2147483647, 0), 0), ((296, 3), 242, 2,
(2147483647, 0), 0), ((317, 2), 242, 4,
- (2147483647, 0), 0), ((317, 3), 242, 0, (317, 3), 1)));
- Table.States (484).Minimal_Complete_Actions := To_Vector
(((Reduce, (261, 3), 1), (Reduce, (317, 3),
- 1)));
- Table.States (485).Action_List.Set_Capacity (4);
- Add_Action (Table.States (485), (37, 78, 86, 90), (170, 1), 1,
null, null);
- Table.States (485).Kernel := To_Vector ((0 => ((170, 1), 280, 0,
(170, 1), 1)));
- Table.States (485).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (170, 1), 1)));
- Table.States (486).Action_List.Set_Capacity (1);
- Add_Action (Table.States (486), 88, (280, 2), 455);
- Table.States (486).Kernel := To_Vector ((0 => ((280, 2), 304, 2,
(2147483647, 0), 0)));
- Table.States (486).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (280, 2), 88, 455)));
- Table.States (487).Action_List.Set_Capacity (4);
- Add_Action (Table.States (487), (37, 78, 86, 90), (170, 0), 1,
null, null);
- Table.States (487).Kernel := To_Vector ((0 => ((170, 0), 317, 0,
(170, 0), 1)));
- Table.States (487).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (170, 0), 1)));
- Table.States (488).Action_List.Set_Capacity (4);
- Add_Action (Table.States (488), 81, (242, 8), 31);
- Add_Action (Table.States (488), 107, (242, 5), 120);
- Add_Action (Table.States (488), 108, (242, 7), 34);
- Add_Action (Table.States (488), 109, (242, 6), 35);
- Table.States (488).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (488), 131, 42);
- Add_Goto (Table.States (488), 242, 636);
- Add_Goto (Table.States (488), 275, 93);
- Add_Goto (Table.States (488), 296, 98);
- Table.States (488).Kernel := To_Vector ((0 => ((233, 3), 59, 1,
(2147483647, 0), 0)));
- Table.States (488).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (489).Action_List.Set_Capacity (6);
- Add_Action (Table.States (489), 37, Reduce, (233, 4), 3, null,
null);
- Add_Action (Table.States (489), 76, (118, 0), 237);
- Add_Action (Table.States (489), 87, (296, 0), 239);
- Add_Action (Table.States (489), 90, Reduce, (233, 4), 3, null,
null);
- Add_Action (Table.States (489), 104, (325, 0), 241);
- Add_Action (Table.States (489), 105, (325, 1), 242);
- Table.States (489).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (489), 118, 243);
- Add_Goto (Table.States (489), 325, 244);
- Table.States (489).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((233, 4), 242, 0,
- (233, 4), 3), ((242, 0), 242, 5, (2147483647, 0), 0), ((242,
1), 242, 2, (2147483647, 0), 0), ((275,
- 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (489).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (233, 4), 3)));
- Table.States (490).Action_List.Set_Capacity (1);
- Add_Action (Table.States (490), 41, (317, 0), 637);
- Table.States (490).Kernel := To_Vector ((((317, 0), 40, 6,
(2147483647, 0), 0), ((317, 1), 40, 2,
- (2147483647, 0), 0)));
- Table.States (490).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (317, 0), 41, 637)));
- Table.States (491).Action_List.Set_Capacity (11);
- Add_Action (Table.States (491), 10, Reduce, (317, 3), 1,
subtype_indication_3'Access, null);
- Add_Action (Table.States (491), 21, Reduce, (317, 3), 1,
subtype_indication_3'Access, null);
- Add_Action (Table.States (491), 42, Reduce, (317, 3), 1,
subtype_indication_3'Access, null);
- Add_Action (Table.States (491), 53, (158, 0), 632);
- Add_Action (Table.States (491), 74, Reduce, (317, 3), 1,
subtype_indication_3'Access, null);
- Add_Action (Table.States (491), 76, (118, 0), 633);
- Add_Action (Table.States (491), 85, Reduce, (317, 3), 1,
subtype_indication_3'Access, null);
- Add_Action (Table.States (491), 87, (296, 0), 239);
- Add_Action (Table.States (491), 99, Reduce, (317, 3), 1,
subtype_indication_3'Access, null);
- Add_Action (Table.States (491), 104, (325, 0), 241);
- Add_Action (Table.States (491), 105, (325, 1), 242);
- Table.States (491).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (491), 118, 243);
- Add_Goto (Table.States (491), 158, 634);
- Add_Goto (Table.States (491), 227, 635);
- Add_Goto (Table.States (491), 325, 244);
- Table.States (491).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((242, 0), 242, 5,
- (2147483647, 0), 0), ((242, 1), 242, 2, (2147483647, 0), 0),
((275, 0), 242, 3, (2147483647, 0), 0),
- ((296, 0), 242, 2, (2147483647, 0), 0), ((296, 1), 242, 2,
(2147483647, 0), 0), ((296, 2), 242, 2,
- (2147483647, 0), 0), ((296, 3), 242, 2, (2147483647, 0), 0),
((317, 2), 242, 4, (2147483647, 0), 0),
- ((317, 3), 242, 0, (317, 3), 1)));
- Table.States (491).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (317, 3), 1)));
- Table.States (492).Action_List.Set_Capacity (1);
- Add_Action (Table.States (492), 42, (233, 0), 638);
- Table.States (492).Kernel := To_Vector ((((233, 0), 317, 3,
(2147483647, 0), 0), ((233, 1), 317, 2,
- (2147483647, 0), 0)));
- Table.States (492).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (233, 0), 42, 638)));
- Table.States (493).Action_List.Set_Capacity (1);
- Add_Action (Table.States (493), 99, (124, 0), 639);
- Table.States (493).Kernel := To_Vector ((0 => ((124, 0), 195, 1,
(2147483647, 0), 0)));
- Table.States (493).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (124, 0), 99, 639)));
- Table.States (494).Action_List.Set_Capacity (15);
- Add_Action (Table.States (494), 3, (200, 2), 122);
- Add_Action (Table.States (494), 39, (261, 4), 123);
- Add_Action (Table.States (494), 40, (200, 3), 124);
- Add_Action (Table.States (494), 41, (261, 1), 125);
- Add_Action (Table.States (494), 52, (278, 0), 126);
- Add_Action (Table.States (494), 76, (120, 0), 127);
- Add_Action (Table.States (494), 77, (120, 5), 128);
- Add_Action (Table.States (494), 81, (242, 8), 31);
- Add_Action (Table.States (494), 97, (333, 1), 129);
- Add_Action (Table.States (494), 98, (333, 0), 130);
- Add_Action (Table.States (494), 99, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (494), 106, (261, 0), 131);
- Add_Action (Table.States (494), 107, (242, 5), 120);
- Add_Action (Table.States (494), 108, (242, 7), 34);
- Add_Action (Table.States (494), 109, (242, 6), 35);
- Table.States (494).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (494), 120, 132);
- Add_Goto (Table.States (494), 131, 42);
- Add_Goto (Table.States (494), 194, 133);
- Add_Goto (Table.States (494), 195, 640);
- Add_Goto (Table.States (494), 200, 135);
- Add_Goto (Table.States (494), 242, 136);
- Add_Goto (Table.States (494), 261, 137);
- Add_Goto (Table.States (494), 275, 93);
- Add_Goto (Table.States (494), 278, 138);
- Add_Goto (Table.States (494), 285, 139);
- Add_Goto (Table.States (494), 286, 140);
- Add_Goto (Table.States (494), 287, 141);
- Add_Goto (Table.States (494), 288, 142);
- Add_Goto (Table.States (494), 289, 143);
- Add_Goto (Table.States (494), 290, 144);
- Add_Goto (Table.States (494), 296, 98);
- Add_Goto (Table.States (494), 304, 145);
- Add_Goto (Table.States (494), 323, 146);
- Add_Goto (Table.States (494), 324, 147);
- Add_Goto (Table.States (494), 333, 148);
- Table.States (494).Kernel := To_Vector ((0 => ((130, 0), 12, 1,
(2147483647, 0), 0)));
- Table.States (494).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (495).Action_List.Set_Capacity (2);
- Add_Action (Table.States (495), 12, (238, 0), 641);
- Add_Action (Table.States (495), 107, Reduce, (238, 1), 0, null,
null);
- Table.States (495).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (495), 238, 642);
- Table.States (495).Kernel := To_Vector ((0 => ((284, 0), 54, 11,
(2147483647, 0), 0)));
- Table.States (495).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (238, 1), 0)));
- Table.States (496).Action_List.Set_Capacity (1);
- Add_Action (Table.States (496), 99, (185, 0), 643);
- Table.States (496).Kernel := To_Vector ((0 => ((185, 0), 120, 1,
(2147483647, 0), 0)));
- Table.States (496).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (185, 0), 99, 643)));
- Table.States (497).Action_List.Set_Capacity (7);
- Add_Action (Table.States (497), (21, 35, 56, 74, 78, 85, 99),
(294, 1), 2, result_profile_1'Access, null);
- Table.States (497).Kernel := To_Vector ((0 => ((294, 1), 117, 0,
(294, 1), 2)));
- Table.States (497).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (294, 1), 2)));
- Table.States (498).Action_List.Set_Capacity (12);
- Add_Action (Table.States (498), 7, (117, 0), 564);
- Add_Action (Table.States (498), 21, Reduce, (243, 1), 0, null,
null);
- Add_Action (Table.States (498), 35, Reduce, (243, 1), 0, null,
null);
- Add_Action (Table.States (498), 56, Reduce, (243, 1), 0, null,
null);
- Add_Action (Table.States (498), 74, Reduce, (243, 1), 0, null,
null);
- Add_Action (Table.States (498), 78, Reduce, (243, 1), 0, null,
null);
- Add_Action (Table.States (498), 81, (242, 8), 31);
- Add_Action (Table.States (498), 85, Reduce, (243, 1), 0, null,
null);
- Add_Action (Table.States (498), 99, Reduce, (243, 1), 0, null,
null);
- Add_Action (Table.States (498), 107, (242, 5), 120);
- Add_Action (Table.States (498), 108, (242, 7), 34);
- Add_Action (Table.States (498), 109, (242, 6), 35);
- Table.States (498).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (498), 131, 42);
- Add_Goto (Table.States (498), 242, 644);
- Add_Goto (Table.States (498), 243, 645);
- Add_Goto (Table.States (498), 275, 93);
- Add_Goto (Table.States (498), 296, 98);
- Table.States (498).Kernel := To_Vector ((((117, 0), 244, 2,
(2147483647, 0), 0), ((117, 1), 244, 3,
- (2147483647, 0), 0), ((117, 2), 244, 2, (2147483647, 0), 0),
((294, 0), 244, 0, (243, 1), 0)));
- Table.States (498).Minimal_Complete_Actions := To_Vector (((Shift,
(117, 0), 7, 564), (Reduce, (243, 1),
- 0)));
- Table.States (499).Action_List.Set_Capacity (30);
- Add_Action (Table.States (499), 10, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (499), 33, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (499), 38, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (499), 40, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (499), 43, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (499), 53, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (499), 55, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (499), 75, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (499), 76, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (499), 78, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (499), 80, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (499), 82, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (499), 84, Reduce, (222, 1), 1,
identifier_list_1'Access, null);
- Add_Action (Table.States (499), 86, Reduce, (222, 1), 1,
identifier_list_1'Access, null);
- Add_Conflict (Table.States (499), 86, (242, 5), 1, name_5'Access,
name_5_check'Access);
- Add_Action (Table.States (499), 87, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (499), 88, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (499), 89, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (499), 90, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (499), 91, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (499), 92, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (499), 94, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (499), 95, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (499), 97, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (499), 98, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (499), 100, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (499), 101, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (499), 102, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (499), 103, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (499), 104, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (499), 105, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Table.States (499).Kernel := To_Vector ((((222, 1), 107, 0,
(222, 1), 1), ((242, 5), 107, 0, (242, 5),
- 1)));
- Table.States (499).Minimal_Complete_Actions := To_Vector
(((Reduce, (222, 1), 1), (Reduce, (242, 5),
- 1)));
- Table.States (500).Action_List.Set_Capacity (2);
- Add_Action (Table.States (500), 84, (257, 0), 646);
- Add_Action (Table.States (500), 86, (222, 0), 236);
- Table.States (500).Kernel := To_Vector ((((222, 0), 222, 2,
(2147483647, 0), 0), ((257, 0), 222, 3,
- (2147483647, 0), 0), ((257, 1), 222, 2, (2147483647, 0), 0),
((257, 2), 222, 4, (2147483647, 0), 0),
- ((257, 3), 222, 3, (2147483647, 0), 0)));
- Table.States (500).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (257, 0), 84, 646)));
- Table.States (501).Action_List.Set_Capacity (2);
- Add_Action (Table.States (501), (78, 99), (258, 1), 1, null,
null);
- Table.States (501).Kernel := To_Vector ((0 => ((258, 1), 257, 0,
(258, 1), 1)));
- Table.States (501).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (258, 1), 1)));
- Table.States (502).Action_List.Set_Capacity (2);
- Add_Action (Table.States (502), 78, (202, 0), 647);
- Add_Action (Table.States (502), 99, (258, 0), 648);
- Table.States (502).Kernel := To_Vector ((((202, 0), 258, 1,
(2147483647, 0), 0), ((258, 0), 258, 1,
- (2147483647, 0), 0)));
- Table.States (502).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (202, 0), 78, 647)));
- Table.States (503).Action_List.Set_Capacity (7);
- Add_Action (Table.States (503), (21, 35, 56, 74, 78, 85, 99),
(255, 0), 2,
- parameter_and_result_profile_0'Access, null);
- Table.States (503).Kernel := To_Vector ((0 => ((255, 0), 294, 0,
(255, 0), 2)));
- Table.States (503).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (255, 0), 2)));
- Table.States (504).Action_List.Set_Capacity (4);
- Add_Action (Table.States (504), 81, (242, 8), 31);
- Add_Action (Table.States (504), 107, (242, 5), 120);
- Add_Action (Table.States (504), 108, (242, 7), 34);
- Add_Action (Table.States (504), 109, (242, 6), 35);
- Table.States (504).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (504), 131, 42);
- Add_Goto (Table.States (504), 242, 649);
- Add_Goto (Table.States (504), 275, 93);
- Add_Goto (Table.States (504), 296, 98);
- Table.States (504).Kernel := To_Vector ((0 => ((218, 2), 56, 2,
(2147483647, 0), 0)));
- Table.States (504).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (505).Action_List.Set_Capacity (4);
- Add_Action (Table.States (505), 81, (242, 8), 31);
- Add_Action (Table.States (505), 107, (242, 5), 120);
- Add_Action (Table.States (505), 108, (242, 7), 34);
- Add_Action (Table.States (505), 109, (242, 6), 35);
- Table.States (505).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (505), 131, 42);
- Add_Goto (Table.States (505), 242, 650);
- Add_Goto (Table.States (505), 275, 93);
- Add_Goto (Table.States (505), 296, 98);
- Table.States (505).Kernel := To_Vector ((0 => ((218, 0), 56, 2,
(2147483647, 0), 0)));
- Table.States (505).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (506).Action_List.Set_Capacity (4);
- Add_Action (Table.States (506), 81, (242, 8), 31);
- Add_Action (Table.States (506), 107, (242, 5), 120);
- Add_Action (Table.States (506), 108, (242, 7), 34);
- Add_Action (Table.States (506), 109, (242, 6), 35);
- Table.States (506).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (506), 131, 42);
- Add_Goto (Table.States (506), 242, 651);
- Add_Goto (Table.States (506), 275, 93);
- Add_Goto (Table.States (506), 296, 98);
- Table.States (506).Kernel := To_Vector ((0 => ((218, 1), 56, 2,
(2147483647, 0), 0)));
- Table.States (506).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (507).Action_List.Set_Capacity (3);
- Add_Action (Table.States (507), 35, (204, 0), 652);
- Add_Action (Table.States (507), 74, (125, 0), 340);
- Add_Action (Table.States (507), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (507).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (507), 125, 653);
- Table.States (507).Kernel := To_Vector ((((204, 0), 172, 3,
(2147483647, 0), 0), ((204, 1), 172, 3,
- (2147483647, 0), 0), ((204, 2), 172, 1, (2147483647, 0), 0)));
- Table.States (507).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (508).Action_List.Set_Capacity (5);
- Add_Action (Table.States (508), 35, (207, 0), 654);
- Add_Action (Table.States (508), 76, (118, 0), 237);
- Add_Action (Table.States (508), 87, (296, 0), 239);
- Add_Action (Table.States (508), 104, (325, 0), 241);
- Add_Action (Table.States (508), 105, (325, 1), 242);
- Table.States (508).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (508), 118, 243);
- Add_Goto (Table.States (508), 325, 244);
- Table.States (508).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((207, 0), 242, 4,
- (2147483647, 0), 0), ((242, 0), 242, 5, (2147483647, 0), 0),
((242, 1), 242, 2, (2147483647, 0), 0),
- ((275, 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (508).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (207, 0), 35, 654)));
- Table.States (509).Action_List.Set_Capacity (7);
- Add_Action (Table.States (509), 6, (203, 0), 655);
- Add_Action (Table.States (509), 41, (313, 2), 656);
- Add_Action (Table.States (509), 81, (242, 8), 31);
- Add_Action (Table.States (509), 83, (313, 1), 657);
- Add_Action (Table.States (509), 107, (242, 5), 120);
- Add_Action (Table.States (509), 108, (242, 7), 34);
- Add_Action (Table.States (509), 109, (242, 6), 35);
- Table.States (509).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (509), 131, 42);
- Add_Goto (Table.States (509), 242, 658);
- Add_Goto (Table.States (509), 275, 93);
- Add_Goto (Table.States (509), 296, 98);
- Add_Goto (Table.States (509), 313, 659);
- Table.States (509).Kernel := To_Vector ((((203, 0), 35, 3,
(2147483647, 0), 0), ((203, 1), 35, 2,
- (2147483647, 0), 0), ((203, 2), 35, 2, (2147483647, 0), 0)));
- Table.States (509).Minimal_Complete_Actions := To_Vector (((Shift,
(242, 5), 107, 120), (Shift, (203, 0),
- 6, 655)));
- Table.States (510).Action_List.Set_Capacity (1);
- Add_Action (Table.States (510), 99, (203, 3), 660);
- Table.States (510).Kernel := To_Vector ((0 => ((203, 3), 125, 1,
(2147483647, 0), 0)));
- Table.States (510).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (203, 3), 99, 660)));
- Table.States (511).Action_List.Set_Capacity (10);
- Add_Action (Table.States (511), 7, Reduce, (239, 0), 1, null,
null);
- Add_Action (Table.States (511), 40, Reduce, (239, 0), 1, null,
null);
- Add_Action (Table.States (511), 45, (239, 1), 661);
- Add_Action (Table.States (511), 74, Reduce, (239, 0), 1, null,
null);
- Add_Action (Table.States (511), 81, Reduce, (239, 0), 1, null,
null);
- Add_Action (Table.States (511), 85, Reduce, (239, 0), 1, null,
null);
- Add_Action (Table.States (511), 99, Reduce, (239, 0), 1, null,
null);
- Add_Action (Table.States (511), 107, Reduce, (239, 0), 1, null,
null);
- Add_Action (Table.States (511), 108, Reduce, (239, 0), 1, null,
null);
- Add_Action (Table.States (511), 109, Reduce, (239, 0), 1, null,
null);
- Table.States (511).Kernel := To_Vector ((((239, 0), 33, 0, (239,
0), 1), ((239, 1), 33, 1,
- (2147483647, 0), 0)));
- Table.States (511).Minimal_Complete_Actions := To_Vector
(((Reduce, (239, 0), 1), (Shift, (239, 1), 45,
- 661)));
- Table.States (512).Action_List.Set_Capacity (9);
- Add_Action (Table.States (512), (7, 40, 74, 81, 85, 99, 107, 108,
109), (239, 2), 1, null, null);
- Table.States (512).Kernel := To_Vector ((0 => ((239, 2), 45, 0,
(239, 2), 1)));
- Table.States (512).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (239, 2), 1)));
- Table.States (513).Action_List.Set_Capacity (6);
- Add_Action (Table.States (513), 7, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (513), 40, (244, 0), 389);
- Add_Action (Table.States (513), 81, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (513), 107, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (513), 108, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (513), 109, Reduce, (244, 1), 0, null,
null);
- Table.States (513).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (513), 117, 662);
- Add_Goto (Table.States (513), 244, 663);
- Table.States (513).Kernel := To_Vector ((((201, 0), 239, 3,
(2147483647, 0), 0), ((201, 1), 239, 4,
- (2147483647, 0), 0), ((201, 2), 239, 2, (2147483647, 0), 0),
((201, 3), 239, 3, (2147483647, 0),
- 0)));
- Table.States (513).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (244, 1), 0)));
- Table.States (514).Action_List.Set_Capacity (3);
- Add_Action (Table.States (514), 22, (225, 1), 664);
- Add_Action (Table.States (514), 23, (177, 0), 665);
- Add_Action (Table.States (514), 24, (225, 3), 666);
- Table.States (514).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (514), 177, 667);
- Add_Goto (Table.States (514), 178, 668);
- Table.States (514).Kernel := To_Vector ((((225, 0), 303, 6,
(2147483647, 0), 0), ((225, 1), 303, 4,
- (2147483647, 0), 0), ((225, 2), 303, 5, (2147483647, 0), 0),
((225, 3), 303, 3, (2147483647, 0),
- 0)));
- Table.States (514).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (225, 3), 24, 666)));
- Table.States (515).Action_List.Set_Capacity (2);
- Add_Action (Table.States (515), 86, (241, 0), 384);
- Add_Action (Table.States (515), 99, (335, 0), 669);
- Table.States (515).Kernel := To_Vector ((((241, 0), 241, 2,
(2147483647, 0), 0), ((335, 0), 241, 1,
- (2147483647, 0), 0)));
- Table.States (515).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (335, 0), 99, 669)));
- Table.States (516).Action_List.Set_Capacity (40);
- Add_Action (Table.States (516), (4, 5, 13, 15, 17, 18, 25, 27, 28,
29, 30, 31, 32, 36, 37, 40, 41, 46, 47,
- 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 81,
96, 107, 108, 109, 110), (335, 1), 4,
- with_clause_1'Access, null);
- Table.States (516).Kernel := To_Vector ((0 => ((335, 1), 99, 0,
(335, 1), 4)));
- Table.States (516).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (335, 1), 4)));
- Table.States (517).Action_List.Set_Capacity (1);
- Add_Action (Table.States (517), 60, (251, 0), 670);
- Table.States (517).Kernel := To_Vector ((0 => ((251, 0), 35, 2,
(2147483647, 0), 0)));
- Table.States (517).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (251, 0), 60, 670)));
- Table.States (518).Action_List.Set_Capacity (1);
- Add_Action (Table.States (518), 35, (250, 0), 671);
- Table.States (518).Kernel := To_Vector ((((250, 0), 125, 4,
(2147483647, 0), 0), ((250, 1), 125, 3,
- (2147483647, 0), 0)));
- Table.States (518).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (250, 0), 35, 671)));
- Table.States (519).Action_List.Set_Capacity (4);
- Add_Action (Table.States (519), 81, (242, 8), 31);
- Add_Action (Table.States (519), 107, (242, 5), 120);
- Add_Action (Table.States (519), 108, (242, 7), 34);
- Add_Action (Table.States (519), 109, (242, 6), 35);
- Table.States (519).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (519), 131, 42);
- Add_Goto (Table.States (519), 242, 672);
- Add_Goto (Table.States (519), 275, 93);
- Add_Goto (Table.States (519), 296, 98);
- Table.States (519).Kernel := To_Vector ((0 => ((216, 0), 39, 2,
(2147483647, 0), 0)));
- Table.States (519).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (520).Action_List.Set_Capacity (6);
- Add_Action (Table.States (520), 74, (125, 0), 340);
- Add_Action (Table.States (520), 76, (118, 0), 237);
- Add_Action (Table.States (520), 87, (296, 0), 239);
- Add_Action (Table.States (520), 99, Reduce, (125, 1), 0, null,
null);
- Add_Action (Table.States (520), 104, (325, 0), 241);
- Add_Action (Table.States (520), 105, (325, 1), 242);
- Table.States (520).Goto_List.Set_Capacity (3);
- Add_Goto (Table.States (520), 118, 243);
- Add_Goto (Table.States (520), 125, 673);
- Add_Goto (Table.States (520), 325, 244);
- Table.States (520).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((242, 0), 242, 5,
- (2147483647, 0), 0), ((242, 1), 242, 2, (2147483647, 0), 0),
((253, 0), 242, 1, (2147483647, 0), 0),
- ((275, 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (520).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- end Subr_10;
- procedure Subr_11
- is begin
- Table.States (521).Action_List.Set_Capacity (1);
- Add_Action (Table.States (521), 107, (127, 6), 440);
- Table.States (521).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (521), 233, 441);
- Table.States (521).Kernel := To_Vector ((((127, 6), 28, 4,
(2147483647, 0), 0), ((127, 7), 28, 5,
- (2147483647, 0), 0)));
- Table.States (521).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (127, 6), 107, 440)));
- Table.States (522).Action_List.Set_Capacity (3);
- Add_Action (Table.States (522), 35, Reduce, (125, 0), 2,
aspect_specification_opt_0'Access, null);
- Add_Action (Table.States (522), 86, (128, 0), 448);
- Add_Action (Table.States (522), 99, Reduce, (125, 0), 2,
aspect_specification_opt_0'Access, null);
- Table.States (522).Kernel := To_Vector ((((125, 0), 128, 0,
(125, 0), 2), ((128, 0), 128, 1,
- (2147483647, 0), 0)));
- Table.States (522).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 0), 2)));
- Table.States (523).Action_List.Set_Capacity (17);
- Add_Action (Table.States (523), 24, Reduce, (162, 1), 0, null,
null);
- Add_Action (Table.States (523), 25, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (523), 28, (124, 0), 185);
- Add_Action (Table.States (523), 29, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (523), 30, (213, 0), 8);
- Add_Action (Table.States (523), 40, (249, 0), 12);
- Add_Action (Table.States (523), 46, (249, 1), 14);
- Add_Action (Table.States (523), 47, (216, 0), 15);
- Add_Action (Table.States (523), 48, (260, 0), 16);
- Add_Action (Table.States (523), 49, Reduce, (162, 1), 0, null,
null);
- Add_Action (Table.States (523), 50, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (523), 51, (267, 0), 19);
- Add_Action (Table.States (523), 63, (316, 0), 25);
- Add_Action (Table.States (523), 66, (308, 0), 26);
- Add_Action (Table.States (523), 69, (209, 0), 27);
- Add_Action (Table.States (523), 71, (334, 0), 28);
- Add_Action (Table.States (523), 107, (222, 1), 187);
- Table.States (523).Goto_List.Set_Capacity (53);
- Add_Goto (Table.States (523), 115, 36);
- Add_Goto (Table.States (523), 124, 38);
- Add_Goto (Table.States (523), 130, 41);
- Add_Goto (Table.States (523), 137, 46);
- Add_Goto (Table.States (523), 138, 47);
- Add_Goto (Table.States (523), 160, 394);
- Add_Goto (Table.States (523), 161, 395);
- Add_Goto (Table.States (523), 162, 674);
- Add_Goto (Table.States (523), 182, 55);
- Add_Goto (Table.States (523), 185, 56);
- Add_Goto (Table.States (523), 189, 57);
- Add_Goto (Table.States (523), 196, 59);
- Add_Goto (Table.States (523), 209, 61);
- Add_Goto (Table.States (523), 210, 62);
- Add_Goto (Table.States (523), 212, 63);
- Add_Goto (Table.States (523), 213, 64);
- Add_Goto (Table.States (523), 216, 65);
- Add_Goto (Table.States (523), 217, 66);
- Add_Goto (Table.States (523), 218, 67);
- Add_Goto (Table.States (523), 219, 68);
- Add_Goto (Table.States (523), 222, 70);
- Add_Goto (Table.States (523), 226, 72);
- Add_Goto (Table.States (523), 246, 75);
- Add_Goto (Table.States (523), 247, 76);
- Add_Goto (Table.States (523), 248, 77);
- Add_Goto (Table.States (523), 249, 78);
- Add_Goto (Table.States (523), 250, 79);
- Add_Goto (Table.States (523), 251, 80);
- Add_Goto (Table.States (523), 252, 81);
- Add_Goto (Table.States (523), 253, 82);
- Add_Goto (Table.States (523), 254, 83);
- Add_Goto (Table.States (523), 260, 397);
- Add_Goto (Table.States (523), 262, 85);
- Add_Goto (Table.States (523), 263, 86);
- Add_Goto (Table.States (523), 265, 88);
- Add_Goto (Table.States (523), 266, 89);
- Add_Goto (Table.States (523), 267, 90);
- Add_Goto (Table.States (523), 268, 91);
- Add_Goto (Table.States (523), 274, 92);
- Add_Goto (Table.States (523), 284, 95);
- Add_Goto (Table.States (523), 292, 96);
- Add_Goto (Table.States (523), 307, 103);
- Add_Goto (Table.States (523), 308, 104);
- Add_Goto (Table.States (523), 310, 106);
- Add_Goto (Table.States (523), 311, 107);
- Add_Goto (Table.States (523), 312, 108);
- Add_Goto (Table.States (523), 314, 109);
- Add_Goto (Table.States (523), 316, 110);
- Add_Goto (Table.States (523), 319, 112);
- Add_Goto (Table.States (523), 320, 113);
- Add_Goto (Table.States (523), 322, 114);
- Add_Goto (Table.States (523), 328, 116);
- Add_Goto (Table.States (523), 334, 117);
- Table.States (523).Kernel := To_Vector ((((254, 0), 35, 2,
(2147483647, 0), 0), ((254, 1), 35, 1,
- (2147483647, 0), 0)));
- Table.States (523).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (162, 1), 0)));
- Table.States (524).Action_List.Set_Capacity (2);
- Add_Action (Table.States (524), 78, (260, 0), 675);
- Add_Action (Table.States (524), 86, (128, 0), 448);
- Table.States (524).Kernel := To_Vector ((((128, 0), 128, 1,
(2147483647, 0), 0), ((260, 0), 128, 2,
- (2147483647, 0), 0)));
- Table.States (524).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (260, 0), 78, 675)));
- Table.States (525).Action_List.Set_Capacity (1);
- Add_Action (Table.States (525), 78, (260, 1), 676);
- Table.States (525).Kernel := To_Vector ((0 => ((260, 1), 156, 2,
(2147483647, 0), 0)));
- Table.States (525).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (260, 1), 78, 676)));
- Table.States (526).Action_List.Set_Capacity (40);
- Add_Action (Table.States (526), (4, 5, 13, 15, 17, 18, 25, 27, 28,
29, 30, 31, 32, 36, 37, 40, 41, 46, 47,
- 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 81,
96, 107, 108, 109, 110), (335, 2), 4,
- with_clause_2'Access, null);
- Table.States (526).Kernel := To_Vector ((0 => ((335, 2), 99, 0,
(335, 2), 4)));
- Table.States (526).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (335, 2), 4)));
- Table.States (527).Action_List.Set_Capacity (1);
- Add_Action (Table.States (527), 60, (268, 0), 677);
- Table.States (527).Kernel := To_Vector ((0 => ((268, 0), 35, 2,
(2147483647, 0), 0)));
- Table.States (527).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (268, 0), 60, 677)));
- Table.States (528).Action_List.Set_Capacity (1);
- Add_Action (Table.States (528), 35, (267, 0), 678);
- Table.States (528).Kernel := To_Vector ((0 => ((267, 0), 125, 3,
(2147483647, 0), 0)));
- Table.States (528).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (267, 0), 35, 678)));
- Table.States (529).Action_List.Set_Capacity (2);
- Add_Action (Table.States (529), 35, Reduce, (125, 1), 0, null,
null);
- Add_Action (Table.States (529), 74, (125, 0), 340);
- Table.States (529).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (529), 125, 679);
- Table.States (529).Kernel := To_Vector ((((274, 0), 172, 6,
(2147483647, 0), 0), ((274, 1), 172, 3,
- (2147483647, 0), 0)));
- Table.States (529).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (530).Action_List.Set_Capacity (18);
- Add_Action (Table.States (530), 24, Reduce, (162, 1), 0, null,
null);
- Add_Action (Table.States (530), 25, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (530), 28, (124, 0), 185);
- Add_Action (Table.States (530), 29, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (530), 30, (213, 0), 8);
- Add_Action (Table.States (530), 39, (307, 0), 680);
- Add_Action (Table.States (530), 40, (249, 0), 12);
- Add_Action (Table.States (530), 46, (249, 1), 14);
- Add_Action (Table.States (530), 47, (216, 0), 15);
- Add_Action (Table.States (530), 48, (260, 0), 16);
- Add_Action (Table.States (530), 49, Reduce, (162, 1), 0, null,
null);
- Add_Action (Table.States (530), 50, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (530), 51, (267, 0), 19);
- Add_Action (Table.States (530), 63, (316, 0), 25);
- Add_Action (Table.States (530), 66, (308, 0), 26);
- Add_Action (Table.States (530), 69, (209, 0), 27);
- Add_Action (Table.States (530), 71, (334, 0), 28);
- Add_Action (Table.States (530), 107, (222, 1), 187);
- Table.States (530).Goto_List.Set_Capacity (54);
- Add_Goto (Table.States (530), 115, 36);
- Add_Goto (Table.States (530), 124, 38);
- Add_Goto (Table.States (530), 130, 41);
- Add_Goto (Table.States (530), 137, 46);
- Add_Goto (Table.States (530), 138, 47);
- Add_Goto (Table.States (530), 160, 394);
- Add_Goto (Table.States (530), 161, 395);
- Add_Goto (Table.States (530), 162, 681);
- Add_Goto (Table.States (530), 182, 55);
- Add_Goto (Table.States (530), 185, 56);
- Add_Goto (Table.States (530), 189, 57);
- Add_Goto (Table.States (530), 196, 59);
- Add_Goto (Table.States (530), 209, 61);
- Add_Goto (Table.States (530), 210, 62);
- Add_Goto (Table.States (530), 212, 63);
- Add_Goto (Table.States (530), 213, 64);
- Add_Goto (Table.States (530), 216, 65);
- Add_Goto (Table.States (530), 217, 66);
- Add_Goto (Table.States (530), 218, 67);
- Add_Goto (Table.States (530), 219, 68);
- Add_Goto (Table.States (530), 222, 70);
- Add_Goto (Table.States (530), 226, 72);
- Add_Goto (Table.States (530), 246, 75);
- Add_Goto (Table.States (530), 247, 76);
- Add_Goto (Table.States (530), 248, 77);
- Add_Goto (Table.States (530), 249, 78);
- Add_Goto (Table.States (530), 250, 79);
- Add_Goto (Table.States (530), 251, 80);
- Add_Goto (Table.States (530), 252, 81);
- Add_Goto (Table.States (530), 253, 82);
- Add_Goto (Table.States (530), 254, 83);
- Add_Goto (Table.States (530), 260, 397);
- Add_Goto (Table.States (530), 262, 85);
- Add_Goto (Table.States (530), 263, 86);
- Add_Goto (Table.States (530), 265, 88);
- Add_Goto (Table.States (530), 266, 89);
- Add_Goto (Table.States (530), 267, 90);
- Add_Goto (Table.States (530), 268, 91);
- Add_Goto (Table.States (530), 269, 682);
- Add_Goto (Table.States (530), 274, 92);
- Add_Goto (Table.States (530), 284, 95);
- Add_Goto (Table.States (530), 292, 96);
- Add_Goto (Table.States (530), 307, 103);
- Add_Goto (Table.States (530), 308, 104);
- Add_Goto (Table.States (530), 310, 106);
- Add_Goto (Table.States (530), 311, 107);
- Add_Goto (Table.States (530), 312, 108);
- Add_Goto (Table.States (530), 314, 109);
- Add_Goto (Table.States (530), 316, 110);
- Add_Goto (Table.States (530), 319, 112);
- Add_Goto (Table.States (530), 320, 113);
- Add_Goto (Table.States (530), 322, 114);
- Add_Goto (Table.States (530), 328, 116);
- Add_Goto (Table.States (530), 334, 117);
- Table.States (530).Kernel := To_Vector ((((307, 0), 35, 5,
(2147483647, 0), 0), ((307, 1), 35, 2,
- (2147483647, 0), 0)));
- Table.States (530).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (162, 1), 0)));
- Table.States (531).Action_List.Set_Capacity (1);
- Add_Action (Table.States (531), 99, (279, 0), 683);
- Table.States (531).Kernel := To_Vector ((0 => ((279, 0), 195, 1,
(2147483647, 0), 0)));
- Table.States (531).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (279, 0), 99, 683)));
- Table.States (532).Action_List.Set_Capacity (1);
- Add_Action (Table.States (532), 99, (293, 0), 684);
- Table.States (532).Kernel := To_Vector ((0 => ((293, 0), 5, 1,
(2147483647, 0), 0)));
- Table.States (532).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (293, 0), 99, 684)));
- Table.States (533).Action_List.Set_Capacity (10);
- Add_Action (Table.States (533), 7, Reduce, (157, 1), 0, null,
null);
- Add_Action (Table.States (533), 16, (157, 0), 576);
- Add_Action (Table.States (533), 21, Reduce, (157, 1), 0, null,
null);
- Add_Action (Table.States (533), 40, Reduce, (157, 1), 0, null,
null);
- Add_Action (Table.States (533), 81, Reduce, (157, 1), 0, null,
null);
- Add_Action (Table.States (533), 85, Reduce, (157, 1), 0, null,
null);
- Add_Action (Table.States (533), 99, Reduce, (157, 1), 0, null,
null);
- Add_Action (Table.States (533), 107, Reduce, (157, 1), 0, null,
null);
- Add_Action (Table.States (533), 108, Reduce, (157, 1), 0, null,
null);
- Add_Action (Table.States (533), 109, Reduce, (157, 1), 0, null,
null);
- Table.States (533).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (533), 157, 685);
- Table.States (533).Kernel := To_Vector ((((197, 0), 121, 2,
(2147483647, 0), 0), ((197, 1), 121, 1,
- (2147483647, 0), 0)));
- Table.States (533).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (157, 1), 0)));
- Table.States (534).Action_List.Set_Capacity (1);
- Add_Action (Table.States (534), 24, (199, 0), 686);
- Table.States (534).Kernel := To_Vector ((0 => ((199, 0), 221, 3,
(2147483647, 0), 0)));
- Table.States (534).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (199, 0), 24, 686)));
- Table.States (535).Action_List.Set_Capacity (7);
- Add_Action (Table.States (535), 29, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (535), 40, (249, 0), 12);
- Add_Action (Table.States (535), 46, (249, 1), 14);
- Add_Action (Table.States (535), 47, (250, 0), 687);
- Add_Action (Table.States (535), 50, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (535), 51, (267, 0), 688);
- Add_Action (Table.States (535), 66, (319, 0), 689);
- Table.States (535).Goto_List.Set_Capacity (8);
- Add_Goto (Table.States (535), 210, 62);
- Add_Goto (Table.States (535), 249, 690);
- Add_Goto (Table.States (535), 250, 79);
- Add_Goto (Table.States (535), 265, 88);
- Add_Goto (Table.States (535), 266, 691);
- Add_Goto (Table.States (535), 267, 90);
- Add_Goto (Table.States (535), 310, 106);
- Add_Goto (Table.States (535), 319, 112);
- Table.States (535).Kernel := To_Vector ((0 => ((318, 0), 78, 6,
(2147483647, 0), 0)));
- Table.States (535).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (249, 2), 0)));
- Table.States (536).Action_List.Set_Capacity (3);
- Add_Action (Table.States (536), 4, (116, 0), 1);
- Add_Action (Table.States (536), 18, (164, 0), 4);
- Add_Action (Table.States (536), 67, (298, 1), 692);
- Table.States (536).Goto_List.Set_Capacity (3);
- Add_Goto (Table.States (536), 116, 693);
- Add_Goto (Table.States (536), 163, 694);
- Add_Goto (Table.States (536), 164, 541);
- Table.States (536).Kernel := To_Vector ((((298, 0), 90, 3,
(2147483647, 0), 0), ((298, 1), 90, 2,
- (2147483647, 0), 0), ((298, 2), 90, 2, (2147483647, 0), 0)));
- Table.States (536).Minimal_Complete_Actions := To_Vector (((Shift,
(298, 1), 67, 692), (Shift, (164, 0),
- 18, 4)));
- Table.States (537).Action_List.Set_Capacity (5);
- Add_Action (Table.States (537), (13, 17, 28, 37, 73), (134, 0),
2, block_label_0'Access,
- block_label_0_check'Access);
- Table.States (537).Kernel := To_Vector ((0 => ((134, 0), 84, 0,
(134, 0), 2)));
- Table.States (537).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (134, 0), 2)));
- Table.States (538).Action_List.Set_Capacity (30);
- Add_Action (Table.States (538), (4, 5, 13, 15, 17, 18, 22, 23, 24,
26, 27, 28, 31, 32, 37, 41, 43, 48, 52,
- 57, 58, 61, 68, 72, 73, 81, 96, 107, 108, 109), (302, 0), 2,
null, null);
- Table.States (538).Kernel := To_Vector ((0 => ((302, 0), 309, 0,
(302, 0), 2)));
- Table.States (538).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (302, 0), 2)));
- Table.States (539).Action_List.Set_Capacity (1);
- Add_Action (Table.States (539), 24, (155, 0), 695);
- Table.States (539).Kernel := To_Vector ((0 => ((155, 0), 303, 3,
(2147483647, 0), 0)));
- Table.States (539).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (155, 0), 24, 695)));
- Table.States (540).Action_List.Set_Capacity (1);
- Add_Action (Table.States (540), 24, (326, 0), 696);
- Table.States (540).Kernel := To_Vector ((0 => ((326, 0), 163, 3,
(2147483647, 0), 0)));
- Table.States (540).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (326, 0), 24, 696)));
- Table.States (541).Action_List.Set_Capacity (26);
- Add_Action (Table.States (541), 4, (116, 0), 1);
- Add_Action (Table.States (541), 5, (306, 8), 2);
- Add_Action (Table.States (541), 13, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (541), 15, (142, 0), 3);
- Add_Action (Table.States (541), 17, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (541), 18, (164, 0), 4);
- Add_Action (Table.States (541), 22, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (541), 24, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (541), 27, (193, 0), 5);
- Add_Action (Table.States (541), 28, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (541), 31, (306, 3), 9);
- Add_Action (Table.States (541), 32, (225, 0), 10);
- Add_Action (Table.States (541), 37, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (541), 41, (306, 0), 13);
- Add_Action (Table.States (541), 43, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (541), 48, (260, 0), 16);
- Add_Action (Table.States (541), 52, (279, 0), 20);
- Add_Action (Table.States (541), 57, (293, 0), 21);
- Add_Action (Table.States (541), 58, (199, 0), 22);
- Add_Action (Table.States (541), 61, (129, 0), 24);
- Add_Action (Table.States (541), 73, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (541), 81, (242, 8), 31);
- Add_Action (Table.States (541), 96, (220, 0), 32);
- Add_Action (Table.States (541), 107, (134, 0), 363);
- Add_Action (Table.States (541), 108, (242, 7), 34);
- Add_Action (Table.States (541), 109, (242, 6), 35);
- Table.States (541).Goto_List.Set_Capacity (31);
- Add_Goto (Table.States (541), 116, 37);
- Add_Goto (Table.States (541), 126, 39);
- Add_Goto (Table.States (541), 129, 40);
- Add_Goto (Table.States (541), 131, 42);
- Add_Goto (Table.States (541), 134, 43);
- Add_Goto (Table.States (541), 135, 44);
- Add_Goto (Table.States (541), 136, 45);
- Add_Goto (Table.States (541), 142, 48);
- Add_Goto (Table.States (541), 154, 51);
- Add_Goto (Table.States (541), 155, 52);
- Add_Goto (Table.States (541), 164, 54);
- Add_Goto (Table.States (541), 193, 58);
- Add_Goto (Table.States (541), 199, 60);
- Add_Goto (Table.States (541), 220, 69);
- Add_Goto (Table.States (541), 225, 71);
- Add_Goto (Table.States (541), 235, 73);
- Add_Goto (Table.States (541), 242, 74);
- Add_Goto (Table.States (541), 260, 84);
- Add_Goto (Table.States (541), 264, 87);
- Add_Goto (Table.States (541), 275, 93);
- Add_Goto (Table.States (541), 279, 94);
- Add_Goto (Table.States (541), 293, 97);
- Add_Goto (Table.States (541), 296, 98);
- Add_Goto (Table.States (541), 297, 99);
- Add_Goto (Table.States (541), 301, 100);
- Add_Goto (Table.States (541), 302, 364);
- Add_Goto (Table.States (541), 303, 697);
- Add_Goto (Table.States (541), 305, 101);
- Add_Goto (Table.States (541), 306, 102);
- Add_Goto (Table.States (541), 309, 366);
- Add_Goto (Table.States (541), 326, 115);
- Table.States (541).Kernel := To_Vector ((0 => ((163, 0), 164, 0,
(303, 1), 0)));
- Table.States (541).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (303, 1), 0)));
- Table.States (542).Action_List.Set_Capacity (3);
- Add_Action (Table.States (542), (22, 24, 43), (299, 0), 3,
select_alternative_list_0'Access, null);
- Table.States (542).Kernel := To_Vector ((0 => ((299, 0), 298, 0,
(299, 0), 3)));
- Table.States (542).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (299, 0), 3)));
- Table.States (543).Action_List.Set_Capacity (1);
- Add_Action (Table.States (543), 24, (297, 0), 698);
- Table.States (543).Kernel := To_Vector ((0 => ((297, 0), 303, 3,
(2147483647, 0), 0)));
- Table.States (543).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (297, 0), 24, 698)));
- Table.States (544).Action_List.Set_Capacity (1);
- Add_Action (Table.States (544), 99, (297, 1), 699);
- Table.States (544).Kernel := To_Vector ((0 => ((297, 1), 61, 1,
(2147483647, 0), 0)));
- Table.States (544).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (297, 1), 99, 699)));
- Table.States (545).Action_List.Set_Capacity (24);
- Add_Action (Table.States (545), 4, (116, 0), 1);
- Add_Action (Table.States (545), 5, (306, 8), 2);
- Add_Action (Table.States (545), 13, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (545), 15, (142, 0), 3);
- Add_Action (Table.States (545), 17, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (545), 18, (164, 0), 4);
- Add_Action (Table.States (545), 24, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (545), 27, (193, 0), 5);
- Add_Action (Table.States (545), 28, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (545), 31, (306, 3), 9);
- Add_Action (Table.States (545), 32, (225, 0), 10);
- Add_Action (Table.States (545), 37, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (545), 41, (306, 0), 13);
- Add_Action (Table.States (545), 48, (260, 0), 16);
- Add_Action (Table.States (545), 52, (279, 0), 20);
- Add_Action (Table.States (545), 57, (293, 0), 21);
- Add_Action (Table.States (545), 58, (199, 0), 22);
- Add_Action (Table.States (545), 61, (129, 0), 24);
- Add_Action (Table.States (545), 73, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (545), 81, (242, 8), 31);
- Add_Action (Table.States (545), 96, (220, 0), 32);
- Add_Action (Table.States (545), 107, (134, 0), 363);
- Add_Action (Table.States (545), 108, (242, 7), 34);
- Add_Action (Table.States (545), 109, (242, 6), 35);
- Table.States (545).Goto_List.Set_Capacity (31);
- Add_Goto (Table.States (545), 116, 37);
- Add_Goto (Table.States (545), 126, 39);
- Add_Goto (Table.States (545), 129, 40);
- Add_Goto (Table.States (545), 131, 42);
- Add_Goto (Table.States (545), 134, 43);
- Add_Goto (Table.States (545), 135, 44);
- Add_Goto (Table.States (545), 136, 45);
- Add_Goto (Table.States (545), 142, 48);
- Add_Goto (Table.States (545), 154, 51);
- Add_Goto (Table.States (545), 155, 52);
- Add_Goto (Table.States (545), 164, 54);
- Add_Goto (Table.States (545), 193, 58);
- Add_Goto (Table.States (545), 199, 60);
- Add_Goto (Table.States (545), 220, 69);
- Add_Goto (Table.States (545), 225, 71);
- Add_Goto (Table.States (545), 235, 73);
- Add_Goto (Table.States (545), 242, 74);
- Add_Goto (Table.States (545), 260, 84);
- Add_Goto (Table.States (545), 264, 87);
- Add_Goto (Table.States (545), 275, 93);
- Add_Goto (Table.States (545), 279, 94);
- Add_Goto (Table.States (545), 293, 97);
- Add_Goto (Table.States (545), 296, 98);
- Add_Goto (Table.States (545), 297, 99);
- Add_Goto (Table.States (545), 301, 100);
- Add_Goto (Table.States (545), 302, 364);
- Add_Goto (Table.States (545), 303, 700);
- Add_Goto (Table.States (545), 305, 101);
- Add_Goto (Table.States (545), 306, 102);
- Add_Goto (Table.States (545), 309, 366);
- Add_Goto (Table.States (545), 326, 115);
- Table.States (545).Kernel := To_Vector ((0 => ((129, 0), 5, 3,
(2147483647, 0), 0)));
- Table.States (545).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (303, 1), 0)));
- Table.States (546).Action_List.Set_Capacity (2);
- Add_Action (Table.States (546), 74, (125, 0), 340);
- Add_Action (Table.States (546), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (546).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (546), 125, 701);
- Table.States (546).Kernel := To_Vector ((0 => ((316, 0), 317, 1,
(2147483647, 0), 0)));
- Table.States (546).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (547).Action_List.Set_Capacity (1);
- Add_Action (Table.States (547), 60, (320, 0), 702);
- Table.States (547).Kernel := To_Vector ((0 => ((320, 0), 35, 2,
(2147483647, 0), 0)));
- Table.States (547).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (320, 0), 60, 702)));
- Table.States (548).Action_List.Set_Capacity (1);
- Add_Action (Table.States (548), 35, (319, 0), 703);
- Table.States (548).Kernel := To_Vector ((0 => ((319, 0), 125, 4,
(2147483647, 0), 0)));
- Table.States (548).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (319, 0), 35, 703)));
- Table.States (549).Action_List.Set_Capacity (3);
- Add_Action (Table.States (549), 35, Reduce, (125, 1), 0, null,
null);
- Add_Action (Table.States (549), 74, (125, 0), 340);
- Add_Action (Table.States (549), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (549).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (549), 125, 704);
- Table.States (549).Kernel := To_Vector ((((322, 0), 172, 6,
(2147483647, 0), 0), ((322, 1), 172, 3,
- (2147483647, 0), 0), ((322, 2), 172, 1, (2147483647, 0), 0)));
- Table.States (549).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (550).Action_List.Set_Capacity (18);
- Add_Action (Table.States (550), 24, Reduce, (162, 1), 0, null,
null);
- Add_Action (Table.States (550), 25, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (550), 28, (124, 0), 185);
- Add_Action (Table.States (550), 29, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (550), 30, (213, 0), 8);
- Add_Action (Table.States (550), 39, (308, 0), 705);
- Add_Action (Table.States (550), 40, (249, 0), 12);
- Add_Action (Table.States (550), 46, (249, 1), 14);
- Add_Action (Table.States (550), 47, (216, 0), 15);
- Add_Action (Table.States (550), 48, (260, 0), 16);
- Add_Action (Table.States (550), 49, Reduce, (162, 1), 0, null,
null);
- Add_Action (Table.States (550), 50, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (550), 51, (267, 0), 19);
- Add_Action (Table.States (550), 63, (316, 0), 25);
- Add_Action (Table.States (550), 66, (308, 0), 26);
- Add_Action (Table.States (550), 69, (209, 0), 27);
- Add_Action (Table.States (550), 71, (334, 0), 28);
- Add_Action (Table.States (550), 107, (222, 1), 187);
- Table.States (550).Goto_List.Set_Capacity (54);
- Add_Goto (Table.States (550), 115, 36);
- Add_Goto (Table.States (550), 124, 38);
- Add_Goto (Table.States (550), 130, 41);
- Add_Goto (Table.States (550), 137, 46);
- Add_Goto (Table.States (550), 138, 47);
- Add_Goto (Table.States (550), 160, 394);
- Add_Goto (Table.States (550), 161, 395);
- Add_Goto (Table.States (550), 162, 706);
- Add_Goto (Table.States (550), 182, 55);
- Add_Goto (Table.States (550), 185, 56);
- Add_Goto (Table.States (550), 189, 57);
- Add_Goto (Table.States (550), 196, 59);
- Add_Goto (Table.States (550), 209, 61);
- Add_Goto (Table.States (550), 210, 62);
- Add_Goto (Table.States (550), 212, 63);
- Add_Goto (Table.States (550), 213, 64);
- Add_Goto (Table.States (550), 216, 65);
- Add_Goto (Table.States (550), 217, 66);
- Add_Goto (Table.States (550), 218, 67);
- Add_Goto (Table.States (550), 219, 68);
- Add_Goto (Table.States (550), 222, 70);
- Add_Goto (Table.States (550), 226, 72);
- Add_Goto (Table.States (550), 246, 75);
- Add_Goto (Table.States (550), 247, 76);
- Add_Goto (Table.States (550), 248, 77);
- Add_Goto (Table.States (550), 249, 78);
- Add_Goto (Table.States (550), 250, 79);
- Add_Goto (Table.States (550), 251, 80);
- Add_Goto (Table.States (550), 252, 81);
- Add_Goto (Table.States (550), 253, 82);
- Add_Goto (Table.States (550), 254, 83);
- Add_Goto (Table.States (550), 260, 397);
- Add_Goto (Table.States (550), 262, 85);
- Add_Goto (Table.States (550), 263, 86);
- Add_Goto (Table.States (550), 265, 88);
- Add_Goto (Table.States (550), 266, 89);
- Add_Goto (Table.States (550), 267, 90);
- Add_Goto (Table.States (550), 268, 91);
- Add_Goto (Table.States (550), 274, 92);
- Add_Goto (Table.States (550), 284, 95);
- Add_Goto (Table.States (550), 292, 96);
- Add_Goto (Table.States (550), 307, 103);
- Add_Goto (Table.States (550), 308, 104);
- Add_Goto (Table.States (550), 310, 106);
- Add_Goto (Table.States (550), 311, 107);
- Add_Goto (Table.States (550), 312, 108);
- Add_Goto (Table.States (550), 314, 109);
- Add_Goto (Table.States (550), 316, 110);
- Add_Goto (Table.States (550), 319, 112);
- Add_Goto (Table.States (550), 320, 113);
- Add_Goto (Table.States (550), 321, 707);
- Add_Goto (Table.States (550), 322, 114);
- Add_Goto (Table.States (550), 328, 116);
- Add_Goto (Table.States (550), 334, 117);
- Table.States (550).Kernel := To_Vector ((((308, 0), 35, 5,
(2147483647, 0), 0), ((308, 1), 35, 2,
- (2147483647, 0), 0)));
- Table.States (550).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (321, 1), 0)));
- Table.States (551).Action_List.Set_Capacity (41);
- Add_Action (Table.States (551), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (308, 2), 4,
- single_task_declaration_2'Access, null);
- Table.States (551).Kernel := To_Vector ((0 => ((308, 2), 99, 0,
(308, 2), 4)));
- Table.States (551).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (308, 2), 4)));
- Table.States (552).Action_List.Set_Capacity (1);
- Add_Action (Table.States (552), 78, (172, 0), 708);
- Table.States (552).Kernel := To_Vector ((0 => ((172, 0), 83, 1,
(2147483647, 0), 0)));
- Table.States (552).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (172, 0), 78, 708)));
- Table.States (553).Action_List.Set_Capacity (2);
- Add_Action (Table.States (553), (78, 99), (174, 1), 1, null,
null);
- Table.States (553).Kernel := To_Vector ((0 => ((174, 1), 173, 0,
(174, 1), 1)));
- Table.States (553).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (174, 1), 1)));
- Table.States (554).Action_List.Set_Capacity (2);
- Add_Action (Table.States (554), 78, (172, 1), 709);
- Add_Action (Table.States (554), 99, (174, 0), 710);
- Table.States (554).Kernel := To_Vector ((((172, 1), 174, 1,
(2147483647, 0), 0), ((174, 0), 174, 1,
- (2147483647, 0), 0)));
- Table.States (554).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (172, 1), 78, 709)));
- Table.States (555).Action_List.Set_Capacity (2);
- Add_Action (Table.States (555), 84, (173, 0), 711);
- Add_Action (Table.States (555), 86, (222, 0), 236);
- Table.States (555).Kernel := To_Vector ((((173, 0), 222, 3,
(2147483647, 0), 0), ((173, 1), 222, 4,
- (2147483647, 0), 0), ((173, 2), 222, 2, (2147483647, 0), 0),
((173, 3), 222, 3, (2147483647, 0), 0),
- ((222, 0), 222, 2, (2147483647, 0), 0)));
- Table.States (555).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (173, 0), 84, 711)));
- Table.States (556).Action_List.Set_Capacity (19);
- Add_Action (Table.States (556), 6, (112, 0), 712);
- Add_Action (Table.States (556), 7, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (556), 11, (123, 0), 713);
- Add_Action (Table.States (556), 19, (329, 4), 714);
- Add_Action (Table.States (556), 20, (329, 3), 715);
- Add_Action (Table.States (556), 34, (231, 8), 716);
- Add_Action (Table.States (556), 36, (112, 3), 717);
- Add_Action (Table.States (556), 38, (329, 2), 718);
- Add_Action (Table.States (556), 39, Reduce, (112, 5), 0, null,
null);
- Add_Conflict (Table.States (556), 39, (113, 3), 0, null, null);
- Add_Action (Table.States (556), 40, (244, 0), 389);
- Add_Action (Table.States (556), 41, Reduce, (114, 5), 0, null,
null);
- Add_Action (Table.States (556), 49, Reduce, (114, 5), 0, null,
null);
- Add_Action (Table.States (556), 51, (231, 2), 720);
- Add_Action (Table.States (556), 53, (329, 1), 721);
- Add_Action (Table.States (556), 54, Reduce, (114, 5), 0, null,
null);
- Add_Action (Table.States (556), 64, (112, 4), 723);
- Add_Action (Table.States (556), 65, (114, 2), 724);
- Add_Action (Table.States (556), 66, (231, 1), 725);
- Add_Action (Table.States (556), 76, (186, 0), 726);
- Table.States (556).Goto_List.Set_Capacity (10);
- Add_Goto (Table.States (556), 112, 727);
- Add_Goto (Table.States (556), 113, 728);
- Add_Goto (Table.States (556), 114, 729);
- Add_Goto (Table.States (556), 117, 730);
- Add_Goto (Table.States (556), 123, 731);
- Add_Goto (Table.States (556), 165, 732);
- Add_Goto (Table.States (556), 186, 733);
- Add_Goto (Table.States (556), 231, 734);
- Add_Goto (Table.States (556), 244, 735);
- Add_Goto (Table.States (556), 329, 736);
- Table.States (556).Kernel := To_Vector ((((209, 0), 35, 2,
(2147483647, 0), 0), ((226, 0), 35, 2,
- (2147483647, 0), 0), ((262, 0), 35, 5, (2147483647, 0), 0),
((263, 0), 35, 2, (2147483647, 0), 0)));
- Table.States (556).Minimal_Complete_Actions := To_Vector (((Shift,
(329, 2), 38, 718), (Shift, (114, 2),
- 65, 724), (Reduce, (114, 5), 0)));
- Table.States (557).Action_List.Set_Capacity (41);
- Add_Action (Table.States (557), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (226, 1), 4,
- incomplete_type_declaration_1'Access, null);
- Table.States (557).Kernel := To_Vector ((0 => ((226, 1), 99, 0,
(226, 1), 4)));
- Table.States (557).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (226, 1), 4)));
- Table.States (558).Action_List.Set_Capacity (2);
- Add_Action (Table.States (558), 86, (241, 0), 384);
- Add_Action (Table.States (558), 99, (334, 0), 737);
- Table.States (558).Kernel := To_Vector ((((241, 0), 241, 2,
(2147483647, 0), 0), ((334, 0), 241, 1,
- (2147483647, 0), 0)));
- Table.States (558).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (334, 0), 99, 737)));
- Table.States (559).Action_List.Set_Capacity (41);
- Add_Action (Table.States (559), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (334, 1), 4,
- use_clause_1'Access, null);
- Table.States (559).Kernel := To_Vector ((0 => ((334, 1), 99, 0,
(334, 1), 4)));
- Table.States (559).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (334, 1), 4)));
- Table.States (560).Action_List.Set_Capacity (6);
- Add_Action (Table.States (560), 76, (118, 0), 237);
- Add_Action (Table.States (560), 86, Reduce, (241, 0), 3, null,
null);
- Add_Action (Table.States (560), 87, (296, 0), 239);
- Add_Action (Table.States (560), 99, Reduce, (241, 0), 3, null,
null);
- Add_Action (Table.States (560), 104, (325, 0), 241);
- Add_Action (Table.States (560), 105, (325, 1), 242);
- Table.States (560).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (560), 118, 243);
- Add_Goto (Table.States (560), 325, 244);
- Table.States (560).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((241, 0), 242, 0,
- (241, 0), 3), ((242, 0), 242, 5, (2147483647, 0), 0), ((242,
1), 242, 2, (2147483647, 0), 0), ((275,
- 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (560).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (241, 0), 3)));
- Table.States (561).Action_List.Set_Capacity (4);
- Add_Action (Table.States (561), 81, (242, 8), 31);
- Add_Action (Table.States (561), 107, (242, 5), 120);
- Add_Action (Table.States (561), 108, (242, 7), 34);
- Add_Action (Table.States (561), 109, (242, 6), 35);
- Table.States (561).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (561), 131, 42);
- Add_Goto (Table.States (561), 242, 738);
- Add_Goto (Table.States (561), 275, 93);
- Add_Goto (Table.States (561), 296, 98);
- Table.States (561).Kernel := To_Vector ((0 => ((248, 2), 56, 2,
(2147483647, 0), 0)));
- Table.States (561).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (562).Action_List.Set_Capacity (12);
- Add_Action (Table.States (562), (7, 21, 35, 56, 74, 78, 81, 85,
99, 107, 108, 109), (244, 0), 2, null,
- null);
- Table.States (562).Kernel := To_Vector ((0 => ((244, 0), 41, 0,
(244, 0), 2)));
- Table.States (562).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (244, 0), 2)));
- Table.States (563).Action_List.Set_Capacity (4);
- Add_Action (Table.States (563), 81, (242, 8), 31);
- Add_Action (Table.States (563), 107, (242, 5), 120);
- Add_Action (Table.States (563), 108, (242, 7), 34);
- Add_Action (Table.States (563), 109, (242, 6), 35);
- Table.States (563).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (563), 131, 42);
- Add_Goto (Table.States (563), 242, 739);
- Add_Goto (Table.States (563), 275, 93);
- Add_Goto (Table.States (563), 296, 98);
- Table.States (563).Kernel := To_Vector ((0 => ((248, 1), 56, 2,
(2147483647, 0), 0)));
- Table.States (563).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (564).Action_List.Set_Capacity (9);
- Add_Action (Table.States (564), 9, (211, 0), 740);
- Add_Action (Table.States (564), 16, (211, 1), 741);
- Add_Action (Table.States (564), 29, Reduce, (273, 1), 0, null,
null);
- Add_Action (Table.States (564), 50, Reduce, (273, 1), 0, null,
null);
- Add_Action (Table.States (564), 51, (273, 0), 742);
- Add_Action (Table.States (564), 81, Reduce, (211, 2), 0, null,
null);
- Add_Action (Table.States (564), 107, Reduce, (211, 2), 0, null,
null);
- Add_Action (Table.States (564), 108, Reduce, (211, 2), 0, null,
null);
- Add_Action (Table.States (564), 109, Reduce, (211, 2), 0, null,
null);
- Table.States (564).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (564), 211, 743);
- Add_Goto (Table.States (564), 273, 744);
- Table.States (564).Kernel := To_Vector ((((117, 0), 7, 1,
(2147483647, 0), 0), ((117, 1), 7, 2,
- (2147483647, 0), 0), ((117, 2), 7, 1, (2147483647, 0), 0)));
- Table.States (564).Minimal_Complete_Actions := To_Vector
(((Reduce, (273, 1), 0), (Reduce, (211, 2),
- 0)));
- Table.States (565).Action_List.Set_Capacity (5);
- Add_Action (Table.States (565), 56, (248, 0), 745);
- Add_Action (Table.States (565), 76, (118, 0), 237);
- Add_Action (Table.States (565), 87, (296, 0), 239);
- Add_Action (Table.States (565), 104, (325, 0), 241);
- Add_Action (Table.States (565), 105, (325, 1), 242);
- Table.States (565).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (565), 118, 243);
- Add_Goto (Table.States (565), 325, 244);
- Table.States (565).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((242, 0), 242, 5,
- (2147483647, 0), 0), ((242, 1), 242, 2, (2147483647, 0), 0),
((248, 0), 242, 3, (2147483647, 0), 0),
- ((275, 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (565).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (248, 0), 56, 745)));
- Table.States (566).Action_List.Set_Capacity (2);
- Add_Action (Table.States (566), 99, Reduce, (223, 1), 0, null,
null);
- Add_Action (Table.States (566), 107, (223, 0), 151);
- Table.States (566).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (566), 223, 746);
- Table.States (566).Kernel := To_Vector ((0 => ((136, 1), 24, 1,
(2147483647, 0), 0)));
- Table.States (566).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (223, 1), 0)));
- Table.States (567).Action_List.Set_Capacity (3);
- Add_Action (Table.States (567), 24, Reduce, (192, 1), 0, null,
null);
- Add_Action (Table.States (567), 48, (260, 0), 16);
- Add_Action (Table.States (567), 72, (190, 0), 747);
- Table.States (567).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (567), 190, 748);
- Add_Goto (Table.States (567), 191, 749);
- Add_Goto (Table.States (567), 192, 750);
- Add_Goto (Table.States (567), 260, 751);
- Table.States (567).Kernel := To_Vector ((0 => ((221, 0), 26, 0,
(192, 1), 0)));
- Table.States (567).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (192, 1), 0)));
- Table.States (568).Action_List.Set_Capacity (18);
- Add_Action (Table.States (568), (13, 24, 25, 28, 29, 30, 40, 46,
47, 48, 49, 50, 51, 63, 66, 69, 71, 107),
- (161, 0), 2, null, null);
- Table.States (568).Kernel := To_Vector ((0 => ((161, 0), 160, 0,
(161, 0), 2)));
- Table.States (568).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (161, 0), 2)));
- Table.States (569).Action_List.Set_Capacity (18);
- Add_Action (Table.States (569), (13, 24, 25, 28, 29, 30, 40, 46,
47, 48, 49, 50, 51, 63, 66, 69, 71, 107),
- (161, 1), 2, null, null);
- Table.States (569).Kernel := To_Vector ((0 => ((161, 1), 260, 0,
(161, 1), 2)));
- Table.States (569).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (161, 1), 2)));
- Table.States (570).Action_List.Set_Capacity (25);
- Add_Action (Table.States (570), 4, (116, 0), 1);
- Add_Action (Table.States (570), 5, (306, 8), 2);
- Add_Action (Table.States (570), 13, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (570), 15, (142, 0), 3);
- Add_Action (Table.States (570), 17, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (570), 18, (164, 0), 4);
- Add_Action (Table.States (570), 24, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (570), 26, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (570), 27, (193, 0), 5);
- Add_Action (Table.States (570), 28, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (570), 31, (306, 3), 9);
- Add_Action (Table.States (570), 32, (225, 0), 10);
- Add_Action (Table.States (570), 37, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (570), 41, (306, 0), 13);
- Add_Action (Table.States (570), 48, (260, 0), 16);
- Add_Action (Table.States (570), 52, (279, 0), 20);
- Add_Action (Table.States (570), 57, (293, 0), 21);
- Add_Action (Table.States (570), 58, (199, 0), 22);
- Add_Action (Table.States (570), 61, (129, 0), 24);
- Add_Action (Table.States (570), 73, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (570), 81, (242, 8), 31);
- Add_Action (Table.States (570), 96, (220, 0), 32);
- Add_Action (Table.States (570), 107, (134, 0), 363);
- Add_Action (Table.States (570), 108, (242, 7), 34);
- Add_Action (Table.States (570), 109, (242, 6), 35);
- Table.States (570).Goto_List.Set_Capacity (32);
- Add_Goto (Table.States (570), 116, 37);
- Add_Goto (Table.States (570), 126, 39);
- Add_Goto (Table.States (570), 129, 40);
- Add_Goto (Table.States (570), 131, 42);
- Add_Goto (Table.States (570), 134, 43);
- Add_Goto (Table.States (570), 135, 44);
- Add_Goto (Table.States (570), 136, 45);
- Add_Goto (Table.States (570), 142, 48);
- Add_Goto (Table.States (570), 154, 51);
- Add_Goto (Table.States (570), 155, 52);
- Add_Goto (Table.States (570), 164, 54);
- Add_Goto (Table.States (570), 193, 58);
- Add_Goto (Table.States (570), 199, 60);
- Add_Goto (Table.States (570), 220, 69);
- Add_Goto (Table.States (570), 221, 752);
- Add_Goto (Table.States (570), 225, 71);
- Add_Goto (Table.States (570), 235, 73);
- Add_Goto (Table.States (570), 242, 74);
- Add_Goto (Table.States (570), 260, 84);
- Add_Goto (Table.States (570), 264, 87);
- Add_Goto (Table.States (570), 275, 93);
- Add_Goto (Table.States (570), 279, 94);
- Add_Goto (Table.States (570), 293, 97);
- Add_Goto (Table.States (570), 296, 98);
- Add_Goto (Table.States (570), 297, 99);
- Add_Goto (Table.States (570), 301, 100);
- Add_Goto (Table.States (570), 302, 364);
- Add_Goto (Table.States (570), 303, 393);
- Add_Goto (Table.States (570), 305, 101);
- Add_Goto (Table.States (570), 306, 102);
- Add_Goto (Table.States (570), 309, 366);
- Add_Goto (Table.States (570), 326, 115);
- Table.States (570).Kernel := To_Vector ((0 => ((136, 0), 13, 2,
(2147483647, 0), 0)));
- Table.States (570).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (221, 1), 0)));
- end Subr_11;
- procedure Subr_12
- is begin
- Table.States (571).Action_List.Set_Capacity (1);
- Add_Action (Table.States (571), 37, (235, 1), 753);
- Table.States (571).Kernel := To_Vector ((0 => ((235, 1), 24, 2,
(2147483647, 0), 0)));
- Table.States (571).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (235, 1), 37, 753)));
- Table.States (572).Action_List.Set_Capacity (1);
- Add_Action (Table.States (572), 24, (235, 0), 754);
- Table.States (572).Kernel := To_Vector ((0 => ((235, 0), 303, 3,
(2147483647, 0), 0)));
- Table.States (572).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (235, 0), 24, 754)));
- Table.States (573).Action_List.Set_Capacity (41);
- Add_Action (Table.States (573), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (219, 0), 4,
- generic_subprogram_declaration_0'Access, null);
- Table.States (573).Kernel := To_Vector ((0 => ((219, 0), 99, 0,
(219, 0), 4)));
- Table.States (573).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (219, 0), 4)));
- Table.States (574).Action_List.Set_Capacity (15);
- Add_Action (Table.States (574), 3, (200, 2), 122);
- Add_Action (Table.States (574), 39, (261, 4), 123);
- Add_Action (Table.States (574), 40, (200, 3), 124);
- Add_Action (Table.States (574), 41, (261, 1), 125);
- Add_Action (Table.States (574), 52, (278, 0), 126);
- Add_Action (Table.States (574), 76, (120, 0), 127);
- Add_Action (Table.States (574), 77, (120, 5), 128);
- Add_Action (Table.States (574), 81, (242, 8), 31);
- Add_Action (Table.States (574), 97, (333, 1), 129);
- Add_Action (Table.States (574), 98, (333, 0), 130);
- Add_Action (Table.States (574), 99, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (574), 106, (261, 0), 131);
- Add_Action (Table.States (574), 107, (242, 5), 120);
- Add_Action (Table.States (574), 108, (242, 7), 34);
- Add_Action (Table.States (574), 109, (242, 6), 35);
- Table.States (574).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (574), 120, 132);
- Add_Goto (Table.States (574), 131, 42);
- Add_Goto (Table.States (574), 194, 133);
- Add_Goto (Table.States (574), 195, 755);
- Add_Goto (Table.States (574), 200, 135);
- Add_Goto (Table.States (574), 242, 136);
- Add_Goto (Table.States (574), 261, 137);
- Add_Goto (Table.States (574), 275, 93);
- Add_Goto (Table.States (574), 278, 138);
- Add_Goto (Table.States (574), 285, 139);
- Add_Goto (Table.States (574), 286, 140);
- Add_Goto (Table.States (574), 287, 141);
- Add_Goto (Table.States (574), 288, 142);
- Add_Goto (Table.States (574), 289, 143);
- Add_Goto (Table.States (574), 290, 144);
- Add_Goto (Table.States (574), 296, 98);
- Add_Goto (Table.States (574), 304, 145);
- Add_Goto (Table.States (574), 323, 146);
- Add_Goto (Table.States (574), 324, 147);
- Add_Goto (Table.States (574), 333, 148);
- Table.States (574).Kernel := To_Vector ((0 => ((160, 9), 85, 1,
(2147483647, 0), 0)));
- Table.States (574).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (575).Action_List.Set_Capacity (41);
- Add_Action (Table.States (575), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (189, 0), 4,
- exception_declaration_0'Access, null);
- Table.States (575).Kernel := To_Vector ((0 => ((189, 0), 99, 0,
(189, 0), 4)));
- Table.States (575).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (189, 0), 4)));
- Table.States (576).Action_List.Set_Capacity (11);
- Add_Action (Table.States (576), (7, 11, 21, 40, 74, 81, 85, 99,
107, 108, 109), (157, 0), 1, null, null);
- Table.States (576).Kernel := To_Vector ((0 => ((157, 0), 16, 0,
(157, 0), 1)));
- Table.States (576).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (157, 0), 1)));
- Table.States (577).Action_List.Set_Capacity (7);
- Add_Action (Table.States (577), 7, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (577), 11, (123, 0), 713);
- Add_Action (Table.States (577), 40, (244, 0), 756);
- Add_Action (Table.States (577), 81, (242, 8), 31);
- Add_Action (Table.States (577), 107, (242, 5), 120);
- Add_Action (Table.States (577), 108, (242, 7), 34);
- Add_Action (Table.States (577), 109, (242, 6), 35);
- Table.States (577).Goto_List.Set_Capacity (8);
- Add_Goto (Table.States (577), 117, 757);
- Add_Goto (Table.States (577), 123, 758);
- Add_Goto (Table.States (577), 131, 42);
- Add_Goto (Table.States (577), 242, 491);
- Add_Goto (Table.States (577), 244, 735);
- Add_Goto (Table.States (577), 275, 93);
- Add_Goto (Table.States (577), 296, 98);
- Add_Goto (Table.States (577), 317, 759);
- Table.States (577).Kernel := To_Vector ((((247, 0), 157, 3,
(2147483647, 0), 0), ((247, 1), 157, 4,
- (2147483647, 0), 0), ((247, 2), 157, 10, (2147483647, 0), 0),
((247, 3), 157, 2, (2147483647, 0),
- 0), ((247, 4), 157, 3, (2147483647, 0), 0), ((247, 5), 157,
9, (2147483647, 0), 0)));
- Table.States (577).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (578).Action_List.Set_Capacity (65);
- Add_Action (Table.States (578), (4, 5, 10, 13, 15, 17, 18, 20, 21,
22, 23, 27, 28, 31, 32, 33, 35, 37, 38,
- 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74,
75, 76, 78, 79, 80, 81, 82, 85, 86, 87, 88,
- 89, 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104,
105, 107, 108, 109), (118, 0), 3,
- actual_parameter_part_0'Access, null);
- Table.States (578).Kernel := To_Vector ((0 => ((118, 0), 78, 0,
(118, 0), 3)));
- Table.States (578).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (118, 0), 3)));
- Table.States (579).Action_List.Set_Capacity (65);
- Add_Action (Table.States (579), (4, 5, 10, 13, 15, 17, 18, 20, 21,
22, 23, 27, 28, 31, 32, 33, 35, 37, 38,
- 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74,
75, 76, 78, 79, 80, 81, 82, 85, 86, 87, 88,
- 89, 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104,
105, 107, 108, 109), (118, 1), 3,
- actual_parameter_part_1'Access, null);
- Table.States (579).Kernel := To_Vector ((0 => ((118, 1), 78, 0,
(118, 1), 3)));
- Table.States (579).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (118, 1), 3)));
- Table.States (580).Action_List.Set_Capacity (65);
- Add_Action (Table.States (580), (4, 5, 10, 13, 15, 17, 18, 20, 21,
22, 23, 27, 28, 31, 32, 33, 35, 37, 38,
- 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74,
75, 76, 78, 79, 80, 81, 82, 85, 86, 87, 88,
- 89, 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104,
105, 107, 108, 109), (242, 0), 4,
- name_0'Access, null);
- Table.States (580).Kernel := To_Vector ((0 => ((242, 0), 78, 0,
(242, 0), 4)));
- Table.States (580).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (242, 0), 4)));
- Table.States (581).Action_List.Set_Capacity (13);
- Add_Action (Table.States (581), 3, (200, 2), 122);
- Add_Action (Table.States (581), 39, (261, 4), 123);
- Add_Action (Table.States (581), 40, (200, 3), 124);
- Add_Action (Table.States (581), 41, (261, 1), 125);
- Add_Action (Table.States (581), 76, (120, 0), 127);
- Add_Action (Table.States (581), 77, (120, 5), 128);
- Add_Action (Table.States (581), 81, (242, 8), 31);
- Add_Action (Table.States (581), 97, (333, 1), 129);
- Add_Action (Table.States (581), 98, (333, 0), 130);
- Add_Action (Table.States (581), 106, (261, 0), 131);
- Add_Action (Table.States (581), 107, (242, 5), 120);
- Add_Action (Table.States (581), 108, (242, 7), 34);
- Add_Action (Table.States (581), 109, (242, 6), 35);
- Table.States (581).Goto_List.Set_Capacity (12);
- Add_Goto (Table.States (581), 120, 132);
- Add_Goto (Table.States (581), 131, 42);
- Add_Goto (Table.States (581), 200, 135);
- Add_Goto (Table.States (581), 242, 276);
- Add_Goto (Table.States (581), 261, 137);
- Add_Goto (Table.States (581), 275, 93);
- Add_Goto (Table.States (581), 280, 760);
- Add_Goto (Table.States (581), 296, 98);
- Add_Goto (Table.States (581), 304, 486);
- Add_Goto (Table.States (581), 323, 146);
- Add_Goto (Table.States (581), 324, 147);
- Add_Goto (Table.States (581), 333, 148);
- Table.States (581).Kernel := To_Vector ((0 => ((281, 0), 86, 3,
(2147483647, 0), 0)));
- Table.States (581).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (582).Action_List.Set_Capacity (47);
- Add_Action (Table.States (582), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (126, 0), 4, assignment_statement_0'Access, null);
- Table.States (582).Kernel := To_Vector ((0 => ((126, 0), 99, 0,
(126, 0), 4)));
- Table.States (582).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (126, 0), 4)));
- Table.States (583).Action_List.Set_Capacity (14);
- Add_Action (Table.States (583), 3, (200, 2), 122);
- Add_Action (Table.States (583), 39, (261, 4), 123);
- Add_Action (Table.States (583), 40, (200, 3), 124);
- Add_Action (Table.States (583), 41, (261, 1), 125);
- Add_Action (Table.States (583), 52, (278, 0), 126);
- Add_Action (Table.States (583), 76, (120, 0), 127);
- Add_Action (Table.States (583), 77, (120, 5), 128);
- Add_Action (Table.States (583), 81, (242, 8), 31);
- Add_Action (Table.States (583), 97, (333, 1), 129);
- Add_Action (Table.States (583), 98, (333, 0), 130);
- Add_Action (Table.States (583), 106, (261, 0), 131);
- Add_Action (Table.States (583), 107, (242, 5), 120);
- Add_Action (Table.States (583), 108, (242, 7), 34);
- Add_Action (Table.States (583), 109, (242, 6), 35);
- Table.States (583).Goto_List.Set_Capacity (19);
- Add_Goto (Table.States (583), 120, 132);
- Add_Goto (Table.States (583), 131, 42);
- Add_Goto (Table.States (583), 194, 761);
- Add_Goto (Table.States (583), 200, 135);
- Add_Goto (Table.States (583), 242, 136);
- Add_Goto (Table.States (583), 261, 137);
- Add_Goto (Table.States (583), 275, 93);
- Add_Goto (Table.States (583), 278, 138);
- Add_Goto (Table.States (583), 285, 139);
- Add_Goto (Table.States (583), 286, 140);
- Add_Goto (Table.States (583), 287, 141);
- Add_Goto (Table.States (583), 288, 142);
- Add_Goto (Table.States (583), 289, 143);
- Add_Goto (Table.States (583), 290, 144);
- Add_Goto (Table.States (583), 296, 98);
- Add_Goto (Table.States (583), 304, 145);
- Add_Goto (Table.States (583), 323, 146);
- Add_Goto (Table.States (583), 324, 147);
- Add_Goto (Table.States (583), 333, 148);
- Table.States (583).Kernel := To_Vector ((0 => ((132, 0), 76, 2,
(2147483647, 0), 0)));
- Table.States (583).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (584).Action_List.Set_Capacity (15);
- Add_Action (Table.States (584), 3, (200, 2), 122);
- Add_Action (Table.States (584), 39, (261, 4), 123);
- Add_Action (Table.States (584), 40, (200, 3), 481);
- Add_Action (Table.States (584), 41, (261, 1), 125);
- Add_Action (Table.States (584), 76, (120, 0), 127);
- Add_Action (Table.States (584), 77, (120, 5), 128);
- Add_Action (Table.States (584), 78, Reduce, (257, 4), 0, null,
null);
- Add_Action (Table.States (584), 81, (242, 8), 31);
- Add_Action (Table.States (584), 97, (333, 1), 129);
- Add_Action (Table.States (584), 98, (333, 0), 130);
- Add_Action (Table.States (584), 99, Reduce, (257, 4), 0, null,
null);
- Add_Action (Table.States (584), 106, (261, 0), 131);
- Add_Action (Table.States (584), 107, (222, 1), 499);
- Add_Action (Table.States (584), 108, (242, 7), 34);
- Add_Action (Table.States (584), 109, (242, 6), 35);
- Table.States (584).Goto_List.Set_Capacity (17);
- Add_Goto (Table.States (584), 120, 132);
- Add_Goto (Table.States (584), 131, 42);
- Add_Goto (Table.States (584), 170, 762);
- Add_Goto (Table.States (584), 200, 135);
- Add_Goto (Table.States (584), 222, 500);
- Add_Goto (Table.States (584), 242, 484);
- Add_Goto (Table.States (584), 257, 501);
- Add_Goto (Table.States (584), 258, 502);
- Add_Goto (Table.States (584), 261, 137);
- Add_Goto (Table.States (584), 275, 93);
- Add_Goto (Table.States (584), 280, 485);
- Add_Goto (Table.States (584), 296, 98);
- Add_Goto (Table.States (584), 304, 486);
- Add_Goto (Table.States (584), 317, 487);
- Add_Goto (Table.States (584), 323, 146);
- Add_Goto (Table.States (584), 324, 147);
- Add_Goto (Table.States (584), 333, 148);
- Table.States (584).Kernel := To_Vector ((((182, 0), 76, 3,
(2147483647, 0), 0), ((202, 0), 76, 1,
- (2147483647, 0), 0)));
- Table.States (584).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (258, 1), 0)));
- Table.States (585).Action_List.Set_Capacity (2);
- Add_Action (Table.States (585), 74, (125, 0), 340);
- Add_Action (Table.States (585), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (585).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (585), 125, 763);
- Table.States (585).Kernel := To_Vector ((0 => ((182, 1), 256, 1,
(2147483647, 0), 0)));
- Table.States (585).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (586).Action_List.Set_Capacity (1);
- Add_Action (Table.States (586), 39, (216, 2), 764);
- Table.States (586).Kernel := To_Vector ((0 => ((216, 2), 35, 3,
(2147483647, 0), 0)));
- Table.States (586).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (216, 2), 39, 764)));
- Table.States (587).Action_List.Set_Capacity (1);
- Add_Action (Table.States (587), 39, (216, 1), 765);
- Table.States (587).Kernel := To_Vector ((0 => ((216, 1), 35, 3,
(2147483647, 0), 0)));
- Table.States (587).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (216, 1), 39, 765)));
- Table.States (588).Action_List.Set_Capacity (23);
- Add_Action (Table.States (588), 3, (200, 2), 122);
- Add_Action (Table.States (588), 15, (139, 0), 260);
- Add_Action (Table.States (588), 28, (127, 6), 261);
- Add_Action (Table.States (588), 32, (224, 0), 262);
- Add_Action (Table.States (588), 39, (261, 4), 123);
- Add_Action (Table.States (588), 40, (168, 1), 263);
- Add_Action (Table.States (588), 41, (120, 1), 264);
- Add_Action (Table.States (588), 44, (168, 3), 265);
- Add_Action (Table.States (588), 52, (278, 0), 126);
- Add_Action (Table.States (588), 74, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (588), 76, (120, 0), 127);
- Add_Action (Table.States (588), 77, (120, 5), 128);
- Add_Action (Table.States (588), 78, Reduce, (127, 5), 0, null,
null);
- Add_Conflict (Table.States (588), 78, (195, 1), 0, null, null);
- Add_Action (Table.States (588), 81, (242, 8), 31);
- Add_Action (Table.States (588), 82, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (588), 86, Reduce, (127, 5), 0, null,
null);
- Add_Action (Table.States (588), 90, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (588), 97, (333, 1), 129);
- Add_Action (Table.States (588), 98, (333, 0), 130);
- Add_Action (Table.States (588), 106, (261, 0), 131);
- Add_Action (Table.States (588), 107, (242, 5), 120);
- Add_Action (Table.States (588), 108, (242, 7), 34);
- Add_Action (Table.States (588), 109, (127, 0), 266);
- Table.States (588).Goto_List.Set_Capacity (29);
- Add_Goto (Table.States (588), 120, 132);
- Add_Goto (Table.States (588), 127, 267);
- Add_Goto (Table.States (588), 128, 268);
- Add_Goto (Table.States (588), 131, 42);
- Add_Goto (Table.States (588), 139, 269);
- Add_Goto (Table.States (588), 156, 270);
- Add_Goto (Table.States (588), 168, 271);
- Add_Goto (Table.States (588), 169, 272);
- Add_Goto (Table.States (588), 194, 273);
- Add_Goto (Table.States (588), 195, 766);
- Add_Goto (Table.States (588), 200, 135);
- Add_Goto (Table.States (588), 224, 275);
- Add_Goto (Table.States (588), 242, 276);
- Add_Goto (Table.States (588), 261, 137);
- Add_Goto (Table.States (588), 275, 93);
- Add_Goto (Table.States (588), 276, 277);
- Add_Goto (Table.States (588), 278, 138);
- Add_Goto (Table.States (588), 280, 278);
- Add_Goto (Table.States (588), 285, 139);
- Add_Goto (Table.States (588), 286, 140);
- Add_Goto (Table.States (588), 287, 141);
- Add_Goto (Table.States (588), 288, 142);
- Add_Goto (Table.States (588), 289, 143);
- Add_Goto (Table.States (588), 290, 144);
- Add_Goto (Table.States (588), 296, 98);
- Add_Goto (Table.States (588), 304, 279);
- Add_Goto (Table.States (588), 323, 146);
- Add_Goto (Table.States (588), 324, 147);
- Add_Goto (Table.States (588), 333, 148);
- Table.States (588).Kernel := To_Vector ((((120, 0), 76, 1,
(2147483647, 0), 0), ((120, 1), 76, 3,
- (2147483647, 0), 0), ((120, 2), 76, 4, (2147483647, 0), 0),
((120, 3), 76, 2, (2147483647, 0), 0),
- ((120, 4), 76, 4, (2147483647, 0), 0), ((120, 6), 76, 3,
(2147483647, 0), 0), ((259, 0), 76, 1,
- (2147483647, 0), 0)));
- Table.States (588).Minimal_Complete_Actions := To_Vector
(((Reduce, (128, 1), 0), (Reduce, (195, 1),
- 0)));
- Table.States (589).Action_List.Set_Capacity (2);
- Add_Action (Table.States (589), (74, 99), (259, 1), 1, null,
null);
- Table.States (589).Kernel := To_Vector ((0 => ((259, 1), 120, 0,
(259, 1), 1)));
- Table.States (589).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (259, 1), 1)));
- Table.States (590).Action_List.Set_Capacity (2);
- Add_Action (Table.States (590), 74, (125, 0), 340);
- Add_Action (Table.States (590), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (590).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (590), 125, 767);
- Table.States (590).Kernel := To_Vector ((0 => ((196, 0), 259, 1,
(2147483647, 0), 0)));
- Table.States (590).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (591).Action_List.Set_Capacity (2);
- Add_Action (Table.States (591), 74, (125, 0), 340);
- Add_Action (Table.States (591), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (591).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (591), 125, 768);
- Table.States (591).Kernel := To_Vector ((0 => ((246, 0), 41, 1,
(2147483647, 0), 0)));
- Table.States (591).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (592).Action_List.Set_Capacity (2);
- Add_Action (Table.States (592), 74, (125, 0), 340);
- Add_Action (Table.States (592), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (592).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (592), 125, 769);
- Table.States (592).Kernel := To_Vector ((0 => ((115, 0), 6, 1,
(2147483647, 0), 0)));
- Table.States (592).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (593).Action_List.Set_Capacity (2);
- Add_Action (Table.States (593), 74, (125, 0), 340);
- Add_Action (Table.States (593), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (593).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (593), 125, 770);
- Table.States (593).Kernel := To_Vector ((0 => ((311, 0), 60, 1,
(2147483647, 0), 0)));
- Table.States (593).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (594).Action_List.Set_Capacity (6);
- Add_Action (Table.States (594), 74, (125, 0), 340);
- Add_Action (Table.States (594), 76, (118, 0), 237);
- Add_Action (Table.States (594), 87, (296, 0), 239);
- Add_Action (Table.States (594), 99, Reduce, (125, 1), 0, null,
null);
- Add_Action (Table.States (594), 104, (325, 0), 241);
- Add_Action (Table.States (594), 105, (325, 1), 242);
- Table.States (594).Goto_List.Set_Capacity (3);
- Add_Goto (Table.States (594), 118, 243);
- Add_Goto (Table.States (594), 125, 771);
- Add_Goto (Table.States (594), 325, 244);
- Table.States (594).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((242, 0), 242, 5,
- (2147483647, 0), 0), ((242, 1), 242, 2, (2147483647, 0), 0),
((275, 0), 242, 3, (2147483647, 0), 0),
- ((296, 0), 242, 2, (2147483647, 0), 0), ((296, 1), 242, 2,
(2147483647, 0), 0), ((296, 2), 242, 2,
- (2147483647, 0), 0), ((296, 3), 242, 2, (2147483647, 0), 0),
((314, 0), 242, 1, (2147483647, 0),
- 0)));
- Table.States (594).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (595).Action_List.Set_Capacity (16);
- Add_Action (Table.States (595), 13, Reduce, (162, 1), 0, null,
null);
- Add_Action (Table.States (595), 25, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (595), 28, (124, 0), 185);
- Add_Action (Table.States (595), 29, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (595), 30, (213, 0), 8);
- Add_Action (Table.States (595), 40, (249, 0), 12);
- Add_Action (Table.States (595), 46, (249, 1), 14);
- Add_Action (Table.States (595), 47, (216, 0), 15);
- Add_Action (Table.States (595), 48, (260, 0), 16);
- Add_Action (Table.States (595), 50, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (595), 51, (267, 0), 19);
- Add_Action (Table.States (595), 63, (316, 0), 25);
- Add_Action (Table.States (595), 66, (308, 0), 26);
- Add_Action (Table.States (595), 69, (209, 0), 27);
- Add_Action (Table.States (595), 71, (334, 0), 28);
- Add_Action (Table.States (595), 107, (222, 1), 187);
- Table.States (595).Goto_List.Set_Capacity (53);
- Add_Goto (Table.States (595), 115, 36);
- Add_Goto (Table.States (595), 124, 38);
- Add_Goto (Table.States (595), 130, 41);
- Add_Goto (Table.States (595), 137, 46);
- Add_Goto (Table.States (595), 138, 47);
- Add_Goto (Table.States (595), 160, 394);
- Add_Goto (Table.States (595), 161, 395);
- Add_Goto (Table.States (595), 162, 772);
- Add_Goto (Table.States (595), 182, 55);
- Add_Goto (Table.States (595), 185, 56);
- Add_Goto (Table.States (595), 189, 57);
- Add_Goto (Table.States (595), 196, 59);
- Add_Goto (Table.States (595), 209, 61);
- Add_Goto (Table.States (595), 210, 62);
- Add_Goto (Table.States (595), 212, 63);
- Add_Goto (Table.States (595), 213, 64);
- Add_Goto (Table.States (595), 216, 65);
- Add_Goto (Table.States (595), 217, 66);
- Add_Goto (Table.States (595), 218, 67);
- Add_Goto (Table.States (595), 219, 68);
- Add_Goto (Table.States (595), 222, 70);
- Add_Goto (Table.States (595), 226, 72);
- Add_Goto (Table.States (595), 246, 75);
- Add_Goto (Table.States (595), 247, 76);
- Add_Goto (Table.States (595), 248, 77);
- Add_Goto (Table.States (595), 249, 78);
- Add_Goto (Table.States (595), 250, 79);
- Add_Goto (Table.States (595), 251, 80);
- Add_Goto (Table.States (595), 252, 81);
- Add_Goto (Table.States (595), 253, 82);
- Add_Goto (Table.States (595), 254, 83);
- Add_Goto (Table.States (595), 260, 397);
- Add_Goto (Table.States (595), 262, 85);
- Add_Goto (Table.States (595), 263, 86);
- Add_Goto (Table.States (595), 265, 88);
- Add_Goto (Table.States (595), 266, 89);
- Add_Goto (Table.States (595), 267, 90);
- Add_Goto (Table.States (595), 268, 91);
- Add_Goto (Table.States (595), 274, 92);
- Add_Goto (Table.States (595), 284, 95);
- Add_Goto (Table.States (595), 292, 96);
- Add_Goto (Table.States (595), 307, 103);
- Add_Goto (Table.States (595), 308, 104);
- Add_Goto (Table.States (595), 310, 106);
- Add_Goto (Table.States (595), 311, 107);
- Add_Goto (Table.States (595), 312, 108);
- Add_Goto (Table.States (595), 314, 109);
- Add_Goto (Table.States (595), 316, 110);
- Add_Goto (Table.States (595), 319, 112);
- Add_Goto (Table.States (595), 320, 113);
- Add_Goto (Table.States (595), 322, 114);
- Add_Goto (Table.States (595), 328, 116);
- Add_Goto (Table.States (595), 334, 117);
- Table.States (595).Kernel := To_Vector ((0 => ((310, 0), 35, 3,
(2147483647, 0), 0)));
- Table.States (595).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (162, 1), 0)));
- Table.States (596).Action_List.Set_Capacity (41);
- Add_Action (Table.States (596), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (312, 0), 4,
- subprogram_declaration_0'Access, null);
- Table.States (596).Kernel := To_Vector ((0 => ((312, 0), 99, 0,
(312, 0), 4)));
- Table.States (596).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (312, 0), 4)));
- Table.States (597).Action_List.Set_Capacity (25);
- Add_Action (Table.States (597), 4, (116, 0), 1);
- Add_Action (Table.States (597), 5, (306, 8), 2);
- Add_Action (Table.States (597), 13, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (597), 15, (142, 0), 3);
- Add_Action (Table.States (597), 17, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (597), 18, (164, 0), 4);
- Add_Action (Table.States (597), 24, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (597), 26, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (597), 27, (193, 0), 5);
- Add_Action (Table.States (597), 28, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (597), 31, (306, 3), 9);
- Add_Action (Table.States (597), 32, (225, 0), 10);
- Add_Action (Table.States (597), 37, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (597), 41, (306, 0), 13);
- Add_Action (Table.States (597), 48, (260, 0), 16);
- Add_Action (Table.States (597), 52, (279, 0), 20);
- Add_Action (Table.States (597), 57, (293, 0), 21);
- Add_Action (Table.States (597), 58, (199, 0), 22);
- Add_Action (Table.States (597), 61, (129, 0), 24);
- Add_Action (Table.States (597), 73, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (597), 81, (242, 8), 31);
- Add_Action (Table.States (597), 96, (220, 0), 32);
- Add_Action (Table.States (597), 107, (134, 0), 363);
- Add_Action (Table.States (597), 108, (242, 7), 34);
- Add_Action (Table.States (597), 109, (242, 6), 35);
- Table.States (597).Goto_List.Set_Capacity (32);
- Add_Goto (Table.States (597), 116, 37);
- Add_Goto (Table.States (597), 126, 39);
- Add_Goto (Table.States (597), 129, 40);
- Add_Goto (Table.States (597), 131, 42);
- Add_Goto (Table.States (597), 134, 43);
- Add_Goto (Table.States (597), 135, 44);
- Add_Goto (Table.States (597), 136, 45);
- Add_Goto (Table.States (597), 142, 48);
- Add_Goto (Table.States (597), 154, 51);
- Add_Goto (Table.States (597), 155, 52);
- Add_Goto (Table.States (597), 164, 54);
- Add_Goto (Table.States (597), 193, 58);
- Add_Goto (Table.States (597), 199, 60);
- Add_Goto (Table.States (597), 220, 69);
- Add_Goto (Table.States (597), 221, 773);
- Add_Goto (Table.States (597), 225, 71);
- Add_Goto (Table.States (597), 235, 73);
- Add_Goto (Table.States (597), 242, 74);
- Add_Goto (Table.States (597), 260, 84);
- Add_Goto (Table.States (597), 264, 87);
- Add_Goto (Table.States (597), 275, 93);
- Add_Goto (Table.States (597), 279, 94);
- Add_Goto (Table.States (597), 293, 97);
- Add_Goto (Table.States (597), 296, 98);
- Add_Goto (Table.States (597), 297, 99);
- Add_Goto (Table.States (597), 301, 100);
- Add_Goto (Table.States (597), 302, 364);
- Add_Goto (Table.States (597), 303, 393);
- Add_Goto (Table.States (597), 305, 101);
- Add_Goto (Table.States (597), 306, 102);
- Add_Goto (Table.States (597), 309, 366);
- Add_Goto (Table.States (597), 326, 115);
- Table.States (597).Kernel := To_Vector ((0 => ((116, 0), 21, 2,
(2147483647, 0), 0)));
- Table.States (597).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (221, 1), 0)));
- Table.States (598).Action_List.Set_Capacity (47);
- Add_Action (Table.States (598), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (116, 1), 5, accept_statement_1'Access, null);
- Table.States (598).Kernel := To_Vector ((0 => ((116, 1), 99, 0,
(116, 1), 5)));
- Table.States (598).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (116, 1), 5)));
- Table.States (599).Action_List.Set_Capacity (18);
- Add_Action (Table.States (599), (10, 20, 21, 22, 23, 35, 37, 43,
53, 68, 74, 75, 78, 79, 82, 86, 90, 99),
- (278, 0), 4, raise_expression_0'Access, null);
- Table.States (599).Kernel := To_Vector ((0 => ((278, 0), 195, 0,
(278, 0), 4)));
- Table.States (599).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (278, 0), 4)));
- Table.States (600).Action_List.Set_Capacity (1);
- Add_Action (Table.States (600), 72, (140, 0), 774);
- Table.States (600).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (600), 140, 775);
- Add_Goto (Table.States (600), 141, 776);
- Table.States (600).Kernel := To_Vector ((0 => ((139, 0), 35, 2,
(2147483647, 0), 0)));
- Table.States (600).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (140, 0), 72, 774)));
- Table.States (601).Action_List.Set_Capacity (18);
- Add_Action (Table.States (601), 3, (200, 2), 122);
- Add_Action (Table.States (601), 39, (261, 4), 123);
- Add_Action (Table.States (601), 40, (168, 1), 777);
- Add_Action (Table.States (601), 41, (261, 1), 125);
- Add_Action (Table.States (601), 44, (168, 3), 265);
- Add_Action (Table.States (601), 52, (278, 0), 126);
- Add_Action (Table.States (601), 59, (233, 2), 482);
- Add_Action (Table.States (601), 76, (120, 0), 127);
- Add_Action (Table.States (601), 77, (120, 5), 128);
- Add_Action (Table.States (601), 81, (242, 8), 31);
- Add_Action (Table.States (601), 82, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (601), 90, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (601), 97, (333, 1), 129);
- Add_Action (Table.States (601), 98, (333, 0), 130);
- Add_Action (Table.States (601), 106, (261, 0), 131);
- Add_Action (Table.States (601), 107, (242, 5), 120);
- Add_Action (Table.States (601), 108, (242, 7), 34);
- Add_Action (Table.States (601), 109, (242, 6), 35);
- Table.States (601).Goto_List.Set_Capacity (24);
- Add_Goto (Table.States (601), 120, 132);
- Add_Goto (Table.States (601), 131, 42);
- Add_Goto (Table.States (601), 168, 271);
- Add_Goto (Table.States (601), 169, 778);
- Add_Goto (Table.States (601), 170, 483);
- Add_Goto (Table.States (601), 194, 611);
- Add_Goto (Table.States (601), 200, 135);
- Add_Goto (Table.States (601), 242, 484);
- Add_Goto (Table.States (601), 261, 137);
- Add_Goto (Table.States (601), 275, 93);
- Add_Goto (Table.States (601), 278, 138);
- Add_Goto (Table.States (601), 280, 779);
- Add_Goto (Table.States (601), 285, 139);
- Add_Goto (Table.States (601), 286, 140);
- Add_Goto (Table.States (601), 287, 141);
- Add_Goto (Table.States (601), 288, 142);
- Add_Goto (Table.States (601), 289, 143);
- Add_Goto (Table.States (601), 290, 144);
- Add_Goto (Table.States (601), 296, 98);
- Add_Goto (Table.States (601), 304, 279);
- Add_Goto (Table.States (601), 317, 487);
- Add_Goto (Table.States (601), 323, 146);
- Add_Goto (Table.States (601), 324, 147);
- Add_Goto (Table.States (601), 333, 148);
- Table.States (601).Kernel := To_Vector ((((127, 6), 33, 2,
(2147483647, 0), 0), ((233, 2), 33, 2,
- (2147483647, 0), 0), ((233, 5), 33, 1, (2147483647, 0), 0)));
- Table.States (601).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (602).Action_List.Set_Capacity (14);
- Add_Action (Table.States (602), 3, (200, 2), 122);
- Add_Action (Table.States (602), 39, (261, 4), 123);
- Add_Action (Table.States (602), 40, (200, 3), 124);
- Add_Action (Table.States (602), 41, (261, 1), 125);
- Add_Action (Table.States (602), 52, (278, 0), 126);
- Add_Action (Table.States (602), 76, (120, 0), 127);
- Add_Action (Table.States (602), 77, (120, 5), 128);
- Add_Action (Table.States (602), 81, (242, 8), 31);
- Add_Action (Table.States (602), 97, (333, 1), 129);
- Add_Action (Table.States (602), 98, (333, 0), 130);
- Add_Action (Table.States (602), 106, (261, 0), 131);
- Add_Action (Table.States (602), 107, (242, 5), 120);
- Add_Action (Table.States (602), 108, (242, 7), 34);
- Add_Action (Table.States (602), 109, (242, 6), 35);
- Table.States (602).Goto_List.Set_Capacity (19);
- Add_Goto (Table.States (602), 120, 132);
- Add_Goto (Table.States (602), 131, 42);
- Add_Goto (Table.States (602), 194, 780);
- Add_Goto (Table.States (602), 200, 135);
- Add_Goto (Table.States (602), 242, 136);
- Add_Goto (Table.States (602), 261, 137);
- Add_Goto (Table.States (602), 275, 93);
- Add_Goto (Table.States (602), 278, 138);
- Add_Goto (Table.States (602), 285, 139);
- Add_Goto (Table.States (602), 286, 140);
- Add_Goto (Table.States (602), 287, 141);
- Add_Goto (Table.States (602), 288, 142);
- Add_Goto (Table.States (602), 289, 143);
- Add_Goto (Table.States (602), 290, 144);
- Add_Goto (Table.States (602), 296, 98);
- Add_Goto (Table.States (602), 304, 145);
- Add_Goto (Table.States (602), 323, 146);
- Add_Goto (Table.States (602), 324, 147);
- Add_Goto (Table.States (602), 333, 148);
- Table.States (602).Kernel := To_Vector ((0 => ((127, 7), 90, 1,
(2147483647, 0), 0)));
- Table.States (602).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (603).Action_List.Set_Capacity (1);
- Add_Action (Table.States (603), 90, (276, 0), 781);
- Table.States (603).Kernel := To_Vector ((0 => ((276, 0), 233, 1,
(2147483647, 0), 0)));
- Table.States (603).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (276, 0), 90, 781)));
- Table.States (604).Action_List.Set_Capacity (17);
- Add_Action (Table.States (604), 3, (200, 2), 122);
- Add_Action (Table.States (604), 22, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (604), 23, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (604), 39, (261, 4), 123);
- Add_Action (Table.States (604), 40, (200, 3), 124);
- Add_Action (Table.States (604), 41, (261, 1), 125);
- Add_Action (Table.States (604), 52, (278, 0), 126);
- Add_Action (Table.States (604), 76, (120, 0), 127);
- Add_Action (Table.States (604), 77, (120, 5), 128);
- Add_Action (Table.States (604), 78, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (604), 81, (242, 8), 31);
- Add_Action (Table.States (604), 97, (333, 1), 129);
- Add_Action (Table.States (604), 98, (333, 0), 130);
- Add_Action (Table.States (604), 106, (261, 0), 131);
- Add_Action (Table.States (604), 107, (242, 5), 120);
- Add_Action (Table.States (604), 108, (242, 7), 34);
- Add_Action (Table.States (604), 109, (242, 6), 35);
- Table.States (604).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (604), 120, 132);
- Add_Goto (Table.States (604), 131, 42);
- Add_Goto (Table.States (604), 194, 133);
- Add_Goto (Table.States (604), 195, 782);
- Add_Goto (Table.States (604), 200, 135);
- Add_Goto (Table.States (604), 242, 136);
- Add_Goto (Table.States (604), 261, 137);
- Add_Goto (Table.States (604), 275, 93);
- Add_Goto (Table.States (604), 278, 138);
- Add_Goto (Table.States (604), 285, 139);
- Add_Goto (Table.States (604), 286, 140);
- Add_Goto (Table.States (604), 287, 141);
- Add_Goto (Table.States (604), 288, 142);
- Add_Goto (Table.States (604), 289, 143);
- Add_Goto (Table.States (604), 290, 144);
- Add_Goto (Table.States (604), 296, 98);
- Add_Goto (Table.States (604), 304, 145);
- Add_Goto (Table.States (604), 323, 146);
- Add_Goto (Table.States (604), 324, 147);
- Add_Goto (Table.States (604), 333, 148);
- Table.States (604).Kernel := To_Vector ((((224, 0), 68, 3,
(2147483647, 0), 0), ((224, 1), 68, 1,
- (2147483647, 0), 0), ((224, 2), 68, 2, (2147483647, 0), 0),
((224, 3), 68, 0, (195, 1), 0)));
- Table.States (604).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (605).Action_List.Set_Capacity (6);
- Add_Action (Table.States (605), 76, (118, 0), 237);
- Add_Action (Table.States (605), 82, Reduce, (168, 1), 3, null,
null);
- Add_Action (Table.States (605), 87, (296, 0), 239);
- Add_Action (Table.States (605), 90, Reduce, (168, 1), 3, null,
null);
- Add_Action (Table.States (605), 104, (325, 0), 241);
- Add_Action (Table.States (605), 105, (325, 1), 242);
- Table.States (605).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (605), 118, 243);
- Add_Goto (Table.States (605), 325, 244);
- Table.States (605).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((168, 1), 242, 0,
- (168, 1), 3), ((242, 0), 242, 5, (2147483647, 0), 0), ((242,
1), 242, 2, (2147483647, 0), 0), ((275,
- 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (605).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (168, 1), 3)));
- Table.States (606).Action_List.Set_Capacity (65);
- Add_Action (Table.States (606), (4, 5, 10, 13, 15, 17, 18, 20, 21,
22, 23, 27, 28, 31, 32, 33, 35, 37, 38,
- 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74,
75, 76, 78, 79, 80, 81, 82, 85, 86, 87, 88,
- 89, 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104,
105, 107, 108, 109), (120, 1), 4, null,
- null);
- Table.States (606).Kernel := To_Vector ((0 => ((120, 1), 78, 0,
(120, 1), 4)));
- Table.States (606).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (120, 1), 4)));
- Table.States (607).Action_List.Set_Capacity (5);
- Add_Action (Table.States (607), (35, 78, 79, 86, 99), (127, 1),
3, null, null);
- Table.States (607).Kernel := To_Vector ((0 => ((127, 1), 83, 0,
(127, 1), 3)));
- Table.States (607).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (127, 1), 3)));
- Table.States (608).Action_List.Set_Capacity (5);
- Add_Action (Table.States (608), (35, 78, 79, 86, 99), (127, 0),
3, association_opt_0'Access, null);
- Table.States (608).Kernel := To_Vector ((0 => ((127, 0), 195, 0,
(127, 0), 3)));
- Table.States (608).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (127, 0), 3)));
- Table.States (609).Action_List.Set_Capacity (5);
- Add_Action (Table.States (609), (35, 78, 79, 86, 99), (128, 0),
3, null, null);
- Table.States (609).Kernel := To_Vector ((0 => ((128, 0), 127, 0,
(128, 0), 3)));
- Table.States (609).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (128, 0), 3)));
- Table.States (610).Action_List.Set_Capacity (2);
- Add_Action (Table.States (610), (82, 90), (169, 0), 3, null,
null);
- Table.States (610).Kernel := To_Vector ((0 => ((169, 0), 168, 0,
(169, 0), 3)));
- Table.States (610).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (169, 0), 3)));
- Table.States (611).Action_List.Set_Capacity (2);
- Add_Action (Table.States (611), (82, 90), (168, 0), 1, null,
null);
- Table.States (611).Kernel := To_Vector ((0 => ((168, 0), 194, 0,
(168, 0), 1)));
- Table.States (611).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (168, 0), 1)));
- Table.States (612).Action_List.Set_Capacity (5);
- Add_Action (Table.States (612), (35, 78, 79, 86, 99), (127, 3),
3, association_opt_3'Access, null);
- Table.States (612).Kernel := To_Vector ((0 => ((127, 3), 83, 0,
(127, 3), 3)));
- Table.States (612).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (127, 3), 3)));
- Table.States (613).Action_List.Set_Capacity (5);
- Add_Action (Table.States (613), (35, 78, 79, 86, 99), (127, 2),
3, association_opt_2'Access, null);
- Table.States (613).Kernel := To_Vector ((0 => ((127, 2), 195, 0,
(127, 2), 3)));
- Table.States (613).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (127, 2), 3)));
- Table.States (614).Action_List.Set_Capacity (20);
- Add_Action (Table.States (614), 3, (200, 2), 122);
- Add_Action (Table.States (614), 28, (127, 6), 521);
- Add_Action (Table.States (614), 39, (261, 4), 123);
- Add_Action (Table.States (614), 40, (168, 1), 263);
- Add_Action (Table.States (614), 41, (261, 1), 125);
- Add_Action (Table.States (614), 44, (168, 3), 265);
- Add_Action (Table.States (614), 52, (278, 0), 126);
- Add_Action (Table.States (614), 76, (120, 0), 127);
- Add_Action (Table.States (614), 77, (120, 5), 128);
- Add_Action (Table.States (614), 78, Reduce, (127, 5), 0, null,
null);
- Add_Action (Table.States (614), 81, (242, 8), 31);
- Add_Action (Table.States (614), 82, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (614), 86, Reduce, (127, 5), 0, null,
null);
- Add_Action (Table.States (614), 90, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (614), 97, (333, 1), 129);
- Add_Action (Table.States (614), 98, (333, 0), 130);
- Add_Action (Table.States (614), 106, (261, 0), 131);
- Add_Action (Table.States (614), 107, (242, 5), 120);
- Add_Action (Table.States (614), 108, (242, 7), 34);
- Add_Action (Table.States (614), 109, (127, 0), 266);
- Table.States (614).Goto_List.Set_Capacity (24);
- Add_Goto (Table.States (614), 120, 132);
- Add_Goto (Table.States (614), 127, 267);
- Add_Goto (Table.States (614), 128, 783);
- Add_Goto (Table.States (614), 131, 42);
- Add_Goto (Table.States (614), 168, 271);
- Add_Goto (Table.States (614), 169, 272);
- Add_Goto (Table.States (614), 194, 411);
- Add_Goto (Table.States (614), 200, 135);
- Add_Goto (Table.States (614), 242, 276);
- Add_Goto (Table.States (614), 261, 137);
- Add_Goto (Table.States (614), 275, 93);
- Add_Goto (Table.States (614), 278, 138);
- Add_Goto (Table.States (614), 280, 278);
- Add_Goto (Table.States (614), 285, 139);
- Add_Goto (Table.States (614), 286, 140);
- Add_Goto (Table.States (614), 287, 141);
- Add_Goto (Table.States (614), 288, 142);
- Add_Goto (Table.States (614), 289, 143);
- Add_Goto (Table.States (614), 290, 144);
- Add_Goto (Table.States (614), 296, 98);
- Add_Goto (Table.States (614), 304, 279);
- Add_Goto (Table.States (614), 323, 146);
- Add_Goto (Table.States (614), 324, 147);
- Add_Goto (Table.States (614), 333, 148);
- Table.States (614).Kernel := To_Vector ((0 => ((120, 4), 19, 1,
(2147483647, 0), 0)));
- Table.States (614).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (128, 1), 0)));
- Table.States (615).Action_List.Set_Capacity (25);
- Add_Action (Table.States (615), 10, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (615), 33, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (615), 38, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (615), 40, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (615), 43, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (615), 54, (120, 2), 784);
- Add_Action (Table.States (615), 55, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (615), 75, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (615), 78, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (615), 80, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (615), 82, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (615), 86, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (615), 88, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (615), 89, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (615), 90, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (615), 91, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (615), 92, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (615), 94, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (615), 95, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (615), 97, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (615), 98, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (615), 100, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (615), 101, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (615), 102, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (615), 103, Reduce, (261, 1), 1, null,
null);
- Table.States (615).Kernel := To_Vector ((((120, 2), 41, 2,
(2147483647, 0), 0), ((261, 1), 41, 0,
- (261, 1), 1)));
- Table.States (615).Minimal_Complete_Actions := To_Vector (((Shift,
(120, 2), 54, 784), (Reduce, (261, 1),
- 1)));
- end Subr_12;
- procedure Subr_13
- is begin
- Table.States (616).Action_List.Set_Capacity (2);
- Add_Action (Table.States (616), 78, (120, 3), 785);
- Add_Action (Table.States (616), 86, (128, 0), 448);
- Table.States (616).Kernel := To_Vector ((((120, 3), 128, 1,
(2147483647, 0), 0), ((128, 0), 128, 1,
- (2147483647, 0), 0)));
- Table.States (616).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (120, 3), 78, 785)));
- Table.States (617).Action_List.Set_Capacity (21);
- Add_Action (Table.States (617), 10, Reduce, (280, 1), 3, null,
null);
- Add_Action (Table.States (617), 20, Reduce, (280, 1), 3, null,
null);
- Add_Action (Table.States (617), 21, Reduce, (280, 1), 3, null,
null);
- Add_Action (Table.States (617), 22, Reduce, (280, 1), 3, null,
null);
- Add_Action (Table.States (617), 23, Reduce, (280, 1), 3, null,
null);
- Add_Action (Table.States (617), 35, Reduce, (280, 1), 3, null,
null);
- Add_Action (Table.States (617), 37, Reduce, (280, 1), 3, null,
null);
- Add_Action (Table.States (617), 42, Reduce, (280, 1), 3, null,
null);
- Add_Action (Table.States (617), 43, Reduce, (280, 1), 3, null,
null);
- Add_Action (Table.States (617), 53, Reduce, (280, 1), 3, null,
null);
- Add_Action (Table.States (617), 68, Reduce, (280, 1), 3, null,
null);
- Add_Action (Table.States (617), 74, Reduce, (280, 1), 3, null,
null);
- Add_Action (Table.States (617), 75, Reduce, (280, 1), 3, null,
null);
- Add_Action (Table.States (617), 76, (280, 0), 786);
- Add_Action (Table.States (617), 78, Reduce, (280, 1), 3, null,
null);
- Add_Action (Table.States (617), 79, Reduce, (280, 1), 3, null,
null);
- Add_Action (Table.States (617), 82, Reduce, (280, 1), 3, null,
null);
- Add_Action (Table.States (617), 85, Reduce, (280, 1), 3, null,
null);
- Add_Action (Table.States (617), 86, Reduce, (280, 1), 3, null,
null);
- Add_Action (Table.States (617), 90, Reduce, (280, 1), 3, null,
null);
- Add_Action (Table.States (617), 99, Reduce, (280, 1), 3, null,
null);
- Table.States (617).Kernel := To_Vector ((((280, 0), 53, 2,
(2147483647, 0), 0), ((280, 1), 53, 0,
- (280, 1), 3)));
- Table.States (617).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (280, 1), 3)));
- Table.States (618).Action_List.Set_Capacity (20);
- Add_Action (Table.States (618), (10, 20, 21, 22, 23, 35, 37, 42,
43, 53, 68, 74, 75, 78, 79, 82, 85, 86,
- 90, 99), (280, 2), 3, null, null);
- Table.States (618).Kernel := To_Vector ((0 => ((280, 2), 304, 0,
(280, 2), 3)));
- Table.States (618).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (280, 2), 3)));
- Table.States (619).Action_List.Set_Capacity (20);
- Add_Action (Table.States (619), 3, (200, 2), 122);
- Add_Action (Table.States (619), 28, (127, 6), 521);
- Add_Action (Table.States (619), 39, (261, 4), 123);
- Add_Action (Table.States (619), 40, (168, 1), 263);
- Add_Action (Table.States (619), 41, (261, 1), 125);
- Add_Action (Table.States (619), 44, (168, 3), 265);
- Add_Action (Table.States (619), 52, (278, 0), 126);
- Add_Action (Table.States (619), 76, (120, 0), 127);
- Add_Action (Table.States (619), 77, (120, 5), 128);
- Add_Action (Table.States (619), 79, Reduce, (127, 5), 0, null,
null);
- Add_Action (Table.States (619), 81, (242, 8), 31);
- Add_Action (Table.States (619), 82, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (619), 86, Reduce, (127, 5), 0, null,
null);
- Add_Action (Table.States (619), 90, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (619), 97, (333, 1), 129);
- Add_Action (Table.States (619), 98, (333, 0), 130);
- Add_Action (Table.States (619), 106, (261, 0), 131);
- Add_Action (Table.States (619), 107, (242, 5), 120);
- Add_Action (Table.States (619), 108, (242, 7), 34);
- Add_Action (Table.States (619), 109, (127, 0), 266);
- Table.States (619).Goto_List.Set_Capacity (24);
- Add_Goto (Table.States (619), 120, 132);
- Add_Goto (Table.States (619), 127, 267);
- Add_Goto (Table.States (619), 128, 787);
- Add_Goto (Table.States (619), 131, 42);
- Add_Goto (Table.States (619), 168, 271);
- Add_Goto (Table.States (619), 169, 272);
- Add_Goto (Table.States (619), 194, 411);
- Add_Goto (Table.States (619), 200, 135);
- Add_Goto (Table.States (619), 242, 276);
- Add_Goto (Table.States (619), 261, 137);
- Add_Goto (Table.States (619), 275, 93);
- Add_Goto (Table.States (619), 278, 138);
- Add_Goto (Table.States (619), 280, 278);
- Add_Goto (Table.States (619), 285, 139);
- Add_Goto (Table.States (619), 286, 140);
- Add_Goto (Table.States (619), 287, 141);
- Add_Goto (Table.States (619), 288, 142);
- Add_Goto (Table.States (619), 289, 143);
- Add_Goto (Table.States (619), 290, 144);
- Add_Goto (Table.States (619), 296, 98);
- Add_Goto (Table.States (619), 304, 279);
- Add_Goto (Table.States (619), 323, 146);
- Add_Goto (Table.States (619), 324, 147);
- Add_Goto (Table.States (619), 333, 148);
- Table.States (619).Kernel := To_Vector ((0 => ((120, 5), 19, 1,
(2147483647, 0), 0)));
- Table.States (619).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (128, 1), 0)));
- Table.States (620).Action_List.Set_Capacity (2);
- Add_Action (Table.States (620), 82, (169, 0), 450);
- Add_Action (Table.States (620), 90, (143, 0), 788);
- Table.States (620).Kernel := To_Vector ((((143, 0), 169, 1,
(2147483647, 0), 0), ((169, 0), 169, 2,
- (2147483647, 0), 0)));
- Table.States (620).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (143, 0), 90, 788)));
- Table.States (621).Action_List.Set_Capacity (1);
- Add_Action (Table.States (621), 15, (142, 0), 789);
- Table.States (621).Kernel := To_Vector ((0 => ((142, 0), 24, 2,
(2147483647, 0), 0)));
- Table.States (621).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (142, 0), 15, 789)));
- Table.States (622).Action_List.Set_Capacity (2);
- Add_Action (Table.States (622), (24, 72), (144, 0), 2,
case_statement_alternative_list_0'Access, null);
- Table.States (622).Kernel := To_Vector ((0 => ((144, 0), 143, 0,
(144, 0), 2)));
- Table.States (622).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (144, 0), 2)));
- Table.States (623).Action_List.Set_Capacity (18);
- Add_Action (Table.States (623), (10, 20, 21, 22, 23, 35, 37, 43,
53, 68, 74, 75, 78, 79, 82, 86, 90, 99),
- (286, 0), 4, null, null);
- Table.States (623).Kernel := To_Vector ((0 => ((286, 0), 290, 0,
(286, 0), 4)));
- Table.States (623).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (286, 0), 4)));
- Table.States (624).Action_List.Set_Capacity (18);
- Add_Action (Table.States (624), (10, 20, 21, 22, 23, 35, 37, 43,
53, 68, 74, 75, 78, 79, 82, 86, 90, 99),
- (288, 0), 4, null, null);
- Table.States (624).Kernel := To_Vector ((0 => ((288, 0), 290, 0,
(288, 0), 4)));
- Table.States (624).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (288, 0), 4)));
- Table.States (625).Action_List.Set_Capacity (18);
- Add_Action (Table.States (625), (10, 20, 21, 22, 23, 35, 37, 43,
53, 68, 74, 75, 78, 79, 82, 86, 90, 99),
- (286, 1), 4, null, null);
- Table.States (625).Kernel := To_Vector ((0 => ((286, 1), 290, 0,
(286, 1), 4)));
- Table.States (625).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (286, 1), 4)));
- Table.States (626).Action_List.Set_Capacity (18);
- Add_Action (Table.States (626), (10, 20, 21, 22, 23, 35, 37, 43,
53, 68, 74, 75, 78, 79, 82, 86, 90, 99),
- (288, 1), 4, null, null);
- Table.States (626).Kernel := To_Vector ((0 => ((288, 1), 290, 0,
(288, 1), 4)));
- Table.States (626).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (288, 1), 4)));
- Table.States (627).Action_List.Set_Capacity (13);
- Add_Action (Table.States (627), 3, (200, 2), 122);
- Add_Action (Table.States (627), 39, (261, 4), 123);
- Add_Action (Table.States (627), 40, (200, 3), 124);
- Add_Action (Table.States (627), 41, (261, 1), 125);
- Add_Action (Table.States (627), 76, (120, 0), 127);
- Add_Action (Table.States (627), 77, (120, 5), 128);
- Add_Action (Table.States (627), 81, (242, 8), 31);
- Add_Action (Table.States (627), 97, (333, 1), 129);
- Add_Action (Table.States (627), 98, (333, 0), 130);
- Add_Action (Table.States (627), 106, (261, 0), 131);
- Add_Action (Table.States (627), 107, (242, 5), 120);
- Add_Action (Table.States (627), 108, (242, 7), 34);
- Add_Action (Table.States (627), 109, (242, 6), 35);
- Table.States (627).Goto_List.Set_Capacity (13);
- Add_Goto (Table.States (627), 120, 132);
- Add_Goto (Table.States (627), 131, 42);
- Add_Goto (Table.States (627), 200, 135);
- Add_Goto (Table.States (627), 237, 790);
- Add_Goto (Table.States (627), 242, 276);
- Add_Goto (Table.States (627), 261, 137);
- Add_Goto (Table.States (627), 275, 93);
- Add_Goto (Table.States (627), 280, 473);
- Add_Goto (Table.States (627), 296, 98);
- Add_Goto (Table.States (627), 304, 474);
- Add_Goto (Table.States (627), 323, 146);
- Add_Goto (Table.States (627), 324, 147);
- Add_Goto (Table.States (627), 333, 148);
- Table.States (627).Kernel := To_Vector ((0 => ((236, 0), 82, 1,
(2147483647, 0), 0)));
- Table.States (627).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (628).Action_List.Set_Capacity (18);
- Add_Action (Table.States (628), 10, Reduce, (290, 0), 4, null,
null);
- Add_Action (Table.States (628), 20, Reduce, (290, 0), 4, null,
null);
- Add_Action (Table.States (628), 21, Reduce, (290, 0), 4, null,
null);
- Add_Action (Table.States (628), 22, Reduce, (290, 0), 4, null,
null);
- Add_Action (Table.States (628), 23, Reduce, (290, 0), 4, null,
null);
- Add_Action (Table.States (628), 35, Reduce, (290, 0), 4, null,
null);
- Add_Action (Table.States (628), 37, Reduce, (290, 0), 4, null,
null);
- Add_Action (Table.States (628), 43, Reduce, (290, 0), 4, null,
null);
- Add_Action (Table.States (628), 53, Reduce, (290, 0), 4, null,
null);
- Add_Action (Table.States (628), 68, Reduce, (290, 0), 4, null,
null);
- Add_Action (Table.States (628), 74, Reduce, (290, 0), 4, null,
null);
- Add_Action (Table.States (628), 75, Reduce, (290, 0), 4, null,
null);
- Add_Action (Table.States (628), 78, Reduce, (290, 0), 4, null,
null);
- Add_Action (Table.States (628), 79, Reduce, (290, 0), 4, null,
null);
- Add_Action (Table.States (628), 82, (236, 0), 627);
- Add_Conflict (Table.States (628), 82, (290, 0), 4, null, null);
- Add_Action (Table.States (628), 86, Reduce, (290, 0), 4, null,
null);
- Add_Action (Table.States (628), 90, Reduce, (290, 0), 4, null,
null);
- Add_Action (Table.States (628), 99, Reduce, (290, 0), 4, null,
null);
- Table.States (628).Kernel := To_Vector ((((236, 0), 236, 2,
(2147483647, 0), 0), ((290, 0), 236, 0,
- (290, 0), 4)));
- Table.States (628).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (290, 0), 4)));
- Table.States (629).Action_List.Set_Capacity (47);
- Add_Action (Table.States (629), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (193, 0), 5, exit_statement_0'Access, null);
- Table.States (629).Kernel := To_Vector ((0 => ((193, 0), 99, 0,
(193, 0), 5)));
- Table.States (629).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (193, 0), 5)));
- Table.States (630).Action_List.Set_Capacity (12);
- Add_Action (Table.States (630), 38, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (630), 55, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (630), 80, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (630), 81, (242, 8), 31);
- Add_Action (Table.States (630), 88, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (630), 97, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (630), 98, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (630), 100, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (630), 102, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (630), 107, (242, 5), 120);
- Add_Action (Table.States (630), 108, (242, 7), 34);
- Add_Action (Table.States (630), 109, (242, 6), 35);
- Table.States (630).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (630), 131, 42);
- Add_Goto (Table.States (630), 242, 791);
- Add_Goto (Table.States (630), 275, 93);
- Add_Goto (Table.States (630), 296, 98);
- Table.States (630).Kernel := To_Vector ((((261, 1), 41, 0, (261,
1), 1), ((317, 0), 41, 5,
- (2147483647, 0), 0), ((317, 1), 41, 1, (2147483647, 0), 0)));
- Table.States (630).Minimal_Complete_Actions := To_Vector
(((Reduce, (261, 1), 1), (Shift, (242, 5), 107,
- 120)));
- Table.States (631).Action_List.Set_Capacity (2);
- Add_Action (Table.States (631), (37, 90), (233, 2), 4,
iterator_specification_2'Access, null);
- Table.States (631).Kernel := To_Vector ((0 => ((233, 2), 170, 0,
(233, 2), 4)));
- Table.States (631).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (233, 2), 4)));
- Table.States (632).Action_List.Set_Capacity (13);
- Add_Action (Table.States (632), 3, (200, 2), 122);
- Add_Action (Table.States (632), 39, (261, 4), 123);
- Add_Action (Table.States (632), 40, (200, 3), 124);
- Add_Action (Table.States (632), 41, (261, 1), 125);
- Add_Action (Table.States (632), 76, (120, 0), 127);
- Add_Action (Table.States (632), 77, (120, 5), 128);
- Add_Action (Table.States (632), 81, (242, 8), 31);
- Add_Action (Table.States (632), 97, (333, 1), 129);
- Add_Action (Table.States (632), 98, (333, 0), 130);
- Add_Action (Table.States (632), 106, (261, 0), 131);
- Add_Action (Table.States (632), 107, (242, 5), 120);
- Add_Action (Table.States (632), 108, (242, 7), 34);
- Add_Action (Table.States (632), 109, (242, 6), 35);
- Table.States (632).Goto_List.Set_Capacity (12);
- Add_Goto (Table.States (632), 120, 132);
- Add_Goto (Table.States (632), 131, 42);
- Add_Goto (Table.States (632), 200, 135);
- Add_Goto (Table.States (632), 242, 276);
- Add_Goto (Table.States (632), 261, 137);
- Add_Goto (Table.States (632), 275, 93);
- Add_Goto (Table.States (632), 280, 792);
- Add_Goto (Table.States (632), 296, 98);
- Add_Goto (Table.States (632), 304, 486);
- Add_Goto (Table.States (632), 323, 146);
- Add_Goto (Table.States (632), 324, 147);
- Add_Goto (Table.States (632), 333, 148);
- Table.States (632).Kernel := To_Vector ((0 => ((158, 0), 53, 3,
(2147483647, 0), 0)));
- Table.States (632).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (633).Action_List.Set_Capacity (22);
- Add_Action (Table.States (633), 3, (200, 2), 122);
- Add_Action (Table.States (633), 15, (139, 0), 260);
- Add_Action (Table.States (633), 28, (127, 6), 261);
- Add_Action (Table.States (633), 32, (224, 0), 262);
- Add_Action (Table.States (633), 39, (261, 4), 123);
- Add_Action (Table.States (633), 40, (168, 1), 777);
- Add_Action (Table.States (633), 41, (261, 1), 125);
- Add_Action (Table.States (633), 44, (168, 3), 265);
- Add_Action (Table.States (633), 52, (278, 0), 126);
- Add_Action (Table.States (633), 76, (120, 0), 127);
- Add_Action (Table.States (633), 77, (120, 5), 128);
- Add_Action (Table.States (633), 78, Reduce, (127, 5), 0, null,
null);
- Add_Action (Table.States (633), 81, (242, 8), 31);
- Add_Action (Table.States (633), 82, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (633), 86, Reduce, (127, 5), 0, null,
null);
- Add_Action (Table.States (633), 90, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (633), 97, (333, 1), 129);
- Add_Action (Table.States (633), 98, (333, 0), 130);
- Add_Action (Table.States (633), 106, (261, 0), 131);
- Add_Action (Table.States (633), 107, (242, 5), 120);
- Add_Action (Table.States (633), 108, (242, 7), 34);
- Add_Action (Table.States (633), 109, (127, 0), 266);
- Table.States (633).Goto_List.Set_Capacity (32);
- Add_Goto (Table.States (633), 120, 132);
- Add_Goto (Table.States (633), 127, 267);
- Add_Goto (Table.States (633), 128, 409);
- Add_Goto (Table.States (633), 131, 42);
- Add_Goto (Table.States (633), 139, 269);
- Add_Goto (Table.States (633), 156, 410);
- Add_Goto (Table.States (633), 168, 271);
- Add_Goto (Table.States (633), 169, 272);
- Add_Goto (Table.States (633), 170, 793);
- Add_Goto (Table.States (633), 171, 794);
- Add_Goto (Table.States (633), 194, 411);
- Add_Goto (Table.States (633), 200, 135);
- Add_Goto (Table.States (633), 224, 275);
- Add_Goto (Table.States (633), 242, 484);
- Add_Goto (Table.States (633), 261, 137);
- Add_Goto (Table.States (633), 275, 93);
- Add_Goto (Table.States (633), 276, 277);
- Add_Goto (Table.States (633), 278, 138);
- Add_Goto (Table.States (633), 280, 795);
- Add_Goto (Table.States (633), 281, 413);
- Add_Goto (Table.States (633), 285, 139);
- Add_Goto (Table.States (633), 286, 140);
- Add_Goto (Table.States (633), 287, 141);
- Add_Goto (Table.States (633), 288, 142);
- Add_Goto (Table.States (633), 289, 143);
- Add_Goto (Table.States (633), 290, 144);
- Add_Goto (Table.States (633), 296, 98);
- Add_Goto (Table.States (633), 304, 279);
- Add_Goto (Table.States (633), 317, 487);
- Add_Goto (Table.States (633), 323, 146);
- Add_Goto (Table.States (633), 324, 147);
- Add_Goto (Table.States (633), 333, 148);
- Table.States (633).Kernel := To_Vector ((((118, 0), 76, 1,
(2147483647, 0), 0), ((118, 1), 76, 3,
- (2147483647, 0), 0), ((227, 0), 76, 4, (2147483647, 0), 0),
((242, 0), 76, 4, (2147483647, 0), 0)));
- Table.States (633).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (128, 1), 0)));
- Table.States (634).Action_List.Set_Capacity (10);
- Add_Action (Table.States (634), (10, 21, 37, 42, 74, 78, 85, 86,
90, 99), (317, 2), 2,
- subtype_indication_2'Access, null);
- Table.States (634).Kernel := To_Vector ((0 => ((317, 2), 158, 0,
(317, 2), 2)));
- Table.States (634).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (317, 2), 2)));
- Table.States (635).Action_List.Set_Capacity (10);
- Add_Action (Table.States (635), (10, 21, 37, 42, 74, 78, 85, 86,
90, 99), (158, 1), 1, null, null);
- Table.States (635).Kernel := To_Vector ((0 => ((158, 1), 227, 0,
(158, 1), 1)));
- Table.States (635).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (158, 1), 1)));
- Table.States (636).Action_List.Set_Capacity (6);
- Add_Action (Table.States (636), 37, Reduce, (233, 3), 4, null,
null);
- Add_Action (Table.States (636), 76, (118, 0), 237);
- Add_Action (Table.States (636), 87, (296, 0), 239);
- Add_Action (Table.States (636), 90, Reduce, (233, 3), 4, null,
null);
- Add_Action (Table.States (636), 104, (325, 0), 241);
- Add_Action (Table.States (636), 105, (325, 1), 242);
- Table.States (636).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (636), 118, 243);
- Add_Goto (Table.States (636), 325, 244);
- Table.States (636).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((233, 3), 242, 0,
- (233, 3), 4), ((242, 0), 242, 5, (2147483647, 0), 0), ((242,
1), 242, 2, (2147483647, 0), 0), ((275,
- 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (636).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (233, 3), 4)));
- Table.States (637).Action_List.Set_Capacity (4);
- Add_Action (Table.States (637), 81, (242, 8), 31);
- Add_Action (Table.States (637), 107, (242, 5), 120);
- Add_Action (Table.States (637), 108, (242, 7), 34);
- Add_Action (Table.States (637), 109, (242, 6), 35);
- Table.States (637).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (637), 131, 42);
- Add_Goto (Table.States (637), 242, 791);
- Add_Goto (Table.States (637), 275, 93);
- Add_Goto (Table.States (637), 296, 98);
- Table.States (637).Kernel := To_Vector ((((317, 0), 41, 5,
(2147483647, 0), 0), ((317, 1), 41, 1,
- (2147483647, 0), 0)));
- Table.States (637).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (638).Action_List.Set_Capacity (5);
- Add_Action (Table.States (638), 59, (233, 0), 796);
- Add_Action (Table.States (638), 81, (242, 8), 31);
- Add_Action (Table.States (638), 107, (242, 5), 120);
- Add_Action (Table.States (638), 108, (242, 7), 34);
- Add_Action (Table.States (638), 109, (242, 6), 35);
- Table.States (638).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (638), 131, 42);
- Add_Goto (Table.States (638), 242, 797);
- Add_Goto (Table.States (638), 275, 93);
- Add_Goto (Table.States (638), 296, 98);
- Table.States (638).Kernel := To_Vector ((((233, 0), 42, 2,
(2147483647, 0), 0), ((233, 1), 42, 1,
- (2147483647, 0), 0)));
- Table.States (638).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (639).Action_List.Set_Capacity (42);
- Add_Action (Table.States (639), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 72, 73,
74, 81, 96, 107, 108, 109, 110), (124, 0),
- 5, aspect_clause_0'Access, null);
- Table.States (639).Kernel := To_Vector ((0 => ((124, 0), 99, 0,
(124, 0), 5)));
- Table.States (639).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (124, 0), 5)));
- Table.States (640).Action_List.Set_Capacity (1);
- Add_Action (Table.States (640), 99, (130, 0), 798);
- Table.States (640).Kernel := To_Vector ((0 => ((130, 0), 195, 1,
(2147483647, 0), 0)));
- Table.States (640).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (130, 0), 99, 798)));
- Table.States (641).Action_List.Set_Capacity (1);
- Add_Action (Table.States (641), 38, (238, 0), 799);
- Table.States (641).Kernel := To_Vector ((0 => ((238, 0), 12, 2,
(2147483647, 0), 0)));
- Table.States (641).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (238, 0), 38, 799)));
- Table.States (642).Action_List.Set_Capacity (1);
- Add_Action (Table.States (642), 107, (147, 0), 800);
- Table.States (642).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (642), 147, 801);
- Add_Goto (Table.States (642), 148, 802);
- Table.States (642).Kernel := To_Vector ((0 => ((284, 0), 238,
11, (2147483647, 0), 0)));
- Table.States (642).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (147, 0), 107, 800)));
- Table.States (643).Action_List.Set_Capacity (42);
- Add_Action (Table.States (643), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 72, 73,
74, 81, 96, 107, 108, 109, 110), (185, 0),
- 5, enumeration_representation_clause_0'Access, null);
- Table.States (643).Kernel := To_Vector ((0 => ((185, 0), 99, 0,
(185, 0), 5)));
- Table.States (643).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (185, 0), 5)));
- Table.States (644).Action_List.Set_Capacity (11);
- Add_Action (Table.States (644), 21, Reduce, (243, 0), 1, null,
name_opt_0_check'Access);
- Add_Action (Table.States (644), 35, Reduce, (243, 0), 1, null,
name_opt_0_check'Access);
- Add_Action (Table.States (644), 56, Reduce, (243, 0), 1, null,
name_opt_0_check'Access);
- Add_Action (Table.States (644), 74, Reduce, (243, 0), 1, null,
name_opt_0_check'Access);
- Add_Action (Table.States (644), 76, (118, 0), 237);
- Add_Action (Table.States (644), 78, Reduce, (243, 0), 1, null,
name_opt_0_check'Access);
- Add_Action (Table.States (644), 85, Reduce, (243, 0), 1, null,
name_opt_0_check'Access);
- Add_Action (Table.States (644), 87, (296, 0), 239);
- Add_Action (Table.States (644), 99, Reduce, (243, 0), 1, null,
name_opt_0_check'Access);
- Add_Action (Table.States (644), 104, (325, 0), 241);
- Add_Action (Table.States (644), 105, (325, 1), 242);
- Table.States (644).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (644), 118, 243);
- Add_Goto (Table.States (644), 325, 244);
- Table.States (644).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((242, 0), 242, 5,
- (2147483647, 0), 0), ((242, 1), 242, 2, (2147483647, 0), 0),
((243, 0), 242, 0, (243, 0), 1), ((275,
- 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (644).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (243, 0), 1)));
- Table.States (645).Action_List.Set_Capacity (7);
- Add_Action (Table.States (645), (21, 35, 56, 74, 78, 85, 99),
(294, 0), 3, result_profile_0'Access, null);
- Table.States (645).Kernel := To_Vector ((0 => ((294, 0), 243, 0,
(294, 0), 3)));
- Table.States (645).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (294, 0), 3)));
- Table.States (646).Action_List.Set_Capacity (12);
- Add_Action (Table.States (646), 7, Reduce, (121, 1), 0, null,
null);
- Add_Action (Table.States (646), 8, (121, 0), 404);
- Add_Action (Table.States (646), 33, Reduce, (121, 1), 0, null,
null);
- Add_Action (Table.States (646), 40, Reduce, (121, 1), 0, null,
null);
- Add_Action (Table.States (646), 45, Reduce, (121, 1), 0, null,
null);
- Add_Action (Table.States (646), 78, Reduce, (121, 1), 0, null,
null);
- Add_Action (Table.States (646), 81, Reduce, (121, 1), 0, null,
null);
- Add_Action (Table.States (646), 85, Reduce, (121, 1), 0, null,
null);
- Add_Action (Table.States (646), 99, Reduce, (121, 1), 0, null,
null);
- Add_Action (Table.States (646), 107, Reduce, (121, 1), 0, null,
null);
- Add_Action (Table.States (646), 108, Reduce, (121, 1), 0, null,
null);
- Add_Action (Table.States (646), 109, Reduce, (121, 1), 0, null,
null);
- Table.States (646).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (646), 121, 803);
- Table.States (646).Kernel := To_Vector ((((257, 0), 84, 2,
(2147483647, 0), 0), ((257, 1), 84, 1,
- (2147483647, 0), 0), ((257, 2), 84, 3, (2147483647, 0), 0),
((257, 3), 84, 2, (2147483647, 0), 0)));
- Table.States (646).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (121, 1), 0)));
- Table.States (647).Action_List.Set_Capacity (9);
- Add_Action (Table.States (647), (21, 35, 56, 58, 72, 74, 78, 85,
99), (202, 0), 3, formal_part_0'Access,
- null);
- Table.States (647).Kernel := To_Vector ((0 => ((202, 0), 78, 0,
(202, 0), 3)));
- Table.States (647).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (202, 0), 3)));
- Table.States (648).Action_List.Set_Capacity (3);
- Add_Action (Table.States (648), 78, Reduce, (257, 4), 0, null,
null);
- Add_Action (Table.States (648), 99, Reduce, (257, 4), 0, null,
null);
- Add_Action (Table.States (648), 107, (222, 1), 166);
- Table.States (648).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (648), 222, 500);
- Add_Goto (Table.States (648), 257, 804);
- Table.States (648).Kernel := To_Vector ((0 => ((258, 0), 99, 0,
(257, 4), 0)));
- Table.States (648).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (257, 4), 0)));
- Table.States (649).Action_List.Set_Capacity (6);
- Add_Action (Table.States (649), 74, (125, 0), 340);
- Add_Action (Table.States (649), 76, (118, 0), 237);
- Add_Action (Table.States (649), 87, (296, 0), 239);
- Add_Action (Table.States (649), 99, Reduce, (125, 1), 0, null,
null);
- Add_Action (Table.States (649), 104, (325, 0), 241);
- Add_Action (Table.States (649), 105, (325, 1), 242);
- Table.States (649).Goto_List.Set_Capacity (3);
- Add_Goto (Table.States (649), 118, 243);
- Add_Goto (Table.States (649), 125, 805);
- Add_Goto (Table.States (649), 325, 244);
- Table.States (649).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((218, 2), 242, 1,
- (2147483647, 0), 0), ((242, 0), 242, 5, (2147483647, 0), 0),
((242, 1), 242, 2, (2147483647, 0), 0),
- ((275, 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (649).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (650).Action_List.Set_Capacity (6);
- Add_Action (Table.States (650), 74, (125, 0), 340);
- Add_Action (Table.States (650), 76, (118, 0), 237);
- Add_Action (Table.States (650), 87, (296, 0), 239);
- Add_Action (Table.States (650), 99, Reduce, (125, 1), 0, null,
null);
- Add_Action (Table.States (650), 104, (325, 0), 241);
- Add_Action (Table.States (650), 105, (325, 1), 242);
- Table.States (650).Goto_List.Set_Capacity (3);
- Add_Goto (Table.States (650), 118, 243);
- Add_Goto (Table.States (650), 125, 806);
- Add_Goto (Table.States (650), 325, 244);
- Table.States (650).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((218, 0), 242, 1,
- (2147483647, 0), 0), ((242, 0), 242, 5, (2147483647, 0), 0),
((242, 1), 242, 2, (2147483647, 0), 0),
- ((275, 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (650).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (651).Action_List.Set_Capacity (6);
- Add_Action (Table.States (651), 74, (125, 0), 340);
- Add_Action (Table.States (651), 76, (118, 0), 237);
- Add_Action (Table.States (651), 87, (296, 0), 239);
- Add_Action (Table.States (651), 99, Reduce, (125, 1), 0, null,
null);
- Add_Action (Table.States (651), 104, (325, 0), 241);
- Add_Action (Table.States (651), 105, (325, 1), 242);
- Table.States (651).Goto_List.Set_Capacity (3);
- Add_Goto (Table.States (651), 118, 243);
- Add_Goto (Table.States (651), 125, 807);
- Add_Goto (Table.States (651), 325, 244);
- Table.States (651).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((218, 1), 242, 1,
- (2147483647, 0), 0), ((242, 0), 242, 5, (2147483647, 0), 0),
((242, 1), 242, 2, (2147483647, 0), 0),
- ((275, 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (651).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (652).Action_List.Set_Capacity (17);
- Add_Action (Table.States (652), 6, (112, 0), 808);
- Add_Action (Table.States (652), 7, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (652), 11, (123, 0), 713);
- Add_Action (Table.States (652), 19, (205, 6), 809);
- Add_Action (Table.States (652), 20, (205, 5), 810);
- Add_Action (Table.States (652), 34, (231, 8), 716);
- Add_Action (Table.States (652), 36, (112, 3), 811);
- Add_Action (Table.States (652), 38, (205, 4), 812);
- Add_Action (Table.States (652), 39, Reduce, (112, 5), 0, null,
null);
- Add_Action (Table.States (652), 40, (244, 0), 389);
- Add_Action (Table.States (652), 49, Reduce, (114, 5), 0, null,
null);
- Add_Action (Table.States (652), 51, (231, 2), 720);
- Add_Action (Table.States (652), 53, (205, 3), 813);
- Add_Action (Table.States (652), 64, (112, 4), 723);
- Add_Action (Table.States (652), 65, (114, 2), 814);
- Add_Action (Table.States (652), 66, (231, 1), 725);
- Add_Action (Table.States (652), 76, (205, 2), 815);
- Table.States (652).Goto_List.Set_Capacity (8);
- Add_Goto (Table.States (652), 112, 816);
- Add_Goto (Table.States (652), 114, 817);
- Add_Goto (Table.States (652), 117, 818);
- Add_Goto (Table.States (652), 123, 819);
- Add_Goto (Table.States (652), 205, 820);
- Add_Goto (Table.States (652), 206, 821);
- Add_Goto (Table.States (652), 231, 822);
- Add_Goto (Table.States (652), 244, 735);
- Table.States (652).Kernel := To_Vector ((((204, 0), 35, 2,
(2147483647, 0), 0), ((204, 1), 35, 2,
- (2147483647, 0), 0)));
- Table.States (652).Minimal_Complete_Actions := To_Vector
(((Reduce, (114, 5), 0), (Shift, (114, 2), 65,
- 814)));
- Table.States (653).Action_List.Set_Capacity (1);
- Add_Action (Table.States (653), 99, (204, 2), 823);
- Table.States (653).Kernel := To_Vector ((0 => ((204, 2), 125, 1,
(2147483647, 0), 0)));
- Table.States (653).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (204, 2), 99, 823)));
- Table.States (654).Action_List.Set_Capacity (1);
- Add_Action (Table.States (654), 39, (207, 0), 824);
- Table.States (654).Kernel := To_Vector ((0 => ((207, 0), 35, 3,
(2147483647, 0), 0)));
- Table.States (654).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (207, 0), 39, 824)));
- Table.States (655).Action_List.Set_Capacity (8);
- Add_Action (Table.States (655), 41, (313, 2), 656);
- Add_Action (Table.States (655), 74, (125, 0), 340);
- Add_Action (Table.States (655), 81, (242, 8), 31);
- Add_Action (Table.States (655), 83, (313, 1), 657);
- Add_Action (Table.States (655), 99, Reduce, (125, 1), 0, null,
null);
- Add_Action (Table.States (655), 107, (242, 5), 120);
- Add_Action (Table.States (655), 108, (242, 7), 34);
- Add_Action (Table.States (655), 109, (242, 6), 35);
- Table.States (655).Goto_List.Set_Capacity (6);
- Add_Goto (Table.States (655), 125, 825);
- Add_Goto (Table.States (655), 131, 42);
- Add_Goto (Table.States (655), 242, 658);
- Add_Goto (Table.States (655), 275, 93);
- Add_Goto (Table.States (655), 296, 98);
- Add_Goto (Table.States (655), 313, 826);
- Table.States (655).Kernel := To_Vector ((((203, 0), 6, 2,
(2147483647, 0), 0), ((203, 2), 6, 1,
- (2147483647, 0), 0)));
- Table.States (655).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (656).Action_List.Set_Capacity (2);
- Add_Action (Table.States (656), (74, 99), (313, 2), 1, null,
null);
- Table.States (656).Kernel := To_Vector ((0 => ((313, 2), 41, 0,
(313, 2), 1)));
- Table.States (656).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (313, 2), 1)));
- Table.States (657).Action_List.Set_Capacity (2);
- Add_Action (Table.States (657), (74, 99), (313, 1), 1, null,
null);
- Table.States (657).Kernel := To_Vector ((0 => ((313, 1), 83, 0,
(313, 1), 1)));
- Table.States (657).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (313, 1), 1)));
- Table.States (658).Action_List.Set_Capacity (6);
- Add_Action (Table.States (658), 74, Reduce, (313, 0), 1,
subprogram_default_0'Access, null);
- Add_Action (Table.States (658), 76, (118, 0), 237);
- Add_Action (Table.States (658), 87, (296, 0), 239);
- Add_Action (Table.States (658), 99, Reduce, (313, 0), 1,
subprogram_default_0'Access, null);
- Add_Action (Table.States (658), 104, (325, 0), 241);
- Add_Action (Table.States (658), 105, (325, 1), 242);
- Table.States (658).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (658), 118, 243);
- Add_Goto (Table.States (658), 325, 244);
- Table.States (658).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((242, 0), 242, 5,
- (2147483647, 0), 0), ((242, 1), 242, 2, (2147483647, 0), 0),
((275, 0), 242, 3, (2147483647, 0), 0),
- ((296, 0), 242, 2, (2147483647, 0), 0), ((296, 1), 242, 2,
(2147483647, 0), 0), ((296, 2), 242, 2,
- (2147483647, 0), 0), ((296, 3), 242, 2, (2147483647, 0), 0),
((313, 0), 242, 0, (313, 0), 1)));
- Table.States (658).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (313, 0), 1)));
- Table.States (659).Action_List.Set_Capacity (2);
- Add_Action (Table.States (659), 74, (125, 0), 340);
- Add_Action (Table.States (659), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (659).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (659), 125, 827);
- Table.States (659).Kernel := To_Vector ((0 => ((203, 1), 313, 1,
(2147483647, 0), 0)));
- Table.States (659).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (660).Action_List.Set_Capacity (8);
- Add_Action (Table.States (660), (29, 47, 48, 50, 69, 71, 74, 107),
(203, 3), 4,
- formal_subprogram_declaration_3'Access, null);
- Table.States (660).Kernel := To_Vector ((0 => ((203, 3), 99, 0,
(203, 3), 4)));
- Table.States (660).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (203, 3), 4)));
- Table.States (661).Action_List.Set_Capacity (9);
- Add_Action (Table.States (661), (7, 40, 74, 81, 85, 99, 107, 108,
109), (239, 1), 2, null, null);
- Table.States (661).Kernel := To_Vector ((0 => ((239, 1), 45, 0,
(239, 1), 2)));
- Table.States (661).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (239, 1), 2)));
- Table.States (662).Action_List.Set_Capacity (3);
- Add_Action (Table.States (662), 74, (125, 0), 340);
- Add_Action (Table.States (662), 85, (201, 1), 828);
- Add_Action (Table.States (662), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (662).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (662), 125, 829);
- Table.States (662).Kernel := To_Vector ((((201, 1), 117, 2,
(2147483647, 0), 0), ((201, 3), 117, 1,
- (2147483647, 0), 0)));
- Table.States (662).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (663).Action_List.Set_Capacity (5);
- Add_Action (Table.States (663), 7, (117, 0), 564);
- Add_Action (Table.States (663), 81, (242, 8), 31);
- Add_Action (Table.States (663), 107, (242, 5), 120);
- Add_Action (Table.States (663), 108, (242, 7), 34);
- Add_Action (Table.States (663), 109, (242, 6), 35);
- Table.States (663).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (663), 131, 42);
- Add_Goto (Table.States (663), 242, 830);
- Add_Goto (Table.States (663), 275, 93);
- Add_Goto (Table.States (663), 296, 98);
- Table.States (663).Kernel := To_Vector ((((117, 0), 244, 2,
(2147483647, 0), 0), ((117, 1), 244, 3,
- (2147483647, 0), 0), ((117, 2), 244, 2, (2147483647, 0), 0),
((201, 0), 244, 3, (2147483647, 0), 0),
- ((201, 2), 244, 2, (2147483647, 0), 0)));
- Table.States (663).Minimal_Complete_Actions := To_Vector (((Shift,
(117, 0), 7, 564), (Shift, (242, 5),
- 107, 120)));
- Table.States (664).Action_List.Set_Capacity (24);
- Add_Action (Table.States (664), 4, (116, 0), 1);
- Add_Action (Table.States (664), 5, (306, 8), 2);
- Add_Action (Table.States (664), 13, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (664), 15, (142, 0), 3);
- Add_Action (Table.States (664), 17, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (664), 18, (164, 0), 4);
- Add_Action (Table.States (664), 24, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (664), 27, (193, 0), 5);
- Add_Action (Table.States (664), 28, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (664), 31, (306, 3), 9);
- Add_Action (Table.States (664), 32, (225, 0), 10);
- Add_Action (Table.States (664), 37, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (664), 41, (306, 0), 13);
- Add_Action (Table.States (664), 48, (260, 0), 16);
- Add_Action (Table.States (664), 52, (279, 0), 20);
- Add_Action (Table.States (664), 57, (293, 0), 21);
- Add_Action (Table.States (664), 58, (199, 0), 22);
- Add_Action (Table.States (664), 61, (129, 0), 24);
- Add_Action (Table.States (664), 73, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (664), 81, (242, 8), 31);
- Add_Action (Table.States (664), 96, (220, 0), 32);
- Add_Action (Table.States (664), 107, (134, 0), 363);
- Add_Action (Table.States (664), 108, (242, 7), 34);
- Add_Action (Table.States (664), 109, (242, 6), 35);
- Table.States (664).Goto_List.Set_Capacity (31);
- Add_Goto (Table.States (664), 116, 37);
- Add_Goto (Table.States (664), 126, 39);
- Add_Goto (Table.States (664), 129, 40);
- Add_Goto (Table.States (664), 131, 42);
- Add_Goto (Table.States (664), 134, 43);
- Add_Goto (Table.States (664), 135, 44);
- Add_Goto (Table.States (664), 136, 45);
- Add_Goto (Table.States (664), 142, 48);
- Add_Goto (Table.States (664), 154, 51);
- Add_Goto (Table.States (664), 155, 52);
- Add_Goto (Table.States (664), 164, 54);
- Add_Goto (Table.States (664), 193, 58);
- Add_Goto (Table.States (664), 199, 60);
- Add_Goto (Table.States (664), 220, 69);
- Add_Goto (Table.States (664), 225, 71);
- Add_Goto (Table.States (664), 235, 73);
- Add_Goto (Table.States (664), 242, 74);
- Add_Goto (Table.States (664), 260, 84);
- Add_Goto (Table.States (664), 264, 87);
- Add_Goto (Table.States (664), 275, 93);
- Add_Goto (Table.States (664), 279, 94);
- Add_Goto (Table.States (664), 293, 97);
- Add_Goto (Table.States (664), 296, 98);
- Add_Goto (Table.States (664), 297, 99);
- Add_Goto (Table.States (664), 301, 100);
- Add_Goto (Table.States (664), 302, 364);
- Add_Goto (Table.States (664), 303, 831);
- Add_Goto (Table.States (664), 305, 101);
- Add_Goto (Table.States (664), 306, 102);
- Add_Goto (Table.States (664), 309, 366);
- Add_Goto (Table.States (664), 326, 115);
- Table.States (664).Kernel := To_Vector ((0 => ((225, 1), 22, 3,
(2147483647, 0), 0)));
- Table.States (664).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (303, 1), 0)));
- Table.States (665).Action_List.Set_Capacity (15);
- Add_Action (Table.States (665), 3, (200, 2), 122);
- Add_Action (Table.States (665), 39, (261, 4), 123);
- Add_Action (Table.States (665), 40, (200, 3), 124);
- Add_Action (Table.States (665), 41, (261, 1), 125);
- Add_Action (Table.States (665), 52, (278, 0), 126);
- Add_Action (Table.States (665), 68, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (665), 76, (120, 0), 127);
- Add_Action (Table.States (665), 77, (120, 5), 128);
- Add_Action (Table.States (665), 81, (242, 8), 31);
- Add_Action (Table.States (665), 97, (333, 1), 129);
- Add_Action (Table.States (665), 98, (333, 0), 130);
- Add_Action (Table.States (665), 106, (261, 0), 131);
- Add_Action (Table.States (665), 107, (242, 5), 120);
- Add_Action (Table.States (665), 108, (242, 7), 34);
- Add_Action (Table.States (665), 109, (242, 6), 35);
- Table.States (665).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (665), 120, 132);
- Add_Goto (Table.States (665), 131, 42);
- Add_Goto (Table.States (665), 194, 133);
- Add_Goto (Table.States (665), 195, 832);
- Add_Goto (Table.States (665), 200, 135);
- Add_Goto (Table.States (665), 242, 136);
- Add_Goto (Table.States (665), 261, 137);
- Add_Goto (Table.States (665), 275, 93);
- Add_Goto (Table.States (665), 278, 138);
- Add_Goto (Table.States (665), 285, 139);
- Add_Goto (Table.States (665), 286, 140);
- Add_Goto (Table.States (665), 287, 141);
- Add_Goto (Table.States (665), 288, 142);
- Add_Goto (Table.States (665), 289, 143);
- Add_Goto (Table.States (665), 290, 144);
- Add_Goto (Table.States (665), 296, 98);
- Add_Goto (Table.States (665), 304, 145);
- Add_Goto (Table.States (665), 323, 146);
- Add_Goto (Table.States (665), 324, 147);
- Add_Goto (Table.States (665), 333, 148);
- Table.States (665).Kernel := To_Vector ((0 => ((177, 0), 23, 1,
(2147483647, 0), 0)));
- Table.States (665).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (666).Action_List.Set_Capacity (1);
- Add_Action (Table.States (666), 32, (225, 3), 833);
- Table.States (666).Kernel := To_Vector ((0 => ((225, 3), 24, 2,
(2147483647, 0), 0)));
- Table.States (666).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (225, 3), 32, 833)));
- Table.States (667).Action_List.Set_Capacity (3);
- Add_Action (Table.States (667), (22, 23, 24), (178, 1), 1, null,
null);
- Table.States (667).Kernel := To_Vector ((0 => ((178, 1), 177, 0,
(178, 1), 1)));
- Table.States (667).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (178, 1), 1)));
- Table.States (668).Action_List.Set_Capacity (3);
- Add_Action (Table.States (668), 22, (225, 0), 834);
- Add_Action (Table.States (668), 23, (177, 0), 665);
- Add_Action (Table.States (668), 24, (225, 2), 835);
- Table.States (668).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (668), 177, 836);
- Table.States (668).Kernel := To_Vector ((((178, 0), 178, 2,
(2147483647, 0), 0), ((225, 0), 178, 4,
- (2147483647, 0), 0), ((225, 2), 178, 3, (2147483647, 0), 0)));
- Table.States (668).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (225, 2), 24, 835)));
- end Subr_13;
- procedure Subr_14
- is begin
- Table.States (669).Action_List.Set_Capacity (40);
- Add_Action (Table.States (669), (4, 5, 13, 15, 17, 18, 25, 27, 28,
29, 30, 31, 32, 36, 37, 40, 41, 46, 47,
- 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 81,
96, 107, 108, 109, 110), (335, 0), 5,
- with_clause_0'Access, null);
- Table.States (669).Kernel := To_Vector ((0 => ((335, 0), 99, 0,
(335, 0), 5)));
- Table.States (669).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (335, 0), 5)));
- Table.States (670).Action_List.Set_Capacity (2);
- Add_Action (Table.States (670), 74, (125, 0), 340);
- Add_Action (Table.States (670), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (670).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (670), 125, 837);
- Table.States (670).Kernel := To_Vector ((0 => ((251, 0), 60, 1,
(2147483647, 0), 0)));
- Table.States (670).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (671).Action_List.Set_Capacity (17);
- Add_Action (Table.States (671), 13, Reduce, (162, 1), 0, null,
null);
- Add_Action (Table.States (671), 24, Reduce, (162, 1), 0, null,
null);
- Add_Action (Table.States (671), 25, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (671), 28, (124, 0), 185);
- Add_Action (Table.States (671), 29, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (671), 30, (213, 0), 8);
- Add_Action (Table.States (671), 40, (249, 0), 12);
- Add_Action (Table.States (671), 46, (249, 1), 14);
- Add_Action (Table.States (671), 47, (216, 0), 15);
- Add_Action (Table.States (671), 48, (260, 0), 16);
- Add_Action (Table.States (671), 50, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (671), 51, (267, 0), 19);
- Add_Action (Table.States (671), 63, (316, 0), 25);
- Add_Action (Table.States (671), 66, (308, 0), 26);
- Add_Action (Table.States (671), 69, (209, 0), 27);
- Add_Action (Table.States (671), 71, (334, 0), 28);
- Add_Action (Table.States (671), 107, (222, 1), 187);
- Table.States (671).Goto_List.Set_Capacity (53);
- Add_Goto (Table.States (671), 115, 36);
- Add_Goto (Table.States (671), 124, 38);
- Add_Goto (Table.States (671), 130, 41);
- Add_Goto (Table.States (671), 137, 46);
- Add_Goto (Table.States (671), 138, 47);
- Add_Goto (Table.States (671), 160, 394);
- Add_Goto (Table.States (671), 161, 395);
- Add_Goto (Table.States (671), 162, 838);
- Add_Goto (Table.States (671), 182, 55);
- Add_Goto (Table.States (671), 185, 56);
- Add_Goto (Table.States (671), 189, 57);
- Add_Goto (Table.States (671), 196, 59);
- Add_Goto (Table.States (671), 209, 61);
- Add_Goto (Table.States (671), 210, 62);
- Add_Goto (Table.States (671), 212, 63);
- Add_Goto (Table.States (671), 213, 64);
- Add_Goto (Table.States (671), 216, 65);
- Add_Goto (Table.States (671), 217, 66);
- Add_Goto (Table.States (671), 218, 67);
- Add_Goto (Table.States (671), 219, 68);
- Add_Goto (Table.States (671), 222, 70);
- Add_Goto (Table.States (671), 226, 72);
- Add_Goto (Table.States (671), 246, 75);
- Add_Goto (Table.States (671), 247, 76);
- Add_Goto (Table.States (671), 248, 77);
- Add_Goto (Table.States (671), 249, 78);
- Add_Goto (Table.States (671), 250, 79);
- Add_Goto (Table.States (671), 251, 80);
- Add_Goto (Table.States (671), 252, 81);
- Add_Goto (Table.States (671), 253, 82);
- Add_Goto (Table.States (671), 254, 83);
- Add_Goto (Table.States (671), 260, 397);
- Add_Goto (Table.States (671), 262, 85);
- Add_Goto (Table.States (671), 263, 86);
- Add_Goto (Table.States (671), 265, 88);
- Add_Goto (Table.States (671), 266, 89);
- Add_Goto (Table.States (671), 267, 90);
- Add_Goto (Table.States (671), 268, 91);
- Add_Goto (Table.States (671), 274, 92);
- Add_Goto (Table.States (671), 284, 95);
- Add_Goto (Table.States (671), 292, 96);
- Add_Goto (Table.States (671), 307, 103);
- Add_Goto (Table.States (671), 308, 104);
- Add_Goto (Table.States (671), 310, 106);
- Add_Goto (Table.States (671), 311, 107);
- Add_Goto (Table.States (671), 312, 108);
- Add_Goto (Table.States (671), 314, 109);
- Add_Goto (Table.States (671), 316, 110);
- Add_Goto (Table.States (671), 319, 112);
- Add_Goto (Table.States (671), 320, 113);
- Add_Goto (Table.States (671), 322, 114);
- Add_Goto (Table.States (671), 328, 116);
- Add_Goto (Table.States (671), 334, 117);
- Table.States (671).Kernel := To_Vector ((((250, 0), 35, 3,
(2147483647, 0), 0), ((250, 1), 35, 2,
- (2147483647, 0), 0)));
- Table.States (671).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (162, 1), 0)));
- Table.States (672).Action_List.Set_Capacity (6);
- Add_Action (Table.States (672), 74, (125, 0), 340);
- Add_Action (Table.States (672), 76, (118, 0), 237);
- Add_Action (Table.States (672), 87, (296, 0), 239);
- Add_Action (Table.States (672), 99, Reduce, (125, 1), 0, null,
null);
- Add_Action (Table.States (672), 104, (325, 0), 241);
- Add_Action (Table.States (672), 105, (325, 1), 242);
- Table.States (672).Goto_List.Set_Capacity (3);
- Add_Goto (Table.States (672), 118, 243);
- Add_Goto (Table.States (672), 125, 839);
- Add_Goto (Table.States (672), 325, 244);
- Table.States (672).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((216, 0), 242, 1,
- (2147483647, 0), 0), ((242, 0), 242, 5, (2147483647, 0), 0),
((242, 1), 242, 2, (2147483647, 0), 0),
- ((275, 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (672).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (673).Action_List.Set_Capacity (1);
- Add_Action (Table.States (673), 99, (253, 0), 840);
- Table.States (673).Kernel := To_Vector ((0 => ((253, 0), 125, 1,
(2147483647, 0), 0)));
- Table.States (673).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (253, 0), 99, 840)));
- Table.States (674).Action_List.Set_Capacity (2);
- Add_Action (Table.States (674), 24, (254, 1), 841);
- Add_Action (Table.States (674), 49, (254, 0), 842);
- Table.States (674).Kernel := To_Vector ((((254, 0), 162, 2,
(2147483647, 0), 0), ((254, 1), 162, 1,
- (2147483647, 0), 0)));
- Table.States (674).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (254, 1), 24, 841)));
- Table.States (675).Action_List.Set_Capacity (1);
- Add_Action (Table.States (675), 99, (260, 0), 843);
- Table.States (675).Kernel := To_Vector ((0 => ((260, 0), 78, 1,
(2147483647, 0), 0)));
- Table.States (675).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (260, 0), 99, 843)));
- Table.States (676).Action_List.Set_Capacity (1);
- Add_Action (Table.States (676), 99, (260, 1), 844);
- Table.States (676).Kernel := To_Vector ((0 => ((260, 1), 78, 1,
(2147483647, 0), 0)));
- Table.States (676).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (260, 1), 99, 844)));
- Table.States (677).Action_List.Set_Capacity (2);
- Add_Action (Table.States (677), 74, (125, 0), 340);
- Add_Action (Table.States (677), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (677).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (677), 125, 845);
- Table.States (677).Kernel := To_Vector ((0 => ((268, 0), 60, 1,
(2147483647, 0), 0)));
- Table.States (677).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (678).Action_List.Set_Capacity (7);
- Add_Action (Table.States (678), 24, Reduce, (272, 1), 0, null,
null);
- Add_Action (Table.States (678), 25, (179, 0), 846);
- Add_Action (Table.States (678), 28, (124, 0), 185);
- Add_Action (Table.States (678), 29, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (678), 40, (249, 0), 12);
- Add_Action (Table.States (678), 46, (249, 1), 14);
- Add_Action (Table.States (678), 50, Reduce, (249, 2), 0, null,
null);
- Table.States (678).Goto_List.Set_Capacity (15);
- Add_Goto (Table.States (678), 124, 847);
- Add_Goto (Table.States (678), 130, 41);
- Add_Goto (Table.States (678), 179, 848);
- Add_Goto (Table.States (678), 185, 56);
- Add_Goto (Table.States (678), 196, 849);
- Add_Goto (Table.States (678), 210, 62);
- Add_Goto (Table.States (678), 246, 850);
- Add_Goto (Table.States (678), 249, 851);
- Add_Goto (Table.States (678), 265, 88);
- Add_Goto (Table.States (678), 270, 852);
- Add_Goto (Table.States (678), 271, 853);
- Add_Goto (Table.States (678), 272, 854);
- Add_Goto (Table.States (678), 284, 95);
- Add_Goto (Table.States (678), 310, 855);
- Add_Goto (Table.States (678), 312, 856);
- Table.States (678).Kernel := To_Vector ((0 => ((267, 0), 35, 2,
(2147483647, 0), 0)));
- Table.States (678).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (272, 1), 0)));
- Table.States (679).Action_List.Set_Capacity (1);
- Add_Action (Table.States (679), 35, (274, 0), 857);
- Table.States (679).Kernel := To_Vector ((((274, 0), 125, 6,
(2147483647, 0), 0), ((274, 1), 125, 3,
- (2147483647, 0), 0)));
- Table.States (679).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (274, 0), 35, 857)));
- Table.States (680).Action_List.Set_Capacity (4);
- Add_Action (Table.States (680), 81, (242, 8), 31);
- Add_Action (Table.States (680), 107, (242, 5), 120);
- Add_Action (Table.States (680), 108, (242, 7), 34);
- Add_Action (Table.States (680), 109, (242, 6), 35);
- Table.States (680).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (680), 131, 42);
- Add_Goto (Table.States (680), 230, 858);
- Add_Goto (Table.States (680), 242, 859);
- Add_Goto (Table.States (680), 275, 93);
- Add_Goto (Table.States (680), 296, 98);
- Table.States (680).Kernel := To_Vector ((0 => ((307, 0), 39, 4,
(2147483647, 0), 0)));
- Table.States (680).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (681).Action_List.Set_Capacity (2);
- Add_Action (Table.States (681), 24, (269, 1), 860);
- Add_Action (Table.States (681), 49, (269, 0), 861);
- Table.States (681).Kernel := To_Vector ((((269, 0), 162, 2,
(2147483647, 0), 0), ((269, 1), 162, 1,
- (2147483647, 0), 0)));
- Table.States (682).Action_List.Set_Capacity (1);
- Add_Action (Table.States (682), 99, (307, 1), 862);
- Table.States (682).Kernel := To_Vector ((0 => ((307, 1), 269, 1,
(2147483647, 0), 0)));
- Table.States (682).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (307, 1), 99, 862)));
- Table.States (683).Action_List.Set_Capacity (47);
- Add_Action (Table.States (683), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (279, 0), 5, raise_statement_0'Access, null);
- Table.States (683).Kernel := To_Vector ((0 => ((279, 0), 99, 0,
(279, 0), 5)));
- Table.States (683).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (279, 0), 5)));
- Table.States (684).Action_List.Set_Capacity (47);
- Add_Action (Table.States (684), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (293, 0), 5, requeue_statement_0'Access, null);
- Table.States (684).Kernel := To_Vector ((0 => ((293, 0), 99, 0,
(293, 0), 5)));
- Table.States (684).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (293, 0), 5)));
- Table.States (685).Action_List.Set_Capacity (6);
- Add_Action (Table.States (685), 7, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (685), 40, (244, 0), 756);
- Add_Action (Table.States (685), 81, (242, 8), 31);
- Add_Action (Table.States (685), 107, (242, 5), 120);
- Add_Action (Table.States (685), 108, (242, 7), 34);
- Add_Action (Table.States (685), 109, (242, 6), 35);
- Table.States (685).Goto_List.Set_Capacity (8);
- Add_Goto (Table.States (685), 117, 863);
- Add_Goto (Table.States (685), 131, 42);
- Add_Goto (Table.States (685), 242, 491);
- Add_Goto (Table.States (685), 244, 735);
- Add_Goto (Table.States (685), 275, 93);
- Add_Goto (Table.States (685), 295, 864);
- Add_Goto (Table.States (685), 296, 98);
- Add_Goto (Table.States (685), 317, 865);
- Table.States (685).Kernel := To_Vector ((((197, 0), 157, 2,
(2147483647, 0), 0), ((197, 1), 157, 1,
- (2147483647, 0), 0)));
- Table.States (685).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (686).Action_List.Set_Capacity (1);
- Add_Action (Table.States (686), 58, (199, 0), 866);
- Table.States (686).Kernel := To_Vector ((0 => ((199, 0), 24, 2,
(2147483647, 0), 0)));
- Table.States (686).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (199, 0), 58, 866)));
- Table.States (687).Action_List.Set_Capacity (1);
- Add_Action (Table.States (687), 14, (250, 0), 867);
- Table.States (687).Kernel := To_Vector ((((250, 0), 47, 6,
(2147483647, 0), 0), ((250, 1), 47, 5,
- (2147483647, 0), 0)));
- Table.States (687).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (250, 0), 14, 867)));
- Table.States (688).Action_List.Set_Capacity (1);
- Add_Action (Table.States (688), 14, (267, 0), 868);
- Table.States (688).Kernel := To_Vector ((0 => ((267, 0), 51, 5,
(2147483647, 0), 0)));
- Table.States (688).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (267, 0), 14, 868)));
- Table.States (689).Action_List.Set_Capacity (1);
- Add_Action (Table.States (689), 14, (319, 0), 869);
- Table.States (689).Kernel := To_Vector ((0 => ((319, 0), 66, 6,
(2147483647, 0), 0)));
- Table.States (689).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (319, 0), 14, 869)));
- Table.States (690).Action_List.Set_Capacity (2);
- Add_Action (Table.States (690), 29, (210, 0), 7);
- Add_Action (Table.States (690), 50, (265, 0), 18);
- Table.States (690).Goto_List.Set_Capacity (3);
- Add_Goto (Table.States (690), 210, 62);
- Add_Goto (Table.States (690), 265, 88);
- Add_Goto (Table.States (690), 315, 870);
- Table.States (690).Kernel := To_Vector ((0 => ((310, 0), 249, 6,
(2147483647, 0), 0)));
- Table.States (690).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (265, 0), 50, 18)));
- Table.States (691).Action_List.Set_Capacity (40);
- Add_Action (Table.States (691), (4, 5, 13, 15, 17, 18, 25, 27, 28,
29, 30, 31, 32, 36, 37, 40, 41, 46, 47,
- 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 81,
96, 107, 108, 109, 110), (318, 0), 5,
- subunit_0'Access, null);
- Table.States (691).Kernel := To_Vector ((0 => ((318, 0), 266, 0,
(318, 0), 5)));
- Table.States (691).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (318, 0), 5)));
- Table.States (692).Action_List.Set_Capacity (1);
- Add_Action (Table.States (692), 99, (298, 1), 871);
- Table.States (692).Kernel := To_Vector ((0 => ((298, 1), 67, 1,
(2147483647, 0), 0)));
- Table.States (692).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (298, 1), 99, 871)));
- Table.States (693).Action_List.Set_Capacity (26);
- Add_Action (Table.States (693), 4, (116, 0), 1);
- Add_Action (Table.States (693), 5, (306, 8), 2);
- Add_Action (Table.States (693), 13, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (693), 15, (142, 0), 3);
- Add_Action (Table.States (693), 17, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (693), 18, (164, 0), 4);
- Add_Action (Table.States (693), 22, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (693), 24, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (693), 27, (193, 0), 5);
- Add_Action (Table.States (693), 28, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (693), 31, (306, 3), 9);
- Add_Action (Table.States (693), 32, (225, 0), 10);
- Add_Action (Table.States (693), 37, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (693), 41, (306, 0), 13);
- Add_Action (Table.States (693), 43, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (693), 48, (260, 0), 16);
- Add_Action (Table.States (693), 52, (279, 0), 20);
- Add_Action (Table.States (693), 57, (293, 0), 21);
- Add_Action (Table.States (693), 58, (199, 0), 22);
- Add_Action (Table.States (693), 61, (129, 0), 24);
- Add_Action (Table.States (693), 73, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (693), 81, (242, 8), 31);
- Add_Action (Table.States (693), 96, (220, 0), 32);
- Add_Action (Table.States (693), 107, (134, 0), 363);
- Add_Action (Table.States (693), 108, (242, 7), 34);
- Add_Action (Table.States (693), 109, (242, 6), 35);
- Table.States (693).Goto_List.Set_Capacity (31);
- Add_Goto (Table.States (693), 116, 37);
- Add_Goto (Table.States (693), 126, 39);
- Add_Goto (Table.States (693), 129, 40);
- Add_Goto (Table.States (693), 131, 42);
- Add_Goto (Table.States (693), 134, 43);
- Add_Goto (Table.States (693), 135, 44);
- Add_Goto (Table.States (693), 136, 45);
- Add_Goto (Table.States (693), 142, 48);
- Add_Goto (Table.States (693), 154, 51);
- Add_Goto (Table.States (693), 155, 52);
- Add_Goto (Table.States (693), 164, 54);
- Add_Goto (Table.States (693), 193, 58);
- Add_Goto (Table.States (693), 199, 60);
- Add_Goto (Table.States (693), 220, 69);
- Add_Goto (Table.States (693), 225, 71);
- Add_Goto (Table.States (693), 235, 73);
- Add_Goto (Table.States (693), 242, 74);
- Add_Goto (Table.States (693), 260, 84);
- Add_Goto (Table.States (693), 264, 87);
- Add_Goto (Table.States (693), 275, 93);
- Add_Goto (Table.States (693), 279, 94);
- Add_Goto (Table.States (693), 293, 97);
- Add_Goto (Table.States (693), 296, 98);
- Add_Goto (Table.States (693), 297, 99);
- Add_Goto (Table.States (693), 301, 100);
- Add_Goto (Table.States (693), 302, 364);
- Add_Goto (Table.States (693), 303, 872);
- Add_Goto (Table.States (693), 305, 101);
- Add_Goto (Table.States (693), 306, 102);
- Add_Goto (Table.States (693), 309, 366);
- Add_Goto (Table.States (693), 326, 115);
- Table.States (693).Kernel := To_Vector ((0 => ((298, 0), 116, 0,
(303, 1), 0)));
- Table.States (693).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (303, 1), 0)));
- Table.States (694).Action_List.Set_Capacity (3);
- Add_Action (Table.States (694), (22, 24, 43), (298, 2), 4,
select_alternative_2'Access, null);
- Table.States (694).Kernel := To_Vector ((0 => ((298, 2), 163, 0,
(298, 2), 4)));
- Table.States (694).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (298, 2), 4)));
- Table.States (695).Action_List.Set_Capacity (1);
- Add_Action (Table.States (695), 61, (155, 0), 873);
- Table.States (695).Kernel := To_Vector ((0 => ((155, 0), 24, 2,
(2147483647, 0), 0)));
- Table.States (695).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (155, 0), 61, 873)));
- Table.States (696).Action_List.Set_Capacity (1);
- Add_Action (Table.States (696), 61, (326, 0), 874);
- Table.States (696).Kernel := To_Vector ((0 => ((326, 0), 24, 2,
(2147483647, 0), 0)));
- Table.States (696).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (326, 0), 61, 874)));
- Table.States (697).Action_List.Set_Capacity (3);
- Add_Action (Table.States (697), (22, 24, 43), (163, 0), 2, null,
null);
- Table.States (697).Kernel := To_Vector ((0 => ((163, 0), 303, 0,
(163, 0), 2)));
- Table.States (697).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (163, 0), 2)));
- Table.States (698).Action_List.Set_Capacity (1);
- Add_Action (Table.States (698), 61, (297, 0), 875);
- Table.States (698).Kernel := To_Vector ((0 => ((297, 0), 24, 2,
(2147483647, 0), 0)));
- Table.States (698).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (297, 0), 61, 875)));
- Table.States (699).Action_List.Set_Capacity (47);
- Add_Action (Table.States (699), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (297, 1), 5, selective_accept_1'Access, null);
- Table.States (699).Kernel := To_Vector ((0 => ((297, 1), 99, 0,
(297, 1), 5)));
- Table.States (699).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (297, 1), 5)));
- Table.States (700).Action_List.Set_Capacity (1);
- Add_Action (Table.States (700), 24, (129, 0), 876);
- Table.States (700).Kernel := To_Vector ((0 => ((129, 0), 303, 3,
(2147483647, 0), 0)));
- Table.States (700).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (129, 0), 24, 876)));
- Table.States (701).Action_List.Set_Capacity (1);
- Add_Action (Table.States (701), 99, (316, 0), 877);
- Table.States (701).Kernel := To_Vector ((0 => ((316, 0), 125, 1,
(2147483647, 0), 0)));
- Table.States (701).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (316, 0), 99, 877)));
- Table.States (702).Action_List.Set_Capacity (2);
- Add_Action (Table.States (702), 74, (125, 0), 340);
- Add_Action (Table.States (702), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (702).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (702), 125, 878);
- Table.States (702).Kernel := To_Vector ((0 => ((320, 0), 60, 1,
(2147483647, 0), 0)));
- Table.States (702).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (703).Action_List.Set_Capacity (16);
- Add_Action (Table.States (703), 13, Reduce, (162, 1), 0, null,
null);
- Add_Action (Table.States (703), 25, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (703), 28, (124, 0), 185);
- Add_Action (Table.States (703), 29, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (703), 30, (213, 0), 8);
- Add_Action (Table.States (703), 40, (249, 0), 12);
- Add_Action (Table.States (703), 46, (249, 1), 14);
- Add_Action (Table.States (703), 47, (216, 0), 15);
- Add_Action (Table.States (703), 48, (260, 0), 16);
- Add_Action (Table.States (703), 50, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (703), 51, (267, 0), 19);
- Add_Action (Table.States (703), 63, (316, 0), 25);
- Add_Action (Table.States (703), 66, (308, 0), 26);
- Add_Action (Table.States (703), 69, (209, 0), 27);
- Add_Action (Table.States (703), 71, (334, 0), 28);
- Add_Action (Table.States (703), 107, (222, 1), 187);
- Table.States (703).Goto_List.Set_Capacity (53);
- Add_Goto (Table.States (703), 115, 36);
- Add_Goto (Table.States (703), 124, 38);
- Add_Goto (Table.States (703), 130, 41);
- Add_Goto (Table.States (703), 137, 46);
- Add_Goto (Table.States (703), 138, 47);
- Add_Goto (Table.States (703), 160, 394);
- Add_Goto (Table.States (703), 161, 395);
- Add_Goto (Table.States (703), 162, 879);
- Add_Goto (Table.States (703), 182, 55);
- Add_Goto (Table.States (703), 185, 56);
- Add_Goto (Table.States (703), 189, 57);
- Add_Goto (Table.States (703), 196, 59);
- Add_Goto (Table.States (703), 209, 61);
- Add_Goto (Table.States (703), 210, 62);
- Add_Goto (Table.States (703), 212, 63);
- Add_Goto (Table.States (703), 213, 64);
- Add_Goto (Table.States (703), 216, 65);
- Add_Goto (Table.States (703), 217, 66);
- Add_Goto (Table.States (703), 218, 67);
- Add_Goto (Table.States (703), 219, 68);
- Add_Goto (Table.States (703), 222, 70);
- Add_Goto (Table.States (703), 226, 72);
- Add_Goto (Table.States (703), 246, 75);
- Add_Goto (Table.States (703), 247, 76);
- Add_Goto (Table.States (703), 248, 77);
- Add_Goto (Table.States (703), 249, 78);
- Add_Goto (Table.States (703), 250, 79);
- Add_Goto (Table.States (703), 251, 80);
- Add_Goto (Table.States (703), 252, 81);
- Add_Goto (Table.States (703), 253, 82);
- Add_Goto (Table.States (703), 254, 83);
- Add_Goto (Table.States (703), 260, 397);
- Add_Goto (Table.States (703), 262, 85);
- Add_Goto (Table.States (703), 263, 86);
- Add_Goto (Table.States (703), 265, 88);
- Add_Goto (Table.States (703), 266, 89);
- Add_Goto (Table.States (703), 267, 90);
- Add_Goto (Table.States (703), 268, 91);
- Add_Goto (Table.States (703), 274, 92);
- Add_Goto (Table.States (703), 284, 95);
- Add_Goto (Table.States (703), 292, 96);
- Add_Goto (Table.States (703), 307, 103);
- Add_Goto (Table.States (703), 308, 104);
- Add_Goto (Table.States (703), 310, 106);
- Add_Goto (Table.States (703), 311, 107);
- Add_Goto (Table.States (703), 312, 108);
- Add_Goto (Table.States (703), 314, 109);
- Add_Goto (Table.States (703), 316, 110);
- Add_Goto (Table.States (703), 319, 112);
- Add_Goto (Table.States (703), 320, 113);
- Add_Goto (Table.States (703), 322, 114);
- Add_Goto (Table.States (703), 328, 116);
- Add_Goto (Table.States (703), 334, 117);
- Table.States (703).Kernel := To_Vector ((0 => ((319, 0), 35, 3,
(2147483647, 0), 0)));
- Table.States (703).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (162, 1), 0)));
- Table.States (704).Action_List.Set_Capacity (2);
- Add_Action (Table.States (704), 35, (322, 0), 880);
- Add_Action (Table.States (704), 99, (322, 2), 881);
- Table.States (704).Kernel := To_Vector ((((322, 0), 125, 6,
(2147483647, 0), 0), ((322, 1), 125, 3,
- (2147483647, 0), 0), ((322, 2), 125, 1, (2147483647, 0), 0)));
- Table.States (704).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (322, 2), 99, 881)));
- Table.States (705).Action_List.Set_Capacity (4);
- Add_Action (Table.States (705), 81, (242, 8), 31);
- Add_Action (Table.States (705), 107, (242, 5), 120);
- Add_Action (Table.States (705), 108, (242, 7), 34);
- Add_Action (Table.States (705), 109, (242, 6), 35);
- Table.States (705).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (705), 131, 42);
- Add_Goto (Table.States (705), 230, 882);
- Add_Goto (Table.States (705), 242, 859);
- Add_Goto (Table.States (705), 275, 93);
- Add_Goto (Table.States (705), 296, 98);
- Table.States (705).Kernel := To_Vector ((0 => ((308, 0), 39, 4,
(2147483647, 0), 0)));
- Table.States (705).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (706).Action_List.Set_Capacity (2);
- Add_Action (Table.States (706), 24, Reduce, (321, 1), 1,
task_definition_1'Access, null);
- Add_Action (Table.States (706), 49, (321, 0), 883);
- Table.States (706).Kernel := To_Vector ((((321, 0), 162, 1,
(2147483647, 0), 0), ((321, 1), 162, 0,
- (321, 1), 1)));
- Table.States (706).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (321, 1), 1)));
- Table.States (707).Action_List.Set_Capacity (1);
- Add_Action (Table.States (707), 24, (308, 1), 884);
- Table.States (707).Kernel := To_Vector ((0 => ((308, 1), 321, 2,
(2147483647, 0), 0)));
- Table.States (707).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (308, 1), 24, 884)));
- Table.States (708).Action_List.Set_Capacity (3);
- Add_Action (Table.States (708), (35, 74, 99), (172, 0), 3, null,
null);
- Table.States (708).Kernel := To_Vector ((0 => ((172, 0), 78, 0,
(172, 0), 3)));
- Table.States (708).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (172, 0), 3)));
- Table.States (709).Action_List.Set_Capacity (3);
- Add_Action (Table.States (709), (35, 74, 99), (172, 1), 3,
discriminant_part_opt_1'Access, null);
- Table.States (709).Kernel := To_Vector ((0 => ((172, 1), 78, 0,
(172, 1), 3)));
- Table.States (709).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (172, 1), 3)));
- Table.States (710).Action_List.Set_Capacity (3);
- Add_Action (Table.States (710), 78, Reduce, (173, 4), 0, null,
null);
- Add_Action (Table.States (710), 99, Reduce, (173, 4), 0, null,
null);
- Add_Action (Table.States (710), 107, (222, 1), 166);
- Table.States (710).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (710), 173, 885);
- Add_Goto (Table.States (710), 222, 555);
- Table.States (710).Kernel := To_Vector ((0 => ((174, 0), 99, 0,
(173, 4), 0)));
- Table.States (710).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (173, 4), 0)));
- Table.States (711).Action_List.Set_Capacity (6);
- Add_Action (Table.States (711), 7, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (711), 40, (244, 0), 886);
- Add_Action (Table.States (711), 81, (242, 8), 31);
- Add_Action (Table.States (711), 107, (242, 5), 887);
- Add_Action (Table.States (711), 108, (242, 7), 34);
- Add_Action (Table.States (711), 109, (242, 6), 35);
- Table.States (711).Goto_List.Set_Capacity (7);
- Add_Goto (Table.States (711), 117, 888);
- Add_Goto (Table.States (711), 131, 42);
- Add_Goto (Table.States (711), 242, 889);
- Add_Goto (Table.States (711), 244, 735);
- Add_Goto (Table.States (711), 245, 890);
- Add_Goto (Table.States (711), 275, 93);
- Add_Goto (Table.States (711), 296, 891);
- Table.States (711).Kernel := To_Vector ((((173, 0), 84, 2,
(2147483647, 0), 0), ((173, 1), 84, 3,
- (2147483647, 0), 0), ((173, 2), 84, 1, (2147483647, 0), 0),
((173, 3), 84, 2, (2147483647, 0), 0)));
- Table.States (711).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 887)));
- Table.States (712).Action_List.Set_Capacity (4);
- Add_Action (Table.States (712), 36, (112, 0), 892);
- Add_Action (Table.States (712), 39, Reduce, (112, 2), 1, null,
null);
- Add_Conflict (Table.States (712), 39, (113, 2), 1, null, null);
- Add_Action (Table.States (712), 64, (112, 1), 893);
- Add_Action (Table.States (712), 65, (114, 0), 894);
- Table.States (712).Kernel := To_Vector ((((112, 0), 6, 1,
(2147483647, 0), 0), ((112, 1), 6, 1,
- (2147483647, 0), 0), ((112, 2), 6, 0, (112, 2), 1), ((113, 0),
6, 1, (2147483647, 0), 0), ((113, 2),
- 6, 0, (113, 2), 1), ((114, 0), 6, 2, (2147483647, 0), 0),
((114, 1), 6, 1, (2147483647, 0), 0)));
- Table.States (712).Minimal_Complete_Actions := To_Vector (((Shift,
(112, 0), 36, 892), (Shift, (112, 1),
- 64, 893), (Reduce, (112, 2), 1), (Reduce, (113, 2), 1), (Shift,
(114, 0), 65, 894)));
- Table.States (713).Action_List.Set_Capacity (1);
- Add_Action (Table.States (713), 76, (123, 0), 895);
- Table.States (713).Kernel := To_Vector ((((123, 0), 11, 7,
(2147483647, 0), 0), ((123, 1), 11, 7,
- (2147483647, 0), 0)));
- Table.States (713).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (123, 0), 76, 895)));
- Table.States (714).Action_List.Set_Capacity (18);
- Add_Action (Table.States (714), 3, (200, 2), 122);
- Add_Action (Table.States (714), 20, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (714), 39, (261, 4), 123);
- Add_Action (Table.States (714), 40, (200, 3), 124);
- Add_Action (Table.States (714), 41, (261, 1), 125);
- Add_Action (Table.States (714), 52, (278, 0), 126);
- Add_Action (Table.States (714), 53, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (714), 74, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (714), 76, (120, 0), 127);
- Add_Action (Table.States (714), 77, (120, 5), 128);
- Add_Action (Table.States (714), 81, (242, 8), 31);
- Add_Action (Table.States (714), 97, (333, 1), 129);
- Add_Action (Table.States (714), 98, (333, 0), 130);
- Add_Action (Table.States (714), 99, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (714), 106, (261, 0), 131);
- Add_Action (Table.States (714), 107, (242, 5), 120);
- Add_Action (Table.States (714), 108, (242, 7), 34);
- Add_Action (Table.States (714), 109, (242, 6), 35);
- Table.States (714).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (714), 120, 132);
- Add_Goto (Table.States (714), 131, 42);
- Add_Goto (Table.States (714), 194, 133);
- Add_Goto (Table.States (714), 195, 896);
- Add_Goto (Table.States (714), 200, 135);
- Add_Goto (Table.States (714), 242, 136);
- Add_Goto (Table.States (714), 261, 137);
- Add_Goto (Table.States (714), 275, 93);
- Add_Goto (Table.States (714), 278, 138);
- Add_Goto (Table.States (714), 285, 139);
- Add_Goto (Table.States (714), 286, 140);
- Add_Goto (Table.States (714), 287, 141);
- Add_Goto (Table.States (714), 288, 142);
- Add_Goto (Table.States (714), 289, 143);
- Add_Goto (Table.States (714), 290, 144);
- Add_Goto (Table.States (714), 296, 98);
- Add_Goto (Table.States (714), 304, 145);
- Add_Goto (Table.States (714), 323, 146);
- Add_Goto (Table.States (714), 324, 147);
- Add_Goto (Table.States (714), 333, 148);
- Table.States (714).Kernel := To_Vector ((((329, 4), 19, 1,
(2147483647, 0), 0), ((329, 5), 19, 0,
- (195, 1), 0)));
- Table.States (714).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (715).Action_List.Set_Capacity (17);
- Add_Action (Table.States (715), 3, (200, 2), 122);
- Add_Action (Table.States (715), 39, (261, 4), 123);
- Add_Action (Table.States (715), 40, (200, 3), 124);
- Add_Action (Table.States (715), 41, (261, 1), 125);
- Add_Action (Table.States (715), 52, (278, 0), 126);
- Add_Action (Table.States (715), 53, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (715), 74, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (715), 76, (120, 0), 127);
- Add_Action (Table.States (715), 77, (120, 5), 128);
- Add_Action (Table.States (715), 81, (242, 8), 31);
- Add_Action (Table.States (715), 97, (333, 1), 129);
- Add_Action (Table.States (715), 98, (333, 0), 130);
- Add_Action (Table.States (715), 99, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (715), 106, (261, 0), 131);
- Add_Action (Table.States (715), 107, (242, 5), 120);
- Add_Action (Table.States (715), 108, (242, 7), 34);
- Add_Action (Table.States (715), 109, (242, 6), 35);
- Table.States (715).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (715), 120, 132);
- Add_Goto (Table.States (715), 131, 42);
- Add_Goto (Table.States (715), 194, 133);
- Add_Goto (Table.States (715), 195, 897);
- Add_Goto (Table.States (715), 200, 135);
- Add_Goto (Table.States (715), 242, 136);
- Add_Goto (Table.States (715), 261, 137);
- Add_Goto (Table.States (715), 275, 93);
- Add_Goto (Table.States (715), 278, 138);
- Add_Goto (Table.States (715), 285, 139);
- Add_Goto (Table.States (715), 286, 140);
- Add_Goto (Table.States (715), 287, 141);
- Add_Goto (Table.States (715), 288, 142);
- Add_Goto (Table.States (715), 289, 143);
- Add_Goto (Table.States (715), 290, 144);
- Add_Goto (Table.States (715), 296, 98);
- Add_Goto (Table.States (715), 304, 145);
- Add_Goto (Table.States (715), 323, 146);
- Add_Goto (Table.States (715), 324, 147);
- Add_Goto (Table.States (715), 333, 148);
- Table.States (715).Kernel := To_Vector ((0 => ((329, 3), 20, 0,
(195, 1), 0)));
- Table.States (715).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (716).Action_List.Set_Capacity (2);
- Add_Action (Table.States (716), (74, 99), (231, 8), 1, null,
null);
- Table.States (716).Kernel := To_Vector ((0 => ((231, 8), 34, 0,
(231, 8), 1)));
- Table.States (716).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (231, 8), 1)));
- Table.States (717).Action_List.Set_Capacity (5);
- Add_Action (Table.States (717), 34, (231, 0), 898);
- Add_Action (Table.States (717), 39, Reduce, (112, 3), 1, null,
null);
- Add_Conflict (Table.States (717), 39, (113, 1), 1, null, null);
- Add_Action (Table.States (717), 41, Reduce, (114, 4), 1, null,
null);
- Add_Action (Table.States (717), 49, Reduce, (114, 4), 1, null,
null);
- Add_Action (Table.States (717), 54, Reduce, (114, 4), 1, null,
null);
- Table.States (717).Kernel := To_Vector ((((112, 3), 36, 0, (112,
3), 1), ((113, 1), 36, 0, (113, 1),
- 1), ((114, 4), 36, 0, (114, 4), 1), ((231, 0), 36, 3,
(2147483647, 0), 0), ((231, 4), 36, 1,
- (2147483647, 0), 0)));
- Table.States (717).Minimal_Complete_Actions := To_Vector
(((Reduce, (112, 3), 1), (Reduce, (113, 1), 1),
- (Reduce, (114, 4), 1), (Shift, (231, 0), 34, 898)));
- Table.States (718).Action_List.Set_Capacity (16);
- Add_Action (Table.States (718), 3, (200, 2), 122);
- Add_Action (Table.States (718), 39, (261, 4), 123);
- Add_Action (Table.States (718), 40, (200, 3), 124);
- Add_Action (Table.States (718), 41, (261, 1), 125);
- Add_Action (Table.States (718), 52, (278, 0), 126);
- Add_Action (Table.States (718), 74, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (718), 76, (120, 0), 127);
- Add_Action (Table.States (718), 77, (120, 5), 128);
- Add_Action (Table.States (718), 81, (242, 8), 31);
- Add_Action (Table.States (718), 97, (333, 1), 129);
- Add_Action (Table.States (718), 98, (333, 0), 130);
- Add_Action (Table.States (718), 99, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (718), 106, (261, 0), 131);
- Add_Action (Table.States (718), 107, (242, 5), 120);
- Add_Action (Table.States (718), 108, (242, 7), 34);
- Add_Action (Table.States (718), 109, (242, 6), 35);
- Table.States (718).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (718), 120, 132);
- Add_Goto (Table.States (718), 131, 42);
- Add_Goto (Table.States (718), 194, 133);
- Add_Goto (Table.States (718), 195, 899);
- Add_Goto (Table.States (718), 200, 135);
- Add_Goto (Table.States (718), 242, 136);
- Add_Goto (Table.States (718), 261, 137);
- Add_Goto (Table.States (718), 275, 93);
- Add_Goto (Table.States (718), 278, 138);
- Add_Goto (Table.States (718), 285, 139);
- Add_Goto (Table.States (718), 286, 140);
- Add_Goto (Table.States (718), 287, 141);
- Add_Goto (Table.States (718), 288, 142);
- Add_Goto (Table.States (718), 289, 143);
- Add_Goto (Table.States (718), 290, 144);
- Add_Goto (Table.States (718), 296, 98);
- Add_Goto (Table.States (718), 304, 145);
- Add_Goto (Table.States (718), 323, 146);
- Add_Goto (Table.States (718), 324, 147);
- Add_Goto (Table.States (718), 333, 148);
- Table.States (718).Kernel := To_Vector ((0 => ((329, 2), 38, 0,
(195, 1), 0)));
- Table.States (718).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (719).Action_List.Set_Capacity (1);
- Add_Action (Table.States (719), 54, (283, 1), 900);
- Table.States (719).Kernel := To_Vector ((0 => ((283, 1), 41, 1,
(2147483647, 0), 0)));
- Table.States (719).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (283, 1), 54, 900)));
- Table.States (720).Action_List.Set_Capacity (1);
- Add_Action (Table.States (720), 34, (231, 2), 901);
- Table.States (720).Kernel := To_Vector ((((231, 2), 51, 3,
(2147483647, 0), 0), ((231, 6), 51, 1,
- (2147483647, 0), 0)));
- Table.States (720).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (231, 2), 34, 901)));
- Table.States (721).Action_List.Set_Capacity (13);
- Add_Action (Table.States (721), 3, (200, 2), 122);
- Add_Action (Table.States (721), 39, (261, 4), 123);
- Add_Action (Table.States (721), 40, (200, 3), 124);
- Add_Action (Table.States (721), 41, (261, 1), 125);
- Add_Action (Table.States (721), 76, (120, 0), 127);
- Add_Action (Table.States (721), 77, (120, 5), 128);
- Add_Action (Table.States (721), 81, (242, 8), 31);
- Add_Action (Table.States (721), 97, (333, 1), 129);
- Add_Action (Table.States (721), 98, (333, 0), 130);
- Add_Action (Table.States (721), 106, (261, 0), 131);
- Add_Action (Table.States (721), 107, (242, 5), 120);
- Add_Action (Table.States (721), 108, (242, 7), 34);
- Add_Action (Table.States (721), 109, (242, 6), 35);
- Table.States (721).Goto_List.Set_Capacity (11);
- Add_Goto (Table.States (721), 120, 132);
- Add_Goto (Table.States (721), 131, 42);
- Add_Goto (Table.States (721), 200, 135);
- Add_Goto (Table.States (721), 242, 136);
- Add_Goto (Table.States (721), 261, 137);
- Add_Goto (Table.States (721), 275, 93);
- Add_Goto (Table.States (721), 296, 98);
- Add_Goto (Table.States (721), 304, 902);
- Add_Goto (Table.States (721), 323, 146);
- Add_Goto (Table.States (721), 324, 147);
- Add_Goto (Table.States (721), 333, 148);
- Table.States (721).Kernel := To_Vector ((0 => ((329, 1), 53, 3,
(2147483647, 0), 0)));
- Table.States (721).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (722).Action_List.Set_Capacity (5);
- Add_Action (Table.States (722), 15, (330, 0), 903);
- Add_Action (Table.States (722), 24, Reduce, (153, 1), 0, null,
null);
- Add_Action (Table.States (722), 28, (124, 0), 185);
- Add_Action (Table.States (722), 41, (152, 4), 904);
- Add_Action (Table.States (722), 107, (222, 1), 166);
- Table.States (722).Goto_List.Set_Capacity (10);
- Add_Goto (Table.States (722), 124, 905);
- Add_Goto (Table.States (722), 130, 41);
- Add_Goto (Table.States (722), 149, 906);
- Add_Goto (Table.States (722), 151, 907);
- Add_Goto (Table.States (722), 152, 908);
- Add_Goto (Table.States (722), 153, 909);
- Add_Goto (Table.States (722), 185, 56);
- Add_Goto (Table.States (722), 222, 910);
- Add_Goto (Table.States (722), 284, 95);
- Add_Goto (Table.States (722), 330, 911);
- Table.States (722).Kernel := To_Vector ((0 => ((283, 0), 54, 2,
(2147483647, 0), 0)));
- Table.States (722).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (153, 1), 0)));
- Table.States (723).Action_List.Set_Capacity (2);
- Add_Action (Table.States (723), 34, (231, 3), 912);
- Add_Action (Table.States (723), 39, Reduce, (112, 4), 1, null,
null);
- Table.States (723).Kernel := To_Vector ((((112, 4), 64, 0, (112,
4), 1), ((231, 3), 64, 3,
- (2147483647, 0), 0), ((231, 7), 64, 1, (2147483647, 0), 0)));
- Table.States (723).Minimal_Complete_Actions := To_Vector
(((Reduce, (112, 4), 1), (Shift, (231, 3), 34,
- 912)));
- Table.States (724).Action_List.Set_Capacity (5);
- Add_Action (Table.States (724), 36, (114, 2), 913);
- Add_Action (Table.States (724), 41, Reduce, (114, 3), 1, null,
null);
- Add_Action (Table.States (724), 49, Reduce, (114, 3), 1, null,
null);
- Add_Action (Table.States (724), 54, Reduce, (114, 3), 1, null,
null);
- Add_Action (Table.States (724), 99, (226, 0), 914);
- Table.States (724).Kernel := To_Vector ((((114, 2), 65, 1,
(2147483647, 0), 0), ((114, 3), 65, 0,
- (114, 3), 1), ((226, 0), 65, 1, (2147483647, 0), 0)));
- Table.States (724).Minimal_Complete_Actions := To_Vector (((Shift,
(114, 2), 36, 913), (Reduce, (114, 3),
- 1), (Shift, (226, 0), 99, 914)));
- Table.States (725).Action_List.Set_Capacity (1);
- Add_Action (Table.States (725), 34, (231, 1), 915);
- Table.States (725).Kernel := To_Vector ((((231, 1), 66, 3,
(2147483647, 0), 0), ((231, 5), 66, 1,
- (2147483647, 0), 0)));
- Table.States (725).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (231, 1), 34, 915)));
- Table.States (726).Action_List.Set_Capacity (2);
- Add_Action (Table.States (726), 107, (183, 0), 916);
- Add_Action (Table.States (726), 109, (183, 1), 917);
- Table.States (726).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (726), 183, 918);
- Add_Goto (Table.States (726), 184, 919);
- Table.States (726).Kernel := To_Vector ((0 => ((186, 0), 76, 2,
(2147483647, 0), 0)));
- Table.States (726).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (183, 0), 107, 916)));
- Table.States (727).Action_List.Set_Capacity (1);
- Add_Action (Table.States (727), 39, (262, 0), 920);
- Table.States (727).Kernel := To_Vector ((0 => ((262, 0), 112, 5,
(2147483647, 0), 0)));
- Table.States (727).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (262, 0), 39, 920)));
- Table.States (728).Action_List.Set_Capacity (1);
- Add_Action (Table.States (728), 39, (165, 0), 921);
- Table.States (728).Kernel := To_Vector ((((165, 0), 113, 5,
(2147483647, 0), 0), ((165, 1), 113, 2,
- (2147483647, 0), 0)));
- Table.States (728).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (165, 0), 39, 921)));
- Table.States (729).Action_List.Set_Capacity (3);
- Add_Action (Table.States (729), 41, (283, 1), 719);
- Add_Action (Table.States (729), 49, (263, 0), 922);
- Add_Action (Table.States (729), 54, (283, 0), 722);
- Table.States (729).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (729), 283, 923);
- Table.States (729).Kernel := To_Vector ((((263, 0), 114, 2,
(2147483647, 0), 0), ((329, 7), 114, 2,
- (2147483647, 0), 0)));
- Table.States (729).Minimal_Complete_Actions := To_Vector (((Shift,
(263, 0), 49, 922), (Shift, (283, 1),
- 41, 719)));
- Table.States (730).Action_List.Set_Capacity (2);
- Add_Action (Table.States (730), (74, 99), (329, 8), 1, null,
null);
- Table.States (730).Kernel := To_Vector ((0 => ((329, 8), 117, 0,
(329, 8), 1)));
- Table.States (730).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (329, 8), 1)));
- Table.States (731).Action_List.Set_Capacity (2);
- Add_Action (Table.States (731), (74, 99), (329, 6), 1, null,
null);
- Table.States (731).Kernel := To_Vector ((0 => ((329, 6), 123, 0,
(329, 6), 1)));
- Table.States (731).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (329, 6), 1)));
- Table.States (732).Action_List.Set_Capacity (2);
- Add_Action (Table.States (732), (74, 99), (329, 9), 1, null,
null);
- Table.States (732).Kernel := To_Vector ((0 => ((329, 9), 165, 0,
(329, 9), 1)));
- Table.States (732).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (329, 9), 1)));
- end Subr_14;
- procedure Subr_15
- is begin
- Table.States (733).Action_List.Set_Capacity (2);
- Add_Action (Table.States (733), (74, 99), (329, 0), 1, null,
null);
- Table.States (733).Kernel := To_Vector ((0 => ((329, 0), 186, 0,
(329, 0), 1)));
- Table.States (733).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (329, 0), 1)));
- Table.States (734).Action_List.Set_Capacity (2);
- Add_Action (Table.States (734), (74, 99), (329, 10), 1, null,
null);
- Table.States (734).Kernel := To_Vector ((0 => ((329, 10), 231,
0, (329, 10), 1)));
- Table.States (734).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (329, 10), 1)));
- Table.States (735).Action_List.Set_Capacity (1);
- Add_Action (Table.States (735), 7, (117, 0), 564);
- Table.States (735).Kernel := To_Vector ((((117, 0), 244, 2,
(2147483647, 0), 0), ((117, 1), 244, 3,
- (2147483647, 0), 0), ((117, 2), 244, 2, (2147483647, 0), 0)));
- Table.States (735).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (117, 0), 7, 564)));
- Table.States (736).Action_List.Set_Capacity (2);
- Add_Action (Table.States (736), 74, (125, 0), 340);
- Add_Action (Table.States (736), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (736).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (736), 125, 924);
- Table.States (736).Kernel := To_Vector ((0 => ((209, 0), 329, 1,
(2147483647, 0), 0)));
- Table.States (736).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (737).Action_List.Set_Capacity (41);
- Add_Action (Table.States (737), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (334, 0), 5,
- use_clause_0'Access, null);
- Table.States (737).Kernel := To_Vector ((0 => ((334, 0), 99, 0,
(334, 0), 5)));
- Table.States (737).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (334, 0), 5)));
- Table.States (738).Action_List.Set_Capacity (6);
- Add_Action (Table.States (738), 74, (125, 0), 340);
- Add_Action (Table.States (738), 76, (118, 0), 237);
- Add_Action (Table.States (738), 87, (296, 0), 239);
- Add_Action (Table.States (738), 99, Reduce, (125, 1), 0, null,
null);
- Add_Action (Table.States (738), 104, (325, 0), 241);
- Add_Action (Table.States (738), 105, (325, 1), 242);
- Table.States (738).Goto_List.Set_Capacity (3);
- Add_Goto (Table.States (738), 118, 243);
- Add_Goto (Table.States (738), 125, 925);
- Add_Goto (Table.States (738), 325, 244);
- Table.States (738).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((242, 0), 242, 5,
- (2147483647, 0), 0), ((242, 1), 242, 2, (2147483647, 0), 0),
((248, 2), 242, 1, (2147483647, 0), 0),
- ((275, 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (738).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (739).Action_List.Set_Capacity (6);
- Add_Action (Table.States (739), 74, (125, 0), 340);
- Add_Action (Table.States (739), 76, (118, 0), 237);
- Add_Action (Table.States (739), 87, (296, 0), 239);
- Add_Action (Table.States (739), 99, Reduce, (125, 1), 0, null,
null);
- Add_Action (Table.States (739), 104, (325, 0), 241);
- Add_Action (Table.States (739), 105, (325, 1), 242);
- Table.States (739).Goto_List.Set_Capacity (3);
- Add_Goto (Table.States (739), 118, 243);
- Add_Goto (Table.States (739), 125, 926);
- Add_Goto (Table.States (739), 325, 244);
- Table.States (739).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((242, 0), 242, 5,
- (2147483647, 0), 0), ((242, 1), 242, 2, (2147483647, 0), 0),
((248, 1), 242, 1, (2147483647, 0), 0),
- ((275, 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (739).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (740).Action_List.Set_Capacity (4);
- Add_Action (Table.States (740), (81, 107, 108, 109), (211, 0), 1,
null, null);
- Table.States (740).Kernel := To_Vector ((0 => ((211, 0), 9, 0,
(211, 0), 1)));
- Table.States (740).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (211, 0), 1)));
- Table.States (741).Action_List.Set_Capacity (4);
- Add_Action (Table.States (741), (81, 107, 108, 109), (211, 1), 1,
null, null);
- Table.States (741).Kernel := To_Vector ((0 => ((211, 1), 16, 0,
(211, 1), 1)));
- Table.States (741).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (211, 1), 1)));
- Table.States (742).Action_List.Set_Capacity (2);
- Add_Action (Table.States (742), (29, 50), (273, 0), 1, null,
null);
- Table.States (742).Kernel := To_Vector ((0 => ((273, 0), 51, 0,
(273, 0), 1)));
- Table.States (742).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (273, 0), 1)));
- Table.States (743).Action_List.Set_Capacity (4);
- Add_Action (Table.States (743), 81, (242, 8), 31);
- Add_Action (Table.States (743), 107, (242, 5), 120);
- Add_Action (Table.States (743), 108, (242, 7), 34);
- Add_Action (Table.States (743), 109, (242, 6), 35);
- Table.States (743).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (743), 131, 42);
- Add_Goto (Table.States (743), 242, 927);
- Add_Goto (Table.States (743), 275, 93);
- Add_Goto (Table.States (743), 296, 98);
- Table.States (743).Kernel := To_Vector ((0 => ((117, 2), 211, 1,
(2147483647, 0), 0)));
- Table.States (743).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (744).Action_List.Set_Capacity (2);
- Add_Action (Table.States (744), 29, (117, 1), 928);
- Add_Action (Table.States (744), 50, (117, 0), 929);
- Table.States (744).Kernel := To_Vector ((((117, 0), 273, 1,
(2147483647, 0), 0), ((117, 1), 273, 2,
- (2147483647, 0), 0)));
- Table.States (744).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (117, 0), 50, 929)));
- Table.States (745).Action_List.Set_Capacity (4);
- Add_Action (Table.States (745), 81, (242, 8), 31);
- Add_Action (Table.States (745), 107, (242, 5), 120);
- Add_Action (Table.States (745), 108, (242, 7), 34);
- Add_Action (Table.States (745), 109, (242, 6), 35);
- Table.States (745).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (745), 131, 42);
- Add_Goto (Table.States (745), 242, 930);
- Add_Goto (Table.States (745), 275, 93);
- Add_Goto (Table.States (745), 296, 98);
- Table.States (745).Kernel := To_Vector ((0 => ((248, 0), 56, 2,
(2147483647, 0), 0)));
- Table.States (745).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (746).Action_List.Set_Capacity (1);
- Add_Action (Table.States (746), 99, (136, 1), 931);
- Table.States (746).Kernel := To_Vector ((0 => ((136, 1), 223, 1,
(2147483647, 0), 0)));
- Table.States (746).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (136, 1), 99, 931)));
- Table.States (747).Action_List.Set_Capacity (5);
- Add_Action (Table.States (747), 44, (187, 1), 932);
- Add_Action (Table.States (747), 81, (242, 8), 31);
- Add_Action (Table.States (747), 107, (190, 0), 933);
- Add_Action (Table.States (747), 108, (242, 7), 34);
- Add_Action (Table.States (747), 109, (242, 6), 35);
- Table.States (747).Goto_List.Set_Capacity (6);
- Add_Goto (Table.States (747), 131, 42);
- Add_Goto (Table.States (747), 187, 934);
- Add_Goto (Table.States (747), 188, 935);
- Add_Goto (Table.States (747), 242, 936);
- Add_Goto (Table.States (747), 275, 93);
- Add_Goto (Table.States (747), 296, 98);
- Table.States (747).Kernel := To_Vector ((((190, 0), 72, 4,
(2147483647, 0), 0), ((190, 1), 72, 2,
- (2147483647, 0), 0)));
- Table.States (747).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (190, 0), 107, 933)));
- Table.States (748).Action_List.Set_Capacity (2);
- Add_Action (Table.States (748), (24, 72), (191, 1), 1, null,
null);
- Table.States (748).Kernel := To_Vector ((0 => ((191, 1), 190, 0,
(191, 1), 1)));
- Table.States (748).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (191, 1), 1)));
- Table.States (749).Action_List.Set_Capacity (2);
- Add_Action (Table.States (749), 24, Reduce, (192, 0), 1, null,
null);
- Add_Action (Table.States (749), 72, (190, 0), 747);
- Table.States (749).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (749), 190, 937);
- Table.States (749).Kernel := To_Vector ((((191, 0), 191, 3,
(2147483647, 0), 0), ((192, 0), 191, 0,
- (192, 0), 1)));
- Table.States (749).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (192, 0), 1)));
- Table.States (750).Action_List.Set_Capacity (1);
- Add_Action (Table.States (750), (1 => 24), (221, 0), 3,
handled_sequence_of_statements_0'Access, null);
- Table.States (750).Kernel := To_Vector ((0 => ((221, 0), 192, 0,
(221, 0), 3)));
- Table.States (750).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (221, 0), 3)));
- Table.States (751).Action_List.Set_Capacity (2);
- Add_Action (Table.States (751), (24, 72), (191, 2), 1, null,
null);
- Table.States (751).Kernel := To_Vector ((0 => ((191, 2), 260, 0,
(191, 2), 1)));
- Table.States (751).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (191, 2), 1)));
- Table.States (752).Action_List.Set_Capacity (1);
- Add_Action (Table.States (752), 24, (136, 0), 938);
- Table.States (752).Kernel := To_Vector ((0 => ((136, 0), 221, 2,
(2147483647, 0), 0)));
- Table.States (752).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (136, 0), 24, 938)));
- Table.States (753).Action_List.Set_Capacity (2);
- Add_Action (Table.States (753), 99, Reduce, (223, 1), 0, null,
null);
- Add_Action (Table.States (753), 107, (223, 0), 151);
- Table.States (753).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (753), 223, 939);
- Table.States (753).Kernel := To_Vector ((0 => ((235, 1), 37, 1,
(2147483647, 0), 0)));
- Table.States (753).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (223, 1), 0)));
- Table.States (754).Action_List.Set_Capacity (1);
- Add_Action (Table.States (754), 37, (235, 0), 940);
- Table.States (754).Kernel := To_Vector ((0 => ((235, 0), 24, 2,
(2147483647, 0), 0)));
- Table.States (754).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (235, 0), 37, 940)));
- Table.States (755).Action_List.Set_Capacity (1);
- Add_Action (Table.States (755), 99, (160, 9), 941);
- Table.States (755).Kernel := To_Vector ((0 => ((160, 9), 195, 1,
(2147483647, 0), 0)));
- Table.States (755).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (160, 9), 99, 941)));
- Table.States (756).Action_List.Set_Capacity (1);
- Add_Action (Table.States (756), 41, (244, 0), 942);
- Table.States (756).Kernel := To_Vector ((((244, 0), 40, 1,
(2147483647, 0), 0), ((317, 0), 40, 6,
- (2147483647, 0), 0), ((317, 1), 40, 2, (2147483647, 0), 0)));
- Table.States (756).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (244, 0), 41, 942)));
- Table.States (757).Action_List.Set_Capacity (3);
- Add_Action (Table.States (757), 74, (125, 0), 340);
- Add_Action (Table.States (757), 85, (247, 1), 943);
- Add_Action (Table.States (757), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (757).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (757), 125, 944);
- Table.States (757).Kernel := To_Vector ((((247, 1), 117, 2,
(2147483647, 0), 0), ((247, 4), 117, 1,
- (2147483647, 0), 0)));
- Table.States (757).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (758).Action_List.Set_Capacity (3);
- Add_Action (Table.States (758), 74, (125, 0), 340);
- Add_Action (Table.States (758), 85, (247, 2), 945);
- Add_Action (Table.States (758), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (758).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (758), 125, 946);
- Table.States (758).Kernel := To_Vector ((((247, 2), 123, 2,
(2147483647, 0), 0), ((247, 5), 123, 1,
- (2147483647, 0), 0)));
- Table.States (758).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (759).Action_List.Set_Capacity (3);
- Add_Action (Table.States (759), 74, (125, 0), 340);
- Add_Action (Table.States (759), 85, (247, 0), 947);
- Add_Action (Table.States (759), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (759).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (759), 125, 948);
- Table.States (759).Kernel := To_Vector ((((247, 0), 317, 2,
(2147483647, 0), 0), ((247, 3), 317, 1,
- (2147483647, 0), 0)));
- Table.States (759).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (760).Action_List.Set_Capacity (2);
- Add_Action (Table.States (760), (78, 86), (281, 0), 3, null,
null);
- Table.States (760).Kernel := To_Vector ((0 => ((281, 0), 280, 0,
(281, 0), 3)));
- Table.States (760).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (281, 0), 3)));
- Table.States (761).Action_List.Set_Capacity (1);
- Add_Action (Table.States (761), 78, (132, 0), 949);
- Table.States (761).Kernel := To_Vector ((0 => ((132, 0), 194, 1,
(2147483647, 0), 0)));
- Table.States (761).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (132, 0), 78, 949)));
- Table.States (762).Action_List.Set_Capacity (1);
- Add_Action (Table.States (762), 78, (182, 0), 950);
- Table.States (762).Kernel := To_Vector ((0 => ((182, 0), 170, 2,
(2147483647, 0), 0)));
- Table.States (762).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (182, 0), 78, 950)));
- Table.States (763).Action_List.Set_Capacity (1);
- Add_Action (Table.States (763), 99, (182, 1), 951);
- Table.States (763).Kernel := To_Vector ((0 => ((182, 1), 125, 1,
(2147483647, 0), 0)));
- Table.States (763).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (182, 1), 99, 951)));
- Table.States (764).Action_List.Set_Capacity (4);
- Add_Action (Table.States (764), 81, (242, 8), 31);
- Add_Action (Table.States (764), 107, (242, 5), 120);
- Add_Action (Table.States (764), 108, (242, 7), 34);
- Add_Action (Table.States (764), 109, (242, 6), 35);
- Table.States (764).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (764), 131, 42);
- Add_Goto (Table.States (764), 242, 952);
- Add_Goto (Table.States (764), 275, 93);
- Add_Goto (Table.States (764), 296, 98);
- Table.States (764).Kernel := To_Vector ((0 => ((216, 2), 39, 2,
(2147483647, 0), 0)));
- Table.States (764).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (765).Action_List.Set_Capacity (4);
- Add_Action (Table.States (765), 81, (242, 8), 31);
- Add_Action (Table.States (765), 107, (242, 5), 120);
- Add_Action (Table.States (765), 108, (242, 7), 34);
- Add_Action (Table.States (765), 109, (242, 6), 35);
- Table.States (765).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (765), 131, 42);
- Add_Goto (Table.States (765), 242, 953);
- Add_Goto (Table.States (765), 275, 93);
- Add_Goto (Table.States (765), 296, 98);
- Table.States (765).Kernel := To_Vector ((0 => ((216, 1), 39, 2,
(2147483647, 0), 0)));
- Table.States (765).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (766).Action_List.Set_Capacity (2);
- Add_Action (Table.States (766), 74, (120, 2), 453);
- Add_Action (Table.States (766), 78, (259, 0), 954);
- Table.States (766).Kernel := To_Vector ((((120, 2), 195, 4,
(2147483647, 0), 0), ((120, 3), 195, 2,
- (2147483647, 0), 0), ((259, 0), 195, 1, (2147483647, 0), 0)));
- Table.States (766).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (259, 0), 78, 954)));
- Table.States (767).Action_List.Set_Capacity (1);
- Add_Action (Table.States (767), 99, (196, 0), 955);
- Table.States (767).Kernel := To_Vector ((0 => ((196, 0), 125, 1,
(2147483647, 0), 0)));
- Table.States (767).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (196, 0), 99, 955)));
- Table.States (768).Action_List.Set_Capacity (1);
- Add_Action (Table.States (768), 99, (246, 0), 956);
- Table.States (768).Kernel := To_Vector ((0 => ((246, 0), 125, 1,
(2147483647, 0), 0)));
- Table.States (768).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (246, 0), 99, 956)));
- Table.States (769).Action_List.Set_Capacity (1);
- Add_Action (Table.States (769), 99, (115, 0), 957);
- Table.States (769).Kernel := To_Vector ((0 => ((115, 0), 125, 1,
(2147483647, 0), 0)));
- Table.States (769).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (115, 0), 99, 957)));
- Table.States (770).Action_List.Set_Capacity (1);
- Add_Action (Table.States (770), 99, (311, 0), 958);
- Table.States (770).Kernel := To_Vector ((0 => ((311, 0), 125, 1,
(2147483647, 0), 0)));
- Table.States (770).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (311, 0), 99, 958)));
- Table.States (771).Action_List.Set_Capacity (1);
- Add_Action (Table.States (771), 99, (314, 0), 959);
- Table.States (771).Kernel := To_Vector ((0 => ((314, 0), 125, 1,
(2147483647, 0), 0)));
- Table.States (771).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (314, 0), 99, 959)));
- Table.States (772).Action_List.Set_Capacity (1);
- Add_Action (Table.States (772), 13, (310, 0), 960);
- Table.States (772).Kernel := To_Vector ((0 => ((310, 0), 162, 3,
(2147483647, 0), 0)));
- Table.States (772).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (310, 0), 13, 960)));
- Table.States (773).Action_List.Set_Capacity (1);
- Add_Action (Table.States (773), 24, (116, 0), 961);
- Table.States (773).Kernel := To_Vector ((0 => ((116, 0), 221, 2,
(2147483647, 0), 0)));
- Table.States (773).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (116, 0), 24, 961)));
- Table.States (774).Action_List.Set_Capacity (17);
- Add_Action (Table.States (774), 3, (200, 2), 122);
- Add_Action (Table.States (774), 39, (261, 4), 123);
- Add_Action (Table.States (774), 40, (168, 1), 263);
- Add_Action (Table.States (774), 41, (261, 1), 125);
- Add_Action (Table.States (774), 44, (168, 3), 265);
- Add_Action (Table.States (774), 52, (278, 0), 126);
- Add_Action (Table.States (774), 76, (120, 0), 127);
- Add_Action (Table.States (774), 77, (120, 5), 128);
- Add_Action (Table.States (774), 81, (242, 8), 31);
- Add_Action (Table.States (774), 82, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (774), 90, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (774), 97, (333, 1), 129);
- Add_Action (Table.States (774), 98, (333, 0), 130);
- Add_Action (Table.States (774), 106, (261, 0), 131);
- Add_Action (Table.States (774), 107, (242, 5), 120);
- Add_Action (Table.States (774), 108, (242, 7), 34);
- Add_Action (Table.States (774), 109, (242, 6), 35);
- Table.States (774).Goto_List.Set_Capacity (22);
- Add_Goto (Table.States (774), 120, 132);
- Add_Goto (Table.States (774), 131, 42);
- Add_Goto (Table.States (774), 168, 271);
- Add_Goto (Table.States (774), 169, 962);
- Add_Goto (Table.States (774), 194, 611);
- Add_Goto (Table.States (774), 200, 135);
- Add_Goto (Table.States (774), 242, 276);
- Add_Goto (Table.States (774), 261, 137);
- Add_Goto (Table.States (774), 275, 93);
- Add_Goto (Table.States (774), 278, 138);
- Add_Goto (Table.States (774), 280, 278);
- Add_Goto (Table.States (774), 285, 139);
- Add_Goto (Table.States (774), 286, 140);
- Add_Goto (Table.States (774), 287, 141);
- Add_Goto (Table.States (774), 288, 142);
- Add_Goto (Table.States (774), 289, 143);
- Add_Goto (Table.States (774), 290, 144);
- Add_Goto (Table.States (774), 296, 98);
- Add_Goto (Table.States (774), 304, 279);
- Add_Goto (Table.States (774), 323, 146);
- Add_Goto (Table.States (774), 324, 147);
- Add_Goto (Table.States (774), 333, 148);
- Table.States (774).Kernel := To_Vector ((0 => ((140, 0), 72, 1,
(2147483647, 0), 0)));
- Table.States (774).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (169, 2), 0)));
- Table.States (775).Action_List.Set_Capacity (2);
- Add_Action (Table.States (775), (78, 86), (141, 1), 1, null,
null);
- Table.States (775).Kernel := To_Vector ((0 => ((141, 1), 140, 0,
(141, 1), 1)));
- Table.States (775).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (141, 1), 1)));
- Table.States (776).Action_List.Set_Capacity (2);
- Add_Action (Table.States (776), 78, Reduce, (139, 0), 4,
case_expression_0'Access, null);
- Add_Action (Table.States (776), 86, (141, 0), 963);
- Table.States (776).Kernel := To_Vector ((((139, 0), 141, 0,
(139, 0), 4), ((141, 0), 141, 3,
- (2147483647, 0), 0)));
- Table.States (776).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (139, 0), 4)));
- Table.States (777).Action_List.Set_Capacity (9);
- Add_Action (Table.States (777), 39, (261, 4), 123);
- Add_Action (Table.States (777), 41, (168, 1), 964);
- Add_Action (Table.States (777), 76, (120, 0), 127);
- Add_Action (Table.States (777), 77, (120, 5), 128);
- Add_Action (Table.States (777), 81, (242, 8), 31);
- Add_Action (Table.States (777), 106, (261, 0), 131);
- Add_Action (Table.States (777), 107, (242, 5), 120);
- Add_Action (Table.States (777), 108, (242, 7), 34);
- Add_Action (Table.States (777), 109, (242, 6), 35);
- Table.States (777).Goto_List.Set_Capacity (6);
- Add_Goto (Table.States (777), 120, 132);
- Add_Goto (Table.States (777), 131, 42);
- Add_Goto (Table.States (777), 242, 136);
- Add_Goto (Table.States (777), 261, 258);
- Add_Goto (Table.States (777), 275, 93);
- Add_Goto (Table.States (777), 296, 98);
- Table.States (777).Kernel := To_Vector ((((168, 1), 40, 2,
(2147483647, 0), 0), ((200, 3), 40, 1,
- (2147483647, 0), 0), ((317, 0), 40, 6, (2147483647, 0), 0),
((317, 1), 40, 2, (2147483647, 0), 0)));
- Table.States (777).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (778).Action_List.Set_Capacity (2);
- Add_Action (Table.States (778), 82, (169, 0), 450);
- Add_Action (Table.States (778), 90, (127, 6), 965);
- Table.States (778).Kernel := To_Vector ((((127, 6), 169, 2,
(2147483647, 0), 0), ((169, 0), 169, 2,
- (2147483647, 0), 0)));
- Table.States (778).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (127, 6), 90, 965)));
- Table.States (779).Action_List.Set_Capacity (2);
- Add_Action (Table.States (779), 82, Reduce, (168, 2), 1, null,
null);
- Add_Action (Table.States (779), 90, Reduce, (168, 2), 1, null,
null);
- Add_Conflict (Table.States (779), 90, (170, 1), 1, null, null);
- Table.States (779).Kernel := To_Vector ((((168, 2), 280, 0,
(168, 2), 1), ((170, 1), 280, 0, (170, 1),
- 1)));
- Table.States (779).Minimal_Complete_Actions := To_Vector
(((Reduce, (168, 2), 1), (Reduce, (170, 1),
- 1)));
- Table.States (780).Action_List.Set_Capacity (5);
- Add_Action (Table.States (780), (35, 78, 79, 86, 99), (127, 7),
4, association_opt_7'Access, null);
- Table.States (780).Kernel := To_Vector ((0 => ((127, 7), 194, 0,
(127, 7), 4)));
- Table.States (780).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (127, 7), 4)));
- Table.States (781).Action_List.Set_Capacity (15);
- Add_Action (Table.States (781), 3, (200, 2), 122);
- Add_Action (Table.States (781), 39, (261, 4), 123);
- Add_Action (Table.States (781), 40, (200, 3), 124);
- Add_Action (Table.States (781), 41, (261, 1), 125);
- Add_Action (Table.States (781), 52, (278, 0), 126);
- Add_Action (Table.States (781), 76, (120, 0), 127);
- Add_Action (Table.States (781), 77, (120, 5), 128);
- Add_Action (Table.States (781), 78, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (781), 81, (242, 8), 31);
- Add_Action (Table.States (781), 97, (333, 1), 129);
- Add_Action (Table.States (781), 98, (333, 0), 130);
- Add_Action (Table.States (781), 106, (261, 0), 131);
- Add_Action (Table.States (781), 107, (242, 5), 120);
- Add_Action (Table.States (781), 108, (242, 7), 34);
- Add_Action (Table.States (781), 109, (242, 6), 35);
- Table.States (781).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (781), 120, 132);
- Add_Goto (Table.States (781), 131, 42);
- Add_Goto (Table.States (781), 194, 133);
- Add_Goto (Table.States (781), 195, 966);
- Add_Goto (Table.States (781), 200, 135);
- Add_Goto (Table.States (781), 242, 136);
- Add_Goto (Table.States (781), 261, 137);
- Add_Goto (Table.States (781), 275, 93);
- Add_Goto (Table.States (781), 278, 138);
- Add_Goto (Table.States (781), 285, 139);
- Add_Goto (Table.States (781), 286, 140);
- Add_Goto (Table.States (781), 287, 141);
- Add_Goto (Table.States (781), 288, 142);
- Add_Goto (Table.States (781), 289, 143);
- Add_Goto (Table.States (781), 290, 144);
- Add_Goto (Table.States (781), 296, 98);
- Add_Goto (Table.States (781), 304, 145);
- Add_Goto (Table.States (781), 323, 146);
- Add_Goto (Table.States (781), 324, 147);
- Add_Goto (Table.States (781), 333, 148);
- Table.States (781).Kernel := To_Vector ((0 => ((276, 0), 90, 0,
(195, 1), 0)));
- Table.States (781).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (782).Action_List.Set_Capacity (3);
- Add_Action (Table.States (782), 22, (224, 1), 967);
- Add_Action (Table.States (782), 23, (175, 0), 968);
- Add_Action (Table.States (782), 78, Reduce, (224, 3), 4,
if_expression_3'Access, null);
- Table.States (782).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (782), 175, 969);
- Add_Goto (Table.States (782), 176, 970);
- Table.States (782).Kernel := To_Vector ((((224, 0), 195, 3,
(2147483647, 0), 0), ((224, 1), 195, 1,
- (2147483647, 0), 0), ((224, 2), 195, 2, (2147483647, 0), 0),
((224, 3), 195, 0, (224, 3), 4)));
- Table.States (782).Minimal_Complete_Actions := To_Vector (((Shift,
(224, 1), 22, 967), (Reduce, (224, 3),
- 4)));
- Table.States (783).Action_List.Set_Capacity (2);
- Add_Action (Table.States (783), 78, (120, 4), 971);
- Add_Action (Table.States (783), 86, (128, 0), 448);
- Table.States (783).Kernel := To_Vector ((((120, 4), 128, 1,
(2147483647, 0), 0), ((128, 0), 128, 1,
- (2147483647, 0), 0)));
- Table.States (783).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (120, 4), 78, 971)));
- Table.States (784).Action_List.Set_Capacity (1);
- Add_Action (Table.States (784), 78, (120, 2), 972);
- Table.States (784).Kernel := To_Vector ((0 => ((120, 2), 54, 1,
(2147483647, 0), 0)));
- Table.States (784).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (120, 2), 78, 972)));
- Table.States (785).Action_List.Set_Capacity (65);
- Add_Action (Table.States (785), (4, 5, 10, 13, 15, 17, 18, 20, 21,
22, 23, 27, 28, 31, 32, 33, 35, 37, 38,
- 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74,
75, 76, 78, 79, 80, 81, 82, 85, 86, 87, 88,
- 89, 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104,
105, 107, 108, 109), (120, 3), 5,
- aggregate_3'Access, null);
- Table.States (785).Kernel := To_Vector ((0 => ((120, 3), 78, 0,
(120, 3), 5)));
- Table.States (785).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (120, 3), 5)));
- Table.States (786).Action_List.Set_Capacity (15);
- Add_Action (Table.States (786), 3, (200, 2), 122);
- Add_Action (Table.States (786), 39, (261, 4), 123);
- Add_Action (Table.States (786), 40, (200, 3), 124);
- Add_Action (Table.States (786), 41, (261, 1), 125);
- Add_Action (Table.States (786), 52, (278, 0), 126);
- Add_Action (Table.States (786), 76, (120, 0), 127);
- Add_Action (Table.States (786), 77, (120, 5), 128);
- Add_Action (Table.States (786), 78, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (786), 81, (242, 8), 31);
- Add_Action (Table.States (786), 97, (333, 1), 129);
- Add_Action (Table.States (786), 98, (333, 0), 130);
- Add_Action (Table.States (786), 106, (261, 0), 131);
- Add_Action (Table.States (786), 107, (242, 5), 120);
- Add_Action (Table.States (786), 108, (242, 7), 34);
- Add_Action (Table.States (786), 109, (242, 6), 35);
- Table.States (786).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (786), 120, 132);
- Add_Goto (Table.States (786), 131, 42);
- Add_Goto (Table.States (786), 194, 133);
- Add_Goto (Table.States (786), 195, 973);
- Add_Goto (Table.States (786), 200, 135);
- Add_Goto (Table.States (786), 242, 136);
- Add_Goto (Table.States (786), 261, 137);
- Add_Goto (Table.States (786), 275, 93);
- Add_Goto (Table.States (786), 278, 138);
- Add_Goto (Table.States (786), 285, 139);
- Add_Goto (Table.States (786), 286, 140);
- Add_Goto (Table.States (786), 287, 141);
- Add_Goto (Table.States (786), 288, 142);
- Add_Goto (Table.States (786), 289, 143);
- Add_Goto (Table.States (786), 290, 144);
- Add_Goto (Table.States (786), 296, 98);
- Add_Goto (Table.States (786), 304, 145);
- Add_Goto (Table.States (786), 323, 146);
- Add_Goto (Table.States (786), 324, 147);
- Add_Goto (Table.States (786), 333, 148);
- Table.States (786).Kernel := To_Vector ((0 => ((280, 0), 76, 1,
(2147483647, 0), 0)));
- Table.States (786).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (787).Action_List.Set_Capacity (2);
- Add_Action (Table.States (787), 79, (120, 5), 974);
- Add_Action (Table.States (787), 86, (128, 0), 448);
- Table.States (787).Kernel := To_Vector ((((120, 5), 128, 1,
(2147483647, 0), 0), ((128, 0), 128, 1,
- (2147483647, 0), 0)));
- Table.States (787).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (120, 5), 79, 974)));
- Table.States (788).Action_List.Set_Capacity (25);
- Add_Action (Table.States (788), 4, (116, 0), 1);
- Add_Action (Table.States (788), 5, (306, 8), 2);
- Add_Action (Table.States (788), 13, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (788), 15, (142, 0), 3);
- Add_Action (Table.States (788), 17, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (788), 18, (164, 0), 4);
- Add_Action (Table.States (788), 24, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (788), 27, (193, 0), 5);
- Add_Action (Table.States (788), 28, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (788), 31, (306, 3), 9);
- Add_Action (Table.States (788), 32, (225, 0), 10);
- Add_Action (Table.States (788), 37, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (788), 41, (306, 0), 13);
- Add_Action (Table.States (788), 48, (260, 0), 16);
- Add_Action (Table.States (788), 52, (279, 0), 20);
- Add_Action (Table.States (788), 57, (293, 0), 21);
- Add_Action (Table.States (788), 58, (199, 0), 22);
- Add_Action (Table.States (788), 61, (129, 0), 24);
- Add_Action (Table.States (788), 72, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (788), 73, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (788), 81, (242, 8), 31);
- Add_Action (Table.States (788), 96, (220, 0), 32);
- Add_Action (Table.States (788), 107, (134, 0), 363);
- Add_Action (Table.States (788), 108, (242, 7), 34);
- Add_Action (Table.States (788), 109, (242, 6), 35);
- Table.States (788).Goto_List.Set_Capacity (31);
- Add_Goto (Table.States (788), 116, 37);
- Add_Goto (Table.States (788), 126, 39);
- Add_Goto (Table.States (788), 129, 40);
- Add_Goto (Table.States (788), 131, 42);
- Add_Goto (Table.States (788), 134, 43);
- Add_Goto (Table.States (788), 135, 44);
- Add_Goto (Table.States (788), 136, 45);
- Add_Goto (Table.States (788), 142, 48);
- Add_Goto (Table.States (788), 154, 51);
- Add_Goto (Table.States (788), 155, 52);
- Add_Goto (Table.States (788), 164, 54);
- Add_Goto (Table.States (788), 193, 58);
- Add_Goto (Table.States (788), 199, 60);
- Add_Goto (Table.States (788), 220, 69);
- Add_Goto (Table.States (788), 225, 71);
- Add_Goto (Table.States (788), 235, 73);
- Add_Goto (Table.States (788), 242, 74);
- Add_Goto (Table.States (788), 260, 84);
- Add_Goto (Table.States (788), 264, 87);
- Add_Goto (Table.States (788), 275, 93);
- Add_Goto (Table.States (788), 279, 94);
- Add_Goto (Table.States (788), 293, 97);
- Add_Goto (Table.States (788), 296, 98);
- Add_Goto (Table.States (788), 297, 99);
- Add_Goto (Table.States (788), 301, 100);
- Add_Goto (Table.States (788), 302, 364);
- Add_Goto (Table.States (788), 303, 975);
- Add_Goto (Table.States (788), 305, 101);
- Add_Goto (Table.States (788), 306, 102);
- Add_Goto (Table.States (788), 309, 366);
- Add_Goto (Table.States (788), 326, 115);
- Table.States (788).Kernel := To_Vector ((0 => ((143, 0), 90, 0,
(303, 1), 0)));
- Table.States (788).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (303, 1), 0)));
- Table.States (789).Action_List.Set_Capacity (1);
- Add_Action (Table.States (789), 99, (142, 0), 976);
- Table.States (789).Kernel := To_Vector ((0 => ((142, 0), 15, 1,
(2147483647, 0), 0)));
- Table.States (789).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (142, 0), 99, 976)));
- Table.States (790).Action_List.Set_Capacity (18);
- Add_Action (Table.States (790), (10, 20, 21, 22, 23, 35, 37, 43,
53, 68, 74, 75, 78, 79, 82, 86, 90, 99),
- (236, 0), 3, null, null);
- Table.States (790).Kernel := To_Vector ((0 => ((236, 0), 237, 0,
(236, 0), 3)));
- Table.States (790).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (236, 0), 3)));
- Table.States (791).Action_List.Set_Capacity (15);
- Add_Action (Table.States (791), 10, Reduce, (317, 1), 3,
subtype_indication_1'Access, null);
- Add_Action (Table.States (791), 21, Reduce, (317, 1), 3,
subtype_indication_1'Access, null);
- Add_Action (Table.States (791), 37, Reduce, (317, 1), 3,
subtype_indication_1'Access, null);
- Add_Action (Table.States (791), 42, Reduce, (317, 1), 3,
subtype_indication_1'Access, null);
- Add_Action (Table.States (791), 53, (158, 0), 632);
- Add_Action (Table.States (791), 74, Reduce, (317, 1), 3,
subtype_indication_1'Access, null);
- Add_Action (Table.States (791), 76, (118, 0), 633);
- Add_Action (Table.States (791), 78, Reduce, (317, 1), 3,
subtype_indication_1'Access, null);
- Add_Action (Table.States (791), 85, Reduce, (317, 1), 3,
subtype_indication_1'Access, null);
- Add_Action (Table.States (791), 86, Reduce, (317, 1), 3,
subtype_indication_1'Access, null);
- Add_Action (Table.States (791), 87, (296, 0), 239);
- Add_Action (Table.States (791), 90, Reduce, (317, 1), 3,
subtype_indication_1'Access, null);
- Add_Action (Table.States (791), 99, Reduce, (317, 1), 3,
subtype_indication_1'Access, null);
- Add_Action (Table.States (791), 104, (325, 0), 241);
- Add_Action (Table.States (791), 105, (325, 1), 242);
- Table.States (791).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (791), 118, 243);
- Add_Goto (Table.States (791), 158, 977);
- Add_Goto (Table.States (791), 227, 635);
- Add_Goto (Table.States (791), 325, 244);
- Table.States (791).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((242, 0), 242, 5,
- (2147483647, 0), 0), ((242, 1), 242, 2, (2147483647, 0), 0),
((275, 0), 242, 3, (2147483647, 0), 0),
- ((296, 0), 242, 2, (2147483647, 0), 0), ((296, 1), 242, 2,
(2147483647, 0), 0), ((296, 2), 242, 2,
- (2147483647, 0), 0), ((296, 3), 242, 2, (2147483647, 0), 0),
((317, 0), 242, 4, (2147483647, 0), 0),
- ((317, 1), 242, 0, (317, 1), 3)));
- Table.States (791).Minimal_Complete_Actions := To_Vector (((Shift,
(158, 0), 53, 632), (Reduce, (317, 1),
- 3)));
- Table.States (792).Action_List.Set_Capacity (10);
- Add_Action (Table.States (792), (10, 21, 37, 42, 74, 78, 85, 86,
90, 99), (158, 0), 2, null, null);
- Table.States (792).Kernel := To_Vector ((0 => ((158, 0), 280, 0,
(158, 0), 2)));
- Table.States (792).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (158, 0), 2)));
- Table.States (793).Action_List.Set_Capacity (2);
- Add_Action (Table.States (793), (78, 86), (171, 1), 1, null,
null);
- Table.States (793).Kernel := To_Vector ((0 => ((171, 1), 170, 0,
(171, 1), 1)));
- Table.States (793).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (171, 1), 1)));
- Table.States (794).Action_List.Set_Capacity (2);
- Add_Action (Table.States (794), 78, (227, 0), 978);
- Add_Action (Table.States (794), 86, (171, 0), 979);
- Table.States (794).Kernel := To_Vector ((((171, 0), 171, 2,
(2147483647, 0), 0), ((227, 0), 171, 1,
- (2147483647, 0), 0)));
- Table.States (794).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (227, 0), 78, 978)));
- Table.States (795).Action_List.Set_Capacity (4);
- Add_Action (Table.States (795), 78, Reduce, (170, 1), 1, null,
null);
- Add_Conflict (Table.States (795), 78, (281, 1), 1, null, null);
- Add_Action (Table.States (795), 82, Reduce, (168, 2), 1, null,
null);
- Add_Action (Table.States (795), 86, Reduce, (170, 1), 1, null,
null);
- Add_Conflict (Table.States (795), 86, (281, 1), 1, null, null);
- Add_Action (Table.States (795), 90, Reduce, (168, 2), 1, null,
null);
- Table.States (795).Kernel := To_Vector ((((168, 2), 280, 0,
(168, 2), 1), ((170, 1), 280, 0, (170, 1),
- 1), ((281, 1), 280, 0, (281, 1), 1)));
- Table.States (795).Minimal_Complete_Actions := To_Vector
(((Reduce, (168, 2), 1), (Reduce, (170, 1), 1),
- (Reduce, (281, 1), 1)));
- Table.States (796).Action_List.Set_Capacity (4);
- Add_Action (Table.States (796), 81, (242, 8), 31);
- Add_Action (Table.States (796), 107, (242, 5), 120);
- Add_Action (Table.States (796), 108, (242, 7), 34);
- Add_Action (Table.States (796), 109, (242, 6), 35);
- Table.States (796).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (796), 131, 42);
- Add_Goto (Table.States (796), 242, 980);
- Add_Goto (Table.States (796), 275, 93);
- Add_Goto (Table.States (796), 296, 98);
- Table.States (796).Kernel := To_Vector ((0 => ((233, 0), 59, 1,
(2147483647, 0), 0)));
- Table.States (796).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (797).Action_List.Set_Capacity (6);
- Add_Action (Table.States (797), 37, Reduce, (233, 1), 5, null,
null);
- Add_Action (Table.States (797), 76, (118, 0), 237);
- Add_Action (Table.States (797), 87, (296, 0), 239);
- Add_Action (Table.States (797), 90, Reduce, (233, 1), 5, null,
null);
- Add_Action (Table.States (797), 104, (325, 0), 241);
- Add_Action (Table.States (797), 105, (325, 1), 242);
- Table.States (797).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (797), 118, 243);
- Add_Goto (Table.States (797), 325, 244);
- Table.States (797).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((233, 1), 242, 0,
- (233, 1), 5), ((242, 0), 242, 5, (2147483647, 0), 0), ((242,
1), 242, 2, (2147483647, 0), 0), ((275,
- 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (797).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (233, 1), 5)));
- Table.States (798).Action_List.Set_Capacity (42);
- Add_Action (Table.States (798), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 72, 73,
74, 81, 96, 107, 108, 109, 110), (130, 0),
- 6, at_clause_0'Access, null);
- Table.States (798).Kernel := To_Vector ((0 => ((130, 0), 99, 0,
(130, 0), 6)));
- Table.States (798).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (130, 0), 6)));
- Table.States (799).Action_List.Set_Capacity (15);
- Add_Action (Table.States (799), 3, (200, 2), 122);
- Add_Action (Table.States (799), 39, (261, 4), 123);
- Add_Action (Table.States (799), 40, (200, 3), 124);
- Add_Action (Table.States (799), 41, (261, 1), 125);
- Add_Action (Table.States (799), 52, (278, 0), 126);
- Add_Action (Table.States (799), 76, (120, 0), 127);
- Add_Action (Table.States (799), 77, (120, 5), 128);
- Add_Action (Table.States (799), 81, (242, 8), 31);
- Add_Action (Table.States (799), 97, (333, 1), 129);
- Add_Action (Table.States (799), 98, (333, 0), 130);
- Add_Action (Table.States (799), 99, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (799), 106, (261, 0), 131);
- Add_Action (Table.States (799), 107, (242, 5), 120);
- Add_Action (Table.States (799), 108, (242, 7), 34);
- Add_Action (Table.States (799), 109, (242, 6), 35);
- Table.States (799).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (799), 120, 132);
- Add_Goto (Table.States (799), 131, 42);
- Add_Goto (Table.States (799), 194, 133);
- Add_Goto (Table.States (799), 195, 981);
- Add_Goto (Table.States (799), 200, 135);
- Add_Goto (Table.States (799), 242, 136);
- Add_Goto (Table.States (799), 261, 137);
- Add_Goto (Table.States (799), 275, 93);
- Add_Goto (Table.States (799), 278, 138);
- Add_Goto (Table.States (799), 285, 139);
- Add_Goto (Table.States (799), 286, 140);
- Add_Goto (Table.States (799), 287, 141);
- Add_Goto (Table.States (799), 288, 142);
- Add_Goto (Table.States (799), 289, 143);
- Add_Goto (Table.States (799), 290, 144);
- Add_Goto (Table.States (799), 296, 98);
- Add_Goto (Table.States (799), 304, 145);
- Add_Goto (Table.States (799), 323, 146);
- Add_Goto (Table.States (799), 324, 147);
- Add_Goto (Table.States (799), 333, 148);
- Table.States (799).Kernel := To_Vector ((0 => ((238, 0), 38, 1,
(2147483647, 0), 0)));
- Table.States (799).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (800).Action_List.Set_Capacity (1);
- Add_Action (Table.States (800), 12, (147, 0), 982);
- Table.States (800).Kernel := To_Vector ((0 => ((147, 0), 107, 7,
(2147483647, 0), 0)));
- Table.States (800).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (147, 0), 12, 982)));
- Table.States (801).Action_List.Set_Capacity (2);
- Add_Action (Table.States (801), (24, 107), (148, 1), 1, null,
null);
- Table.States (801).Kernel := To_Vector ((0 => ((148, 1), 147, 0,
(148, 1), 1)));
- Table.States (801).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (148, 1), 1)));
- Table.States (802).Action_List.Set_Capacity (2);
- Add_Action (Table.States (802), 24, (284, 0), 983);
- Add_Action (Table.States (802), 107, (147, 0), 800);
- Table.States (802).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (802), 147, 984);
- Table.States (802).Kernel := To_Vector ((((148, 0), 148, 8,
(2147483647, 0), 0), ((284, 0), 148, 3,
- (2147483647, 0), 0)));
- Table.States (802).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (284, 0), 24, 983)));
- Table.States (803).Action_List.Set_Capacity (8);
- Add_Action (Table.States (803), 7, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (803), 33, (239, 0), 511);
- Add_Action (Table.States (803), 40, (244, 0), 389);
- Add_Conflict (Table.States (803), 40, (239, 3), 0, null, null);
- Add_Action (Table.States (803), 45, (239, 2), 512);
- Add_Action (Table.States (803), 81, Reduce, (239, 3), 0, null,
null);
- Add_Action (Table.States (803), 107, Reduce, (239, 3), 0, null,
null);
- Add_Action (Table.States (803), 108, Reduce, (239, 3), 0, null,
null);
- Add_Action (Table.States (803), 109, Reduce, (239, 3), 0, null,
null);
- Table.States (803).Goto_List.Set_Capacity (3);
- Add_Goto (Table.States (803), 117, 985);
- Add_Goto (Table.States (803), 239, 986);
- Add_Goto (Table.States (803), 244, 735);
- Table.States (803).Kernel := To_Vector ((((257, 0), 121, 2,
(2147483647, 0), 0), ((257, 1), 121, 1,
- (2147483647, 0), 0), ((257, 2), 121, 3, (2147483647, 0), 0),
((257, 3), 121, 2, (2147483647, 0),
- 0)));
- Table.States (803).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (239, 3), 0)));
- Table.States (804).Action_List.Set_Capacity (2);
- Add_Action (Table.States (804), (78, 99), (258, 0), 3, null,
null);
- Table.States (804).Kernel := To_Vector ((0 => ((258, 0), 257, 0,
(258, 0), 3)));
- Table.States (804).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (258, 0), 3)));
- Table.States (805).Action_List.Set_Capacity (1);
- Add_Action (Table.States (805), 99, (218, 2), 987);
- Table.States (805).Kernel := To_Vector ((0 => ((218, 2), 125, 1,
(2147483647, 0), 0)));
- Table.States (805).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (218, 2), 99, 987)));
- Table.States (806).Action_List.Set_Capacity (1);
- Add_Action (Table.States (806), 99, (218, 0), 988);
- Table.States (806).Kernel := To_Vector ((0 => ((218, 0), 125, 1,
(2147483647, 0), 0)));
- Table.States (806).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (218, 0), 99, 988)));
- Table.States (807).Action_List.Set_Capacity (1);
- Add_Action (Table.States (807), 99, (218, 1), 989);
- Table.States (807).Kernel := To_Vector ((0 => ((218, 1), 125, 1,
(2147483647, 0), 0)));
- Table.States (807).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (218, 1), 99, 989)));
- Table.States (808).Action_List.Set_Capacity (4);
- Add_Action (Table.States (808), 36, (112, 0), 990);
- Add_Action (Table.States (808), 39, Reduce, (112, 2), 1, null,
null);
- Add_Action (Table.States (808), 64, (112, 1), 893);
- Add_Action (Table.States (808), 65, (114, 0), 894);
- Table.States (808).Kernel := To_Vector ((((112, 0), 6, 1,
(2147483647, 0), 0), ((112, 1), 6, 1,
- (2147483647, 0), 0), ((112, 2), 6, 0, (112, 2), 1), ((114, 0),
6, 2, (2147483647, 0), 0), ((114, 1),
- 6, 1, (2147483647, 0), 0)));
- Table.States (808).Minimal_Complete_Actions := To_Vector (((Shift,
(112, 0), 36, 990), (Shift, (112, 1),
- 64, 893), (Reduce, (112, 2), 1), (Shift, (114, 0), 65, 894)));
- Table.States (809).Action_List.Set_Capacity (1);
- Add_Action (Table.States (809), 83, (205, 6), 991);
- Table.States (809).Kernel := To_Vector ((((205, 6), 19, 3,
(2147483647, 0), 0), ((205, 7), 19, 1,
- (2147483647, 0), 0)));
- Table.States (809).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (205, 6), 83, 991)));
- Table.States (810).Action_List.Set_Capacity (1);
- Add_Action (Table.States (810), 83, (205, 5), 992);
- Table.States (810).Kernel := To_Vector ((0 => ((205, 5), 20, 1,
(2147483647, 0), 0)));
- Table.States (810).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (205, 5), 83, 992)));
- Table.States (811).Action_List.Set_Capacity (3);
- Add_Action (Table.States (811), 34, (231, 0), 898);
- Add_Action (Table.States (811), 39, Reduce, (112, 3), 1, null,
null);
- Add_Action (Table.States (811), 49, Reduce, (114, 4), 1, null,
null);
- Table.States (811).Kernel := To_Vector ((((112, 3), 36, 0, (112,
3), 1), ((114, 4), 36, 0, (114, 4),
- 1), ((231, 0), 36, 3, (2147483647, 0), 0), ((231, 4), 36, 1,
(2147483647, 0), 0)));
- Table.States (811).Minimal_Complete_Actions := To_Vector
(((Reduce, (112, 3), 1), (Reduce, (114, 4), 1),
- (Shift, (231, 0), 34, 898)));
- end Subr_15;
- procedure Subr_16
- is begin
- Table.States (812).Action_List.Set_Capacity (1);
- Add_Action (Table.States (812), 83, (205, 4), 993);
- Table.States (812).Kernel := To_Vector ((0 => ((205, 4), 38, 1,
(2147483647, 0), 0)));
- Table.States (812).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (205, 4), 83, 993)));
- Table.States (813).Action_List.Set_Capacity (1);
- Add_Action (Table.States (813), 83, (205, 3), 994);
- Table.States (813).Kernel := To_Vector ((0 => ((205, 3), 53, 1,
(2147483647, 0), 0)));
- Table.States (813).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (205, 3), 83, 994)));
- Table.States (814).Action_List.Set_Capacity (4);
- Add_Action (Table.States (814), 36, (114, 2), 913);
- Add_Action (Table.States (814), 49, Reduce, (114, 3), 1, null,
null);
- Add_Action (Table.States (814), 74, (125, 0), 340);
- Add_Action (Table.States (814), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (814).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (814), 125, 995);
- Table.States (814).Kernel := To_Vector ((((114, 2), 65, 1,
(2147483647, 0), 0), ((114, 3), 65, 0,
- (114, 3), 1), ((204, 1), 65, 1, (2147483647, 0), 0)));
- Table.States (814).Minimal_Complete_Actions := To_Vector (((Shift,
(114, 2), 36, 913), (Reduce, (114, 3),
- 1), (Reduce, (125, 1), 0)));
- Table.States (815).Action_List.Set_Capacity (1);
- Add_Action (Table.States (815), 83, (205, 2), 996);
- Table.States (815).Kernel := To_Vector ((0 => ((205, 2), 76, 2,
(2147483647, 0), 0)));
- Table.States (815).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (205, 2), 83, 996)));
- Table.States (816).Action_List.Set_Capacity (1);
- Add_Action (Table.States (816), 39, (206, 0), 997);
- Table.States (816).Kernel := To_Vector ((((206, 0), 112, 4,
(2147483647, 0), 0), ((206, 1), 112, 2,
- (2147483647, 0), 0)));
- Table.States (816).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (206, 0), 39, 997)));
- Table.States (817).Action_List.Set_Capacity (1);
- Add_Action (Table.States (817), 49, (205, 0), 998);
- Table.States (817).Kernel := To_Vector ((0 => ((205, 0), 114, 1,
(2147483647, 0), 0)));
- Table.States (817).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (205, 0), 49, 998)));
- Table.States (818).Action_List.Set_Capacity (2);
- Add_Action (Table.States (818), (74, 99), (205, 9), 1, null,
null);
- Table.States (818).Kernel := To_Vector ((0 => ((205, 9), 117, 0,
(205, 9), 1)));
- Table.States (818).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (205, 9), 1)));
- Table.States (819).Action_List.Set_Capacity (2);
- Add_Action (Table.States (819), (74, 99), (205, 8), 1, null,
null);
- Table.States (819).Kernel := To_Vector ((0 => ((205, 8), 123, 0,
(205, 8), 1)));
- Table.States (819).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (205, 8), 1)));
- Table.States (820).Action_List.Set_Capacity (2);
- Add_Action (Table.States (820), 74, (125, 0), 340);
- Add_Action (Table.States (820), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (820).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (820), 125, 999);
- Table.States (820).Kernel := To_Vector ((0 => ((204, 0), 205, 1,
(2147483647, 0), 0)));
- Table.States (820).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (821).Action_List.Set_Capacity (2);
- Add_Action (Table.States (821), (74, 99), (205, 1), 1, null,
null);
- Table.States (821).Kernel := To_Vector ((0 => ((205, 1), 206, 0,
(205, 1), 1)));
- Table.States (821).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (205, 1), 1)));
- Table.States (822).Action_List.Set_Capacity (2);
- Add_Action (Table.States (822), (74, 99), (205, 10), 1, null,
null);
- Table.States (822).Kernel := To_Vector ((0 => ((205, 10), 231,
0, (205, 10), 1)));
- Table.States (822).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (205, 10), 1)));
- Table.States (823).Action_List.Set_Capacity (8);
- Add_Action (Table.States (823), (29, 47, 48, 50, 69, 71, 74, 107),
(204, 2), 5,
- formal_type_declaration_2'Access, null);
- Table.States (823).Kernel := To_Vector ((0 => ((204, 2), 99, 0,
(204, 2), 5)));
- Table.States (823).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (204, 2), 5)));
- Table.States (824).Action_List.Set_Capacity (4);
- Add_Action (Table.States (824), 81, (242, 8), 31);
- Add_Action (Table.States (824), 107, (242, 5), 120);
- Add_Action (Table.States (824), 108, (242, 7), 34);
- Add_Action (Table.States (824), 109, (242, 6), 35);
- Table.States (824).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (824), 131, 42);
- Add_Goto (Table.States (824), 242, 1000);
- Add_Goto (Table.States (824), 275, 93);
- Add_Goto (Table.States (824), 296, 98);
- Table.States (824).Kernel := To_Vector ((0 => ((207, 0), 39, 2,
(2147483647, 0), 0)));
- Table.States (824).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (825).Action_List.Set_Capacity (1);
- Add_Action (Table.States (825), 99, (203, 2), 1001);
- Table.States (825).Kernel := To_Vector ((0 => ((203, 2), 125, 1,
(2147483647, 0), 0)));
- Table.States (825).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (203, 2), 99, 1001)));
- Table.States (826).Action_List.Set_Capacity (2);
- Add_Action (Table.States (826), 74, (125, 0), 340);
- Add_Action (Table.States (826), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (826).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (826), 125, 1002);
- Table.States (826).Kernel := To_Vector ((0 => ((203, 0), 313, 1,
(2147483647, 0), 0)));
- Table.States (826).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (827).Action_List.Set_Capacity (1);
- Add_Action (Table.States (827), 99, (203, 1), 1003);
- Table.States (827).Kernel := To_Vector ((0 => ((203, 1), 125, 1,
(2147483647, 0), 0)));
- Table.States (827).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (203, 1), 99, 1003)));
- Table.States (828).Action_List.Set_Capacity (16);
- Add_Action (Table.States (828), 3, (200, 2), 122);
- Add_Action (Table.States (828), 39, (261, 4), 123);
- Add_Action (Table.States (828), 40, (200, 3), 124);
- Add_Action (Table.States (828), 41, (261, 1), 125);
- Add_Action (Table.States (828), 52, (278, 0), 126);
- Add_Action (Table.States (828), 74, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (828), 76, (120, 0), 127);
- Add_Action (Table.States (828), 77, (120, 5), 128);
- Add_Action (Table.States (828), 81, (242, 8), 31);
- Add_Action (Table.States (828), 97, (333, 1), 129);
- Add_Action (Table.States (828), 98, (333, 0), 130);
- Add_Action (Table.States (828), 99, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (828), 106, (261, 0), 131);
- Add_Action (Table.States (828), 107, (242, 5), 120);
- Add_Action (Table.States (828), 108, (242, 7), 34);
- Add_Action (Table.States (828), 109, (242, 6), 35);
- Table.States (828).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (828), 120, 132);
- Add_Goto (Table.States (828), 131, 42);
- Add_Goto (Table.States (828), 194, 133);
- Add_Goto (Table.States (828), 195, 1004);
- Add_Goto (Table.States (828), 200, 135);
- Add_Goto (Table.States (828), 242, 136);
- Add_Goto (Table.States (828), 261, 137);
- Add_Goto (Table.States (828), 275, 93);
- Add_Goto (Table.States (828), 278, 138);
- Add_Goto (Table.States (828), 285, 139);
- Add_Goto (Table.States (828), 286, 140);
- Add_Goto (Table.States (828), 287, 141);
- Add_Goto (Table.States (828), 288, 142);
- Add_Goto (Table.States (828), 289, 143);
- Add_Goto (Table.States (828), 290, 144);
- Add_Goto (Table.States (828), 296, 98);
- Add_Goto (Table.States (828), 304, 145);
- Add_Goto (Table.States (828), 323, 146);
- Add_Goto (Table.States (828), 324, 147);
- Add_Goto (Table.States (828), 333, 148);
- Table.States (828).Kernel := To_Vector ((0 => ((201, 1), 85, 1,
(2147483647, 0), 0)));
- Table.States (828).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (829).Action_List.Set_Capacity (1);
- Add_Action (Table.States (829), 99, (201, 3), 1005);
- Table.States (829).Kernel := To_Vector ((0 => ((201, 3), 125, 1,
(2147483647, 0), 0)));
- Table.States (829).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (201, 3), 99, 1005)));
- Table.States (830).Action_List.Set_Capacity (7);
- Add_Action (Table.States (830), 74, (125, 0), 340);
- Add_Action (Table.States (830), 76, (118, 0), 237);
- Add_Action (Table.States (830), 85, (201, 0), 1006);
- Add_Action (Table.States (830), 87, (296, 0), 239);
- Add_Action (Table.States (830), 99, Reduce, (125, 1), 0, null,
null);
- Add_Action (Table.States (830), 104, (325, 0), 241);
- Add_Action (Table.States (830), 105, (325, 1), 242);
- Table.States (830).Goto_List.Set_Capacity (3);
- Add_Goto (Table.States (830), 118, 243);
- Add_Goto (Table.States (830), 125, 1007);
- Add_Goto (Table.States (830), 325, 244);
- Table.States (830).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((201, 0), 242, 2,
- (2147483647, 0), 0), ((201, 2), 242, 1, (2147483647, 0), 0),
((242, 0), 242, 5, (2147483647, 0), 0),
- ((242, 1), 242, 2, (2147483647, 0), 0), ((275, 0), 242, 3,
(2147483647, 0), 0), ((296, 0), 242, 2,
- (2147483647, 0), 0), ((296, 1), 242, 2, (2147483647, 0), 0),
((296, 2), 242, 2, (2147483647, 0), 0),
- ((296, 3), 242, 2, (2147483647, 0), 0)));
- Table.States (830).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (831).Action_List.Set_Capacity (1);
- Add_Action (Table.States (831), 24, (225, 1), 1008);
- Table.States (831).Kernel := To_Vector ((0 => ((225, 1), 303, 3,
(2147483647, 0), 0)));
- Table.States (831).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (225, 1), 24, 1008)));
- Table.States (832).Action_List.Set_Capacity (1);
- Add_Action (Table.States (832), 68, (177, 0), 1009);
- Table.States (832).Kernel := To_Vector ((0 => ((177, 0), 195, 1,
(2147483647, 0), 0)));
- Table.States (832).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (177, 0), 68, 1009)));
- Table.States (833).Action_List.Set_Capacity (1);
- Add_Action (Table.States (833), 99, (225, 3), 1010);
- Table.States (833).Kernel := To_Vector ((0 => ((225, 3), 32, 1,
(2147483647, 0), 0)));
- Table.States (833).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (225, 3), 99, 1010)));
- Table.States (834).Action_List.Set_Capacity (24);
- Add_Action (Table.States (834), 4, (116, 0), 1);
- Add_Action (Table.States (834), 5, (306, 8), 2);
- Add_Action (Table.States (834), 13, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (834), 15, (142, 0), 3);
- Add_Action (Table.States (834), 17, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (834), 18, (164, 0), 4);
- Add_Action (Table.States (834), 24, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (834), 27, (193, 0), 5);
- Add_Action (Table.States (834), 28, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (834), 31, (306, 3), 9);
- Add_Action (Table.States (834), 32, (225, 0), 10);
- Add_Action (Table.States (834), 37, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (834), 41, (306, 0), 13);
- Add_Action (Table.States (834), 48, (260, 0), 16);
- Add_Action (Table.States (834), 52, (279, 0), 20);
- Add_Action (Table.States (834), 57, (293, 0), 21);
- Add_Action (Table.States (834), 58, (199, 0), 22);
- Add_Action (Table.States (834), 61, (129, 0), 24);
- Add_Action (Table.States (834), 73, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (834), 81, (242, 8), 31);
- Add_Action (Table.States (834), 96, (220, 0), 32);
- Add_Action (Table.States (834), 107, (134, 0), 363);
- Add_Action (Table.States (834), 108, (242, 7), 34);
- Add_Action (Table.States (834), 109, (242, 6), 35);
- Table.States (834).Goto_List.Set_Capacity (31);
- Add_Goto (Table.States (834), 116, 37);
- Add_Goto (Table.States (834), 126, 39);
- Add_Goto (Table.States (834), 129, 40);
- Add_Goto (Table.States (834), 131, 42);
- Add_Goto (Table.States (834), 134, 43);
- Add_Goto (Table.States (834), 135, 44);
- Add_Goto (Table.States (834), 136, 45);
- Add_Goto (Table.States (834), 142, 48);
- Add_Goto (Table.States (834), 154, 51);
- Add_Goto (Table.States (834), 155, 52);
- Add_Goto (Table.States (834), 164, 54);
- Add_Goto (Table.States (834), 193, 58);
- Add_Goto (Table.States (834), 199, 60);
- Add_Goto (Table.States (834), 220, 69);
- Add_Goto (Table.States (834), 225, 71);
- Add_Goto (Table.States (834), 235, 73);
- Add_Goto (Table.States (834), 242, 74);
- Add_Goto (Table.States (834), 260, 84);
- Add_Goto (Table.States (834), 264, 87);
- Add_Goto (Table.States (834), 275, 93);
- Add_Goto (Table.States (834), 279, 94);
- Add_Goto (Table.States (834), 293, 97);
- Add_Goto (Table.States (834), 296, 98);
- Add_Goto (Table.States (834), 297, 99);
- Add_Goto (Table.States (834), 301, 100);
- Add_Goto (Table.States (834), 302, 364);
- Add_Goto (Table.States (834), 303, 1011);
- Add_Goto (Table.States (834), 305, 101);
- Add_Goto (Table.States (834), 306, 102);
- Add_Goto (Table.States (834), 309, 366);
- Add_Goto (Table.States (834), 326, 115);
- Table.States (834).Kernel := To_Vector ((0 => ((225, 0), 22, 3,
(2147483647, 0), 0)));
- Table.States (834).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (303, 1), 0)));
- Table.States (835).Action_List.Set_Capacity (1);
- Add_Action (Table.States (835), 32, (225, 2), 1012);
- Table.States (835).Kernel := To_Vector ((0 => ((225, 2), 24, 2,
(2147483647, 0), 0)));
- Table.States (835).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (225, 2), 32, 1012)));
- Table.States (836).Action_List.Set_Capacity (3);
- Add_Action (Table.States (836), (22, 23, 24), (178, 0), 2,
elsif_statement_list_0'Access, null);
- Table.States (836).Kernel := To_Vector ((0 => ((178, 0), 177, 0,
(178, 0), 2)));
- Table.States (836).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (178, 0), 2)));
- Table.States (837).Action_List.Set_Capacity (1);
- Add_Action (Table.States (837), 99, (251, 0), 1013);
- Table.States (837).Kernel := To_Vector ((0 => ((251, 0), 125, 1,
(2147483647, 0), 0)));
- Table.States (837).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (251, 0), 99, 1013)));
- Table.States (838).Action_List.Set_Capacity (2);
- Add_Action (Table.States (838), 13, (250, 0), 1014);
- Add_Action (Table.States (838), 24, (250, 1), 1015);
- Table.States (838).Kernel := To_Vector ((((250, 0), 162, 3,
(2147483647, 0), 0), ((250, 1), 162, 2,
- (2147483647, 0), 0)));
- Table.States (838).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (250, 1), 24, 1015)));
- Table.States (839).Action_List.Set_Capacity (1);
- Add_Action (Table.States (839), 99, (216, 0), 1016);
- Table.States (839).Kernel := To_Vector ((0 => ((216, 0), 125, 1,
(2147483647, 0), 0)));
- Table.States (839).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (216, 0), 99, 1016)));
- Table.States (840).Action_List.Set_Capacity (41);
- Add_Action (Table.States (840), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (253, 0), 6,
- package_renaming_declaration_0'Access, null);
- Table.States (840).Kernel := To_Vector ((0 => ((253, 0), 99, 0,
(253, 0), 6)));
- Table.States (840).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (253, 0), 6)));
- Table.States (841).Action_List.Set_Capacity (5);
- Add_Action (Table.States (841), 81, (242, 8), 31);
- Add_Action (Table.States (841), 99, Reduce, (243, 1), 0, null,
null);
- Add_Action (Table.States (841), 107, (242, 5), 120);
- Add_Action (Table.States (841), 108, (242, 7), 34);
- Add_Action (Table.States (841), 109, (242, 6), 35);
- Table.States (841).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (841), 131, 42);
- Add_Goto (Table.States (841), 242, 644);
- Add_Goto (Table.States (841), 243, 1017);
- Add_Goto (Table.States (841), 275, 93);
- Add_Goto (Table.States (841), 296, 98);
- Table.States (841).Kernel := To_Vector ((0 => ((254, 1), 24, 0,
(243, 1), 0)));
- Table.States (841).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (243, 1), 0)));
- Table.States (842).Action_List.Set_Capacity (16);
- Add_Action (Table.States (842), 24, Reduce, (162, 1), 0, null,
null);
- Add_Action (Table.States (842), 25, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (842), 28, (124, 0), 185);
- Add_Action (Table.States (842), 29, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (842), 30, (213, 0), 8);
- Add_Action (Table.States (842), 40, (249, 0), 12);
- Add_Action (Table.States (842), 46, (249, 1), 14);
- Add_Action (Table.States (842), 47, (216, 0), 15);
- Add_Action (Table.States (842), 48, (260, 0), 16);
- Add_Action (Table.States (842), 50, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (842), 51, (267, 0), 19);
- Add_Action (Table.States (842), 63, (316, 0), 25);
- Add_Action (Table.States (842), 66, (308, 0), 26);
- Add_Action (Table.States (842), 69, (209, 0), 27);
- Add_Action (Table.States (842), 71, (334, 0), 28);
- Add_Action (Table.States (842), 107, (222, 1), 187);
- Table.States (842).Goto_List.Set_Capacity (53);
- Add_Goto (Table.States (842), 115, 36);
- Add_Goto (Table.States (842), 124, 38);
- Add_Goto (Table.States (842), 130, 41);
- Add_Goto (Table.States (842), 137, 46);
- Add_Goto (Table.States (842), 138, 47);
- Add_Goto (Table.States (842), 160, 394);
- Add_Goto (Table.States (842), 161, 395);
- Add_Goto (Table.States (842), 162, 1018);
- Add_Goto (Table.States (842), 182, 55);
- Add_Goto (Table.States (842), 185, 56);
- Add_Goto (Table.States (842), 189, 57);
- Add_Goto (Table.States (842), 196, 59);
- Add_Goto (Table.States (842), 209, 61);
- Add_Goto (Table.States (842), 210, 62);
- Add_Goto (Table.States (842), 212, 63);
- Add_Goto (Table.States (842), 213, 64);
- Add_Goto (Table.States (842), 216, 65);
- Add_Goto (Table.States (842), 217, 66);
- Add_Goto (Table.States (842), 218, 67);
- Add_Goto (Table.States (842), 219, 68);
- Add_Goto (Table.States (842), 222, 70);
- Add_Goto (Table.States (842), 226, 72);
- Add_Goto (Table.States (842), 246, 75);
- Add_Goto (Table.States (842), 247, 76);
- Add_Goto (Table.States (842), 248, 77);
- Add_Goto (Table.States (842), 249, 78);
- Add_Goto (Table.States (842), 250, 79);
- Add_Goto (Table.States (842), 251, 80);
- Add_Goto (Table.States (842), 252, 81);
- Add_Goto (Table.States (842), 253, 82);
- Add_Goto (Table.States (842), 254, 83);
- Add_Goto (Table.States (842), 260, 397);
- Add_Goto (Table.States (842), 262, 85);
- Add_Goto (Table.States (842), 263, 86);
- Add_Goto (Table.States (842), 265, 88);
- Add_Goto (Table.States (842), 266, 89);
- Add_Goto (Table.States (842), 267, 90);
- Add_Goto (Table.States (842), 268, 91);
- Add_Goto (Table.States (842), 274, 92);
- Add_Goto (Table.States (842), 284, 95);
- Add_Goto (Table.States (842), 292, 96);
- Add_Goto (Table.States (842), 307, 103);
- Add_Goto (Table.States (842), 308, 104);
- Add_Goto (Table.States (842), 310, 106);
- Add_Goto (Table.States (842), 311, 107);
- Add_Goto (Table.States (842), 312, 108);
- Add_Goto (Table.States (842), 314, 109);
- Add_Goto (Table.States (842), 316, 110);
- Add_Goto (Table.States (842), 319, 112);
- Add_Goto (Table.States (842), 320, 113);
- Add_Goto (Table.States (842), 322, 114);
- Add_Goto (Table.States (842), 328, 116);
- Add_Goto (Table.States (842), 334, 117);
- Table.States (842).Kernel := To_Vector ((0 => ((254, 0), 49, 1,
(2147483647, 0), 0)));
- Table.States (842).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (162, 1), 0)));
- Table.States (843).Action_List.Set_Capacity (47);
- Add_Action (Table.States (843), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (260, 0), 6, pragma_g_0'Access, null);
- Table.States (843).Kernel := To_Vector ((0 => ((260, 0), 99, 0,
(260, 0), 6)));
- Table.States (843).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (260, 0), 6)));
- Table.States (844).Action_List.Set_Capacity (47);
- Add_Action (Table.States (844), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (260, 1), 6, pragma_g_1'Access, null);
- Table.States (844).Kernel := To_Vector ((0 => ((260, 1), 99, 0,
(260, 1), 6)));
- Table.States (844).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (260, 1), 6)));
- Table.States (845).Action_List.Set_Capacity (1);
- Add_Action (Table.States (845), 99, (268, 0), 1019);
- Table.States (845).Kernel := To_Vector ((0 => ((268, 0), 125, 1,
(2147483647, 0), 0)));
- Table.States (845).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (268, 0), 99, 1019)));
- Table.States (846).Action_List.Set_Capacity (1);
- Add_Action (Table.States (846), 107, (179, 0), 1020);
- Table.States (846).Kernel := To_Vector ((0 => ((179, 0), 25, 6,
(2147483647, 0), 0)));
- Table.States (846).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (179, 0), 107, 1020)));
- Table.States (847).Action_List.Set_Capacity (7);
- Add_Action (Table.States (847), (24, 25, 28, 29, 40, 46, 50),
(270, 5), 1, null, null);
- Table.States (847).Kernel := To_Vector ((0 => ((270, 5), 124, 0,
(270, 5), 1)));
- Table.States (847).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (270, 5), 1)));
- Table.States (848).Action_List.Set_Capacity (7);
- Add_Action (Table.States (848), (24, 25, 28, 29, 40, 46, 50),
(270, 2), 1, null, null);
- Table.States (848).Kernel := To_Vector ((0 => ((270, 2), 179, 0,
(270, 2), 1)));
- Table.States (848).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (270, 2), 1)));
- Table.States (849).Action_List.Set_Capacity (7);
- Add_Action (Table.States (849), (24, 25, 28, 29, 40, 46, 50),
(270, 3), 1, null, null);
- Table.States (849).Kernel := To_Vector ((0 => ((270, 3), 196, 0,
(270, 3), 1)));
- Table.States (849).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (270, 3), 1)));
- Table.States (850).Action_List.Set_Capacity (7);
- Add_Action (Table.States (850), (24, 25, 28, 29, 40, 46, 50),
(270, 4), 1, null, null);
- Table.States (850).Kernel := To_Vector ((0 => ((270, 4), 246, 0,
(270, 4), 1)));
- Table.States (850).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (270, 4), 1)));
- Table.States (851).Action_List.Set_Capacity (2);
- Add_Action (Table.States (851), 29, (210, 0), 7);
- Add_Action (Table.States (851), 50, (265, 0), 18);
- Table.States (851).Goto_List.Set_Capacity (3);
- Add_Goto (Table.States (851), 210, 248);
- Add_Goto (Table.States (851), 265, 249);
- Add_Goto (Table.States (851), 315, 1021);
- Table.States (851).Kernel := To_Vector ((((196, 0), 249, 7,
(2147483647, 0), 0), ((246, 0), 249, 5,
- (2147483647, 0), 0), ((310, 0), 249, 6, (2147483647, 0), 0),
((312, 0), 249, 3, (2147483647, 0),
- 0)));
- Table.States (851).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (265, 0), 50, 18)));
- Table.States (852).Action_List.Set_Capacity (7);
- Add_Action (Table.States (852), (24, 25, 28, 29, 40, 46, 50),
(271, 1), 1, null, null);
- Table.States (852).Kernel := To_Vector ((0 => ((271, 1), 270, 0,
(271, 1), 1)));
- Table.States (852).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (271, 1), 1)));
- Table.States (853).Action_List.Set_Capacity (7);
- Add_Action (Table.States (853), 24, Reduce, (272, 0), 1, null,
null);
- Add_Action (Table.States (853), 25, (179, 0), 846);
- Add_Action (Table.States (853), 28, (124, 0), 185);
- Add_Action (Table.States (853), 29, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (853), 40, (249, 0), 12);
- Add_Action (Table.States (853), 46, (249, 1), 14);
- Add_Action (Table.States (853), 50, Reduce, (249, 2), 0, null,
null);
- Table.States (853).Goto_List.Set_Capacity (13);
- Add_Goto (Table.States (853), 124, 847);
- Add_Goto (Table.States (853), 130, 41);
- Add_Goto (Table.States (853), 179, 848);
- Add_Goto (Table.States (853), 185, 56);
- Add_Goto (Table.States (853), 196, 849);
- Add_Goto (Table.States (853), 210, 62);
- Add_Goto (Table.States (853), 246, 850);
- Add_Goto (Table.States (853), 249, 851);
- Add_Goto (Table.States (853), 265, 88);
- Add_Goto (Table.States (853), 270, 1022);
- Add_Goto (Table.States (853), 284, 95);
- Add_Goto (Table.States (853), 310, 855);
- Add_Goto (Table.States (853), 312, 856);
- Table.States (853).Kernel := To_Vector ((((271, 0), 271, 3,
(2147483647, 0), 0), ((272, 0), 271, 0,
- (272, 0), 1)));
- Table.States (853).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (272, 0), 1)));
- Table.States (854).Action_List.Set_Capacity (1);
- Add_Action (Table.States (854), 24, (267, 0), 1023);
- Table.States (854).Kernel := To_Vector ((0 => ((267, 0), 272, 2,
(2147483647, 0), 0)));
- Table.States (854).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (267, 0), 24, 1023)));
- Table.States (855).Action_List.Set_Capacity (7);
- Add_Action (Table.States (855), (24, 25, 28, 29, 40, 46, 50),
(270, 1), 1, null, null);
- Table.States (855).Kernel := To_Vector ((0 => ((270, 1), 310, 0,
(270, 1), 1)));
- Table.States (855).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (270, 1), 1)));
- Table.States (856).Action_List.Set_Capacity (7);
- Add_Action (Table.States (856), (24, 25, 28, 29, 40, 46, 50),
(270, 0), 1, null, null);
- Table.States (856).Kernel := To_Vector ((0 => ((270, 0), 312, 0,
(270, 0), 1)));
- Table.States (856).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (270, 0), 1)));
- Table.States (857).Action_List.Set_Capacity (18);
- Add_Action (Table.States (857), 24, Reduce, (162, 1), 0, null,
null);
- Add_Action (Table.States (857), 25, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (857), 28, (124, 0), 185);
- Add_Action (Table.States (857), 29, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (857), 30, (213, 0), 8);
- Add_Action (Table.States (857), 39, (274, 0), 1024);
- Add_Action (Table.States (857), 40, (249, 0), 12);
- Add_Action (Table.States (857), 46, (249, 1), 14);
- Add_Action (Table.States (857), 47, (216, 0), 15);
- Add_Action (Table.States (857), 48, (260, 0), 16);
- Add_Action (Table.States (857), 49, Reduce, (162, 1), 0, null,
null);
- Add_Action (Table.States (857), 50, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (857), 51, (267, 0), 19);
- Add_Action (Table.States (857), 63, (316, 0), 25);
- Add_Action (Table.States (857), 66, (308, 0), 26);
- Add_Action (Table.States (857), 69, (209, 0), 27);
- Add_Action (Table.States (857), 71, (334, 0), 28);
- Add_Action (Table.States (857), 107, (222, 1), 187);
- Table.States (857).Goto_List.Set_Capacity (54);
- Add_Goto (Table.States (857), 115, 36);
- Add_Goto (Table.States (857), 124, 38);
- Add_Goto (Table.States (857), 130, 41);
- Add_Goto (Table.States (857), 137, 46);
- Add_Goto (Table.States (857), 138, 47);
- Add_Goto (Table.States (857), 160, 394);
- Add_Goto (Table.States (857), 161, 395);
- Add_Goto (Table.States (857), 162, 681);
- Add_Goto (Table.States (857), 182, 55);
- Add_Goto (Table.States (857), 185, 56);
- Add_Goto (Table.States (857), 189, 57);
- Add_Goto (Table.States (857), 196, 59);
- Add_Goto (Table.States (857), 209, 61);
- Add_Goto (Table.States (857), 210, 62);
- Add_Goto (Table.States (857), 212, 63);
- Add_Goto (Table.States (857), 213, 64);
- Add_Goto (Table.States (857), 216, 65);
- Add_Goto (Table.States (857), 217, 66);
- Add_Goto (Table.States (857), 218, 67);
- Add_Goto (Table.States (857), 219, 68);
- Add_Goto (Table.States (857), 222, 70);
- Add_Goto (Table.States (857), 226, 72);
- Add_Goto (Table.States (857), 246, 75);
- Add_Goto (Table.States (857), 247, 76);
- Add_Goto (Table.States (857), 248, 77);
- Add_Goto (Table.States (857), 249, 78);
- Add_Goto (Table.States (857), 250, 79);
- Add_Goto (Table.States (857), 251, 80);
- Add_Goto (Table.States (857), 252, 81);
- Add_Goto (Table.States (857), 253, 82);
- Add_Goto (Table.States (857), 254, 83);
- Add_Goto (Table.States (857), 260, 397);
- Add_Goto (Table.States (857), 262, 85);
- Add_Goto (Table.States (857), 263, 86);
- Add_Goto (Table.States (857), 265, 88);
- Add_Goto (Table.States (857), 266, 89);
- Add_Goto (Table.States (857), 267, 90);
- Add_Goto (Table.States (857), 268, 91);
- Add_Goto (Table.States (857), 269, 1025);
- Add_Goto (Table.States (857), 274, 92);
- Add_Goto (Table.States (857), 284, 95);
- Add_Goto (Table.States (857), 292, 96);
- Add_Goto (Table.States (857), 307, 103);
- Add_Goto (Table.States (857), 308, 104);
- Add_Goto (Table.States (857), 310, 106);
- Add_Goto (Table.States (857), 311, 107);
- Add_Goto (Table.States (857), 312, 108);
- Add_Goto (Table.States (857), 314, 109);
- Add_Goto (Table.States (857), 316, 110);
- Add_Goto (Table.States (857), 319, 112);
- Add_Goto (Table.States (857), 320, 113);
- Add_Goto (Table.States (857), 322, 114);
- Add_Goto (Table.States (857), 328, 116);
- Add_Goto (Table.States (857), 334, 117);
- Table.States (857).Kernel := To_Vector ((((274, 0), 35, 5,
(2147483647, 0), 0), ((274, 1), 35, 2,
- (2147483647, 0), 0)));
- Table.States (857).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (162, 1), 0)));
- Table.States (858).Action_List.Set_Capacity (2);
- Add_Action (Table.States (858), 10, (230, 0), 1026);
- Add_Action (Table.States (858), 74, (307, 0), 1027);
- Table.States (858).Kernel := To_Vector ((((230, 0), 230, 2,
(2147483647, 0), 0), ((307, 0), 230, 3,
- (2147483647, 0), 0)));
- Table.States (858).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (307, 0), 74, 1027)));
- Table.States (859).Action_List.Set_Capacity (7);
- Add_Action (Table.States (859), 10, Reduce, (230, 1), 1,
interface_list_1'Access, null);
- Add_Action (Table.States (859), 74, Reduce, (230, 1), 1,
interface_list_1'Access, null);
- Add_Action (Table.States (859), 76, (118, 0), 237);
- Add_Action (Table.States (859), 87, (296, 0), 239);
- Add_Action (Table.States (859), 99, Reduce, (230, 1), 1,
interface_list_1'Access, null);
- Add_Action (Table.States (859), 104, (325, 0), 241);
- Add_Action (Table.States (859), 105, (325, 1), 242);
- Table.States (859).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (859), 118, 243);
- Add_Goto (Table.States (859), 325, 244);
- Table.States (859).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((230, 1), 242, 0,
- (230, 1), 1), ((242, 0), 242, 5, (2147483647, 0), 0), ((242,
1), 242, 2, (2147483647, 0), 0), ((275,
- 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (859).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (230, 1), 1)));
- Table.States (860).Action_List.Set_Capacity (2);
- Add_Action (Table.States (860), 99, Reduce, (223, 1), 0, null,
null);
- Add_Action (Table.States (860), 107, (223, 0), 151);
- Table.States (860).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (860), 223, 1028);
- Table.States (860).Kernel := To_Vector ((0 => ((269, 1), 24, 0,
(223, 1), 0)));
- Table.States (860).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (223, 1), 0)));
- Table.States (861).Action_List.Set_Capacity (16);
- Add_Action (Table.States (861), 24, Reduce, (162, 1), 0, null,
null);
- Add_Action (Table.States (861), 25, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (861), 28, (124, 0), 185);
- Add_Action (Table.States (861), 29, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (861), 30, (213, 0), 8);
- Add_Action (Table.States (861), 40, (249, 0), 12);
- Add_Action (Table.States (861), 46, (249, 1), 14);
- Add_Action (Table.States (861), 47, (216, 0), 15);
- Add_Action (Table.States (861), 48, (260, 0), 16);
- Add_Action (Table.States (861), 50, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (861), 51, (267, 0), 19);
- Add_Action (Table.States (861), 63, (316, 0), 25);
- Add_Action (Table.States (861), 66, (308, 0), 26);
- Add_Action (Table.States (861), 69, (209, 0), 27);
- Add_Action (Table.States (861), 71, (334, 0), 28);
- Add_Action (Table.States (861), 107, (222, 1), 187);
- Table.States (861).Goto_List.Set_Capacity (53);
- Add_Goto (Table.States (861), 115, 36);
- Add_Goto (Table.States (861), 124, 38);
- Add_Goto (Table.States (861), 130, 41);
- Add_Goto (Table.States (861), 137, 46);
- Add_Goto (Table.States (861), 138, 47);
- Add_Goto (Table.States (861), 160, 394);
- Add_Goto (Table.States (861), 161, 395);
- Add_Goto (Table.States (861), 162, 1029);
- Add_Goto (Table.States (861), 182, 55);
- Add_Goto (Table.States (861), 185, 56);
- Add_Goto (Table.States (861), 189, 57);
- Add_Goto (Table.States (861), 196, 59);
- Add_Goto (Table.States (861), 209, 61);
- Add_Goto (Table.States (861), 210, 62);
- Add_Goto (Table.States (861), 212, 63);
- Add_Goto (Table.States (861), 213, 64);
- Add_Goto (Table.States (861), 216, 65);
- Add_Goto (Table.States (861), 217, 66);
- Add_Goto (Table.States (861), 218, 67);
- Add_Goto (Table.States (861), 219, 68);
- Add_Goto (Table.States (861), 222, 70);
- Add_Goto (Table.States (861), 226, 72);
- Add_Goto (Table.States (861), 246, 75);
- Add_Goto (Table.States (861), 247, 76);
- Add_Goto (Table.States (861), 248, 77);
- Add_Goto (Table.States (861), 249, 78);
- Add_Goto (Table.States (861), 250, 79);
- Add_Goto (Table.States (861), 251, 80);
- Add_Goto (Table.States (861), 252, 81);
- Add_Goto (Table.States (861), 253, 82);
- Add_Goto (Table.States (861), 254, 83);
- Add_Goto (Table.States (861), 260, 397);
- Add_Goto (Table.States (861), 262, 85);
- Add_Goto (Table.States (861), 263, 86);
- Add_Goto (Table.States (861), 265, 88);
- Add_Goto (Table.States (861), 266, 89);
- Add_Goto (Table.States (861), 267, 90);
- Add_Goto (Table.States (861), 268, 91);
- Add_Goto (Table.States (861), 274, 92);
- Add_Goto (Table.States (861), 284, 95);
- Add_Goto (Table.States (861), 292, 96);
- Add_Goto (Table.States (861), 307, 103);
- Add_Goto (Table.States (861), 308, 104);
- Add_Goto (Table.States (861), 310, 106);
- Add_Goto (Table.States (861), 311, 107);
- Add_Goto (Table.States (861), 312, 108);
- Add_Goto (Table.States (861), 314, 109);
- Add_Goto (Table.States (861), 316, 110);
- Add_Goto (Table.States (861), 319, 112);
- Add_Goto (Table.States (861), 320, 113);
- Add_Goto (Table.States (861), 322, 114);
- Add_Goto (Table.States (861), 328, 116);
- Add_Goto (Table.States (861), 334, 117);
- Table.States (861).Kernel := To_Vector ((0 => ((269, 0), 49, 1,
(2147483647, 0), 0)));
- Table.States (861).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (162, 1), 0)));
- Table.States (862).Action_List.Set_Capacity (41);
- Add_Action (Table.States (862), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (307, 1), 6,
- single_protected_declaration_1'Access,
single_protected_declaration_1_check'Access);
- Table.States (862).Kernel := To_Vector ((0 => ((307, 1), 99, 0,
(307, 1), 6)));
- Table.States (862).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (307, 1), 6)));
- Table.States (863).Action_List.Set_Capacity (3);
- Add_Action (Table.States (863), (21, 85, 99), (295, 1), 1, null,
null);
- Table.States (863).Kernel := To_Vector ((0 => ((295, 1), 117, 0,
(295, 1), 1)));
- Table.States (863).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (295, 1), 1)));
- Table.States (864).Action_List.Set_Capacity (3);
- Add_Action (Table.States (864), 21, Reduce, (197, 1), 5,
extended_return_object_declaration_1'Access,
- null);
- Add_Action (Table.States (864), 85, (197, 0), 1030);
- Add_Action (Table.States (864), 99, Reduce, (197, 1), 5,
extended_return_object_declaration_1'Access,
- null);
- Table.States (864).Kernel := To_Vector ((((197, 0), 295, 1,
(2147483647, 0), 0), ((197, 1), 295, 0,
- (197, 1), 5)));
- Table.States (864).Minimal_Complete_Actions := To_Vector (((Shift,
(197, 0), 85, 1030), (Reduce, (197, 1),
- 5)));
- Table.States (865).Action_List.Set_Capacity (3);
- Add_Action (Table.States (865), (21, 85, 99), (295, 0), 1, null,
null);
- Table.States (865).Kernel := To_Vector ((0 => ((295, 0), 317, 0,
(295, 0), 1)));
- Table.States (865).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (295, 0), 1)));
- Table.States (866).Action_List.Set_Capacity (1);
- Add_Action (Table.States (866), 99, (199, 0), 1031);
- Table.States (866).Kernel := To_Vector ((0 => ((199, 0), 58, 1,
(2147483647, 0), 0)));
- Table.States (866).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (199, 0), 99, 1031)));
- Table.States (867).Action_List.Set_Capacity (4);
- Add_Action (Table.States (867), 81, (242, 8), 31);
- Add_Action (Table.States (867), 107, (242, 5), 120);
- Add_Action (Table.States (867), 108, (242, 7), 34);
- Add_Action (Table.States (867), 109, (242, 6), 35);
- Table.States (867).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (867), 131, 42);
- Add_Goto (Table.States (867), 242, 1032);
- Add_Goto (Table.States (867), 275, 93);
- Add_Goto (Table.States (867), 296, 98);
- Table.States (867).Kernel := To_Vector ((((250, 0), 14, 5,
(2147483647, 0), 0), ((250, 1), 14, 4,
- (2147483647, 0), 0)));
- Table.States (867).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (868).Action_List.Set_Capacity (1);
- Add_Action (Table.States (868), 107, (267, 0), 1033);
- Table.States (868).Kernel := To_Vector ((0 => ((267, 0), 14, 4,
(2147483647, 0), 0)));
- Table.States (868).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (267, 0), 107, 1033)));
- Table.States (869).Action_List.Set_Capacity (1);
- Add_Action (Table.States (869), 107, (319, 0), 1034);
- Table.States (869).Kernel := To_Vector ((0 => ((319, 0), 14, 5,
(2147483647, 0), 0)));
- Table.States (869).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (319, 0), 107, 1034)));
- Table.States (870).Action_List.Set_Capacity (2);
- Add_Action (Table.States (870), 35, Reduce, (125, 1), 0, null,
null);
- Add_Action (Table.States (870), 74, (125, 0), 340);
- Table.States (870).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (870), 125, 1035);
- Table.States (870).Kernel := To_Vector ((0 => ((310, 0), 315, 4,
(2147483647, 0), 0)));
- Table.States (870).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (871).Action_List.Set_Capacity (3);
- Add_Action (Table.States (871), (22, 24, 43), (298, 1), 5,
select_alternative_1'Access, null);
- Table.States (871).Kernel := To_Vector ((0 => ((298, 1), 99, 0,
(298, 1), 5)));
- Table.States (871).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (298, 1), 5)));
- Table.States (872).Action_List.Set_Capacity (3);
- Add_Action (Table.States (872), (22, 24, 43), (298, 0), 5,
select_alternative_0'Access, null);
- Table.States (872).Kernel := To_Vector ((0 => ((298, 0), 303, 0,
(298, 0), 5)));
- Table.States (872).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (298, 0), 5)));
- Table.States (873).Action_List.Set_Capacity (1);
- Add_Action (Table.States (873), 99, (155, 0), 1036);
- Table.States (873).Kernel := To_Vector ((0 => ((155, 0), 61, 1,
(2147483647, 0), 0)));
- Table.States (873).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (155, 0), 99, 1036)));
- Table.States (874).Action_List.Set_Capacity (1);
- Add_Action (Table.States (874), 99, (326, 0), 1037);
- Table.States (874).Kernel := To_Vector ((0 => ((326, 0), 61, 1,
(2147483647, 0), 0)));
- Table.States (874).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (326, 0), 99, 1037)));
- Table.States (875).Action_List.Set_Capacity (1);
- Add_Action (Table.States (875), 99, (297, 0), 1038);
- Table.States (875).Kernel := To_Vector ((0 => ((297, 0), 61, 1,
(2147483647, 0), 0)));
- Table.States (875).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (297, 0), 99, 1038)));
- Table.States (876).Action_List.Set_Capacity (1);
- Add_Action (Table.States (876), 61, (129, 0), 1039);
- Table.States (876).Kernel := To_Vector ((0 => ((129, 0), 24, 2,
(2147483647, 0), 0)));
- Table.States (876).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (129, 0), 61, 1039)));
- Table.States (877).Action_List.Set_Capacity (41);
- Add_Action (Table.States (877), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (316, 0), 6,
- subtype_declaration_0'Access, null);
- Table.States (877).Kernel := To_Vector ((0 => ((316, 0), 99, 0,
(316, 0), 6)));
- Table.States (877).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (316, 0), 6)));
- Table.States (878).Action_List.Set_Capacity (1);
- Add_Action (Table.States (878), 99, (320, 0), 1040);
- Table.States (878).Kernel := To_Vector ((0 => ((320, 0), 125, 1,
(2147483647, 0), 0)));
- Table.States (878).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (320, 0), 99, 1040)));
- Table.States (879).Action_List.Set_Capacity (1);
- Add_Action (Table.States (879), 13, (319, 0), 1041);
- Table.States (879).Kernel := To_Vector ((0 => ((319, 0), 162, 3,
(2147483647, 0), 0)));
- Table.States (879).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (319, 0), 13, 1041)));
- Table.States (880).Action_List.Set_Capacity (18);
- Add_Action (Table.States (880), 24, Reduce, (162, 1), 0, null,
null);
- Add_Action (Table.States (880), 25, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (880), 28, (124, 0), 185);
- Add_Action (Table.States (880), 29, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (880), 30, (213, 0), 8);
- Add_Action (Table.States (880), 39, (322, 0), 1042);
- Add_Action (Table.States (880), 40, (249, 0), 12);
- Add_Action (Table.States (880), 46, (249, 1), 14);
- Add_Action (Table.States (880), 47, (216, 0), 15);
- Add_Action (Table.States (880), 48, (260, 0), 16);
- Add_Action (Table.States (880), 49, Reduce, (162, 1), 0, null,
null);
- Add_Action (Table.States (880), 50, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (880), 51, (267, 0), 19);
- Add_Action (Table.States (880), 63, (316, 0), 25);
- Add_Action (Table.States (880), 66, (308, 0), 26);
- Add_Action (Table.States (880), 69, (209, 0), 27);
- Add_Action (Table.States (880), 71, (334, 0), 28);
- Add_Action (Table.States (880), 107, (222, 1), 187);
- Table.States (880).Goto_List.Set_Capacity (54);
- Add_Goto (Table.States (880), 115, 36);
- Add_Goto (Table.States (880), 124, 38);
- Add_Goto (Table.States (880), 130, 41);
- Add_Goto (Table.States (880), 137, 46);
- Add_Goto (Table.States (880), 138, 47);
- Add_Goto (Table.States (880), 160, 394);
- Add_Goto (Table.States (880), 161, 395);
- Add_Goto (Table.States (880), 162, 706);
- Add_Goto (Table.States (880), 182, 55);
- Add_Goto (Table.States (880), 185, 56);
- Add_Goto (Table.States (880), 189, 57);
- Add_Goto (Table.States (880), 196, 59);
- Add_Goto (Table.States (880), 209, 61);
- Add_Goto (Table.States (880), 210, 62);
- Add_Goto (Table.States (880), 212, 63);
- Add_Goto (Table.States (880), 213, 64);
- Add_Goto (Table.States (880), 216, 65);
- Add_Goto (Table.States (880), 217, 66);
- Add_Goto (Table.States (880), 218, 67);
- Add_Goto (Table.States (880), 219, 68);
- Add_Goto (Table.States (880), 222, 70);
- Add_Goto (Table.States (880), 226, 72);
- Add_Goto (Table.States (880), 246, 75);
- Add_Goto (Table.States (880), 247, 76);
- Add_Goto (Table.States (880), 248, 77);
- Add_Goto (Table.States (880), 249, 78);
- Add_Goto (Table.States (880), 250, 79);
- Add_Goto (Table.States (880), 251, 80);
- Add_Goto (Table.States (880), 252, 81);
- Add_Goto (Table.States (880), 253, 82);
- Add_Goto (Table.States (880), 254, 83);
- Add_Goto (Table.States (880), 260, 397);
- Add_Goto (Table.States (880), 262, 85);
- Add_Goto (Table.States (880), 263, 86);
- Add_Goto (Table.States (880), 265, 88);
- Add_Goto (Table.States (880), 266, 89);
- Add_Goto (Table.States (880), 267, 90);
- Add_Goto (Table.States (880), 268, 91);
- Add_Goto (Table.States (880), 274, 92);
- Add_Goto (Table.States (880), 284, 95);
- Add_Goto (Table.States (880), 292, 96);
- Add_Goto (Table.States (880), 307, 103);
- Add_Goto (Table.States (880), 308, 104);
- Add_Goto (Table.States (880), 310, 106);
- Add_Goto (Table.States (880), 311, 107);
- Add_Goto (Table.States (880), 312, 108);
- Add_Goto (Table.States (880), 314, 109);
- Add_Goto (Table.States (880), 316, 110);
- Add_Goto (Table.States (880), 319, 112);
- Add_Goto (Table.States (880), 320, 113);
- Add_Goto (Table.States (880), 321, 1043);
- Add_Goto (Table.States (880), 322, 114);
- Add_Goto (Table.States (880), 328, 116);
- Add_Goto (Table.States (880), 334, 117);
- Table.States (880).Kernel := To_Vector ((((322, 0), 35, 5,
(2147483647, 0), 0), ((322, 1), 35, 2,
- (2147483647, 0), 0)));
- Table.States (880).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (321, 1), 0)));
- Table.States (881).Action_List.Set_Capacity (41);
- Add_Action (Table.States (881), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (322, 2), 6,
- task_type_declaration_2'Access, null);
- Table.States (881).Kernel := To_Vector ((0 => ((322, 2), 99, 0,
(322, 2), 6)));
- Table.States (881).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (322, 2), 6)));
- Table.States (882).Action_List.Set_Capacity (2);
- Add_Action (Table.States (882), 10, (230, 0), 1026);
- Add_Action (Table.States (882), 74, (308, 0), 1044);
- Table.States (882).Kernel := To_Vector ((((230, 0), 230, 2,
(2147483647, 0), 0), ((308, 0), 230, 3,
- (2147483647, 0), 0)));
- Table.States (882).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (308, 0), 74, 1044)));
- end Subr_16;
- procedure Subr_17
- is begin
- Table.States (883).Action_List.Set_Capacity (16);
- Add_Action (Table.States (883), 24, Reduce, (162, 1), 0, null,
null);
- Add_Action (Table.States (883), 25, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (883), 28, (124, 0), 185);
- Add_Action (Table.States (883), 29, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (883), 30, (213, 0), 8);
- Add_Action (Table.States (883), 40, (249, 0), 12);
- Add_Action (Table.States (883), 46, (249, 1), 14);
- Add_Action (Table.States (883), 47, (216, 0), 15);
- Add_Action (Table.States (883), 48, (260, 0), 16);
- Add_Action (Table.States (883), 50, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (883), 51, (267, 0), 19);
- Add_Action (Table.States (883), 63, (316, 0), 25);
- Add_Action (Table.States (883), 66, (308, 0), 26);
- Add_Action (Table.States (883), 69, (209, 0), 27);
- Add_Action (Table.States (883), 71, (334, 0), 28);
- Add_Action (Table.States (883), 107, (222, 1), 187);
- Table.States (883).Goto_List.Set_Capacity (53);
- Add_Goto (Table.States (883), 115, 36);
- Add_Goto (Table.States (883), 124, 38);
- Add_Goto (Table.States (883), 130, 41);
- Add_Goto (Table.States (883), 137, 46);
- Add_Goto (Table.States (883), 138, 47);
- Add_Goto (Table.States (883), 160, 394);
- Add_Goto (Table.States (883), 161, 395);
- Add_Goto (Table.States (883), 162, 1045);
- Add_Goto (Table.States (883), 182, 55);
- Add_Goto (Table.States (883), 185, 56);
- Add_Goto (Table.States (883), 189, 57);
- Add_Goto (Table.States (883), 196, 59);
- Add_Goto (Table.States (883), 209, 61);
- Add_Goto (Table.States (883), 210, 62);
- Add_Goto (Table.States (883), 212, 63);
- Add_Goto (Table.States (883), 213, 64);
- Add_Goto (Table.States (883), 216, 65);
- Add_Goto (Table.States (883), 217, 66);
- Add_Goto (Table.States (883), 218, 67);
- Add_Goto (Table.States (883), 219, 68);
- Add_Goto (Table.States (883), 222, 70);
- Add_Goto (Table.States (883), 226, 72);
- Add_Goto (Table.States (883), 246, 75);
- Add_Goto (Table.States (883), 247, 76);
- Add_Goto (Table.States (883), 248, 77);
- Add_Goto (Table.States (883), 249, 78);
- Add_Goto (Table.States (883), 250, 79);
- Add_Goto (Table.States (883), 251, 80);
- Add_Goto (Table.States (883), 252, 81);
- Add_Goto (Table.States (883), 253, 82);
- Add_Goto (Table.States (883), 254, 83);
- Add_Goto (Table.States (883), 260, 397);
- Add_Goto (Table.States (883), 262, 85);
- Add_Goto (Table.States (883), 263, 86);
- Add_Goto (Table.States (883), 265, 88);
- Add_Goto (Table.States (883), 266, 89);
- Add_Goto (Table.States (883), 267, 90);
- Add_Goto (Table.States (883), 268, 91);
- Add_Goto (Table.States (883), 274, 92);
- Add_Goto (Table.States (883), 284, 95);
- Add_Goto (Table.States (883), 292, 96);
- Add_Goto (Table.States (883), 307, 103);
- Add_Goto (Table.States (883), 308, 104);
- Add_Goto (Table.States (883), 310, 106);
- Add_Goto (Table.States (883), 311, 107);
- Add_Goto (Table.States (883), 312, 108);
- Add_Goto (Table.States (883), 314, 109);
- Add_Goto (Table.States (883), 316, 110);
- Add_Goto (Table.States (883), 319, 112);
- Add_Goto (Table.States (883), 320, 113);
- Add_Goto (Table.States (883), 322, 114);
- Add_Goto (Table.States (883), 328, 116);
- Add_Goto (Table.States (883), 334, 117);
- Table.States (883).Kernel := To_Vector ((0 => ((321, 0), 49, 0,
(162, 1), 0)));
- Table.States (883).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (162, 1), 0)));
- Table.States (884).Action_List.Set_Capacity (2);
- Add_Action (Table.States (884), 99, Reduce, (223, 1), 0, null,
null);
- Add_Action (Table.States (884), 107, (223, 0), 151);
- Table.States (884).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (884), 223, 1046);
- Table.States (884).Kernel := To_Vector ((0 => ((308, 1), 24, 1,
(2147483647, 0), 0)));
- Table.States (884).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (223, 1), 0)));
- Table.States (885).Action_List.Set_Capacity (2);
- Add_Action (Table.States (885), (78, 99), (174, 0), 3, null,
null);
- Table.States (885).Kernel := To_Vector ((0 => ((174, 0), 173, 0,
(174, 0), 3)));
- Table.States (885).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (174, 0), 3)));
- Table.States (886).Action_List.Set_Capacity (1);
- Add_Action (Table.States (886), 41, (244, 0), 1047);
- Table.States (886).Kernel := To_Vector ((((244, 0), 40, 1,
(2147483647, 0), 0), ((245, 2), 40, 2,
- (2147483647, 0), 0), ((245, 3), 40, 4, (2147483647, 0), 0)));
- Table.States (886).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (244, 0), 41, 1047)));
- Table.States (887).Action_List.Set_Capacity (7);
- Add_Action (Table.States (887), 76, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (887), 78, Reduce, (245, 0), 1,
null_exclusion_opt_name_type_0'Access, null);
- Add_Action (Table.States (887), 85, Reduce, (245, 0), 1,
null_exclusion_opt_name_type_0'Access, null);
- Add_Action (Table.States (887), 87, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (887), 99, Reduce, (245, 0), 1,
null_exclusion_opt_name_type_0'Access, null);
- Add_Action (Table.States (887), 104, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (887), 105, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Table.States (887).Kernel := To_Vector ((((242, 5), 107, 0,
(242, 5), 1), ((245, 0), 107, 0, (245, 0),
- 1)));
- Table.States (887).Minimal_Complete_Actions := To_Vector
(((Reduce, (242, 5), 1), (Reduce, (245, 0),
- 1)));
- Table.States (888).Action_List.Set_Capacity (3);
- Add_Action (Table.States (888), 78, Reduce, (173, 3), 3, null,
null);
- Add_Action (Table.States (888), 85, (173, 1), 1048);
- Add_Action (Table.States (888), 99, Reduce, (173, 3), 3, null,
null);
- Table.States (888).Kernel := To_Vector ((((173, 1), 117, 1,
(2147483647, 0), 0), ((173, 3), 117, 0,
- (173, 3), 3)));
- Table.States (888).Minimal_Complete_Actions := To_Vector (((Shift,
(173, 1), 85, 1048), (Reduce, (173, 3),
- 3)));
- Table.States (889).Action_List.Set_Capacity (4);
- Add_Action (Table.States (889), 76, (118, 0), 237);
- Add_Action (Table.States (889), 87, (296, 0), 239);
- Add_Action (Table.States (889), 104, (325, 0), 241);
- Add_Action (Table.States (889), 105, (325, 1), 242);
- Table.States (889).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (889), 118, 243);
- Add_Goto (Table.States (889), 325, 244);
- Table.States (889).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((242, 0), 242, 5,
- (2147483647, 0), 0), ((242, 1), 242, 2, (2147483647, 0), 0),
((275, 0), 242, 3, (2147483647, 0), 0),
- ((296, 0), 242, 2, (2147483647, 0), 0), ((296, 1), 242, 2,
(2147483647, 0), 0), ((296, 2), 242, 2,
- (2147483647, 0), 0), ((296, 3), 242, 2, (2147483647, 0), 0)));
- Table.States (890).Action_List.Set_Capacity (3);
- Add_Action (Table.States (890), 78, Reduce, (173, 2), 3, null,
null);
- Add_Action (Table.States (890), 85, (173, 0), 1049);
- Add_Action (Table.States (890), 99, Reduce, (173, 2), 3, null,
null);
- Table.States (890).Kernel := To_Vector ((((173, 0), 245, 1,
(2147483647, 0), 0), ((173, 2), 245, 0,
- (173, 2), 3)));
- Table.States (890).Minimal_Complete_Actions := To_Vector (((Shift,
(173, 0), 85, 1049), (Reduce, (173, 2),
- 3)));
- Table.States (891).Action_List.Set_Capacity (7);
- Add_Action (Table.States (891), 76, Reduce, (242, 2), 1, null,
name_2_check'Access);
- Add_Action (Table.States (891), 78, Reduce, (245, 1), 1,
null_exclusion_opt_name_type_1'Access, null);
- Add_Action (Table.States (891), 85, Reduce, (245, 1), 1,
null_exclusion_opt_name_type_1'Access, null);
- Add_Action (Table.States (891), 87, Reduce, (242, 2), 1, null,
name_2_check'Access);
- Add_Action (Table.States (891), 99, Reduce, (245, 1), 1,
null_exclusion_opt_name_type_1'Access, null);
- Add_Action (Table.States (891), 104, Reduce, (242, 2), 1, null,
name_2_check'Access);
- Add_Action (Table.States (891), 105, Reduce, (242, 2), 1, null,
name_2_check'Access);
- Table.States (891).Kernel := To_Vector ((((242, 2), 296, 0,
(242, 2), 1), ((245, 1), 296, 0, (245, 1),
- 1)));
- Table.States (891).Minimal_Complete_Actions := To_Vector
(((Reduce, (242, 2), 1), (Reduce, (245, 1),
- 1)));
- Table.States (892).Action_List.Set_Capacity (1);
- Add_Action (Table.States (892), 39, Reduce, (112, 0), 2, null,
null);
- Add_Conflict (Table.States (892), 39, (113, 0), 2, null, null);
- Table.States (892).Kernel := To_Vector ((((112, 0), 36, 0, (112,
0), 2), ((113, 0), 36, 0, (113, 0),
- 2)));
- Table.States (892).Minimal_Complete_Actions := To_Vector
(((Reduce, (112, 0), 2), (Reduce, (113, 0),
- 2)));
- Table.States (893).Action_List.Set_Capacity (1);
- Add_Action (Table.States (893), (1 => 39), (112, 1), 2, null,
null);
- Table.States (893).Kernel := To_Vector ((0 => ((112, 1), 64, 0,
(112, 1), 2)));
- Table.States (893).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (112, 1), 2)));
- Table.States (894).Action_List.Set_Capacity (4);
- Add_Action (Table.States (894), 36, (114, 0), 1050);
- Add_Action (Table.States (894), 41, Reduce, (114, 1), 2, null,
null);
- Add_Action (Table.States (894), 49, Reduce, (114, 1), 2, null,
null);
- Add_Action (Table.States (894), 54, Reduce, (114, 1), 2, null,
null);
- Table.States (894).Kernel := To_Vector ((((114, 0), 65, 1,
(2147483647, 0), 0), ((114, 1), 65, 0,
- (114, 1), 2)));
- Table.States (894).Minimal_Complete_Actions := To_Vector (((Shift,
(114, 0), 36, 1050), (Reduce, (114, 1),
- 2)));
- Table.States (895).Action_List.Set_Capacity (13);
- Add_Action (Table.States (895), 3, (200, 2), 122);
- Add_Action (Table.States (895), 39, (261, 4), 123);
- Add_Action (Table.States (895), 40, (200, 3), 481);
- Add_Action (Table.States (895), 41, (261, 1), 125);
- Add_Action (Table.States (895), 76, (120, 0), 127);
- Add_Action (Table.States (895), 77, (120, 5), 128);
- Add_Action (Table.States (895), 81, (242, 8), 31);
- Add_Action (Table.States (895), 97, (333, 1), 129);
- Add_Action (Table.States (895), 98, (333, 0), 130);
- Add_Action (Table.States (895), 106, (261, 0), 131);
- Add_Action (Table.States (895), 107, (242, 5), 120);
- Add_Action (Table.States (895), 108, (242, 7), 34);
- Add_Action (Table.States (895), 109, (242, 6), 35);
- Table.States (895).Goto_List.Set_Capacity (17);
- Add_Goto (Table.States (895), 120, 132);
- Add_Goto (Table.States (895), 131, 42);
- Add_Goto (Table.States (895), 170, 793);
- Add_Goto (Table.States (895), 171, 1051);
- Add_Goto (Table.States (895), 200, 135);
- Add_Goto (Table.States (895), 228, 1052);
- Add_Goto (Table.States (895), 229, 1053);
- Add_Goto (Table.States (895), 242, 1054);
- Add_Goto (Table.States (895), 261, 137);
- Add_Goto (Table.States (895), 275, 93);
- Add_Goto (Table.States (895), 280, 485);
- Add_Goto (Table.States (895), 296, 98);
- Add_Goto (Table.States (895), 304, 486);
- Add_Goto (Table.States (895), 317, 487);
- Add_Goto (Table.States (895), 323, 146);
- Add_Goto (Table.States (895), 324, 147);
- Add_Goto (Table.States (895), 333, 148);
- Table.States (895).Kernel := To_Vector ((((123, 0), 76, 6,
(2147483647, 0), 0), ((123, 1), 76, 6,
- (2147483647, 0), 0)));
- Table.States (895).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (896).Action_List.Set_Capacity (4);
- Add_Action (Table.States (896), 20, (329, 4), 1055);
- Add_Action (Table.States (896), 53, (282, 0), 1056);
- Add_Action (Table.States (896), 74, Reduce, (282, 1), 0, null,
null);
- Add_Action (Table.States (896), 99, Reduce, (282, 1), 0, null,
null);
- Table.States (896).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (896), 282, 1057);
- Table.States (896).Kernel := To_Vector ((((329, 4), 195, 1,
(2147483647, 0), 0), ((329, 5), 195, 0,
- (282, 1), 0)));
- Table.States (896).Minimal_Complete_Actions := To_Vector (((Shift,
(329, 4), 20, 1055), (Reduce, (282, 1),
- 0)));
- Table.States (897).Action_List.Set_Capacity (3);
- Add_Action (Table.States (897), 53, (282, 0), 1056);
- Add_Action (Table.States (897), 74, Reduce, (282, 1), 0, null,
null);
- Add_Action (Table.States (897), 99, Reduce, (282, 1), 0, null,
null);
- Table.States (897).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (897), 282, 1058);
- Table.States (897).Kernel := To_Vector ((0 => ((329, 3), 195, 0,
(282, 1), 0)));
- Table.States (897).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (282, 1), 0)));
- Table.States (898).Action_List.Set_Capacity (3);
- Add_Action (Table.States (898), 10, (231, 0), 1059);
- Add_Action (Table.States (898), 74, Reduce, (231, 4), 2, null,
null);
- Add_Action (Table.States (898), 99, Reduce, (231, 4), 2, null,
null);
- Table.States (898).Kernel := To_Vector ((((231, 0), 34, 2,
(2147483647, 0), 0), ((231, 4), 34, 0,
- (231, 4), 2)));
- Table.States (898).Minimal_Complete_Actions := To_Vector (((Shift,
(231, 0), 10, 1059), (Reduce, (231, 4),
- 2)));
- Table.States (899).Action_List.Set_Capacity (2);
- Add_Action (Table.States (899), (74, 99), (329, 2), 2, null,
null);
- Table.States (899).Kernel := To_Vector ((0 => ((329, 2), 195, 0,
(329, 2), 2)));
- Table.States (899).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (329, 2), 2)));
- Table.States (900).Action_List.Set_Capacity (2);
- Add_Action (Table.States (900), (74, 99), (283, 1), 2, null,
null);
- Table.States (900).Kernel := To_Vector ((0 => ((283, 1), 54, 0,
(283, 1), 2)));
- Table.States (900).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (283, 1), 2)));
- Table.States (901).Action_List.Set_Capacity (3);
- Add_Action (Table.States (901), 10, (231, 2), 1060);
- Add_Action (Table.States (901), 74, Reduce, (231, 6), 2, null,
null);
- Add_Action (Table.States (901), 99, Reduce, (231, 6), 2, null,
null);
- Table.States (901).Kernel := To_Vector ((((231, 2), 34, 2,
(2147483647, 0), 0), ((231, 6), 34, 0,
- (231, 6), 2)));
- Table.States (901).Minimal_Complete_Actions := To_Vector (((Shift,
(231, 2), 10, 1060), (Reduce, (231, 6),
- 2)));
- Table.States (902).Action_List.Set_Capacity (1);
- Add_Action (Table.States (902), 88, (329, 1), 1061);
- Table.States (902).Kernel := To_Vector ((0 => ((329, 1), 304, 2,
(2147483647, 0), 0)));
- Table.States (902).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (329, 1), 88, 1061)));
- Table.States (903).Action_List.Set_Capacity (3);
- Add_Action (Table.States (903), 35, Reduce, (167, 1), 0, null,
null);
- Add_Action (Table.States (903), 107, (166, 0), 1062);
- Add_Action (Table.States (903), 108, (166, 1), 1063);
- Table.States (903).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (903), 166, 1064);
- Add_Goto (Table.States (903), 167, 1065);
- Table.States (903).Kernel := To_Vector ((0 => ((330, 0), 15, 6,
(2147483647, 0), 0)));
- Table.States (903).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (167, 1), 0)));
- Table.States (904).Action_List.Set_Capacity (1);
- Add_Action (Table.States (904), 99, (152, 4), 1066);
- Table.States (904).Kernel := To_Vector ((0 => ((152, 4), 41, 1,
(2147483647, 0), 0)));
- Table.States (904).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (152, 4), 99, 1066)));
- Table.States (905).Action_List.Set_Capacity (5);
- Add_Action (Table.States (905), (15, 24, 28, 72, 107), (151, 1),
1, null, null);
- Table.States (905).Kernel := To_Vector ((0 => ((151, 1), 124, 0,
(151, 1), 1)));
- Table.States (905).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (151, 1), 1)));
- Table.States (906).Action_List.Set_Capacity (5);
- Add_Action (Table.States (906), (15, 24, 28, 72, 107), (151, 0),
1, null, null);
- Table.States (906).Kernel := To_Vector ((0 => ((151, 0), 149, 0,
(151, 0), 1)));
- Table.States (906).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (151, 0), 1)));
- Table.States (907).Action_List.Set_Capacity (5);
- Add_Action (Table.States (907), (15, 24, 28, 72, 107), (152, 2),
1, null, null);
- Table.States (907).Kernel := To_Vector ((0 => ((152, 2), 151, 0,
(152, 2), 1)));
- Table.States (907).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (152, 2), 1)));
- Table.States (908).Action_List.Set_Capacity (5);
- Add_Action (Table.States (908), 15, (330, 0), 903);
- Add_Action (Table.States (908), 24, Reduce, (153, 0), 1, null,
null);
- Add_Action (Table.States (908), 28, (124, 0), 185);
- Add_Action (Table.States (908), 72, Reduce, (153, 0), 1, null,
null);
- Add_Action (Table.States (908), 107, (222, 1), 166);
- Table.States (908).Goto_List.Set_Capacity (8);
- Add_Goto (Table.States (908), 124, 905);
- Add_Goto (Table.States (908), 130, 41);
- Add_Goto (Table.States (908), 149, 906);
- Add_Goto (Table.States (908), 151, 1067);
- Add_Goto (Table.States (908), 185, 56);
- Add_Goto (Table.States (908), 222, 910);
- Add_Goto (Table.States (908), 284, 95);
- Add_Goto (Table.States (908), 330, 1068);
- Table.States (908).Kernel := To_Vector ((((152, 0), 152, 4,
(2147483647, 0), 0), ((152, 1), 152, 7,
- (2147483647, 0), 0), ((153, 0), 152, 0, (153, 0), 1)));
- Table.States (908).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (153, 0), 1)));
- Table.States (909).Action_List.Set_Capacity (1);
- Add_Action (Table.States (909), 24, (283, 0), 1069);
- Table.States (909).Kernel := To_Vector ((0 => ((283, 0), 153, 2,
(2147483647, 0), 0)));
- Table.States (909).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (283, 0), 24, 1069)));
- Table.States (910).Action_List.Set_Capacity (2);
- Add_Action (Table.States (910), 84, (149, 0), 1070);
- Add_Action (Table.States (910), 86, (222, 0), 236);
- Table.States (910).Kernel := To_Vector ((((149, 0), 222, 4,
(2147483647, 0), 0), ((149, 1), 222, 3,
- (2147483647, 0), 0), ((222, 0), 222, 2, (2147483647, 0), 0)));
- Table.States (910).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (149, 0), 84, 1070)));
- Table.States (911).Action_List.Set_Capacity (5);
- Add_Action (Table.States (911), (15, 24, 28, 72, 107), (152, 3),
1, null, null);
- Table.States (911).Kernel := To_Vector ((0 => ((152, 3), 330, 0,
(152, 3), 1)));
- Table.States (911).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (152, 3), 1)));
- Table.States (912).Action_List.Set_Capacity (3);
- Add_Action (Table.States (912), 10, (231, 3), 1071);
- Add_Action (Table.States (912), 74, Reduce, (231, 7), 2, null,
null);
- Add_Action (Table.States (912), 99, Reduce, (231, 7), 2, null,
null);
- Table.States (912).Kernel := To_Vector ((((231, 3), 34, 2,
(2147483647, 0), 0), ((231, 7), 34, 0,
- (231, 7), 2)));
- Table.States (912).Minimal_Complete_Actions := To_Vector (((Shift,
(231, 3), 10, 1071), (Reduce, (231, 7),
- 2)));
- Table.States (913).Action_List.Set_Capacity (3);
- Add_Action (Table.States (913), (41, 49, 54), (114, 2), 2, null,
null);
- Table.States (913).Kernel := To_Vector ((0 => ((114, 2), 36, 0,
(114, 2), 2)));
- Table.States (913).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (114, 2), 2)));
- Table.States (914).Action_List.Set_Capacity (41);
- Add_Action (Table.States (914), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (226, 0), 6,
- incomplete_type_declaration_0'Access, null);
- Table.States (914).Kernel := To_Vector ((0 => ((226, 0), 99, 0,
(226, 0), 6)));
- Table.States (914).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (226, 0), 6)));
- Table.States (915).Action_List.Set_Capacity (3);
- Add_Action (Table.States (915), 10, (231, 1), 1072);
- Add_Action (Table.States (915), 74, Reduce, (231, 5), 2, null,
null);
- Add_Action (Table.States (915), 99, Reduce, (231, 5), 2, null,
null);
- Table.States (915).Kernel := To_Vector ((((231, 1), 34, 2,
(2147483647, 0), 0), ((231, 5), 34, 0,
- (231, 5), 2)));
- Table.States (915).Minimal_Complete_Actions := To_Vector (((Shift,
(231, 1), 10, 1072), (Reduce, (231, 5),
- 2)));
- Table.States (916).Action_List.Set_Capacity (2);
- Add_Action (Table.States (916), (78, 86), (183, 0), 1, null,
null);
- Table.States (916).Kernel := To_Vector ((0 => ((183, 0), 107, 0,
(183, 0), 1)));
- Table.States (916).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (183, 0), 1)));
- Table.States (917).Action_List.Set_Capacity (2);
- Add_Action (Table.States (917), (78, 86), (183, 1), 1, null,
null);
- Table.States (917).Kernel := To_Vector ((0 => ((183, 1), 109, 0,
(183, 1), 1)));
- Table.States (917).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (183, 1), 1)));
- Table.States (918).Action_List.Set_Capacity (2);
- Add_Action (Table.States (918), (78, 86), (184, 1), 1, null,
null);
- Table.States (918).Kernel := To_Vector ((0 => ((184, 1), 183, 0,
(184, 1), 1)));
- Table.States (918).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (184, 1), 1)));
- Table.States (919).Action_List.Set_Capacity (2);
- Add_Action (Table.States (919), 78, (186, 0), 1073);
- Add_Action (Table.States (919), 86, (184, 0), 1074);
- Table.States (919).Kernel := To_Vector ((((184, 0), 184, 2,
(2147483647, 0), 0), ((186, 0), 184, 1,
- (2147483647, 0), 0)));
- Table.States (919).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (186, 0), 78, 1073)));
- Table.States (920).Action_List.Set_Capacity (5);
- Add_Action (Table.States (920), 40, (317, 0), 490);
- Add_Action (Table.States (920), 81, (242, 8), 31);
- Add_Action (Table.States (920), 107, (242, 5), 120);
- Add_Action (Table.States (920), 108, (242, 7), 34);
- Add_Action (Table.States (920), 109, (242, 6), 35);
- Table.States (920).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (920), 131, 42);
- Add_Goto (Table.States (920), 242, 491);
- Add_Goto (Table.States (920), 275, 93);
- Add_Goto (Table.States (920), 296, 98);
- Add_Goto (Table.States (920), 317, 1075);
- Table.States (920).Kernel := To_Vector ((0 => ((262, 0), 39, 4,
(2147483647, 0), 0)));
- Table.States (920).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (921).Action_List.Set_Capacity (4);
- Add_Action (Table.States (921), 81, (242, 8), 31);
- Add_Action (Table.States (921), 107, (242, 5), 120);
- Add_Action (Table.States (921), 108, (242, 7), 34);
- Add_Action (Table.States (921), 109, (242, 6), 35);
- Table.States (921).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (921), 131, 42);
- Add_Goto (Table.States (921), 242, 1076);
- Add_Goto (Table.States (921), 275, 93);
- Add_Goto (Table.States (921), 296, 98);
- Table.States (921).Kernel := To_Vector ((((165, 0), 39, 4,
(2147483647, 0), 0), ((165, 1), 39, 1,
- (2147483647, 0), 0)));
- Table.States (921).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (922).Action_List.Set_Capacity (2);
- Add_Action (Table.States (922), 74, (125, 0), 340);
- Add_Action (Table.States (922), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (922).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (922), 125, 1077);
- Table.States (922).Kernel := To_Vector ((0 => ((263, 0), 49, 1,
(2147483647, 0), 0)));
- Table.States (922).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (923).Action_List.Set_Capacity (2);
- Add_Action (Table.States (923), (74, 99), (329, 7), 2, null,
null);
- Table.States (923).Kernel := To_Vector ((0 => ((329, 7), 283, 0,
(329, 7), 2)));
- Table.States (923).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (329, 7), 2)));
- Table.States (924).Action_List.Set_Capacity (1);
- Add_Action (Table.States (924), 99, (209, 0), 1078);
- Table.States (924).Kernel := To_Vector ((0 => ((209, 0), 125, 1,
(2147483647, 0), 0)));
- Table.States (924).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (209, 0), 99, 1078)));
- Table.States (925).Action_List.Set_Capacity (1);
- Add_Action (Table.States (925), 99, (248, 2), 1079);
- Table.States (925).Kernel := To_Vector ((0 => ((248, 2), 125, 1,
(2147483647, 0), 0)));
- Table.States (925).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (248, 2), 99, 1079)));
- Table.States (926).Action_List.Set_Capacity (1);
- Add_Action (Table.States (926), 99, (248, 1), 1080);
- Table.States (926).Kernel := To_Vector ((0 => ((248, 1), 125, 1,
(2147483647, 0), 0)));
- Table.States (926).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (248, 1), 99, 1080)));
- Table.States (927).Action_List.Set_Capacity (11);
- Add_Action (Table.States (927), 21, Reduce, (117, 2), 4,
access_definition_2'Access, null);
- Add_Action (Table.States (927), 35, Reduce, (117, 2), 4,
access_definition_2'Access, null);
- Add_Action (Table.States (927), 56, Reduce, (117, 2), 4,
access_definition_2'Access, null);
- Add_Action (Table.States (927), 74, Reduce, (117, 2), 4,
access_definition_2'Access, null);
- Add_Action (Table.States (927), 76, (118, 0), 237);
- Add_Action (Table.States (927), 78, Reduce, (117, 2), 4,
access_definition_2'Access, null);
- Add_Action (Table.States (927), 85, Reduce, (117, 2), 4,
access_definition_2'Access, null);
- Add_Action (Table.States (927), 87, (296, 0), 239);
- Add_Action (Table.States (927), 99, Reduce, (117, 2), 4,
access_definition_2'Access, null);
- Add_Action (Table.States (927), 104, (325, 0), 241);
- Add_Action (Table.States (927), 105, (325, 1), 242);
- Table.States (927).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (927), 118, 243);
- Add_Goto (Table.States (927), 325, 244);
- Table.States (927).Kernel := To_Vector ((((117, 2), 242, 0,
(117, 2), 4), ((131, 0), 242, 2,
- (2147483647, 0), 0), ((242, 0), 242, 5, (2147483647, 0), 0),
((242, 1), 242, 2, (2147483647, 0), 0),
- ((275, 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (927).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (117, 2), 4)));
- Table.States (928).Action_List.Set_Capacity (2);
- Add_Action (Table.States (928), 58, (294, 0), 320);
- Add_Action (Table.States (928), 76, (202, 0), 434);
- Table.States (928).Goto_List.Set_Capacity (3);
- Add_Goto (Table.States (928), 202, 322);
- Add_Goto (Table.States (928), 255, 1081);
- Add_Goto (Table.States (928), 294, 324);
- Table.States (928).Kernel := To_Vector ((0 => ((117, 1), 29, 1,
(2147483647, 0), 0)));
- Table.States (928).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (294, 0), 58, 320)));
- Table.States (929).Action_List.Set_Capacity (8);
- Add_Action (Table.States (929), 21, Reduce, (256, 1), 0, null,
null);
- Add_Action (Table.States (929), 35, Reduce, (256, 1), 0, null,
null);
- Add_Action (Table.States (929), 56, Reduce, (256, 1), 0, null,
null);
- Add_Action (Table.States (929), 74, Reduce, (256, 1), 0, null,
null);
- Add_Action (Table.States (929), 76, (202, 0), 434);
- Add_Action (Table.States (929), 78, Reduce, (256, 1), 0, null,
null);
- Add_Action (Table.States (929), 85, Reduce, (256, 1), 0, null,
null);
- Add_Action (Table.States (929), 99, Reduce, (256, 1), 0, null,
null);
- Table.States (929).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (929), 202, 347);
- Add_Goto (Table.States (929), 256, 1082);
- Table.States (929).Kernel := To_Vector ((0 => ((117, 0), 50, 0,
(256, 1), 0)));
- Table.States (929).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (256, 1), 0)));
- Table.States (930).Action_List.Set_Capacity (6);
- Add_Action (Table.States (930), 74, (125, 0), 340);
- Add_Action (Table.States (930), 76, (118, 0), 237);
- Add_Action (Table.States (930), 87, (296, 0), 239);
- Add_Action (Table.States (930), 99, Reduce, (125, 1), 0, null,
null);
- Add_Action (Table.States (930), 104, (325, 0), 241);
- Add_Action (Table.States (930), 105, (325, 1), 242);
- Table.States (930).Goto_List.Set_Capacity (3);
- Add_Goto (Table.States (930), 118, 243);
- Add_Goto (Table.States (930), 125, 1083);
- Add_Goto (Table.States (930), 325, 244);
- Table.States (930).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((242, 0), 242, 5,
- (2147483647, 0), 0), ((242, 1), 242, 2, (2147483647, 0), 0),
((248, 0), 242, 1, (2147483647, 0), 0),
- ((275, 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (930).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (931).Action_List.Set_Capacity (47);
- Add_Action (Table.States (931), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (136, 1), 6, block_statement_1'Access,
block_statement_1_check'Access);
- Table.States (931).Kernel := To_Vector ((0 => ((136, 1), 99, 0,
(136, 1), 6)));
- Table.States (931).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (136, 1), 6)));
- Table.States (932).Action_List.Set_Capacity (2);
- Add_Action (Table.States (932), (82, 90), (187, 1), 1, null,
null);
- Table.States (932).Kernel := To_Vector ((0 => ((187, 1), 44, 0,
(187, 1), 1)));
- Table.States (932).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (187, 1), 1)));
- Table.States (933).Action_List.Set_Capacity (7);
- Add_Action (Table.States (933), 76, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (933), 82, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (933), 84, (190, 0), 1084);
- Add_Action (Table.States (933), 87, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (933), 90, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (933), 104, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (933), 105, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Table.States (933).Kernel := To_Vector ((((190, 0), 107, 3,
(2147483647, 0), 0), ((242, 5), 107, 0,
- (242, 5), 1)));
- Table.States (933).Minimal_Complete_Actions := To_Vector (((Shift,
(190, 0), 84, 1084), (Reduce, (242, 5),
- 1)));
- Table.States (934).Action_List.Set_Capacity (2);
- Add_Action (Table.States (934), (82, 90), (188, 1), 1, null,
null);
- Table.States (934).Kernel := To_Vector ((0 => ((188, 1), 187, 0,
(188, 1), 1)));
- Table.States (934).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (188, 1), 1)));
- Table.States (935).Action_List.Set_Capacity (2);
- Add_Action (Table.States (935), 82, (188, 0), 1085);
- Add_Action (Table.States (935), 90, (190, 1), 1086);
- Table.States (935).Kernel := To_Vector ((((188, 0), 188, 2,
(2147483647, 0), 0), ((190, 1), 188, 1,
- (2147483647, 0), 0)));
- Table.States (935).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (190, 1), 90, 1086)));
- Table.States (936).Action_List.Set_Capacity (6);
- Add_Action (Table.States (936), 76, (118, 0), 237);
- Add_Action (Table.States (936), 82, Reduce, (187, 0), 1, null,
null);
- Add_Action (Table.States (936), 87, (296, 0), 239);
- Add_Action (Table.States (936), 90, Reduce, (187, 0), 1, null,
null);
- Add_Action (Table.States (936), 104, (325, 0), 241);
- Add_Action (Table.States (936), 105, (325, 1), 242);
- Table.States (936).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (936), 118, 243);
- Add_Goto (Table.States (936), 325, 244);
- Table.States (936).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((187, 0), 242, 0,
- (187, 0), 1), ((242, 0), 242, 5, (2147483647, 0), 0), ((242,
1), 242, 2, (2147483647, 0), 0), ((275,
- 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (936).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (187, 0), 1)));
- Table.States (937).Action_List.Set_Capacity (2);
- Add_Action (Table.States (937), (24, 72), (191, 0), 2,
exception_handler_list_0'Access, null);
- Table.States (937).Kernel := To_Vector ((0 => ((191, 0), 190, 0,
(191, 0), 2)));
- Table.States (937).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (191, 0), 2)));
- Table.States (938).Action_List.Set_Capacity (2);
- Add_Action (Table.States (938), 99, Reduce, (223, 1), 0, null,
null);
- Add_Action (Table.States (938), 107, (223, 0), 151);
- Table.States (938).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (938), 223, 1087);
- Table.States (938).Kernel := To_Vector ((0 => ((136, 0), 24, 1,
(2147483647, 0), 0)));
- Table.States (938).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (223, 1), 0)));
- Table.States (939).Action_List.Set_Capacity (1);
- Add_Action (Table.States (939), 99, (235, 1), 1088);
- Table.States (939).Kernel := To_Vector ((0 => ((235, 1), 223, 1,
(2147483647, 0), 0)));
- Table.States (939).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (235, 1), 99, 1088)));
- Table.States (940).Action_List.Set_Capacity (2);
- Add_Action (Table.States (940), 99, Reduce, (223, 1), 0, null,
null);
- Add_Action (Table.States (940), 107, (223, 0), 151);
- Table.States (940).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (940), 223, 1089);
- Table.States (940).Kernel := To_Vector ((0 => ((235, 0), 37, 1,
(2147483647, 0), 0)));
- Table.States (940).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (223, 1), 0)));
- Table.States (941).Action_List.Set_Capacity (41);
- Add_Action (Table.States (941), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (160, 9), 6,
- declaration_9'Access, null);
- Table.States (941).Kernel := To_Vector ((0 => ((160, 9), 99, 0,
(160, 9), 6)));
- Table.States (941).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (160, 9), 6)));
- Table.States (942).Action_List.Set_Capacity (5);
- Add_Action (Table.States (942), 7, Reduce, (244, 0), 2, null,
null);
- Add_Action (Table.States (942), 81, (242, 8), 31);
- Add_Action (Table.States (942), 107, (242, 5), 120);
- Add_Action (Table.States (942), 108, (242, 7), 34);
- Add_Action (Table.States (942), 109, (242, 6), 35);
- Table.States (942).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (942), 131, 42);
- Add_Goto (Table.States (942), 242, 791);
- Add_Goto (Table.States (942), 275, 93);
- Add_Goto (Table.States (942), 296, 98);
- Table.States (942).Kernel := To_Vector ((((244, 0), 41, 0, (244,
0), 2), ((317, 0), 41, 5,
- (2147483647, 0), 0), ((317, 1), 41, 1, (2147483647, 0), 0)));
- Table.States (942).Minimal_Complete_Actions := To_Vector
(((Reduce, (244, 0), 2), (Shift, (242, 5), 107,
- 120)));
- Table.States (943).Action_List.Set_Capacity (16);
- Add_Action (Table.States (943), 3, (200, 2), 122);
- Add_Action (Table.States (943), 39, (261, 4), 123);
- Add_Action (Table.States (943), 40, (200, 3), 124);
- Add_Action (Table.States (943), 41, (261, 1), 125);
- Add_Action (Table.States (943), 52, (278, 0), 126);
- Add_Action (Table.States (943), 74, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (943), 76, (120, 0), 127);
- Add_Action (Table.States (943), 77, (120, 5), 128);
- Add_Action (Table.States (943), 81, (242, 8), 31);
- Add_Action (Table.States (943), 97, (333, 1), 129);
- Add_Action (Table.States (943), 98, (333, 0), 130);
- Add_Action (Table.States (943), 99, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (943), 106, (261, 0), 131);
- Add_Action (Table.States (943), 107, (242, 5), 120);
- Add_Action (Table.States (943), 108, (242, 7), 34);
- Add_Action (Table.States (943), 109, (242, 6), 35);
- Table.States (943).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (943), 120, 132);
- Add_Goto (Table.States (943), 131, 42);
- Add_Goto (Table.States (943), 194, 133);
- Add_Goto (Table.States (943), 195, 1090);
- Add_Goto (Table.States (943), 200, 135);
- Add_Goto (Table.States (943), 242, 136);
- Add_Goto (Table.States (943), 261, 137);
- Add_Goto (Table.States (943), 275, 93);
- Add_Goto (Table.States (943), 278, 138);
- Add_Goto (Table.States (943), 285, 139);
- Add_Goto (Table.States (943), 286, 140);
- Add_Goto (Table.States (943), 287, 141);
- Add_Goto (Table.States (943), 288, 142);
- Add_Goto (Table.States (943), 289, 143);
- Add_Goto (Table.States (943), 290, 144);
- Add_Goto (Table.States (943), 296, 98);
- Add_Goto (Table.States (943), 304, 145);
- Add_Goto (Table.States (943), 323, 146);
- Add_Goto (Table.States (943), 324, 147);
- Add_Goto (Table.States (943), 333, 148);
- Table.States (943).Kernel := To_Vector ((0 => ((247, 1), 85, 1,
(2147483647, 0), 0)));
- Table.States (943).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (944).Action_List.Set_Capacity (1);
- Add_Action (Table.States (944), 99, (247, 4), 1091);
- Table.States (944).Kernel := To_Vector ((0 => ((247, 4), 125, 1,
(2147483647, 0), 0)));
- Table.States (944).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (247, 4), 99, 1091)));
- Table.States (945).Action_List.Set_Capacity (16);
- Add_Action (Table.States (945), 3, (200, 2), 122);
- Add_Action (Table.States (945), 39, (261, 4), 123);
- Add_Action (Table.States (945), 40, (200, 3), 124);
- Add_Action (Table.States (945), 41, (261, 1), 125);
- Add_Action (Table.States (945), 52, (278, 0), 126);
- Add_Action (Table.States (945), 74, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (945), 76, (120, 0), 127);
- Add_Action (Table.States (945), 77, (120, 5), 128);
- Add_Action (Table.States (945), 81, (242, 8), 31);
- Add_Action (Table.States (945), 97, (333, 1), 129);
- Add_Action (Table.States (945), 98, (333, 0), 130);
- Add_Action (Table.States (945), 99, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (945), 106, (261, 0), 131);
- Add_Action (Table.States (945), 107, (242, 5), 120);
- Add_Action (Table.States (945), 108, (242, 7), 34);
- Add_Action (Table.States (945), 109, (242, 6), 35);
- Table.States (945).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (945), 120, 132);
- Add_Goto (Table.States (945), 131, 42);
- Add_Goto (Table.States (945), 194, 133);
- Add_Goto (Table.States (945), 195, 1092);
- Add_Goto (Table.States (945), 200, 135);
- Add_Goto (Table.States (945), 242, 136);
- Add_Goto (Table.States (945), 261, 137);
- Add_Goto (Table.States (945), 275, 93);
- Add_Goto (Table.States (945), 278, 138);
- Add_Goto (Table.States (945), 285, 139);
- Add_Goto (Table.States (945), 286, 140);
- Add_Goto (Table.States (945), 287, 141);
- Add_Goto (Table.States (945), 288, 142);
- Add_Goto (Table.States (945), 289, 143);
- Add_Goto (Table.States (945), 290, 144);
- Add_Goto (Table.States (945), 296, 98);
- Add_Goto (Table.States (945), 304, 145);
- Add_Goto (Table.States (945), 323, 146);
- Add_Goto (Table.States (945), 324, 147);
- Add_Goto (Table.States (945), 333, 148);
- Table.States (945).Kernel := To_Vector ((0 => ((247, 2), 85, 1,
(2147483647, 0), 0)));
- Table.States (945).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (946).Action_List.Set_Capacity (1);
- Add_Action (Table.States (946), 99, (247, 5), 1093);
- Table.States (946).Kernel := To_Vector ((0 => ((247, 5), 125, 1,
(2147483647, 0), 0)));
- Table.States (946).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (247, 5), 99, 1093)));
- Table.States (947).Action_List.Set_Capacity (16);
- Add_Action (Table.States (947), 3, (200, 2), 122);
- Add_Action (Table.States (947), 39, (261, 4), 123);
- Add_Action (Table.States (947), 40, (200, 3), 124);
- Add_Action (Table.States (947), 41, (261, 1), 125);
- Add_Action (Table.States (947), 52, (278, 0), 126);
- Add_Action (Table.States (947), 74, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (947), 76, (120, 0), 127);
- Add_Action (Table.States (947), 77, (120, 5), 128);
- Add_Action (Table.States (947), 81, (242, 8), 31);
- Add_Action (Table.States (947), 97, (333, 1), 129);
- Add_Action (Table.States (947), 98, (333, 0), 130);
- Add_Action (Table.States (947), 99, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (947), 106, (261, 0), 131);
- Add_Action (Table.States (947), 107, (242, 5), 120);
- Add_Action (Table.States (947), 108, (242, 7), 34);
- Add_Action (Table.States (947), 109, (242, 6), 35);
- Table.States (947).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (947), 120, 132);
- Add_Goto (Table.States (947), 131, 42);
- Add_Goto (Table.States (947), 194, 133);
- Add_Goto (Table.States (947), 195, 1094);
- Add_Goto (Table.States (947), 200, 135);
- Add_Goto (Table.States (947), 242, 136);
- Add_Goto (Table.States (947), 261, 137);
- Add_Goto (Table.States (947), 275, 93);
- Add_Goto (Table.States (947), 278, 138);
- Add_Goto (Table.States (947), 285, 139);
- Add_Goto (Table.States (947), 286, 140);
- Add_Goto (Table.States (947), 287, 141);
- Add_Goto (Table.States (947), 288, 142);
- Add_Goto (Table.States (947), 289, 143);
- Add_Goto (Table.States (947), 290, 144);
- Add_Goto (Table.States (947), 296, 98);
- Add_Goto (Table.States (947), 304, 145);
- Add_Goto (Table.States (947), 323, 146);
- Add_Goto (Table.States (947), 324, 147);
- Add_Goto (Table.States (947), 333, 148);
- Table.States (947).Kernel := To_Vector ((0 => ((247, 0), 85, 1,
(2147483647, 0), 0)));
- Table.States (947).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (948).Action_List.Set_Capacity (1);
- Add_Action (Table.States (948), 99, (247, 3), 1095);
- Table.States (948).Kernel := To_Vector ((0 => ((247, 3), 125, 1,
(2147483647, 0), 0)));
- Table.States (948).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (247, 3), 99, 1095)));
- Table.States (949).Action_List.Set_Capacity (65);
- Add_Action (Table.States (949), (4, 5, 10, 13, 15, 17, 18, 20, 21,
22, 23, 27, 28, 31, 32, 33, 35, 37, 38,
- 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74,
75, 76, 78, 79, 80, 81, 82, 85, 86, 87, 88,
- 89, 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104,
105, 107, 108, 109), (132, 0), 4, null,
- null);
- Table.States (949).Kernel := To_Vector ((0 => ((132, 0), 78, 0,
(132, 0), 4)));
- Table.States (949).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (132, 0), 4)));
- Table.States (950).Action_List.Set_Capacity (3);
- Add_Action (Table.States (950), 74, Reduce, (256, 1), 0, null,
null);
- Add_Action (Table.States (950), 76, (202, 0), 434);
- Add_Action (Table.States (950), 99, Reduce, (256, 1), 0, null,
null);
- Table.States (950).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (950), 202, 347);
- Add_Goto (Table.States (950), 256, 1096);
- Table.States (950).Kernel := To_Vector ((0 => ((182, 0), 78, 1,
(2147483647, 0), 0)));
- Table.States (950).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (256, 1), 0)));
- Table.States (951).Action_List.Set_Capacity (41);
- Add_Action (Table.States (951), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (182, 1), 6,
- entry_declaration_1'Access, null);
- Table.States (951).Kernel := To_Vector ((0 => ((182, 1), 99, 0,
(182, 1), 6)));
- Table.States (951).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (182, 1), 6)));
- Table.States (952).Action_List.Set_Capacity (6);
- Add_Action (Table.States (952), 74, (125, 0), 340);
- Add_Action (Table.States (952), 76, (118, 0), 237);
- Add_Action (Table.States (952), 87, (296, 0), 239);
- Add_Action (Table.States (952), 99, Reduce, (125, 1), 0, null,
null);
- Add_Action (Table.States (952), 104, (325, 0), 241);
- Add_Action (Table.States (952), 105, (325, 1), 242);
- Table.States (952).Goto_List.Set_Capacity (3);
- Add_Goto (Table.States (952), 118, 243);
- Add_Goto (Table.States (952), 125, 1097);
- Add_Goto (Table.States (952), 325, 244);
- Table.States (952).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((216, 2), 242, 1,
- (2147483647, 0), 0), ((242, 0), 242, 5, (2147483647, 0), 0),
((242, 1), 242, 2, (2147483647, 0), 0),
- ((275, 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (952).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (953).Action_List.Set_Capacity (6);
- Add_Action (Table.States (953), 74, (125, 0), 340);
- Add_Action (Table.States (953), 76, (118, 0), 237);
- Add_Action (Table.States (953), 87, (296, 0), 239);
- Add_Action (Table.States (953), 99, Reduce, (125, 1), 0, null,
null);
- Add_Action (Table.States (953), 104, (325, 0), 241);
- Add_Action (Table.States (953), 105, (325, 1), 242);
- Table.States (953).Goto_List.Set_Capacity (3);
- Add_Goto (Table.States (953), 118, 243);
- Add_Goto (Table.States (953), 125, 1098);
- Add_Goto (Table.States (953), 325, 244);
- Table.States (953).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((216, 1), 242, 1,
- (2147483647, 0), 0), ((242, 0), 242, 5, (2147483647, 0), 0),
((242, 1), 242, 2, (2147483647, 0), 0),
- ((275, 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (953).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (954).Action_List.Set_Capacity (2);
- Add_Action (Table.States (954), (74, 99), (259, 0), 3,
paren_expression_0'Access, null);
- Table.States (954).Kernel := To_Vector ((0 => ((259, 0), 78, 0,
(259, 0), 3)));
- Table.States (954).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (259, 0), 3)));
- Table.States (955).Action_List.Set_Capacity (41);
- Add_Action (Table.States (955), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (196, 0), 6,
- expression_function_declaration_0'Access, null);
- Table.States (955).Kernel := To_Vector ((0 => ((196, 0), 99, 0,
(196, 0), 6)));
- Table.States (955).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (196, 0), 6)));
- Table.States (956).Action_List.Set_Capacity (41);
- Add_Action (Table.States (956), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (246, 0), 6,
- null_procedure_declaration_0'Access, null);
- Table.States (956).Kernel := To_Vector ((0 => ((246, 0), 99, 0,
(246, 0), 6)));
- Table.States (956).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (246, 0), 6)));
- end Subr_17;
- procedure Subr_18
- is begin
- Table.States (957).Action_List.Set_Capacity (41);
- Add_Action (Table.States (957), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (115, 0), 6,
- abstract_subprogram_declaration_0'Access, null);
- Table.States (957).Kernel := To_Vector ((0 => ((115, 0), 99, 0,
(115, 0), 6)));
- Table.States (957).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (115, 0), 6)));
- Table.States (958).Action_List.Set_Capacity (41);
- Add_Action (Table.States (958), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (311, 0), 6,
- subprogram_body_stub_0'Access, null);
- Table.States (958).Kernel := To_Vector ((0 => ((311, 0), 99, 0,
(311, 0), 6)));
- Table.States (958).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (311, 0), 6)));
- Table.States (959).Action_List.Set_Capacity (41);
- Add_Action (Table.States (959), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (314, 0), 6,
- subprogram_renaming_declaration_0'Access, null);
- Table.States (959).Kernel := To_Vector ((0 => ((314, 0), 99, 0,
(314, 0), 6)));
- Table.States (959).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (314, 0), 6)));
- Table.States (960).Action_List.Set_Capacity (25);
- Add_Action (Table.States (960), 4, (116, 0), 1);
- Add_Action (Table.States (960), 5, (306, 8), 2);
- Add_Action (Table.States (960), 13, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (960), 15, (142, 0), 3);
- Add_Action (Table.States (960), 17, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (960), 18, (164, 0), 4);
- Add_Action (Table.States (960), 24, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (960), 26, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (960), 27, (193, 0), 5);
- Add_Action (Table.States (960), 28, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (960), 31, (306, 3), 9);
- Add_Action (Table.States (960), 32, (225, 0), 10);
- Add_Action (Table.States (960), 37, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (960), 41, (306, 0), 13);
- Add_Action (Table.States (960), 48, (260, 0), 16);
- Add_Action (Table.States (960), 52, (279, 0), 20);
- Add_Action (Table.States (960), 57, (293, 0), 21);
- Add_Action (Table.States (960), 58, (199, 0), 22);
- Add_Action (Table.States (960), 61, (129, 0), 24);
- Add_Action (Table.States (960), 73, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (960), 81, (242, 8), 31);
- Add_Action (Table.States (960), 96, (220, 0), 32);
- Add_Action (Table.States (960), 107, (134, 0), 363);
- Add_Action (Table.States (960), 108, (242, 7), 34);
- Add_Action (Table.States (960), 109, (242, 6), 35);
- Table.States (960).Goto_List.Set_Capacity (32);
- Add_Goto (Table.States (960), 116, 37);
- Add_Goto (Table.States (960), 126, 39);
- Add_Goto (Table.States (960), 129, 40);
- Add_Goto (Table.States (960), 131, 42);
- Add_Goto (Table.States (960), 134, 43);
- Add_Goto (Table.States (960), 135, 44);
- Add_Goto (Table.States (960), 136, 45);
- Add_Goto (Table.States (960), 142, 48);
- Add_Goto (Table.States (960), 154, 51);
- Add_Goto (Table.States (960), 155, 52);
- Add_Goto (Table.States (960), 164, 54);
- Add_Goto (Table.States (960), 193, 58);
- Add_Goto (Table.States (960), 199, 60);
- Add_Goto (Table.States (960), 220, 69);
- Add_Goto (Table.States (960), 221, 1099);
- Add_Goto (Table.States (960), 225, 71);
- Add_Goto (Table.States (960), 235, 73);
- Add_Goto (Table.States (960), 242, 74);
- Add_Goto (Table.States (960), 260, 84);
- Add_Goto (Table.States (960), 264, 87);
- Add_Goto (Table.States (960), 275, 93);
- Add_Goto (Table.States (960), 279, 94);
- Add_Goto (Table.States (960), 293, 97);
- Add_Goto (Table.States (960), 296, 98);
- Add_Goto (Table.States (960), 297, 99);
- Add_Goto (Table.States (960), 301, 100);
- Add_Goto (Table.States (960), 302, 364);
- Add_Goto (Table.States (960), 303, 393);
- Add_Goto (Table.States (960), 305, 101);
- Add_Goto (Table.States (960), 306, 102);
- Add_Goto (Table.States (960), 309, 366);
- Add_Goto (Table.States (960), 326, 115);
- Table.States (960).Kernel := To_Vector ((0 => ((310, 0), 13, 2,
(2147483647, 0), 0)));
- Table.States (960).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (221, 1), 0)));
- Table.States (961).Action_List.Set_Capacity (2);
- Add_Action (Table.States (961), 99, Reduce, (223, 1), 0, null,
null);
- Add_Action (Table.States (961), 107, (223, 0), 151);
- Table.States (961).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (961), 223, 1100);
- Table.States (961).Kernel := To_Vector ((0 => ((116, 0), 24, 1,
(2147483647, 0), 0)));
- Table.States (961).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (223, 1), 0)));
- Table.States (962).Action_List.Set_Capacity (2);
- Add_Action (Table.States (962), 82, (169, 0), 450);
- Add_Action (Table.States (962), 90, (140, 0), 1101);
- Table.States (962).Kernel := To_Vector ((((140, 0), 169, 1,
(2147483647, 0), 0), ((169, 0), 169, 2,
- (2147483647, 0), 0)));
- Table.States (962).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (140, 0), 90, 1101)));
- Table.States (963).Action_List.Set_Capacity (1);
- Add_Action (Table.States (963), 72, (140, 0), 774);
- Table.States (963).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (963), 140, 1102);
- Table.States (963).Kernel := To_Vector ((0 => ((141, 0), 86, 2,
(2147483647, 0), 0)));
- Table.States (963).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (140, 0), 72, 774)));
- Table.States (964).Action_List.Set_Capacity (27);
- Add_Action (Table.States (964), 10, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (964), 33, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (964), 38, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (964), 40, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (964), 43, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (964), 55, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (964), 75, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (964), 78, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (964), 80, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (964), 81, (242, 8), 31);
- Add_Action (Table.States (964), 82, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (964), 86, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (964), 88, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (964), 89, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (964), 90, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (964), 91, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (964), 92, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (964), 94, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (964), 95, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (964), 97, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (964), 98, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (964), 100, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (964), 101, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (964), 102, Reduce, (261, 1), 1, null,
null);
- Add_Action (Table.States (964), 107, (242, 5), 120);
- Add_Action (Table.States (964), 108, (242, 7), 34);
- Add_Action (Table.States (964), 109, (242, 6), 35);
- Table.States (964).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (964), 131, 42);
- Add_Goto (Table.States (964), 242, 1103);
- Add_Goto (Table.States (964), 275, 93);
- Add_Goto (Table.States (964), 296, 98);
- Table.States (964).Kernel := To_Vector ((((168, 1), 41, 1,
(2147483647, 0), 0), ((261, 1), 41, 0,
- (261, 1), 1), ((317, 0), 41, 5, (2147483647, 0), 0), ((317,
1), 41, 1, (2147483647, 0), 0)));
- Table.States (964).Minimal_Complete_Actions := To_Vector (((Shift,
(242, 5), 107, 120), (Reduce, (261, 1),
- 1)));
- Table.States (965).Action_List.Set_Capacity (14);
- Add_Action (Table.States (965), 3, (200, 2), 122);
- Add_Action (Table.States (965), 39, (261, 4), 123);
- Add_Action (Table.States (965), 40, (200, 3), 124);
- Add_Action (Table.States (965), 41, (261, 1), 125);
- Add_Action (Table.States (965), 52, (278, 0), 126);
- Add_Action (Table.States (965), 76, (120, 0), 127);
- Add_Action (Table.States (965), 77, (120, 5), 128);
- Add_Action (Table.States (965), 81, (242, 8), 31);
- Add_Action (Table.States (965), 97, (333, 1), 129);
- Add_Action (Table.States (965), 98, (333, 0), 130);
- Add_Action (Table.States (965), 106, (261, 0), 131);
- Add_Action (Table.States (965), 107, (242, 5), 120);
- Add_Action (Table.States (965), 108, (242, 7), 34);
- Add_Action (Table.States (965), 109, (242, 6), 35);
- Table.States (965).Goto_List.Set_Capacity (19);
- Add_Goto (Table.States (965), 120, 132);
- Add_Goto (Table.States (965), 131, 42);
- Add_Goto (Table.States (965), 194, 1104);
- Add_Goto (Table.States (965), 200, 135);
- Add_Goto (Table.States (965), 242, 136);
- Add_Goto (Table.States (965), 261, 137);
- Add_Goto (Table.States (965), 275, 93);
- Add_Goto (Table.States (965), 278, 138);
- Add_Goto (Table.States (965), 285, 139);
- Add_Goto (Table.States (965), 286, 140);
- Add_Goto (Table.States (965), 287, 141);
- Add_Goto (Table.States (965), 288, 142);
- Add_Goto (Table.States (965), 289, 143);
- Add_Goto (Table.States (965), 290, 144);
- Add_Goto (Table.States (965), 296, 98);
- Add_Goto (Table.States (965), 304, 145);
- Add_Goto (Table.States (965), 323, 146);
- Add_Goto (Table.States (965), 324, 147);
- Add_Goto (Table.States (965), 333, 148);
- Table.States (965).Kernel := To_Vector ((0 => ((127, 6), 90, 1,
(2147483647, 0), 0)));
- Table.States (965).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (966).Action_List.Set_Capacity (1);
- Add_Action (Table.States (966), (1 => 78), (276, 0), 5,
quantified_expression_0'Access, null);
- Table.States (966).Kernel := To_Vector ((0 => ((276, 0), 195, 0,
(276, 0), 5)));
- Table.States (966).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (276, 0), 5)));
- Table.States (967).Action_List.Set_Capacity (15);
- Add_Action (Table.States (967), 3, (200, 2), 122);
- Add_Action (Table.States (967), 39, (261, 4), 123);
- Add_Action (Table.States (967), 40, (200, 3), 124);
- Add_Action (Table.States (967), 41, (261, 1), 125);
- Add_Action (Table.States (967), 52, (278, 0), 126);
- Add_Action (Table.States (967), 76, (120, 0), 127);
- Add_Action (Table.States (967), 77, (120, 5), 128);
- Add_Action (Table.States (967), 78, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (967), 81, (242, 8), 31);
- Add_Action (Table.States (967), 97, (333, 1), 129);
- Add_Action (Table.States (967), 98, (333, 0), 130);
- Add_Action (Table.States (967), 106, (261, 0), 131);
- Add_Action (Table.States (967), 107, (242, 5), 120);
- Add_Action (Table.States (967), 108, (242, 7), 34);
- Add_Action (Table.States (967), 109, (242, 6), 35);
- Table.States (967).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (967), 120, 132);
- Add_Goto (Table.States (967), 131, 42);
- Add_Goto (Table.States (967), 194, 133);
- Add_Goto (Table.States (967), 195, 1105);
- Add_Goto (Table.States (967), 200, 135);
- Add_Goto (Table.States (967), 242, 136);
- Add_Goto (Table.States (967), 261, 137);
- Add_Goto (Table.States (967), 275, 93);
- Add_Goto (Table.States (967), 278, 138);
- Add_Goto (Table.States (967), 285, 139);
- Add_Goto (Table.States (967), 286, 140);
- Add_Goto (Table.States (967), 287, 141);
- Add_Goto (Table.States (967), 288, 142);
- Add_Goto (Table.States (967), 289, 143);
- Add_Goto (Table.States (967), 290, 144);
- Add_Goto (Table.States (967), 296, 98);
- Add_Goto (Table.States (967), 304, 145);
- Add_Goto (Table.States (967), 323, 146);
- Add_Goto (Table.States (967), 324, 147);
- Add_Goto (Table.States (967), 333, 148);
- Table.States (967).Kernel := To_Vector ((0 => ((224, 1), 22, 0,
(195, 1), 0)));
- Table.States (967).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (968).Action_List.Set_Capacity (15);
- Add_Action (Table.States (968), 3, (200, 2), 122);
- Add_Action (Table.States (968), 39, (261, 4), 123);
- Add_Action (Table.States (968), 40, (200, 3), 124);
- Add_Action (Table.States (968), 41, (261, 1), 125);
- Add_Action (Table.States (968), 52, (278, 0), 126);
- Add_Action (Table.States (968), 68, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (968), 76, (120, 0), 127);
- Add_Action (Table.States (968), 77, (120, 5), 128);
- Add_Action (Table.States (968), 81, (242, 8), 31);
- Add_Action (Table.States (968), 97, (333, 1), 129);
- Add_Action (Table.States (968), 98, (333, 0), 130);
- Add_Action (Table.States (968), 106, (261, 0), 131);
- Add_Action (Table.States (968), 107, (242, 5), 120);
- Add_Action (Table.States (968), 108, (242, 7), 34);
- Add_Action (Table.States (968), 109, (242, 6), 35);
- Table.States (968).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (968), 120, 132);
- Add_Goto (Table.States (968), 131, 42);
- Add_Goto (Table.States (968), 194, 133);
- Add_Goto (Table.States (968), 195, 1106);
- Add_Goto (Table.States (968), 200, 135);
- Add_Goto (Table.States (968), 242, 136);
- Add_Goto (Table.States (968), 261, 137);
- Add_Goto (Table.States (968), 275, 93);
- Add_Goto (Table.States (968), 278, 138);
- Add_Goto (Table.States (968), 285, 139);
- Add_Goto (Table.States (968), 286, 140);
- Add_Goto (Table.States (968), 287, 141);
- Add_Goto (Table.States (968), 288, 142);
- Add_Goto (Table.States (968), 289, 143);
- Add_Goto (Table.States (968), 290, 144);
- Add_Goto (Table.States (968), 296, 98);
- Add_Goto (Table.States (968), 304, 145);
- Add_Goto (Table.States (968), 323, 146);
- Add_Goto (Table.States (968), 324, 147);
- Add_Goto (Table.States (968), 333, 148);
- Table.States (968).Kernel := To_Vector ((0 => ((175, 0), 23, 1,
(2147483647, 0), 0)));
- Table.States (968).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (969).Action_List.Set_Capacity (3);
- Add_Action (Table.States (969), (22, 23, 78), (176, 1), 1, null,
null);
- Table.States (969).Kernel := To_Vector ((0 => ((176, 1), 175, 0,
(176, 1), 1)));
- Table.States (969).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (176, 1), 1)));
- Table.States (970).Action_List.Set_Capacity (3);
- Add_Action (Table.States (970), 22, (224, 0), 1107);
- Add_Action (Table.States (970), 23, (175, 0), 968);
- Add_Action (Table.States (970), 78, Reduce, (224, 2), 5,
if_expression_2'Access, null);
- Table.States (970).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (970), 175, 1108);
- Table.States (970).Kernel := To_Vector ((((176, 0), 176, 2,
(2147483647, 0), 0), ((224, 0), 176, 1,
- (2147483647, 0), 0), ((224, 2), 176, 0, (224, 2), 5)));
- Table.States (970).Minimal_Complete_Actions := To_Vector (((Shift,
(224, 0), 22, 1107), (Reduce, (224, 2),
- 5)));
- Table.States (971).Action_List.Set_Capacity (65);
- Add_Action (Table.States (971), (4, 5, 10, 13, 15, 17, 18, 20, 21,
22, 23, 27, 28, 31, 32, 33, 35, 37, 38,
- 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74,
75, 76, 78, 79, 80, 81, 82, 85, 86, 87, 88,
- 89, 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104,
105, 107, 108, 109), (120, 4), 6,
- aggregate_4'Access, null);
- Table.States (971).Kernel := To_Vector ((0 => ((120, 4), 78, 0,
(120, 4), 6)));
- Table.States (971).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (120, 4), 6)));
- Table.States (972).Action_List.Set_Capacity (65);
- Add_Action (Table.States (972), (4, 5, 10, 13, 15, 17, 18, 20, 21,
22, 23, 27, 28, 31, 32, 33, 35, 37, 38,
- 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74,
75, 76, 78, 79, 80, 81, 82, 85, 86, 87, 88,
- 89, 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104,
105, 107, 108, 109), (120, 2), 6,
- aggregate_2'Access, null);
- Table.States (972).Kernel := To_Vector ((0 => ((120, 2), 78, 0,
(120, 2), 6)));
- Table.States (972).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (120, 2), 6)));
- Table.States (973).Action_List.Set_Capacity (1);
- Add_Action (Table.States (973), 78, (280, 0), 1109);
- Table.States (973).Kernel := To_Vector ((0 => ((280, 0), 195, 1,
(2147483647, 0), 0)));
- Table.States (973).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (280, 0), 78, 1109)));
- Table.States (974).Action_List.Set_Capacity (65);
- Add_Action (Table.States (974), (4, 5, 10, 13, 15, 17, 18, 20, 21,
22, 23, 27, 28, 31, 32, 33, 35, 37, 38,
- 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74,
75, 76, 78, 79, 80, 81, 82, 85, 86, 87, 88,
- 89, 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104,
105, 107, 108, 109), (120, 5), 6,
- aggregate_5'Access, null);
- Table.States (974).Kernel := To_Vector ((0 => ((120, 5), 79, 0,
(120, 5), 6)));
- Table.States (974).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (120, 5), 6)));
- Table.States (975).Action_List.Set_Capacity (2);
- Add_Action (Table.States (975), (24, 72), (143, 0), 4,
case_statement_alternative_0'Access, null);
- Table.States (975).Kernel := To_Vector ((0 => ((143, 0), 303, 0,
(143, 0), 4)));
- Table.States (975).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (143, 0), 4)));
- Table.States (976).Action_List.Set_Capacity (47);
- Add_Action (Table.States (976), (4, 5, 13, 15, 17, 18, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (142, 0), 7, case_statement_0'Access, null);
- Table.States (976).Kernel := To_Vector ((0 => ((142, 0), 99, 0,
(142, 0), 7)));
- Table.States (976).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (142, 0), 7)));
- Table.States (977).Action_List.Set_Capacity (10);
- Add_Action (Table.States (977), (10, 21, 37, 42, 74, 78, 85, 86,
90, 99), (317, 0), 4,
- subtype_indication_0'Access, null);
- Table.States (977).Kernel := To_Vector ((0 => ((317, 0), 158, 0,
(317, 0), 4)));
- Table.States (977).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (317, 0), 4)));
- Table.States (978).Action_List.Set_Capacity (10);
- Add_Action (Table.States (978), (10, 21, 37, 42, 74, 78, 85, 86,
90, 99), (227, 0), 3,
- index_constraint_0'Access, null);
- Table.States (978).Kernel := To_Vector ((0 => ((227, 0), 78, 0,
(227, 0), 3)));
- Table.States (978).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (227, 0), 3)));
- Table.States (979).Action_List.Set_Capacity (13);
- Add_Action (Table.States (979), 3, (200, 2), 122);
- Add_Action (Table.States (979), 39, (261, 4), 123);
- Add_Action (Table.States (979), 40, (200, 3), 481);
- Add_Action (Table.States (979), 41, (261, 1), 125);
- Add_Action (Table.States (979), 76, (120, 0), 127);
- Add_Action (Table.States (979), 77, (120, 5), 128);
- Add_Action (Table.States (979), 81, (242, 8), 31);
- Add_Action (Table.States (979), 97, (333, 1), 129);
- Add_Action (Table.States (979), 98, (333, 0), 130);
- Add_Action (Table.States (979), 106, (261, 0), 131);
- Add_Action (Table.States (979), 107, (242, 5), 120);
- Add_Action (Table.States (979), 108, (242, 7), 34);
- Add_Action (Table.States (979), 109, (242, 6), 35);
- Table.States (979).Goto_List.Set_Capacity (14);
- Add_Goto (Table.States (979), 120, 132);
- Add_Goto (Table.States (979), 131, 42);
- Add_Goto (Table.States (979), 170, 1110);
- Add_Goto (Table.States (979), 200, 135);
- Add_Goto (Table.States (979), 242, 484);
- Add_Goto (Table.States (979), 261, 137);
- Add_Goto (Table.States (979), 275, 93);
- Add_Goto (Table.States (979), 280, 485);
- Add_Goto (Table.States (979), 296, 98);
- Add_Goto (Table.States (979), 304, 486);
- Add_Goto (Table.States (979), 317, 487);
- Add_Goto (Table.States (979), 323, 146);
- Add_Goto (Table.States (979), 324, 147);
- Add_Goto (Table.States (979), 333, 148);
- Table.States (979).Kernel := To_Vector ((0 => ((171, 0), 86, 1,
(2147483647, 0), 0)));
- Table.States (979).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (980).Action_List.Set_Capacity (6);
- Add_Action (Table.States (980), 37, Reduce, (233, 0), 6, null,
null);
- Add_Action (Table.States (980), 76, (118, 0), 237);
- Add_Action (Table.States (980), 87, (296, 0), 239);
- Add_Action (Table.States (980), 90, Reduce, (233, 0), 6, null,
null);
- Add_Action (Table.States (980), 104, (325, 0), 241);
- Add_Action (Table.States (980), 105, (325, 1), 242);
- Table.States (980).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (980), 118, 243);
- Add_Goto (Table.States (980), 325, 244);
- Table.States (980).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((233, 0), 242, 0,
- (233, 0), 6), ((242, 0), 242, 5, (2147483647, 0), 0), ((242,
1), 242, 2, (2147483647, 0), 0), ((275,
- 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (980).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (233, 0), 6)));
- Table.States (981).Action_List.Set_Capacity (1);
- Add_Action (Table.States (981), 99, (238, 0), 1111);
- Table.States (981).Kernel := To_Vector ((0 => ((238, 0), 195, 1,
(2147483647, 0), 0)));
- Table.States (981).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (238, 0), 99, 1111)));
- Table.States (982).Action_List.Set_Capacity (13);
- Add_Action (Table.States (982), 3, (200, 2), 122);
- Add_Action (Table.States (982), 39, (261, 4), 123);
- Add_Action (Table.States (982), 40, (200, 3), 124);
- Add_Action (Table.States (982), 41, (261, 1), 125);
- Add_Action (Table.States (982), 76, (120, 0), 127);
- Add_Action (Table.States (982), 77, (120, 5), 128);
- Add_Action (Table.States (982), 81, (242, 8), 31);
- Add_Action (Table.States (982), 97, (333, 1), 129);
- Add_Action (Table.States (982), 98, (333, 0), 130);
- Add_Action (Table.States (982), 106, (261, 0), 131);
- Add_Action (Table.States (982), 107, (242, 5), 120);
- Add_Action (Table.States (982), 108, (242, 7), 34);
- Add_Action (Table.States (982), 109, (242, 6), 35);
- Table.States (982).Goto_List.Set_Capacity (11);
- Add_Goto (Table.States (982), 120, 132);
- Add_Goto (Table.States (982), 131, 42);
- Add_Goto (Table.States (982), 200, 135);
- Add_Goto (Table.States (982), 242, 136);
- Add_Goto (Table.States (982), 261, 137);
- Add_Goto (Table.States (982), 275, 93);
- Add_Goto (Table.States (982), 296, 98);
- Add_Goto (Table.States (982), 304, 1112);
- Add_Goto (Table.States (982), 323, 146);
- Add_Goto (Table.States (982), 324, 147);
- Add_Goto (Table.States (982), 333, 148);
- Table.States (982).Kernel := To_Vector ((0 => ((147, 0), 12, 6,
(2147483647, 0), 0)));
- Table.States (982).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (983).Action_List.Set_Capacity (1);
- Add_Action (Table.States (983), 54, (284, 0), 1113);
- Table.States (983).Kernel := To_Vector ((0 => ((284, 0), 24, 2,
(2147483647, 0), 0)));
- Table.States (983).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (284, 0), 54, 1113)));
- Table.States (984).Action_List.Set_Capacity (2);
- Add_Action (Table.States (984), (24, 107), (148, 0), 2, null,
null);
- Table.States (984).Kernel := To_Vector ((0 => ((148, 0), 147, 0,
(148, 0), 2)));
- Table.States (984).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (148, 0), 2)));
- Table.States (985).Action_List.Set_Capacity (3);
- Add_Action (Table.States (985), 78, Reduce, (257, 3), 4,
parameter_specification_3'Access, null);
- Add_Action (Table.States (985), 85, (257, 2), 1114);
- Add_Action (Table.States (985), 99, Reduce, (257, 3), 4,
parameter_specification_3'Access, null);
- Table.States (985).Kernel := To_Vector ((((257, 2), 117, 1,
(2147483647, 0), 0), ((257, 3), 117, 0,
- (257, 3), 4)));
- Table.States (985).Minimal_Complete_Actions := To_Vector (((Shift,
(257, 2), 85, 1114), (Reduce, (257, 3),
- 4)));
- Table.States (986).Action_List.Set_Capacity (5);
- Add_Action (Table.States (986), 40, (244, 0), 389);
- Add_Action (Table.States (986), 81, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (986), 107, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (986), 108, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (986), 109, Reduce, (244, 1), 0, null,
null);
- Table.States (986).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (986), 244, 1115);
- Table.States (986).Kernel := To_Vector ((((257, 0), 239, 2,
(2147483647, 0), 0), ((257, 1), 239, 1,
- (2147483647, 0), 0)));
- Table.States (986).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (244, 1), 0)));
- Table.States (987).Action_List.Set_Capacity (41);
- Add_Action (Table.States (987), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (218, 2), 7,
- generic_renaming_declaration_2'Access, null);
- Table.States (987).Kernel := To_Vector ((0 => ((218, 2), 99, 0,
(218, 2), 7)));
- Table.States (987).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (218, 2), 7)));
- Table.States (988).Action_List.Set_Capacity (41);
- Add_Action (Table.States (988), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (218, 0), 7,
- generic_renaming_declaration_0'Access, null);
- Table.States (988).Kernel := To_Vector ((0 => ((218, 0), 99, 0,
(218, 0), 7)));
- Table.States (988).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (218, 0), 7)));
- Table.States (989).Action_List.Set_Capacity (41);
- Add_Action (Table.States (989), (4, 5, 13, 15, 17, 18, 24, 25, 27,
28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (218, 1), 7,
- generic_renaming_declaration_1'Access, null);
- Table.States (989).Kernel := To_Vector ((0 => ((218, 1), 99, 0,
(218, 1), 7)));
- Table.States (989).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (218, 1), 7)));
- Table.States (990).Action_List.Set_Capacity (1);
- Add_Action (Table.States (990), (1 => 39), (112, 0), 2, null,
null);
- Table.States (990).Kernel := To_Vector ((0 => ((112, 0), 36, 0,
(112, 0), 2)));
- Table.States (990).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (112, 0), 2)));
- Table.States (991).Action_List.Set_Capacity (3);
- Add_Action (Table.States (991), 20, (205, 6), 1116);
- Add_Action (Table.States (991), 74, Reduce, (205, 7), 2, null,
null);
- Add_Action (Table.States (991), 99, Reduce, (205, 7), 2, null,
null);
- Table.States (991).Kernel := To_Vector ((((205, 6), 83, 2,
(2147483647, 0), 0), ((205, 7), 83, 0,
- (205, 7), 2)));
- Table.States (991).Minimal_Complete_Actions := To_Vector (((Shift,
(205, 6), 20, 1116), (Reduce, (205, 7),
- 2)));
- Table.States (992).Action_List.Set_Capacity (2);
- Add_Action (Table.States (992), (74, 99), (205, 5), 2, null,
null);
- Table.States (992).Kernel := To_Vector ((0 => ((205, 5), 83, 0,
(205, 5), 2)));
- Table.States (992).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (205, 5), 2)));
- Table.States (993).Action_List.Set_Capacity (2);
- Add_Action (Table.States (993), (74, 99), (205, 4), 2, null,
null);
- Table.States (993).Kernel := To_Vector ((0 => ((205, 4), 83, 0,
(205, 4), 2)));
- Table.States (993).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (205, 4), 2)));
- Table.States (994).Action_List.Set_Capacity (2);
- Add_Action (Table.States (994), (74, 99), (205, 3), 2, null,
null);
- Table.States (994).Kernel := To_Vector ((0 => ((205, 3), 83, 0,
(205, 3), 2)));
- Table.States (994).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (205, 3), 2)));
- Table.States (995).Action_List.Set_Capacity (1);
- Add_Action (Table.States (995), 99, (204, 1), 1117);
- Table.States (995).Kernel := To_Vector ((0 => ((204, 1), 125, 1,
(2147483647, 0), 0)));
- Table.States (995).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (204, 1), 99, 1117)));
- Table.States (996).Action_List.Set_Capacity (1);
- Add_Action (Table.States (996), 78, (205, 2), 1118);
- Table.States (996).Kernel := To_Vector ((0 => ((205, 2), 83, 1,
(2147483647, 0), 0)));
- Table.States (996).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (205, 2), 78, 1118)));
- Table.States (997).Action_List.Set_Capacity (4);
- Add_Action (Table.States (997), 81, (242, 8), 31);
- Add_Action (Table.States (997), 107, (242, 5), 120);
- Add_Action (Table.States (997), 108, (242, 7), 34);
- Add_Action (Table.States (997), 109, (242, 6), 35);
- Table.States (997).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (997), 131, 42);
- Add_Goto (Table.States (997), 242, 1119);
- Add_Goto (Table.States (997), 275, 93);
- Add_Goto (Table.States (997), 296, 98);
- Table.States (997).Kernel := To_Vector ((((206, 0), 39, 3,
(2147483647, 0), 0), ((206, 1), 39, 1,
- (2147483647, 0), 0)));
- Table.States (997).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (998).Action_List.Set_Capacity (2);
- Add_Action (Table.States (998), (74, 99), (205, 0), 2, null,
null);
- Table.States (998).Kernel := To_Vector ((0 => ((205, 0), 49, 0,
(205, 0), 2)));
- Table.States (998).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (205, 0), 2)));
- Table.States (999).Action_List.Set_Capacity (1);
- Add_Action (Table.States (999), 99, (204, 0), 1120);
- Table.States (999).Kernel := To_Vector ((0 => ((204, 0), 125, 1,
(2147483647, 0), 0)));
- Table.States (999).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (204, 0), 99, 1120)));
- Table.States (1000).Action_List.Set_Capacity (6);
- Add_Action (Table.States (1000), 74, Reduce, (208, 1), 0, null,
null);
- Add_Action (Table.States (1000), 76, (118, 0), 1121);
- Add_Action (Table.States (1000), 87, (296, 0), 239);
- Add_Action (Table.States (1000), 99, Reduce, (208, 1), 0, null,
null);
- Add_Action (Table.States (1000), 104, (325, 0), 241);
- Add_Action (Table.States (1000), 105, (325, 1), 242);
- Table.States (1000).Goto_List.Set_Capacity (3);
- Add_Goto (Table.States (1000), 118, 243);
- Add_Goto (Table.States (1000), 208, 1122);
- Add_Goto (Table.States (1000), 325, 244);
- Table.States (1000).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((207, 0), 242, 1,
- (2147483647, 0), 0), ((242, 0), 242, 5, (2147483647, 0), 0),
((242, 1), 242, 2, (2147483647, 0), 0),
- ((275, 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (1000).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (208, 1), 0)));
- Table.States (1001).Action_List.Set_Capacity (8);
- Add_Action (Table.States (1001), (29, 47, 48, 50, 69, 71, 74,
107), (203, 2), 6,
- formal_subprogram_declaration_2'Access, null);
- Table.States (1001).Kernel := To_Vector ((0 => ((203, 2), 99, 0,
(203, 2), 6)));
- Table.States (1001).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (203, 2), 6)));
- Table.States (1002).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1002), 99, (203, 0), 1123);
- Table.States (1002).Kernel := To_Vector ((0 => ((203, 0), 125,
1, (2147483647, 0), 0)));
- Table.States (1002).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (203, 0), 99, 1123)));
- Table.States (1003).Action_List.Set_Capacity (8);
- Add_Action (Table.States (1003), (29, 47, 48, 50, 69, 71, 74,
107), (203, 1), 6,
- formal_subprogram_declaration_1'Access, null);
- Table.States (1003).Kernel := To_Vector ((0 => ((203, 1), 99, 0,
(203, 1), 6)));
- Table.States (1003).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (203, 1), 6)));
- Table.States (1004).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1004), 74, (125, 0), 340);
- Add_Action (Table.States (1004), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (1004).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (1004), 125, 1124);
- Table.States (1004).Kernel := To_Vector ((0 => ((201, 1), 195,
1, (2147483647, 0), 0)));
- Table.States (1004).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (1005).Action_List.Set_Capacity (8);
- Add_Action (Table.States (1005), (29, 47, 48, 50, 69, 71, 74,
107), (201, 3), 6,
- formal_object_declaration_3'Access, null);
- Table.States (1005).Kernel := To_Vector ((0 => ((201, 3), 99, 0,
(201, 3), 6)));
- Table.States (1005).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (201, 3), 6)));
- Table.States (1006).Action_List.Set_Capacity (16);
- Add_Action (Table.States (1006), 3, (200, 2), 122);
- Add_Action (Table.States (1006), 39, (261, 4), 123);
- Add_Action (Table.States (1006), 40, (200, 3), 124);
- Add_Action (Table.States (1006), 41, (261, 1), 125);
- Add_Action (Table.States (1006), 52, (278, 0), 126);
- Add_Action (Table.States (1006), 74, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (1006), 76, (120, 0), 127);
- Add_Action (Table.States (1006), 77, (120, 5), 128);
- Add_Action (Table.States (1006), 81, (242, 8), 31);
- Add_Action (Table.States (1006), 97, (333, 1), 129);
- Add_Action (Table.States (1006), 98, (333, 0), 130);
- Add_Action (Table.States (1006), 99, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (1006), 106, (261, 0), 131);
- Add_Action (Table.States (1006), 107, (242, 5), 120);
- Add_Action (Table.States (1006), 108, (242, 7), 34);
- Add_Action (Table.States (1006), 109, (242, 6), 35);
- Table.States (1006).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (1006), 120, 132);
- Add_Goto (Table.States (1006), 131, 42);
- Add_Goto (Table.States (1006), 194, 133);
- Add_Goto (Table.States (1006), 195, 1125);
- Add_Goto (Table.States (1006), 200, 135);
- Add_Goto (Table.States (1006), 242, 136);
- Add_Goto (Table.States (1006), 261, 137);
- Add_Goto (Table.States (1006), 275, 93);
- Add_Goto (Table.States (1006), 278, 138);
- Add_Goto (Table.States (1006), 285, 139);
- Add_Goto (Table.States (1006), 286, 140);
- Add_Goto (Table.States (1006), 287, 141);
- Add_Goto (Table.States (1006), 288, 142);
- Add_Goto (Table.States (1006), 289, 143);
- Add_Goto (Table.States (1006), 290, 144);
- Add_Goto (Table.States (1006), 296, 98);
- Add_Goto (Table.States (1006), 304, 145);
- Add_Goto (Table.States (1006), 323, 146);
- Add_Goto (Table.States (1006), 324, 147);
- Add_Goto (Table.States (1006), 333, 148);
- Table.States (1006).Kernel := To_Vector ((0 => ((201, 0), 85, 1,
(2147483647, 0), 0)));
- Table.States (1006).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (1007).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1007), 99, (201, 2), 1126);
- Table.States (1007).Kernel := To_Vector ((0 => ((201, 2), 125,
1, (2147483647, 0), 0)));
- Table.States (1007).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (201, 2), 99, 1126)));
- Table.States (1008).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1008), 32, (225, 1), 1127);
- Table.States (1008).Kernel := To_Vector ((0 => ((225, 1), 24, 2,
(2147483647, 0), 0)));
- Table.States (1008).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (225, 1), 32, 1127)));
- Table.States (1009).Action_List.Set_Capacity (26);
- Add_Action (Table.States (1009), 4, (116, 0), 1);
- Add_Action (Table.States (1009), 5, (306, 8), 2);
- Add_Action (Table.States (1009), 13, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (1009), 15, (142, 0), 3);
- Add_Action (Table.States (1009), 17, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (1009), 18, (164, 0), 4);
- Add_Action (Table.States (1009), 22, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (1009), 23, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (1009), 24, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (1009), 27, (193, 0), 5);
- Add_Action (Table.States (1009), 28, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (1009), 31, (306, 3), 9);
- Add_Action (Table.States (1009), 32, (225, 0), 10);
- Add_Action (Table.States (1009), 37, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (1009), 41, (306, 0), 13);
- Add_Action (Table.States (1009), 48, (260, 0), 16);
- Add_Action (Table.States (1009), 52, (279, 0), 20);
- Add_Action (Table.States (1009), 57, (293, 0), 21);
- Add_Action (Table.States (1009), 58, (199, 0), 22);
- Add_Action (Table.States (1009), 61, (129, 0), 24);
- Add_Action (Table.States (1009), 73, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (1009), 81, (242, 8), 31);
- Add_Action (Table.States (1009), 96, (220, 0), 32);
- Add_Action (Table.States (1009), 107, (134, 0), 363);
- Add_Action (Table.States (1009), 108, (242, 7), 34);
- Add_Action (Table.States (1009), 109, (242, 6), 35);
- Table.States (1009).Goto_List.Set_Capacity (31);
- Add_Goto (Table.States (1009), 116, 37);
- Add_Goto (Table.States (1009), 126, 39);
- Add_Goto (Table.States (1009), 129, 40);
- Add_Goto (Table.States (1009), 131, 42);
- Add_Goto (Table.States (1009), 134, 43);
- Add_Goto (Table.States (1009), 135, 44);
- Add_Goto (Table.States (1009), 136, 45);
- Add_Goto (Table.States (1009), 142, 48);
- Add_Goto (Table.States (1009), 154, 51);
- Add_Goto (Table.States (1009), 155, 52);
- Add_Goto (Table.States (1009), 164, 54);
- Add_Goto (Table.States (1009), 193, 58);
- Add_Goto (Table.States (1009), 199, 60);
- Add_Goto (Table.States (1009), 220, 69);
- Add_Goto (Table.States (1009), 225, 71);
- Add_Goto (Table.States (1009), 235, 73);
- Add_Goto (Table.States (1009), 242, 74);
- Add_Goto (Table.States (1009), 260, 84);
- Add_Goto (Table.States (1009), 264, 87);
- Add_Goto (Table.States (1009), 275, 93);
- Add_Goto (Table.States (1009), 279, 94);
- Add_Goto (Table.States (1009), 293, 97);
- Add_Goto (Table.States (1009), 296, 98);
- Add_Goto (Table.States (1009), 297, 99);
- Add_Goto (Table.States (1009), 301, 100);
- Add_Goto (Table.States (1009), 302, 364);
- Add_Goto (Table.States (1009), 303, 1128);
- Add_Goto (Table.States (1009), 305, 101);
- Add_Goto (Table.States (1009), 306, 102);
- Add_Goto (Table.States (1009), 309, 366);
- Add_Goto (Table.States (1009), 326, 115);
- Table.States (1009).Kernel := To_Vector ((0 => ((177, 0), 68, 0,
(303, 1), 0)));
- Table.States (1009).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (303, 1), 0)));
- Table.States (1010).Action_List.Set_Capacity (47);
- Add_Action (Table.States (1010), (4, 5, 13, 15, 17, 18, 22, 23,
24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (225, 3), 7, if_statement_3'Access, null);
- Table.States (1010).Kernel := To_Vector ((0 => ((225, 3), 99, 0,
(225, 3), 7)));
- Table.States (1010).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (225, 3), 7)));
- Table.States (1011).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1011), 24, (225, 0), 1129);
- Table.States (1011).Kernel := To_Vector ((0 => ((225, 0), 303,
3, (2147483647, 0), 0)));
- Table.States (1011).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (225, 0), 24, 1129)));
- Table.States (1012).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1012), 99, (225, 2), 1130);
- Table.States (1012).Kernel := To_Vector ((0 => ((225, 2), 32, 1,
(2147483647, 0), 0)));
- Table.States (1012).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (225, 2), 99, 1130)));
- Table.States (1013).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1013), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (251, 0), 7,
- package_body_stub_0'Access, null);
- Table.States (1013).Kernel := To_Vector ((0 => ((251, 0), 99, 0,
(251, 0), 7)));
- Table.States (1013).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (251, 0), 7)));
- Table.States (1014).Action_List.Set_Capacity (25);
- Add_Action (Table.States (1014), 4, (116, 0), 1);
- Add_Action (Table.States (1014), 5, (306, 8), 2);
- Add_Action (Table.States (1014), 13, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (1014), 15, (142, 0), 3);
- Add_Action (Table.States (1014), 17, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (1014), 18, (164, 0), 4);
- Add_Action (Table.States (1014), 24, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (1014), 26, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (1014), 27, (193, 0), 5);
- Add_Action (Table.States (1014), 28, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (1014), 31, (306, 3), 9);
- Add_Action (Table.States (1014), 32, (225, 0), 10);
- Add_Action (Table.States (1014), 37, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (1014), 41, (306, 0), 13);
- Add_Action (Table.States (1014), 48, (260, 0), 16);
- Add_Action (Table.States (1014), 52, (279, 0), 20);
- Add_Action (Table.States (1014), 57, (293, 0), 21);
- Add_Action (Table.States (1014), 58, (199, 0), 22);
- Add_Action (Table.States (1014), 61, (129, 0), 24);
- Add_Action (Table.States (1014), 73, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (1014), 81, (242, 8), 31);
- Add_Action (Table.States (1014), 96, (220, 0), 32);
- Add_Action (Table.States (1014), 107, (134, 0), 363);
- Add_Action (Table.States (1014), 108, (242, 7), 34);
- Add_Action (Table.States (1014), 109, (242, 6), 35);
- Table.States (1014).Goto_List.Set_Capacity (32);
- Add_Goto (Table.States (1014), 116, 37);
- Add_Goto (Table.States (1014), 126, 39);
- Add_Goto (Table.States (1014), 129, 40);
- Add_Goto (Table.States (1014), 131, 42);
- Add_Goto (Table.States (1014), 134, 43);
- Add_Goto (Table.States (1014), 135, 44);
- Add_Goto (Table.States (1014), 136, 45);
- Add_Goto (Table.States (1014), 142, 48);
- Add_Goto (Table.States (1014), 154, 51);
- Add_Goto (Table.States (1014), 155, 52);
- Add_Goto (Table.States (1014), 164, 54);
- Add_Goto (Table.States (1014), 193, 58);
- Add_Goto (Table.States (1014), 199, 60);
- Add_Goto (Table.States (1014), 220, 69);
- Add_Goto (Table.States (1014), 221, 1131);
- Add_Goto (Table.States (1014), 225, 71);
- Add_Goto (Table.States (1014), 235, 73);
- Add_Goto (Table.States (1014), 242, 74);
- Add_Goto (Table.States (1014), 260, 84);
- Add_Goto (Table.States (1014), 264, 87);
- Add_Goto (Table.States (1014), 275, 93);
- Add_Goto (Table.States (1014), 279, 94);
- Add_Goto (Table.States (1014), 293, 97);
- Add_Goto (Table.States (1014), 296, 98);
- Add_Goto (Table.States (1014), 297, 99);
- Add_Goto (Table.States (1014), 301, 100);
- Add_Goto (Table.States (1014), 302, 364);
- Add_Goto (Table.States (1014), 303, 393);
- Add_Goto (Table.States (1014), 305, 101);
- Add_Goto (Table.States (1014), 306, 102);
- Add_Goto (Table.States (1014), 309, 366);
- Add_Goto (Table.States (1014), 326, 115);
- Table.States (1014).Kernel := To_Vector ((0 => ((250, 0), 13, 2,
(2147483647, 0), 0)));
- Table.States (1014).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (221, 1), 0)));
- Table.States (1015).Action_List.Set_Capacity (5);
- Add_Action (Table.States (1015), 81, (242, 8), 31);
- Add_Action (Table.States (1015), 99, Reduce, (243, 1), 0, null,
null);
- Add_Action (Table.States (1015), 107, (242, 5), 120);
- Add_Action (Table.States (1015), 108, (242, 7), 34);
- Add_Action (Table.States (1015), 109, (242, 6), 35);
- Table.States (1015).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (1015), 131, 42);
- Add_Goto (Table.States (1015), 242, 644);
- Add_Goto (Table.States (1015), 243, 1132);
- Add_Goto (Table.States (1015), 275, 93);
- Add_Goto (Table.States (1015), 296, 98);
- Table.States (1015).Kernel := To_Vector ((0 => ((250, 1), 24, 1,
(2147483647, 0), 0)));
- Table.States (1015).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (243, 1), 0)));
- end Subr_18;
- procedure Subr_19
- is begin
- Table.States (1016).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1016), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (216, 0), 7,
- generic_instantiation_0'Access, null);
- Table.States (1016).Kernel := To_Vector ((0 => ((216, 0), 99, 0,
(216, 0), 7)));
- Table.States (1016).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (216, 0), 7)));
- Table.States (1017).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1017), (1 => 99), (254, 1), 7,
package_specification_1'Access,
- package_specification_1_check'Access);
- Table.States (1017).Kernel := To_Vector ((0 => ((254, 1), 243,
0, (254, 1), 7)));
- Table.States (1017).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (254, 1), 7)));
- Table.States (1018).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1018), 24, (254, 0), 1133);
- Table.States (1018).Kernel := To_Vector ((0 => ((254, 0), 162,
1, (2147483647, 0), 0)));
- Table.States (1018).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (254, 0), 24, 1133)));
- Table.States (1019).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1019), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (268, 0), 7,
- protected_body_stub_0'Access, null);
- Table.States (1019).Kernel := To_Vector ((0 => ((268, 0), 99, 0,
(268, 0), 7)));
- Table.States (1019).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (268, 0), 7)));
- Table.States (1020).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1020), 72, Reduce, (256, 1), 0, null,
null);
- Add_Action (Table.States (1020), 76, (180, 0), 1134);
- Table.States (1020).Goto_List.Set_Capacity (3);
- Add_Goto (Table.States (1020), 180, 1135);
- Add_Goto (Table.States (1020), 202, 347);
- Add_Goto (Table.States (1020), 256, 1136);
- Table.States (1020).Kernel := To_Vector ((0 => ((179, 0), 107,
5, (2147483647, 0), 0)));
- Table.States (1020).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (180, 1), 0)));
- Table.States (1021).Action_List.Set_Capacity (3);
- Add_Action (Table.States (1021), 35, Reduce, (125, 1), 0, null,
null);
- Add_Action (Table.States (1021), 74, (125, 0), 340);
- Add_Action (Table.States (1021), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (1021).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (1021), 125, 433);
- Table.States (1021).Kernel := To_Vector ((((310, 0), 315, 4,
(2147483647, 0), 0), ((312, 0), 315, 1,
- (2147483647, 0), 0)));
- Table.States (1021).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (1022).Action_List.Set_Capacity (7);
- Add_Action (Table.States (1022), (24, 25, 28, 29, 40, 46, 50),
(271, 0), 2, null, null);
- Table.States (1022).Kernel := To_Vector ((0 => ((271, 0), 270,
0, (271, 0), 2)));
- Table.States (1022).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (271, 0), 2)));
- Table.States (1023).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1023), 99, Reduce, (223, 1), 0, null,
null);
- Add_Action (Table.States (1023), 107, (223, 0), 151);
- Table.States (1023).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (1023), 223, 1137);
- Table.States (1023).Kernel := To_Vector ((0 => ((267, 0), 24, 1,
(2147483647, 0), 0)));
- Table.States (1023).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (223, 1), 0)));
- Table.States (1024).Action_List.Set_Capacity (4);
- Add_Action (Table.States (1024), 81, (242, 8), 31);
- Add_Action (Table.States (1024), 107, (242, 5), 120);
- Add_Action (Table.States (1024), 108, (242, 7), 34);
- Add_Action (Table.States (1024), 109, (242, 6), 35);
- Table.States (1024).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (1024), 131, 42);
- Add_Goto (Table.States (1024), 230, 1138);
- Add_Goto (Table.States (1024), 242, 859);
- Add_Goto (Table.States (1024), 275, 93);
- Add_Goto (Table.States (1024), 296, 98);
- Table.States (1024).Kernel := To_Vector ((0 => ((274, 0), 39, 4,
(2147483647, 0), 0)));
- Table.States (1024).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (1025).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1025), 99, (274, 1), 1139);
- Table.States (1025).Kernel := To_Vector ((0 => ((274, 1), 269,
1, (2147483647, 0), 0)));
- Table.States (1025).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (274, 1), 99, 1139)));
- Table.States (1026).Action_List.Set_Capacity (4);
- Add_Action (Table.States (1026), 81, (242, 8), 31);
- Add_Action (Table.States (1026), 107, (242, 5), 120);
- Add_Action (Table.States (1026), 108, (242, 7), 34);
- Add_Action (Table.States (1026), 109, (242, 6), 35);
- Table.States (1026).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (1026), 131, 42);
- Add_Goto (Table.States (1026), 242, 1140);
- Add_Goto (Table.States (1026), 275, 93);
- Add_Goto (Table.States (1026), 296, 98);
- Table.States (1026).Kernel := To_Vector ((0 => ((230, 0), 10, 1,
(2147483647, 0), 0)));
- Table.States (1026).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (1027).Action_List.Set_Capacity (17);
- Add_Action (Table.States (1027), 24, Reduce, (162, 1), 0, null,
null);
- Add_Action (Table.States (1027), 25, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (1027), 28, (124, 0), 185);
- Add_Action (Table.States (1027), 29, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (1027), 30, (213, 0), 8);
- Add_Action (Table.States (1027), 40, (249, 0), 12);
- Add_Action (Table.States (1027), 46, (249, 1), 14);
- Add_Action (Table.States (1027), 47, (216, 0), 15);
- Add_Action (Table.States (1027), 48, (260, 0), 16);
- Add_Action (Table.States (1027), 49, Reduce, (162, 1), 0, null,
null);
- Add_Action (Table.States (1027), 50, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (1027), 51, (267, 0), 19);
- Add_Action (Table.States (1027), 63, (316, 0), 25);
- Add_Action (Table.States (1027), 66, (308, 0), 26);
- Add_Action (Table.States (1027), 69, (209, 0), 27);
- Add_Action (Table.States (1027), 71, (334, 0), 28);
- Add_Action (Table.States (1027), 107, (222, 1), 187);
- Table.States (1027).Goto_List.Set_Capacity (54);
- Add_Goto (Table.States (1027), 115, 36);
- Add_Goto (Table.States (1027), 124, 38);
- Add_Goto (Table.States (1027), 130, 41);
- Add_Goto (Table.States (1027), 137, 46);
- Add_Goto (Table.States (1027), 138, 47);
- Add_Goto (Table.States (1027), 160, 394);
- Add_Goto (Table.States (1027), 161, 395);
- Add_Goto (Table.States (1027), 162, 681);
- Add_Goto (Table.States (1027), 182, 55);
- Add_Goto (Table.States (1027), 185, 56);
- Add_Goto (Table.States (1027), 189, 57);
- Add_Goto (Table.States (1027), 196, 59);
- Add_Goto (Table.States (1027), 209, 61);
- Add_Goto (Table.States (1027), 210, 62);
- Add_Goto (Table.States (1027), 212, 63);
- Add_Goto (Table.States (1027), 213, 64);
- Add_Goto (Table.States (1027), 216, 65);
- Add_Goto (Table.States (1027), 217, 66);
- Add_Goto (Table.States (1027), 218, 67);
- Add_Goto (Table.States (1027), 219, 68);
- Add_Goto (Table.States (1027), 222, 70);
- Add_Goto (Table.States (1027), 226, 72);
- Add_Goto (Table.States (1027), 246, 75);
- Add_Goto (Table.States (1027), 247, 76);
- Add_Goto (Table.States (1027), 248, 77);
- Add_Goto (Table.States (1027), 249, 78);
- Add_Goto (Table.States (1027), 250, 79);
- Add_Goto (Table.States (1027), 251, 80);
- Add_Goto (Table.States (1027), 252, 81);
- Add_Goto (Table.States (1027), 253, 82);
- Add_Goto (Table.States (1027), 254, 83);
- Add_Goto (Table.States (1027), 260, 397);
- Add_Goto (Table.States (1027), 262, 85);
- Add_Goto (Table.States (1027), 263, 86);
- Add_Goto (Table.States (1027), 265, 88);
- Add_Goto (Table.States (1027), 266, 89);
- Add_Goto (Table.States (1027), 267, 90);
- Add_Goto (Table.States (1027), 268, 91);
- Add_Goto (Table.States (1027), 269, 1141);
- Add_Goto (Table.States (1027), 274, 92);
- Add_Goto (Table.States (1027), 284, 95);
- Add_Goto (Table.States (1027), 292, 96);
- Add_Goto (Table.States (1027), 307, 103);
- Add_Goto (Table.States (1027), 308, 104);
- Add_Goto (Table.States (1027), 310, 106);
- Add_Goto (Table.States (1027), 311, 107);
- Add_Goto (Table.States (1027), 312, 108);
- Add_Goto (Table.States (1027), 314, 109);
- Add_Goto (Table.States (1027), 316, 110);
- Add_Goto (Table.States (1027), 319, 112);
- Add_Goto (Table.States (1027), 320, 113);
- Add_Goto (Table.States (1027), 322, 114);
- Add_Goto (Table.States (1027), 328, 116);
- Add_Goto (Table.States (1027), 334, 117);
- Table.States (1027).Kernel := To_Vector ((0 => ((307, 0), 74, 2,
(2147483647, 0), 0)));
- Table.States (1027).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (162, 1), 0)));
- Table.States (1028).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1028), (1 => 99), (269, 1), 3,
protected_definition_1'Access,
- protected_definition_1_check'Access);
- Table.States (1028).Kernel := To_Vector ((0 => ((269, 1), 223,
0, (269, 1), 3)));
- Table.States (1028).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (269, 1), 3)));
- Table.States (1029).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1029), 24, (269, 0), 1142);
- Table.States (1029).Kernel := To_Vector ((0 => ((269, 0), 162,
1, (2147483647, 0), 0)));
- Table.States (1029).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (269, 0), 24, 1142)));
- Table.States (1030).Action_List.Set_Capacity (16);
- Add_Action (Table.States (1030), 3, (200, 2), 122);
- Add_Action (Table.States (1030), 21, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (1030), 39, (261, 4), 123);
- Add_Action (Table.States (1030), 40, (200, 3), 124);
- Add_Action (Table.States (1030), 41, (261, 1), 125);
- Add_Action (Table.States (1030), 52, (278, 0), 126);
- Add_Action (Table.States (1030), 76, (120, 0), 127);
- Add_Action (Table.States (1030), 77, (120, 5), 128);
- Add_Action (Table.States (1030), 81, (242, 8), 31);
- Add_Action (Table.States (1030), 97, (333, 1), 129);
- Add_Action (Table.States (1030), 98, (333, 0), 130);
- Add_Action (Table.States (1030), 99, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (1030), 106, (261, 0), 131);
- Add_Action (Table.States (1030), 107, (242, 5), 120);
- Add_Action (Table.States (1030), 108, (242, 7), 34);
- Add_Action (Table.States (1030), 109, (242, 6), 35);
- Table.States (1030).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (1030), 120, 132);
- Add_Goto (Table.States (1030), 131, 42);
- Add_Goto (Table.States (1030), 194, 133);
- Add_Goto (Table.States (1030), 195, 1143);
- Add_Goto (Table.States (1030), 200, 135);
- Add_Goto (Table.States (1030), 242, 136);
- Add_Goto (Table.States (1030), 261, 137);
- Add_Goto (Table.States (1030), 275, 93);
- Add_Goto (Table.States (1030), 278, 138);
- Add_Goto (Table.States (1030), 285, 139);
- Add_Goto (Table.States (1030), 286, 140);
- Add_Goto (Table.States (1030), 287, 141);
- Add_Goto (Table.States (1030), 288, 142);
- Add_Goto (Table.States (1030), 289, 143);
- Add_Goto (Table.States (1030), 290, 144);
- Add_Goto (Table.States (1030), 296, 98);
- Add_Goto (Table.States (1030), 304, 145);
- Add_Goto (Table.States (1030), 323, 146);
- Add_Goto (Table.States (1030), 324, 147);
- Add_Goto (Table.States (1030), 333, 148);
- Table.States (1030).Kernel := To_Vector ((0 => ((197, 0), 85, 0,
(195, 1), 0)));
- Table.States (1030).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (1031).Action_List.Set_Capacity (47);
- Add_Action (Table.States (1031), (4, 5, 13, 15, 17, 18, 22, 23,
24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (199, 0), 7, extended_return_statement_0'Access, null);
- Table.States (1031).Kernel := To_Vector ((0 => ((199, 0), 99, 0,
(199, 0), 7)));
- Table.States (1031).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (199, 0), 7)));
- Table.States (1032).Action_List.Set_Capacity (6);
- Add_Action (Table.States (1032), 35, Reduce, (125, 1), 0, null,
null);
- Add_Action (Table.States (1032), 74, (125, 0), 340);
- Add_Action (Table.States (1032), 76, (118, 0), 237);
- Add_Action (Table.States (1032), 87, (296, 0), 239);
- Add_Action (Table.States (1032), 104, (325, 0), 241);
- Add_Action (Table.States (1032), 105, (325, 1), 242);
- Table.States (1032).Goto_List.Set_Capacity (3);
- Add_Goto (Table.States (1032), 118, 243);
- Add_Goto (Table.States (1032), 125, 518);
- Add_Goto (Table.States (1032), 325, 244);
- Table.States (1032).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((242, 0), 242, 5,
- (2147483647, 0), 0), ((242, 1), 242, 2, (2147483647, 0), 0),
((250, 0), 242, 4, (2147483647, 0), 0),
- ((250, 1), 242, 3, (2147483647, 0), 0), ((275, 0), 242, 3,
(2147483647, 0), 0), ((296, 0), 242, 2,
- (2147483647, 0), 0), ((296, 1), 242, 2, (2147483647, 0), 0),
((296, 2), 242, 2, (2147483647, 0), 0),
- ((296, 3), 242, 2, (2147483647, 0), 0)));
- Table.States (1032).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (1033).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1033), 35, Reduce, (125, 1), 0, null,
null);
- Add_Action (Table.States (1033), 74, (125, 0), 340);
- Table.States (1033).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (1033), 125, 528);
- Table.States (1033).Kernel := To_Vector ((0 => ((267, 0), 107,
3, (2147483647, 0), 0)));
- Table.States (1033).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (1034).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1034), 35, Reduce, (125, 1), 0, null,
null);
- Add_Action (Table.States (1034), 74, (125, 0), 340);
- Table.States (1034).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (1034), 125, 548);
- Table.States (1034).Kernel := To_Vector ((0 => ((319, 0), 107,
4, (2147483647, 0), 0)));
- Table.States (1034).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (1035).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1035), 35, (310, 0), 595);
- Table.States (1035).Kernel := To_Vector ((0 => ((310, 0), 125,
4, (2147483647, 0), 0)));
- Table.States (1035).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (310, 0), 35, 595)));
- Table.States (1036).Action_List.Set_Capacity (47);
- Add_Action (Table.States (1036), (4, 5, 13, 15, 17, 18, 22, 23,
24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (155, 0), 7, conditional_entry_call_0'Access, null);
- Table.States (1036).Kernel := To_Vector ((0 => ((155, 0), 99, 0,
(155, 0), 7)));
- Table.States (1036).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (155, 0), 7)));
- Table.States (1037).Action_List.Set_Capacity (47);
- Add_Action (Table.States (1037), (4, 5, 13, 15, 17, 18, 22, 23,
24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (326, 0), 7, timed_entry_call_0'Access, null);
- Table.States (1037).Kernel := To_Vector ((0 => ((326, 0), 99, 0,
(326, 0), 7)));
- Table.States (1037).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (326, 0), 7)));
- Table.States (1038).Action_List.Set_Capacity (47);
- Add_Action (Table.States (1038), (4, 5, 13, 15, 17, 18, 22, 23,
24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (297, 0), 7, selective_accept_0'Access, null);
- Table.States (1038).Kernel := To_Vector ((0 => ((297, 0), 99, 0,
(297, 0), 7)));
- Table.States (1038).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (297, 0), 7)));
- Table.States (1039).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1039), 99, (129, 0), 1144);
- Table.States (1039).Kernel := To_Vector ((0 => ((129, 0), 61, 1,
(2147483647, 0), 0)));
- Table.States (1039).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (129, 0), 99, 1144)));
- Table.States (1040).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1040), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (320, 0), 7,
- task_body_stub_0'Access, null);
- Table.States (1040).Kernel := To_Vector ((0 => ((320, 0), 99, 0,
(320, 0), 7)));
- Table.States (1040).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (320, 0), 7)));
- Table.States (1041).Action_List.Set_Capacity (25);
- Add_Action (Table.States (1041), 4, (116, 0), 1);
- Add_Action (Table.States (1041), 5, (306, 8), 2);
- Add_Action (Table.States (1041), 13, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (1041), 15, (142, 0), 3);
- Add_Action (Table.States (1041), 17, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (1041), 18, (164, 0), 4);
- Add_Action (Table.States (1041), 24, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (1041), 26, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (1041), 27, (193, 0), 5);
- Add_Action (Table.States (1041), 28, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (1041), 31, (306, 3), 9);
- Add_Action (Table.States (1041), 32, (225, 0), 10);
- Add_Action (Table.States (1041), 37, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (1041), 41, (306, 0), 13);
- Add_Action (Table.States (1041), 48, (260, 0), 16);
- Add_Action (Table.States (1041), 52, (279, 0), 20);
- Add_Action (Table.States (1041), 57, (293, 0), 21);
- Add_Action (Table.States (1041), 58, (199, 0), 22);
- Add_Action (Table.States (1041), 61, (129, 0), 24);
- Add_Action (Table.States (1041), 73, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (1041), 81, (242, 8), 31);
- Add_Action (Table.States (1041), 96, (220, 0), 32);
- Add_Action (Table.States (1041), 107, (134, 0), 363);
- Add_Action (Table.States (1041), 108, (242, 7), 34);
- Add_Action (Table.States (1041), 109, (242, 6), 35);
- Table.States (1041).Goto_List.Set_Capacity (32);
- Add_Goto (Table.States (1041), 116, 37);
- Add_Goto (Table.States (1041), 126, 39);
- Add_Goto (Table.States (1041), 129, 40);
- Add_Goto (Table.States (1041), 131, 42);
- Add_Goto (Table.States (1041), 134, 43);
- Add_Goto (Table.States (1041), 135, 44);
- Add_Goto (Table.States (1041), 136, 45);
- Add_Goto (Table.States (1041), 142, 48);
- Add_Goto (Table.States (1041), 154, 51);
- Add_Goto (Table.States (1041), 155, 52);
- Add_Goto (Table.States (1041), 164, 54);
- Add_Goto (Table.States (1041), 193, 58);
- Add_Goto (Table.States (1041), 199, 60);
- Add_Goto (Table.States (1041), 220, 69);
- Add_Goto (Table.States (1041), 221, 1145);
- Add_Goto (Table.States (1041), 225, 71);
- Add_Goto (Table.States (1041), 235, 73);
- Add_Goto (Table.States (1041), 242, 74);
- Add_Goto (Table.States (1041), 260, 84);
- Add_Goto (Table.States (1041), 264, 87);
- Add_Goto (Table.States (1041), 275, 93);
- Add_Goto (Table.States (1041), 279, 94);
- Add_Goto (Table.States (1041), 293, 97);
- Add_Goto (Table.States (1041), 296, 98);
- Add_Goto (Table.States (1041), 297, 99);
- Add_Goto (Table.States (1041), 301, 100);
- Add_Goto (Table.States (1041), 302, 364);
- Add_Goto (Table.States (1041), 303, 393);
- Add_Goto (Table.States (1041), 305, 101);
- Add_Goto (Table.States (1041), 306, 102);
- Add_Goto (Table.States (1041), 309, 366);
- Add_Goto (Table.States (1041), 326, 115);
- Table.States (1041).Kernel := To_Vector ((0 => ((319, 0), 13, 2,
(2147483647, 0), 0)));
- Table.States (1041).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (221, 1), 0)));
- Table.States (1042).Action_List.Set_Capacity (4);
- Add_Action (Table.States (1042), 81, (242, 8), 31);
- Add_Action (Table.States (1042), 107, (242, 5), 120);
- Add_Action (Table.States (1042), 108, (242, 7), 34);
- Add_Action (Table.States (1042), 109, (242, 6), 35);
- Table.States (1042).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (1042), 131, 42);
- Add_Goto (Table.States (1042), 230, 1146);
- Add_Goto (Table.States (1042), 242, 859);
- Add_Goto (Table.States (1042), 275, 93);
- Add_Goto (Table.States (1042), 296, 98);
- Table.States (1042).Kernel := To_Vector ((0 => ((322, 0), 39, 4,
(2147483647, 0), 0)));
- Table.States (1042).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (1043).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1043), 24, (322, 1), 1147);
- Table.States (1043).Kernel := To_Vector ((0 => ((322, 1), 321,
2, (2147483647, 0), 0)));
- Table.States (1043).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (322, 1), 24, 1147)));
- Table.States (1044).Action_List.Set_Capacity (17);
- Add_Action (Table.States (1044), 24, Reduce, (162, 1), 0, null,
null);
- Add_Action (Table.States (1044), 25, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (1044), 28, (124, 0), 185);
- Add_Action (Table.States (1044), 29, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (1044), 30, (213, 0), 8);
- Add_Action (Table.States (1044), 40, (249, 0), 12);
- Add_Action (Table.States (1044), 46, (249, 1), 14);
- Add_Action (Table.States (1044), 47, (216, 0), 15);
- Add_Action (Table.States (1044), 48, (260, 0), 16);
- Add_Action (Table.States (1044), 49, Reduce, (162, 1), 0, null,
null);
- Add_Action (Table.States (1044), 50, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (1044), 51, (267, 0), 19);
- Add_Action (Table.States (1044), 63, (316, 0), 25);
- Add_Action (Table.States (1044), 66, (308, 0), 26);
- Add_Action (Table.States (1044), 69, (209, 0), 27);
- Add_Action (Table.States (1044), 71, (334, 0), 28);
- Add_Action (Table.States (1044), 107, (222, 1), 187);
- Table.States (1044).Goto_List.Set_Capacity (54);
- Add_Goto (Table.States (1044), 115, 36);
- Add_Goto (Table.States (1044), 124, 38);
- Add_Goto (Table.States (1044), 130, 41);
- Add_Goto (Table.States (1044), 137, 46);
- Add_Goto (Table.States (1044), 138, 47);
- Add_Goto (Table.States (1044), 160, 394);
- Add_Goto (Table.States (1044), 161, 395);
- Add_Goto (Table.States (1044), 162, 706);
- Add_Goto (Table.States (1044), 182, 55);
- Add_Goto (Table.States (1044), 185, 56);
- Add_Goto (Table.States (1044), 189, 57);
- Add_Goto (Table.States (1044), 196, 59);
- Add_Goto (Table.States (1044), 209, 61);
- Add_Goto (Table.States (1044), 210, 62);
- Add_Goto (Table.States (1044), 212, 63);
- Add_Goto (Table.States (1044), 213, 64);
- Add_Goto (Table.States (1044), 216, 65);
- Add_Goto (Table.States (1044), 217, 66);
- Add_Goto (Table.States (1044), 218, 67);
- Add_Goto (Table.States (1044), 219, 68);
- Add_Goto (Table.States (1044), 222, 70);
- Add_Goto (Table.States (1044), 226, 72);
- Add_Goto (Table.States (1044), 246, 75);
- Add_Goto (Table.States (1044), 247, 76);
- Add_Goto (Table.States (1044), 248, 77);
- Add_Goto (Table.States (1044), 249, 78);
- Add_Goto (Table.States (1044), 250, 79);
- Add_Goto (Table.States (1044), 251, 80);
- Add_Goto (Table.States (1044), 252, 81);
- Add_Goto (Table.States (1044), 253, 82);
- Add_Goto (Table.States (1044), 254, 83);
- Add_Goto (Table.States (1044), 260, 397);
- Add_Goto (Table.States (1044), 262, 85);
- Add_Goto (Table.States (1044), 263, 86);
- Add_Goto (Table.States (1044), 265, 88);
- Add_Goto (Table.States (1044), 266, 89);
- Add_Goto (Table.States (1044), 267, 90);
- Add_Goto (Table.States (1044), 268, 91);
- Add_Goto (Table.States (1044), 274, 92);
- Add_Goto (Table.States (1044), 284, 95);
- Add_Goto (Table.States (1044), 292, 96);
- Add_Goto (Table.States (1044), 307, 103);
- Add_Goto (Table.States (1044), 308, 104);
- Add_Goto (Table.States (1044), 310, 106);
- Add_Goto (Table.States (1044), 311, 107);
- Add_Goto (Table.States (1044), 312, 108);
- Add_Goto (Table.States (1044), 314, 109);
- Add_Goto (Table.States (1044), 316, 110);
- Add_Goto (Table.States (1044), 319, 112);
- Add_Goto (Table.States (1044), 320, 113);
- Add_Goto (Table.States (1044), 321, 1148);
- Add_Goto (Table.States (1044), 322, 114);
- Add_Goto (Table.States (1044), 328, 116);
- Add_Goto (Table.States (1044), 334, 117);
- Table.States (1044).Kernel := To_Vector ((0 => ((308, 0), 74, 2,
(2147483647, 0), 0)));
- Table.States (1044).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (321, 1), 0)));
- Table.States (1045).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1045), (1 => 24), (321, 0), 3,
task_definition_0'Access, null);
- Table.States (1045).Kernel := To_Vector ((0 => ((321, 0), 162,
0, (321, 0), 3)));
- Table.States (1045).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (321, 0), 3)));
- Table.States (1046).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1046), 99, (308, 1), 1149);
- Table.States (1046).Kernel := To_Vector ((0 => ((308, 1), 223,
1, (2147483647, 0), 0)));
- Table.States (1046).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (308, 1), 99, 1149)));
- Table.States (1047).Action_List.Set_Capacity (5);
- Add_Action (Table.States (1047), 7, Reduce, (244, 0), 2, null,
null);
- Add_Action (Table.States (1047), 81, (242, 8), 31);
- Add_Action (Table.States (1047), 107, (242, 5), 1150);
- Add_Action (Table.States (1047), 108, (242, 7), 34);
- Add_Action (Table.States (1047), 109, (242, 6), 35);
- Table.States (1047).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (1047), 131, 42);
- Add_Goto (Table.States (1047), 242, 889);
- Add_Goto (Table.States (1047), 275, 93);
- Add_Goto (Table.States (1047), 296, 1151);
- Table.States (1047).Kernel := To_Vector ((((244, 0), 41, 0,
(244, 0), 2), ((245, 2), 41, 1,
- (2147483647, 0), 0), ((245, 3), 41, 3, (2147483647, 0), 0)));
- Table.States (1047).Minimal_Complete_Actions := To_Vector
(((Reduce, (244, 0), 2), (Shift, (242, 5), 107,
- 1150)));
- Table.States (1048).Action_List.Set_Capacity (16);
- Add_Action (Table.States (1048), 3, (200, 2), 122);
- Add_Action (Table.States (1048), 39, (261, 4), 123);
- Add_Action (Table.States (1048), 40, (200, 3), 124);
- Add_Action (Table.States (1048), 41, (261, 1), 125);
- Add_Action (Table.States (1048), 52, (278, 0), 126);
- Add_Action (Table.States (1048), 76, (120, 0), 127);
- Add_Action (Table.States (1048), 77, (120, 5), 128);
- Add_Action (Table.States (1048), 78, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (1048), 81, (242, 8), 31);
- Add_Action (Table.States (1048), 97, (333, 1), 129);
- Add_Action (Table.States (1048), 98, (333, 0), 130);
- Add_Action (Table.States (1048), 99, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (1048), 106, (261, 0), 131);
- Add_Action (Table.States (1048), 107, (242, 5), 120);
- Add_Action (Table.States (1048), 108, (242, 7), 34);
- Add_Action (Table.States (1048), 109, (242, 6), 35);
- Table.States (1048).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (1048), 120, 132);
- Add_Goto (Table.States (1048), 131, 42);
- Add_Goto (Table.States (1048), 194, 133);
- Add_Goto (Table.States (1048), 195, 1152);
- Add_Goto (Table.States (1048), 200, 135);
- Add_Goto (Table.States (1048), 242, 136);
- Add_Goto (Table.States (1048), 261, 137);
- Add_Goto (Table.States (1048), 275, 93);
- Add_Goto (Table.States (1048), 278, 138);
- Add_Goto (Table.States (1048), 285, 139);
- Add_Goto (Table.States (1048), 286, 140);
- Add_Goto (Table.States (1048), 287, 141);
- Add_Goto (Table.States (1048), 288, 142);
- Add_Goto (Table.States (1048), 289, 143);
- Add_Goto (Table.States (1048), 290, 144);
- Add_Goto (Table.States (1048), 296, 98);
- Add_Goto (Table.States (1048), 304, 145);
- Add_Goto (Table.States (1048), 323, 146);
- Add_Goto (Table.States (1048), 324, 147);
- Add_Goto (Table.States (1048), 333, 148);
- Table.States (1048).Kernel := To_Vector ((0 => ((173, 1), 85, 0,
(195, 1), 0)));
- Table.States (1048).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (1049).Action_List.Set_Capacity (16);
- Add_Action (Table.States (1049), 3, (200, 2), 122);
- Add_Action (Table.States (1049), 39, (261, 4), 123);
- Add_Action (Table.States (1049), 40, (200, 3), 124);
- Add_Action (Table.States (1049), 41, (261, 1), 125);
- Add_Action (Table.States (1049), 52, (278, 0), 126);
- Add_Action (Table.States (1049), 76, (120, 0), 127);
- Add_Action (Table.States (1049), 77, (120, 5), 128);
- Add_Action (Table.States (1049), 78, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (1049), 81, (242, 8), 31);
- Add_Action (Table.States (1049), 97, (333, 1), 129);
- Add_Action (Table.States (1049), 98, (333, 0), 130);
- Add_Action (Table.States (1049), 99, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (1049), 106, (261, 0), 131);
- Add_Action (Table.States (1049), 107, (242, 5), 120);
- Add_Action (Table.States (1049), 108, (242, 7), 34);
- Add_Action (Table.States (1049), 109, (242, 6), 35);
- Table.States (1049).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (1049), 120, 132);
- Add_Goto (Table.States (1049), 131, 42);
- Add_Goto (Table.States (1049), 194, 133);
- Add_Goto (Table.States (1049), 195, 1153);
- Add_Goto (Table.States (1049), 200, 135);
- Add_Goto (Table.States (1049), 242, 136);
- Add_Goto (Table.States (1049), 261, 137);
- Add_Goto (Table.States (1049), 275, 93);
- Add_Goto (Table.States (1049), 278, 138);
- Add_Goto (Table.States (1049), 285, 139);
- Add_Goto (Table.States (1049), 286, 140);
- Add_Goto (Table.States (1049), 287, 141);
- Add_Goto (Table.States (1049), 288, 142);
- Add_Goto (Table.States (1049), 289, 143);
- Add_Goto (Table.States (1049), 290, 144);
- Add_Goto (Table.States (1049), 296, 98);
- Add_Goto (Table.States (1049), 304, 145);
- Add_Goto (Table.States (1049), 323, 146);
- Add_Goto (Table.States (1049), 324, 147);
- Add_Goto (Table.States (1049), 333, 148);
- Table.States (1049).Kernel := To_Vector ((0 => ((173, 0), 85, 0,
(195, 1), 0)));
- Table.States (1049).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (1050).Action_List.Set_Capacity (3);
- Add_Action (Table.States (1050), (41, 49, 54), (114, 0), 3, null,
null);
- Table.States (1050).Kernel := To_Vector ((0 => ((114, 0), 36, 0,
(114, 0), 3)));
- Table.States (1050).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (114, 0), 3)));
- Table.States (1051).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1051), 78, (123, 1), 1154);
- Add_Action (Table.States (1051), 86, (171, 0), 979);
- Table.States (1051).Kernel := To_Vector ((((123, 1), 171, 3,
(2147483647, 0), 0), ((171, 0), 171, 2,
- (2147483647, 0), 0)));
- Table.States (1051).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (123, 1), 78, 1154)));
- Table.States (1052).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1052), (78, 86), (229, 1), 1, null,
null);
- Table.States (1052).Kernel := To_Vector ((0 => ((229, 1), 228,
0, (229, 1), 1)));
- Table.States (1052).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (229, 1), 1)));
- Table.States (1053).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1053), 78, (123, 0), 1155);
- Add_Action (Table.States (1053), 86, (229, 0), 1156);
- Table.States (1053).Kernel := To_Vector ((((123, 0), 229, 3,
(2147483647, 0), 0), ((229, 0), 229, 4,
- (2147483647, 0), 0)));
- Table.States (1053).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (123, 0), 78, 1155)));
- Table.States (1054).Action_List.Set_Capacity (16);
- Add_Action (Table.States (1054), 38, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (1054), 53, (158, 0), 1157);
- Add_Action (Table.States (1054), 55, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (1054), 76, (118, 0), 633);
- Add_Action (Table.States (1054), 78, Reduce, (317, 3), 1,
subtype_indication_3'Access, null);
- Add_Action (Table.States (1054), 80, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (1054), 86, Reduce, (317, 3), 1,
subtype_indication_3'Access, null);
- Add_Action (Table.States (1054), 87, (296, 0), 239);
- Add_Action (Table.States (1054), 88, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (1054), 97, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (1054), 98, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (1054), 100, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (1054), 102, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (1054), 103, Reduce, (261, 3), 1, null,
null);
- Add_Action (Table.States (1054), 104, (325, 0), 241);
- Add_Action (Table.States (1054), 105, (325, 1), 242);
- Table.States (1054).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (1054), 118, 243);
- Add_Goto (Table.States (1054), 158, 634);
- Add_Goto (Table.States (1054), 227, 635);
- Add_Goto (Table.States (1054), 325, 454);
- Table.States (1054).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((228, 0), 242, 2,
- (2147483647, 0), 0), ((242, 0), 242, 5, (2147483647, 0), 0),
((242, 1), 242, 2, (2147483647, 0), 0),
- ((261, 3), 242, 0, (261, 3), 1), ((275, 0), 242, 3,
(2147483647, 0), 0), ((280, 0), 242, 4,
- (2147483647, 0), 0), ((280, 1), 242, 2, (2147483647, 0), 0),
((296, 0), 242, 2, (2147483647, 0), 0),
- ((296, 1), 242, 2, (2147483647, 0), 0), ((296, 2), 242, 2,
(2147483647, 0), 0), ((296, 3), 242, 2,
- (2147483647, 0), 0), ((317, 2), 242, 4, (2147483647, 0), 0),
((317, 3), 242, 0, (317, 3), 1)));
- Table.States (1054).Minimal_Complete_Actions := To_Vector
(((Shift, (158, 0), 53, 1157), (Reduce, (261,
- 3), 1), (Reduce, (317, 3), 1)));
- Table.States (1055).Action_List.Set_Capacity (17);
- Add_Action (Table.States (1055), 3, (200, 2), 122);
- Add_Action (Table.States (1055), 39, (261, 4), 123);
- Add_Action (Table.States (1055), 40, (200, 3), 124);
- Add_Action (Table.States (1055), 41, (261, 1), 125);
- Add_Action (Table.States (1055), 52, (278, 0), 126);
- Add_Action (Table.States (1055), 53, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (1055), 74, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (1055), 76, (120, 0), 127);
- Add_Action (Table.States (1055), 77, (120, 5), 128);
- Add_Action (Table.States (1055), 81, (242, 8), 31);
- Add_Action (Table.States (1055), 97, (333, 1), 129);
- Add_Action (Table.States (1055), 98, (333, 0), 130);
- Add_Action (Table.States (1055), 99, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (1055), 106, (261, 0), 131);
- Add_Action (Table.States (1055), 107, (242, 5), 120);
- Add_Action (Table.States (1055), 108, (242, 7), 34);
- Add_Action (Table.States (1055), 109, (242, 6), 35);
- Table.States (1055).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (1055), 120, 132);
- Add_Goto (Table.States (1055), 131, 42);
- Add_Goto (Table.States (1055), 194, 133);
- Add_Goto (Table.States (1055), 195, 1158);
- Add_Goto (Table.States (1055), 200, 135);
- Add_Goto (Table.States (1055), 242, 136);
- Add_Goto (Table.States (1055), 261, 137);
- Add_Goto (Table.States (1055), 275, 93);
- Add_Goto (Table.States (1055), 278, 138);
- Add_Goto (Table.States (1055), 285, 139);
- Add_Goto (Table.States (1055), 286, 140);
- Add_Goto (Table.States (1055), 287, 141);
- Add_Goto (Table.States (1055), 288, 142);
- Add_Goto (Table.States (1055), 289, 143);
- Add_Goto (Table.States (1055), 290, 144);
- Add_Goto (Table.States (1055), 296, 98);
- Add_Goto (Table.States (1055), 304, 145);
- Add_Goto (Table.States (1055), 323, 146);
- Add_Goto (Table.States (1055), 324, 147);
- Add_Goto (Table.States (1055), 333, 148);
- Table.States (1055).Kernel := To_Vector ((0 => ((329, 4), 20, 0,
(195, 1), 0)));
- Table.States (1055).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (1056).Action_List.Set_Capacity (13);
- Add_Action (Table.States (1056), 3, (200, 2), 122);
- Add_Action (Table.States (1056), 39, (261, 4), 123);
- Add_Action (Table.States (1056), 40, (200, 3), 124);
- Add_Action (Table.States (1056), 41, (261, 1), 125);
- Add_Action (Table.States (1056), 76, (120, 0), 127);
- Add_Action (Table.States (1056), 77, (120, 5), 128);
- Add_Action (Table.States (1056), 81, (242, 8), 31);
- Add_Action (Table.States (1056), 97, (333, 1), 129);
- Add_Action (Table.States (1056), 98, (333, 0), 130);
- Add_Action (Table.States (1056), 106, (261, 0), 131);
- Add_Action (Table.States (1056), 107, (242, 5), 120);
- Add_Action (Table.States (1056), 108, (242, 7), 34);
- Add_Action (Table.States (1056), 109, (242, 6), 35);
- Table.States (1056).Goto_List.Set_Capacity (11);
- Add_Goto (Table.States (1056), 120, 132);
- Add_Goto (Table.States (1056), 131, 42);
- Add_Goto (Table.States (1056), 200, 135);
- Add_Goto (Table.States (1056), 242, 136);
- Add_Goto (Table.States (1056), 261, 137);
- Add_Goto (Table.States (1056), 275, 93);
- Add_Goto (Table.States (1056), 296, 98);
- Add_Goto (Table.States (1056), 304, 1159);
- Add_Goto (Table.States (1056), 323, 146);
- Add_Goto (Table.States (1056), 324, 147);
- Add_Goto (Table.States (1056), 333, 148);
- Table.States (1056).Kernel := To_Vector ((0 => ((282, 0), 53, 3,
(2147483647, 0), 0)));
- Table.States (1056).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (1057).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1057), (74, 99), (329, 5), 3, null,
null);
- Table.States (1057).Kernel := To_Vector ((0 => ((329, 5), 282,
0, (329, 5), 3)));
- Table.States (1057).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (329, 5), 3)));
- Table.States (1058).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1058), (74, 99), (329, 3), 3, null,
null);
- Table.States (1058).Kernel := To_Vector ((0 => ((329, 3), 282,
0, (329, 3), 3)));
- Table.States (1058).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (329, 3), 3)));
- Table.States (1059).Action_List.Set_Capacity (4);
- Add_Action (Table.States (1059), 81, (242, 8), 31);
- Add_Action (Table.States (1059), 107, (242, 5), 120);
- Add_Action (Table.States (1059), 108, (242, 7), 34);
- Add_Action (Table.States (1059), 109, (242, 6), 35);
- Table.States (1059).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (1059), 131, 42);
- Add_Goto (Table.States (1059), 230, 1160);
- Add_Goto (Table.States (1059), 242, 859);
- Add_Goto (Table.States (1059), 275, 93);
- Add_Goto (Table.States (1059), 296, 98);
- Table.States (1059).Kernel := To_Vector ((0 => ((231, 0), 10, 1,
(2147483647, 0), 0)));
- Table.States (1059).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (1060).Action_List.Set_Capacity (4);
- Add_Action (Table.States (1060), 81, (242, 8), 31);
- Add_Action (Table.States (1060), 107, (242, 5), 120);
- Add_Action (Table.States (1060), 108, (242, 7), 34);
- Add_Action (Table.States (1060), 109, (242, 6), 35);
- Table.States (1060).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (1060), 131, 42);
- Add_Goto (Table.States (1060), 230, 1161);
- Add_Goto (Table.States (1060), 242, 859);
- Add_Goto (Table.States (1060), 275, 93);
- Add_Goto (Table.States (1060), 296, 98);
- Table.States (1060).Kernel := To_Vector ((0 => ((231, 2), 10, 1,
(2147483647, 0), 0)));
- Table.States (1060).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (1061).Action_List.Set_Capacity (13);
- Add_Action (Table.States (1061), 3, (200, 2), 122);
- Add_Action (Table.States (1061), 39, (261, 4), 123);
- Add_Action (Table.States (1061), 40, (200, 3), 124);
- Add_Action (Table.States (1061), 41, (261, 1), 125);
- Add_Action (Table.States (1061), 76, (120, 0), 127);
- Add_Action (Table.States (1061), 77, (120, 5), 128);
- Add_Action (Table.States (1061), 81, (242, 8), 31);
- Add_Action (Table.States (1061), 97, (333, 1), 129);
- Add_Action (Table.States (1061), 98, (333, 0), 130);
- Add_Action (Table.States (1061), 106, (261, 0), 131);
- Add_Action (Table.States (1061), 107, (242, 5), 120);
- Add_Action (Table.States (1061), 108, (242, 7), 34);
- Add_Action (Table.States (1061), 109, (242, 6), 35);
- Table.States (1061).Goto_List.Set_Capacity (11);
- Add_Goto (Table.States (1061), 120, 132);
- Add_Goto (Table.States (1061), 131, 42);
- Add_Goto (Table.States (1061), 200, 135);
- Add_Goto (Table.States (1061), 242, 136);
- Add_Goto (Table.States (1061), 261, 137);
- Add_Goto (Table.States (1061), 275, 93);
- Add_Goto (Table.States (1061), 296, 98);
- Add_Goto (Table.States (1061), 304, 1162);
- Add_Goto (Table.States (1061), 323, 146);
- Add_Goto (Table.States (1061), 324, 147);
- Add_Goto (Table.States (1061), 333, 148);
- Table.States (1061).Kernel := To_Vector ((0 => ((329, 1), 88, 1,
(2147483647, 0), 0)));
- Table.States (1061).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (1062).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1062), (1 => 35), (166, 0), 1, null,
null);
- Table.States (1062).Kernel := To_Vector ((0 => ((166, 0), 107,
0, (166, 0), 1)));
- Table.States (1062).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (166, 0), 1)));
- Table.States (1063).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1063), (1 => 35), (166, 1), 1, null,
null);
- Table.States (1063).Kernel := To_Vector ((0 => ((166, 1), 108,
0, (166, 1), 1)));
- Table.States (1063).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (166, 1), 1)));
- Table.States (1064).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1064), (1 => 35), (167, 0), 1, null,
null);
- Table.States (1064).Kernel := To_Vector ((0 => ((167, 0), 166,
0, (167, 0), 1)));
- Table.States (1064).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (167, 0), 1)));
- Table.States (1065).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1065), 35, (330, 0), 1163);
- Table.States (1065).Kernel := To_Vector ((0 => ((330, 0), 167,
6, (2147483647, 0), 0)));
- Table.States (1065).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (330, 0), 35, 1163)));
- Table.States (1066).Action_List.Set_Capacity (5);
- Add_Action (Table.States (1066), (15, 24, 28, 72, 107), (152, 4),
2, component_list_4'Access, null);
- Table.States (1066).Kernel := To_Vector ((0 => ((152, 4), 99, 0,
(152, 4), 2)));
- Table.States (1066).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (152, 4), 2)));
- Table.States (1067).Action_List.Set_Capacity (5);
- Add_Action (Table.States (1067), (15, 24, 28, 72, 107), (152, 0),
2, null, null);
- Table.States (1067).Kernel := To_Vector ((0 => ((152, 0), 151,
0, (152, 0), 2)));
- Table.States (1067).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (152, 0), 2)));
- Table.States (1068).Action_List.Set_Capacity (5);
- Add_Action (Table.States (1068), (15, 24, 28, 72, 107), (152, 1),
2, null, null);
- Table.States (1068).Kernel := To_Vector ((0 => ((152, 1), 330,
0, (152, 1), 2)));
- Table.States (1068).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (152, 1), 2)));
- Table.States (1069).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1069), 54, (283, 0), 1164);
- Table.States (1069).Kernel := To_Vector ((0 => ((283, 0), 24, 1,
(2147483647, 0), 0)));
- Table.States (1069).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (283, 0), 54, 1164)));
- Table.States (1070).Action_List.Set_Capacity (7);
- Add_Action (Table.States (1070), 7, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (1070), 8, (150, 0), 1165);
- Add_Action (Table.States (1070), 40, (244, 0), 756);
- Add_Action (Table.States (1070), 81, (242, 8), 31);
- Add_Action (Table.States (1070), 107, (242, 5), 120);
- Add_Action (Table.States (1070), 108, (242, 7), 34);
- Add_Action (Table.States (1070), 109, (242, 6), 35);
- Table.States (1070).Goto_List.Set_Capacity (8);
- Add_Goto (Table.States (1070), 117, 1166);
- Add_Goto (Table.States (1070), 131, 42);
- Add_Goto (Table.States (1070), 150, 1167);
- Add_Goto (Table.States (1070), 242, 491);
- Add_Goto (Table.States (1070), 244, 735);
- Add_Goto (Table.States (1070), 275, 93);
- Add_Goto (Table.States (1070), 296, 98);
- Add_Goto (Table.States (1070), 317, 1168);
- Table.States (1070).Kernel := To_Vector ((((149, 0), 84, 3,
(2147483647, 0), 0), ((149, 1), 84, 2,
- (2147483647, 0), 0)));
- Table.States (1070).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- end Subr_19;
- procedure Subr_20
- is begin
- Table.States (1071).Action_List.Set_Capacity (4);
- Add_Action (Table.States (1071), 81, (242, 8), 31);
- Add_Action (Table.States (1071), 107, (242, 5), 120);
- Add_Action (Table.States (1071), 108, (242, 7), 34);
- Add_Action (Table.States (1071), 109, (242, 6), 35);
- Table.States (1071).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (1071), 131, 42);
- Add_Goto (Table.States (1071), 230, 1169);
- Add_Goto (Table.States (1071), 242, 859);
- Add_Goto (Table.States (1071), 275, 93);
- Add_Goto (Table.States (1071), 296, 98);
- Table.States (1071).Kernel := To_Vector ((0 => ((231, 3), 10, 1,
(2147483647, 0), 0)));
- Table.States (1071).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (1072).Action_List.Set_Capacity (4);
- Add_Action (Table.States (1072), 81, (242, 8), 31);
- Add_Action (Table.States (1072), 107, (242, 5), 120);
- Add_Action (Table.States (1072), 108, (242, 7), 34);
- Add_Action (Table.States (1072), 109, (242, 6), 35);
- Table.States (1072).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (1072), 131, 42);
- Add_Goto (Table.States (1072), 230, 1170);
- Add_Goto (Table.States (1072), 242, 859);
- Add_Goto (Table.States (1072), 275, 93);
- Add_Goto (Table.States (1072), 296, 98);
- Table.States (1072).Kernel := To_Vector ((0 => ((231, 1), 10, 1,
(2147483647, 0), 0)));
- Table.States (1072).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (1073).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1073), (74, 99), (186, 0), 3,
enumeration_type_definition_0'Access, null);
- Table.States (1073).Kernel := To_Vector ((0 => ((186, 0), 78, 0,
(186, 0), 3)));
- Table.States (1073).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (186, 0), 3)));
- Table.States (1074).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1074), 107, (183, 0), 916);
- Add_Action (Table.States (1074), 109, (183, 1), 917);
- Table.States (1074).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (1074), 183, 1171);
- Table.States (1074).Kernel := To_Vector ((0 => ((184, 0), 86, 1,
(2147483647, 0), 0)));
- Table.States (1074).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (183, 0), 107, 916)));
- Table.States (1075).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1075), 10, (122, 0), 1172);
- Add_Action (Table.States (1075), 74, Reduce, (122, 1), 0, null,
null);
- Table.States (1075).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (1075), 122, 1173);
- Table.States (1075).Kernel := To_Vector ((0 => ((262, 0), 317,
3, (2147483647, 0), 0)));
- Table.States (1075).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (122, 1), 0)));
- Table.States (1076).Action_List.Set_Capacity (8);
- Add_Action (Table.States (1076), 10, (122, 0), 1172);
- Add_Action (Table.States (1076), 53, (158, 0), 632);
- Add_Action (Table.States (1076), 74, Reduce, (122, 1), 0, null,
null);
- Add_Conflict (Table.States (1076), 74, (159, 1), 0, null, null);
- Add_Action (Table.States (1076), 76, (118, 0), 633);
- Add_Action (Table.States (1076), 87, (296, 0), 239);
- Add_Action (Table.States (1076), 99, Reduce, (159, 1), 0, null,
null);
- Add_Action (Table.States (1076), 104, (325, 0), 241);
- Add_Action (Table.States (1076), 105, (325, 1), 242);
- Table.States (1076).Goto_List.Set_Capacity (6);
- Add_Goto (Table.States (1076), 118, 243);
- Add_Goto (Table.States (1076), 122, 1174);
- Add_Goto (Table.States (1076), 158, 1175);
- Add_Goto (Table.States (1076), 159, 1176);
- Add_Goto (Table.States (1076), 227, 635);
- Add_Goto (Table.States (1076), 325, 244);
- Table.States (1076).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((165, 0), 242, 3,
- (2147483647, 0), 0), ((165, 1), 242, 0, (159, 1), 0), ((242,
0), 242, 5, (2147483647, 0), 0), ((242,
- 1), 242, 2, (2147483647, 0), 0), ((275, 0), 242, 3,
(2147483647, 0), 0), ((296, 0), 242, 2,
- (2147483647, 0), 0), ((296, 1), 242, 2, (2147483647, 0), 0),
((296, 2), 242, 2, (2147483647, 0), 0),
- ((296, 3), 242, 2, (2147483647, 0), 0)));
- Table.States (1076).Minimal_Complete_Actions := To_Vector
(((Reduce, (122, 1), 0), (Reduce, (159, 1),
- 0)));
- Table.States (1077).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1077), 99, (263, 0), 1177);
- Table.States (1077).Kernel := To_Vector ((0 => ((263, 0), 125,
1, (2147483647, 0), 0)));
- Table.States (1077).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (263, 0), 99, 1177)));
- Table.States (1078).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1078), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (209, 0), 7,
- full_type_declaration_0'Access, null);
- Table.States (1078).Kernel := To_Vector ((0 => ((209, 0), 99, 0,
(209, 0), 7)));
- Table.States (1078).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (209, 0), 7)));
- Table.States (1079).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1079), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (248, 2), 7,
- object_renaming_declaration_2'Access, null);
- Table.States (1079).Kernel := To_Vector ((0 => ((248, 2), 99, 0,
(248, 2), 7)));
- Table.States (1079).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (248, 2), 7)));
- Table.States (1080).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1080), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (248, 1), 7,
- object_renaming_declaration_1'Access, null);
- Table.States (1080).Kernel := To_Vector ((0 => ((248, 1), 99, 0,
(248, 1), 7)));
- Table.States (1080).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (248, 1), 7)));
- Table.States (1081).Action_List.Set_Capacity (7);
- Add_Action (Table.States (1081), (21, 35, 56, 74, 78, 85, 99),
(117, 1), 5, access_definition_1'Access,
- null);
- Table.States (1081).Kernel := To_Vector ((0 => ((117, 1), 255,
0, (117, 1), 5)));
- Table.States (1081).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (117, 1), 5)));
- Table.States (1082).Action_List.Set_Capacity (7);
- Add_Action (Table.States (1082), (21, 35, 56, 74, 78, 85, 99),
(117, 0), 5, access_definition_0'Access,
- null);
- Table.States (1082).Kernel := To_Vector ((0 => ((117, 0), 256,
0, (117, 0), 5)));
- Table.States (1082).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (117, 0), 5)));
- Table.States (1083).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1083), 99, (248, 0), 1178);
- Table.States (1083).Kernel := To_Vector ((0 => ((248, 0), 125,
1, (2147483647, 0), 0)));
- Table.States (1083).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (248, 0), 99, 1178)));
- Table.States (1084).Action_List.Set_Capacity (5);
- Add_Action (Table.States (1084), 44, (187, 1), 932);
- Add_Action (Table.States (1084), 81, (242, 8), 31);
- Add_Action (Table.States (1084), 107, (242, 5), 120);
- Add_Action (Table.States (1084), 108, (242, 7), 34);
- Add_Action (Table.States (1084), 109, (242, 6), 35);
- Table.States (1084).Goto_List.Set_Capacity (6);
- Add_Goto (Table.States (1084), 131, 42);
- Add_Goto (Table.States (1084), 187, 934);
- Add_Goto (Table.States (1084), 188, 1179);
- Add_Goto (Table.States (1084), 242, 936);
- Add_Goto (Table.States (1084), 275, 93);
- Add_Goto (Table.States (1084), 296, 98);
- Table.States (1084).Kernel := To_Vector ((0 => ((190, 0), 84, 2,
(2147483647, 0), 0)));
- Table.States (1084).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (1085).Action_List.Set_Capacity (5);
- Add_Action (Table.States (1085), 44, (187, 1), 932);
- Add_Action (Table.States (1085), 81, (242, 8), 31);
- Add_Action (Table.States (1085), 107, (242, 5), 120);
- Add_Action (Table.States (1085), 108, (242, 7), 34);
- Add_Action (Table.States (1085), 109, (242, 6), 35);
- Table.States (1085).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (1085), 131, 42);
- Add_Goto (Table.States (1085), 187, 1180);
- Add_Goto (Table.States (1085), 242, 936);
- Add_Goto (Table.States (1085), 275, 93);
- Add_Goto (Table.States (1085), 296, 98);
- Table.States (1085).Kernel := To_Vector ((0 => ((188, 0), 82, 1,
(2147483647, 0), 0)));
- Table.States (1085).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (1086).Action_List.Set_Capacity (25);
- Add_Action (Table.States (1086), 4, (116, 0), 1);
- Add_Action (Table.States (1086), 5, (306, 8), 2);
- Add_Action (Table.States (1086), 13, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (1086), 15, (142, 0), 3);
- Add_Action (Table.States (1086), 17, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (1086), 18, (164, 0), 4);
- Add_Action (Table.States (1086), 24, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (1086), 27, (193, 0), 5);
- Add_Action (Table.States (1086), 28, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (1086), 31, (306, 3), 9);
- Add_Action (Table.States (1086), 32, (225, 0), 10);
- Add_Action (Table.States (1086), 37, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (1086), 41, (306, 0), 13);
- Add_Action (Table.States (1086), 48, (260, 0), 16);
- Add_Action (Table.States (1086), 52, (279, 0), 20);
- Add_Action (Table.States (1086), 57, (293, 0), 21);
- Add_Action (Table.States (1086), 58, (199, 0), 22);
- Add_Action (Table.States (1086), 61, (129, 0), 24);
- Add_Action (Table.States (1086), 72, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (1086), 73, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (1086), 81, (242, 8), 31);
- Add_Action (Table.States (1086), 96, (220, 0), 32);
- Add_Action (Table.States (1086), 107, (134, 0), 363);
- Add_Action (Table.States (1086), 108, (242, 7), 34);
- Add_Action (Table.States (1086), 109, (242, 6), 35);
- Table.States (1086).Goto_List.Set_Capacity (31);
- Add_Goto (Table.States (1086), 116, 37);
- Add_Goto (Table.States (1086), 126, 39);
- Add_Goto (Table.States (1086), 129, 40);
- Add_Goto (Table.States (1086), 131, 42);
- Add_Goto (Table.States (1086), 134, 43);
- Add_Goto (Table.States (1086), 135, 44);
- Add_Goto (Table.States (1086), 136, 45);
- Add_Goto (Table.States (1086), 142, 48);
- Add_Goto (Table.States (1086), 154, 51);
- Add_Goto (Table.States (1086), 155, 52);
- Add_Goto (Table.States (1086), 164, 54);
- Add_Goto (Table.States (1086), 193, 58);
- Add_Goto (Table.States (1086), 199, 60);
- Add_Goto (Table.States (1086), 220, 69);
- Add_Goto (Table.States (1086), 225, 71);
- Add_Goto (Table.States (1086), 235, 73);
- Add_Goto (Table.States (1086), 242, 74);
- Add_Goto (Table.States (1086), 260, 84);
- Add_Goto (Table.States (1086), 264, 87);
- Add_Goto (Table.States (1086), 275, 93);
- Add_Goto (Table.States (1086), 279, 94);
- Add_Goto (Table.States (1086), 293, 97);
- Add_Goto (Table.States (1086), 296, 98);
- Add_Goto (Table.States (1086), 297, 99);
- Add_Goto (Table.States (1086), 301, 100);
- Add_Goto (Table.States (1086), 302, 364);
- Add_Goto (Table.States (1086), 303, 1181);
- Add_Goto (Table.States (1086), 305, 101);
- Add_Goto (Table.States (1086), 306, 102);
- Add_Goto (Table.States (1086), 309, 366);
- Add_Goto (Table.States (1086), 326, 115);
- Table.States (1086).Kernel := To_Vector ((0 => ((190, 1), 90, 0,
(303, 1), 0)));
- Table.States (1086).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (303, 1), 0)));
- Table.States (1087).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1087), 99, (136, 0), 1182);
- Table.States (1087).Kernel := To_Vector ((0 => ((136, 0), 223,
1, (2147483647, 0), 0)));
- Table.States (1087).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (136, 0), 99, 1182)));
- Table.States (1088).Action_List.Set_Capacity (47);
- Add_Action (Table.States (1088), (4, 5, 13, 15, 17, 18, 22, 23,
24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (235, 1), 7, loop_statement_1'Access,
loop_statement_1_check'Access);
- Table.States (1088).Kernel := To_Vector ((0 => ((235, 1), 99, 0,
(235, 1), 7)));
- Table.States (1088).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (235, 1), 7)));
- Table.States (1089).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1089), 99, (235, 0), 1183);
- Table.States (1089).Kernel := To_Vector ((0 => ((235, 0), 223,
1, (2147483647, 0), 0)));
- Table.States (1089).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (235, 0), 99, 1183)));
- Table.States (1090).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1090), 74, (125, 0), 340);
- Add_Action (Table.States (1090), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (1090).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (1090), 125, 1184);
- Table.States (1090).Kernel := To_Vector ((0 => ((247, 1), 195,
1, (2147483647, 0), 0)));
- Table.States (1090).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (1091).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1091), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (247, 4), 7,
- object_declaration_4'Access, null);
- Table.States (1091).Kernel := To_Vector ((0 => ((247, 4), 99, 0,
(247, 4), 7)));
- Table.States (1091).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (247, 4), 7)));
- Table.States (1092).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1092), 74, (125, 0), 340);
- Add_Action (Table.States (1092), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (1092).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (1092), 125, 1185);
- Table.States (1092).Kernel := To_Vector ((0 => ((247, 2), 195,
1, (2147483647, 0), 0)));
- Table.States (1092).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (1093).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1093), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (247, 5), 7,
- object_declaration_5'Access, null);
- Table.States (1093).Kernel := To_Vector ((0 => ((247, 5), 99, 0,
(247, 5), 7)));
- Table.States (1093).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (247, 5), 7)));
- Table.States (1094).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1094), 74, (125, 0), 340);
- Add_Action (Table.States (1094), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (1094).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (1094), 125, 1186);
- Table.States (1094).Kernel := To_Vector ((0 => ((247, 0), 195,
1, (2147483647, 0), 0)));
- Table.States (1094).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (1095).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1095), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (247, 3), 7,
- object_declaration_3'Access, null);
- Table.States (1095).Kernel := To_Vector ((0 => ((247, 3), 99, 0,
(247, 3), 7)));
- Table.States (1095).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (247, 3), 7)));
- Table.States (1096).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1096), 74, (125, 0), 340);
- Add_Action (Table.States (1096), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (1096).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (1096), 125, 1187);
- Table.States (1096).Kernel := To_Vector ((0 => ((182, 0), 256,
1, (2147483647, 0), 0)));
- Table.States (1096).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (1097).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1097), 99, (216, 2), 1188);
- Table.States (1097).Kernel := To_Vector ((0 => ((216, 2), 125,
1, (2147483647, 0), 0)));
- Table.States (1097).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (216, 2), 99, 1188)));
- Table.States (1098).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1098), 99, (216, 1), 1189);
- Table.States (1098).Kernel := To_Vector ((0 => ((216, 1), 125,
1, (2147483647, 0), 0)));
- Table.States (1098).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (216, 1), 99, 1189)));
- Table.States (1099).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1099), 24, (310, 0), 1190);
- Table.States (1099).Kernel := To_Vector ((0 => ((310, 0), 221,
2, (2147483647, 0), 0)));
- Table.States (1099).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (310, 0), 24, 1190)));
- Table.States (1100).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1100), 99, (116, 0), 1191);
- Table.States (1100).Kernel := To_Vector ((0 => ((116, 0), 223,
1, (2147483647, 0), 0)));
- Table.States (1100).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (116, 0), 99, 1191)));
- Table.States (1101).Action_List.Set_Capacity (16);
- Add_Action (Table.States (1101), 3, (200, 2), 122);
- Add_Action (Table.States (1101), 39, (261, 4), 123);
- Add_Action (Table.States (1101), 40, (200, 3), 124);
- Add_Action (Table.States (1101), 41, (261, 1), 125);
- Add_Action (Table.States (1101), 52, (278, 0), 126);
- Add_Action (Table.States (1101), 76, (120, 0), 127);
- Add_Action (Table.States (1101), 77, (120, 5), 128);
- Add_Action (Table.States (1101), 78, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (1101), 81, (242, 8), 31);
- Add_Action (Table.States (1101), 86, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (1101), 97, (333, 1), 129);
- Add_Action (Table.States (1101), 98, (333, 0), 130);
- Add_Action (Table.States (1101), 106, (261, 0), 131);
- Add_Action (Table.States (1101), 107, (242, 5), 120);
- Add_Action (Table.States (1101), 108, (242, 7), 34);
- Add_Action (Table.States (1101), 109, (242, 6), 35);
- Table.States (1101).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (1101), 120, 132);
- Add_Goto (Table.States (1101), 131, 42);
- Add_Goto (Table.States (1101), 194, 133);
- Add_Goto (Table.States (1101), 195, 1192);
- Add_Goto (Table.States (1101), 200, 135);
- Add_Goto (Table.States (1101), 242, 136);
- Add_Goto (Table.States (1101), 261, 137);
- Add_Goto (Table.States (1101), 275, 93);
- Add_Goto (Table.States (1101), 278, 138);
- Add_Goto (Table.States (1101), 285, 139);
- Add_Goto (Table.States (1101), 286, 140);
- Add_Goto (Table.States (1101), 287, 141);
- Add_Goto (Table.States (1101), 288, 142);
- Add_Goto (Table.States (1101), 289, 143);
- Add_Goto (Table.States (1101), 290, 144);
- Add_Goto (Table.States (1101), 296, 98);
- Add_Goto (Table.States (1101), 304, 145);
- Add_Goto (Table.States (1101), 323, 146);
- Add_Goto (Table.States (1101), 324, 147);
- Add_Goto (Table.States (1101), 333, 148);
- Table.States (1101).Kernel := To_Vector ((0 => ((140, 0), 90, 0,
(195, 1), 0)));
- Table.States (1101).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (1102).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1102), (78, 86), (141, 0), 3,
case_expression_alternative_list_0'Access, null);
- Table.States (1102).Kernel := To_Vector ((0 => ((141, 0), 140,
0, (141, 0), 3)));
- Table.States (1102).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (141, 0), 3)));
- Table.States (1103).Action_List.Set_Capacity (9);
- Add_Action (Table.States (1103), 53, (158, 0), 632);
- Add_Action (Table.States (1103), 76, (118, 0), 633);
- Add_Action (Table.States (1103), 78, Reduce, (317, 1), 3,
subtype_indication_1'Access, null);
- Add_Action (Table.States (1103), 82, Reduce, (168, 1), 3, null,
null);
- Add_Action (Table.States (1103), 86, Reduce, (317, 1), 3,
subtype_indication_1'Access, null);
- Add_Action (Table.States (1103), 87, (296, 0), 239);
- Add_Action (Table.States (1103), 90, Reduce, (168, 1), 3, null,
null);
- Add_Conflict (Table.States (1103), 90, (317, 1), 3,
subtype_indication_1'Access, null);
- Add_Action (Table.States (1103), 104, (325, 0), 241);
- Add_Action (Table.States (1103), 105, (325, 1), 242);
- Table.States (1103).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (1103), 118, 243);
- Add_Goto (Table.States (1103), 158, 977);
- Add_Goto (Table.States (1103), 227, 635);
- Add_Goto (Table.States (1103), 325, 244);
- Table.States (1103).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((168, 1), 242, 0,
- (168, 1), 3), ((242, 0), 242, 5, (2147483647, 0), 0), ((242,
1), 242, 2, (2147483647, 0), 0), ((275,
- 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0), 0),
- ((317, 0), 242, 4, (2147483647, 0), 0), ((317, 1), 242, 0,
(317, 1), 3)));
- Table.States (1103).Minimal_Complete_Actions := To_Vector
(((Reduce, (168, 1), 3), (Shift, (158, 0), 53,
- 632), (Reduce, (317, 1), 3)));
- Table.States (1104).Action_List.Set_Capacity (5);
- Add_Action (Table.States (1104), (35, 78, 79, 86, 99), (127, 6),
6, association_opt_6'Access, null);
- Table.States (1104).Kernel := To_Vector ((0 => ((127, 6), 194,
0, (127, 6), 6)));
- Table.States (1104).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (127, 6), 6)));
- Table.States (1105).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1105), (1 => 78), (224, 1), 6,
if_expression_1'Access, null);
- Table.States (1105).Kernel := To_Vector ((0 => ((224, 1), 195,
0, (224, 1), 6)));
- Table.States (1105).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (224, 1), 6)));
- Table.States (1106).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1106), 68, (175, 0), 1193);
- Table.States (1106).Kernel := To_Vector ((0 => ((175, 0), 195,
1, (2147483647, 0), 0)));
- Table.States (1106).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (175, 0), 68, 1193)));
- Table.States (1107).Action_List.Set_Capacity (15);
- Add_Action (Table.States (1107), 3, (200, 2), 122);
- Add_Action (Table.States (1107), 39, (261, 4), 123);
- Add_Action (Table.States (1107), 40, (200, 3), 124);
- Add_Action (Table.States (1107), 41, (261, 1), 125);
- Add_Action (Table.States (1107), 52, (278, 0), 126);
- Add_Action (Table.States (1107), 76, (120, 0), 127);
- Add_Action (Table.States (1107), 77, (120, 5), 128);
- Add_Action (Table.States (1107), 78, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (1107), 81, (242, 8), 31);
- Add_Action (Table.States (1107), 97, (333, 1), 129);
- Add_Action (Table.States (1107), 98, (333, 0), 130);
- Add_Action (Table.States (1107), 106, (261, 0), 131);
- Add_Action (Table.States (1107), 107, (242, 5), 120);
- Add_Action (Table.States (1107), 108, (242, 7), 34);
- Add_Action (Table.States (1107), 109, (242, 6), 35);
- Table.States (1107).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (1107), 120, 132);
- Add_Goto (Table.States (1107), 131, 42);
- Add_Goto (Table.States (1107), 194, 133);
- Add_Goto (Table.States (1107), 195, 1194);
- Add_Goto (Table.States (1107), 200, 135);
- Add_Goto (Table.States (1107), 242, 136);
- Add_Goto (Table.States (1107), 261, 137);
- Add_Goto (Table.States (1107), 275, 93);
- Add_Goto (Table.States (1107), 278, 138);
- Add_Goto (Table.States (1107), 285, 139);
- Add_Goto (Table.States (1107), 286, 140);
- Add_Goto (Table.States (1107), 287, 141);
- Add_Goto (Table.States (1107), 288, 142);
- Add_Goto (Table.States (1107), 289, 143);
- Add_Goto (Table.States (1107), 290, 144);
- Add_Goto (Table.States (1107), 296, 98);
- Add_Goto (Table.States (1107), 304, 145);
- Add_Goto (Table.States (1107), 323, 146);
- Add_Goto (Table.States (1107), 324, 147);
- Add_Goto (Table.States (1107), 333, 148);
- Table.States (1107).Kernel := To_Vector ((0 => ((224, 0), 22, 0,
(195, 1), 0)));
- Table.States (1107).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (1108).Action_List.Set_Capacity (3);
- Add_Action (Table.States (1108), (22, 23, 78), (176, 0), 2,
elsif_expression_list_0'Access, null);
- Table.States (1108).Kernel := To_Vector ((0 => ((176, 0), 175,
0, (176, 0), 2)));
- Table.States (1108).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (176, 0), 2)));
- Table.States (1109).Action_List.Set_Capacity (20);
- Add_Action (Table.States (1109), (10, 20, 21, 22, 23, 35, 37, 42,
43, 53, 68, 74, 75, 78, 79, 82, 85, 86,
- 90, 99), (280, 0), 6, range_g_0'Access, null);
- Table.States (1109).Kernel := To_Vector ((0 => ((280, 0), 78, 0,
(280, 0), 6)));
- Table.States (1109).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (280, 0), 6)));
- Table.States (1110).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1110), (78, 86), (171, 0), 3, null,
null);
- Table.States (1110).Kernel := To_Vector ((0 => ((171, 0), 170,
0, (171, 0), 3)));
- Table.States (1110).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (171, 0), 3)));
- Table.States (1111).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1111), (1 => 107), (238, 0), 4, null,
null);
- Table.States (1111).Kernel := To_Vector ((0 => ((238, 0), 99, 0,
(238, 0), 4)));
- Table.States (1111).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (238, 0), 4)));
- Table.States (1112).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1112), 53, (147, 0), 1195);
- Table.States (1112).Kernel := To_Vector ((0 => ((147, 0), 304,
5, (2147483647, 0), 0)));
- Table.States (1112).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (147, 0), 53, 1195)));
- Table.States (1113).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1113), 99, (284, 0), 1196);
- Table.States (1113).Kernel := To_Vector ((0 => ((284, 0), 54, 1,
(2147483647, 0), 0)));
- Table.States (1113).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (284, 0), 99, 1196)));
- Table.States (1114).Action_List.Set_Capacity (16);
- Add_Action (Table.States (1114), 3, (200, 2), 122);
- Add_Action (Table.States (1114), 39, (261, 4), 123);
- Add_Action (Table.States (1114), 40, (200, 3), 124);
- Add_Action (Table.States (1114), 41, (261, 1), 125);
- Add_Action (Table.States (1114), 52, (278, 0), 126);
- Add_Action (Table.States (1114), 76, (120, 0), 127);
- Add_Action (Table.States (1114), 77, (120, 5), 128);
- Add_Action (Table.States (1114), 78, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (1114), 81, (242, 8), 31);
- Add_Action (Table.States (1114), 97, (333, 1), 129);
- Add_Action (Table.States (1114), 98, (333, 0), 130);
- Add_Action (Table.States (1114), 99, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (1114), 106, (261, 0), 131);
- Add_Action (Table.States (1114), 107, (242, 5), 120);
- Add_Action (Table.States (1114), 108, (242, 7), 34);
- Add_Action (Table.States (1114), 109, (242, 6), 35);
- Table.States (1114).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (1114), 120, 132);
- Add_Goto (Table.States (1114), 131, 42);
- Add_Goto (Table.States (1114), 194, 133);
- Add_Goto (Table.States (1114), 195, 1197);
- Add_Goto (Table.States (1114), 200, 135);
- Add_Goto (Table.States (1114), 242, 136);
- Add_Goto (Table.States (1114), 261, 137);
- Add_Goto (Table.States (1114), 275, 93);
- Add_Goto (Table.States (1114), 278, 138);
- Add_Goto (Table.States (1114), 285, 139);
- Add_Goto (Table.States (1114), 286, 140);
- Add_Goto (Table.States (1114), 287, 141);
- Add_Goto (Table.States (1114), 288, 142);
- Add_Goto (Table.States (1114), 289, 143);
- Add_Goto (Table.States (1114), 290, 144);
- Add_Goto (Table.States (1114), 296, 98);
- Add_Goto (Table.States (1114), 304, 145);
- Add_Goto (Table.States (1114), 323, 146);
- Add_Goto (Table.States (1114), 324, 147);
- Add_Goto (Table.States (1114), 333, 148);
- Table.States (1114).Kernel := To_Vector ((0 => ((257, 2), 85, 0,
(195, 1), 0)));
- Table.States (1114).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (1115).Action_List.Set_Capacity (4);
- Add_Action (Table.States (1115), 81, (242, 8), 31);
- Add_Action (Table.States (1115), 107, (242, 5), 120);
- Add_Action (Table.States (1115), 108, (242, 7), 34);
- Add_Action (Table.States (1115), 109, (242, 6), 35);
- Table.States (1115).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (1115), 131, 42);
- Add_Goto (Table.States (1115), 242, 1198);
- Add_Goto (Table.States (1115), 275, 93);
- Add_Goto (Table.States (1115), 296, 98);
- Table.States (1115).Kernel := To_Vector ((((257, 0), 244, 2,
(2147483647, 0), 0), ((257, 1), 244, 1,
- (2147483647, 0), 0)));
- Table.States (1115).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (1116).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1116), 83, (205, 6), 1199);
- Table.States (1116).Kernel := To_Vector ((0 => ((205, 6), 20, 1,
(2147483647, 0), 0)));
- Table.States (1116).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (205, 6), 83, 1199)));
- Table.States (1117).Action_List.Set_Capacity (8);
- Add_Action (Table.States (1117), (29, 47, 48, 50, 69, 71, 74,
107), (204, 1), 7,
- formal_type_declaration_1'Access, null);
- Table.States (1117).Kernel := To_Vector ((0 => ((204, 1), 99, 0,
(204, 1), 7)));
- Table.States (1117).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (204, 1), 7)));
- Table.States (1118).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1118), (74, 99), (205, 2), 3, null,
null);
- Table.States (1118).Kernel := To_Vector ((0 => ((205, 2), 78, 0,
(205, 2), 3)));
- Table.States (1118).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (205, 2), 3)));
- Table.States (1119).Action_List.Set_Capacity (7);
- Add_Action (Table.States (1119), 10, (122, 0), 1172);
- Add_Action (Table.States (1119), 74, Reduce, (122, 1), 0, null,
null);
- Add_Action (Table.States (1119), 76, (118, 0), 237);
- Add_Action (Table.States (1119), 87, (296, 0), 239);
- Add_Action (Table.States (1119), 99, Reduce, (122, 1), 0, null,
null);
- Add_Action (Table.States (1119), 104, (325, 0), 241);
- Add_Action (Table.States (1119), 105, (325, 1), 242);
- Table.States (1119).Goto_List.Set_Capacity (3);
- Add_Goto (Table.States (1119), 118, 243);
- Add_Goto (Table.States (1119), 122, 1200);
- Add_Goto (Table.States (1119), 325, 244);
- Table.States (1119).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((206, 0), 242, 2,
- (2147483647, 0), 0), ((206, 1), 242, 0, (122, 1), 0), ((242,
0), 242, 5, (2147483647, 0), 0), ((242,
- 1), 242, 2, (2147483647, 0), 0), ((275, 0), 242, 3,
(2147483647, 0), 0), ((296, 0), 242, 2,
- (2147483647, 0), 0), ((296, 1), 242, 2, (2147483647, 0), 0),
((296, 2), 242, 2, (2147483647, 0), 0),
- ((296, 3), 242, 2, (2147483647, 0), 0)));
- Table.States (1119).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (122, 1), 0)));
- Table.States (1120).Action_List.Set_Capacity (8);
- Add_Action (Table.States (1120), (29, 47, 48, 50, 69, 71, 74,
107), (204, 0), 7,
- formal_type_declaration_0'Access, null);
- Table.States (1120).Kernel := To_Vector ((0 => ((204, 0), 99, 0,
(204, 0), 7)));
- Table.States (1120).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (204, 0), 7)));
- Table.States (1121).Action_List.Set_Capacity (23);
- Add_Action (Table.States (1121), 3, (200, 2), 122);
- Add_Action (Table.States (1121), 15, (139, 0), 260);
- Add_Action (Table.States (1121), 28, (127, 6), 261);
- Add_Action (Table.States (1121), 32, (224, 0), 262);
- Add_Action (Table.States (1121), 39, (261, 4), 123);
- Add_Action (Table.States (1121), 40, (168, 1), 263);
- Add_Action (Table.States (1121), 41, (261, 1), 125);
- Add_Action (Table.States (1121), 44, (168, 3), 265);
- Add_Action (Table.States (1121), 52, (278, 0), 126);
- Add_Action (Table.States (1121), 76, (120, 0), 127);
- Add_Action (Table.States (1121), 77, (120, 5), 128);
- Add_Action (Table.States (1121), 78, Reduce, (127, 5), 0, null,
null);
- Add_Action (Table.States (1121), 81, (242, 8), 31);
- Add_Action (Table.States (1121), 82, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (1121), 83, (208, 0), 1201);
- Add_Action (Table.States (1121), 86, Reduce, (127, 5), 0, null,
null);
- Add_Action (Table.States (1121), 90, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (1121), 97, (333, 1), 129);
- Add_Action (Table.States (1121), 98, (333, 0), 130);
- Add_Action (Table.States (1121), 106, (261, 0), 131);
- Add_Action (Table.States (1121), 107, (242, 5), 120);
- Add_Action (Table.States (1121), 108, (242, 7), 34);
- Add_Action (Table.States (1121), 109, (127, 0), 266);
- Table.States (1121).Goto_List.Set_Capacity (29);
- Add_Goto (Table.States (1121), 120, 132);
- Add_Goto (Table.States (1121), 127, 267);
- Add_Goto (Table.States (1121), 128, 409);
- Add_Goto (Table.States (1121), 131, 42);
- Add_Goto (Table.States (1121), 139, 269);
- Add_Goto (Table.States (1121), 156, 410);
- Add_Goto (Table.States (1121), 168, 271);
- Add_Goto (Table.States (1121), 169, 272);
- Add_Goto (Table.States (1121), 194, 411);
- Add_Goto (Table.States (1121), 200, 135);
- Add_Goto (Table.States (1121), 224, 275);
- Add_Goto (Table.States (1121), 242, 276);
- Add_Goto (Table.States (1121), 261, 137);
- Add_Goto (Table.States (1121), 275, 93);
- Add_Goto (Table.States (1121), 276, 277);
- Add_Goto (Table.States (1121), 278, 138);
- Add_Goto (Table.States (1121), 280, 412);
- Add_Goto (Table.States (1121), 281, 413);
- Add_Goto (Table.States (1121), 285, 139);
- Add_Goto (Table.States (1121), 286, 140);
- Add_Goto (Table.States (1121), 287, 141);
- Add_Goto (Table.States (1121), 288, 142);
- Add_Goto (Table.States (1121), 289, 143);
- Add_Goto (Table.States (1121), 290, 144);
- Add_Goto (Table.States (1121), 296, 98);
- Add_Goto (Table.States (1121), 304, 279);
- Add_Goto (Table.States (1121), 323, 146);
- Add_Goto (Table.States (1121), 324, 147);
- Add_Goto (Table.States (1121), 333, 148);
- Table.States (1121).Kernel := To_Vector ((((118, 0), 76, 1,
(2147483647, 0), 0), ((118, 1), 76, 3,
- (2147483647, 0), 0), ((208, 0), 76, 2, (2147483647, 0), 0),
((242, 0), 76, 4, (2147483647, 0), 0)));
- Table.States (1121).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (128, 1), 0)));
- Table.States (1122).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1122), 74, (125, 0), 340);
- Add_Action (Table.States (1122), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (1122).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (1122), 125, 1202);
- Table.States (1122).Kernel := To_Vector ((0 => ((207, 0), 208,
1, (2147483647, 0), 0)));
- Table.States (1122).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (1123).Action_List.Set_Capacity (8);
- Add_Action (Table.States (1123), (29, 47, 48, 50, 69, 71, 74,
107), (203, 0), 7,
- formal_subprogram_declaration_0'Access, null);
- Table.States (1123).Kernel := To_Vector ((0 => ((203, 0), 99, 0,
(203, 0), 7)));
- Table.States (1123).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (203, 0), 7)));
- Table.States (1124).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1124), 99, (201, 1), 1203);
- Table.States (1124).Kernel := To_Vector ((0 => ((201, 1), 125,
1, (2147483647, 0), 0)));
- Table.States (1124).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (201, 1), 99, 1203)));
- Table.States (1125).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1125), 74, (125, 0), 340);
- Add_Action (Table.States (1125), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (1125).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (1125), 125, 1204);
- Table.States (1125).Kernel := To_Vector ((0 => ((201, 0), 195,
1, (2147483647, 0), 0)));
- Table.States (1125).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (1126).Action_List.Set_Capacity (8);
- Add_Action (Table.States (1126), (29, 47, 48, 50, 69, 71, 74,
107), (201, 2), 7,
- formal_object_declaration_2'Access, null);
- Table.States (1126).Kernel := To_Vector ((0 => ((201, 2), 99, 0,
(201, 2), 7)));
- Table.States (1126).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (201, 2), 7)));
- Table.States (1127).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1127), 99, (225, 1), 1205);
- Table.States (1127).Kernel := To_Vector ((0 => ((225, 1), 32, 1,
(2147483647, 0), 0)));
- Table.States (1127).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (225, 1), 99, 1205)));
- Table.States (1128).Action_List.Set_Capacity (3);
- Add_Action (Table.States (1128), (22, 23, 24), (177, 0), 4,
elsif_statement_item_0'Access, null);
- Table.States (1128).Kernel := To_Vector ((0 => ((177, 0), 303,
0, (177, 0), 4)));
- Table.States (1128).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (177, 0), 4)));
- Table.States (1129).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1129), 32, (225, 0), 1206);
- Table.States (1129).Kernel := To_Vector ((0 => ((225, 0), 24, 2,
(2147483647, 0), 0)));
- Table.States (1129).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (225, 0), 32, 1206)));
- Table.States (1130).Action_List.Set_Capacity (47);
- Add_Action (Table.States (1130), (4, 5, 13, 15, 17, 18, 22, 23,
24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (225, 2), 8, if_statement_2'Access, null);
- Table.States (1130).Kernel := To_Vector ((0 => ((225, 2), 99, 0,
(225, 2), 8)));
- Table.States (1130).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (225, 2), 8)));
- Table.States (1131).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1131), 24, (250, 0), 1207);
- Table.States (1131).Kernel := To_Vector ((0 => ((250, 0), 221,
2, (2147483647, 0), 0)));
- Table.States (1131).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (250, 0), 24, 1207)));
- Table.States (1132).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1132), 99, (250, 1), 1208);
- Table.States (1132).Kernel := To_Vector ((0 => ((250, 1), 243,
1, (2147483647, 0), 0)));
- Table.States (1132).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (250, 1), 99, 1208)));
- Table.States (1133).Action_List.Set_Capacity (5);
- Add_Action (Table.States (1133), 81, (242, 8), 31);
- Add_Action (Table.States (1133), 99, Reduce, (243, 1), 0, null,
null);
- Add_Action (Table.States (1133), 107, (242, 5), 120);
- Add_Action (Table.States (1133), 108, (242, 7), 34);
- Add_Action (Table.States (1133), 109, (242, 6), 35);
- Table.States (1133).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (1133), 131, 42);
- Add_Goto (Table.States (1133), 242, 644);
- Add_Goto (Table.States (1133), 243, 1209);
- Add_Goto (Table.States (1133), 275, 93);
- Add_Goto (Table.States (1133), 296, 98);
- Table.States (1133).Kernel := To_Vector ((0 => ((254, 0), 24, 0,
(243, 1), 0)));
- Table.States (1133).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (243, 1), 0)));
- Table.States (1134).Action_List.Set_Capacity (4);
- Add_Action (Table.States (1134), 28, (180, 0), 1210);
- Add_Action (Table.States (1134), 78, Reduce, (257, 4), 0, null,
null);
- Add_Action (Table.States (1134), 99, Reduce, (257, 4), 0, null,
null);
- Add_Action (Table.States (1134), 107, (222, 1), 166);
- Table.States (1134).Goto_List.Set_Capacity (3);
- Add_Goto (Table.States (1134), 222, 500);
- Add_Goto (Table.States (1134), 257, 501);
- Add_Goto (Table.States (1134), 258, 502);
- Table.States (1134).Kernel := To_Vector ((((180, 0), 76, 5,
(2147483647, 0), 0), ((202, 0), 76, 1,
- (2147483647, 0), 0)));
- Table.States (1134).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (258, 1), 0)));
- Table.States (1135).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1135), 72, (179, 0), 1211);
- Table.States (1135).Kernel := To_Vector ((0 => ((179, 0), 180,
5, (2147483647, 0), 0)));
- Table.States (1135).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (179, 0), 72, 1211)));
- Table.States (1136).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1136), (1 => 72), (180, 1), 1, null,
null);
- Table.States (1136).Kernel := To_Vector ((0 => ((180, 1), 256,
0, (180, 1), 1)));
- Table.States (1136).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (180, 1), 1)));
- Table.States (1137).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1137), 99, (267, 0), 1212);
- Table.States (1137).Kernel := To_Vector ((0 => ((267, 0), 223,
1, (2147483647, 0), 0)));
- Table.States (1137).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (267, 0), 99, 1212)));
- Table.States (1138).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1138), 10, (230, 0), 1026);
- Add_Action (Table.States (1138), 74, (274, 0), 1213);
- Table.States (1138).Kernel := To_Vector ((((230, 0), 230, 2,
(2147483647, 0), 0), ((274, 0), 230, 3,
- (2147483647, 0), 0)));
- Table.States (1138).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (274, 0), 74, 1213)));
- Table.States (1139).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1139), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (274, 1), 8,
- protected_type_declaration_1'Access,
protected_type_declaration_1_check'Access);
- Table.States (1139).Kernel := To_Vector ((0 => ((274, 1), 99, 0,
(274, 1), 8)));
- Table.States (1139).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (274, 1), 8)));
- Table.States (1140).Action_List.Set_Capacity (7);
- Add_Action (Table.States (1140), 10, Reduce, (230, 0), 3,
interface_list_0'Access, null);
- Add_Action (Table.States (1140), 74, Reduce, (230, 0), 3,
interface_list_0'Access, null);
- Add_Action (Table.States (1140), 76, (118, 0), 237);
- Add_Action (Table.States (1140), 87, (296, 0), 239);
- Add_Action (Table.States (1140), 99, Reduce, (230, 0), 3,
interface_list_0'Access, null);
- Add_Action (Table.States (1140), 104, (325, 0), 241);
- Add_Action (Table.States (1140), 105, (325, 1), 242);
- Table.States (1140).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (1140), 118, 243);
- Add_Goto (Table.States (1140), 325, 244);
- Table.States (1140).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((230, 0), 242, 0,
- (230, 0), 3), ((242, 0), 242, 5, (2147483647, 0), 0), ((242,
1), 242, 2, (2147483647, 0), 0), ((275,
- 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (1140).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (230, 0), 3)));
- Table.States (1141).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1141), 99, (307, 0), 1214);
- Table.States (1141).Kernel := To_Vector ((0 => ((307, 0), 269,
1, (2147483647, 0), 0)));
- Table.States (1141).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (307, 0), 99, 1214)));
- Table.States (1142).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1142), 99, Reduce, (223, 1), 0, null,
null);
- Add_Action (Table.States (1142), 107, (223, 0), 151);
- Table.States (1142).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (1142), 223, 1215);
- Table.States (1142).Kernel := To_Vector ((0 => ((269, 0), 24, 0,
(223, 1), 0)));
- Table.States (1142).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (223, 1), 0)));
- Table.States (1143).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1143), (21, 99), (197, 0), 7,
extended_return_object_declaration_0'Access,
- null);
- Table.States (1143).Kernel := To_Vector ((0 => ((197, 0), 195,
0, (197, 0), 7)));
- Table.States (1143).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (197, 0), 7)));
- Table.States (1144).Action_List.Set_Capacity (47);
- Add_Action (Table.States (1144), (4, 5, 13, 15, 17, 18, 22, 23,
24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (129, 0), 8, asynchronous_select_0'Access, null);
- Table.States (1144).Kernel := To_Vector ((0 => ((129, 0), 99, 0,
(129, 0), 8)));
- Table.States (1144).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (129, 0), 8)));
- Table.States (1145).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1145), 24, (319, 0), 1216);
- Table.States (1145).Kernel := To_Vector ((0 => ((319, 0), 221,
2, (2147483647, 0), 0)));
- Table.States (1145).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (319, 0), 24, 1216)));
- Table.States (1146).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1146), 10, (230, 0), 1026);
- Add_Action (Table.States (1146), 74, (322, 0), 1217);
- Table.States (1146).Kernel := To_Vector ((((230, 0), 230, 2,
(2147483647, 0), 0), ((322, 0), 230, 3,
- (2147483647, 0), 0)));
- Table.States (1146).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (322, 0), 74, 1217)));
- Table.States (1147).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1147), 99, Reduce, (223, 1), 0, null,
null);
- Add_Action (Table.States (1147), 107, (223, 0), 151);
- Table.States (1147).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (1147), 223, 1218);
- Table.States (1147).Kernel := To_Vector ((0 => ((322, 1), 24, 1,
(2147483647, 0), 0)));
- Table.States (1147).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (223, 1), 0)));
- Table.States (1148).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1148), 24, (308, 0), 1219);
- Table.States (1148).Kernel := To_Vector ((0 => ((308, 0), 321,
2, (2147483647, 0), 0)));
- Table.States (1148).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (308, 0), 24, 1219)));
- Table.States (1149).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1149), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (308, 1), 8,
- single_task_declaration_1'Access,
single_task_declaration_1_check'Access);
- Table.States (1149).Kernel := To_Vector ((0 => ((308, 1), 99, 0,
(308, 1), 8)));
- Table.States (1149).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (308, 1), 8)));
- Table.States (1150).Action_List.Set_Capacity (7);
- Add_Action (Table.States (1150), 76, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (1150), 78, Reduce, (245, 2), 3,
null_exclusion_opt_name_type_2'Access, null);
- Add_Action (Table.States (1150), 85, Reduce, (245, 2), 3,
null_exclusion_opt_name_type_2'Access, null);
- Add_Action (Table.States (1150), 87, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (1150), 99, Reduce, (245, 2), 3,
null_exclusion_opt_name_type_2'Access, null);
- Add_Action (Table.States (1150), 104, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Add_Action (Table.States (1150), 105, Reduce, (242, 5), 1,
name_5'Access, name_5_check'Access);
- Table.States (1150).Kernel := To_Vector ((((242, 5), 107, 0,
(242, 5), 1), ((245, 2), 107, 0, (245,
- 2), 3)));
- Table.States (1150).Minimal_Complete_Actions := To_Vector
(((Reduce, (242, 5), 1), (Reduce, (245, 2),
- 3)));
- Table.States (1151).Action_List.Set_Capacity (7);
- Add_Action (Table.States (1151), 76, Reduce, (242, 2), 1, null,
name_2_check'Access);
- Add_Action (Table.States (1151), 78, Reduce, (245, 3), 3,
null_exclusion_opt_name_type_3'Access, null);
- Add_Action (Table.States (1151), 85, Reduce, (245, 3), 3,
null_exclusion_opt_name_type_3'Access, null);
- Add_Action (Table.States (1151), 87, Reduce, (242, 2), 1, null,
name_2_check'Access);
- Add_Action (Table.States (1151), 99, Reduce, (245, 3), 3,
null_exclusion_opt_name_type_3'Access, null);
- Add_Action (Table.States (1151), 104, Reduce, (242, 2), 1, null,
name_2_check'Access);
- Add_Action (Table.States (1151), 105, Reduce, (242, 2), 1, null,
name_2_check'Access);
- Table.States (1151).Kernel := To_Vector ((((242, 2), 296, 0,
(242, 2), 1), ((245, 3), 296, 0, (245,
- 3), 3)));
- Table.States (1151).Minimal_Complete_Actions := To_Vector
(((Reduce, (242, 2), 1), (Reduce, (245, 3),
- 3)));
- end Subr_20;
- procedure Subr_21
- is begin
- Table.States (1152).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1152), (78, 99), (173, 1), 5, null,
null);
- Table.States (1152).Kernel := To_Vector ((0 => ((173, 1), 195,
0, (173, 1), 5)));
- Table.States (1152).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (173, 1), 5)));
- Table.States (1153).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1153), (78, 99), (173, 0), 5, null,
null);
- Table.States (1153).Kernel := To_Vector ((0 => ((173, 0), 195,
0, (173, 0), 5)));
- Table.States (1153).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (173, 0), 5)));
- Table.States (1154).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1154), 42, (123, 1), 1220);
- Table.States (1154).Kernel := To_Vector ((0 => ((123, 1), 78, 2,
(2147483647, 0), 0)));
- Table.States (1154).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (123, 1), 42, 1220)));
- Table.States (1155).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1155), 42, (123, 0), 1221);
- Table.States (1155).Kernel := To_Vector ((0 => ((123, 0), 78, 2,
(2147483647, 0), 0)));
- Table.States (1155).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (123, 0), 42, 1221)));
- Table.States (1156).Action_List.Set_Capacity (4);
- Add_Action (Table.States (1156), 81, (242, 8), 31);
- Add_Action (Table.States (1156), 107, (242, 5), 120);
- Add_Action (Table.States (1156), 108, (242, 7), 34);
- Add_Action (Table.States (1156), 109, (242, 6), 35);
- Table.States (1156).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (1156), 131, 42);
- Add_Goto (Table.States (1156), 228, 1222);
- Add_Goto (Table.States (1156), 242, 1223);
- Add_Goto (Table.States (1156), 275, 93);
- Add_Goto (Table.States (1156), 296, 98);
- Table.States (1156).Kernel := To_Vector ((0 => ((229, 0), 86, 3,
(2147483647, 0), 0)));
- Table.States (1156).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (1157).Action_List.Set_Capacity (14);
- Add_Action (Table.States (1157), 3, (200, 2), 122);
- Add_Action (Table.States (1157), 39, (261, 4), 123);
- Add_Action (Table.States (1157), 40, (200, 3), 124);
- Add_Action (Table.States (1157), 41, (261, 1), 125);
- Add_Action (Table.States (1157), 76, (120, 0), 127);
- Add_Action (Table.States (1157), 77, (120, 5), 128);
- Add_Action (Table.States (1157), 81, (242, 8), 31);
- Add_Action (Table.States (1157), 83, (228, 0), 1224);
- Add_Action (Table.States (1157), 97, (333, 1), 129);
- Add_Action (Table.States (1157), 98, (333, 0), 130);
- Add_Action (Table.States (1157), 106, (261, 0), 131);
- Add_Action (Table.States (1157), 107, (242, 5), 120);
- Add_Action (Table.States (1157), 108, (242, 7), 34);
- Add_Action (Table.States (1157), 109, (242, 6), 35);
- Table.States (1157).Goto_List.Set_Capacity (12);
- Add_Goto (Table.States (1157), 120, 132);
- Add_Goto (Table.States (1157), 131, 42);
- Add_Goto (Table.States (1157), 200, 135);
- Add_Goto (Table.States (1157), 242, 276);
- Add_Goto (Table.States (1157), 261, 137);
- Add_Goto (Table.States (1157), 275, 93);
- Add_Goto (Table.States (1157), 280, 792);
- Add_Goto (Table.States (1157), 296, 98);
- Add_Goto (Table.States (1157), 304, 486);
- Add_Goto (Table.States (1157), 323, 146);
- Add_Goto (Table.States (1157), 324, 147);
- Add_Goto (Table.States (1157), 333, 148);
- Table.States (1157).Kernel := To_Vector ((((158, 0), 53, 3,
(2147483647, 0), 0), ((228, 0), 53, 1,
- (2147483647, 0), 0)));
- Table.States (1157).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (228, 0), 83, 1224)));
- Table.States (1158).Action_List.Set_Capacity (3);
- Add_Action (Table.States (1158), 53, (282, 0), 1056);
- Add_Action (Table.States (1158), 74, Reduce, (282, 1), 0, null,
null);
- Add_Action (Table.States (1158), 99, Reduce, (282, 1), 0, null,
null);
- Table.States (1158).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (1158), 282, 1225);
- Table.States (1158).Kernel := To_Vector ((0 => ((329, 4), 195,
0, (282, 1), 0)));
- Table.States (1158).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (282, 1), 0)));
- Table.States (1159).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1159), 88, (282, 0), 1226);
- Table.States (1159).Kernel := To_Vector ((0 => ((282, 0), 304,
2, (2147483647, 0), 0)));
- Table.States (1159).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (282, 0), 88, 1226)));
- Table.States (1160).Action_List.Set_Capacity (3);
- Add_Action (Table.States (1160), 10, (230, 0), 1026);
- Add_Action (Table.States (1160), 74, Reduce, (231, 0), 4, null,
null);
- Add_Action (Table.States (1160), 99, Reduce, (231, 0), 4, null,
null);
- Table.States (1160).Kernel := To_Vector ((((230, 0), 230, 2,
(2147483647, 0), 0), ((231, 0), 230, 0,
- (231, 0), 4)));
- Table.States (1160).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (231, 0), 4)));
- Table.States (1161).Action_List.Set_Capacity (3);
- Add_Action (Table.States (1161), 10, (230, 0), 1026);
- Add_Action (Table.States (1161), 74, Reduce, (231, 2), 4, null,
null);
- Add_Action (Table.States (1161), 99, Reduce, (231, 2), 4, null,
null);
- Table.States (1161).Kernel := To_Vector ((((230, 0), 230, 2,
(2147483647, 0), 0), ((231, 2), 230, 0,
- (231, 2), 4)));
- Table.States (1161).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (231, 2), 4)));
- Table.States (1162).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1162), (74, 99), (329, 1), 4, null,
null);
- Table.States (1162).Kernel := To_Vector ((0 => ((329, 1), 304,
0, (329, 1), 4)));
- Table.States (1162).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (329, 1), 4)));
- Table.States (1163).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1163), 72, (332, 0), 1227);
- Table.States (1163).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (1163), 331, 1228);
- Add_Goto (Table.States (1163), 332, 1229);
- Table.States (1163).Kernel := To_Vector ((0 => ((330, 0), 35, 5,
(2147483647, 0), 0)));
- Table.States (1163).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (332, 0), 72, 1227)));
- Table.States (1164).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1164), (74, 99), (283, 0), 4,
record_definition_0'Access, null);
- Table.States (1164).Kernel := To_Vector ((0 => ((283, 0), 54, 0,
(283, 0), 4)));
- Table.States (1164).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (283, 0), 4)));
- Table.States (1165).Action_List.Set_Capacity (6);
- Add_Action (Table.States (1165), 7, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (1165), 40, (244, 0), 756);
- Add_Action (Table.States (1165), 81, (242, 8), 31);
- Add_Action (Table.States (1165), 107, (242, 5), 120);
- Add_Action (Table.States (1165), 108, (242, 7), 34);
- Add_Action (Table.States (1165), 109, (242, 6), 35);
- Table.States (1165).Goto_List.Set_Capacity (7);
- Add_Goto (Table.States (1165), 117, 1230);
- Add_Goto (Table.States (1165), 131, 42);
- Add_Goto (Table.States (1165), 242, 491);
- Add_Goto (Table.States (1165), 244, 735);
- Add_Goto (Table.States (1165), 275, 93);
- Add_Goto (Table.States (1165), 296, 98);
- Add_Goto (Table.States (1165), 317, 1231);
- Table.States (1165).Kernel := To_Vector ((((150, 0), 8, 1,
(2147483647, 0), 0), ((150, 2), 8, 2,
- (2147483647, 0), 0)));
- Table.States (1165).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (1166).Action_List.Set_Capacity (3);
- Add_Action (Table.States (1166), (74, 85, 99), (150, 3), 1, null,
null);
- Table.States (1166).Kernel := To_Vector ((0 => ((150, 3), 117,
0, (150, 3), 1)));
- Table.States (1166).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (150, 3), 1)));
- Table.States (1167).Action_List.Set_Capacity (3);
- Add_Action (Table.States (1167), 74, (125, 0), 340);
- Add_Action (Table.States (1167), 85, (149, 0), 1232);
- Add_Action (Table.States (1167), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (1167).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (1167), 125, 1233);
- Table.States (1167).Kernel := To_Vector ((((149, 0), 150, 2,
(2147483647, 0), 0), ((149, 1), 150, 1,
- (2147483647, 0), 0)));
- Table.States (1167).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (1168).Action_List.Set_Capacity (3);
- Add_Action (Table.States (1168), (74, 85, 99), (150, 1), 1, null,
null);
- Table.States (1168).Kernel := To_Vector ((0 => ((150, 1), 317,
0, (150, 1), 1)));
- Table.States (1168).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (150, 1), 1)));
- Table.States (1169).Action_List.Set_Capacity (3);
- Add_Action (Table.States (1169), 10, (230, 0), 1026);
- Add_Action (Table.States (1169), 74, Reduce, (231, 3), 4, null,
null);
- Add_Action (Table.States (1169), 99, Reduce, (231, 3), 4, null,
null);
- Table.States (1169).Kernel := To_Vector ((((230, 0), 230, 2,
(2147483647, 0), 0), ((231, 3), 230, 0,
- (231, 3), 4)));
- Table.States (1169).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (231, 3), 4)));
- Table.States (1170).Action_List.Set_Capacity (3);
- Add_Action (Table.States (1170), 10, (230, 0), 1026);
- Add_Action (Table.States (1170), 74, Reduce, (231, 1), 4, null,
null);
- Add_Action (Table.States (1170), 99, Reduce, (231, 1), 4, null,
null);
- Table.States (1170).Kernel := To_Vector ((((230, 0), 230, 2,
(2147483647, 0), 0), ((231, 1), 230, 0,
- (231, 1), 4)));
- Table.States (1170).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (231, 1), 4)));
- Table.States (1171).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1171), (78, 86), (184, 0), 3, null,
null);
- Table.States (1171).Kernel := To_Vector ((0 => ((184, 0), 183,
0, (184, 0), 3)));
- Table.States (1171).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (184, 0), 3)));
- Table.States (1172).Action_List.Set_Capacity (4);
- Add_Action (Table.States (1172), 81, (242, 8), 31);
- Add_Action (Table.States (1172), 107, (242, 5), 120);
- Add_Action (Table.States (1172), 108, (242, 7), 34);
- Add_Action (Table.States (1172), 109, (242, 6), 35);
- Table.States (1172).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (1172), 131, 42);
- Add_Goto (Table.States (1172), 230, 1234);
- Add_Goto (Table.States (1172), 242, 859);
- Add_Goto (Table.States (1172), 275, 93);
- Add_Goto (Table.States (1172), 296, 98);
- Table.States (1172).Kernel := To_Vector ((0 => ((122, 0), 10, 1,
(2147483647, 0), 0)));
- Table.States (1172).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (1173).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1173), 74, (262, 0), 1235);
- Table.States (1173).Kernel := To_Vector ((0 => ((262, 0), 122,
3, (2147483647, 0), 0)));
- Table.States (1173).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (262, 0), 74, 1235)));
- Table.States (1174).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1174), 74, (165, 0), 1236);
- Table.States (1174).Kernel := To_Vector ((0 => ((165, 0), 122,
3, (2147483647, 0), 0)));
- Table.States (1174).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (165, 0), 74, 1236)));
- Table.States (1175).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1175), (74, 99), (159, 0), 1, null,
null);
- Table.States (1175).Kernel := To_Vector ((0 => ((159, 0), 158,
0, (159, 0), 1)));
- Table.States (1175).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (159, 0), 1)));
- Table.States (1176).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1176), (74, 99), (165, 1), 4,
derived_type_definition_1'Access, null);
- Table.States (1176).Kernel := To_Vector ((0 => ((165, 1), 159,
0, (165, 1), 4)));
- Table.States (1176).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (165, 1), 4)));
- Table.States (1177).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1177), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (263, 0), 8,
- private_type_declaration_0'Access, null);
- Table.States (1177).Kernel := To_Vector ((0 => ((263, 0), 99, 0,
(263, 0), 8)));
- Table.States (1177).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (263, 0), 8)));
- Table.States (1178).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1178), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (248, 0), 8,
- object_renaming_declaration_0'Access, null);
- Table.States (1178).Kernel := To_Vector ((0 => ((248, 0), 99, 0,
(248, 0), 8)));
- Table.States (1178).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (248, 0), 8)));
- Table.States (1179).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1179), 82, (188, 0), 1085);
- Add_Action (Table.States (1179), 90, (190, 0), 1237);
- Table.States (1179).Kernel := To_Vector ((((188, 0), 188, 2,
(2147483647, 0), 0), ((190, 0), 188, 1,
- (2147483647, 0), 0)));
- Table.States (1179).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (190, 0), 90, 1237)));
- Table.States (1180).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1180), (82, 90), (188, 0), 3, null,
null);
- Table.States (1180).Kernel := To_Vector ((0 => ((188, 0), 187,
0, (188, 0), 3)));
- Table.States (1180).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (188, 0), 3)));
- Table.States (1181).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1181), (24, 72), (190, 1), 4,
exception_handler_1'Access, null);
- Table.States (1181).Kernel := To_Vector ((0 => ((190, 1), 303,
0, (190, 1), 4)));
- Table.States (1181).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (190, 1), 4)));
- Table.States (1182).Action_List.Set_Capacity (47);
- Add_Action (Table.States (1182), (4, 5, 13, 15, 17, 18, 22, 23,
24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (136, 0), 8, block_statement_0'Access,
block_statement_0_check'Access);
- Table.States (1182).Kernel := To_Vector ((0 => ((136, 0), 99, 0,
(136, 0), 8)));
- Table.States (1182).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (136, 0), 8)));
- Table.States (1183).Action_List.Set_Capacity (47);
- Add_Action (Table.States (1183), (4, 5, 13, 15, 17, 18, 22, 23,
24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (235, 0), 8, loop_statement_0'Access,
loop_statement_0_check'Access);
- Table.States (1183).Kernel := To_Vector ((0 => ((235, 0), 99, 0,
(235, 0), 8)));
- Table.States (1183).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (235, 0), 8)));
- Table.States (1184).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1184), 99, (247, 1), 1238);
- Table.States (1184).Kernel := To_Vector ((0 => ((247, 1), 125,
1, (2147483647, 0), 0)));
- Table.States (1184).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (247, 1), 99, 1238)));
- Table.States (1185).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1185), 99, (247, 2), 1239);
- Table.States (1185).Kernel := To_Vector ((0 => ((247, 2), 125,
1, (2147483647, 0), 0)));
- Table.States (1185).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (247, 2), 99, 1239)));
- Table.States (1186).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1186), 99, (247, 0), 1240);
- Table.States (1186).Kernel := To_Vector ((0 => ((247, 0), 125,
1, (2147483647, 0), 0)));
- Table.States (1186).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (247, 0), 99, 1240)));
- Table.States (1187).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1187), 99, (182, 0), 1241);
- Table.States (1187).Kernel := To_Vector ((0 => ((182, 0), 125,
1, (2147483647, 0), 0)));
- Table.States (1187).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (182, 0), 99, 1241)));
- Table.States (1188).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1188), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (216, 2), 8,
- generic_instantiation_2'Access, null);
- Table.States (1188).Kernel := To_Vector ((0 => ((216, 2), 99, 0,
(216, 2), 8)));
- Table.States (1188).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (216, 2), 8)));
- Table.States (1189).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1189), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (216, 1), 8,
- generic_instantiation_1'Access, null);
- Table.States (1189).Kernel := To_Vector ((0 => ((216, 1), 99, 0,
(216, 1), 8)));
- Table.States (1189).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (216, 1), 8)));
- Table.States (1190).Action_List.Set_Capacity (5);
- Add_Action (Table.States (1190), 81, (242, 8), 31);
- Add_Action (Table.States (1190), 99, Reduce, (243, 1), 0, null,
null);
- Add_Action (Table.States (1190), 107, (242, 5), 120);
- Add_Action (Table.States (1190), 108, (242, 7), 34);
- Add_Action (Table.States (1190), 109, (242, 6), 35);
- Table.States (1190).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (1190), 131, 42);
- Add_Goto (Table.States (1190), 242, 644);
- Add_Goto (Table.States (1190), 243, 1242);
- Add_Goto (Table.States (1190), 275, 93);
- Add_Goto (Table.States (1190), 296, 98);
- Table.States (1190).Kernel := To_Vector ((0 => ((310, 0), 24, 1,
(2147483647, 0), 0)));
- Table.States (1190).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (243, 1), 0)));
- Table.States (1191).Action_List.Set_Capacity (47);
- Add_Action (Table.States (1191), (4, 5, 13, 15, 17, 18, 22, 23,
24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (116, 0), 9, accept_statement_0'Access,
accept_statement_0_check'Access);
- Table.States (1191).Kernel := To_Vector ((0 => ((116, 0), 99, 0,
(116, 0), 9)));
- Table.States (1191).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (116, 0), 9)));
- Table.States (1192).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1192), (78, 86), (140, 0), 4,
case_expression_alternative_0'Access, null);
- Table.States (1192).Kernel := To_Vector ((0 => ((140, 0), 195,
0, (140, 0), 4)));
- Table.States (1192).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (140, 0), 4)));
- Table.States (1193).Action_List.Set_Capacity (17);
- Add_Action (Table.States (1193), 3, (200, 2), 122);
- Add_Action (Table.States (1193), 22, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (1193), 23, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (1193), 39, (261, 4), 123);
- Add_Action (Table.States (1193), 40, (200, 3), 124);
- Add_Action (Table.States (1193), 41, (261, 1), 125);
- Add_Action (Table.States (1193), 52, (278, 0), 126);
- Add_Action (Table.States (1193), 76, (120, 0), 127);
- Add_Action (Table.States (1193), 77, (120, 5), 128);
- Add_Action (Table.States (1193), 78, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (1193), 81, (242, 8), 31);
- Add_Action (Table.States (1193), 97, (333, 1), 129);
- Add_Action (Table.States (1193), 98, (333, 0), 130);
- Add_Action (Table.States (1193), 106, (261, 0), 131);
- Add_Action (Table.States (1193), 107, (242, 5), 120);
- Add_Action (Table.States (1193), 108, (242, 7), 34);
- Add_Action (Table.States (1193), 109, (242, 6), 35);
- Table.States (1193).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (1193), 120, 132);
- Add_Goto (Table.States (1193), 131, 42);
- Add_Goto (Table.States (1193), 194, 133);
- Add_Goto (Table.States (1193), 195, 1243);
- Add_Goto (Table.States (1193), 200, 135);
- Add_Goto (Table.States (1193), 242, 136);
- Add_Goto (Table.States (1193), 261, 137);
- Add_Goto (Table.States (1193), 275, 93);
- Add_Goto (Table.States (1193), 278, 138);
- Add_Goto (Table.States (1193), 285, 139);
- Add_Goto (Table.States (1193), 286, 140);
- Add_Goto (Table.States (1193), 287, 141);
- Add_Goto (Table.States (1193), 288, 142);
- Add_Goto (Table.States (1193), 289, 143);
- Add_Goto (Table.States (1193), 290, 144);
- Add_Goto (Table.States (1193), 296, 98);
- Add_Goto (Table.States (1193), 304, 145);
- Add_Goto (Table.States (1193), 323, 146);
- Add_Goto (Table.States (1193), 324, 147);
- Add_Goto (Table.States (1193), 333, 148);
- Table.States (1193).Kernel := To_Vector ((0 => ((175, 0), 68, 0,
(195, 1), 0)));
- Table.States (1193).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (1194).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1194), (1 => 78), (224, 0), 7,
if_expression_0'Access, null);
- Table.States (1194).Kernel := To_Vector ((0 => ((224, 0), 195,
0, (224, 0), 7)));
- Table.States (1194).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (224, 0), 7)));
- Table.States (1195).Action_List.Set_Capacity (13);
- Add_Action (Table.States (1195), 3, (200, 2), 122);
- Add_Action (Table.States (1195), 39, (261, 4), 123);
- Add_Action (Table.States (1195), 40, (200, 3), 124);
- Add_Action (Table.States (1195), 41, (261, 1), 125);
- Add_Action (Table.States (1195), 76, (120, 0), 127);
- Add_Action (Table.States (1195), 77, (120, 5), 128);
- Add_Action (Table.States (1195), 81, (242, 8), 31);
- Add_Action (Table.States (1195), 97, (333, 1), 129);
- Add_Action (Table.States (1195), 98, (333, 0), 130);
- Add_Action (Table.States (1195), 106, (261, 0), 131);
- Add_Action (Table.States (1195), 107, (242, 5), 120);
- Add_Action (Table.States (1195), 108, (242, 7), 34);
- Add_Action (Table.States (1195), 109, (242, 6), 35);
- Table.States (1195).Goto_List.Set_Capacity (11);
- Add_Goto (Table.States (1195), 120, 132);
- Add_Goto (Table.States (1195), 131, 42);
- Add_Goto (Table.States (1195), 200, 135);
- Add_Goto (Table.States (1195), 242, 136);
- Add_Goto (Table.States (1195), 261, 137);
- Add_Goto (Table.States (1195), 275, 93);
- Add_Goto (Table.States (1195), 296, 98);
- Add_Goto (Table.States (1195), 304, 1244);
- Add_Goto (Table.States (1195), 323, 146);
- Add_Goto (Table.States (1195), 324, 147);
- Add_Goto (Table.States (1195), 333, 148);
- Table.States (1195).Kernel := To_Vector ((0 => ((147, 0), 53, 4,
(2147483647, 0), 0)));
- Table.States (1195).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (1196).Action_List.Set_Capacity (42);
- Add_Action (Table.States (1196), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 72, 73,
74, 81, 96, 107, 108, 109, 110), (284, 0),
- 9, record_representation_clause_0'Access, null);
- Table.States (1196).Kernel := To_Vector ((0 => ((284, 0), 99, 0,
(284, 0), 9)));
- Table.States (1196).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (284, 0), 9)));
- Table.States (1197).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1197), (78, 99), (257, 2), 6,
parameter_specification_2'Access, null);
- Table.States (1197).Kernel := To_Vector ((0 => ((257, 2), 195,
0, (257, 2), 6)));
- Table.States (1197).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (257, 2), 6)));
- Table.States (1198).Action_List.Set_Capacity (7);
- Add_Action (Table.States (1198), 76, (118, 0), 237);
- Add_Action (Table.States (1198), 78, Reduce, (257, 1), 6,
parameter_specification_1'Access, null);
- Add_Action (Table.States (1198), 85, (257, 0), 1245);
- Add_Action (Table.States (1198), 87, (296, 0), 239);
- Add_Action (Table.States (1198), 99, Reduce, (257, 1), 6,
parameter_specification_1'Access, null);
- Add_Action (Table.States (1198), 104, (325, 0), 241);
- Add_Action (Table.States (1198), 105, (325, 1), 242);
- Table.States (1198).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (1198), 118, 243);
- Add_Goto (Table.States (1198), 325, 244);
- Table.States (1198).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((242, 0), 242, 5,
- (2147483647, 0), 0), ((242, 1), 242, 2, (2147483647, 0), 0),
((257, 0), 242, 1, (2147483647, 0), 0),
- ((257, 1), 242, 0, (257, 1), 6), ((275, 0), 242, 3,
(2147483647, 0), 0), ((296, 0), 242, 2,
- (2147483647, 0), 0), ((296, 1), 242, 2, (2147483647, 0), 0),
((296, 2), 242, 2, (2147483647, 0), 0),
- ((296, 3), 242, 2, (2147483647, 0), 0)));
- Table.States (1198).Minimal_Complete_Actions := To_Vector
(((Shift, (257, 0), 85, 1245), (Reduce, (257,
- 1), 6)));
- Table.States (1199).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1199), (74, 99), (205, 6), 4, null,
null);
- Table.States (1199).Kernel := To_Vector ((0 => ((205, 6), 83, 0,
(205, 6), 4)));
- Table.States (1199).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (205, 6), 4)));
- Table.States (1200).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1200), 74, (206, 0), 1246);
- Add_Conflict (Table.States (1200), 74, (206, 1), 4,
formal_derived_type_definition_1'Access, null);
- Add_Action (Table.States (1200), 99, Reduce, (206, 1), 4,
formal_derived_type_definition_1'Access, null);
- Table.States (1200).Kernel := To_Vector ((((206, 0), 122, 2,
(2147483647, 0), 0), ((206, 1), 122, 0,
- (206, 1), 4)));
- Table.States (1200).Minimal_Complete_Actions := To_Vector
(((Shift, (206, 0), 74, 1246), (Reduce, (206,
- 1), 4)));
- Table.States (1201).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1201), 78, (208, 0), 1247);
- Table.States (1201).Kernel := To_Vector ((0 => ((208, 0), 83, 1,
(2147483647, 0), 0)));
- Table.States (1201).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (208, 0), 78, 1247)));
- Table.States (1202).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1202), 99, (207, 0), 1248);
- Table.States (1202).Kernel := To_Vector ((0 => ((207, 0), 125,
1, (2147483647, 0), 0)));
- Table.States (1202).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (207, 0), 99, 1248)));
- Table.States (1203).Action_List.Set_Capacity (8);
- Add_Action (Table.States (1203), (29, 47, 48, 50, 69, 71, 74,
107), (201, 1), 8,
- formal_object_declaration_1'Access, null);
- Table.States (1203).Kernel := To_Vector ((0 => ((201, 1), 99, 0,
(201, 1), 8)));
- Table.States (1203).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (201, 1), 8)));
- Table.States (1204).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1204), 99, (201, 0), 1249);
- Table.States (1204).Kernel := To_Vector ((0 => ((201, 0), 125,
1, (2147483647, 0), 0)));
- Table.States (1204).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (201, 0), 99, 1249)));
- Table.States (1205).Action_List.Set_Capacity (47);
- Add_Action (Table.States (1205), (4, 5, 13, 15, 17, 18, 22, 23,
24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (225, 1), 9, if_statement_1'Access, null);
- Table.States (1205).Kernel := To_Vector ((0 => ((225, 1), 99, 0,
(225, 1), 9)));
- Table.States (1205).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (225, 1), 9)));
- Table.States (1206).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1206), 99, (225, 0), 1250);
- Table.States (1206).Kernel := To_Vector ((0 => ((225, 0), 32, 1,
(2147483647, 0), 0)));
- Table.States (1206).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (225, 0), 99, 1250)));
- Table.States (1207).Action_List.Set_Capacity (5);
- Add_Action (Table.States (1207), 81, (242, 8), 31);
- Add_Action (Table.States (1207), 99, Reduce, (243, 1), 0, null,
null);
- Add_Action (Table.States (1207), 107, (242, 5), 120);
- Add_Action (Table.States (1207), 108, (242, 7), 34);
- Add_Action (Table.States (1207), 109, (242, 6), 35);
- Table.States (1207).Goto_List.Set_Capacity (5);
- Add_Goto (Table.States (1207), 131, 42);
- Add_Goto (Table.States (1207), 242, 644);
- Add_Goto (Table.States (1207), 243, 1251);
- Add_Goto (Table.States (1207), 275, 93);
- Add_Goto (Table.States (1207), 296, 98);
- Table.States (1207).Kernel := To_Vector ((0 => ((250, 0), 24, 1,
(2147483647, 0), 0)));
- Table.States (1207).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (243, 1), 0)));
- Table.States (1208).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1208), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (250, 1), 9,
- package_body_1'Access, package_body_1_check'Access);
- Table.States (1208).Kernel := To_Vector ((0 => ((250, 1), 99, 0,
(250, 1), 9)));
- Table.States (1208).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (250, 1), 9)));
- Table.States (1209).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1209), (1 => 99), (254, 0), 9,
package_specification_0'Access,
- package_specification_0_check'Access);
- Table.States (1209).Kernel := To_Vector ((0 => ((254, 0), 243,
0, (254, 0), 9)));
- Table.States (1209).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (254, 0), 9)));
- Table.States (1210).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1210), 107, (180, 0), 1252);
- Table.States (1210).Kernel := To_Vector ((0 => ((180, 0), 28, 4,
(2147483647, 0), 0)));
- Table.States (1210).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (180, 0), 107, 1252)));
- Table.States (1211).Action_List.Set_Capacity (15);
- Add_Action (Table.States (1211), 3, (200, 2), 122);
- Add_Action (Table.States (1211), 35, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (1211), 39, (261, 4), 123);
- Add_Action (Table.States (1211), 40, (200, 3), 124);
- Add_Action (Table.States (1211), 41, (261, 1), 125);
- Add_Action (Table.States (1211), 52, (278, 0), 126);
- Add_Action (Table.States (1211), 76, (120, 0), 127);
- Add_Action (Table.States (1211), 77, (120, 5), 128);
- Add_Action (Table.States (1211), 81, (242, 8), 31);
- Add_Action (Table.States (1211), 97, (333, 1), 129);
- Add_Action (Table.States (1211), 98, (333, 0), 130);
- Add_Action (Table.States (1211), 106, (261, 0), 131);
- Add_Action (Table.States (1211), 107, (242, 5), 120);
- Add_Action (Table.States (1211), 108, (242, 7), 34);
- Add_Action (Table.States (1211), 109, (242, 6), 35);
- Table.States (1211).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (1211), 120, 132);
- Add_Goto (Table.States (1211), 131, 42);
- Add_Goto (Table.States (1211), 194, 133);
- Add_Goto (Table.States (1211), 195, 1253);
- Add_Goto (Table.States (1211), 200, 135);
- Add_Goto (Table.States (1211), 242, 136);
- Add_Goto (Table.States (1211), 261, 137);
- Add_Goto (Table.States (1211), 275, 93);
- Add_Goto (Table.States (1211), 278, 138);
- Add_Goto (Table.States (1211), 285, 139);
- Add_Goto (Table.States (1211), 286, 140);
- Add_Goto (Table.States (1211), 287, 141);
- Add_Goto (Table.States (1211), 288, 142);
- Add_Goto (Table.States (1211), 289, 143);
- Add_Goto (Table.States (1211), 290, 144);
- Add_Goto (Table.States (1211), 296, 98);
- Add_Goto (Table.States (1211), 304, 145);
- Add_Goto (Table.States (1211), 323, 146);
- Add_Goto (Table.States (1211), 324, 147);
- Add_Goto (Table.States (1211), 333, 148);
- Table.States (1211).Kernel := To_Vector ((0 => ((179, 0), 72, 4,
(2147483647, 0), 0)));
- Table.States (1211).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (1212).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1212), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (267, 0), 9,
- protected_body_0'Access, protected_body_0_check'Access);
- Table.States (1212).Kernel := To_Vector ((0 => ((267, 0), 99, 0,
(267, 0), 9)));
- Table.States (1212).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (267, 0), 9)));
- Table.States (1213).Action_List.Set_Capacity (17);
- Add_Action (Table.States (1213), 24, Reduce, (162, 1), 0, null,
null);
- Add_Action (Table.States (1213), 25, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (1213), 28, (124, 0), 185);
- Add_Action (Table.States (1213), 29, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (1213), 30, (213, 0), 8);
- Add_Action (Table.States (1213), 40, (249, 0), 12);
- Add_Action (Table.States (1213), 46, (249, 1), 14);
- Add_Action (Table.States (1213), 47, (216, 0), 15);
- Add_Action (Table.States (1213), 48, (260, 0), 16);
- Add_Action (Table.States (1213), 49, Reduce, (162, 1), 0, null,
null);
- Add_Action (Table.States (1213), 50, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (1213), 51, (267, 0), 19);
- Add_Action (Table.States (1213), 63, (316, 0), 25);
- Add_Action (Table.States (1213), 66, (308, 0), 26);
- Add_Action (Table.States (1213), 69, (209, 0), 27);
- Add_Action (Table.States (1213), 71, (334, 0), 28);
- Add_Action (Table.States (1213), 107, (222, 1), 187);
- Table.States (1213).Goto_List.Set_Capacity (54);
- Add_Goto (Table.States (1213), 115, 36);
- Add_Goto (Table.States (1213), 124, 38);
- Add_Goto (Table.States (1213), 130, 41);
- Add_Goto (Table.States (1213), 137, 46);
- Add_Goto (Table.States (1213), 138, 47);
- Add_Goto (Table.States (1213), 160, 394);
- Add_Goto (Table.States (1213), 161, 395);
- Add_Goto (Table.States (1213), 162, 681);
- Add_Goto (Table.States (1213), 182, 55);
- Add_Goto (Table.States (1213), 185, 56);
- Add_Goto (Table.States (1213), 189, 57);
- Add_Goto (Table.States (1213), 196, 59);
- Add_Goto (Table.States (1213), 209, 61);
- Add_Goto (Table.States (1213), 210, 62);
- Add_Goto (Table.States (1213), 212, 63);
- Add_Goto (Table.States (1213), 213, 64);
- Add_Goto (Table.States (1213), 216, 65);
- Add_Goto (Table.States (1213), 217, 66);
- Add_Goto (Table.States (1213), 218, 67);
- Add_Goto (Table.States (1213), 219, 68);
- Add_Goto (Table.States (1213), 222, 70);
- Add_Goto (Table.States (1213), 226, 72);
- Add_Goto (Table.States (1213), 246, 75);
- Add_Goto (Table.States (1213), 247, 76);
- Add_Goto (Table.States (1213), 248, 77);
- Add_Goto (Table.States (1213), 249, 78);
- Add_Goto (Table.States (1213), 250, 79);
- Add_Goto (Table.States (1213), 251, 80);
- Add_Goto (Table.States (1213), 252, 81);
- Add_Goto (Table.States (1213), 253, 82);
- Add_Goto (Table.States (1213), 254, 83);
- Add_Goto (Table.States (1213), 260, 397);
- Add_Goto (Table.States (1213), 262, 85);
- Add_Goto (Table.States (1213), 263, 86);
- Add_Goto (Table.States (1213), 265, 88);
- Add_Goto (Table.States (1213), 266, 89);
- Add_Goto (Table.States (1213), 267, 90);
- Add_Goto (Table.States (1213), 268, 91);
- Add_Goto (Table.States (1213), 269, 1254);
- Add_Goto (Table.States (1213), 274, 92);
- Add_Goto (Table.States (1213), 284, 95);
- Add_Goto (Table.States (1213), 292, 96);
- Add_Goto (Table.States (1213), 307, 103);
- Add_Goto (Table.States (1213), 308, 104);
- Add_Goto (Table.States (1213), 310, 106);
- Add_Goto (Table.States (1213), 311, 107);
- Add_Goto (Table.States (1213), 312, 108);
- Add_Goto (Table.States (1213), 314, 109);
- Add_Goto (Table.States (1213), 316, 110);
- Add_Goto (Table.States (1213), 319, 112);
- Add_Goto (Table.States (1213), 320, 113);
- Add_Goto (Table.States (1213), 322, 114);
- Add_Goto (Table.States (1213), 328, 116);
- Add_Goto (Table.States (1213), 334, 117);
- Table.States (1213).Kernel := To_Vector ((0 => ((274, 0), 74, 2,
(2147483647, 0), 0)));
- Table.States (1213).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (162, 1), 0)));
- Table.States (1214).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1214), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (307, 0), 9,
- single_protected_declaration_0'Access,
single_protected_declaration_0_check'Access);
- Table.States (1214).Kernel := To_Vector ((0 => ((307, 0), 99, 0,
(307, 0), 9)));
- Table.States (1214).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (307, 0), 9)));
- Table.States (1215).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1215), (1 => 99), (269, 0), 5,
protected_definition_0'Access,
- protected_definition_0_check'Access);
- Table.States (1215).Kernel := To_Vector ((0 => ((269, 0), 223,
0, (269, 0), 5)));
- Table.States (1215).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (269, 0), 5)));
- Table.States (1216).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1216), 99, Reduce, (223, 1), 0, null,
null);
- Add_Action (Table.States (1216), 107, (223, 0), 151);
- Table.States (1216).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (1216), 223, 1255);
- Table.States (1216).Kernel := To_Vector ((0 => ((319, 0), 24, 1,
(2147483647, 0), 0)));
- Table.States (1216).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (223, 1), 0)));
- Table.States (1217).Action_List.Set_Capacity (17);
- Add_Action (Table.States (1217), 24, Reduce, (162, 1), 0, null,
null);
- Add_Action (Table.States (1217), 25, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (1217), 28, (124, 0), 185);
- Add_Action (Table.States (1217), 29, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (1217), 30, (213, 0), 8);
- Add_Action (Table.States (1217), 40, (249, 0), 12);
- Add_Action (Table.States (1217), 46, (249, 1), 14);
- Add_Action (Table.States (1217), 47, (216, 0), 15);
- Add_Action (Table.States (1217), 48, (260, 0), 16);
- Add_Action (Table.States (1217), 49, Reduce, (162, 1), 0, null,
null);
- Add_Action (Table.States (1217), 50, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (1217), 51, (267, 0), 19);
- Add_Action (Table.States (1217), 63, (316, 0), 25);
- Add_Action (Table.States (1217), 66, (308, 0), 26);
- Add_Action (Table.States (1217), 69, (209, 0), 27);
- Add_Action (Table.States (1217), 71, (334, 0), 28);
- Add_Action (Table.States (1217), 107, (222, 1), 187);
- Table.States (1217).Goto_List.Set_Capacity (54);
- Add_Goto (Table.States (1217), 115, 36);
- Add_Goto (Table.States (1217), 124, 38);
- Add_Goto (Table.States (1217), 130, 41);
- Add_Goto (Table.States (1217), 137, 46);
- Add_Goto (Table.States (1217), 138, 47);
- Add_Goto (Table.States (1217), 160, 394);
- Add_Goto (Table.States (1217), 161, 395);
- Add_Goto (Table.States (1217), 162, 706);
- Add_Goto (Table.States (1217), 182, 55);
- Add_Goto (Table.States (1217), 185, 56);
- Add_Goto (Table.States (1217), 189, 57);
- Add_Goto (Table.States (1217), 196, 59);
- Add_Goto (Table.States (1217), 209, 61);
- Add_Goto (Table.States (1217), 210, 62);
- Add_Goto (Table.States (1217), 212, 63);
- Add_Goto (Table.States (1217), 213, 64);
- Add_Goto (Table.States (1217), 216, 65);
- Add_Goto (Table.States (1217), 217, 66);
- Add_Goto (Table.States (1217), 218, 67);
- Add_Goto (Table.States (1217), 219, 68);
- Add_Goto (Table.States (1217), 222, 70);
- Add_Goto (Table.States (1217), 226, 72);
- Add_Goto (Table.States (1217), 246, 75);
- Add_Goto (Table.States (1217), 247, 76);
- Add_Goto (Table.States (1217), 248, 77);
- Add_Goto (Table.States (1217), 249, 78);
- Add_Goto (Table.States (1217), 250, 79);
- Add_Goto (Table.States (1217), 251, 80);
- Add_Goto (Table.States (1217), 252, 81);
- Add_Goto (Table.States (1217), 253, 82);
- Add_Goto (Table.States (1217), 254, 83);
- Add_Goto (Table.States (1217), 260, 397);
- Add_Goto (Table.States (1217), 262, 85);
- Add_Goto (Table.States (1217), 263, 86);
- Add_Goto (Table.States (1217), 265, 88);
- Add_Goto (Table.States (1217), 266, 89);
- Add_Goto (Table.States (1217), 267, 90);
- Add_Goto (Table.States (1217), 268, 91);
- Add_Goto (Table.States (1217), 274, 92);
- Add_Goto (Table.States (1217), 284, 95);
- Add_Goto (Table.States (1217), 292, 96);
- Add_Goto (Table.States (1217), 307, 103);
- Add_Goto (Table.States (1217), 308, 104);
- Add_Goto (Table.States (1217), 310, 106);
- Add_Goto (Table.States (1217), 311, 107);
- Add_Goto (Table.States (1217), 312, 108);
- Add_Goto (Table.States (1217), 314, 109);
- Add_Goto (Table.States (1217), 316, 110);
- Add_Goto (Table.States (1217), 319, 112);
- Add_Goto (Table.States (1217), 320, 113);
- Add_Goto (Table.States (1217), 321, 1256);
- Add_Goto (Table.States (1217), 322, 114);
- Add_Goto (Table.States (1217), 328, 116);
- Add_Goto (Table.States (1217), 334, 117);
- Table.States (1217).Kernel := To_Vector ((0 => ((322, 0), 74, 2,
(2147483647, 0), 0)));
- Table.States (1217).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (321, 1), 0)));
- Table.States (1218).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1218), 99, (322, 1), 1257);
- Table.States (1218).Kernel := To_Vector ((0 => ((322, 1), 223,
1, (2147483647, 0), 0)));
- Table.States (1218).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (322, 1), 99, 1257)));
- Table.States (1219).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1219), 99, Reduce, (223, 1), 0, null,
null);
- Add_Action (Table.States (1219), 107, (223, 0), 151);
- Table.States (1219).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (1219), 223, 1258);
- Table.States (1219).Kernel := To_Vector ((0 => ((308, 0), 24, 1,
(2147483647, 0), 0)));
- Table.States (1219).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (223, 1), 0)));
- Table.States (1220).Action_List.Set_Capacity (7);
- Add_Action (Table.States (1220), 7, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (1220), 8, (150, 0), 1165);
- Add_Action (Table.States (1220), 40, (244, 0), 756);
- Add_Action (Table.States (1220), 81, (242, 8), 31);
- Add_Action (Table.States (1220), 107, (242, 5), 120);
- Add_Action (Table.States (1220), 108, (242, 7), 34);
- Add_Action (Table.States (1220), 109, (242, 6), 35);
- Table.States (1220).Goto_List.Set_Capacity (8);
- Add_Goto (Table.States (1220), 117, 1166);
- Add_Goto (Table.States (1220), 131, 42);
- Add_Goto (Table.States (1220), 150, 1259);
- Add_Goto (Table.States (1220), 242, 491);
- Add_Goto (Table.States (1220), 244, 735);
- Add_Goto (Table.States (1220), 275, 93);
- Add_Goto (Table.States (1220), 296, 98);
- Add_Goto (Table.States (1220), 317, 1168);
- Table.States (1220).Kernel := To_Vector ((0 => ((123, 1), 42, 1,
(2147483647, 0), 0)));
- Table.States (1220).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (1221).Action_List.Set_Capacity (7);
- Add_Action (Table.States (1221), 7, Reduce, (244, 1), 0, null,
null);
- Add_Action (Table.States (1221), 8, (150, 0), 1165);
- Add_Action (Table.States (1221), 40, (244, 0), 756);
- Add_Action (Table.States (1221), 81, (242, 8), 31);
- Add_Action (Table.States (1221), 107, (242, 5), 120);
- Add_Action (Table.States (1221), 108, (242, 7), 34);
- Add_Action (Table.States (1221), 109, (242, 6), 35);
- Table.States (1221).Goto_List.Set_Capacity (8);
- Add_Goto (Table.States (1221), 117, 1166);
- Add_Goto (Table.States (1221), 131, 42);
- Add_Goto (Table.States (1221), 150, 1260);
- Add_Goto (Table.States (1221), 242, 491);
- Add_Goto (Table.States (1221), 244, 735);
- Add_Goto (Table.States (1221), 275, 93);
- Add_Goto (Table.States (1221), 296, 98);
- Add_Goto (Table.States (1221), 317, 1168);
- Table.States (1221).Kernel := To_Vector ((0 => ((123, 0), 42, 1,
(2147483647, 0), 0)));
- Table.States (1221).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (1222).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1222), (78, 86), (229, 0), 3, null,
null);
- Table.States (1222).Kernel := To_Vector ((0 => ((229, 0), 228,
0, (229, 0), 3)));
- Table.States (1222).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (229, 0), 3)));
- Table.States (1223).Action_List.Set_Capacity (5);
- Add_Action (Table.States (1223), 53, (228, 0), 1261);
- Add_Action (Table.States (1223), 76, (118, 0), 237);
- Add_Action (Table.States (1223), 87, (296, 0), 239);
- Add_Action (Table.States (1223), 104, (325, 0), 241);
- Add_Action (Table.States (1223), 105, (325, 1), 242);
- Table.States (1223).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (1223), 118, 243);
- Add_Goto (Table.States (1223), 325, 244);
- Table.States (1223).Kernel := To_Vector ((((131, 0), 242, 2,
(2147483647, 0), 0), ((228, 0), 242, 2,
- (2147483647, 0), 0), ((242, 0), 242, 5, (2147483647, 0), 0),
((242, 1), 242, 2, (2147483647, 0), 0),
- ((275, 0), 242, 3, (2147483647, 0), 0), ((296, 0), 242, 2,
(2147483647, 0), 0), ((296, 1), 242, 2,
- (2147483647, 0), 0), ((296, 2), 242, 2, (2147483647, 0), 0),
((296, 3), 242, 2, (2147483647, 0),
- 0)));
- Table.States (1223).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (228, 0), 53, 1261)));
- Table.States (1224).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1224), (78, 86), (228, 0), 3, null,
null);
- Table.States (1224).Kernel := To_Vector ((0 => ((228, 0), 83, 0,
(228, 0), 3)));
- Table.States (1224).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (228, 0), 3)));
- Table.States (1225).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1225), (74, 99), (329, 4), 5, null,
null);
- Table.States (1225).Kernel := To_Vector ((0 => ((329, 4), 282,
0, (329, 4), 5)));
- Table.States (1225).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (329, 4), 5)));
- Table.States (1226).Action_List.Set_Capacity (13);
- Add_Action (Table.States (1226), 3, (200, 2), 122);
- Add_Action (Table.States (1226), 39, (261, 4), 123);
- Add_Action (Table.States (1226), 40, (200, 3), 124);
- Add_Action (Table.States (1226), 41, (261, 1), 125);
- Add_Action (Table.States (1226), 76, (120, 0), 127);
- Add_Action (Table.States (1226), 77, (120, 5), 128);
- Add_Action (Table.States (1226), 81, (242, 8), 31);
- Add_Action (Table.States (1226), 97, (333, 1), 129);
- Add_Action (Table.States (1226), 98, (333, 0), 130);
- Add_Action (Table.States (1226), 106, (261, 0), 131);
- Add_Action (Table.States (1226), 107, (242, 5), 120);
- Add_Action (Table.States (1226), 108, (242, 7), 34);
- Add_Action (Table.States (1226), 109, (242, 6), 35);
- Table.States (1226).Goto_List.Set_Capacity (11);
- Add_Goto (Table.States (1226), 120, 132);
- Add_Goto (Table.States (1226), 131, 42);
- Add_Goto (Table.States (1226), 200, 135);
- Add_Goto (Table.States (1226), 242, 136);
- Add_Goto (Table.States (1226), 261, 137);
- Add_Goto (Table.States (1226), 275, 93);
- Add_Goto (Table.States (1226), 296, 98);
- Add_Goto (Table.States (1226), 304, 1262);
- Add_Goto (Table.States (1226), 323, 146);
- Add_Goto (Table.States (1226), 324, 147);
- Add_Goto (Table.States (1226), 333, 148);
- Table.States (1226).Kernel := To_Vector ((0 => ((282, 0), 88, 1,
(2147483647, 0), 0)));
- Table.States (1226).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (1227).Action_List.Set_Capacity (17);
- Add_Action (Table.States (1227), 3, (200, 2), 122);
- Add_Action (Table.States (1227), 39, (261, 4), 123);
- Add_Action (Table.States (1227), 40, (168, 1), 263);
- Add_Action (Table.States (1227), 41, (261, 1), 125);
- Add_Action (Table.States (1227), 44, (168, 3), 265);
- Add_Action (Table.States (1227), 52, (278, 0), 126);
- Add_Action (Table.States (1227), 76, (120, 0), 127);
- Add_Action (Table.States (1227), 77, (120, 5), 128);
- Add_Action (Table.States (1227), 81, (242, 8), 31);
- Add_Action (Table.States (1227), 82, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (1227), 90, Reduce, (169, 2), 0, null,
null);
- Add_Action (Table.States (1227), 97, (333, 1), 129);
- Add_Action (Table.States (1227), 98, (333, 0), 130);
- Add_Action (Table.States (1227), 106, (261, 0), 131);
- Add_Action (Table.States (1227), 107, (242, 5), 120);
- Add_Action (Table.States (1227), 108, (242, 7), 34);
- Add_Action (Table.States (1227), 109, (242, 6), 35);
- Table.States (1227).Goto_List.Set_Capacity (22);
- Add_Goto (Table.States (1227), 120, 132);
- Add_Goto (Table.States (1227), 131, 42);
- Add_Goto (Table.States (1227), 168, 271);
- Add_Goto (Table.States (1227), 169, 1263);
- Add_Goto (Table.States (1227), 194, 611);
- Add_Goto (Table.States (1227), 200, 135);
- Add_Goto (Table.States (1227), 242, 276);
- Add_Goto (Table.States (1227), 261, 137);
- Add_Goto (Table.States (1227), 275, 93);
- Add_Goto (Table.States (1227), 278, 138);
- Add_Goto (Table.States (1227), 280, 278);
- Add_Goto (Table.States (1227), 285, 139);
- Add_Goto (Table.States (1227), 286, 140);
- Add_Goto (Table.States (1227), 287, 141);
- Add_Goto (Table.States (1227), 288, 142);
- Add_Goto (Table.States (1227), 289, 143);
- Add_Goto (Table.States (1227), 290, 144);
- Add_Goto (Table.States (1227), 296, 98);
- Add_Goto (Table.States (1227), 304, 279);
- Add_Goto (Table.States (1227), 323, 146);
- Add_Goto (Table.States (1227), 324, 147);
- Add_Goto (Table.States (1227), 333, 148);
- Table.States (1227).Kernel := To_Vector ((0 => ((332, 0), 72, 1,
(2147483647, 0), 0)));
- Table.States (1227).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (169, 2), 0)));
- end Subr_21;
- procedure Subr_22
- is begin
- Table.States (1228).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1228), 24, (330, 0), 1264);
- Add_Action (Table.States (1228), 72, (332, 0), 1227);
- Table.States (1228).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (1228), 332, 1265);
- Table.States (1228).Kernel := To_Vector ((((330, 0), 331, 3,
(2147483647, 0), 0), ((331, 0), 331, 2,
- (2147483647, 0), 0)));
- Table.States (1228).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (330, 0), 24, 1264)));
- Table.States (1229).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1229), (24, 72), (331, 1), 1, null,
null);
- Table.States (1229).Kernel := To_Vector ((0 => ((331, 1), 332,
0, (331, 1), 1)));
- Table.States (1229).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (331, 1), 1)));
- Table.States (1230).Action_List.Set_Capacity (3);
- Add_Action (Table.States (1230), (74, 85, 99), (150, 2), 2, null,
null);
- Table.States (1230).Kernel := To_Vector ((0 => ((150, 2), 117,
0, (150, 2), 2)));
- Table.States (1230).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (150, 2), 2)));
- Table.States (1231).Action_List.Set_Capacity (3);
- Add_Action (Table.States (1231), (74, 85, 99), (150, 0), 2, null,
null);
- Table.States (1231).Kernel := To_Vector ((0 => ((150, 0), 317,
0, (150, 0), 2)));
- Table.States (1231).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (150, 0), 2)));
- Table.States (1232).Action_List.Set_Capacity (16);
- Add_Action (Table.States (1232), 3, (200, 2), 122);
- Add_Action (Table.States (1232), 39, (261, 4), 123);
- Add_Action (Table.States (1232), 40, (200, 3), 124);
- Add_Action (Table.States (1232), 41, (261, 1), 125);
- Add_Action (Table.States (1232), 52, (278, 0), 126);
- Add_Action (Table.States (1232), 74, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (1232), 76, (120, 0), 127);
- Add_Action (Table.States (1232), 77, (120, 5), 128);
- Add_Action (Table.States (1232), 81, (242, 8), 31);
- Add_Action (Table.States (1232), 97, (333, 1), 129);
- Add_Action (Table.States (1232), 98, (333, 0), 130);
- Add_Action (Table.States (1232), 99, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (1232), 106, (261, 0), 131);
- Add_Action (Table.States (1232), 107, (242, 5), 120);
- Add_Action (Table.States (1232), 108, (242, 7), 34);
- Add_Action (Table.States (1232), 109, (242, 6), 35);
- Table.States (1232).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (1232), 120, 132);
- Add_Goto (Table.States (1232), 131, 42);
- Add_Goto (Table.States (1232), 194, 133);
- Add_Goto (Table.States (1232), 195, 1266);
- Add_Goto (Table.States (1232), 200, 135);
- Add_Goto (Table.States (1232), 242, 136);
- Add_Goto (Table.States (1232), 261, 137);
- Add_Goto (Table.States (1232), 275, 93);
- Add_Goto (Table.States (1232), 278, 138);
- Add_Goto (Table.States (1232), 285, 139);
- Add_Goto (Table.States (1232), 286, 140);
- Add_Goto (Table.States (1232), 287, 141);
- Add_Goto (Table.States (1232), 288, 142);
- Add_Goto (Table.States (1232), 289, 143);
- Add_Goto (Table.States (1232), 290, 144);
- Add_Goto (Table.States (1232), 296, 98);
- Add_Goto (Table.States (1232), 304, 145);
- Add_Goto (Table.States (1232), 323, 146);
- Add_Goto (Table.States (1232), 324, 147);
- Add_Goto (Table.States (1232), 333, 148);
- Table.States (1232).Kernel := To_Vector ((0 => ((149, 0), 85, 1,
(2147483647, 0), 0)));
- Table.States (1232).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (1233).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1233), 99, (149, 1), 1267);
- Table.States (1233).Kernel := To_Vector ((0 => ((149, 1), 125,
1, (2147483647, 0), 0)));
- Table.States (1233).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (149, 1), 99, 1267)));
- Table.States (1234).Action_List.Set_Capacity (3);
- Add_Action (Table.States (1234), 10, (230, 0), 1026);
- Add_Action (Table.States (1234), 74, Reduce, (122, 0), 2, null,
null);
- Add_Action (Table.States (1234), 99, Reduce, (122, 0), 2, null,
null);
- Table.States (1234).Kernel := To_Vector ((((122, 0), 230, 0,
(122, 0), 2), ((230, 0), 230, 2,
- (2147483647, 0), 0)));
- Table.States (1234).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (122, 0), 2)));
- Table.States (1235).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1235), 49, (262, 0), 1268);
- Table.States (1235).Kernel := To_Vector ((0 => ((262, 0), 74, 2,
(2147483647, 0), 0)));
- Table.States (1235).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (262, 0), 49, 1268)));
- Table.States (1236).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1236), 41, (283, 1), 719);
- Add_Action (Table.States (1236), 54, (283, 0), 722);
- Table.States (1236).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (1236), 283, 1269);
- Table.States (1236).Kernel := To_Vector ((0 => ((165, 0), 74, 2,
(2147483647, 0), 0)));
- Table.States (1236).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (283, 1), 41, 719)));
- Table.States (1237).Action_List.Set_Capacity (25);
- Add_Action (Table.States (1237), 4, (116, 0), 1);
- Add_Action (Table.States (1237), 5, (306, 8), 2);
- Add_Action (Table.States (1237), 13, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (1237), 15, (142, 0), 3);
- Add_Action (Table.States (1237), 17, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (1237), 18, (164, 0), 4);
- Add_Action (Table.States (1237), 24, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (1237), 27, (193, 0), 5);
- Add_Action (Table.States (1237), 28, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (1237), 31, (306, 3), 9);
- Add_Action (Table.States (1237), 32, (225, 0), 10);
- Add_Action (Table.States (1237), 37, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (1237), 41, (306, 0), 13);
- Add_Action (Table.States (1237), 48, (260, 0), 16);
- Add_Action (Table.States (1237), 52, (279, 0), 20);
- Add_Action (Table.States (1237), 57, (293, 0), 21);
- Add_Action (Table.States (1237), 58, (199, 0), 22);
- Add_Action (Table.States (1237), 61, (129, 0), 24);
- Add_Action (Table.States (1237), 72, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (1237), 73, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (1237), 81, (242, 8), 31);
- Add_Action (Table.States (1237), 96, (220, 0), 32);
- Add_Action (Table.States (1237), 107, (134, 0), 363);
- Add_Action (Table.States (1237), 108, (242, 7), 34);
- Add_Action (Table.States (1237), 109, (242, 6), 35);
- Table.States (1237).Goto_List.Set_Capacity (31);
- Add_Goto (Table.States (1237), 116, 37);
- Add_Goto (Table.States (1237), 126, 39);
- Add_Goto (Table.States (1237), 129, 40);
- Add_Goto (Table.States (1237), 131, 42);
- Add_Goto (Table.States (1237), 134, 43);
- Add_Goto (Table.States (1237), 135, 44);
- Add_Goto (Table.States (1237), 136, 45);
- Add_Goto (Table.States (1237), 142, 48);
- Add_Goto (Table.States (1237), 154, 51);
- Add_Goto (Table.States (1237), 155, 52);
- Add_Goto (Table.States (1237), 164, 54);
- Add_Goto (Table.States (1237), 193, 58);
- Add_Goto (Table.States (1237), 199, 60);
- Add_Goto (Table.States (1237), 220, 69);
- Add_Goto (Table.States (1237), 225, 71);
- Add_Goto (Table.States (1237), 235, 73);
- Add_Goto (Table.States (1237), 242, 74);
- Add_Goto (Table.States (1237), 260, 84);
- Add_Goto (Table.States (1237), 264, 87);
- Add_Goto (Table.States (1237), 275, 93);
- Add_Goto (Table.States (1237), 279, 94);
- Add_Goto (Table.States (1237), 293, 97);
- Add_Goto (Table.States (1237), 296, 98);
- Add_Goto (Table.States (1237), 297, 99);
- Add_Goto (Table.States (1237), 301, 100);
- Add_Goto (Table.States (1237), 302, 364);
- Add_Goto (Table.States (1237), 303, 1270);
- Add_Goto (Table.States (1237), 305, 101);
- Add_Goto (Table.States (1237), 306, 102);
- Add_Goto (Table.States (1237), 309, 366);
- Add_Goto (Table.States (1237), 326, 115);
- Table.States (1237).Kernel := To_Vector ((0 => ((190, 0), 90, 0,
(303, 1), 0)));
- Table.States (1237).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (303, 1), 0)));
- Table.States (1238).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1238), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (247, 1), 9,
- object_declaration_1'Access, null);
- Table.States (1238).Kernel := To_Vector ((0 => ((247, 1), 99, 0,
(247, 1), 9)));
- Table.States (1238).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (247, 1), 9)));
- Table.States (1239).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1239), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (247, 2), 9,
- object_declaration_2'Access, null);
- Table.States (1239).Kernel := To_Vector ((0 => ((247, 2), 99, 0,
(247, 2), 9)));
- Table.States (1239).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (247, 2), 9)));
- Table.States (1240).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1240), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (247, 0), 9,
- object_declaration_0'Access, null);
- Table.States (1240).Kernel := To_Vector ((0 => ((247, 0), 99, 0,
(247, 0), 9)));
- Table.States (1240).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (247, 0), 9)));
- Table.States (1241).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1241), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (182, 0), 9,
- entry_declaration_0'Access, null);
- Table.States (1241).Kernel := To_Vector ((0 => ((182, 0), 99, 0,
(182, 0), 9)));
- Table.States (1241).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (182, 0), 9)));
- Table.States (1242).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1242), 99, (310, 0), 1271);
- Table.States (1242).Kernel := To_Vector ((0 => ((310, 0), 243,
1, (2147483647, 0), 0)));
- Table.States (1242).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (310, 0), 99, 1271)));
- Table.States (1243).Action_List.Set_Capacity (3);
- Add_Action (Table.States (1243), (22, 23, 78), (175, 0), 4,
elsif_expression_item_0'Access, null);
- Table.States (1243).Kernel := To_Vector ((0 => ((175, 0), 195,
0, (175, 0), 4)));
- Table.States (1243).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (175, 0), 4)));
- Table.States (1244).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1244), 88, (147, 0), 1272);
- Table.States (1244).Kernel := To_Vector ((0 => ((147, 0), 304,
3, (2147483647, 0), 0)));
- Table.States (1244).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (147, 0), 88, 1272)));
- Table.States (1245).Action_List.Set_Capacity (16);
- Add_Action (Table.States (1245), 3, (200, 2), 122);
- Add_Action (Table.States (1245), 39, (261, 4), 123);
- Add_Action (Table.States (1245), 40, (200, 3), 124);
- Add_Action (Table.States (1245), 41, (261, 1), 125);
- Add_Action (Table.States (1245), 52, (278, 0), 126);
- Add_Action (Table.States (1245), 76, (120, 0), 127);
- Add_Action (Table.States (1245), 77, (120, 5), 128);
- Add_Action (Table.States (1245), 78, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (1245), 81, (242, 8), 31);
- Add_Action (Table.States (1245), 97, (333, 1), 129);
- Add_Action (Table.States (1245), 98, (333, 0), 130);
- Add_Action (Table.States (1245), 99, Reduce, (195, 1), 0, null,
null);
- Add_Action (Table.States (1245), 106, (261, 0), 131);
- Add_Action (Table.States (1245), 107, (242, 5), 120);
- Add_Action (Table.States (1245), 108, (242, 7), 34);
- Add_Action (Table.States (1245), 109, (242, 6), 35);
- Table.States (1245).Goto_List.Set_Capacity (20);
- Add_Goto (Table.States (1245), 120, 132);
- Add_Goto (Table.States (1245), 131, 42);
- Add_Goto (Table.States (1245), 194, 133);
- Add_Goto (Table.States (1245), 195, 1273);
- Add_Goto (Table.States (1245), 200, 135);
- Add_Goto (Table.States (1245), 242, 136);
- Add_Goto (Table.States (1245), 261, 137);
- Add_Goto (Table.States (1245), 275, 93);
- Add_Goto (Table.States (1245), 278, 138);
- Add_Goto (Table.States (1245), 285, 139);
- Add_Goto (Table.States (1245), 286, 140);
- Add_Goto (Table.States (1245), 287, 141);
- Add_Goto (Table.States (1245), 288, 142);
- Add_Goto (Table.States (1245), 289, 143);
- Add_Goto (Table.States (1245), 290, 144);
- Add_Goto (Table.States (1245), 296, 98);
- Add_Goto (Table.States (1245), 304, 145);
- Add_Goto (Table.States (1245), 323, 146);
- Add_Goto (Table.States (1245), 324, 147);
- Add_Goto (Table.States (1245), 333, 148);
- Table.States (1245).Kernel := To_Vector ((0 => ((257, 0), 85, 0,
(195, 1), 0)));
- Table.States (1245).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (195, 1), 0)));
- Table.States (1246).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1246), 49, (206, 0), 1274);
- Table.States (1246).Kernel := To_Vector ((0 => ((206, 0), 74, 1,
(2147483647, 0), 0)));
- Table.States (1246).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (206, 0), 49, 1274)));
- Table.States (1247).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1247), (74, 99), (208, 0), 3, null,
null);
- Table.States (1247).Kernel := To_Vector ((0 => ((208, 0), 78, 0,
(208, 0), 3)));
- Table.States (1247).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (208, 0), 3)));
- Table.States (1248).Action_List.Set_Capacity (8);
- Add_Action (Table.States (1248), (29, 47, 48, 50, 69, 71, 74,
107), (207, 0), 9,
- formal_package_declaration_0'Access, null);
- Table.States (1248).Kernel := To_Vector ((0 => ((207, 0), 99, 0,
(207, 0), 9)));
- Table.States (1248).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (207, 0), 9)));
- Table.States (1249).Action_List.Set_Capacity (8);
- Add_Action (Table.States (1249), (29, 47, 48, 50, 69, 71, 74,
107), (201, 0), 9,
- formal_object_declaration_0'Access, null);
- Table.States (1249).Kernel := To_Vector ((0 => ((201, 0), 99, 0,
(201, 0), 9)));
- Table.States (1249).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (201, 0), 9)));
- Table.States (1250).Action_List.Set_Capacity (47);
- Add_Action (Table.States (1250), (4, 5, 13, 15, 17, 18, 22, 23,
24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37,
- 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66,
68, 69, 71, 72, 73, 74, 81, 96, 107, 108,
- 109, 110), (225, 0), 10, if_statement_0'Access, null);
- Table.States (1250).Kernel := To_Vector ((0 => ((225, 0), 99, 0,
(225, 0), 10)));
- Table.States (1250).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (225, 0), 10)));
- Table.States (1251).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1251), 99, (250, 0), 1275);
- Table.States (1251).Kernel := To_Vector ((0 => ((250, 0), 243,
1, (2147483647, 0), 0)));
- Table.States (1251).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (250, 0), 99, 1275)));
- Table.States (1252).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1252), 33, (180, 0), 1276);
- Table.States (1252).Kernel := To_Vector ((0 => ((180, 0), 107,
3, (2147483647, 0), 0)));
- Table.States (1252).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (180, 0), 33, 1276)));
- Table.States (1253).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1253), 35, (179, 0), 1277);
- Table.States (1253).Kernel := To_Vector ((0 => ((179, 0), 195,
4, (2147483647, 0), 0)));
- Table.States (1253).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (179, 0), 35, 1277)));
- Table.States (1254).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1254), 99, (274, 0), 1278);
- Table.States (1254).Kernel := To_Vector ((0 => ((274, 0), 269,
1, (2147483647, 0), 0)));
- Table.States (1254).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (274, 0), 99, 1278)));
- Table.States (1255).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1255), 99, (319, 0), 1279);
- Table.States (1255).Kernel := To_Vector ((0 => ((319, 0), 223,
1, (2147483647, 0), 0)));
- Table.States (1255).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (319, 0), 99, 1279)));
- Table.States (1256).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1256), 24, (322, 0), 1280);
- Table.States (1256).Kernel := To_Vector ((0 => ((322, 0), 321,
2, (2147483647, 0), 0)));
- Table.States (1256).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (322, 0), 24, 1280)));
- Table.States (1257).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1257), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (322, 1), 10,
- task_type_declaration_1'Access,
task_type_declaration_1_check'Access);
- Table.States (1257).Kernel := To_Vector ((0 => ((322, 1), 99, 0,
(322, 1), 10)));
- Table.States (1257).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (322, 1), 10)));
- Table.States (1258).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1258), 99, (308, 0), 1281);
- Table.States (1258).Kernel := To_Vector ((0 => ((308, 0), 223,
1, (2147483647, 0), 0)));
- Table.States (1258).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (308, 0), 99, 1281)));
- Table.States (1259).Action_List.Set_Capacity (3);
- Add_Action (Table.States (1259), (74, 85, 99), (123, 1), 6,
array_type_definition_1'Access, null);
- Table.States (1259).Kernel := To_Vector ((0 => ((123, 1), 150,
0, (123, 1), 6)));
- Table.States (1259).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (123, 1), 6)));
- Table.States (1260).Action_List.Set_Capacity (3);
- Add_Action (Table.States (1260), (74, 85, 99), (123, 0), 6,
array_type_definition_0'Access, null);
- Table.States (1260).Kernel := To_Vector ((0 => ((123, 0), 150,
0, (123, 0), 6)));
- Table.States (1260).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (123, 0), 6)));
- Table.States (1261).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1261), 83, (228, 0), 1224);
- Table.States (1261).Kernel := To_Vector ((0 => ((228, 0), 53, 1,
(2147483647, 0), 0)));
- Table.States (1261).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (228, 0), 83, 1224)));
- Table.States (1262).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1262), (74, 99), (282, 0), 4, null,
null);
- Table.States (1262).Kernel := To_Vector ((0 => ((282, 0), 304,
0, (282, 0), 4)));
- Table.States (1262).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (282, 0), 4)));
- Table.States (1263).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1263), 82, (169, 0), 450);
- Add_Action (Table.States (1263), 90, (332, 0), 1282);
- Table.States (1263).Kernel := To_Vector ((((169, 0), 169, 2,
(2147483647, 0), 0), ((332, 0), 169, 1,
- (2147483647, 0), 0)));
- Table.States (1263).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (332, 0), 90, 1282)));
- Table.States (1264).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1264), 15, (330, 0), 1283);
- Table.States (1264).Kernel := To_Vector ((0 => ((330, 0), 24, 2,
(2147483647, 0), 0)));
- Table.States (1264).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (330, 0), 15, 1283)));
- Table.States (1265).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1265), (24, 72), (331, 0), 2,
variant_list_0'Access, null);
- Table.States (1265).Kernel := To_Vector ((0 => ((331, 0), 332,
0, (331, 0), 2)));
- Table.States (1265).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (331, 0), 2)));
- Table.States (1266).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1266), 74, (125, 0), 340);
- Add_Action (Table.States (1266), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (1266).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (1266), 125, 1284);
- Table.States (1266).Kernel := To_Vector ((0 => ((149, 0), 195,
1, (2147483647, 0), 0)));
- Table.States (1266).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (1267).Action_List.Set_Capacity (5);
- Add_Action (Table.States (1267), (15, 24, 28, 72, 107), (149, 1),
5, component_declaration_1'Access,
- null);
- Table.States (1267).Kernel := To_Vector ((0 => ((149, 1), 99, 0,
(149, 1), 5)));
- Table.States (1267).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (149, 1), 5)));
- Table.States (1268).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1268), 74, (125, 0), 340);
- Add_Action (Table.States (1268), 99, Reduce, (125, 1), 0, null,
null);
- Table.States (1268).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (1268), 125, 1285);
- Table.States (1268).Kernel := To_Vector ((0 => ((262, 0), 49, 1,
(2147483647, 0), 0)));
- Table.States (1268).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (125, 1), 0)));
- Table.States (1269).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1269), (74, 99), (165, 0), 6,
derived_type_definition_0'Access, null);
- Table.States (1269).Kernel := To_Vector ((0 => ((165, 0), 283,
0, (165, 0), 6)));
- Table.States (1269).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (165, 0), 6)));
- Table.States (1270).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1270), (24, 72), (190, 0), 6,
exception_handler_0'Access, null);
- Table.States (1270).Kernel := To_Vector ((0 => ((190, 0), 303,
0, (190, 0), 6)));
- Table.States (1270).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (190, 0), 6)));
- Table.States (1271).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1271), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (310, 0), 10,
- subprogram_body_0'Access, subprogram_body_0_check'Access);
- Table.States (1271).Kernel := To_Vector ((0 => ((310, 0), 99, 0,
(310, 0), 10)));
- Table.States (1271).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (310, 0), 10)));
- Table.States (1272).Action_List.Set_Capacity (13);
- Add_Action (Table.States (1272), 3, (200, 2), 122);
- Add_Action (Table.States (1272), 39, (261, 4), 123);
- Add_Action (Table.States (1272), 40, (200, 3), 124);
- Add_Action (Table.States (1272), 41, (261, 1), 125);
- Add_Action (Table.States (1272), 76, (120, 0), 127);
- Add_Action (Table.States (1272), 77, (120, 5), 128);
- Add_Action (Table.States (1272), 81, (242, 8), 31);
- Add_Action (Table.States (1272), 97, (333, 1), 129);
- Add_Action (Table.States (1272), 98, (333, 0), 130);
- Add_Action (Table.States (1272), 106, (261, 0), 131);
- Add_Action (Table.States (1272), 107, (242, 5), 120);
- Add_Action (Table.States (1272), 108, (242, 7), 34);
- Add_Action (Table.States (1272), 109, (242, 6), 35);
- Table.States (1272).Goto_List.Set_Capacity (11);
- Add_Goto (Table.States (1272), 120, 132);
- Add_Goto (Table.States (1272), 131, 42);
- Add_Goto (Table.States (1272), 200, 135);
- Add_Goto (Table.States (1272), 242, 136);
- Add_Goto (Table.States (1272), 261, 137);
- Add_Goto (Table.States (1272), 275, 93);
- Add_Goto (Table.States (1272), 296, 98);
- Add_Goto (Table.States (1272), 304, 1286);
- Add_Goto (Table.States (1272), 323, 146);
- Add_Goto (Table.States (1272), 324, 147);
- Add_Goto (Table.States (1272), 333, 148);
- Table.States (1272).Kernel := To_Vector ((0 => ((147, 0), 88, 2,
(2147483647, 0), 0)));
- Table.States (1272).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (261, 0), 106, 131)));
- Table.States (1273).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1273), (78, 99), (257, 0), 8,
parameter_specification_0'Access, null);
- Table.States (1273).Kernel := To_Vector ((0 => ((257, 0), 195,
0, (257, 0), 8)));
- Table.States (1273).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (257, 0), 8)));
- Table.States (1274).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1274), (74, 99), (206, 0), 6,
formal_derived_type_definition_0'Access, null);
- Table.States (1274).Kernel := To_Vector ((0 => ((206, 0), 49, 0,
(206, 0), 6)));
- Table.States (1274).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (206, 0), 6)));
- Table.States (1275).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1275), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (250, 0), 11,
- package_body_0'Access, package_body_0_check'Access);
- Table.States (1275).Kernel := To_Vector ((0 => ((250, 0), 99, 0,
(250, 0), 11)));
- Table.States (1275).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (250, 0), 11)));
- Table.States (1276).Action_List.Set_Capacity (13);
- Add_Action (Table.States (1276), 3, (200, 2), 122);
- Add_Action (Table.States (1276), 39, (261, 4), 123);
- Add_Action (Table.States (1276), 40, (200, 3), 481);
- Add_Action (Table.States (1276), 41, (261, 1), 125);
- Add_Action (Table.States (1276), 76, (120, 0), 127);
- Add_Action (Table.States (1276), 77, (120, 5), 128);
- Add_Action (Table.States (1276), 81, (242, 8), 31);
- Add_Action (Table.States (1276), 97, (333, 1), 129);
- Add_Action (Table.States (1276), 98, (333, 0), 130);
- Add_Action (Table.States (1276), 106, (261, 0), 131);
- Add_Action (Table.States (1276), 107, (242, 5), 120);
- Add_Action (Table.States (1276), 108, (242, 7), 34);
- Add_Action (Table.States (1276), 109, (242, 6), 35);
- Table.States (1276).Goto_List.Set_Capacity (14);
- Add_Goto (Table.States (1276), 120, 132);
- Add_Goto (Table.States (1276), 131, 42);
- Add_Goto (Table.States (1276), 170, 1287);
- Add_Goto (Table.States (1276), 200, 135);
- Add_Goto (Table.States (1276), 242, 484);
- Add_Goto (Table.States (1276), 261, 137);
- Add_Goto (Table.States (1276), 275, 93);
- Add_Goto (Table.States (1276), 280, 485);
- Add_Goto (Table.States (1276), 296, 98);
- Add_Goto (Table.States (1276), 304, 486);
- Add_Goto (Table.States (1276), 317, 487);
- Add_Goto (Table.States (1276), 323, 146);
- Add_Goto (Table.States (1276), 324, 147);
- Add_Goto (Table.States (1276), 333, 148);
- Table.States (1276).Kernel := To_Vector ((0 => ((180, 0), 33, 2,
(2147483647, 0), 0)));
- Table.States (1276).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (242, 5), 107, 120)));
- Table.States (1277).Action_List.Set_Capacity (16);
- Add_Action (Table.States (1277), 13, Reduce, (162, 1), 0, null,
null);
- Add_Action (Table.States (1277), 25, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (1277), 28, (124, 0), 185);
- Add_Action (Table.States (1277), 29, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (1277), 30, (213, 0), 8);
- Add_Action (Table.States (1277), 40, (249, 0), 12);
- Add_Action (Table.States (1277), 46, (249, 1), 14);
- Add_Action (Table.States (1277), 47, (216, 0), 15);
- Add_Action (Table.States (1277), 48, (260, 0), 16);
- Add_Action (Table.States (1277), 50, Reduce, (249, 2), 0, null,
null);
- Add_Action (Table.States (1277), 51, (267, 0), 19);
- Add_Action (Table.States (1277), 63, (316, 0), 25);
- Add_Action (Table.States (1277), 66, (308, 0), 26);
- Add_Action (Table.States (1277), 69, (209, 0), 27);
- Add_Action (Table.States (1277), 71, (334, 0), 28);
- Add_Action (Table.States (1277), 107, (222, 1), 187);
- Table.States (1277).Goto_List.Set_Capacity (53);
- Add_Goto (Table.States (1277), 115, 36);
- Add_Goto (Table.States (1277), 124, 38);
- Add_Goto (Table.States (1277), 130, 41);
- Add_Goto (Table.States (1277), 137, 46);
- Add_Goto (Table.States (1277), 138, 47);
- Add_Goto (Table.States (1277), 160, 394);
- Add_Goto (Table.States (1277), 161, 395);
- Add_Goto (Table.States (1277), 162, 1288);
- Add_Goto (Table.States (1277), 182, 55);
- Add_Goto (Table.States (1277), 185, 56);
- Add_Goto (Table.States (1277), 189, 57);
- Add_Goto (Table.States (1277), 196, 59);
- Add_Goto (Table.States (1277), 209, 61);
- Add_Goto (Table.States (1277), 210, 62);
- Add_Goto (Table.States (1277), 212, 63);
- Add_Goto (Table.States (1277), 213, 64);
- Add_Goto (Table.States (1277), 216, 65);
- Add_Goto (Table.States (1277), 217, 66);
- Add_Goto (Table.States (1277), 218, 67);
- Add_Goto (Table.States (1277), 219, 68);
- Add_Goto (Table.States (1277), 222, 70);
- Add_Goto (Table.States (1277), 226, 72);
- Add_Goto (Table.States (1277), 246, 75);
- Add_Goto (Table.States (1277), 247, 76);
- Add_Goto (Table.States (1277), 248, 77);
- Add_Goto (Table.States (1277), 249, 78);
- Add_Goto (Table.States (1277), 250, 79);
- Add_Goto (Table.States (1277), 251, 80);
- Add_Goto (Table.States (1277), 252, 81);
- Add_Goto (Table.States (1277), 253, 82);
- Add_Goto (Table.States (1277), 254, 83);
- Add_Goto (Table.States (1277), 260, 397);
- Add_Goto (Table.States (1277), 262, 85);
- Add_Goto (Table.States (1277), 263, 86);
- Add_Goto (Table.States (1277), 265, 88);
- Add_Goto (Table.States (1277), 266, 89);
- Add_Goto (Table.States (1277), 267, 90);
- Add_Goto (Table.States (1277), 268, 91);
- Add_Goto (Table.States (1277), 274, 92);
- Add_Goto (Table.States (1277), 284, 95);
- Add_Goto (Table.States (1277), 292, 96);
- Add_Goto (Table.States (1277), 307, 103);
- Add_Goto (Table.States (1277), 308, 104);
- Add_Goto (Table.States (1277), 310, 106);
- Add_Goto (Table.States (1277), 311, 107);
- Add_Goto (Table.States (1277), 312, 108);
- Add_Goto (Table.States (1277), 314, 109);
- Add_Goto (Table.States (1277), 316, 110);
- Add_Goto (Table.States (1277), 319, 112);
- Add_Goto (Table.States (1277), 320, 113);
- Add_Goto (Table.States (1277), 322, 114);
- Add_Goto (Table.States (1277), 328, 116);
- Add_Goto (Table.States (1277), 334, 117);
- Table.States (1277).Kernel := To_Vector ((0 => ((179, 0), 35, 3,
(2147483647, 0), 0)));
- Table.States (1277).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (162, 1), 0)));
- Table.States (1278).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1278), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (274, 0), 11,
- protected_type_declaration_0'Access,
protected_type_declaration_0_check'Access);
- Table.States (1278).Kernel := To_Vector ((0 => ((274, 0), 99, 0,
(274, 0), 11)));
- Table.States (1278).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (274, 0), 11)));
- Table.States (1279).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1279), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (319, 0), 11,
- task_body_0'Access, task_body_0_check'Access);
- Table.States (1279).Kernel := To_Vector ((0 => ((319, 0), 99, 0,
(319, 0), 11)));
- Table.States (1279).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (319, 0), 11)));
- Table.States (1280).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1280), 99, Reduce, (223, 1), 0, null,
null);
- Add_Action (Table.States (1280), 107, (223, 0), 151);
- Table.States (1280).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (1280), 223, 1289);
- Table.States (1280).Kernel := To_Vector ((0 => ((322, 0), 24, 1,
(2147483647, 0), 0)));
- Table.States (1280).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (223, 1), 0)));
- Table.States (1281).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1281), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (308, 0), 11,
- single_task_declaration_0'Access,
single_task_declaration_0_check'Access);
- Table.States (1281).Kernel := To_Vector ((0 => ((308, 0), 99, 0,
(308, 0), 11)));
- Table.States (1281).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (308, 0), 11)));
- Table.States (1282).Action_List.Set_Capacity (6);
- Add_Action (Table.States (1282), 15, (330, 0), 903);
- Add_Action (Table.States (1282), 24, Reduce, (153, 1), 0, null,
null);
- Add_Action (Table.States (1282), 28, (124, 0), 185);
- Add_Action (Table.States (1282), 41, (152, 4), 904);
- Add_Action (Table.States (1282), 72, Reduce, (153, 1), 0, null,
null);
- Add_Action (Table.States (1282), 107, (222, 1), 166);
- Table.States (1282).Goto_List.Set_Capacity (10);
- Add_Goto (Table.States (1282), 124, 905);
- Add_Goto (Table.States (1282), 130, 41);
- Add_Goto (Table.States (1282), 149, 906);
- Add_Goto (Table.States (1282), 151, 907);
- Add_Goto (Table.States (1282), 152, 908);
- Add_Goto (Table.States (1282), 153, 1290);
- Add_Goto (Table.States (1282), 185, 56);
- Add_Goto (Table.States (1282), 222, 910);
- Add_Goto (Table.States (1282), 284, 95);
- Add_Goto (Table.States (1282), 330, 911);
- Table.States (1282).Kernel := To_Vector ((0 => ((332, 0), 90, 0,
(153, 1), 0)));
- Table.States (1282).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (153, 1), 0)));
- Table.States (1283).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1283), 99, (330, 0), 1291);
- Table.States (1283).Kernel := To_Vector ((0 => ((330, 0), 15, 1,
(2147483647, 0), 0)));
- Table.States (1283).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (330, 0), 99, 1291)));
- Table.States (1284).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1284), 99, (149, 0), 1292);
- Table.States (1284).Kernel := To_Vector ((0 => ((149, 0), 125,
1, (2147483647, 0), 0)));
- Table.States (1284).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (149, 0), 99, 1292)));
- Table.States (1285).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1285), 99, (262, 0), 1293);
- Table.States (1285).Kernel := To_Vector ((0 => ((262, 0), 125,
1, (2147483647, 0), 0)));
- Table.States (1285).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (262, 0), 99, 1293)));
- Table.States (1286).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1286), 99, (147, 0), 1294);
- Table.States (1286).Kernel := To_Vector ((0 => ((147, 0), 304,
1, (2147483647, 0), 0)));
- Table.States (1286).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (147, 0), 99, 1294)));
- Table.States (1287).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1287), 78, (180, 0), 1295);
- Table.States (1287).Kernel := To_Vector ((0 => ((180, 0), 170,
1, (2147483647, 0), 0)));
- Table.States (1287).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (180, 0), 78, 1295)));
- Table.States (1288).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1288), 13, (179, 0), 1296);
- Table.States (1288).Kernel := To_Vector ((0 => ((179, 0), 162,
3, (2147483647, 0), 0)));
- Table.States (1288).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (179, 0), 13, 1296)));
- Table.States (1289).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1289), 99, (322, 0), 1297);
- Table.States (1289).Kernel := To_Vector ((0 => ((322, 0), 223,
1, (2147483647, 0), 0)));
- Table.States (1289).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (322, 0), 99, 1297)));
- Table.States (1290).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1290), (24, 72), (332, 0), 4,
variant_0'Access, null);
- Table.States (1290).Kernel := To_Vector ((0 => ((332, 0), 153,
0, (332, 0), 4)));
- Table.States (1290).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (332, 0), 4)));
- Table.States (1291).Action_List.Set_Capacity (5);
- Add_Action (Table.States (1291), (15, 24, 28, 72, 107), (330, 0),
7, variant_part_0'Access, null);
- Table.States (1291).Kernel := To_Vector ((0 => ((330, 0), 99, 0,
(330, 0), 7)));
- Table.States (1291).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (330, 0), 7)));
- Table.States (1292).Action_List.Set_Capacity (5);
- Add_Action (Table.States (1292), (15, 24, 28, 72, 107), (149, 0),
7, component_declaration_0'Access,
- null);
- Table.States (1292).Kernel := To_Vector ((0 => ((149, 0), 99, 0,
(149, 0), 7)));
- Table.States (1292).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (149, 0), 7)));
- Table.States (1293).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1293), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (262, 0), 12,
- private_extension_declaration_0'Access, null);
- Table.States (1293).Kernel := To_Vector ((0 => ((262, 0), 99, 0,
(262, 0), 12)));
- Table.States (1293).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (262, 0), 12)));
- Table.States (1294).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1294), (24, 107), (147, 0), 8,
component_clause_0'Access, null);
- Table.States (1294).Kernel := To_Vector ((0 => ((147, 0), 99, 0,
(147, 0), 8)));
- Table.States (1294).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (147, 0), 8)));
- Table.States (1295).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1295), 72, Reduce, (256, 1), 0, null,
null);
- Add_Action (Table.States (1295), 76, (202, 0), 434);
- Table.States (1295).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (1295), 202, 347);
- Add_Goto (Table.States (1295), 256, 1298);
- Table.States (1295).Kernel := To_Vector ((0 => ((180, 0), 78, 0,
(256, 1), 0)));
- Table.States (1295).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (256, 1), 0)));
- Table.States (1296).Action_List.Set_Capacity (25);
- Add_Action (Table.States (1296), 4, (116, 0), 1);
- Add_Action (Table.States (1296), 5, (306, 8), 2);
- Add_Action (Table.States (1296), 13, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (1296), 15, (142, 0), 3);
- Add_Action (Table.States (1296), 17, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (1296), 18, (164, 0), 4);
- Add_Action (Table.States (1296), 24, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (1296), 26, Reduce, (303, 1), 0, null,
null);
- Add_Action (Table.States (1296), 27, (193, 0), 5);
- Add_Action (Table.States (1296), 28, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (1296), 31, (306, 3), 9);
- Add_Action (Table.States (1296), 32, (225, 0), 10);
- Add_Action (Table.States (1296), 37, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (1296), 41, (306, 0), 13);
- Add_Action (Table.States (1296), 48, (260, 0), 16);
- Add_Action (Table.States (1296), 52, (279, 0), 20);
- Add_Action (Table.States (1296), 57, (293, 0), 21);
- Add_Action (Table.States (1296), 58, (199, 0), 22);
- Add_Action (Table.States (1296), 61, (129, 0), 24);
- Add_Action (Table.States (1296), 73, Reduce, (135, 1), 0, null,
null);
- Add_Action (Table.States (1296), 81, (242, 8), 31);
- Add_Action (Table.States (1296), 96, (220, 0), 32);
- Add_Action (Table.States (1296), 107, (134, 0), 363);
- Add_Action (Table.States (1296), 108, (242, 7), 34);
- Add_Action (Table.States (1296), 109, (242, 6), 35);
- Table.States (1296).Goto_List.Set_Capacity (32);
- Add_Goto (Table.States (1296), 116, 37);
- Add_Goto (Table.States (1296), 126, 39);
- Add_Goto (Table.States (1296), 129, 40);
- Add_Goto (Table.States (1296), 131, 42);
- Add_Goto (Table.States (1296), 134, 43);
- Add_Goto (Table.States (1296), 135, 44);
- Add_Goto (Table.States (1296), 136, 45);
- Add_Goto (Table.States (1296), 142, 48);
- Add_Goto (Table.States (1296), 154, 51);
- Add_Goto (Table.States (1296), 155, 52);
- Add_Goto (Table.States (1296), 164, 54);
- Add_Goto (Table.States (1296), 193, 58);
- Add_Goto (Table.States (1296), 199, 60);
- Add_Goto (Table.States (1296), 220, 69);
- Add_Goto (Table.States (1296), 221, 1299);
- Add_Goto (Table.States (1296), 225, 71);
- Add_Goto (Table.States (1296), 235, 73);
- Add_Goto (Table.States (1296), 242, 74);
- Add_Goto (Table.States (1296), 260, 84);
- Add_Goto (Table.States (1296), 264, 87);
- Add_Goto (Table.States (1296), 275, 93);
- Add_Goto (Table.States (1296), 279, 94);
- Add_Goto (Table.States (1296), 293, 97);
- Add_Goto (Table.States (1296), 296, 98);
- Add_Goto (Table.States (1296), 297, 99);
- Add_Goto (Table.States (1296), 301, 100);
- Add_Goto (Table.States (1296), 302, 364);
- Add_Goto (Table.States (1296), 303, 393);
- Add_Goto (Table.States (1296), 305, 101);
- Add_Goto (Table.States (1296), 306, 102);
- Add_Goto (Table.States (1296), 309, 366);
- Add_Goto (Table.States (1296), 326, 115);
- Table.States (1296).Kernel := To_Vector ((0 => ((179, 0), 13, 2,
(2147483647, 0), 0)));
- Table.States (1296).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (221, 1), 0)));
- Table.States (1297).Action_List.Set_Capacity (41);
- Add_Action (Table.States (1297), (4, 5, 13, 15, 17, 18, 24, 25,
27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46,
- 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74,
81, 96, 107, 108, 109, 110), (322, 0), 13,
- task_type_declaration_0'Access,
task_type_declaration_0_check'Access);
- Table.States (1297).Kernel := To_Vector ((0 => ((322, 0), 99, 0,
(322, 0), 13)));
- Table.States (1297).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (322, 0), 13)));
- Table.States (1298).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1298), (1 => 72), (180, 0), 7,
entry_body_formal_part_0'Access, null);
- Table.States (1298).Kernel := To_Vector ((0 => ((180, 0), 256,
0, (180, 0), 7)));
- Table.States (1298).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (180, 0), 7)));
- Table.States (1299).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1299), 24, (179, 0), 1300);
- Table.States (1299).Kernel := To_Vector ((0 => ((179, 0), 221,
2, (2147483647, 0), 0)));
- Table.States (1299).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (179, 0), 24, 1300)));
- Table.States (1300).Action_List.Set_Capacity (2);
- Add_Action (Table.States (1300), 99, Reduce, (223, 1), 0, null,
null);
- Add_Action (Table.States (1300), 107, (223, 0), 151);
- Table.States (1300).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (1300), 223, 1301);
- Table.States (1300).Kernel := To_Vector ((0 => ((179, 0), 24, 1,
(2147483647, 0), 0)));
- Table.States (1300).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (223, 1), 0)));
- Table.States (1301).Action_List.Set_Capacity (1);
- Add_Action (Table.States (1301), 99, (179, 0), 1302);
- Table.States (1301).Kernel := To_Vector ((0 => ((179, 0), 223,
1, (2147483647, 0), 0)));
- Table.States (1301).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (179, 0), 99, 1302)));
- Table.States (1302).Action_List.Set_Capacity (7);
- Add_Action (Table.States (1302), (24, 25, 28, 29, 40, 46, 50),
(179, 0), 12, entry_body_0'Access,
- entry_body_0_check'Access);
- Table.States (1302).Kernel := To_Vector ((0 => ((179, 0), 99, 0,
(179, 0), 12)));
- Table.States (1302).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (179, 0), 12)));
- end Subr_22;
- begin
- Subr_1;
- Subr_2;
- Subr_3;
- Subr_4;
- Subr_5;
- Subr_6;
- Subr_7;
- Subr_8;
- Subr_9;
- Subr_10;
- Subr_11;
- Subr_12;
- Subr_13;
- Subr_14;
- Subr_15;
- Subr_16;
- Subr_17;
- Subr_18;
- Subr_19;
- Subr_20;
- Subr_21;
- Subr_22;
- Table.Error_Action := new Parse_Action_Node'((Verb => Error, others
=> <>), null);
- end;
-
- WisiToken.Parse.LR.Parser.New_Parser
- (Parser,
- Trace,
- Lexer.New_Lexer (Trace.Descriptor),
- Table,
- Language_Fixes,
- Language_Matching_Begin_Tokens,
- Language_String_ID_Set,
- User_Data,
- Max_Parallel => 15,
- Terminate_Same_State => True);
- end Create_Parser;
-end Ada_Process_LALR_Main;
diff --git a/ada_process_lalr_main.ads b/ada_process_lalr_main.ads
deleted file mode 100644
index c32bb9bdb6..0000000000
--- a/ada_process_lalr_main.ads
+++ /dev/null
@@ -1,32 +0,0 @@
--- generated parser support file.
--- command line: wisitoken-bnf-generate.exe --generate LALR Ada_Emacs re2c
PROCESS ada.wy
---
-
--- Copyright (C) 2013 - 2020 Free Software Foundation, Inc.
-
--- This program is free software; you can redistribute it and/or
--- modify it under the terms of the GNU General Public License as
--- published by the Free Software Foundation; either version 3, or (at
--- your option) any later version.
---
--- This software is distributed in the hope that it will be useful,
--- but WITHOUT ANY WARRANTY; without even the implied warranty of
--- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
--- General Public License for more details.
---
--- You should have received a copy of the GNU General Public License
--- along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>.
-
-with WisiToken.Syntax_Trees;
-with WisiToken.Parse.LR.Parser;
-package Ada_Process_LALR_Main is
-
- procedure Create_Parser
- (Parser : out WisiToken.Parse.LR.Parser.Parser;
- Language_Fixes : in
WisiToken.Parse.LR.Parser.Language_Fixes_Access;
- Language_Matching_Begin_Tokens : in
WisiToken.Parse.LR.Parser.Language_Matching_Begin_Tokens_Access;
- Language_String_ID_Set : in
WisiToken.Parse.LR.Parser.Language_String_ID_Set_Access;
- Trace : not null access WisiToken.Trace'Class;
- User_Data : in
WisiToken.Syntax_Trees.User_Data_Access);
-
-end Ada_Process_LALR_Main;
diff --git a/ada_process_lr1_main.adb b/ada_process_lr1_main.adb
deleted file mode 100644
index b57aa9efe8..0000000000
--- a/ada_process_lr1_main.adb
+++ /dev/null
@@ -1,483 +0,0 @@
--- generated parser support file.
--- command line: wisitoken-bnf-generate.exe --generate LR1 Ada_Emacs re2c
PROCESS text_rep ada.wy
---
-
--- Copyright (C) 2013 - 2020 Free Software Foundation, Inc.
-
--- This program is free software; you can redistribute it and/or
--- modify it under the terms of the GNU General Public License as
--- published by the Free Software Foundation; either version 3, or (at
--- your option) any later version.
---
--- This software is distributed in the hope that it will be useful,
--- but WITHOUT ANY WARRANTY; without even the implied warranty of
--- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
--- General Public License for more details.
---
--- You should have received a copy of the GNU General Public License
--- along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>.
-
-with Ada_Process_Actions; use Ada_Process_Actions;
-with WisiToken.Lexer.re2c;
-with ada_re2c_c;
-package body Ada_Process_LR1_Main is
-
- package Lexer is new WisiToken.Lexer.re2c
- (ada_re2c_c.New_Lexer,
- ada_re2c_c.Free_Lexer,
- ada_re2c_c.Reset_Lexer,
- ada_re2c_c.Next_Token);
-
- procedure Create_Parser
- (Parser : out WisiToken.Parse.LR.Parser.Parser;
- Language_Fixes : in
WisiToken.Parse.LR.Parser.Language_Fixes_Access;
- Language_Matching_Begin_Tokens : in
WisiToken.Parse.LR.Parser.Language_Matching_Begin_Tokens_Access;
- Language_String_ID_Set : in
WisiToken.Parse.LR.Parser.Language_String_ID_Set_Access;
- Trace : not null access WisiToken.Trace'Class;
- User_Data : in
WisiToken.Syntax_Trees.User_Data_Access;
- Text_Rep_File_Name : in String)
- is
- use WisiToken.Parse.LR;
- McKenzie_Param : constant McKenzie_Param_Type :=
- (First_Terminal => 3,
- Last_Terminal => 110,
- First_Nonterminal => 111,
- Last_Nonterminal => 335,
- Insert =>
- (4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 4, 4, 4, 4, 4, 4, 4, 4, 3,
4, 4, 4, 4, 4, 4, 4, 2, 4, 4, 4, 4, 4, 4,
- 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
- 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4),
- Delete =>
- (4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
- 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
- 4, 4, 4, 1, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4),
- Push_Back =>
- (2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2),
- Undo_Reduce =>
- (2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2),
- Minimal_Complete_Cost_Delta => -3,
- Fast_Forward => 2,
- Matching_Begin => 3,
- Ignore_Check_Fail => 2,
- Task_Count => 0,
- Check_Limit => 4,
- Check_Delta_Limit => 100,
- Enqueue_Limit => 58000);
-
- function Actions return
WisiToken.Parse.LR.Semantic_Action_Array_Arrays.Vector
- is begin
- return Acts : WisiToken.Parse.LR.Semantic_Action_Array_Arrays.Vector
do
- Acts.Set_First_Last (111, 335);
- Acts (115).Set_First_Last (0, 0);
- Acts (115)(0) := (abstract_subprogram_declaration_0'Access, null);
- Acts (116).Set_First_Last (0, 1);
- Acts (116)(0) := (accept_statement_0'Access,
accept_statement_0_check'Access);
- Acts (116)(1) := (accept_statement_1'Access, null);
- Acts (117).Set_First_Last (0, 2);
- Acts (117)(0) := (access_definition_0'Access, null);
- Acts (117)(1) := (access_definition_1'Access, null);
- Acts (117)(2) := (access_definition_2'Access, null);
- Acts (118).Set_First_Last (0, 1);
- Acts (118)(0) := (actual_parameter_part_0'Access, null);
- Acts (118)(1) := (actual_parameter_part_1'Access, null);
- Acts (120).Set_First_Last (0, 6);
- Acts (120)(0) := (aggregate_0'Access, null);
- Acts (120)(2) := (aggregate_2'Access, null);
- Acts (120)(3) := (aggregate_3'Access, null);
- Acts (120)(4) := (aggregate_4'Access, null);
- Acts (120)(5) := (aggregate_5'Access, null);
- Acts (120)(6) := (aggregate_6'Access, null);
- Acts (123).Set_First_Last (0, 1);
- Acts (123)(0) := (array_type_definition_0'Access, null);
- Acts (123)(1) := (array_type_definition_1'Access, null);
- Acts (124).Set_First_Last (0, 3);
- Acts (124)(0) := (aspect_clause_0'Access, null);
- Acts (125).Set_First_Last (0, 1);
- Acts (125)(0) := (aspect_specification_opt_0'Access, null);
- Acts (126).Set_First_Last (0, 0);
- Acts (126)(0) := (assignment_statement_0'Access, null);
- Acts (127).Set_First_Last (0, 7);
- Acts (127)(0) := (association_opt_0'Access, null);
- Acts (127)(2) := (association_opt_2'Access, null);
- Acts (127)(3) := (association_opt_3'Access, null);
- Acts (127)(4) := (association_opt_4'Access, null);
- Acts (127)(6) := (association_opt_6'Access, null);
- Acts (127)(7) := (association_opt_7'Access, null);
- Acts (129).Set_First_Last (0, 0);
- Acts (129)(0) := (asynchronous_select_0'Access, null);
- Acts (130).Set_First_Last (0, 0);
- Acts (130)(0) := (at_clause_0'Access, null);
- Acts (134).Set_First_Last (0, 0);
- Acts (134)(0) := (block_label_0'Access,
block_label_0_check'Access);
- Acts (135).Set_First_Last (0, 1);
- Acts (135)(0) := (null, block_label_opt_0_check'Access);
- Acts (135)(1) := (null, null);
- Acts (136).Set_First_Last (0, 1);
- Acts (136)(0) := (block_statement_0'Access,
block_statement_0_check'Access);
- Acts (136)(1) := (block_statement_1'Access,
block_statement_1_check'Access);
- Acts (139).Set_First_Last (0, 0);
- Acts (139)(0) := (case_expression_0'Access, null);
- Acts (140).Set_First_Last (0, 0);
- Acts (140)(0) := (case_expression_alternative_0'Access, null);
- Acts (141).Set_First_Last (0, 1);
- Acts (141)(0) := (case_expression_alternative_list_0'Access, null);
- Acts (142).Set_First_Last (0, 0);
- Acts (142)(0) := (case_statement_0'Access, null);
- Acts (143).Set_First_Last (0, 0);
- Acts (143)(0) := (case_statement_alternative_0'Access, null);
- Acts (144).Set_First_Last (0, 1);
- Acts (144)(0) := (case_statement_alternative_list_0'Access, null);
- Acts (145).Set_First_Last (0, 4);
- Acts (145)(2) := (compilation_unit_2'Access, null);
- Acts (146).Set_First_Last (0, 1);
- Acts (146)(0) := (compilation_0'Access, null);
- Acts (146)(1) := (compilation_1'Access,
compilation_1_check'Access);
- Acts (147).Set_First_Last (0, 0);
- Acts (147)(0) := (component_clause_0'Access, null);
- Acts (149).Set_First_Last (0, 1);
- Acts (149)(0) := (component_declaration_0'Access, null);
- Acts (149)(1) := (component_declaration_1'Access, null);
- Acts (152).Set_First_Last (0, 4);
- Acts (152)(4) := (component_list_4'Access, null);
- Acts (155).Set_First_Last (0, 0);
- Acts (155)(0) := (conditional_entry_call_0'Access, null);
- Acts (160).Set_First_Last (0, 16);
- Acts (160)(9) := (declaration_9'Access, null);
- Acts (164).Set_First_Last (0, 1);
- Acts (164)(0) := (delay_statement_0'Access, null);
- Acts (164)(1) := (delay_statement_1'Access, null);
- Acts (165).Set_First_Last (0, 1);
- Acts (165)(0) := (derived_type_definition_0'Access, null);
- Acts (165)(1) := (derived_type_definition_1'Access, null);
- Acts (172).Set_First_Last (0, 2);
- Acts (172)(1) := (discriminant_part_opt_1'Access, null);
- Acts (175).Set_First_Last (0, 0);
- Acts (175)(0) := (elsif_expression_item_0'Access, null);
- Acts (176).Set_First_Last (0, 1);
- Acts (176)(0) := (elsif_expression_list_0'Access, null);
- Acts (177).Set_First_Last (0, 0);
- Acts (177)(0) := (elsif_statement_item_0'Access, null);
- Acts (178).Set_First_Last (0, 1);
- Acts (178)(0) := (elsif_statement_list_0'Access, null);
- Acts (179).Set_First_Last (0, 0);
- Acts (179)(0) := (entry_body_0'Access, entry_body_0_check'Access);
- Acts (180).Set_First_Last (0, 1);
- Acts (180)(0) := (entry_body_formal_part_0'Access, null);
- Acts (182).Set_First_Last (0, 1);
- Acts (182)(0) := (entry_declaration_0'Access, null);
- Acts (182)(1) := (entry_declaration_1'Access, null);
- Acts (185).Set_First_Last (0, 0);
- Acts (185)(0) := (enumeration_representation_clause_0'Access,
null);
- Acts (186).Set_First_Last (0, 0);
- Acts (186)(0) := (enumeration_type_definition_0'Access, null);
- Acts (189).Set_First_Last (0, 0);
- Acts (189)(0) := (exception_declaration_0'Access, null);
- Acts (190).Set_First_Last (0, 1);
- Acts (190)(0) := (exception_handler_0'Access, null);
- Acts (190)(1) := (exception_handler_1'Access, null);
- Acts (191).Set_First_Last (0, 2);
- Acts (191)(0) := (exception_handler_list_0'Access, null);
- Acts (193).Set_First_Last (0, 1);
- Acts (193)(0) := (exit_statement_0'Access, null);
- Acts (193)(1) := (exit_statement_1'Access, null);
- Acts (196).Set_First_Last (0, 0);
- Acts (196)(0) := (expression_function_declaration_0'Access, null);
- Acts (197).Set_First_Last (0, 1);
- Acts (197)(0) := (extended_return_object_declaration_0'Access,
null);
- Acts (197)(1) := (extended_return_object_declaration_1'Access,
null);
- Acts (199).Set_First_Last (0, 1);
- Acts (199)(0) := (extended_return_statement_0'Access, null);
- Acts (199)(1) := (extended_return_statement_1'Access, null);
- Acts (201).Set_First_Last (0, 3);
- Acts (201)(0) := (formal_object_declaration_0'Access, null);
- Acts (201)(1) := (formal_object_declaration_1'Access, null);
- Acts (201)(2) := (formal_object_declaration_2'Access, null);
- Acts (201)(3) := (formal_object_declaration_3'Access, null);
- Acts (202).Set_First_Last (0, 0);
- Acts (202)(0) := (formal_part_0'Access, null);
- Acts (203).Set_First_Last (0, 3);
- Acts (203)(0) := (formal_subprogram_declaration_0'Access, null);
- Acts (203)(1) := (formal_subprogram_declaration_1'Access, null);
- Acts (203)(2) := (formal_subprogram_declaration_2'Access, null);
- Acts (203)(3) := (formal_subprogram_declaration_3'Access, null);
- Acts (204).Set_First_Last (0, 2);
- Acts (204)(0) := (formal_type_declaration_0'Access, null);
- Acts (204)(1) := (formal_type_declaration_1'Access, null);
- Acts (204)(2) := (formal_type_declaration_2'Access, null);
- Acts (206).Set_First_Last (0, 1);
- Acts (206)(0) := (formal_derived_type_definition_0'Access, null);
- Acts (206)(1) := (formal_derived_type_definition_1'Access, null);
- Acts (207).Set_First_Last (0, 0);
- Acts (207)(0) := (formal_package_declaration_0'Access, null);
- Acts (209).Set_First_Last (0, 2);
- Acts (209)(0) := (full_type_declaration_0'Access, null);
- Acts (210).Set_First_Last (0, 0);
- Acts (210)(0) := (function_specification_0'Access,
function_specification_0_check'Access);
- Acts (213).Set_First_Last (0, 1);
- Acts (213)(0) := (generic_formal_part_0'Access, null);
- Acts (213)(1) := (generic_formal_part_1'Access, null);
- Acts (216).Set_First_Last (0, 2);
- Acts (216)(0) := (generic_instantiation_0'Access, null);
- Acts (216)(1) := (generic_instantiation_1'Access, null);
- Acts (216)(2) := (generic_instantiation_2'Access, null);
- Acts (217).Set_First_Last (0, 0);
- Acts (217)(0) := (generic_package_declaration_0'Access, null);
- Acts (218).Set_First_Last (0, 2);
- Acts (218)(0) := (generic_renaming_declaration_0'Access, null);
- Acts (218)(1) := (generic_renaming_declaration_1'Access, null);
- Acts (218)(2) := (generic_renaming_declaration_2'Access, null);
- Acts (219).Set_First_Last (0, 0);
- Acts (219)(0) := (generic_subprogram_declaration_0'Access, null);
- Acts (220).Set_First_Last (0, 0);
- Acts (220)(0) := (goto_label_0'Access, null);
- Acts (221).Set_First_Last (0, 1);
- Acts (221)(0) := (handled_sequence_of_statements_0'Access, null);
- Acts (222).Set_First_Last (0, 1);
- Acts (222)(0) := (identifier_list_0'Access, null);
- Acts (222)(1) := (identifier_list_1'Access, null);
- Acts (223).Set_First_Last (0, 1);
- Acts (223)(0) := (null, identifier_opt_0_check'Access);
- Acts (223)(1) := (null, null);
- Acts (224).Set_First_Last (0, 3);
- Acts (224)(0) := (if_expression_0'Access, null);
- Acts (224)(1) := (if_expression_1'Access, null);
- Acts (224)(2) := (if_expression_2'Access, null);
- Acts (224)(3) := (if_expression_3'Access, null);
- Acts (225).Set_First_Last (0, 3);
- Acts (225)(0) := (if_statement_0'Access, null);
- Acts (225)(1) := (if_statement_1'Access, null);
- Acts (225)(2) := (if_statement_2'Access, null);
- Acts (225)(3) := (if_statement_3'Access, null);
- Acts (226).Set_First_Last (0, 1);
- Acts (226)(0) := (incomplete_type_declaration_0'Access, null);
- Acts (226)(1) := (incomplete_type_declaration_1'Access, null);
- Acts (227).Set_First_Last (0, 0);
- Acts (227)(0) := (index_constraint_0'Access, null);
- Acts (230).Set_First_Last (0, 1);
- Acts (230)(0) := (interface_list_0'Access, null);
- Acts (230)(1) := (interface_list_1'Access, null);
- Acts (232).Set_First_Last (0, 1);
- Acts (232)(0) := (iteration_scheme_0'Access, null);
- Acts (232)(1) := (iteration_scheme_1'Access, null);
- Acts (233).Set_First_Last (0, 5);
- Acts (233)(2) := (iterator_specification_2'Access, null);
- Acts (233)(5) := (iterator_specification_5'Access, null);
- Acts (235).Set_First_Last (0, 1);
- Acts (235)(0) := (loop_statement_0'Access,
loop_statement_0_check'Access);
- Acts (235)(1) := (loop_statement_1'Access,
loop_statement_1_check'Access);
- Acts (242).Set_First_Last (0, 8);
- Acts (242)(0) := (name_0'Access, null);
- Acts (242)(1) := (name_1'Access, null);
- Acts (242)(2) := (null, name_2_check'Access);
- Acts (242)(3) := (null, null);
- Acts (242)(4) := (null, null);
- Acts (242)(5) := (name_5'Access, name_5_check'Access);
- Acts (242)(6) := (null, null);
- Acts (242)(7) := (null, name_7_check'Access);
- Acts (242)(8) := (null, null);
- Acts (243).Set_First_Last (0, 1);
- Acts (243)(0) := (null, name_opt_0_check'Access);
- Acts (243)(1) := (null, null);
- Acts (245).Set_First_Last (0, 3);
- Acts (245)(0) := (null_exclusion_opt_name_type_0'Access, null);
- Acts (245)(1) := (null_exclusion_opt_name_type_1'Access, null);
- Acts (245)(2) := (null_exclusion_opt_name_type_2'Access, null);
- Acts (245)(3) := (null_exclusion_opt_name_type_3'Access, null);
- Acts (246).Set_First_Last (0, 0);
- Acts (246)(0) := (null_procedure_declaration_0'Access, null);
- Acts (247).Set_First_Last (0, 7);
- Acts (247)(0) := (object_declaration_0'Access, null);
- Acts (247)(1) := (object_declaration_1'Access, null);
- Acts (247)(2) := (object_declaration_2'Access, null);
- Acts (247)(3) := (object_declaration_3'Access, null);
- Acts (247)(4) := (object_declaration_4'Access, null);
- Acts (247)(5) := (object_declaration_5'Access, null);
- Acts (248).Set_First_Last (0, 2);
- Acts (248)(0) := (object_renaming_declaration_0'Access, null);
- Acts (248)(1) := (object_renaming_declaration_1'Access, null);
- Acts (248)(2) := (object_renaming_declaration_2'Access, null);
- Acts (249).Set_First_Last (0, 2);
- Acts (249)(0) := (overriding_indicator_opt_0'Access, null);
- Acts (249)(1) := (overriding_indicator_opt_1'Access, null);
- Acts (250).Set_First_Last (0, 1);
- Acts (250)(0) := (package_body_0'Access,
package_body_0_check'Access);
- Acts (250)(1) := (package_body_1'Access,
package_body_1_check'Access);
- Acts (251).Set_First_Last (0, 0);
- Acts (251)(0) := (package_body_stub_0'Access, null);
- Acts (252).Set_First_Last (0, 0);
- Acts (252)(0) := (package_declaration_0'Access, null);
- Acts (253).Set_First_Last (0, 0);
- Acts (253)(0) := (package_renaming_declaration_0'Access, null);
- Acts (254).Set_First_Last (0, 1);
- Acts (254)(0) := (package_specification_0'Access,
package_specification_0_check'Access);
- Acts (254)(1) := (package_specification_1'Access,
package_specification_1_check'Access);
- Acts (255).Set_First_Last (0, 1);
- Acts (255)(0) := (parameter_and_result_profile_0'Access, null);
- Acts (257).Set_First_Last (0, 4);
- Acts (257)(0) := (parameter_specification_0'Access, null);
- Acts (257)(1) := (parameter_specification_1'Access, null);
- Acts (257)(2) := (parameter_specification_2'Access, null);
- Acts (257)(3) := (parameter_specification_3'Access, null);
- Acts (259).Set_First_Last (0, 1);
- Acts (259)(0) := (paren_expression_0'Access, null);
- Acts (260).Set_First_Last (0, 2);
- Acts (260)(0) := (pragma_g_0'Access, null);
- Acts (260)(1) := (pragma_g_1'Access, null);
- Acts (260)(2) := (pragma_g_2'Access, null);
- Acts (261).Set_First_Last (0, 4);
- Acts (261)(0) := (primary_0'Access, null);
- Acts (261)(2) := (primary_2'Access, null);
- Acts (261)(4) := (primary_4'Access, null);
- Acts (262).Set_First_Last (0, 0);
- Acts (262)(0) := (private_extension_declaration_0'Access, null);
- Acts (263).Set_First_Last (0, 0);
- Acts (263)(0) := (private_type_declaration_0'Access, null);
- Acts (264).Set_First_Last (0, 0);
- Acts (264)(0) := (procedure_call_statement_0'Access, null);
- Acts (265).Set_First_Last (0, 0);
- Acts (265)(0) := (procedure_specification_0'Access,
procedure_specification_0_check'Access);
- Acts (267).Set_First_Last (0, 0);
- Acts (267)(0) := (protected_body_0'Access,
protected_body_0_check'Access);
- Acts (268).Set_First_Last (0, 0);
- Acts (268)(0) := (protected_body_stub_0'Access, null);
- Acts (269).Set_First_Last (0, 1);
- Acts (269)(0) := (protected_definition_0'Access,
protected_definition_0_check'Access);
- Acts (269)(1) := (protected_definition_1'Access,
protected_definition_1_check'Access);
- Acts (274).Set_First_Last (0, 1);
- Acts (274)(0) := (protected_type_declaration_0'Access,
protected_type_declaration_0_check'Access);
- Acts (274)(1) := (protected_type_declaration_1'Access,
protected_type_declaration_1_check'Access);
- Acts (275).Set_First_Last (0, 0);
- Acts (275)(0) := (qualified_expression_0'Access, null);
- Acts (276).Set_First_Last (0, 0);
- Acts (276)(0) := (quantified_expression_0'Access, null);
- Acts (278).Set_First_Last (0, 1);
- Acts (278)(0) := (raise_expression_0'Access, null);
- Acts (279).Set_First_Last (0, 2);
- Acts (279)(0) := (raise_statement_0'Access, null);
- Acts (279)(1) := (raise_statement_1'Access, null);
- Acts (279)(2) := (raise_statement_2'Access, null);
- Acts (280).Set_First_Last (0, 2);
- Acts (280)(0) := (range_g_0'Access, null);
- Acts (283).Set_First_Last (0, 1);
- Acts (283)(0) := (record_definition_0'Access, null);
- Acts (284).Set_First_Last (0, 0);
- Acts (284)(0) := (record_representation_clause_0'Access, null);
- Acts (293).Set_First_Last (0, 1);
- Acts (293)(0) := (requeue_statement_0'Access, null);
- Acts (293)(1) := (requeue_statement_1'Access, null);
- Acts (294).Set_First_Last (0, 1);
- Acts (294)(0) := (result_profile_0'Access, null);
- Acts (294)(1) := (result_profile_1'Access, null);
- Acts (296).Set_First_Last (0, 3);
- Acts (296)(0) := (selected_component_0'Access,
selected_component_0_check'Access);
- Acts (296)(1) := (selected_component_1'Access, null);
- Acts (296)(2) := (selected_component_2'Access,
selected_component_2_check'Access);
- Acts (296)(3) := (selected_component_3'Access, null);
- Acts (297).Set_First_Last (0, 1);
- Acts (297)(0) := (selective_accept_0'Access, null);
- Acts (297)(1) := (selective_accept_1'Access, null);
- Acts (298).Set_First_Last (0, 5);
- Acts (298)(0) := (select_alternative_0'Access, null);
- Acts (298)(1) := (select_alternative_1'Access, null);
- Acts (298)(2) := (select_alternative_2'Access, null);
- Acts (298)(4) := (select_alternative_4'Access, null);
- Acts (299).Set_First_Last (0, 1);
- Acts (299)(0) := (select_alternative_list_0'Access, null);
- Acts (299)(1) := (select_alternative_list_1'Access, null);
- Acts (305).Set_First_Last (0, 0);
- Acts (305)(0) := (simple_return_statement_0'Access, null);
- Acts (306).Set_First_Last (0, 10);
- Acts (306)(0) := (simple_statement_0'Access, null);
- Acts (306)(3) := (simple_statement_3'Access, null);
- Acts (306)(8) := (simple_statement_8'Access, null);
- Acts (307).Set_First_Last (0, 1);
- Acts (307)(0) := (single_protected_declaration_0'Access,
single_protected_declaration_0_check'Access);
- Acts (307)(1) := (single_protected_declaration_1'Access,
single_protected_declaration_1_check'Access);
- Acts (308).Set_First_Last (0, 2);
- Acts (308)(0) := (single_task_declaration_0'Access,
single_task_declaration_0_check'Access);
- Acts (308)(1) := (single_task_declaration_1'Access,
single_task_declaration_1_check'Access);
- Acts (308)(2) := (single_task_declaration_2'Access, null);
- Acts (310).Set_First_Last (0, 0);
- Acts (310)(0) := (subprogram_body_0'Access,
subprogram_body_0_check'Access);
- Acts (311).Set_First_Last (0, 0);
- Acts (311)(0) := (subprogram_body_stub_0'Access, null);
- Acts (312).Set_First_Last (0, 0);
- Acts (312)(0) := (subprogram_declaration_0'Access, null);
- Acts (313).Set_First_Last (0, 2);
- Acts (313)(0) := (subprogram_default_0'Access, null);
- Acts (314).Set_First_Last (0, 0);
- Acts (314)(0) := (subprogram_renaming_declaration_0'Access, null);
- Acts (315).Set_First_Last (0, 1);
- Acts (315)(0) := (null, subprogram_specification_0_check'Access);
- Acts (315)(1) := (null, subprogram_specification_1_check'Access);
- Acts (316).Set_First_Last (0, 0);
- Acts (316)(0) := (subtype_declaration_0'Access, null);
- Acts (317).Set_First_Last (0, 3);
- Acts (317)(0) := (subtype_indication_0'Access, null);
- Acts (317)(1) := (subtype_indication_1'Access, null);
- Acts (317)(2) := (subtype_indication_2'Access, null);
- Acts (317)(3) := (subtype_indication_3'Access, null);
- Acts (318).Set_First_Last (0, 0);
- Acts (318)(0) := (subunit_0'Access, null);
- Acts (319).Set_First_Last (0, 0);
- Acts (319)(0) := (task_body_0'Access, task_body_0_check'Access);
- Acts (320).Set_First_Last (0, 0);
- Acts (320)(0) := (task_body_stub_0'Access, null);
- Acts (321).Set_First_Last (0, 1);
- Acts (321)(0) := (task_definition_0'Access, null);
- Acts (321)(1) := (task_definition_1'Access, null);
- Acts (322).Set_First_Last (0, 2);
- Acts (322)(0) := (task_type_declaration_0'Access,
task_type_declaration_0_check'Access);
- Acts (322)(1) := (task_type_declaration_1'Access,
task_type_declaration_1_check'Access);
- Acts (322)(2) := (task_type_declaration_2'Access, null);
- Acts (326).Set_First_Last (0, 0);
- Acts (326)(0) := (timed_entry_call_0'Access, null);
- Acts (330).Set_First_Last (0, 0);
- Acts (330)(0) := (variant_part_0'Access, null);
- Acts (331).Set_First_Last (0, 1);
- Acts (331)(0) := (variant_list_0'Access, null);
- Acts (332).Set_First_Last (0, 0);
- Acts (332)(0) := (variant_0'Access, null);
- Acts (334).Set_First_Last (0, 2);
- Acts (334)(0) := (use_clause_0'Access, null);
- Acts (334)(1) := (use_clause_1'Access, null);
- Acts (334)(2) := (use_clause_2'Access, null);
- Acts (335).Set_First_Last (0, 3);
- Acts (335)(0) := (with_clause_0'Access, null);
- Acts (335)(1) := (with_clause_1'Access, null);
- Acts (335)(2) := (with_clause_2'Access, null);
- Acts (335)(3) := (with_clause_3'Access, null);
- end return;
- end Actions;
-
- Table : constant Parse_Table_Ptr := Get_Text_Rep
- (Text_Rep_File_Name, McKenzie_Param, Actions);
- begin
- WisiToken.Parse.LR.Parser.New_Parser
- (Parser,
- Trace,
- Lexer.New_Lexer (Trace.Descriptor),
- Table,
- Language_Fixes,
- Language_Matching_Begin_Tokens,
- Language_String_ID_Set,
- User_Data,
- Max_Parallel => 15,
- Terminate_Same_State => True);
- end Create_Parser;
-end Ada_Process_LR1_Main;
diff --git a/ada_process_lr1_main.ads b/ada_process_lr1_main.ads
deleted file mode 100644
index 03331f6583..0000000000
--- a/ada_process_lr1_main.ads
+++ /dev/null
@@ -1,33 +0,0 @@
--- generated parser support file.
--- command line: wisitoken-bnf-generate.exe --generate LR1 Ada_Emacs re2c
PROCESS text_rep ada.wy
---
-
--- Copyright (C) 2013 - 2020 Free Software Foundation, Inc.
-
--- This program is free software; you can redistribute it and/or
--- modify it under the terms of the GNU General Public License as
--- published by the Free Software Foundation; either version 3, or (at
--- your option) any later version.
---
--- This software is distributed in the hope that it will be useful,
--- but WITHOUT ANY WARRANTY; without even the implied warranty of
--- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
--- General Public License for more details.
---
--- You should have received a copy of the GNU General Public License
--- along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>.
-
-with WisiToken.Syntax_Trees;
-with WisiToken.Parse.LR.Parser;
-package Ada_Process_LR1_Main is
-
- procedure Create_Parser
- (Parser : out WisiToken.Parse.LR.Parser.Parser;
- Language_Fixes : in
WisiToken.Parse.LR.Parser.Language_Fixes_Access;
- Language_Matching_Begin_Tokens : in
WisiToken.Parse.LR.Parser.Language_Matching_Begin_Tokens_Access;
- Language_String_ID_Set : in
WisiToken.Parse.LR.Parser.Language_String_ID_Set_Access;
- Trace : not null access WisiToken.Trace'Class;
- User_Data : in
WisiToken.Syntax_Trees.User_Data_Access;
- Text_Rep_File_Name : in String);
-
-end Ada_Process_LR1_Main;
diff --git a/benchmark-xref.el b/benchmark-xref.el
new file mode 100644
index 0000000000..c5ba46cea0
--- /dev/null
+++ b/benchmark-xref.el
@@ -0,0 +1,41 @@
+;; xref backend agnostic benchmark for xref operations
+
+(defun bench-xref-one-test (test xref-function)
+ (find-file (car test))
+ (goto-char (point-min))
+ (dolist (op (cdr test))
+ (let ((search-start (point-min)))
+ (dolist (target op)
+ (if (string-equal target "")
+ (setq search-start (point))
+ (goto-char search-start)
+ (search-forward-regexp target)
+ (setq search-start (match-beginning 0))))
+ (call-interactively xref-function))))
+
+(defun benchmark-xref (test-list xref-function)
+ "TEST-LIST is a list of TEST, where TEST is a list (FILENAME (TARGET ...)
...).
+For each TEST, open the file, and search for each TARGET,
+starting from point-min. If TARGET is "", start the next test
+from current point instead. Then invoke xref-function. Repeat for
+each list of TARGET, using the current file. Show the time for
+each TEST, and the total time.
+
+For the wisi xref backend, xref-function should be wisi-goto-spec/body.
+For eglot xref backend, xref-function should be xref-find-definitions."
+(let ((total-start-time (current-time)))
+ (dolist (test test-list)
+ (let ((test-start-time (current-time)))
+ (bench-xref-one-test test xref-function)
+ (message "%s %f" (car test) (float-time (time-since test-start-time)))))
+ (message "total time: %f" (float-time (time-since total-start-time)))))
+
+(defconst ada-mode-test
+ '(("/Projects/org.emacs.ada-mode/wisi-ada.adb"
+ ("Indent_Token_1" "Tree.Line_Region" "Line_Region") ;; to
-syntax_trees.ads
+ ("") ;; to -syntax_trees.adb
+ ))
+ "Example test-list for Emacs ada-mode development project.")
+
+(provide 'benchmark-xref.el)
+;; end of file
diff --git a/build.sh b/build.sh
index be09a2acfb..d70e45ddca 100755
--- a/build.sh
+++ b/build.sh
@@ -35,7 +35,16 @@ gnatprep -DELPA="yes" $WISI_DIR/wisi.gpr.gp
$WISI_DIR/wisi.gpr
# - Run gprclean, to allow changing compilers and other drastic things
# - Don't delete ada_lr1_parse_table.txt
-gprclean -q -r -P ada_mode_wisi_parse.gpr -aP$WISI_DIR
+gprclean -r -P ada_mode_wisi_parse.gpr -aP$WISI_DIR
+
+cd $WISI_DIR; ./build-wisitoken-bnf-generate.sh
+
+# We generate the Ada LR parse table .txt file here, because it is too
+# large to keep in ELPA. The code generated by wisitoken-bnf-generate
+# is in ELPA, because it requires the re2c tool, which we don't expect
+# users to have installed. The LR parse table for gpr is in the Ada
+# code, so we don't need to generate that here.
+$WISI_DIR/wisitoken-bnf-generate --task_count 1 ada_annex_p.wy
gprbuild -p -j8 -P ada_mode_wisi_parse.gpr -aP $WISI_DIR "$@"
diff --git a/config.pragmas b/config.pragmas
deleted file mode 100644
index 3d0b1a8ac5..0000000000
--- a/config.pragmas
+++ /dev/null
@@ -1,6 +0,0 @@
-pragma No_Heap_Finalization;
-pragma Restrictions (No_Initialize_Scalars);
-pragma Restrictions (No_Abort_Statements);
-pragma Restrictions (Max_Asynchronous_Select_Nesting => 0);
-pragma Restrictions (No_Asynchronous_Control);
-pragma Restrictions (No_Dynamic_Priorities);
diff --git a/dir b/dir
deleted file mode 100644
index 4c07b01f3f..0000000000
--- a/dir
+++ /dev/null
@@ -1,22 +0,0 @@
-This is the file .../info/dir, which contains the
-topmost node of the Info hierarchy, called (dir)Top.
-The first time you invoke Info you start off looking at this node.
-
-File: dir, Node: Top This is the top of the INFO tree
-
- This (the Directory node) gives a menu of major topics.
- Typing "q" exits, "H" lists all Info commands, "d" returns here,
- "h" gives a primer for first-timers,
- "mEmacs<Return>" visits the Emacs manual, etc.
-
- In Emacs, you can click mouse button 2 on a menu item or cross reference
- to select it.
-
-* Menu:
-
-Emacs
-* Ada mode: (ada-mode). Emacs mode for editing and navigating Ada code.
-* Wisi: (wisi). Error-correcting LR parsers and project
- integration.
-* gpr mode: (gpr-mode). Emacs mode for editing and navigating gpr
- files (gnat project files).
diff --git a/gnat-core.el b/gnat-core.el
deleted file mode 100644
index 5901b2234e..0000000000
--- a/gnat-core.el
+++ /dev/null
@@ -1,449 +0,0 @@
-;; gnat-core.el --- Support for running GNAT tools, which support multiple
programming -*- lexical-binding:t -*-
-;; languages.
-;;
-;; GNAT is provided by AdaCore; see http://libre.adacore.com/
-;;
-;;; Copyright (C) 2012 - 2020 Free Software Foundation, Inc.
-;;
-;; Author: Stephen Leake <stephen_leake@member.fsf.org>
-;; Maintainer: Stephen Leake <stephen_leake@member.fsf.org>
-;;
-;; This file is part of GNU Emacs.
-;;
-;; GNU Emacs is free software: you can redistribute it and/or modify
-;; it under the terms of the GNU General Public License as published by
-;; the Free Software Foundation, either version 3 of the License, or
-;; (at your option) any later version.
-;;
-;; GNU Emacs is distributed in the hope that it will be useful,
-;; but WITHOUT ANY WARRANTY; without even the implied warranty of
-;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-;; GNU General Public License for more details.
-;;
-;; You should have received a copy of the GNU General Public License
-;; along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>.
-
-(require 'cl-lib)
-(require 'wisi-prj)
-
-;;;;; code
-
-(defcustom ada-gnat-debug-run nil
- ;; Name implies Ada, which is wrong. Kept for backward compatibility.
- "If t, compilation buffers containing a GNAT command will show
-the command. Otherwise, they will show only the output of the
-command. This applies e.g. to *gnatfind* buffers."
- :type 'boolean
- :safe #'booleanp
- :group 'ada)
-
-;;;; project file handling
-
-(cl-defstruct gnat-compiler
- "Used with wisi-compiler-* generic functions."
-
- gpr-file ;; absolute file name of GNAT project file.
- run-buffer-name ;; string; some compiler objects have no gpr file
- project-path ;; list of directories from GPR_PROJECT_PATH
- target ;; gnat --target argument.
- runtime ;; gnat --RTS argument.
- gnat-stub-opts ;; options for gnat stub
- gnat-stub-cargs ;; cargs options for gnat stub
- )
-
-;;;###autoload
-(cl-defun create-gnat-compiler
- (&key
- gpr-file
- run-buffer-name
- project-path
- target
- runtime
- gnat-stub-opts
- gnat-stub-cargs)
- ;; See note on `create-ada-prj' for why this is not a defalias.
- (make-gnat-compiler
- :gpr-file gpr-file
- :run-buffer-name run-buffer-name
- :project-path project-path
- :target target
- :runtime runtime
- :gnat-stub-opts gnat-stub-opts
- :gnat-stub-cargs gnat-stub-cargs
- ))
-
-(defun gnat-compiler-require-prj ()
- "Return current `gnat-compiler' object from current project compiler.
-Throw an error if current project does not have a gnat-compiler."
- (let* ((wisi-prj (wisi-prj-require-prj))
- (compiler (wisi-prj-compiler wisi-prj)))
- (if (gnat-compiler-p compiler)
- compiler
- (error "no gnat-compiler in current project"))))
-
-(defun gnat-prj-add-prj-dir (project compiler dir)
- "Add DIR to COMPILER.project_path, and to GPR_PROJECT_PATH in
PROJECT.file-env"
- ;; We maintain two project values for this;
- ;; project-path - a list of directories, for elisp find file
- ;; GPR_PROJECT_PATH in environment, for gnat-run
- (let ((process-environment (copy-sequence (wisi-prj-file-env project))))
- (cl-pushnew dir (gnat-compiler-project-path compiler) :test #'string-equal)
-
- (setenv "GPR_PROJECT_PATH"
- (mapconcat 'identity
- (gnat-compiler-project-path compiler) path-separator))
- (setf (wisi-prj-file-env project) (copy-sequence process-environment))
- ))
-
-(defun gnat-get-paths (project compiler)
- "Add project and/or compiler source, project paths to PROJECT source-path"
- (let* ((src-dirs (wisi-prj-source-path project))
- (prj-dirs (cl-copy-list (gnat-compiler-project-path compiler))))
-
- ;; Don't need project plist obj_dirs if using a project file, so
- ;; not setting obj-dirs.
- ;;
- ;; We only need to update prj-dirs if the gpr-file is an aggregate
- ;; project that sets the project path.
-
- (condition-case-unless-debug nil
- (with-current-buffer (gnat-run-buffer project
(gnat-compiler-run-buffer-name (wisi-prj-compiler project)))
- ;; gnat list -v -P can return status 0 or 4; always lists compiler
dirs
- (gnat-run-gnat project "list" (list "-v") '(0 4))
-
- (goto-char (point-min))
-
- ;; Source path
- (search-forward "Source Search Path:")
- (forward-line 1)
- (while (not (looking-at "^$")) ; terminate on blank line
- (back-to-indentation) ; skip whitespace forward
- (cl-pushnew
- (if (looking-at "<Current_Directory>")
- (directory-file-name default-directory)
- (expand-file-name ; Canonicalize path part.
- (directory-file-name
- (buffer-substring-no-properties (point) (point-at-eol)))))
- src-dirs
- :test #'string-equal)
- (forward-line 1))
-
- ;; Project path
- ;;
- ;; These are also added to src_dir, so compilation errors
- ;; reported in project files are found.
- (search-forward "Project Search Path:")
- (forward-line 1)
- (while (not (looking-at "^$"))
- (back-to-indentation)
- (if (looking-at "<Current_Directory>")
- (cl-pushnew (directory-file-name default-directory) prj-dirs
:test #'string-equal)
- (let ((f (expand-file-name
- (buffer-substring-no-properties (point)
(point-at-eol)))))
- (cl-pushnew f prj-dirs :test #'string-equal)
- (cl-pushnew f src-dirs :test #'string-equal)))
- (forward-line 1))
-
- )
- (error
- ;; search-forward failed. Possible causes:
- ;;
- ;; missing dirs in GPR_PROJECT_PATH => user error
- ;; missing Object_Dir => gprbuild not run yet; it will be run soon
- ;; some files are missing string quotes => user error
- ;;
- ;; We used to call gpr_query to get src-dirs, prj-dirs here; it
- ;; is tolerant of the above errors. But ignoring the errors, to
- ;; let gprbuild run with GPR_PROJECT_PATH set, is simpler.
- (pop-to-buffer (gnat-run-buffer project (gnat-compiler-run-buffer-name
(wisi-prj-compiler project))))
- (message "project search path: %s" prj-dirs)
- (message "parse gpr failed")
- ))
-
- ;; reverse prj-dirs so project file dirs precede gnat library dirs
- (setf (wisi-prj-source-path project) (nreverse (delete-dups src-dirs)))
- (setf (gnat-compiler-project-path compiler) nil)
- (mapc (lambda (dir) (gnat-prj-add-prj-dir project compiler dir))
- prj-dirs)
- ))
-
-(defun gnat-parse-gpr (gpr-file project compiler)
- "Append to source-path and project-path in PROJECT (a `wisi-prj' object) by
parsing GPR-FILE.
-GPR-FILE must be absolute file name.
-source-path will include compiler runtime."
- ;; this can take a long time; let the user know what's up
- (if (gnat-compiler-gpr-file compiler)
- ;; gpr-file previously set; new one must match
- (when (not (string-equal gpr-file (gnat-compiler-gpr-file compiler)))
- (error "project file %s defines a different GNAT project file than %s"
- (gnat-compiler-gpr-file compiler)
- gpr-file))
-
- (setf (gnat-compiler-gpr-file compiler) gpr-file))
-
- (gnat-get-paths project compiler))
-
-(defun gnat-parse-gpr-1 (gpr-file project)
- "For `wisi-prj-parser-alist'."
- (let ((compiler (wisi-prj-compiler project)))
- ;; FIXME: need to pass in compiler for gpr-query?
- (setf (gnat-compiler-run-buffer-name compiler) gpr-file)
- (gnat-parse-gpr gpr-file project compiler)))
-
-;;;; command line tool interface
-
-(defun gnat-run-buffer-name (prj-file-name &optional prefix)
- ;; We don't use (gnat-compiler-gpr-file compiler), because multiple
- ;; wisi-prj files can use one gpr-file.
- (concat (or prefix " *gnat-run-")
- prj-file-name
- "*"))
-
-(defun gnat-run-buffer (project name)
- "Return a buffer suitable for running gnat command line tools for PROJECT"
- (let* ((buffer (get-buffer name)))
-
- (unless (buffer-live-p buffer)
- (setq buffer (get-buffer-create name))
- (when (gnat-compiler-gpr-file (wisi-prj-compiler project))
- ;; Otherwise assume `default-directory' is already correct (or
- ;; doesn't matter).
- (with-current-buffer buffer
- (setq default-directory
- (file-name-directory
- (gnat-compiler-gpr-file (wisi-prj-compiler project)))))
- ))
- buffer))
-
-(defun gnat-run (project exec command &optional err-msg expected-status)
- "Run a gnat command line tool, as \"EXEC COMMAND\".
-PROJECT is a `wisi-prj' object.
-EXEC must be an executable found on `exec-path'.
-COMMAND must be a list of strings.
-ERR-MSG must be nil or a string.
-EXPECTED-STATUS must be nil or a list of integers; throws an error if
-process status is not a member.
-
-Return process status.
-Assumes current buffer is (gnat-run-buffer)"
- (set 'buffer-read-only nil)
- (erase-buffer)
-
- (setq command (cl-delete-if 'null command))
-
- (let ((process-environment
- (append
- (wisi-prj-compile-env project)
- (wisi-prj-file-env project)
- (copy-sequence process-environment)))
- status)
-
- (when ada-gnat-debug-run
- (insert (format "GPR_PROJECT_PATH=%s\n%s " (getenv "GPR_PROJECT_PATH")
exec))
- (mapc (lambda (str) (insert (concat str " "))) command)
- (newline))
-
- (setq status (apply 'call-process exec nil t nil command))
- (cond
- ((memq status (or expected-status '(0))); success
- nil)
-
- (t ; failure
- (pop-to-buffer (current-buffer))
- (if err-msg
- (error "%s %s failed; %s" exec (car command) err-msg)
- (error "%s %s failed" exec (car command))
- ))
- )))
-
-(defun gnat-run-gnat (project command &optional switches-args expected-status)
- "Run the \"gnat\" command line tool, as \"gnat COMMAND -P<prj>
SWITCHES-ARGS\".
-COMMAND must be a string, SWITCHES-ARGS a list of strings.
-EXPECTED-STATUS must be nil or a list of integers.
-Return process status.
-Assumes current buffer is (gnat-run-buffer)"
- (let* ((compiler (wisi-prj-compiler project))
- (gpr-file (gnat-compiler-gpr-file compiler))
- (project-file-switch
- (when gpr-file
- (concat "-P" (file-name-nondirectory gpr-file))))
- (target-gnat (concat (gnat-compiler-target compiler) "gnat"))
- ;; gnat list understands --RTS without a fully qualified
- ;; path, gnat find (in particular) doesn't (but it doesn't
- ;; need to, it uses the ALI files found via the GPR)
- (runtime
- (when (and (gnat-compiler-runtime compiler) (string= command "list"))
- (list (concat "--RTS=" (gnat-compiler-runtime compiler)))))
- (cmd (append (list command) (list project-file-switch) runtime
switches-args)))
-
- (gnat-run project target-gnat cmd nil expected-status)
- ))
-
-(defun gnat-run-no-prj (command &optional dir)
- "Run the gnat command line tool, as \"gnat COMMAND\", with DIR as current
directory.
-Return process status. Process output goes to current buffer,
-which is displayed on error."
- (set 'buffer-read-only nil)
- (erase-buffer)
-
- (when ada-gnat-debug-run
- (setq command (cl-delete-if 'null command))
- (mapc (lambda (str) (insert (concat str " "))) command)
- (newline))
-
- (let ((default-directory (or dir default-directory))
- status)
-
- (setq status (apply 'call-process "gnat" nil t nil command))
- (cond
- ((= status 0); success
- nil)
-
- (t ; failure
- (pop-to-buffer (current-buffer))
- (error "gnat %s failed" (car command)))
- )))
-
-(cl-defmethod wisi-compiler-parse-one ((compiler gnat-compiler) project name
value)
- (cond
- ((or
- (string= name "ada_project_path") ;; backward compatibility
- (string= name "gpr_project_path"))
- (let ((process-environment
- (append
- (wisi-prj-compile-env project)
- (wisi-prj-file-env project))));; reference, for
substitute-in-file-name
- (gnat-prj-add-prj-dir project compiler (expand-file-name
(substitute-in-file-name value)))))
-
- ((string= name "gnat-stub-cargs")
- (setf (gnat-compiler-gnat-stub-cargs compiler) value))
-
- ((string= name "gnat-stub-opts")
- (setf (gnat-compiler-gnat-stub-opts compiler) value))
-
- ((string= name "gpr_file")
- ;; The gpr file is parsed in `wisi-compiler-parse-final', so it
- ;; sees all file environment vars. We store the absolute gpr
- ;; file name, so we can get the correct default-directory from
- ;; it. Note that gprbuild requires the base name be found on
- ;; GPR_PROJECT_PATH.
- (let ((process-environment
- (append
- (wisi-prj-compile-env project)
- (wisi-prj-file-env project))));; reference, for
substitute-in-file-name
- (setf (gnat-compiler-gpr-file compiler)
- (or
- (locate-file (substitute-in-file-name value)
- (gnat-compiler-project-path compiler))
- (expand-file-name (substitute-in-file-name value)))))
- t)
-
- ((string= name "runtime")
- (setf (gnat-compiler-runtime compiler) value))
-
- ((string= name "target")
- (setf (gnat-compiler-target compiler) value))
-
- ))
-
-(cl-defmethod wisi-compiler-parse-final ((compiler gnat-compiler) project
prj-file-name)
- (setf (gnat-compiler-run-buffer-name compiler) (gnat-run-buffer-name
prj-file-name))
-
- (if (gnat-compiler-gpr-file compiler)
- (gnat-parse-gpr (gnat-compiler-gpr-file compiler) project compiler)
-
- ;; add the compiler libraries to project.source-path
- (gnat-get-paths project compiler)
- ))
-
-(cl-defmethod wisi-compiler-select-prj ((_compiler gnat-compiler) _project)
- (add-to-list 'completion-ignored-extensions ".ali") ;; gnat library files
- (setq compilation-error-regexp-alist '(gnat))
- )
-
-(cl-defmethod wisi-compiler-deselect-prj ((_compiler gnat-compiler) _project)
- (setq completion-ignored-extensions (delete ".ali"
completion-ignored-extensions))
- (setq compilation-error-regexp-alist (mapcar #'car
compilation-error-regexp-alist-alist))
- )
-
-(cl-defmethod wisi-compiler-show-prj-path ((compiler gnat-compiler))
- (if (gnat-compiler-project-path compiler)
- (progn
- (pop-to-buffer (get-buffer-create "*project file search path*"))
- (erase-buffer)
- (dolist (file (gnat-compiler-project-path compiler))
- (insert (format "%s\n" file))))
- (message "no project file search path set")
- ))
-
-;;;; gnatprep utils
-
-(defun gnatprep-indent ()
- "If point is on a gnatprep keyword, return indentation column
-for it. Otherwise return nil. Intended to be added to
-`wisi-indent-calculate-functions' or other indentation function
-list."
- ;; gnatprep keywords are:
- ;;
- ;; #if identifier [then]
- ;; #elsif identifier [then]
- ;; #else
- ;; #end if;
- ;;
- ;; they are all indented at column 0.
- (when (equal (char-after) ?\#) 0))
-
-(defun gnatprep-syntax-propertize (start end)
- (goto-char start)
- (save-match-data
- (while (re-search-forward
- "^[ \t]*\\(#\\(?:if\\|else\\|elsif\\|end\\)\\)"; gnatprep keywords.
- end t)
- (cond
- ((match-beginning 1)
- (put-text-property
- (match-beginning 1) (match-end 1) 'syntax-table '(11 . ?\n)))
- )
- )))
-
-(defconst gnatprep-preprocessor-keywords
- (list (list "^[ \t]*\\(#.*\n\\)" '(1 font-lock-preprocessor-face t))))
-
-;; We assume that if this file is loaded, any ada-mode buffer may have
-;; gnatprep syntax; even with different host/target compilers, both
-;; must run gnatprep first. If support for another preprocessor is
-;; added, we'll need wisi-prj-preprocessor, along with -compiler and
-;; -xref.
-(defun gnatprep-setup ()
- (add-to-list 'wisi-indent-calculate-functions 'gnatprep-indent)
- (add-hook 'ada-syntax-propertize-hook #'gnatprep-syntax-propertize)
- (font-lock-add-keywords 'ada-mode gnatprep-preprocessor-keywords)
- ;; ada-mode calls font-lock-refresh-defaults after ada-mode-hook
- )
-
-(add-hook 'ada-mode-hook #'gnatprep-setup)
-
-;;;; Initialization
-
-;; These are shared between ada-compiler-gnat and gpr-query.
-(add-to-list 'wisi-prj-file-extensions "gpr")
-(add-to-list 'wisi-prj-parser-alist '("gpr" . gnat-parse-gpr-1))
-
-(add-to-list
- 'compilation-error-regexp-alist-alist
- '(gnat
- ;; typical:
- ;; cards_package.adb:45:32: expected private type "System.Address"
- ;;
- ;; with full path Source_Reference pragma :
- ;; d:/maphds/version_x/1773/sbs-abi-dll_lib.ads.gp:39:06: file
"interfaces_c.ads" not found
- ;;
- ;; gnu cc1: (gnatmake can invoke the C compiler)
- ;; foo.c:2: `TRUE' undeclared here (not in a function)
- ;; foo.c:2 : `TRUE' undeclared here (not in a function)
- ;;
- ;; we can't handle secondary errors here, because a regexp can't
distinquish "message" from "filename"
- "^\\(\\(.:\\)?[^ :\n]+\\):\\([0-9]+\\)\\s-?:?\\([0-9]+\\)?" 1 3 4))
-
-(provide 'gnat-core)
-;; end of file
diff --git a/gpr-mode.el b/gpr-mode.el
index 1ee03ee8f6..a544fa2239 100644
--- a/gpr-mode.el
+++ b/gpr-mode.el
@@ -312,6 +312,8 @@ Otherwise, allow UPPERCASE for identifiers."
(cond
((string= "project" (downcase (buffer-substring-no-properties start
end)))
(cond
+ ((null (char-after end)) ;; at eob
+ nil)
((= (char-after end) ?') ;; attribute Project'
t)
((= (char-after end) ? ) ;; keyword project GDS
diff --git a/gpr-mode.info b/gpr-mode.info
deleted file mode 100644
index 73dc37fb31..0000000000
--- a/gpr-mode.info
+++ /dev/null
@@ -1,737 +0,0 @@
-This is gpr-mode.info, produced by makeinfo version 6.7 from
-gpr-mode.texi.
-
-Copyright (C) 2013, 2019 Free Software Foundation, Inc.
-
- Permission is granted to copy, distribute and/or modify this
- document under the terms of the GNU Free Documentation License,
- Version 1.3 or any later version published by the Free Software
- Foundation; with no Invariant Sections, with the Front-Cover texts
- being "A GNU Manual", and with the Back-Cover Texts as in (a)
- below. A copy of the license is included in the section entitled
- "GNU Free Documentation License".
-
- (a) The FSF's Back-Cover Text is: "You have the freedom to copy and
- modify this GNU manual. Buying copies from the FSF supports it in
- developing GNU and promoting software freedom."
-INFO-DIR-SECTION Emacs
-START-INFO-DIR-ENTRY
-* gpr mode: (gpr-mode). Emacs mode for editing and navigating gpr
files (gnat project files).
-END-INFO-DIR-ENTRY
-
-
-File: gpr-mode.info, Node: Top, Next: Overview, Prev: (dir), Up: (dir)
-
-* Menu:
-
-* Overview::
-* Installation::
-* Customization::
-* Moving Through Gpr Code::
-* Identifier completion::
-* Indentation::
-* Statement skeletons::
-* GNU Free Documentation License::
-* Index::
-
-
-File: gpr-mode.info, Node: Overview, Next: Installation, Prev: Top, Up: Top
-
-1 Overview
-**********
-
-gpr files are the project files used by the GNAT compiler and associated
-tools. They describe search paths, compiler options, etc.
-
- *Note GNAT Project Manager: (gnat_ugn)GNAT Project Manager, for
-general information on gpr files.
-
- The Emacs mode for gpr files helps the user in reading existing code
-and facilitates writing new code.
-
- When you open a file with a file extension of '.gpr', Emacs will
-automatically load and activate gpr mode.
-
-
-File: gpr-mode.info, Node: Installation, Next: Customization, Prev:
Overview, Up: Top
-
-2 Installation
-**************
-
-gpr mode is distributed in the Gnu ELPA package archive, bundled with
-Ada mode; it can be installed via 'M-x list-packages' (*note
-(emacs)Packages::).
-
- gpr mode does not have a separate version; it uses the Ada mode
-version number. To see what version of Ada mode you have installed, do
-'M-x ada-mode-version'.
-
-
-File: gpr-mode.info, Node: Customization, Next: Moving Through Gpr Code,
Prev: Installation, Up: Top
-
-3 Customization
-***************
-
-Indentation variables for gpr mode can be set via the menu 'gpr |
-Customize' from a gpr mode buffer. Click on the 'Help' button there for
-help on using customize. *Note Indentation::.
-
- To modify a specific variable, you can directly call the function
-'customize-variable'; just type 'M-x customize-variable <RET>
-VARIABLE-NAME <RET>').
-
- Alternately, you can specify variable settings in the Emacs
-configuration file, '~/.emacs'. This file is coded in Emacs lisp, and
-the syntax to set a variable is the following:
- (setq variable-name value)
-
- Some general Emacs settings that are useful for gpr files:
-'delete-trailing-whitespace'
- Deletes space, tab at end of line and blank lines at end of buffer.
-'untabify'
- Deletes tab characters that have crept into the file.
-'indent-tabs-mode'
- Don't insert tab characters when indenting.
-'hippie-expand'
- Bind 'hippie-expand' to a key; it expands the word before point,
- using words from current buffer, other buffers, file names, etc;
- see 'hippie-expand-try-functions-list'. You can also add
- 'wisi-skel-hippie-try' to that list (*note Statement skeletons::).
-
- The above can all be set by the following code in your '~/.emacs'.
-Note that some are functions are added to 'before-save-hook'; they run
-just before a buffer is written to disk.
- (setq-default indent-tabs-mode nil)
- (require 'gpr-mode)
- (add-to-list 'hippie-expand-try-functions-list 'wisi-skel-hippie-try)
- (define-key gpr-mode-map "\C-e" 'hippie-expand)
- (add-hook 'gpr-mode-hook
- (lambda ()
- (add-hook 'before-save-hook 'delete-trailing-whitespace nil t)
- (add-hook 'before-save-hook
- (lambda () (untabify (point-min) (point-max)))
- nil t)))
-
-
-File: gpr-mode.info, Node: Moving Through Gpr Code, Next: Identifier
completion, Prev: Customization, Up: Top
-
-4 Moving Through Gpr Code
-*************************
-
-These commands navigate through gpr code. All these functions are
-available through the gpr menu and keybindings.
-
-'C-c C-o'
- If point is on a 'with' clause, position point on the corresponding
- package declaration.
-
-'C-u SPACE'
- Jump back to the previous location.
-
-'C-M-f'
- Move to the end of the current declaration.
-
-'C-M-b'
- Move to the start of the current declaration.
-
-
-File: gpr-mode.info, Node: Identifier completion, Next: Indentation, Prev:
Moving Through Gpr Code, Up: Top
-
-5 Identifier completion
-***********************
-
-Emacs provides a general way of completing identifiers: 'M-/' (bound to
-'dabbrev-expand'). This is an easy way to type faster: you just have to
-type the first few letters of an identifier, and then loop through all
-the possible completions.
-
- If you have bound 'hippie-expand', that also uses 'dabbrev-expand'.
-
- 'M-/' works by parsing all open gpr files for possible completions.
-
- For instance, if the words 'my_identifier' and 'my_subprogram' are
-the only words starting with 'my' in any of the open gpr files, then you
-will have this scenario:
-
- You type: myM-/
- Emacs inserts: 'my_identifier'
- If you press M-/ once again, Emacs replaces 'my_identifier' with
- 'my_subprogram'.
- Pressing M-/ once more will bring you back to 'my_identifier'.
-
- This is a very fast way to do completion, and the casing of words
-will also be respected.
-
-
-File: gpr-mode.info, Node: Indentation, Next: Statement skeletons, Prev:
Identifier completion, Up: Top
-
-6 Indentation
-*************
-
-gpr mode comes with a full set of rules for automatic indentation. You
-can also configure the indentation, via the following variables:
-
-'gpr-indent' (default value: 3)
- Number of columns for default indentation.
-
-'gpr-indent-broken' (default value: 2)
- Number of columns to indent the continuation of a broken line.
-
-'gpr-indent-when' (default value: 3)
- Indentation for 'when' relative to 'case'.
-
- The following keys indent portions of the text:
-
-'RET'
- Insert and indent a new line.
-
-'TAB'
- Indent the current line, or the current region.
-
-'C-c TAB'
- Indent the current declaration.
-
- The indentation algorithm relies on an error-correcting grammar
-parser to identify the syntactic role for keywords and other words in
-the code.
-
-
-File: gpr-mode.info, Node: Statement skeletons, Next: GNU Free Documentation
License, Prev: Indentation, Up: Top
-
-7 Statement skeletons
-*********************
-
-'C-c C-e' expands the previous one or two words into a statment
-skeleton. For example, 'c a s e C-c C-e' expands to:
-
- case is
- when =>
- end case;
-
- For named packages, the name is taken from the word before point, and
-the package keyword from the word before that:
-
- package A_Package
-
- expands to:
-
- package A_Package is
- end A_Package;
-
- Some expansions prompt for more information, such as a choice of
-license.
-
-
-File: gpr-mode.info, Node: GNU Free Documentation License, Next: Index,
Prev: Statement skeletons, Up: Top
-
-Appendix A GNU Free Documentation License
-*****************************************
-
- Version 1.3, 3 November 2008
-
- Copyright (C) 2000, 2001, 2002, 2007, 2008, 2009 Free Software
Foundation, Inc.
- <http://fsf.org/>
-
- Everyone is permitted to copy and distribute verbatim copies
- of this license document, but changing it is not allowed.
-
- 0. PREAMBLE
-
- The purpose of this License is to make a manual, textbook, or other
- functional and useful document "free" in the sense of freedom: to
- assure everyone the effective freedom to copy and redistribute it,
- with or without modifying it, either commercially or
- noncommercially. Secondarily, this License preserves for the
- author and publisher a way to get credit for their work, while not
- being considered responsible for modifications made by others.
-
- This License is a kind of "copyleft", which means that derivative
- works of the document must themselves be free in the same sense.
- It complements the GNU General Public License, which is a copyleft
- license designed for free software.
-
- We have designed this License in order to use it for manuals for
- free software, because free software needs free documentation: a
- free program should come with manuals providing the same freedoms
- that the software does. But this License is not limited to
- software manuals; it can be used for any textual work, regardless
- of subject matter or whether it is published as a printed book. We
- recommend this License principally for works whose purpose is
- instruction or reference.
-
- 1. APPLICABILITY AND DEFINITIONS
-
- This License applies to any manual or other work, in any medium,
- that contains a notice placed by the copyright holder saying it can
- be distributed under the terms of this License. Such a notice
- grants a world-wide, royalty-free license, unlimited in duration,
- to use that work under the conditions stated herein. The
- "Document", below, refers to any such manual or work. Any member
- of the public is a licensee, and is addressed as "you". You accept
- the license if you copy, modify or distribute the work in a way
- requiring permission under copyright law.
-
- A "Modified Version" of the Document means any work containing the
- Document or a portion of it, either copied verbatim, or with
- modifications and/or translated into another language.
-
- A "Secondary Section" is a named appendix or a front-matter section
- of the Document that deals exclusively with the relationship of the
- publishers or authors of the Document to the Document's overall
- subject (or to related matters) and contains nothing that could
- fall directly within that overall subject. (Thus, if the Document
- is in part a textbook of mathematics, a Secondary Section may not
- explain any mathematics.) The relationship could be a matter of
- historical connection with the subject or with related matters, or
- of legal, commercial, philosophical, ethical or political position
- regarding them.
-
- The "Invariant Sections" are certain Secondary Sections whose
- titles are designated, as being those of Invariant Sections, in the
- notice that says that the Document is released under this License.
- If a section does not fit the above definition of Secondary then it
- is not allowed to be designated as Invariant. The Document may
- contain zero Invariant Sections. If the Document does not identify
- any Invariant Sections then there are none.
-
- The "Cover Texts" are certain short passages of text that are
- listed, as Front-Cover Texts or Back-Cover Texts, in the notice
- that says that the Document is released under this License. A
- Front-Cover Text may be at most 5 words, and a Back-Cover Text may
- be at most 25 words.
-
- A "Transparent" copy of the Document means a machine-readable copy,
- represented in a format whose specification is available to the
- general public, that is suitable for revising the document
- straightforwardly with generic text editors or (for images composed
- of pixels) generic paint programs or (for drawings) some widely
- available drawing editor, and that is suitable for input to text
- formatters or for automatic translation to a variety of formats
- suitable for input to text formatters. A copy made in an otherwise
- Transparent file format whose markup, or absence of markup, has
- been arranged to thwart or discourage subsequent modification by
- readers is not Transparent. An image format is not Transparent if
- used for any substantial amount of text. A copy that is not
- "Transparent" is called "Opaque".
-
- Examples of suitable formats for Transparent copies include plain
- ASCII without markup, Texinfo input format, LaTeX input format,
- SGML or XML using a publicly available DTD, and standard-conforming
- simple HTML, PostScript or PDF designed for human modification.
- Examples of transparent image formats include PNG, XCF and JPG.
- Opaque formats include proprietary formats that can be read and
- edited only by proprietary word processors, SGML or XML for which
- the DTD and/or processing tools are not generally available, and
- the machine-generated HTML, PostScript or PDF produced by some word
- processors for output purposes only.
-
- The "Title Page" means, for a printed book, the title page itself,
- plus such following pages as are needed to hold, legibly, the
- material this License requires to appear in the title page. For
- works in formats which do not have any title page as such, "Title
- Page" means the text near the most prominent appearance of the
- work's title, preceding the beginning of the body of the text.
-
- The "publisher" means any person or entity that distributes copies
- of the Document to the public.
-
- A section "Entitled XYZ" means a named subunit of the Document
- whose title either is precisely XYZ or contains XYZ in parentheses
- following text that translates XYZ in another language. (Here XYZ
- stands for a specific section name mentioned below, such as
- "Acknowledgements", "Dedications", "Endorsements", or "History".)
- To "Preserve the Title" of such a section when you modify the
- Document means that it remains a section "Entitled XYZ" according
- to this definition.
-
- The Document may include Warranty Disclaimers next to the notice
- which states that this License applies to the Document. These
- Warranty Disclaimers are considered to be included by reference in
- this License, but only as regards disclaiming warranties: any other
- implication that these Warranty Disclaimers may have is void and
- has no effect on the meaning of this License.
-
- 2. VERBATIM COPYING
-
- You may copy and distribute the Document in any medium, either
- commercially or noncommercially, provided that this License, the
- copyright notices, and the license notice saying this License
- applies to the Document are reproduced in all copies, and that you
- add no other conditions whatsoever to those of this License. You
- may not use technical measures to obstruct or control the reading
- or further copying of the copies you make or distribute. However,
- you may accept compensation in exchange for copies. If you
- distribute a large enough number of copies you must also follow the
- conditions in section 3.
-
- You may also lend copies, under the same conditions stated above,
- and you may publicly display copies.
-
- 3. COPYING IN QUANTITY
-
- If you publish printed copies (or copies in media that commonly
- have printed covers) of the Document, numbering more than 100, and
- the Document's license notice requires Cover Texts, you must
- enclose the copies in covers that carry, clearly and legibly, all
- these Cover Texts: Front-Cover Texts on the front cover, and
- Back-Cover Texts on the back cover. Both covers must also clearly
- and legibly identify you as the publisher of these copies. The
- front cover must present the full title with all words of the title
- equally prominent and visible. You may add other material on the
- covers in addition. Copying with changes limited to the covers, as
- long as they preserve the title of the Document and satisfy these
- conditions, can be treated as verbatim copying in other respects.
-
- If the required texts for either cover are too voluminous to fit
- legibly, you should put the first ones listed (as many as fit
- reasonably) on the actual cover, and continue the rest onto
- adjacent pages.
-
- If you publish or distribute Opaque copies of the Document
- numbering more than 100, you must either include a machine-readable
- Transparent copy along with each Opaque copy, or state in or with
- each Opaque copy a computer-network location from which the general
- network-using public has access to download using public-standard
- network protocols a complete Transparent copy of the Document, free
- of added material. If you use the latter option, you must take
- reasonably prudent steps, when you begin distribution of Opaque
- copies in quantity, to ensure that this Transparent copy will
- remain thus accessible at the stated location until at least one
- year after the last time you distribute an Opaque copy (directly or
- through your agents or retailers) of that edition to the public.
-
- It is requested, but not required, that you contact the authors of
- the Document well before redistributing any large number of copies,
- to give them a chance to provide you with an updated version of the
- Document.
-
- 4. MODIFICATIONS
-
- You may copy and distribute a Modified Version of the Document
- under the conditions of sections 2 and 3 above, provided that you
- release the Modified Version under precisely this License, with the
- Modified Version filling the role of the Document, thus licensing
- distribution and modification of the Modified Version to whoever
- possesses a copy of it. In addition, you must do these things in
- the Modified Version:
-
- A. Use in the Title Page (and on the covers, if any) a title
- distinct from that of the Document, and from those of previous
- versions (which should, if there were any, be listed in the
- History section of the Document). You may use the same title
- as a previous version if the original publisher of that
- version gives permission.
-
- B. List on the Title Page, as authors, one or more persons or
- entities responsible for authorship of the modifications in
- the Modified Version, together with at least five of the
- principal authors of the Document (all of its principal
- authors, if it has fewer than five), unless they release you
- from this requirement.
-
- C. State on the Title page the name of the publisher of the
- Modified Version, as the publisher.
-
- D. Preserve all the copyright notices of the Document.
-
- E. Add an appropriate copyright notice for your modifications
- adjacent to the other copyright notices.
-
- F. Include, immediately after the copyright notices, a license
- notice giving the public permission to use the Modified
- Version under the terms of this License, in the form shown in
- the Addendum below.
-
- G. Preserve in that license notice the full lists of Invariant
- Sections and required Cover Texts given in the Document's
- license notice.
-
- H. Include an unaltered copy of this License.
-
- I. Preserve the section Entitled "History", Preserve its Title,
- and add to it an item stating at least the title, year, new
- authors, and publisher of the Modified Version as given on the
- Title Page. If there is no section Entitled "History" in the
- Document, create one stating the title, year, authors, and
- publisher of the Document as given on its Title Page, then add
- an item describing the Modified Version as stated in the
- previous sentence.
-
- J. Preserve the network location, if any, given in the Document
- for public access to a Transparent copy of the Document, and
- likewise the network locations given in the Document for
- previous versions it was based on. These may be placed in the
- "History" section. You may omit a network location for a work
- that was published at least four years before the Document
- itself, or if the original publisher of the version it refers
- to gives permission.
-
- K. For any section Entitled "Acknowledgements" or "Dedications",
- Preserve the Title of the section, and preserve in the section
- all the substance and tone of each of the contributor
- acknowledgements and/or dedications given therein.
-
- L. Preserve all the Invariant Sections of the Document, unaltered
- in their text and in their titles. Section numbers or the
- equivalent are not considered part of the section titles.
-
- M. Delete any section Entitled "Endorsements". Such a section
- may not be included in the Modified Version.
-
- N. Do not retitle any existing section to be Entitled
- "Endorsements" or to conflict in title with any Invariant
- Section.
-
- O. Preserve any Warranty Disclaimers.
-
- If the Modified Version includes new front-matter sections or
- appendices that qualify as Secondary Sections and contain no
- material copied from the Document, you may at your option designate
- some or all of these sections as invariant. To do this, add their
- titles to the list of Invariant Sections in the Modified Version's
- license notice. These titles must be distinct from any other
- section titles.
-
- You may add a section Entitled "Endorsements", provided it contains
- nothing but endorsements of your Modified Version by various
- parties--for example, statements of peer review or that the text
- has been approved by an organization as the authoritative
- definition of a standard.
-
- You may add a passage of up to five words as a Front-Cover Text,
- and a passage of up to 25 words as a Back-Cover Text, to the end of
- the list of Cover Texts in the Modified Version. Only one passage
- of Front-Cover Text and one of Back-Cover Text may be added by (or
- through arrangements made by) any one entity. If the Document
- already includes a cover text for the same cover, previously added
- by you or by arrangement made by the same entity you are acting on
- behalf of, you may not add another; but you may replace the old
- one, on explicit permission from the previous publisher that added
- the old one.
-
- The author(s) and publisher(s) of the Document do not by this
- License give permission to use their names for publicity for or to
- assert or imply endorsement of any Modified Version.
-
- 5. COMBINING DOCUMENTS
-
- You may combine the Document with other documents released under
- this License, under the terms defined in section 4 above for
- modified versions, provided that you include in the combination all
- of the Invariant Sections of all of the original documents,
- unmodified, and list them all as Invariant Sections of your
- combined work in its license notice, and that you preserve all
- their Warranty Disclaimers.
-
- The combined work need only contain one copy of this License, and
- multiple identical Invariant Sections may be replaced with a single
- copy. If there are multiple Invariant Sections with the same name
- but different contents, make the title of each such section unique
- by adding at the end of it, in parentheses, the name of the
- original author or publisher of that section if known, or else a
- unique number. Make the same adjustment to the section titles in
- the list of Invariant Sections in the license notice of the
- combined work.
-
- In the combination, you must combine any sections Entitled
- "History" in the various original documents, forming one section
- Entitled "History"; likewise combine any sections Entitled
- "Acknowledgements", and any sections Entitled "Dedications". You
- must delete all sections Entitled "Endorsements."
-
- 6. COLLECTIONS OF DOCUMENTS
-
- You may make a collection consisting of the Document and other
- documents released under this License, and replace the individual
- copies of this License in the various documents with a single copy
- that is included in the collection, provided that you follow the
- rules of this License for verbatim copying of each of the documents
- in all other respects.
-
- You may extract a single document from such a collection, and
- distribute it individually under this License, provided you insert
- a copy of this License into the extracted document, and follow this
- License in all other respects regarding verbatim copying of that
- document.
-
- 7. AGGREGATION WITH INDEPENDENT WORKS
-
- A compilation of the Document or its derivatives with other
- separate and independent documents or works, in or on a volume of a
- storage or distribution medium, is called an "aggregate" if the
- copyright resulting from the compilation is not used to limit the
- legal rights of the compilation's users beyond what the individual
- works permit. When the Document is included in an aggregate, this
- License does not apply to the other works in the aggregate which
- are not themselves derivative works of the Document.
-
- If the Cover Text requirement of section 3 is applicable to these
- copies of the Document, then if the Document is less than one half
- of the entire aggregate, the Document's Cover Texts may be placed
- on covers that bracket the Document within the aggregate, or the
- electronic equivalent of covers if the Document is in electronic
- form. Otherwise they must appear on printed covers that bracket
- the whole aggregate.
-
- 8. TRANSLATION
-
- Translation is considered a kind of modification, so you may
- distribute translations of the Document under the terms of section
- 4. Replacing Invariant Sections with translations requires special
- permission from their copyright holders, but you may include
- translations of some or all Invariant Sections in addition to the
- original versions of these Invariant Sections. You may include a
- translation of this License, and all the license notices in the
- Document, and any Warranty Disclaimers, provided that you also
- include the original English version of this License and the
- original versions of those notices and disclaimers. In case of a
- disagreement between the translation and the original version of
- this License or a notice or disclaimer, the original version will
- prevail.
-
- If a section in the Document is Entitled "Acknowledgements",
- "Dedications", or "History", the requirement (section 4) to
- Preserve its Title (section 1) will typically require changing the
- actual title.
-
- 9. TERMINATION
-
- You may not copy, modify, sublicense, or distribute the Document
- except as expressly provided under this License. Any attempt
- otherwise to copy, modify, sublicense, or distribute it is void,
- and will automatically terminate your rights under this License.
-
- However, if you cease all violation of this License, then your
- license from a particular copyright holder is reinstated (a)
- provisionally, unless and until the copyright holder explicitly and
- finally terminates your license, and (b) permanently, if the
- copyright holder fails to notify you of the violation by some
- reasonable means prior to 60 days after the cessation.
-
- Moreover, your license from a particular copyright holder is
- reinstated permanently if the copyright holder notifies you of the
- violation by some reasonable means, this is the first time you have
- received notice of violation of this License (for any work) from
- that copyright holder, and you cure the violation prior to 30 days
- after your receipt of the notice.
-
- Termination of your rights under this section does not terminate
- the licenses of parties who have received copies or rights from you
- under this License. If your rights have been terminated and not
- permanently reinstated, receipt of a copy of some or all of the
- same material does not give you any rights to use it.
-
- 10. FUTURE REVISIONS OF THIS LICENSE
-
- The Free Software Foundation may publish new, revised versions of
- the GNU Free Documentation License from time to time. Such new
- versions will be similar in spirit to the present version, but may
- differ in detail to address new problems or concerns. See
- <http://www.gnu.org/copyleft/>.
-
- Each version of the License is given a distinguishing version
- number. If the Document specifies that a particular numbered
- version of this License "or any later version" applies to it, you
- have the option of following the terms and conditions either of
- that specified version or of any later version that has been
- published (not as a draft) by the Free Software Foundation. If the
- Document does not specify a version number of this License, you may
- choose any version ever published (not as a draft) by the Free
- Software Foundation. If the Document specifies that a proxy can
- decide which future versions of this License can be used, that
- proxy's public statement of acceptance of a version permanently
- authorizes you to choose that version for the Document.
-
- 11. RELICENSING
-
- "Massive Multiauthor Collaboration Site" (or "MMC Site") means any
- World Wide Web server that publishes copyrightable works and also
- provides prominent facilities for anybody to edit those works. A
- public wiki that anybody can edit is an example of such a server.
- A "Massive Multiauthor Collaboration" (or "MMC") contained in the
- site means any set of copyrightable works thus published on the MMC
- site.
-
- "CC-BY-SA" means the Creative Commons Attribution-Share Alike 3.0
- license published by Creative Commons Corporation, a not-for-profit
- corporation with a principal place of business in San Francisco,
- California, as well as future copyleft versions of that license
- published by that same organization.
-
- "Incorporate" means to publish or republish a Document, in whole or
- in part, as part of another Document.
-
- An MMC is "eligible for relicensing" if it is licensed under this
- License, and if all works that were first published under this
- License somewhere other than this MMC, and subsequently
- incorporated in whole or in part into the MMC, (1) had no cover
- texts or invariant sections, and (2) were thus incorporated prior
- to November 1, 2008.
-
- The operator of an MMC Site may republish an MMC contained in the
- site under CC-BY-SA on the same site at any time before August 1,
- 2009, provided the MMC is eligible for relicensing.
-
-ADDENDUM: How to use this License for your documents
-====================================================
-
-To use this License in a document you have written, include a copy of
-the License in the document and put the following copyright and license
-notices just after the title page:
-
- Copyright (C) YEAR YOUR NAME.
- Permission is granted to copy, distribute and/or modify this document
- under the terms of the GNU Free Documentation License, Version 1.3
- or any later version published by the Free Software Foundation;
- with no Invariant Sections, no Front-Cover Texts, and no Back-Cover
- Texts. A copy of the license is included in the section entitled ``GNU
- Free Documentation License''.
-
- If you have Invariant Sections, Front-Cover Texts and Back-Cover
-Texts, replace the "with...Texts." line with this:
-
- with the Invariant Sections being LIST THEIR TITLES, with
- the Front-Cover Texts being LIST, and with the Back-Cover Texts
- being LIST.
-
- If you have Invariant Sections without Cover Texts, or some other
-combination of the three, merge those two alternatives to suit the
-situation.
-
- If your document contains nontrivial examples of program code, we
-recommend releasing these examples in parallel under your choice of free
-software license, such as the GNU General Public License, to permit
-their use in free software.
-
-
-File: gpr-mode.info, Node: Index, Prev: GNU Free Documentation License, Up:
Top
-
-Index
-*****
-
- [index ]
-* Menu:
-
-* ff-find-other-file: Moving Through Gpr Code.
- (line 10)
-
-
-
-Tag Table:
-Node: Top952
-Node: Overview1227
-Node: Installation1786
-Node: Customization2226
-Node: Moving Through Gpr Code4151
-Node: Identifier completion4719
-Node: Indentation5753
-Node: Statement skeletons6656
-Node: GNU Free Documentation License7269
-Node: Index32431
-
-End Tag Table
-
-
-Local Variables:
-coding: utf-8
-End:
diff --git a/gpr-process.el b/gpr-process.el
index aa9db63efc..59e611b917 100644
--- a/gpr-process.el
+++ b/gpr-process.el
@@ -1,7 +1,7 @@
-;;; gpr-process.el --- Generated parser support file -*- lexical-binding:t -*-
+;;; gpr-process.el --- Generated parser support file -*- buffer-read-only:t
lexical-binding:t -*-
;; command line: wisitoken-bnf-generate.exe --generate LR1 Ada_Emacs re2c
PROCESS gpr.wy
-;; Copyright (C) 2013 - 2020 Free Software Foundation, Inc.
+;; Copyright (C) 2013 - 2022 Free Software Foundation, Inc.
;; This program is free software; you can redistribute it and/or
;; modify it under the terms of the GNU General Public License as
@@ -22,6 +22,8 @@
[WHITESPACE
NEW_LINE
COMMENT
+ GNAT_PREP
+ PLACEHOLDER
ABSTRACT
AT
AGGREGATE
@@ -93,6 +95,7 @@
term
typed_string_declaration
with_clause
+ Wisi_SOI
])
(defconst gpr-process-face-table
diff --git a/gpr-query.el b/gpr-query.el
index c6dbad49fa..9ffc218958 100644
--- a/gpr-query.el
+++ b/gpr-query.el
@@ -41,6 +41,19 @@
"Executable for gpr_query."
:type 'string)
+(defcustom gpr-query-no-symbols nil
+ "If non-nil, don't get symbol completion table from gpr-query.
+Reading all the symbols can be slow in a very large project."
+ :type 'boolean)
+
+(defcustom gpr-query-exec-opts '()
+ "Options for `gpr-query-exec'; a list of strings.
+\"--project\" is specified automatically. This can be used to
+override the database location by specifying
+\"--db=<writeable_file>\". See \"gpr_query --help\" for more
+options."
+ :type 'list)
+
(defcustom gpr-query-env nil
"Environment variables needed by the gpr_query executable.
Value must be a list where each element is \"<name>=<value>\""
@@ -67,13 +80,13 @@ Must match gpr_query.adb Version.")
gpr-file ;; string absolute file name
process-env ;; copy of process-environment used to start a process
(xref-process nil) ;; running gpr_query, for xrefs; default-directory gives
location of db
+ no-symbols ;; boolean; if non-nil, don't start symbols process
(symbols-process nil);; runs 'complete' gpr_query command to get
symbol-locs, symbols; then dies.
- symbol-locs ;; alist completion table, with locations; see
gpr-query--read-symbols
- symbols ;; just symbols compeltion table; see gpr-query--read-symbols
+ symbol-locs ;; alist completion table, with locations; see
gpr-query--symbols-filter
+ symbols ;; symbols completion table.
+ symbols-valid ;; t when symbols valid
symbols-count-total
- symbols-count-current
- symbols-percent-last-update
)
;; Starting the buffer name with a space hides it from some lists, and
@@ -85,7 +98,8 @@ Must match gpr_query.adb Version.")
;; gpr_query output ends with this
"Regexp matching gpr_query prompt; indicates previous command is complete.")
-(defvar gpr-query--debug nil)
+(defvar gpr-query--debug nil
+ "When non-nil, dispay debug messages.")
(defvar-local gpr-query--local-session nil
"Buffer-local in gpr-query process buffer; the current session.")
@@ -137,35 +151,31 @@ Must match gpr_query.adb Version.")
(gpr-query--check-startup)
(set-process-filter process nil)
- ;; start the symbols process to get the symbols
- (gpr-query--start-process gpr-query--local-session 'symbols)
+ (unless (gpr-query--session-no-symbols gpr-query--local-session)
+ ;; start the symbols process to get the symbols
+ (gpr-query--start-process gpr-query--local-session 'symbols))
)))))
(defvar gpr-query--symbols-progress ""
;; We assume only one gpr-query symbols process is active at a time
- "For `mode-line-misc-info'.")
+ "For progress messages while waiting for symbols.")
+
+(defconst gpr-query--symbol-char "[-+*/=<>&[:alnum:]_.]")
+
+(defconst gpr-query-completion-regexp
+ (concat "\\(" gpr-query--symbol-char "+\\)\\((.*)\\)?<.*<[0-9]+>>")
+ "Regexp matching completion item from gpr-query--read-symbols.")
(defun gpr-query--update-progress ()
- ;; separate for debugging
- (setf (gpr-query--session-symbols-count-current gpr-query--local-session)
- (+ (gpr-query--session-symbols-count-current gpr-query--local-session)
- (count-lines (point) (point-max))))
- (let ((percent
- (/
- (* 100 (gpr-query--session-symbols-count-current
gpr-query--local-session))
- (gpr-query--session-symbols-count-total
gpr-query--local-session))))
- (when (< (+ 5 (gpr-query--session-symbols-percent-last-update
gpr-query--local-session))
- percent)
- (setf (gpr-query--session-symbols-percent-last-update
gpr-query--local-session) percent)
- (setq gpr-query--symbols-progress (format "symbols %d%%" percent))
- (force-mode-line-update)
- (redisplay t)
- )))
+ ;; separate for debugging; update gpr-query--symbols-progress
+ (let* ((count (line-number-at-pos (point)))
+ (percent (/ (* 100 count) (gpr-query--session-symbols-count-total
gpr-query--local-session))))
+ (setq gpr-query--symbols-progress (format "%d%%" percent))
+ ))
(defun gpr-query--symbols-filter (process text)
"Process filter for symbols process."
- (when (buffer-name (process-buffer process))
- ;; process buffer is not dead
+ (when (buffer-live-p (process-buffer process))
(with-current-buffer (process-buffer process)
(let ((search-start (marker-position (process-mark process))))
(save-excursion
@@ -173,24 +183,71 @@ Must match gpr_query.adb Version.")
(insert text)
(set-marker (process-mark process) (point)))
- ;; Update session progress slots
- (when (eq (gpr-query--session-symbols gpr-query--local-session)
'sent-complete)
- (cond
- ((null (gpr-query--session-symbols-count-total
gpr-query--local-session))
- (goto-char search-start)
- ;; back up a line in case we got part of the line previously.
- (forward-line -1)
-
- (when (re-search-forward "element count \\([0-9]+\\)" (point-max) t)
- (setf (gpr-query--session-symbols-count-total
gpr-query--local-session)
- (string-to-number (match-string 1)))
- (setf (gpr-query--session-symbols-count-current
gpr-query--local-session) 0)
- (setf (gpr-query--session-symbols-percent-last-update
gpr-query--local-session) 0)
- ))
- (t
- (gpr-query--update-progress)
- )
- ))
+ ;; Update session progress slots, accumulate symbols
+ (cond
+ ((null (gpr-query--session-symbols-count-total
gpr-query--local-session))
+ (goto-char search-start)
+ ;; back up a line in case we got part of the line previously.
+ (forward-line -1)
+
+ (when (re-search-forward "element count \\([0-9]+\\)" (point-max) t)
+ (setf (gpr-query--session-symbols-count-total
gpr-query--local-session)
+ (string-to-number (match-string 1)))
+ (when gpr-query--debug
+ (message "gpr-query symbols: total count received %d"
+ (gpr-query--session-symbols-count-total
gpr-query--local-session)))
+ ))
+ (t
+ (goto-char search-start)
+ ;; back up a line in case we got part of the line previously.
+ (forward-line -1)
+ ;; The gpr_query 'complete' command returns a fully qualified name
+ ;; and declaration location for each name:
+ ;;
+ ;; Wisi.Ada.Ada_Indent_Aggregate.Args
C:\Projects\org.emacs.ada-mode\wisi-ada.ads:102:7
+ ;;
+ ;; For subprograms it includes the parameters (but not a function
result):
+ ;;
+ ;; Gpr_Query.Process_Command_Single(Args)
C:\Projects\org.emacs.ada-mode\gpr_query.adb:109:14
+ ;;
+ ;; Build a completion table as an alist of:
+ ;;
+ ;; (simple_name(args)<prefix<line>> . location).
+ ;;
+ ;; The car matches wisi-xref-completion-regexp.
+ ;;
+ ;; We include the line number to make each name unique. This
+ ;; doesn't work for one-line parameter lists, variable
+ ;; declaration lists and similar, but they should be
+ ;; unique names anyway.
+ (while (not (eobp))
+ (cond
+ ;; We don't use gpr-query-completion-regexp here because we need
finer groups.
+ ((looking-at (concat "\\(" gpr-query--symbol-char "+\\)" ;; 1:
prefix
+ "\\.\\(" gpr-query--symbol-char "+\\)" ;; 2:
simple name
+ "\\((.*)\\)? " ;; 3:
args,
+ wisi-file-line-col-regexp)) ;; 4,
5, 6 file:line:col
+ ;; Process line. `cl-pushnew' would slow down the
+ ;; processing too much; it noticeably ties up the Emacs
+ ;; foreground process in large projects.
+ (push (match-string-no-properties 2) (gpr-query--session-symbols
gpr-query--local-session))
+ (push
+ (cons (concat (match-string-no-properties 2)
+ (match-string-no-properties 3)
+ "<" (match-string-no-properties 1) "<"
(match-string-no-properties 5) ">>")
+ (list (gpr-query--normalize-filename
(match-string-no-properties 4))
+ (string-to-number (match-string 5))
+ (1- (string-to-number (match-string 6)))))
+ (gpr-query--session-symbol-locs gpr-query--local-session))
+ )
+
+ (t ;; ignore line
+ nil)
+ )
+ (forward-line 1))
+
+ (gpr-query--update-progress)
+ ))
;; Wait for last command to finish.
(goto-char search-start)
@@ -199,15 +256,18 @@ Must match gpr_query.adb Version.")
(cond
((null (gpr-query--session-symbols gpr-query--local-session))
;; startup complete; get symbols
+ (when gpr-query--debug
+ (message "gpr-query symbols: startup complete"))
(gpr-query--check-startup)
(erase-buffer)
(set-marker (process-mark process) (point-min))
(setf (gpr-query--session-symbols-count-total
gpr-query--local-session) nil)
(process-send-string process "complete \"\"\n")
- (setf (gpr-query--session-symbols gpr-query--local-session)
'sent-complete))
+ (setq gpr-query--symbols-progress "0%"))
- ((eq (gpr-query--session-symbols gpr-query--local-session)
'sent-complete)
- (gpr-query--read-symbols gpr-query--local-session)
+ (t
+ ;; All symbols received; done
+ (setf (gpr-query--session-symbols-valid gpr-query--local-session) t)
(set-process-filter process nil)
(process-send-string process "exit\n"))
@@ -245,19 +305,25 @@ Must match gpr_query.adb Version.")
(erase-buffer); delete any previous messages, prompt
(setf (gpr-query--session-symbol-locs session) nil)
(setf (gpr-query--session-symbols session) nil)
- (setq process
- (apply #'start-process
- (buffer-name)
- buffer
- gpr-query-exec
- (cl-delete-if
- 'null
+ (setf (gpr-query--session-symbols-valid session) nil)
+ (let ((args (cl-delete-if
+ 'null
+ (append
(list
(concat "--project=" (file-name-nondirectory gpr-file))
(when gpr-query--debug
"--tracefile=gpr_query.trace"
;; The file gpr_query.trace should contain: gpr_query=yes
- )))))
+ ))
+ gpr-query-exec-opts))))
+ (when gpr-query--debug
+ (message "gpr-query process args: %s" args))
+ (setq process
+ (apply #'start-process
+ (buffer-name)
+ buffer
+ gpr-query-exec
+ args)))
(cl-ecase command-type
(xref
(setf (gpr-query--session-xref-process session) process)
@@ -269,11 +335,13 @@ Must match gpr_query.adb Version.")
(set-process-query-on-exit-flag process nil)
)))
-(defun gpr-query--make-session (project)
- "Create and return a session for the current project file."
+(defun gpr-query--make-session (project no-symbols)
+ "Create and return a session for the current project file.
+If NO-SYMBOLS is non-nil, don't create the symbols process."
(let ((session
(make-gpr-query--session
:gpr-file (gnat-compiler-gpr-file (wisi-prj-xref project))
+ :no-symbols no-symbols
:process-env (copy-sequence
(append
(wisi-prj-compile-env project)
@@ -286,23 +354,26 @@ Must match gpr_query.adb Version.")
(defvar gpr-query--sessions '()
"Assoc list of sessions, indexed by absolute GNAT project file name.")
-(defun gpr-query-cached-session (project)
- "Return a session for PROJECT, creating it if necessary."
+(cl-defun gpr-query-cached-session (project &key no-symbols)
+ "Return a session for PROJECT, creating it if necessary.
+If NO-SYMBOLS is non-nil, don't create the symbols process."
(let* ((gpr-file (gnat-compiler-gpr-file (wisi-prj-xref project)))
(session (cdr (assoc gpr-file gpr-query--sessions))))
(if session
(progn
+ (setf (gpr-query--session-no-symbols session) (or no-symbols
gpr-query-no-symbols))
(unless (process-live-p (gpr-query--session-xref-process session))
(gpr-query--start-process session 'xref))
session)
;; else
(prog1
- (setq session (gpr-query--make-session project))
+ (setq session (gpr-query--make-session project (or no-symbols
gpr-query-no-symbols)))
(push (cons gpr-file session) gpr-query--sessions)))
))
(defun gpr-query-session-wait (session command-type)
- "Wait for the current COMMAND-TYPE (one of 'xref or 'symbols) to complete."
+ "Wait for the current COMMAND-TYPE command to complete.
+COMMAND-TYPE is one of 'xref or 'symbols."
(when (and
(eq command-type 'symbols)
(null (gpr-query--session-symbols-process session)))
@@ -318,41 +389,53 @@ Must match gpr_query.adb Version.")
(done nil)
(wait-count 0))
- (unless (process-live-p process)
+ (when (and (eq command-type 'xref)
+ (not (process-live-p process)))
(gpr-query--show-buffer session command-type)
(error "gpr-query process died"))
- (with-current-buffer (process-buffer process)
- (setq search-start (point-min))
- (when (eq command-type 'symbols)
- ;; show progress in mode line
- (setq gpr-query--symbols-progress "")
- (add-to-list 'mode-line-misc-info '("" gpr-query--symbols-progress " "))
- (force-mode-line-update)
- (redisplay))
-
- (while (and (process-live-p process)
- (not done))
- (message (concat "running gpr_query ..." (make-string wait-count ?.)))
-
- ;; process output is inserted before point, so move back over it to
search it
- (goto-char search-start)
- (if (re-search-forward gpr-query-prompt (point-max) 1)
- (setq done t)
- ;; else wait for more input
- (unless (accept-process-output process 1.0)
- ;; accept-process returns non-nil when we got output, so we
- ;; did not wait for timeout.
- (setq wait-count (1+ wait-count))
- ))
- ))
+ (while (and (process-live-p process)
+ (not done))
+ (cl-ecase command-type
+ (symbols
+ ;; The process filter is reading symbols text in the process
+ ;; buffer; don't move point or otherwise modify the buffer.
+ (cond
+ ((gpr-query--session-symbols-valid session)
+ (setq done t))
+
+ (t
+ (message "gpr-query receiving symbols %s"
gpr-query--symbols-progress))))
+
+ (xref
+ (message (concat "running gpr_query ..." (make-string wait-count ?.)))
+
+ ;; process output is inserted before point, so move back over it to
search it
+ (with-current-buffer (process-buffer process)
+ (setq search-start (point-min))
- (when (eq command-type 'symbols)
- (setq mode-line-misc-info (delete '("" gpr-query--symbols-progress " ")
mode-line-misc-info)))
+ (goto-char search-start)
+ (if (re-search-forward gpr-query-prompt (point-max) 1)
+ (setq done t))))
+ )
+
+ (when (not done);; wait for more input
+ (unless (accept-process-output process 1.0)
+ ;; accept-process returns non-nil when we got output, so we
+ ;; did not wait for timeout.
+ (setq wait-count (1+ wait-count))
+ ))
+ )
(if (or (eq command-type 'symbols);; symbols process is supposed to die
(process-live-p process))
- (message (concat "running gpr_query ... done"))
+ (cl-ecase command-type
+ (symbols
+ (message "gpr-query symbols done; symbols length %d"
+ (length (gpr-query--session-symbols session)))
+ )
+ (xref
+ (message (concat "running gpr_query ... done"))))
(gpr-query--show-buffer session command-type)
(error "gpr_query process died"))
))
@@ -385,14 +468,15 @@ Returns t if the process was live."
t))
(defun gpr-query-kill-session (session)
- "Kill the background process of SESSION.
-Return t if the process was live."
+ "Kill the background processes of SESSION.
+Return t if either process was live."
(setf (gpr-query--session-symbol-locs session) nil)
(setf (gpr-query--session-symbols session) nil)
+ (setf (gpr-query--session-symbols-valid session) nil)
(let (result)
(setq result (gpr-query--kill-process (gpr-query--session-xref-process
session)))
- (setq result (or result
- (gpr-query--kill-process
(gpr-query--session-symbols-process session))))
+ (setq result (or (gpr-query--kill-process
(gpr-query--session-symbols-process session))
+ result))
result))
(defun gpr-query-kill-all-sessions ()
@@ -456,63 +540,6 @@ Uses `gpr_query'. Returns new list."
(concat wisi-file-line-col-regexp " (\\(.*\\))")
"Regexp matching <file>:<line>:<column> (<type>)")
-(defconst gpr-query--symbol-char "[-+*/=<>&[:alnum:]_.]")
-
-(defconst gpr-query-completion-regexp
- (concat "\\(" gpr-query--symbol-char "+\\)\\((.*)\\)?<.*<[0-9]+>>")
- "Regexp matching completion item from gpr-query--read-symbols.")
-
-(defun gpr-query--read-symbols (session)
- "Read result of gpr_query 'complete' command, store completion table in
SESSION."
- (let ((symbol-locs nil)
- (symbols nil))
- ;; The gpr_query 'complete' command returns a fully qualified name
- ;; and declaration location for each name:
- ;;
- ;; Wisi.Ada.Ada_Indent_Aggregate.Args
C:\Projects\org.emacs.ada-mode\wisi-ada.ads:102:7
- ;;
- ;; For subprograms it includes the parameters (but not a function result):
- ;;
- ;; Gpr_Query.Process_Command_Single(Args)
C:\Projects\org.emacs.ada-mode\gpr_query.adb:109:14
- ;;
- ;; Build a completion table as an alist of:
- ;;
- ;; (simple_name(args)<prefix<line>> . location).
- ;;
- ;; The car matches wisi-xref-completion-regexp.
- ;;
- ;; We include the line number to make each name unique. This
- ;; doesn't work for one-line parameter lists, variable
- ;; declaration lists and similar, but they should be
- ;; unique names anyway.
- (goto-char (point-min))
-
- (while (not (eobp))
- (cond
- ;; FIXME: dispatch on language
- ((looking-at (concat "\\(" gpr-query--symbol-char "+\\)" ;; 1: prefix
- "\\.\\(" gpr-query--symbol-char "+\\)" ;; 2: simple
name
- "\\((.*)\\)? " ;; 3: args,
- wisi-file-line-col-regexp)) ;; 4, 5, 6
file:line:col
- ;; process line
- (push (match-string-no-properties 2) symbols)
- (push
- (cons (concat (match-string-no-properties 2)
- (match-string-no-properties 3)
- "<" (match-string-no-properties 1) "<"
(match-string-no-properties 5) ">>")
- (list (gpr-query--normalize-filename (match-string-no-properties
4))
- (string-to-number (match-string 5))
- (1- (string-to-number (match-string 6)))))
- symbol-locs))
-
- (t ;; ignore line
- )
- )
- (forward-line 1))
-
- (setf (gpr-query--session-symbol-locs session) symbol-locs)
- (setf (gpr-query--session-symbols session) (delete-dups symbols))))
-
(defun gpr-query-compilation (project identifier file line col cmd comp-err
&optional local_only append)
"Run gpr_query CMD IDENTIFIER:FILE:LINE:COL,
with compilation-error-regexp-alist set to COMP-ERR."
@@ -654,10 +681,10 @@ FILE is from gpr-query."
;; FILE must be abs
(cond
((eq system-type 'windows-nt)
- ;; 'expand-file-name' converts Windows directory
- ;; separators to normal Emacs.
- ;; FIXME: we used to downcase here; need use case. Counter use case:
- ;; completion table matching (buffer-file-name) in wisi-filter-table
+ ;; 'expand-file-name' converts Windows directory separators to
+ ;; normal Emacs. Normally we would downcase here, but that
+ ;; interferes with completion table matching (buffer-file-name) in
+ ;; wisi-filter-table.
(expand-file-name file))
((eq system-type 'darwin)
@@ -693,7 +720,7 @@ FILE is from gpr-query."
(gpr-query-cached-session project)
nil)
-(cl-defmethod wisi-xref-refresh-cache ((_xref gpr-query-xref) project no-full)
+(cl-defmethod wisi-xref-refresh-cache ((xref gpr-query-xref) project no-full)
;; Kill the current session and delete the database, to get changed
;; env vars etc when it restarts.
;;
@@ -701,26 +728,52 @@ FILE is from gpr-query."
;; changed, or the database was built with an incorrect environment
;; variable, or something else screwed up. However, rebuilding after
;; that is a lot slower, so we only do that with permission.
- (let* ((session (gpr-query-cached-session project))
+ (let* ((gpr-file (gnat-compiler-gpr-file xref))
+ (session (gpr-query-cached-session project :no-symbols t)) ;; we only
need the db file name.
(db-filename
- (with-current-buffer (gpr-query--session-send session "db_name" t)
- (goto-char (point-min))
- (buffer-substring-no-properties (line-beginning-position)
(line-end-position)))))
+ (unless no-full
+ (condition-case nil
+ ;; gpr-query--session-send can fail if the .gpr file
+ ;; contains errors, for example if GPR_PROJECT_PATH is
+ ;; wrong.
+ (with-current-buffer (gpr-query--session-send session "db_name"
t)
+ (goto-char (point-min))
+ (buffer-substring-no-properties (line-beginning-position)
(line-end-position)))
+ (error
+ nil)
+ ))))
;; We have to kill the process to delete the database. If we are
;; not deleting the db, this is an easy way to refresh everything
;; else.
(gpr-query-kill-session session)
- (when (and (not no-full)
+ (when (and db-filename
(file-exists-p db-filename))
(delete-file db-filename))
- (gpr-query--start-process session 'xref)
+ ;; recreate session from newly parsed project
+ (setq gpr-query--sessions (delete (cons gpr-file session)
gpr-query--sessions))
+
+ (setq session (gpr-query-cached-session project))
+ (message "project cache refreshed")
+ ))
+
+(defun gpr-query-refresh-lite ()
+ "Send a refresh command to the current gpr-query process."
+ (interactive)
+ (let* ((project (project-current))
+ (session (gpr-query-cached-session project))
+ (process (gpr-query--session-xref-process session)))
+
+ (process-send-string process "refresh\n")
+ (gpr-query-session-wait session 'xref)
+ (message "gpr_query refreshed")
))
(defun gpr-query-tree-refs (project item op)
"Run gpr_query tree command OP on ITEM (an xref-item), return list of
xref-items."
- ;; WORKAROUND: xref 1.3.2 xref-location changed from defclass to cl-defstruct
+ ;; WORKAROUND: xref 1.3.2 xref-location changed from defclass to
+ ;; cl-defstruct. If drop emacs 26, use 'with-suppressed-warnings'.
(with-no-warnings ;; "unknown slot"
(let ((summary (if (functionp 'xref-item-summary) (xref-item-summary item)
(oref item summary)))
(location (if (functionp 'xref-item-location) (xref-item-location
item) (oref item location)))
diff --git a/gpr-skel.el b/gpr-skel.el
index 3f0cb0f550..9a53364fcf 100644
--- a/gpr-skel.el
+++ b/gpr-skel.el
@@ -1,6 +1,6 @@
;; gpr-skel.el --- Extension to gpr-mode for inserting statement skeletons
-*- lexical-binding:t -*-
-;; Copyright (C) 2013-2015, 2018, 2019 Free Software Foundation, Inc.
+;; Copyright (C) 2013-2015, 2018 - 2021 Free Software Foundation, Inc.
;; Authors: Stephen Leake <stephen_leake@stephe-leake.org>
@@ -85,7 +85,7 @@ This could end in a token recognized by `gpr-skel-expand'."
"end case;")
(define-skeleton gpr-skel-header
- "Insert a file header comment, with automatic copyright year and prompt for
copyright owner/license.
+ "Insert a file header comment, prompt for copyright owner/license.
Each user will probably want to override this."
()
"-- Abstract :\n"
@@ -124,7 +124,8 @@ Each user will probably want to override this."
(defun gpr-skel-setup ()
"Setup a buffer for gpr-skel."
(setq wisi-skel-token-alist gpr-skel-token-alist)
- (add-hook 'skeleton-end-hook 'wisi-indent-statement nil t)
+ (add-hook 'skeleton-end-hook #'wisi-skel-enable-parse t)
+ (add-hook 'skeleton-end-hook #'wisi-indent-statement t)
(when (and gpr-skel-initial-string
(= (buffer-size) 0))
(insert gpr-skel-initial-string))
diff --git a/gpr.wy b/gpr.wy
index bb7d5a7837..80b0532a04 100644
--- a/gpr.wy
+++ b/gpr.wy
@@ -6,7 +6,7 @@
;; Keywords: syntax
%code copyright_license %{
-;; Copyright (C) 2013 - 2020 Free Software Foundation, Inc.
+;; Copyright (C) 2013 - 2022 Free Software Foundation, Inc.
;; This program is free software; you can redistribute it and/or
;; modify it under the terms of the GNU General Public License as
@@ -23,7 +23,8 @@
}%
%code actions spec post %{
- Partial_Parse_Active : Boolean := False;
+ Partial_Parse_Active : aliased Boolean := False;
+ Partial_Parse_Byte_Goal : aliased WisiToken.Buffer_Pos :=
WisiToken.Buffer_Pos'Last;
}%
;;; Commentary:
@@ -81,7 +82,13 @@
;; handle DOS or Unix newline
%non_grammar <new-line> NEW_LINE %[ [\x0a]|[\x0d][\x0a] ]%
-%non_grammar <comment> COMMENT %[ "--"[^\x04\n]* ]%
+%non_grammar <comment-new-line> COMMENT "--"
+
+;; gnatprep preprocessor lines
+%non_grammar <comment-new-line> GNAT_PREP %[ ("#if"|"#elsif"|"#else"|"#end") ]%
+
+;; skeleton placeholders.
+%non_grammar <comment-one-line> PLACEHOLDER "{" "}"
%token <number> NUMERIC_LITERAL
%[ [0-9]+ ]%
@@ -91,7 +98,7 @@
%[ [a-zA-Z\x80-\U0010FFFF][0-9a-zA-Z_\x80-\U0010FFFF]* ]%
"A_Bogus_Identifier"
-%token <string-double> STRING_LITERAL
+%token <string-double-one-line> STRING_LITERAL
%[ (["][\x20-\x21\x23-\U0010FFFF]*["])+ ]%
'""'
@@ -111,14 +118,14 @@
%end_names_optional_option End_Names_Optional
-%conflict SHIFT/REDUCE in state aggregate_g, aggregate_g on token RIGHT_PAREN
-%conflict SHIFT/REDUCE in state case_statement, case_statement on token WHEN
+%conflict SHIFT term | REDUCE identifier_opt on token RIGHT_PAREN
+%conflict SHIFT case_item | REDUCE case_items on token WHEN
;; grammar rules, non-terminal alphabetical order
aggregate_g
: LEFT_PAREN string_list RIGHT_PAREN
- %((wisi-indent-action [0 (wisi-anchored 1 1) (wisi-anchored 1 0)]))%
+ %((wisi-indent-action [nil (wisi-anchored 1 1) (wisi-anchored 1 0)]))%
;
attribute_declaration
@@ -127,26 +134,26 @@ attribute_declaration
(wisi-statement-action [1 statement-start 5 statement-end])
(wisi-name-action 2)
(wisi-face-apply-action [2 nil font-lock-function-name-face])
- (wisi-indent-action [0 gpr-indent-broken 0 gpr-indent-broken 0])))%
+ (wisi-indent-action [nil gpr-indent-broken nil gpr-indent-broken
nil])))%
| FOR IDENTIFIER LEFT_PAREN discrete_choice RIGHT_PAREN USE expression
SEMICOLON
%((progn
(wisi-statement-action [1 statement-start 8 statement-end])
(wisi-name-action 2)
(wisi-face-apply-action [2 nil font-lock-function-name-face])
- (wisi-indent-action [0 gpr-indent-broken (- gpr-indent-broken 1)
gpr-indent-broken (- gpr-indent-broken 1) 0
- gpr-indent-broken 0])))%
+ (wisi-indent-action [nil gpr-indent-broken (- gpr-indent-broken 1)
gpr-indent-broken (- gpr-indent-broken 1) nil
+ gpr-indent-broken nil])))%
| FOR IDENTIFIER LEFT_PAREN discrete_choice RIGHT_PAREN USE expression AT
NUMERIC_LITERAL SEMICOLON
%((progn
(wisi-statement-action [1 statement-start 10 statement-end])
(wisi-name-action 2)
(wisi-face-apply-action [2 nil font-lock-function-name-face])
- (wisi-indent-action [0 gpr-indent-broken (- gpr-indent-broken 1)
gpr-indent-broken (- gpr-indent-broken 1) 0
- gpr-indent-broken 0 0 0])))%
+ (wisi-indent-action [nil gpr-indent-broken (- gpr-indent-broken 1)
gpr-indent-broken (- gpr-indent-broken 1) nil
+ gpr-indent-broken nil nil nil])))%
| FOR EXTERNAL LEFT_PAREN STRING_LITERAL RIGHT_PAREN USE expression SEMICOLON
%((progn
(wisi-statement-action [1 statement-start 8 statement-end])
- (wisi-indent-action [0 gpr-indent-broken (- gpr-indent-broken 1)
gpr-indent-broken (- gpr-indent-broken 1) 0
- gpr-indent-broken 0])))%
+ (wisi-indent-action [nil gpr-indent-broken (- gpr-indent-broken 1)
gpr-indent-broken (- gpr-indent-broken 1) nil
+ gpr-indent-broken nil])))%
;
;; (info "(gprbuild_ug)Attributes")
@@ -166,7 +173,7 @@ case_statement
: CASE name IS case_items END CASE SEMICOLON
%((progn
(wisi-statement-action [1 statement-start 7 statement-end])
- (wisi-indent-action [0 gpr-indent-broken 0 [gpr-indent-when
gpr-indent-when] 0 0 0])))%
+ (wisi-indent-action [nil gpr-indent-broken nil [(wisi-block
gpr-indent-when) gpr-indent-when] nil nil nil])))%
;
;; declarations allowed in a case statement are a subset of
@@ -175,7 +182,7 @@ case_item
: WHEN discrete_choice_list EQUAL_GREATER declarative_items_opt
%((progn
(wisi-statement-action [1 motion])
- (wisi-indent-action [0 gpr-indent-broken gpr-indent gpr-indent])))%
+ (wisi-indent-action [nil gpr-indent-broken gpr-indent (wisi-block
gpr-indent)])))%
;
case_items
@@ -264,7 +271,7 @@ package_spec
(wisi-statement-action [1 statement-start 7 statement-end])
(wisi-name-action 2)
(wisi-face-apply-action [2 nil font-lock-function-name-face 6 nil
font-lock-function-name-face])
- (wisi-indent-action [0 gpr-indent-broken 0 [gpr-indent gpr-indent] 0 0
0])))%
+ (wisi-indent-action [nil gpr-indent-broken nil [(wisi-block
gpr-indent) gpr-indent] nil nil nil])))%
%((wisi-match-names 2 6))%
;
@@ -274,7 +281,7 @@ package_extension
(wisi-statement-action [1 statement-start 9 statement-end])
(wisi-name-action 2)
(wisi-face-apply-action [2 nil font-lock-function-name-face 8 nil
font-lock-function-name-face])
- (wisi-indent-action [0 gpr-indent-broken 0 gpr-indent-broken 0
[gpr-indent gpr-indent] 0 0 0])))%
+ (wisi-indent-action [nil gpr-indent-broken nil gpr-indent-broken nil
[(wisi-block gpr-indent) gpr-indent] nil nil nil])))%
%((wisi-match-names 2 8))%
;
@@ -297,7 +304,7 @@ project_extension
(wisi-statement-action [1 statement-start 9 statement-end])
(wisi-name-action 2)
(wisi-face-apply-action [1 nil font-lock-keyword-face 2 nil
font-lock-function-name-face 8 nil font-lock-function-name-face])
- (wisi-indent-action [0 gpr-indent-broken 0 gpr-indent-broken 0
[gpr-indent gpr-indent] 0 0 0])))%
+ (wisi-indent-action [nil gpr-indent-broken nil gpr-indent-broken nil
[(wisi-block gpr-indent) gpr-indent] nil nil nil])))%
%((wisi-match-names 2 8))%
;
@@ -317,11 +324,11 @@ simple_declarative_item
: IDENTIFIER COLON_EQUALS expression SEMICOLON ;; variable_declaration
%((progn
(wisi-statement-action [1 statement-start 4 statement-end])
- (wisi-indent-action [0 gpr-indent-broken gpr-indent-broken 0])))%
+ (wisi-indent-action [nil gpr-indent-broken gpr-indent-broken nil])))%
| IDENTIFIER COLON IDENTIFIER COLON_EQUALS expression SEMICOLON ;;
typed_variable_declaration
%((progn
(wisi-statement-action [1 statement-start 6 statement-end])
- (wisi-indent-action [0 gpr-indent-broken gpr-indent-broken
gpr-indent-broken gpr-indent-broken 0])))%
+ (wisi-indent-action [nil gpr-indent-broken gpr-indent-broken
gpr-indent-broken gpr-indent-broken nil])))%
| attribute_declaration
| case_statement
| NULL SEMICOLON
@@ -336,7 +343,7 @@ simple_project_declaration
(wisi-face-apply-action [1 nil font-lock-keyword-face
2 nil font-lock-function-name-face
6 nil font-lock-function-name-face])
- (wisi-indent-action [0 gpr-indent-broken 0 [gpr-indent gpr-indent] 0 0
0])))%
+ (wisi-indent-action [nil gpr-indent-broken nil [(wisi-block
gpr-indent) gpr-indent] nil nil nil])))%
%((wisi-match-names 2 6))%
;
@@ -367,7 +374,7 @@ typed_string_declaration
: TYPE IDENTIFIER IS aggregate_g SEMICOLON
%((progn
(wisi-statement-action [1 statement-start 5 statement-end])
- (wisi-indent-action [0 gpr-indent-broken gpr-indent-broken
gpr-indent-broken 0])))%
+ (wisi-indent-action [nil gpr-indent-broken gpr-indent-broken
gpr-indent-broken nil])))%
;
with_clause
diff --git a/gpr_mode_wisi_parse.ads b/gpr_mode_wisi_parse.ads
index 623d1da247..1dd4afcd28 100644
--- a/gpr_mode_wisi_parse.ads
+++ b/gpr_mode_wisi_parse.ads
@@ -2,7 +2,7 @@
--
-- External process parser for gpr mode
--
--- Copyright (C) 2017 - 2019 Free Software Foundation, Inc.
+-- Copyright (C) 2017 - 2020, 2022 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or
-- modify it under terms of the GNU General Public License as
@@ -24,11 +24,14 @@ with Gpr_Process_Main;
with Wisi.Gpr;
procedure Gpr_Mode_Wisi_Parse is new Gen_Emacs_Wisi_LR_Parse
(Parse_Data_Type => Wisi.Gpr.Parse_Data_Type,
- Language_Protocol_Version => Wisi.Gpr.Language_Protocol_Version,
Name => "gpr_mode_wisi_parse",
- Descriptor => Gpr_Process_Actions.Descriptor,
- Partial_Parse_Active => Gpr_Process_Actions.Partial_Parse_Active,
+ Language_Protocol_Version => Wisi.Gpr.Language_Protocol_Version,
+ Descriptor => Gpr_Process_Actions.Descriptor'Access,
+ Partial_Parse_Active =>
Gpr_Process_Actions.Partial_Parse_Active'Access,
+ Partial_Parse_Byte_Goal =>
Gpr_Process_Actions.Partial_Parse_Byte_Goal'Access,
Language_Fixes => null,
Language_Matching_Begin_Tokens => null,
Language_String_ID_Set => null,
- Create_Parser => Gpr_Process_Main.Create_Parser);
+ Create_Lexer => Gpr_Process_Main.Create_Lexer,
+ Create_Parse_Table => Gpr_Process_Main.Create_Parse_Table,
+ Create_Productions => Gpr_Process_Main.Create_Productions);
diff --git a/gpr_process_actions.adb b/gpr_process_actions.adb
index d1e5248352..fb13f94ed1 100644
--- a/gpr_process_actions.adb
+++ b/gpr_process_actions.adb
@@ -1,8 +1,8 @@
--- generated parser support file.
+-- generated parser support file. -*- buffer-read-only:t -*-
-- command line: wisitoken-bnf-generate.exe --generate LR1 Ada_Emacs re2c
PROCESS gpr.wy
--
--- Copyright (C) 2013 - 2020 Free Software Foundation, Inc.
+-- Copyright (C) 2013 - 2022 Free Software Foundation, Inc.
-- This program is free software; you can redistribute it and/or
-- modify it under the terms of the GNU General Public License as
@@ -19,15 +19,15 @@
with Wisi; use Wisi;
with Wisi.Gpr; use Wisi.Gpr;
+with WisiToken.In_Parse_Actions; use WisiToken.In_Parse_Actions;
package body Gpr_Process_Actions is
- use WisiToken.Semantic_Checks;
+ use WisiToken.Syntax_Trees.In_Parse_Actions;
procedure aggregate_g_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
begin
@@ -37,142 +37,136 @@ package body Gpr_Process_Actions is
when Face =>
null;
when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Int, 0))), (False, (Simple,
- (Anchored_0, 1, 1))), (False, (Simple, (Anchored_0, 1, 0)))));
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, ((False, (Simple, (Label
=> None))), (False, (Simple, (Anchored_0,
+ 1, 1))), (False, (Simple, (Anchored_0, 1, 0)))));
end case;
end aggregate_g_0;
procedure attribute_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (5, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
+ Statement_Action (Parse_Data, Tree, Nonterm, ((1, Statement_Start),
(5, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, 2);
when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 2,
0)));
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (2, 2, 0)));
when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Int, 0))), (False, (Simple, (Int,
- Gpr_Indent_Broken))), (False, (Simple, (Int, 0))), (False, (Simple,
(Int, Gpr_Indent_Broken))), (False,
- (Simple, (Int, 0)))));
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, ((False, (Simple, (Label
=> None))), (False, (Simple, (Int,
+ Gpr_Indent_Broken))), (False, (Simple, (Label => None))), (False,
(Simple, (Int, Gpr_Indent_Broken))), (False,
+ (Simple, (Label => None)))));
end case;
end attribute_declaration_0;
procedure attribute_declaration_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (8, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
+ Statement_Action (Parse_Data, Tree, Nonterm, ((1, Statement_Start),
(8, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, 2);
when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 2,
0)));
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (2, 2, 0)));
when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Int, 0))), (False, (Simple, (Int,
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, ((False, (Simple, (Label
=> None))), (False, (Simple, (Int,
Gpr_Indent_Broken))), (False, (Simple, (Int, Gpr_Indent_Broken -
1))), (False, (Simple, (Int,
- Gpr_Indent_Broken))), (False, (Simple, (Int, Gpr_Indent_Broken -
1))), (False, (Simple, (Int, 0))), (False,
- (Simple, (Int, Gpr_Indent_Broken))), (False, (Simple, (Int, 0)))));
+ Gpr_Indent_Broken))), (False, (Simple, (Int, Gpr_Indent_Broken -
1))), (False, (Simple, (Label => None))),
+ (False, (Simple, (Int, Gpr_Indent_Broken))), (False, (Simple, (Label
=> None)))));
end case;
end attribute_declaration_1;
procedure attribute_declaration_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (10, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
+ Statement_Action (Parse_Data, Tree, Nonterm, ((1, Statement_Start),
(10, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, 2);
when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (2, 2,
0)));
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, (1 => (2, 2, 0)));
when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Int, 0))), (False, (Simple, (Int,
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, ((False, (Simple, (Label
=> None))), (False, (Simple, (Int,
Gpr_Indent_Broken))), (False, (Simple, (Int, Gpr_Indent_Broken -
1))), (False, (Simple, (Int,
- Gpr_Indent_Broken))), (False, (Simple, (Int, Gpr_Indent_Broken -
1))), (False, (Simple, (Int, 0))), (False,
- (Simple, (Int, Gpr_Indent_Broken))), (False, (Simple, (Int, 0))),
(False, (Simple, (Int, 0))), (False,
- (Simple, (Int, 0)))));
+ Gpr_Indent_Broken))), (False, (Simple, (Int, Gpr_Indent_Broken -
1))), (False, (Simple, (Label => None))),
+ (False, (Simple, (Int, Gpr_Indent_Broken))), (False, (Simple, (Label
=> None))), (False, (Simple, (Label =>
+ None))), (False, (Simple, (Label => None)))));
end case;
end attribute_declaration_2;
procedure attribute_declaration_3
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (8, Statement_End)));
+ Statement_Action (Parse_Data, Tree, Nonterm, ((1, Statement_Start),
(8, Statement_End)));
when Face =>
null;
when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Int, 0))), (False, (Simple, (Int,
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, ((False, (Simple, (Label
=> None))), (False, (Simple, (Int,
Gpr_Indent_Broken))), (False, (Simple, (Int, Gpr_Indent_Broken -
1))), (False, (Simple, (Int,
- Gpr_Indent_Broken))), (False, (Simple, (Int, Gpr_Indent_Broken -
1))), (False, (Simple, (Int, 0))), (False,
- (Simple, (Int, Gpr_Indent_Broken))), (False, (Simple, (Int, 0)))));
+ Gpr_Indent_Broken))), (False, (Simple, (Int, Gpr_Indent_Broken -
1))), (False, (Simple, (Label => None))),
+ (False, (Simple, (Int, Gpr_Indent_Broken))), (False, (Simple, (Label
=> None)))));
end case;
end attribute_declaration_3;
procedure case_statement_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (7, Statement_End)));
+ Statement_Action (Parse_Data, Tree, Nonterm, ((1, Statement_Start),
(7, Statement_End)));
when Face =>
null;
when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Int, 0))), (False, (Simple, (Int,
- Gpr_Indent_Broken))), (False, (Simple, (Int, 0))), (True, (Simple,
(Int, Gpr_Indent_When)), (Simple, (Int,
- Gpr_Indent_When))), (False, (Simple, (Int, 0))), (False, (Simple,
(Int, 0))), (False, (Simple, (Int, 0)))));
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, ((False, (Simple, (Label
=> None))), (False, (Simple, (Int,
+ Gpr_Indent_Broken))), (False, (Simple, (Label => None))), (True,
(Simple, (Block, Gpr_Indent_When)), (Simple,
+ (Int, Gpr_Indent_When))), (False, (Simple, (Label => None))), (False,
(Simple, (Label => None))), (False,
+ (Simple, (Label => None)))));
end case;
end case_statement_0;
procedure case_item_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, (1 => (1,
Motion)));
+ Statement_Action (Parse_Data, Tree, Nonterm, (1 => (1, Motion)));
when Face =>
null;
when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Int, 0))), (False, (Simple, (Int,
- Gpr_Indent_Broken))), (False, (Simple, (Int, Gpr_Indent))), (False,
(Simple, (Int, Gpr_Indent)))));
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, ((False, (Simple, (Label
=> None))), (False, (Simple, (Int,
+ Gpr_Indent_Broken))), (False, (Simple, (Int, Gpr_Indent))), (False,
(Simple, (Block, Gpr_Indent)))));
end case;
end case_item_0;
procedure compilation_unit_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
begin
@@ -182,192 +176,186 @@ package body Gpr_Process_Actions is
when Face =>
null;
when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Int, 0))), (False, (Simple, (Int, 0))),
- (True, (Simple, (Int, 0)), (Simple, (Int, 0)))));
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, ((False, (Simple, (Int,
0))), (False, (Simple, (Int, 0))), (True,
+ (Simple, (Int, 0)), (Simple, (Int, 0)))));
end case;
end compilation_unit_0;
function identifier_opt_1_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
is
- pragma Unreferenced (Lexer, Recover_Active);
+ pragma Unreferenced (Recover_Active);
begin
- return Propagate_Name (Nonterm, Tokens, 1);
+ return Propagate_Name (Tree, Nonterm, Tokens, 1);
end identifier_opt_1_check;
procedure package_spec_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (7, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
+ Statement_Action (Parse_Data, Tree, Nonterm, ((1, Statement_Start),
(7, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, 2);
when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, 2, 0), (6,
2, 0)));
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((2, 2, 0), (6, 2, 0)));
when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Int, 0))), (False, (Simple, (Int,
- Gpr_Indent_Broken))), (False, (Simple, (Int, 0))), (True, (Simple,
(Int, Gpr_Indent)), (Simple, (Int,
- Gpr_Indent))), (False, (Simple, (Int, 0))), (False, (Simple, (Int,
0))), (False, (Simple, (Int, 0)))));
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, ((False, (Simple, (Label
=> None))), (False, (Simple, (Int,
+ Gpr_Indent_Broken))), (False, (Simple, (Label => None))), (True,
(Simple, (Block, Gpr_Indent)), (Simple, (Int,
+ Gpr_Indent))), (False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Label
+ => None)))));
end case;
end package_spec_0;
function package_spec_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
- return Match_Names (Lexer, Descriptor, Tokens, 2, 6, End_Names_Optional);
+ return Match_Names (Tree, Tokens, 2, 6, End_Names_Optional);
end package_spec_0_check;
procedure package_extension_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (9, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
+ Statement_Action (Parse_Data, Tree, Nonterm, ((1, Statement_Start),
(9, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, 2);
when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, 2, 0), (8,
2, 0)));
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((2, 2, 0), (8, 2, 0)));
when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Int, 0))), (False, (Simple, (Int,
- Gpr_Indent_Broken))), (False, (Simple, (Int, 0))), (False, (Simple,
(Int, Gpr_Indent_Broken))), (False,
- (Simple, (Int, 0))), (True, (Simple, (Int, Gpr_Indent)), (Simple,
(Int, Gpr_Indent))), (False, (Simple, (Int,
- 0))), (False, (Simple, (Int, 0))), (False, (Simple, (Int, 0)))));
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, ((False, (Simple, (Label
=> None))), (False, (Simple, (Int,
+ Gpr_Indent_Broken))), (False, (Simple, (Label => None))), (False,
(Simple, (Int, Gpr_Indent_Broken))), (False,
+ (Simple, (Label => None))), (True, (Simple, (Block, Gpr_Indent)),
(Simple, (Int, Gpr_Indent))), (False,
+ (Simple, (Label => None))), (False, (Simple, (Label => None))),
(False, (Simple, (Label => None)))));
end case;
end package_extension_0;
function package_extension_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
- return Match_Names (Lexer, Descriptor, Tokens, 2, 8, End_Names_Optional);
+ return Match_Names (Tree, Tokens, 2, 8, End_Names_Optional);
end package_extension_0_check;
procedure package_renaming_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (5, Statement_End)));
+ Statement_Action (Parse_Data, Tree, Nonterm, ((1, Statement_Start),
(5, Statement_End)));
when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((2, 2, 0), (4,
2, 0)));
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((2, 2, 0), (4, 2, 0)));
when Indent =>
null;
end case;
end package_renaming_0;
procedure project_extension_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (9, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
+ Statement_Action (Parse_Data, Tree, Nonterm, ((1, Statement_Start),
(9, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, 2);
when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, 2, 1), (2,
2, 0), (8, 2, 0)));
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((1, 2, 1), (2, 2, 0),
(8, 2, 0)));
when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Int, 0))), (False, (Simple, (Int,
- Gpr_Indent_Broken))), (False, (Simple, (Int, 0))), (False, (Simple,
(Int, Gpr_Indent_Broken))), (False,
- (Simple, (Int, 0))), (True, (Simple, (Int, Gpr_Indent)), (Simple,
(Int, Gpr_Indent))), (False, (Simple, (Int,
- 0))), (False, (Simple, (Int, 0))), (False, (Simple, (Int, 0)))));
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, ((False, (Simple, (Label
=> None))), (False, (Simple, (Int,
+ Gpr_Indent_Broken))), (False, (Simple, (Label => None))), (False,
(Simple, (Int, Gpr_Indent_Broken))), (False,
+ (Simple, (Label => None))), (True, (Simple, (Block, Gpr_Indent)),
(Simple, (Int, Gpr_Indent))), (False,
+ (Simple, (Label => None))), (False, (Simple, (Label => None))),
(False, (Simple, (Label => None)))));
end case;
end project_extension_0;
function project_extension_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
- return Match_Names (Lexer, Descriptor, Tokens, 2, 8, End_Names_Optional);
+ return Match_Names (Tree, Tokens, 2, 8, End_Names_Optional);
end project_extension_0_check;
procedure simple_declarative_item_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (4, Statement_End)));
+ Statement_Action (Parse_Data, Tree, Nonterm, ((1, Statement_Start),
(4, Statement_End)));
when Face =>
null;
when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Int, 0))), (False, (Simple, (Int,
- Gpr_Indent_Broken))), (False, (Simple, (Int, Gpr_Indent_Broken))),
(False, (Simple, (Int, 0)))));
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, ((False, (Simple, (Label
=> None))), (False, (Simple, (Int,
+ Gpr_Indent_Broken))), (False, (Simple, (Int, Gpr_Indent_Broken))),
(False, (Simple, (Label => None)))));
end case;
end simple_declarative_item_0;
procedure simple_declarative_item_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (6, Statement_End)));
+ Statement_Action (Parse_Data, Tree, Nonterm, ((1, Statement_Start),
(6, Statement_End)));
when Face =>
null;
when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Int, 0))), (False, (Simple, (Int,
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, ((False, (Simple, (Label
=> None))), (False, (Simple, (Int,
Gpr_Indent_Broken))), (False, (Simple, (Int, Gpr_Indent_Broken))),
(False, (Simple, (Int,
- Gpr_Indent_Broken))), (False, (Simple, (Int, Gpr_Indent_Broken))),
(False, (Simple, (Int, 0)))));
+ Gpr_Indent_Broken))), (False, (Simple, (Int, Gpr_Indent_Broken))),
(False, (Simple, (Label => None)))));
end case;
end simple_declarative_item_1;
procedure simple_declarative_item_4
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (2, Statement_End)));
+ Statement_Action (Parse_Data, Tree, Nonterm, ((1, Statement_Start),
(2, Statement_End)));
when Face =>
null;
when Indent =>
@@ -376,55 +364,54 @@ package body Gpr_Process_Actions is
end simple_declarative_item_4;
procedure simple_project_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (7, Statement_End)));
- Name_Action (Parse_Data, Tree, Nonterm, Tokens, 2);
+ Statement_Action (Parse_Data, Tree, Nonterm, ((1, Statement_Start),
(7, Statement_End)));
+ Name_Action (Parse_Data, Tree, Nonterm, 2);
when Face =>
- Face_Apply_Action (Parse_Data, Tree, Nonterm, Tokens, ((1, 2, 1), (2,
2, 0), (6, 2, 0)));
+ Face_Apply_Action (Parse_Data, Tree, Nonterm, ((1, 2, 1), (2, 2, 0),
(6, 2, 0)));
when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Int, 0))), (False, (Simple, (Int,
- Gpr_Indent_Broken))), (False, (Simple, (Int, 0))), (True, (Simple,
(Int, Gpr_Indent)), (Simple, (Int,
- Gpr_Indent))), (False, (Simple, (Int, 0))), (False, (Simple, (Int,
0))), (False, (Simple, (Int, 0)))));
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, ((False, (Simple, (Label
=> None))), (False, (Simple, (Int,
+ Gpr_Indent_Broken))), (False, (Simple, (Label => None))), (True,
(Simple, (Block, Gpr_Indent)), (Simple, (Int,
+ Gpr_Indent))), (False, (Simple, (Label => None))), (False, (Simple,
(Label => None))), (False, (Simple, (Label
+ => None)))));
end case;
end simple_project_declaration_0;
function simple_project_declaration_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status
is
pragma Unreferenced (Nonterm, Recover_Active);
begin
- return Match_Names (Lexer, Descriptor, Tokens, 2, 6, End_Names_Optional);
+ return Match_Names (Tree, Tokens, 2, 6, End_Names_Optional);
end simple_project_declaration_0_check;
procedure typed_string_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array)
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access)
is
Parse_Data : Wisi.Parse_Data_Type renames Wisi.Parse_Data_Type
(User_Data);
begin
case Parse_Data.Post_Parse_Action is
when Navigate =>
- Statement_Action (Parse_Data, Tree, Nonterm, Tokens, ((1,
Statement_Start), (5, Statement_End)));
+ Statement_Action (Parse_Data, Tree, Nonterm, ((1, Statement_Start),
(5, Statement_End)));
when Face =>
null;
when Indent =>
- Indent_Action_0 (Parse_Data, Tree, Nonterm, Tokens, ((False, (Simple,
(Int, 0))), (False, (Simple, (Int,
+ Indent_Action_0 (Parse_Data, Tree, Nonterm, ((False, (Simple, (Label
=> None))), (False, (Simple, (Int,
Gpr_Indent_Broken))), (False, (Simple, (Int, Gpr_Indent_Broken))),
(False, (Simple, (Int,
- Gpr_Indent_Broken))), (False, (Simple, (Int, 0)))));
+ Gpr_Indent_Broken))), (False, (Simple, (Label => None)))));
end case;
end typed_string_declaration_0;
diff --git a/gpr_process_actions.ads b/gpr_process_actions.ads
index 61bf195477..d3d2c5bc46 100644
--- a/gpr_process_actions.ads
+++ b/gpr_process_actions.ads
@@ -1,8 +1,8 @@
--- generated parser support file.
+-- generated parser support file. -*- buffer-read-only:t -*-
-- command line: wisitoken-bnf-generate.exe --generate LR1 Ada_Emacs re2c
PROCESS gpr.wy
--
--- Copyright (C) 2013 - 2020 Free Software Foundation, Inc.
+-- Copyright (C) 2013 - 2022 Free Software Foundation, Inc.
-- This program is free software; you can redistribute it and/or
-- modify it under the terms of the GNU General Public License as
@@ -18,25 +18,26 @@
-- along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>.
with WisiToken.Syntax_Trees;
-with WisiToken.Lexer;
-with WisiToken.Semantic_Checks;
package Gpr_Process_Actions is
- Descriptor : aliased WisiToken.Descriptor :=
- (First_Terminal => 3,
- Last_Terminal => 39,
- First_Nonterminal => 40,
- Last_Nonterminal => 73,
- EOI_ID => 39,
- Accept_ID => 40,
- Case_Insensitive => True,
- New_Line_ID => 1,
- String_1_ID => 2147483647,
- String_2_ID => 38,
- Image =>
+ Descriptor : aliased constant WisiToken.Descriptor :=
+ (First_Terminal => 5,
+ Last_Terminal => 41,
+ First_Nonterminal => 42,
+ Last_Nonterminal => 75,
+ SOI_ID => 76,
+ EOI_ID => 41,
+ Accept_ID => 42,
+ Case_Insensitive => True,
+ New_Line_ID => 1,
+ String_1_ID => 32767,
+ String_2_ID => 40,
+ Image =>
(new String'("WHITESPACE"),
new String'("NEW_LINE"),
new String'("COMMENT"),
+ new String'("GNAT_PREP"),
+ new String'("PLACEHOLDER"),
new String'("ABSTRACT"),
new String'("AT"),
new String'("AGGREGATE"),
@@ -107,15 +108,18 @@ package Gpr_Process_Actions is
new String'("string_list"),
new String'("term"),
new String'("typed_string_declaration"),
- new String'("with_clause")),
+ new String'("with_clause"),
+ new String'("Wisi_SOI")),
Terminal_Image_Width => 16,
Image_Width => 26,
- Last_Lookahead => 39);
+ Last_Lookahead => 41);
type Token_Enum_ID is
(WHITESPACE_ID,
NEW_LINE_ID,
COMMENT_ID,
+ GNAT_PREP_ID,
+ PLACEHOLDER_ID,
ABSTRACT_ID,
AT_ID,
AGGREGATE_ID,
@@ -186,7 +190,8 @@ package Gpr_Process_Actions is
string_list_ID,
term_ID,
typed_string_declaration_ID,
- with_clause_ID);
+ with_clause_ID,
+ Wisi_SOI_ID);
type Token_Enum_ID_Array is array (Positive range <>) of Token_Enum_ID;
use all type WisiToken.Token_ID;
@@ -197,120 +202,104 @@ package Gpr_Process_Actions is
function "-" (Item : in WisiToken.Token_ID) return Token_Enum_ID renames
To_Token_Enum;
procedure aggregate_g_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
procedure attribute_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
procedure attribute_declaration_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
procedure attribute_declaration_2
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
procedure attribute_declaration_3
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
procedure case_statement_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
procedure case_item_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
procedure compilation_unit_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
procedure package_spec_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
procedure package_extension_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
procedure package_renaming_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
procedure project_extension_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
procedure simple_declarative_item_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
procedure simple_declarative_item_1
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
procedure simple_declarative_item_4
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
procedure simple_project_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
procedure typed_string_declaration_0
- (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Nonterm : in WisiToken.Valid_Node_Index;
- Tokens : in WisiToken.Valid_Node_Index_Array);
+ (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access);
function identifier_opt_1_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
function package_spec_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
function package_extension_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
function project_extension_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
function simple_project_declaration_0_check
- (Lexer : access constant WisiToken.Lexer.Instance'Class;
- Nonterm : in out WisiToken.Recover_Token;
- Tokens : in WisiToken.Recover_Token_Array;
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in out WisiToken.Syntax_Trees.Recover_Token;
+ Tokens : in WisiToken.Syntax_Trees.Recover_Token_Array;
Recover_Active : in Boolean)
- return WisiToken.Semantic_Checks.Check_Status;
+ return WisiToken.Syntax_Trees.In_Parse_Actions.Status;
- Partial_Parse_Active : Boolean := False;
+ Partial_Parse_Active : aliased Boolean := False;
+ Partial_Parse_Byte_Goal : aliased WisiToken.Buffer_Pos :=
WisiToken.Buffer_Pos'Last;
end Gpr_Process_Actions;
diff --git a/gpr_process_main.adb b/gpr_process_main.adb
index 02eb679aa5..ff4fe95db1 100644
--- a/gpr_process_main.adb
+++ b/gpr_process_main.adb
@@ -1,8 +1,8 @@
--- generated parser support file.
+-- generated parser support file. -*- buffer-read-only:t -*-
-- command line: wisitoken-bnf-generate.exe --generate LR1 Ada_Emacs re2c
PROCESS gpr.wy
--
--- Copyright (C) 2013 - 2020 Free Software Foundation, Inc.
+-- Copyright (C) 2013 - 2022 Free Software Foundation, Inc.
-- This program is free software; you can redistribute it and/or
-- modify it under the terms of the GNU General Public License as
@@ -18,30 +18,202 @@
-- along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>.
with Gpr_Process_Actions; use Gpr_Process_Actions;
+with SAL;
with WisiToken.Lexer.re2c;
with gpr_re2c_c;
package body Gpr_Process_Main is
+ function Is_Block_Delimited (ID : in WisiToken.Token_ID) return Boolean
+ is begin
+ case To_Token_Enum (ID) is
+ when
+ COMMENT_ID |
+ GNAT_PREP_ID |
+ PLACEHOLDER_ID |
+ STRING_LITERAL_ID => return True;
+ when others => return False;
+ end case;
+ end Is_Block_Delimited;
+
+ function Same_Block_Delimiters (ID : in WisiToken.Token_ID) return Boolean
+ is begin
+ case To_Token_Enum (ID) is
+ when COMMENT_ID => return False;
+ when GNAT_PREP_ID => return False;
+ when PLACEHOLDER_ID => return False;
+ when STRING_LITERAL_ID => return True;
+ when others => return False;
+ end case;
+ end Same_Block_Delimiters;
+
+ function Escape_Delimiter_Doubled (ID : in WisiToken.Token_ID) return
Boolean
+ is begin
+ case To_Token_Enum (ID) is
+ when others => return False;
+ end case;
+ end Escape_Delimiter_Doubled;
+
+ function Start_Delimiter_Length (ID : in WisiToken.Token_ID) return Integer
+ is begin
+ case To_Token_Enum (ID) is
+ when COMMENT_ID => return 2;
+ when GNAT_PREP_ID => return 33;
+ when PLACEHOLDER_ID => return 1;
+ when STRING_LITERAL_ID => return 1;
+ when others => raise SAL.Programmer_Error; return 0;
+ end case;
+ end Start_Delimiter_Length;
+
+ function End_Delimiter_Length (ID : in WisiToken.Token_ID) return Integer
+ is begin
+ case To_Token_Enum (ID) is
+ when
+ COMMENT_ID |
+ GNAT_PREP_ID |
+ STRING_LITERAL_ID => return 1;
+ when PLACEHOLDER_ID => return 1;
+ when others => raise SAL.Programmer_Error; return 0;
+ end case;
+ end End_Delimiter_Length;
+
+ function New_Line_Is_End_Delimiter (ID : in WisiToken.Token_ID) return
Boolean
+ is begin
+ return
+ (case To_Token_Enum (ID) is
+ when COMMENT_ID => True,
+ when GNAT_PREP_ID => True,
+ when PLACEHOLDER_ID => True,
+ when STRING_LITERAL_ID => True,
+ when others => raise SAL.Programmer_Error);
+ end New_Line_Is_End_Delimiter;
+
+ function Find_End_Delimiter
+ (Source : in WisiToken.Lexer.Source;
+ ID : in WisiToken.Token_ID;
+ Token_Start : in WisiToken.Buffer_Pos)
+ return WisiToken.Buffer_Pos
+ is begin
+ return
+ (case To_Token_Enum (ID) is
+ when COMMENT_ID => WisiToken.Lexer.Find_New_Line (Source,
Token_Start),
+ when GNAT_PREP_ID => WisiToken.Lexer.Find_New_Line (Source,
Token_Start),
+ when PLACEHOLDER_ID => WisiToken.Lexer.Find_String (Source,
Token_Start, "}"),
+ when STRING_LITERAL_ID => WisiToken.Lexer.Find_String_Or_New_Line
(Source, Token_Start, """"),
+ when others => raise SAL.Programmer_Error);
+ end Find_End_Delimiter;
+
+ function Find_Scan_End
+ (Source : in WisiToken.Lexer.Source;
+ ID : in WisiToken.Token_ID;
+ Region : in WisiToken.Buffer_Region;
+ Inserted : in Boolean;
+ Start : in Boolean)
+ return WisiToken.Buffer_Pos
+ is
+ use WisiToken;
+ begin
+ return
+ (case To_Token_Enum (ID) is
+ when COMMENT_ID =>
+ (if Inserted then Region.Last
+ elsif Start then Region.Last
+ else Lexer.Find_New_Line (Source, Region.Last)),
+ when GNAT_PREP_ID =>
+ (if Inserted then Region.Last
+ elsif Start then Region.Last
+ else Lexer.Find_New_Line (Source, Region.Last)),
+ when PLACEHOLDER_ID =>
+ (if Inserted then Region.Last
+ elsif Start then Region.Last
+ else Lexer.Find_String_Or_New_Line (Source, Region.Last, "{")),
+ when STRING_LITERAL_ID => Lexer.Find_New_Line (Source, Region.Last),
+ when others => raise SAL.Programmer_Error);
+ end Find_Scan_End;
+
+ function Contains_End_Delimiter
+ (Source : in WisiToken.Lexer.Source;
+ ID : in WisiToken.Token_ID;
+ Region : in WisiToken.Buffer_Region)
+ return WisiToken.Base_Buffer_Pos
+ is
+ use WisiToken;
+ begin
+ return
+ (case To_Token_Enum (ID) is
+ when COMMENT_ID => Lexer.Find_New_Line (Source, Region),
+ when GNAT_PREP_ID => Lexer.Find_New_Line (Source, Region),
+ when PLACEHOLDER_ID => Lexer.Find_String_Or_New_Line (Source, Region,
"}"),
+ when STRING_LITERAL_ID => Lexer.Find_String_Or_New_Line (Source,
Region, """"),
+ when others => raise SAL.Programmer_Error);
+ end Contains_End_Delimiter;
+
+ function Line_Begin_Char_Pos
+ (Source : in WisiToken.Lexer.Source;
+ Token : in WisiToken.Lexer.Token;
+ Line : in WisiToken.Line_Number_Type)
+ return WisiToken.Buffer_Pos
+ is
+ pragma Unreferenced (Source, Line);
+ use all type WisiToken.Base_Buffer_Pos;
+ begin
+ case To_Token_Enum (Token.ID) is
+ when NEW_LINE_ID => return Token.Char_Region.Last + 1;
+ when COMMENT_ID => return Token.Char_Region.Last + 1;
+ when GNAT_PREP_ID => return Token.Char_Region.Last + 1;
+ when others => raise SAL.Programmer_Error;
+ end case;
+ end Line_Begin_Char_Pos;
+
+ function Can_Contain_New_Line (ID : in WisiToken.Token_ID) return Boolean
+ is begin
+ case To_Token_Enum (ID) is
+ when NEW_LINE_ID => return True;
+ when COMMENT_ID => return True;
+ when GNAT_PREP_ID => return True;
+ when others => return False;
+ end case;
+ end Can_Contain_New_Line;
+
+ function Terminated_By_New_Line (ID : in WisiToken.Token_ID) return Boolean
+ is begin
+ case To_Token_Enum (ID) is
+ when NEW_LINE_ID => return True;
+ when COMMENT_ID => return True;
+ when GNAT_PREP_ID => return True;
+ when STRING_LITERAL_ID => return True;
+ when others => return False;
+ end case;
+ end Terminated_By_New_Line;
+
package Lexer is new WisiToken.Lexer.re2c
(gpr_re2c_c.New_Lexer,
gpr_re2c_c.Free_Lexer,
gpr_re2c_c.Reset_Lexer,
- gpr_re2c_c.Next_Token);
+ gpr_re2c_c.Set_Verbosity,
+ gpr_re2c_c.Set_Position,
+ gpr_re2c_c.Next_Token,
+ Is_Block_Delimited,
+ Same_Block_Delimiters,
+ Escape_Delimiter_Doubled,
+ Start_Delimiter_Length,
+ End_Delimiter_Length,
+ New_Line_Is_End_Delimiter,
+ Find_End_Delimiter,
+ Contains_End_Delimiter,
+ Find_Scan_End,
+ Line_Begin_Char_Pos,
+ Can_Contain_New_Line,
+ Terminated_By_New_Line);
- procedure Create_Parser
- (Parser : out WisiToken.Parse.LR.Parser.Parser;
- Language_Fixes : in
WisiToken.Parse.LR.Parser.Language_Fixes_Access;
- Language_Matching_Begin_Tokens : in
WisiToken.Parse.LR.Parser.Language_Matching_Begin_Tokens_Access;
- Language_String_ID_Set : in
WisiToken.Parse.LR.Parser.Language_String_ID_Set_Access;
- Trace : not null access WisiToken.Trace'Class;
- User_Data : in
WisiToken.Syntax_Trees.User_Data_Access)
+ function Create_Parse_Table
+ return WisiToken.Parse.LR.Parse_Table_Ptr
is
use WisiToken.Parse.LR;
McKenzie_Param : constant McKenzie_Param_Type :=
- (First_Terminal => 3,
- Last_Terminal => 39,
- First_Nonterminal => 40,
- Last_Nonterminal => 73,
+ (First_Terminal => 5,
+ Last_Terminal => 41,
+ First_Nonterminal => 42,
+ Last_Nonterminal => 75,
Insert =>
(4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4),
@@ -57,2349 +229,2397 @@ package body Gpr_Process_Main is
Fast_Forward => 0,
Matching_Begin => 0,
Ignore_Check_Fail => 2,
- Task_Count => 0,
Check_Limit => 3,
+ Zombie_Limit => 4,
Check_Delta_Limit => 200,
Enqueue_Limit => 10000);
Table : constant Parse_Table_Ptr := new Parse_Table
(State_First => 0,
State_Last => 322,
- First_Terminal => 3,
- Last_Terminal => 39,
- First_Nonterminal => 40,
- Last_Nonterminal => 73);
+ First_Terminal => 5,
+ Last_Terminal => 41,
+ First_Nonterminal => 42,
+ Last_Nonterminal => 75);
begin
- Table.McKenzie_Param := McKenzie_Param;
declare
procedure Subr_1
is begin
Table.States (0).Action_List.Set_Capacity (8);
- Add_Action (Table.States (0), 3, Reduce, (50, 0), 0, null, null);
- Add_Action (Table.States (0), 5, Reduce, (50, 0), 0, null, null);
- Add_Action (Table.States (0), 7, Reduce, (50, 0), 0, null, null);
- Add_Action (Table.States (0), 15, Reduce, (50, 0), 0, null, null);
- Add_Action (Table.States (0), 19, Reduce, (50, 0), 0, null, null);
- Add_Action (Table.States (0), 22, Reduce, (50, 0), 0, null, null);
- Add_Action (Table.States (0), 26, (73, 0), 1);
- Add_Action (Table.States (0), 39, Reduce, (50, 0), 0, null, null);
+ Add_Action (Table.States (0), 5, Reduce, (52, 0), 0);
+ Add_Action (Table.States (0), 7, Reduce, (52, 0), 0);
+ Add_Action (Table.States (0), 9, Reduce, (52, 0), 0);
+ Add_Action (Table.States (0), 17, Reduce, (52, 0), 0);
+ Add_Action (Table.States (0), 21, Reduce, (52, 0), 0);
+ Add_Action (Table.States (0), 24, Reduce, (52, 0), 0);
+ Add_Action (Table.States (0), 28, (75, 0), 1);
+ Add_Action (Table.States (0), 41, Reduce, (52, 0), 0);
Table.States (0).Goto_List.Set_Capacity (4);
- Add_Goto (Table.States (0), 48, 2);
- Add_Goto (Table.States (0), 49, 3);
- Add_Goto (Table.States (0), 50, 4);
- Add_Goto (Table.States (0), 73, 5);
+ Add_Goto (Table.States (0), 50, 2);
+ Add_Goto (Table.States (0), 51, 3);
+ Add_Goto (Table.States (0), 52, 4);
+ Add_Goto (Table.States (0), 75, 5);
Table.States (1).Action_List.Set_Capacity (11);
- Add_Action (Table.States (1), 10, (57, 0), 6);
- Add_Action (Table.States (1), 11, (57, 1), 7);
- Add_Action (Table.States (1), 14, (41, 0), 8);
- Add_Action (Table.States (1), 19, (43, 0), 9);
- Add_Action (Table.States (1), 27, Reduce, (58, 0), 0, null, null);
- Add_Action (Table.States (1), 30, Reduce, (58, 0), 0, null, null);
- Add_Action (Table.States (1), 31, Reduce, (58, 0), 0, null, null);
- Add_Action (Table.States (1), 33, Reduce, (58, 0), 0, null, null);
- Add_Action (Table.States (1), 34, Reduce, (58, 0), 0, null, null);
- Add_Action (Table.States (1), 37, (58, 1), 10);
- Add_Action (Table.States (1), 38, (69, 0), 11);
+ Add_Action (Table.States (1), 12, (59, 0), 6);
+ Add_Action (Table.States (1), 13, (59, 1), 7);
+ Add_Action (Table.States (1), 16, (43, 0), 8);
+ Add_Action (Table.States (1), 21, (45, 0), 9);
+ Add_Action (Table.States (1), 29, Reduce, (60, 0), 0);
+ Add_Action (Table.States (1), 32, Reduce, (60, 0), 0);
+ Add_Action (Table.States (1), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (1), 35, Reduce, (60, 0), 0);
+ Add_Action (Table.States (1), 36, Reduce, (60, 0), 0);
+ Add_Action (Table.States (1), 39, (60, 1), 10);
+ Add_Action (Table.States (1), 40, (71, 0), 11);
Table.States (1).Goto_List.Set_Capacity (10);
- Add_Goto (Table.States (1), 41, 12);
- Add_Goto (Table.States (1), 43, 13);
- Add_Goto (Table.States (1), 44, 14);
- Add_Goto (Table.States (1), 56, 15);
- Add_Goto (Table.States (1), 57, 16);
- Add_Goto (Table.States (1), 58, 17);
- Add_Goto (Table.States (1), 59, 18);
- Add_Goto (Table.States (1), 69, 19);
- Add_Goto (Table.States (1), 70, 20);
- Add_Goto (Table.States (1), 71, 21);
- Table.States (1).Kernel := To_Vector ((0 => ((73, 0), 26, 1,
(2147483647, 0), 0)));
- Table.States (1).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (70, 0), 0)));
+ Add_Goto (Table.States (1), 43, 12);
+ Add_Goto (Table.States (1), 45, 13);
+ Add_Goto (Table.States (1), 46, 14);
+ Add_Goto (Table.States (1), 58, 15);
+ Add_Goto (Table.States (1), 59, 16);
+ Add_Goto (Table.States (1), 60, 17);
+ Add_Goto (Table.States (1), 61, 18);
+ Add_Goto (Table.States (1), 71, 19);
+ Add_Goto (Table.States (1), 72, 20);
+ Add_Goto (Table.States (1), 73, 21);
+ Table.States (1).Kernel := To_Vector ((0 => ((75, 0), 28, 1,
(32767, 0), 0)));
+ Table.States (1).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (72, 0), 0)));
Table.States (2).Action_List.Set_Capacity (1);
- Add_Action (Table.States (2), 39, Accept_It, (40, 0), 1, null,
null);
+ Add_Action (Table.States (2), 41, Accept_It, (42, 0), 1);
Table.States (3).Action_List.Set_Capacity (8);
- Add_Action (Table.States (3), 3, Reduce, (50, 1), 1, null, null);
- Add_Action (Table.States (3), 5, Reduce, (50, 1), 1, null, null);
- Add_Action (Table.States (3), 7, Reduce, (50, 1), 1, null, null);
- Add_Action (Table.States (3), 15, Reduce, (50, 1), 1, null, null);
- Add_Action (Table.States (3), 19, Reduce, (50, 1), 1, null, null);
- Add_Action (Table.States (3), 22, Reduce, (50, 1), 1, null, null);
- Add_Action (Table.States (3), 26, (73, 0), 1);
- Add_Action (Table.States (3), 39, Reduce, (50, 1), 1, null, null);
+ Add_Action (Table.States (3), 5, Reduce, (52, 1), 1);
+ Add_Action (Table.States (3), 7, Reduce, (52, 1), 1);
+ Add_Action (Table.States (3), 9, Reduce, (52, 1), 1);
+ Add_Action (Table.States (3), 17, Reduce, (52, 1), 1);
+ Add_Action (Table.States (3), 21, Reduce, (52, 1), 1);
+ Add_Action (Table.States (3), 24, Reduce, (52, 1), 1);
+ Add_Action (Table.States (3), 28, (75, 0), 1);
+ Add_Action (Table.States (3), 41, Reduce, (52, 1), 1);
Table.States (3).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (3), 73, 22);
- Table.States (3).Kernel := To_Vector ((((49, 1), 49, 2,
(2147483647, 0), 0), ((50, 1), 49, 0, (50, 1),
- 1)));
- Table.States (3).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (50, 1), 1)));
+ Add_Goto (Table.States (3), 75, 22);
+ Table.States (3).Kernel := To_Vector ((((51, 1), 51, 2, (32767,
0), 0), ((52, 1), 51, 0, (52, 1),
+ 1)));
+ Table.States (3).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (52, 1), 1)));
Table.States (4).Action_List.Set_Capacity (7);
- Add_Action (Table.States (4), 3, (66, 1), 23);
- Add_Action (Table.States (4), 5, (66, 3), 24);
- Add_Action (Table.States (4), 7, (66, 6), 25);
- Add_Action (Table.States (4), 15, (66, 5), 26);
- Add_Action (Table.States (4), 19, Reduce, (66, 0), 0, null, null);
- Add_Action (Table.States (4), 22, (66, 2), 27);
- Add_Action (Table.States (4), 39, Reduce, (66, 0), 0, null, null);
+ Add_Action (Table.States (4), 5, (68, 1), 23);
+ Add_Action (Table.States (4), 7, (68, 3), 24);
+ Add_Action (Table.States (4), 9, (68, 6), 25);
+ Add_Action (Table.States (4), 17, (68, 5), 26);
+ Add_Action (Table.States (4), 21, Reduce, (68, 0), 0);
+ Add_Action (Table.States (4), 24, (68, 2), 27);
+ Add_Action (Table.States (4), 41, Reduce, (68, 0), 0);
Table.States (4).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (4), 66, 28);
- Table.States (4).Kernel := To_Vector ((0 => ((48, 0), 50, 0,
(66, 0), 0)));
- Table.States (4).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (66, 0), 0)));
+ Add_Goto (Table.States (4), 68, 28);
+ Table.States (4).Kernel := To_Vector ((0 => ((50, 0), 52, 0,
(68, 0), 0)));
+ Table.States (4).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (68, 0), 0)));
Table.States (5).Action_List.Set_Capacity (8);
- Add_Action (Table.States (5), (3, 5, 7, 15, 19, 22, 26, 39), (49,
0), 1, null, null);
- Table.States (5).Kernel := To_Vector ((0 => ((49, 0), 73, 0,
(49, 0), 1)));
- Table.States (5).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (49, 0), 1)));
+ Add_Action (Table.States (5), (5, 7, 9, 17, 21, 24, 28, 41), (51,
0), 1);
+ Table.States (5).Kernel := To_Vector ((0 => ((51, 0), 75, 0,
(51, 0), 1)));
+ Table.States (5).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (51, 0), 1)));
Table.States (6).Action_List.Set_Capacity (1);
- Add_Action (Table.States (6), 14, (41, 0), 29);
+ Add_Action (Table.States (6), 16, (43, 0), 29);
Table.States (6).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (6), 41, 30);
- Table.States (6).Kernel := To_Vector ((0 => ((57, 0), 10, 2,
(2147483647, 0), 0)));
- Table.States (6).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (41, 0), 14, 29)));
+ Add_Goto (Table.States (6), 43, 30);
+ Table.States (6).Kernel := To_Vector ((0 => ((59, 0), 12, 2,
(32767, 0), 0)));
+ Table.States (6).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (43, 0), 16, 29)));
Table.States (7).Action_List.Set_Capacity (1);
- Add_Action (Table.States (7), 14, (41, 0), 29);
+ Add_Action (Table.States (7), 16, (43, 0), 29);
Table.States (7).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (7), 41, 31);
- Table.States (7).Kernel := To_Vector ((0 => ((57, 1), 11, 2,
(2147483647, 0), 0)));
- Table.States (7).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (41, 0), 14, 29)));
+ Add_Goto (Table.States (7), 43, 31);
+ Table.States (7).Kernel := To_Vector ((0 => ((59, 1), 13, 2,
(32767, 0), 0)));
+ Table.States (7).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (43, 0), 16, 29)));
Table.States (8).Action_List.Set_Capacity (11);
- Add_Action (Table.States (8), 10, (57, 0), 32);
- Add_Action (Table.States (8), 11, (57, 1), 33);
- Add_Action (Table.States (8), 14, (41, 0), 34);
- Add_Action (Table.States (8), 19, (43, 0), 9);
- Add_Action (Table.States (8), 21, (71, 1), 35);
- Add_Conflict (Table.States (8), 21, (58, 0), 0, null, null);
- Add_Action (Table.States (8), 27, Reduce, (58, 0), 0, null, null);
- Add_Action (Table.States (8), 30, Reduce, (58, 0), 0, null, null);
- Add_Action (Table.States (8), 31, Reduce, (58, 0), 0, null, null);
- Add_Action (Table.States (8), 33, Reduce, (58, 0), 0, null, null);
- Add_Action (Table.States (8), 37, (58, 1), 36);
- Add_Action (Table.States (8), 38, (69, 0), 37);
+ Add_Action (Table.States (8), 12, (59, 0), 32);
+ Add_Action (Table.States (8), 13, (59, 1), 33);
+ Add_Action (Table.States (8), 16, (43, 0), 34);
+ Add_Action (Table.States (8), 21, (45, 0), 9);
+ Add_Action (Table.States (8), 23, (73, 1), 35);
+ Add_Conflict (Table.States (8), 23, (60, 0), 0);
+ Add_Action (Table.States (8), 29, Reduce, (60, 0), 0);
+ Add_Action (Table.States (8), 32, Reduce, (60, 0), 0);
+ Add_Action (Table.States (8), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (8), 35, Reduce, (60, 0), 0);
+ Add_Action (Table.States (8), 39, (60, 1), 36);
+ Add_Action (Table.States (8), 40, (71, 0), 37);
Table.States (8).Goto_List.Set_Capacity (10);
- Add_Goto (Table.States (8), 41, 38);
- Add_Goto (Table.States (8), 43, 39);
- Add_Goto (Table.States (8), 44, 40);
- Add_Goto (Table.States (8), 56, 41);
- Add_Goto (Table.States (8), 57, 42);
- Add_Goto (Table.States (8), 58, 43);
- Add_Goto (Table.States (8), 59, 44);
- Add_Goto (Table.States (8), 69, 45);
- Add_Goto (Table.States (8), 70, 46);
- Add_Goto (Table.States (8), 71, 47);
- Table.States (8).Kernel := To_Vector ((((41, 0), 14, 1,
(2147483647, 0), 0), ((71, 1), 14, 1,
- (2147483647, 0), 0)));
- Table.States (8).Minimal_Complete_Actions := To_Vector (((Reduce,
(70, 0), 0), (Shift, (71, 1), 21,
+ Add_Goto (Table.States (8), 43, 38);
+ Add_Goto (Table.States (8), 45, 39);
+ Add_Goto (Table.States (8), 46, 40);
+ Add_Goto (Table.States (8), 58, 41);
+ Add_Goto (Table.States (8), 59, 42);
+ Add_Goto (Table.States (8), 60, 43);
+ Add_Goto (Table.States (8), 61, 44);
+ Add_Goto (Table.States (8), 71, 45);
+ Add_Goto (Table.States (8), 72, 46);
+ Add_Goto (Table.States (8), 73, 47);
+ Table.States (8).Kernel := To_Vector ((((43, 0), 16, 1, (32767,
0), 0), ((73, 1), 16, 1, (32767, 0),
+ 0)));
+ Table.States (8).Minimal_Complete_Actions := To_Vector (((Reduce,
(72, 0), 0), (Shift, (73, 1), 23,
35)));
Table.States (9).Action_List.Set_Capacity (1);
- Add_Action (Table.States (9), (1 => 33), (43, 0), 1, null, null);
- Table.States (9).Kernel := To_Vector ((0 => ((43, 0), 19, 0,
(43, 0), 1)));
- Table.States (9).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (43, 0), 1)));
+ Add_Action (Table.States (9), (1 => 35), (45, 0), 1);
+ Table.States (9).Kernel := To_Vector ((0 => ((45, 0), 21, 0,
(45, 0), 1)));
+ Table.States (9).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (45, 0), 1)));
Table.States (10).Action_List.Set_Capacity (5);
- Add_Action (Table.States (10), (27, 30, 31, 33, 34), (58, 1), 1,
null, identifier_opt_1_check'Access);
- Table.States (10).Kernel := To_Vector ((0 => ((58, 1), 37, 0,
(58, 1), 1)));
- Table.States (10).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 1), 1)));
+ Add_Action (Table.States (10), (29, 32, 33, 35, 36), (60, 1), 1);
+ Table.States (10).Kernel := To_Vector ((0 => ((60, 1), 39, 0,
(60, 1), 1)));
+ Table.States (10).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (60, 1), 1)));
Table.States (11).Action_List.Set_Capacity (3);
- Add_Action (Table.States (11), (27, 30, 34), (69, 0), 1, null,
null);
- Table.States (11).Kernel := To_Vector ((0 => ((69, 0), 38, 0,
(69, 0), 1)));
- Table.States (11).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (69, 0), 1)));
+ Add_Action (Table.States (11), (29, 32, 36), (71, 0), 1);
+ Table.States (11).Kernel := To_Vector ((0 => ((71, 0), 40, 0,
(71, 0), 1)));
+ Table.States (11).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (71, 0), 1)));
Table.States (12).Action_List.Set_Capacity (3);
- Add_Action (Table.States (12), (27, 30, 34), (71, 2), 1, null,
null);
- Table.States (12).Kernel := To_Vector ((0 => ((71, 2), 41, 0,
(71, 2), 1)));
- Table.States (12).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (71, 2), 1)));
+ Add_Action (Table.States (12), (29, 32, 36), (73, 2), 1);
+ Table.States (12).Kernel := To_Vector ((0 => ((73, 2), 43, 0,
(73, 2), 1)));
+ Table.States (12).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (73, 2), 1)));
Table.States (13).Action_List.Set_Capacity (1);
- Add_Action (Table.States (13), 33, (44, 0), 48);
- Table.States (13).Kernel := To_Vector ((((44, 0), 43, 2,
(2147483647, 0), 0), ((44, 1), 43, 5,
- (2147483647, 0), 0)));
- Table.States (13).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 0), 33, 48)));
+ Add_Action (Table.States (13), 35, (46, 0), 48);
+ Table.States (13).Kernel := To_Vector ((((46, 0), 45, 2, (32767,
0), 0), ((46, 1), 45, 5, (32767, 0),
+ 0)));
+ Table.States (13).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (46, 0), 35, 48)));
Table.States (14).Action_List.Set_Capacity (3);
- Add_Action (Table.States (14), (27, 30, 34), (69, 3), 1, null,
null);
- Table.States (14).Kernel := To_Vector ((0 => ((69, 3), 44, 0,
(69, 3), 1)));
- Table.States (14).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (69, 3), 1)));
+ Add_Action (Table.States (14), (29, 32, 36), (71, 3), 1);
+ Table.States (14).Kernel := To_Vector ((0 => ((71, 3), 46, 0,
(71, 3), 1)));
+ Table.States (14).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (71, 3), 1)));
Table.States (15).Action_List.Set_Capacity (3);
- Add_Action (Table.States (15), 27, (56, 1), 49);
- Add_Action (Table.States (15), 30, Reduce, (70, 0), 1, null,
null);
- Add_Action (Table.States (15), 34, Reduce, (70, 0), 1, null,
null);
- Table.States (15).Kernel := To_Vector ((((56, 1), 56, 1,
(2147483647, 0), 0), ((70, 0), 56, 0, (70,
- 0), 1)));
- Table.States (15).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (70, 0), 1)));
+ Add_Action (Table.States (15), 29, (58, 1), 49);
+ Add_Action (Table.States (15), 32, Reduce, (72, 0), 1);
+ Add_Action (Table.States (15), 36, Reduce, (72, 0), 1);
+ Table.States (15).Kernel := To_Vector ((((58, 1), 58, 1, (32767,
0), 0), ((72, 0), 58, 0, (72, 0),
+ 1)));
+ Table.States (15).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (72, 0), 1)));
Table.States (16).Action_List.Set_Capacity (3);
- Add_Action (Table.States (16), (27, 30, 34), (69, 2), 1, null,
null);
- Table.States (16).Kernel := To_Vector ((0 => ((69, 2), 57, 0,
(69, 2), 1)));
- Table.States (16).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (69, 2), 1)));
+ Add_Action (Table.States (16), (29, 32, 36), (71, 2), 1);
+ Table.States (16).Kernel := To_Vector ((0 => ((71, 2), 59, 0,
(71, 2), 1)));
+ Table.States (16).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (71, 2), 1)));
Table.States (17).Action_List.Set_Capacity (5);
- Add_Action (Table.States (17), (27, 30, 31, 33, 34), (59, 0), 1,
null, null);
- Table.States (17).Kernel := To_Vector ((0 => ((59, 0), 58, 0,
(59, 0), 1)));
- Table.States (17).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (59, 0), 1)));
+ Add_Action (Table.States (17), (29, 32, 33, 35, 36), (61, 0), 1);
+ Table.States (17).Kernel := To_Vector ((0 => ((61, 0), 60, 0,
(61, 0), 1)));
+ Table.States (17).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (61, 0), 1)));
Table.States (18).Action_List.Set_Capacity (5);
- Add_Action (Table.States (18), 27, Reduce, (69, 1), 1, null,
null);
- Add_Action (Table.States (18), 30, Reduce, (69, 1), 1, null,
null);
- Add_Action (Table.States (18), 31, (59, 1), 50);
- Add_Action (Table.States (18), 33, Reduce, (43, 1), 1, null,
null);
- Add_Action (Table.States (18), 34, Reduce, (69, 1), 1, null,
null);
- Table.States (18).Kernel := To_Vector ((((43, 1), 59, 0, (43,
1), 1), ((59, 1), 59, 2, (2147483647,
- 0), 0), ((69, 1), 59, 0, (69, 1), 1)));
- Table.States (18).Minimal_Complete_Actions := To_Vector (((Reduce,
(43, 1), 1), (Reduce, (69, 1), 1)));
+ Add_Action (Table.States (18), 29, Reduce, (71, 1), 1);
+ Add_Action (Table.States (18), 32, Reduce, (71, 1), 1);
+ Add_Action (Table.States (18), 33, (61, 1), 50);
+ Add_Action (Table.States (18), 35, Reduce, (45, 1), 1);
+ Add_Action (Table.States (18), 36, Reduce, (71, 1), 1);
+ Table.States (18).Kernel := To_Vector ((((45, 1), 61, 0, (45,
1), 1), ((61, 1), 61, 2, (32767, 0),
+ 0), ((71, 1), 61, 0, (71, 1), 1)));
+ Table.States (18).Minimal_Complete_Actions := To_Vector (((Reduce,
(45, 1), 1), (Reduce, (71, 1), 1)));
Table.States (19).Action_List.Set_Capacity (3);
- Add_Action (Table.States (19), (27, 30, 34), (71, 0), 1, null,
null);
- Table.States (19).Kernel := To_Vector ((0 => ((71, 0), 69, 0,
(71, 0), 1)));
- Table.States (19).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (71, 0), 1)));
+ Add_Action (Table.States (19), (29, 32, 36), (73, 0), 1);
+ Table.States (19).Kernel := To_Vector ((0 => ((73, 0), 71, 0,
(73, 0), 1)));
+ Table.States (19).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (73, 0), 1)));
Table.States (20).Action_List.Set_Capacity (2);
- Add_Action (Table.States (20), 30, (70, 1), 51);
- Add_Action (Table.States (20), 34, (73, 0), 52);
- Table.States (20).Kernel := To_Vector ((((70, 1), 70, 1,
(2147483647, 0), 0), ((73, 0), 70, 1,
- (2147483647, 0), 0)));
- Table.States (20).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (73, 0), 34, 52)));
+ Add_Action (Table.States (20), 32, (72, 1), 51);
+ Add_Action (Table.States (20), 36, (75, 0), 52);
+ Table.States (20).Kernel := To_Vector ((((72, 1), 72, 1, (32767,
0), 0), ((75, 0), 72, 1, (32767, 0),
+ 0)));
+ Table.States (20).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (75, 0), 36, 52)));
Table.States (21).Action_List.Set_Capacity (3);
- Add_Action (Table.States (21), (27, 30, 34), (56, 0), 1, null,
null);
- Table.States (21).Kernel := To_Vector ((0 => ((56, 0), 71, 0,
(56, 0), 1)));
- Table.States (21).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (56, 0), 1)));
+ Add_Action (Table.States (21), (29, 32, 36), (58, 0), 1);
+ Table.States (21).Kernel := To_Vector ((0 => ((58, 0), 73, 0,
(58, 0), 1)));
+ Table.States (21).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 0), 1)));
Table.States (22).Action_List.Set_Capacity (8);
- Add_Action (Table.States (22), (3, 5, 7, 15, 19, 22, 26, 39), (49,
1), 2, null, null);
- Table.States (22).Kernel := To_Vector ((0 => ((49, 1), 73, 0,
(49, 1), 2)));
- Table.States (22).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (49, 1), 2)));
+ Add_Action (Table.States (22), (5, 7, 9, 17, 21, 24, 28, 41), (51,
1), 2);
+ Table.States (22).Kernel := To_Vector ((0 => ((51, 1), 75, 0,
(51, 1), 2)));
+ Table.States (22).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (51, 1), 2)));
Table.States (23).Action_List.Set_Capacity (2);
- Add_Action (Table.States (23), (19, 39), (66, 1), 1, null, null);
- Table.States (23).Kernel := To_Vector ((0 => ((66, 1), 3, 0,
(66, 1), 1)));
- Table.States (23).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (66, 1), 1)));
+ Add_Action (Table.States (23), (21, 41), (68, 1), 1);
+ Table.States (23).Kernel := To_Vector ((0 => ((68, 1), 5, 0,
(68, 1), 1)));
+ Table.States (23).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (68, 1), 1)));
Table.States (24).Action_List.Set_Capacity (3);
- Add_Action (Table.States (24), 15, (66, 4), 53);
- Add_Action (Table.States (24), 19, Reduce, (66, 3), 1, null,
null);
- Add_Action (Table.States (24), 39, Reduce, (66, 3), 1, null,
null);
- Table.States (24).Kernel := To_Vector ((((66, 3), 5, 0, (66, 3),
1), ((66, 4), 5, 1, (2147483647, 0),
+ Add_Action (Table.States (24), 17, (68, 4), 53);
+ Add_Action (Table.States (24), 21, Reduce, (68, 3), 1);
+ Add_Action (Table.States (24), 41, Reduce, (68, 3), 1);
+ Table.States (24).Kernel := To_Vector ((((68, 3), 7, 0, (68, 3),
1), ((68, 4), 7, 1, (32767, 0),
0)));
- Table.States (24).Minimal_Complete_Actions := To_Vector (((Reduce,
(66, 3), 1), (Shift, (66, 4), 15,
+ Table.States (24).Minimal_Complete_Actions := To_Vector (((Reduce,
(68, 3), 1), (Shift, (68, 4), 17,
53)));
Table.States (25).Action_List.Set_Capacity (2);
- Add_Action (Table.States (25), (19, 39), (66, 6), 1, null, null);
- Table.States (25).Kernel := To_Vector ((0 => ((66, 6), 7, 0,
(66, 6), 1)));
- Table.States (25).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (66, 6), 1)));
+ Add_Action (Table.States (25), (21, 41), (68, 6), 1);
+ Table.States (25).Kernel := To_Vector ((0 => ((68, 6), 9, 0,
(68, 6), 1)));
+ Table.States (25).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (68, 6), 1)));
Table.States (26).Action_List.Set_Capacity (2);
- Add_Action (Table.States (26), (19, 39), (66, 5), 1, null, null);
- Table.States (26).Kernel := To_Vector ((0 => ((66, 5), 15, 0,
(66, 5), 1)));
- Table.States (26).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (66, 5), 1)));
+ Add_Action (Table.States (26), (21, 41), (68, 5), 1);
+ Table.States (26).Kernel := To_Vector ((0 => ((68, 5), 17, 0,
(68, 5), 1)));
+ Table.States (26).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (68, 5), 1)));
Table.States (27).Action_List.Set_Capacity (2);
- Add_Action (Table.States (27), (19, 39), (66, 2), 1, null, null);
- Table.States (27).Kernel := To_Vector ((0 => ((66, 2), 22, 0,
(66, 2), 1)));
- Table.States (27).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (66, 2), 1)));
+ Add_Action (Table.States (27), (21, 41), (68, 2), 1);
+ Table.States (27).Kernel := To_Vector ((0 => ((68, 2), 24, 0,
(68, 2), 1)));
+ Table.States (27).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (68, 2), 1)));
Table.States (28).Action_List.Set_Capacity (2);
- Add_Action (Table.States (28), 19, (65, 0), 54);
- Add_Action (Table.States (28), 39, Reduce, (64, 0), 0, null,
null);
+ Add_Action (Table.States (28), 21, (67, 0), 54);
+ Add_Action (Table.States (28), 41, Reduce, (66, 0), 0);
Table.States (28).Goto_List.Set_Capacity (3);
- Add_Goto (Table.States (28), 64, 55);
- Add_Goto (Table.States (28), 65, 56);
- Add_Goto (Table.States (28), 68, 57);
- Table.States (28).Kernel := To_Vector ((0 => ((48, 0), 66, 0,
(64, 0), 0)));
- Table.States (28).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (64, 0), 0)));
+ Add_Goto (Table.States (28), 66, 55);
+ Add_Goto (Table.States (28), 67, 56);
+ Add_Goto (Table.States (28), 70, 57);
+ Table.States (28).Kernel := To_Vector ((0 => ((50, 0), 68, 0,
(66, 0), 0)));
+ Table.States (28).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (66, 0), 0)));
Table.States (29).Action_List.Set_Capacity (11);
- Add_Action (Table.States (29), 10, (57, 0), 32);
- Add_Action (Table.States (29), 11, (57, 1), 33);
- Add_Action (Table.States (29), 14, (41, 0), 34);
- Add_Action (Table.States (29), 19, (43, 0), 9);
- Add_Action (Table.States (29), 21, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (29), 27, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (29), 30, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (29), 31, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (29), 33, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (29), 37, (58, 1), 36);
- Add_Action (Table.States (29), 38, (69, 0), 37);
+ Add_Action (Table.States (29), 12, (59, 0), 32);
+ Add_Action (Table.States (29), 13, (59, 1), 33);
+ Add_Action (Table.States (29), 16, (43, 0), 34);
+ Add_Action (Table.States (29), 21, (45, 0), 9);
+ Add_Action (Table.States (29), 23, Reduce, (60, 0), 0);
+ Add_Action (Table.States (29), 29, Reduce, (60, 0), 0);
+ Add_Action (Table.States (29), 32, Reduce, (60, 0), 0);
+ Add_Action (Table.States (29), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (29), 35, Reduce, (60, 0), 0);
+ Add_Action (Table.States (29), 39, (60, 1), 36);
+ Add_Action (Table.States (29), 40, (71, 0), 37);
Table.States (29).Goto_List.Set_Capacity (10);
- Add_Goto (Table.States (29), 41, 38);
- Add_Goto (Table.States (29), 43, 39);
- Add_Goto (Table.States (29), 44, 40);
- Add_Goto (Table.States (29), 56, 41);
- Add_Goto (Table.States (29), 57, 42);
- Add_Goto (Table.States (29), 58, 43);
- Add_Goto (Table.States (29), 59, 44);
- Add_Goto (Table.States (29), 69, 45);
- Add_Goto (Table.States (29), 70, 46);
- Add_Goto (Table.States (29), 71, 47);
- Table.States (29).Kernel := To_Vector ((0 => ((41, 0), 14, 1,
(2147483647, 0), 0)));
- Table.States (29).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (70, 0), 0)));
+ Add_Goto (Table.States (29), 43, 38);
+ Add_Goto (Table.States (29), 45, 39);
+ Add_Goto (Table.States (29), 46, 40);
+ Add_Goto (Table.States (29), 58, 41);
+ Add_Goto (Table.States (29), 59, 42);
+ Add_Goto (Table.States (29), 60, 43);
+ Add_Goto (Table.States (29), 61, 44);
+ Add_Goto (Table.States (29), 71, 45);
+ Add_Goto (Table.States (29), 72, 46);
+ Add_Goto (Table.States (29), 73, 47);
+ Table.States (29).Kernel := To_Vector ((0 => ((43, 0), 16, 1,
(32767, 0), 0)));
+ Table.States (29).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (72, 0), 0)));
Table.States (30).Action_List.Set_Capacity (3);
- Add_Action (Table.States (30), (27, 30, 34), (57, 0), 2, null,
null);
- Table.States (30).Kernel := To_Vector ((0 => ((57, 0), 41, 0,
(57, 0), 2)));
- Table.States (30).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (57, 0), 2)));
+ Add_Action (Table.States (30), (29, 32, 36), (59, 0), 2);
+ Table.States (30).Kernel := To_Vector ((0 => ((59, 0), 43, 0,
(59, 0), 2)));
+ Table.States (30).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (59, 0), 2)));
Table.States (31).Action_List.Set_Capacity (3);
- Add_Action (Table.States (31), (27, 30, 34), (57, 1), 2, null,
null);
- Table.States (31).Kernel := To_Vector ((0 => ((57, 1), 41, 0,
(57, 1), 2)));
- Table.States (31).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (57, 1), 2)));
+ Add_Action (Table.States (31), (29, 32, 36), (59, 1), 2);
+ Table.States (31).Kernel := To_Vector ((0 => ((59, 1), 43, 0,
(59, 1), 2)));
+ Table.States (31).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (59, 1), 2)));
Table.States (32).Action_List.Set_Capacity (1);
- Add_Action (Table.States (32), 14, (41, 0), 58);
+ Add_Action (Table.States (32), 16, (43, 0), 58);
Table.States (32).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (32), 41, 59);
- Table.States (32).Kernel := To_Vector ((0 => ((57, 0), 10, 2,
(2147483647, 0), 0)));
- Table.States (32).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (41, 0), 14, 58)));
+ Add_Goto (Table.States (32), 43, 59);
+ Table.States (32).Kernel := To_Vector ((0 => ((59, 0), 12, 2,
(32767, 0), 0)));
+ Table.States (32).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (43, 0), 16, 58)));
Table.States (33).Action_List.Set_Capacity (1);
- Add_Action (Table.States (33), 14, (41, 0), 58);
+ Add_Action (Table.States (33), 16, (43, 0), 58);
Table.States (33).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (33), 41, 60);
- Table.States (33).Kernel := To_Vector ((0 => ((57, 1), 11, 2,
(2147483647, 0), 0)));
- Table.States (33).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (41, 0), 14, 58)));
+ Add_Goto (Table.States (33), 43, 60);
+ Table.States (33).Kernel := To_Vector ((0 => ((59, 1), 13, 2,
(32767, 0), 0)));
+ Table.States (33).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (43, 0), 16, 58)));
Table.States (34).Action_List.Set_Capacity (11);
- Add_Action (Table.States (34), 10, (57, 0), 32);
- Add_Action (Table.States (34), 11, (57, 1), 33);
- Add_Action (Table.States (34), 14, (41, 0), 34);
- Add_Action (Table.States (34), 19, (43, 0), 9);
- Add_Action (Table.States (34), 21, (71, 1), 61);
- Add_Conflict (Table.States (34), 21, (58, 0), 0, null, null);
- Add_Action (Table.States (34), 27, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (34), 30, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (34), 31, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (34), 33, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (34), 37, (58, 1), 36);
- Add_Action (Table.States (34), 38, (69, 0), 37);
+ Add_Action (Table.States (34), 12, (59, 0), 32);
+ Add_Action (Table.States (34), 13, (59, 1), 33);
+ Add_Action (Table.States (34), 16, (43, 0), 34);
+ Add_Action (Table.States (34), 21, (45, 0), 9);
+ Add_Action (Table.States (34), 23, (73, 1), 61);
+ Add_Conflict (Table.States (34), 23, (60, 0), 0);
+ Add_Action (Table.States (34), 29, Reduce, (60, 0), 0);
+ Add_Action (Table.States (34), 32, Reduce, (60, 0), 0);
+ Add_Action (Table.States (34), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (34), 35, Reduce, (60, 0), 0);
+ Add_Action (Table.States (34), 39, (60, 1), 36);
+ Add_Action (Table.States (34), 40, (71, 0), 37);
Table.States (34).Goto_List.Set_Capacity (10);
- Add_Goto (Table.States (34), 41, 38);
- Add_Goto (Table.States (34), 43, 39);
- Add_Goto (Table.States (34), 44, 40);
- Add_Goto (Table.States (34), 56, 41);
- Add_Goto (Table.States (34), 57, 42);
- Add_Goto (Table.States (34), 58, 43);
- Add_Goto (Table.States (34), 59, 44);
- Add_Goto (Table.States (34), 69, 45);
- Add_Goto (Table.States (34), 70, 62);
- Add_Goto (Table.States (34), 71, 47);
- Table.States (34).Kernel := To_Vector ((((41, 0), 14, 1,
(2147483647, 0), 0), ((71, 1), 14, 1,
- (2147483647, 0), 0)));
- Table.States (34).Minimal_Complete_Actions := To_Vector (((Reduce,
(70, 0), 0), (Shift, (71, 1), 21,
+ Add_Goto (Table.States (34), 43, 38);
+ Add_Goto (Table.States (34), 45, 39);
+ Add_Goto (Table.States (34), 46, 40);
+ Add_Goto (Table.States (34), 58, 41);
+ Add_Goto (Table.States (34), 59, 42);
+ Add_Goto (Table.States (34), 60, 43);
+ Add_Goto (Table.States (34), 61, 44);
+ Add_Goto (Table.States (34), 71, 45);
+ Add_Goto (Table.States (34), 72, 62);
+ Add_Goto (Table.States (34), 73, 47);
+ Table.States (34).Kernel := To_Vector ((((43, 0), 16, 1, (32767,
0), 0), ((73, 1), 16, 1, (32767, 0),
+ 0)));
+ Table.States (34).Minimal_Complete_Actions := To_Vector (((Reduce,
(72, 0), 0), (Shift, (73, 1), 23,
61)));
Table.States (35).Action_List.Set_Capacity (3);
- Add_Action (Table.States (35), (27, 30, 34), (71, 1), 2, null,
null);
- Table.States (35).Kernel := To_Vector ((0 => ((71, 1), 21, 0,
(71, 1), 2)));
- Table.States (35).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (71, 1), 2)));
+ Add_Action (Table.States (35), (29, 32, 36), (73, 1), 2);
+ Table.States (35).Kernel := To_Vector ((0 => ((73, 1), 23, 0,
(73, 1), 2)));
+ Table.States (35).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (73, 1), 2)));
Table.States (36).Action_List.Set_Capacity (5);
- Add_Action (Table.States (36), (21, 27, 30, 31, 33), (58, 1), 1,
null, identifier_opt_1_check'Access);
- Table.States (36).Kernel := To_Vector ((0 => ((58, 1), 37, 0,
(58, 1), 1)));
- Table.States (36).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 1), 1)));
+ Add_Action (Table.States (36), (23, 29, 32, 33, 35), (60, 1), 1);
+ Table.States (36).Kernel := To_Vector ((0 => ((60, 1), 39, 0,
(60, 1), 1)));
+ Table.States (36).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (60, 1), 1)));
Table.States (37).Action_List.Set_Capacity (3);
- Add_Action (Table.States (37), (21, 27, 30), (69, 0), 1, null,
null);
- Table.States (37).Kernel := To_Vector ((0 => ((69, 0), 38, 0,
(69, 0), 1)));
- Table.States (37).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (69, 0), 1)));
+ Add_Action (Table.States (37), (23, 29, 32), (71, 0), 1);
+ Table.States (37).Kernel := To_Vector ((0 => ((71, 0), 40, 0,
(71, 0), 1)));
+ Table.States (37).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (71, 0), 1)));
Table.States (38).Action_List.Set_Capacity (3);
- Add_Action (Table.States (38), (21, 27, 30), (71, 2), 1, null,
null);
- Table.States (38).Kernel := To_Vector ((0 => ((71, 2), 41, 0,
(71, 2), 1)));
- Table.States (38).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (71, 2), 1)));
+ Add_Action (Table.States (38), (23, 29, 32), (73, 2), 1);
+ Table.States (38).Kernel := To_Vector ((0 => ((73, 2), 43, 0,
(73, 2), 1)));
+ Table.States (38).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (73, 2), 1)));
Table.States (39).Action_List.Set_Capacity (1);
- Add_Action (Table.States (39), 33, (44, 0), 63);
- Table.States (39).Kernel := To_Vector ((((44, 0), 43, 2,
(2147483647, 0), 0), ((44, 1), 43, 5,
- (2147483647, 0), 0)));
- Table.States (39).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 0), 33, 63)));
+ Add_Action (Table.States (39), 35, (46, 0), 63);
+ Table.States (39).Kernel := To_Vector ((((46, 0), 45, 2, (32767,
0), 0), ((46, 1), 45, 5, (32767, 0),
+ 0)));
+ Table.States (39).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (46, 0), 35, 63)));
Table.States (40).Action_List.Set_Capacity (3);
- Add_Action (Table.States (40), (21, 27, 30), (69, 3), 1, null,
null);
- Table.States (40).Kernel := To_Vector ((0 => ((69, 3), 44, 0,
(69, 3), 1)));
- Table.States (40).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (69, 3), 1)));
+ Add_Action (Table.States (40), (23, 29, 32), (71, 3), 1);
+ Table.States (40).Kernel := To_Vector ((0 => ((71, 3), 46, 0,
(71, 3), 1)));
+ Table.States (40).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (71, 3), 1)));
Table.States (41).Action_List.Set_Capacity (3);
- Add_Action (Table.States (41), 21, Reduce, (70, 0), 1, null,
null);
- Add_Action (Table.States (41), 27, (56, 1), 64);
- Add_Action (Table.States (41), 30, Reduce, (70, 0), 1, null,
null);
- Table.States (41).Kernel := To_Vector ((((56, 1), 56, 1,
(2147483647, 0), 0), ((70, 0), 56, 0, (70,
- 0), 1)));
- Table.States (41).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (70, 0), 1)));
+ Add_Action (Table.States (41), 23, Reduce, (72, 0), 1);
+ Add_Action (Table.States (41), 29, (58, 1), 64);
+ Add_Action (Table.States (41), 32, Reduce, (72, 0), 1);
+ Table.States (41).Kernel := To_Vector ((((58, 1), 58, 1, (32767,
0), 0), ((72, 0), 58, 0, (72, 0),
+ 1)));
+ Table.States (41).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (72, 0), 1)));
Table.States (42).Action_List.Set_Capacity (3);
- Add_Action (Table.States (42), (21, 27, 30), (69, 2), 1, null,
null);
- Table.States (42).Kernel := To_Vector ((0 => ((69, 2), 57, 0,
(69, 2), 1)));
- Table.States (42).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (69, 2), 1)));
+ Add_Action (Table.States (42), (23, 29, 32), (71, 2), 1);
+ Table.States (42).Kernel := To_Vector ((0 => ((71, 2), 59, 0,
(71, 2), 1)));
+ Table.States (42).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (71, 2), 1)));
Table.States (43).Action_List.Set_Capacity (5);
- Add_Action (Table.States (43), (21, 27, 30, 31, 33), (59, 0), 1,
null, null);
- Table.States (43).Kernel := To_Vector ((0 => ((59, 0), 58, 0,
(59, 0), 1)));
- Table.States (43).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (59, 0), 1)));
+ Add_Action (Table.States (43), (23, 29, 32, 33, 35), (61, 0), 1);
+ Table.States (43).Kernel := To_Vector ((0 => ((61, 0), 60, 0,
(61, 0), 1)));
+ Table.States (43).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (61, 0), 1)));
Table.States (44).Action_List.Set_Capacity (5);
- Add_Action (Table.States (44), 21, Reduce, (69, 1), 1, null,
null);
- Add_Action (Table.States (44), 27, Reduce, (69, 1), 1, null,
null);
- Add_Action (Table.States (44), 30, Reduce, (69, 1), 1, null,
null);
- Add_Action (Table.States (44), 31, (59, 1), 65);
- Add_Action (Table.States (44), 33, Reduce, (43, 1), 1, null,
null);
- Table.States (44).Kernel := To_Vector ((((43, 1), 59, 0, (43,
1), 1), ((59, 1), 59, 2, (2147483647,
- 0), 0), ((69, 1), 59, 0, (69, 1), 1)));
- Table.States (44).Minimal_Complete_Actions := To_Vector (((Reduce,
(43, 1), 1), (Reduce, (69, 1), 1)));
+ Add_Action (Table.States (44), 23, Reduce, (71, 1), 1);
+ Add_Action (Table.States (44), 29, Reduce, (71, 1), 1);
+ Add_Action (Table.States (44), 32, Reduce, (71, 1), 1);
+ Add_Action (Table.States (44), 33, (61, 1), 65);
+ Add_Action (Table.States (44), 35, Reduce, (45, 1), 1);
+ Table.States (44).Kernel := To_Vector ((((45, 1), 61, 0, (45,
1), 1), ((61, 1), 61, 2, (32767, 0),
+ 0), ((71, 1), 61, 0, (71, 1), 1)));
+ Table.States (44).Minimal_Complete_Actions := To_Vector (((Reduce,
(45, 1), 1), (Reduce, (71, 1), 1)));
Table.States (45).Action_List.Set_Capacity (3);
- Add_Action (Table.States (45), (21, 27, 30), (71, 0), 1, null,
null);
- Table.States (45).Kernel := To_Vector ((0 => ((71, 0), 69, 0,
(71, 0), 1)));
- Table.States (45).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (71, 0), 1)));
+ Add_Action (Table.States (45), (23, 29, 32), (73, 0), 1);
+ Table.States (45).Kernel := To_Vector ((0 => ((73, 0), 71, 0,
(73, 0), 1)));
+ Table.States (45).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (73, 0), 1)));
Table.States (46).Action_List.Set_Capacity (2);
- Add_Action (Table.States (46), 21, (41, 0), 66);
- Add_Action (Table.States (46), 30, (70, 1), 67);
- Table.States (46).Kernel := To_Vector ((((41, 0), 70, 1,
(2147483647, 0), 0), ((70, 1), 70, 1,
- (2147483647, 0), 0)));
- Table.States (46).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (41, 0), 21, 66)));
+ Add_Action (Table.States (46), 23, (43, 0), 66);
+ Add_Action (Table.States (46), 32, (72, 1), 67);
+ Table.States (46).Kernel := To_Vector ((((43, 0), 72, 1, (32767,
0), 0), ((72, 1), 72, 1, (32767, 0),
+ 0)));
+ Table.States (46).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (43, 0), 23, 66)));
Table.States (47).Action_List.Set_Capacity (3);
- Add_Action (Table.States (47), (21, 27, 30), (56, 0), 1, null,
null);
- Table.States (47).Kernel := To_Vector ((0 => ((56, 0), 71, 0,
(56, 0), 1)));
- Table.States (47).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (56, 0), 1)));
+ Add_Action (Table.States (47), (23, 29, 32), (58, 0), 1);
+ Table.States (47).Kernel := To_Vector ((0 => ((58, 0), 73, 0,
(58, 0), 1)));
+ Table.States (47).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 0), 1)));
Table.States (48).Action_List.Set_Capacity (1);
- Add_Action (Table.States (48), 37, (44, 0), 68);
- Table.States (48).Kernel := To_Vector ((((44, 0), 33, 1,
(2147483647, 0), 0), ((44, 1), 33, 4,
- (2147483647, 0), 0)));
- Table.States (48).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 0), 37, 68)));
+ Add_Action (Table.States (48), 39, (46, 0), 68);
+ Table.States (48).Kernel := To_Vector ((((46, 0), 35, 1, (32767,
0), 0), ((46, 1), 35, 4, (32767, 0),
+ 0)));
+ Table.States (48).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (46, 0), 39, 68)));
Table.States (49).Action_List.Set_Capacity (11);
- Add_Action (Table.States (49), 10, (57, 0), 6);
- Add_Action (Table.States (49), 11, (57, 1), 7);
- Add_Action (Table.States (49), 14, (41, 0), 8);
- Add_Action (Table.States (49), 19, (43, 0), 9);
- Add_Action (Table.States (49), 27, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (49), 30, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (49), 31, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (49), 33, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (49), 34, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (49), 37, (58, 1), 10);
- Add_Action (Table.States (49), 38, (69, 0), 11);
+ Add_Action (Table.States (49), 12, (59, 0), 6);
+ Add_Action (Table.States (49), 13, (59, 1), 7);
+ Add_Action (Table.States (49), 16, (43, 0), 8);
+ Add_Action (Table.States (49), 21, (45, 0), 9);
+ Add_Action (Table.States (49), 29, Reduce, (60, 0), 0);
+ Add_Action (Table.States (49), 32, Reduce, (60, 0), 0);
+ Add_Action (Table.States (49), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (49), 35, Reduce, (60, 0), 0);
+ Add_Action (Table.States (49), 36, Reduce, (60, 0), 0);
+ Add_Action (Table.States (49), 39, (60, 1), 10);
+ Add_Action (Table.States (49), 40, (71, 0), 11);
Table.States (49).Goto_List.Set_Capacity (8);
- Add_Goto (Table.States (49), 41, 12);
- Add_Goto (Table.States (49), 43, 13);
- Add_Goto (Table.States (49), 44, 14);
- Add_Goto (Table.States (49), 57, 16);
- Add_Goto (Table.States (49), 58, 17);
- Add_Goto (Table.States (49), 59, 18);
- Add_Goto (Table.States (49), 69, 19);
- Add_Goto (Table.States (49), 71, 69);
- Table.States (49).Kernel := To_Vector ((0 => ((56, 1), 27, 0,
(71, 0), 1)));
- Table.States (49).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (71, 0), 1)));
+ Add_Goto (Table.States (49), 43, 12);
+ Add_Goto (Table.States (49), 45, 13);
+ Add_Goto (Table.States (49), 46, 14);
+ Add_Goto (Table.States (49), 59, 16);
+ Add_Goto (Table.States (49), 60, 17);
+ Add_Goto (Table.States (49), 61, 18);
+ Add_Goto (Table.States (49), 71, 19);
+ Add_Goto (Table.States (49), 73, 69);
+ Table.States (49).Kernel := To_Vector ((0 => ((58, 1), 29, 0,
(73, 0), 0)));
+ Table.States (49).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (73, 0), 0)));
+ end Subr_1;
+ procedure Subr_2
+ is begin
Table.States (50).Action_List.Set_Capacity (1);
- Add_Action (Table.States (50), 37, (59, 1), 70);
- Table.States (50).Kernel := To_Vector ((0 => ((59, 1), 31, 1,
(2147483647, 0), 0)));
- Table.States (50).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (59, 1), 37, 70)));
+ Add_Action (Table.States (50), 39, (61, 1), 70);
+ Table.States (50).Kernel := To_Vector ((0 => ((61, 1), 33, 1,
(32767, 0), 0)));
+ Table.States (50).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (61, 1), 39, 70)));
Table.States (51).Action_List.Set_Capacity (11);
- Add_Action (Table.States (51), 10, (57, 0), 6);
- Add_Action (Table.States (51), 11, (57, 1), 7);
- Add_Action (Table.States (51), 14, (41, 0), 8);
- Add_Action (Table.States (51), 19, (43, 0), 9);
- Add_Action (Table.States (51), 27, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (51), 30, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (51), 31, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (51), 33, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (51), 34, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (51), 37, (58, 1), 10);
- Add_Action (Table.States (51), 38, (69, 0), 11);
+ Add_Action (Table.States (51), 12, (59, 0), 6);
+ Add_Action (Table.States (51), 13, (59, 1), 7);
+ Add_Action (Table.States (51), 16, (43, 0), 8);
+ Add_Action (Table.States (51), 21, (45, 0), 9);
+ Add_Action (Table.States (51), 29, Reduce, (60, 0), 0);
+ Add_Action (Table.States (51), 32, Reduce, (60, 0), 0);
+ Add_Action (Table.States (51), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (51), 35, Reduce, (60, 0), 0);
+ Add_Action (Table.States (51), 36, Reduce, (60, 0), 0);
+ Add_Action (Table.States (51), 39, (60, 1), 10);
+ Add_Action (Table.States (51), 40, (71, 0), 11);
Table.States (51).Goto_List.Set_Capacity (9);
- Add_Goto (Table.States (51), 41, 12);
- Add_Goto (Table.States (51), 43, 13);
- Add_Goto (Table.States (51), 44, 14);
- Add_Goto (Table.States (51), 56, 71);
- Add_Goto (Table.States (51), 57, 16);
- Add_Goto (Table.States (51), 58, 17);
- Add_Goto (Table.States (51), 59, 18);
- Add_Goto (Table.States (51), 69, 19);
- Add_Goto (Table.States (51), 71, 21);
- Table.States (51).Kernel := To_Vector ((0 => ((70, 1), 30, 0,
(56, 1), 3)));
- Table.States (51).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (56, 1), 3)));
+ Add_Goto (Table.States (51), 43, 12);
+ Add_Goto (Table.States (51), 45, 13);
+ Add_Goto (Table.States (51), 46, 14);
+ Add_Goto (Table.States (51), 58, 71);
+ Add_Goto (Table.States (51), 59, 16);
+ Add_Goto (Table.States (51), 60, 17);
+ Add_Goto (Table.States (51), 61, 18);
+ Add_Goto (Table.States (51), 71, 19);
+ Add_Goto (Table.States (51), 73, 21);
+ Table.States (51).Kernel := To_Vector ((0 => ((72, 1), 32, 0,
(58, 1), 0)));
+ Table.States (51).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 1), 0)));
Table.States (52).Action_List.Set_Capacity (8);
- Add_Action (Table.States (52), (3, 5, 7, 15, 19, 22, 26, 39), (73,
0), 3, null, null);
- Table.States (52).Kernel := To_Vector ((0 => ((73, 0), 34, 0,
(73, 0), 3)));
- Table.States (52).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (73, 0), 3)));
+ Add_Action (Table.States (52), (5, 7, 9, 17, 21, 24, 28, 41), (75,
0), 3);
+ Table.States (52).Kernel := To_Vector ((0 => ((75, 0), 36, 0,
(75, 0), 3)));
+ Table.States (52).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (75, 0), 3)));
Table.States (53).Action_List.Set_Capacity (2);
- Add_Action (Table.States (53), (19, 39), (66, 4), 2, null, null);
- Table.States (53).Kernel := To_Vector ((0 => ((66, 4), 15, 0,
(66, 4), 2)));
- Table.States (53).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (66, 4), 2)));
+ Add_Action (Table.States (53), (21, 41), (68, 4), 2);
+ Table.States (53).Kernel := To_Vector ((0 => ((68, 4), 17, 0,
(68, 4), 2)));
+ Table.States (53).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (68, 4), 2)));
Table.States (54).Action_List.Set_Capacity (3);
- Add_Action (Table.States (54), 9, Reduce, (58, 0), 0, null, null);
- Add_Action (Table.States (54), 13, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (54), 37, (58, 1), 72);
+ Add_Action (Table.States (54), 11, Reduce, (60, 0), 0);
+ Add_Action (Table.States (54), 15, Reduce, (60, 0), 0);
+ Add_Action (Table.States (54), 39, (60, 1), 72);
Table.States (54).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (54), 58, 73);
- Table.States (54).Kernel := To_Vector ((((65, 0), 19, 5,
(2147483647, 0), 0), ((68, 0), 19, 3,
- (2147483647, 0), 0)));
- Table.States (54).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 0), 0)));
+ Add_Goto (Table.States (54), 60, 73);
+ Table.States (54).Kernel := To_Vector ((((67, 0), 21, 5, (32767,
0), 0), ((70, 0), 21, 3, (32767, 0),
+ 0)));
+ Table.States (54).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (60, 0), 0)));
Table.States (55).Action_List.Set_Capacity (1);
- Add_Action (Table.States (55), (1 => 39), (48, 0), 3,
compilation_unit_0'Access, null);
- Table.States (55).Kernel := To_Vector ((0 => ((48, 0), 64, 0,
(48, 0), 3)));
- Table.States (55).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (48, 0), 3)));
+ Add_Action (Table.States (55), (1 => 41), (50, 0), 3);
+ Table.States (55).Kernel := To_Vector ((0 => ((50, 0), 66, 0,
(50, 0), 3)));
+ Table.States (55).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (50, 0), 3)));
Table.States (56).Action_List.Set_Capacity (1);
- Add_Action (Table.States (56), (1 => 39), (64, 2), 1, null,
null);
- Table.States (56).Kernel := To_Vector ((0 => ((64, 2), 65, 0,
(64, 2), 1)));
- Table.States (56).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (64, 2), 1)));
+ Add_Action (Table.States (56), (1 => 41), (66, 2), 1);
+ Table.States (56).Kernel := To_Vector ((0 => ((66, 2), 67, 0,
(66, 2), 1)));
+ Table.States (56).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (66, 2), 1)));
Table.States (57).Action_List.Set_Capacity (1);
- Add_Action (Table.States (57), (1 => 39), (64, 1), 1, null,
null);
- Table.States (57).Kernel := To_Vector ((0 => ((64, 1), 68, 0,
(64, 1), 1)));
- Table.States (57).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (64, 1), 1)));
+ Add_Action (Table.States (57), (1 => 41), (66, 1), 1);
+ Table.States (57).Kernel := To_Vector ((0 => ((66, 1), 70, 0,
(66, 1), 1)));
+ Table.States (57).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (66, 1), 1)));
Table.States (58).Action_List.Set_Capacity (11);
- Add_Action (Table.States (58), 10, (57, 0), 32);
- Add_Action (Table.States (58), 11, (57, 1), 33);
- Add_Action (Table.States (58), 14, (41, 0), 34);
- Add_Action (Table.States (58), 19, (43, 0), 9);
- Add_Action (Table.States (58), 21, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (58), 27, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (58), 30, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (58), 31, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (58), 33, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (58), 37, (58, 1), 36);
- Add_Action (Table.States (58), 38, (69, 0), 37);
+ Add_Action (Table.States (58), 12, (59, 0), 32);
+ Add_Action (Table.States (58), 13, (59, 1), 33);
+ Add_Action (Table.States (58), 16, (43, 0), 34);
+ Add_Action (Table.States (58), 21, (45, 0), 9);
+ Add_Action (Table.States (58), 23, Reduce, (60, 0), 0);
+ Add_Action (Table.States (58), 29, Reduce, (60, 0), 0);
+ Add_Action (Table.States (58), 32, Reduce, (60, 0), 0);
+ Add_Action (Table.States (58), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (58), 35, Reduce, (60, 0), 0);
+ Add_Action (Table.States (58), 39, (60, 1), 36);
+ Add_Action (Table.States (58), 40, (71, 0), 37);
Table.States (58).Goto_List.Set_Capacity (10);
- Add_Goto (Table.States (58), 41, 38);
- Add_Goto (Table.States (58), 43, 39);
- Add_Goto (Table.States (58), 44, 40);
- Add_Goto (Table.States (58), 56, 41);
- Add_Goto (Table.States (58), 57, 42);
- Add_Goto (Table.States (58), 58, 43);
- Add_Goto (Table.States (58), 59, 44);
- Add_Goto (Table.States (58), 69, 45);
- Add_Goto (Table.States (58), 70, 62);
- Add_Goto (Table.States (58), 71, 47);
- Table.States (58).Kernel := To_Vector ((0 => ((41, 0), 14, 1,
(2147483647, 0), 0)));
- Table.States (58).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (70, 0), 0)));
+ Add_Goto (Table.States (58), 43, 38);
+ Add_Goto (Table.States (58), 45, 39);
+ Add_Goto (Table.States (58), 46, 40);
+ Add_Goto (Table.States (58), 58, 41);
+ Add_Goto (Table.States (58), 59, 42);
+ Add_Goto (Table.States (58), 60, 43);
+ Add_Goto (Table.States (58), 61, 44);
+ Add_Goto (Table.States (58), 71, 45);
+ Add_Goto (Table.States (58), 72, 62);
+ Add_Goto (Table.States (58), 73, 47);
+ Table.States (58).Kernel := To_Vector ((0 => ((43, 0), 16, 1,
(32767, 0), 0)));
+ Table.States (58).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (72, 0), 0)));
Table.States (59).Action_List.Set_Capacity (3);
- Add_Action (Table.States (59), (21, 27, 30), (57, 0), 2, null,
null);
- Table.States (59).Kernel := To_Vector ((0 => ((57, 0), 41, 0,
(57, 0), 2)));
- Table.States (59).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (57, 0), 2)));
+ Add_Action (Table.States (59), (23, 29, 32), (59, 0), 2);
+ Table.States (59).Kernel := To_Vector ((0 => ((59, 0), 43, 0,
(59, 0), 2)));
+ Table.States (59).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (59, 0), 2)));
Table.States (60).Action_List.Set_Capacity (3);
- Add_Action (Table.States (60), (21, 27, 30), (57, 1), 2, null,
null);
- Table.States (60).Kernel := To_Vector ((0 => ((57, 1), 41, 0,
(57, 1), 2)));
- Table.States (60).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (57, 1), 2)));
+ Add_Action (Table.States (60), (23, 29, 32), (59, 1), 2);
+ Table.States (60).Kernel := To_Vector ((0 => ((59, 1), 43, 0,
(59, 1), 2)));
+ Table.States (60).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (59, 1), 2)));
Table.States (61).Action_List.Set_Capacity (3);
- Add_Action (Table.States (61), (21, 27, 30), (71, 1), 2, null,
null);
- Table.States (61).Kernel := To_Vector ((0 => ((71, 1), 21, 0,
(71, 1), 2)));
- Table.States (61).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (71, 1), 2)));
+ Add_Action (Table.States (61), (23, 29, 32), (73, 1), 2);
+ Table.States (61).Kernel := To_Vector ((0 => ((73, 1), 23, 0,
(73, 1), 2)));
+ Table.States (61).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (73, 1), 2)));
Table.States (62).Action_List.Set_Capacity (2);
- Add_Action (Table.States (62), 21, (41, 0), 74);
- Add_Action (Table.States (62), 30, (70, 1), 67);
- Table.States (62).Kernel := To_Vector ((((41, 0), 70, 1,
(2147483647, 0), 0), ((70, 1), 70, 1,
- (2147483647, 0), 0)));
- Table.States (62).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (41, 0), 21, 74)));
+ Add_Action (Table.States (62), 23, (43, 0), 74);
+ Add_Action (Table.States (62), 32, (72, 1), 67);
+ Table.States (62).Kernel := To_Vector ((((43, 0), 72, 1, (32767,
0), 0), ((72, 1), 72, 1, (32767, 0),
+ 0)));
+ Table.States (62).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (43, 0), 23, 74)));
Table.States (63).Action_List.Set_Capacity (1);
- Add_Action (Table.States (63), 37, (44, 0), 75);
- Table.States (63).Kernel := To_Vector ((((44, 0), 33, 1,
(2147483647, 0), 0), ((44, 1), 33, 4,
- (2147483647, 0), 0)));
- Table.States (63).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 0), 37, 75)));
+ Add_Action (Table.States (63), 39, (46, 0), 75);
+ Table.States (63).Kernel := To_Vector ((((46, 0), 35, 1, (32767,
0), 0), ((46, 1), 35, 4, (32767, 0),
+ 0)));
+ Table.States (63).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (46, 0), 39, 75)));
Table.States (64).Action_List.Set_Capacity (11);
- Add_Action (Table.States (64), 10, (57, 0), 32);
- Add_Action (Table.States (64), 11, (57, 1), 33);
- Add_Action (Table.States (64), 14, (41, 0), 34);
- Add_Action (Table.States (64), 19, (43, 0), 9);
- Add_Action (Table.States (64), 21, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (64), 27, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (64), 30, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (64), 31, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (64), 33, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (64), 37, (58, 1), 36);
- Add_Action (Table.States (64), 38, (69, 0), 37);
+ Add_Action (Table.States (64), 12, (59, 0), 32);
+ Add_Action (Table.States (64), 13, (59, 1), 33);
+ Add_Action (Table.States (64), 16, (43, 0), 34);
+ Add_Action (Table.States (64), 21, (45, 0), 9);
+ Add_Action (Table.States (64), 23, Reduce, (60, 0), 0);
+ Add_Action (Table.States (64), 29, Reduce, (60, 0), 0);
+ Add_Action (Table.States (64), 32, Reduce, (60, 0), 0);
+ Add_Action (Table.States (64), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (64), 35, Reduce, (60, 0), 0);
+ Add_Action (Table.States (64), 39, (60, 1), 36);
+ Add_Action (Table.States (64), 40, (71, 0), 37);
Table.States (64).Goto_List.Set_Capacity (8);
- Add_Goto (Table.States (64), 41, 38);
- Add_Goto (Table.States (64), 43, 39);
- Add_Goto (Table.States (64), 44, 40);
- Add_Goto (Table.States (64), 57, 42);
- Add_Goto (Table.States (64), 58, 43);
- Add_Goto (Table.States (64), 59, 44);
- Add_Goto (Table.States (64), 69, 45);
- Add_Goto (Table.States (64), 71, 76);
- Table.States (64).Kernel := To_Vector ((0 => ((56, 1), 27, 0,
(71, 0), 1)));
- Table.States (64).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (71, 0), 1)));
+ Add_Goto (Table.States (64), 43, 38);
+ Add_Goto (Table.States (64), 45, 39);
+ Add_Goto (Table.States (64), 46, 40);
+ Add_Goto (Table.States (64), 59, 42);
+ Add_Goto (Table.States (64), 60, 43);
+ Add_Goto (Table.States (64), 61, 44);
+ Add_Goto (Table.States (64), 71, 45);
+ Add_Goto (Table.States (64), 73, 76);
+ Table.States (64).Kernel := To_Vector ((0 => ((58, 1), 29, 0,
(73, 0), 0)));
+ Table.States (64).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (73, 0), 0)));
Table.States (65).Action_List.Set_Capacity (1);
- Add_Action (Table.States (65), 37, (59, 1), 77);
- Table.States (65).Kernel := To_Vector ((0 => ((59, 1), 31, 1,
(2147483647, 0), 0)));
- Table.States (65).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (59, 1), 37, 77)));
+ Add_Action (Table.States (65), 39, (61, 1), 77);
+ Table.States (65).Kernel := To_Vector ((0 => ((61, 1), 33, 1,
(32767, 0), 0)));
+ Table.States (65).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (61, 1), 39, 77)));
Table.States (66).Action_List.Set_Capacity (3);
- Add_Action (Table.States (66), (27, 30, 34), (41, 0), 3,
aggregate_g_0'Access, null);
- Table.States (66).Kernel := To_Vector ((0 => ((41, 0), 21, 0,
(41, 0), 3)));
- Table.States (66).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (41, 0), 3)));
+ Add_Action (Table.States (66), (29, 32, 36), (43, 0), 3);
+ Table.States (66).Kernel := To_Vector ((0 => ((43, 0), 23, 0,
(43, 0), 3)));
+ Table.States (66).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (43, 0), 3)));
Table.States (67).Action_List.Set_Capacity (11);
- Add_Action (Table.States (67), 10, (57, 0), 32);
- Add_Action (Table.States (67), 11, (57, 1), 33);
- Add_Action (Table.States (67), 14, (41, 0), 34);
- Add_Action (Table.States (67), 19, (43, 0), 9);
- Add_Action (Table.States (67), 21, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (67), 27, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (67), 30, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (67), 31, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (67), 33, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (67), 37, (58, 1), 36);
- Add_Action (Table.States (67), 38, (69, 0), 37);
+ Add_Action (Table.States (67), 12, (59, 0), 32);
+ Add_Action (Table.States (67), 13, (59, 1), 33);
+ Add_Action (Table.States (67), 16, (43, 0), 34);
+ Add_Action (Table.States (67), 21, (45, 0), 9);
+ Add_Action (Table.States (67), 23, Reduce, (60, 0), 0);
+ Add_Action (Table.States (67), 29, Reduce, (60, 0), 0);
+ Add_Action (Table.States (67), 32, Reduce, (60, 0), 0);
+ Add_Action (Table.States (67), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (67), 35, Reduce, (60, 0), 0);
+ Add_Action (Table.States (67), 39, (60, 1), 36);
+ Add_Action (Table.States (67), 40, (71, 0), 37);
Table.States (67).Goto_List.Set_Capacity (9);
- Add_Goto (Table.States (67), 41, 38);
- Add_Goto (Table.States (67), 43, 39);
- Add_Goto (Table.States (67), 44, 40);
- Add_Goto (Table.States (67), 56, 78);
- Add_Goto (Table.States (67), 57, 42);
- Add_Goto (Table.States (67), 58, 43);
- Add_Goto (Table.States (67), 59, 44);
- Add_Goto (Table.States (67), 69, 45);
- Add_Goto (Table.States (67), 71, 47);
- Table.States (67).Kernel := To_Vector ((0 => ((70, 1), 30, 0,
(56, 1), 3)));
- Table.States (67).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (56, 1), 3)));
+ Add_Goto (Table.States (67), 43, 38);
+ Add_Goto (Table.States (67), 45, 39);
+ Add_Goto (Table.States (67), 46, 40);
+ Add_Goto (Table.States (67), 58, 78);
+ Add_Goto (Table.States (67), 59, 42);
+ Add_Goto (Table.States (67), 60, 43);
+ Add_Goto (Table.States (67), 61, 44);
+ Add_Goto (Table.States (67), 71, 45);
+ Add_Goto (Table.States (67), 73, 47);
+ Table.States (67).Kernel := To_Vector ((0 => ((72, 1), 32, 0,
(58, 1), 0)));
+ Table.States (67).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 1), 0)));
Table.States (68).Action_List.Set_Capacity (4);
- Add_Action (Table.States (68), 14, (44, 1), 79);
- Add_Action (Table.States (68), 27, Reduce, (44, 0), 3, null,
null);
- Add_Action (Table.States (68), 30, Reduce, (44, 0), 3, null,
null);
- Add_Action (Table.States (68), 34, Reduce, (44, 0), 3, null,
null);
- Table.States (68).Kernel := To_Vector ((((44, 0), 37, 0, (44,
0), 3), ((44, 1), 37, 3, (2147483647,
- 0), 0)));
- Table.States (68).Minimal_Complete_Actions := To_Vector (((Reduce,
(44, 0), 3), (Shift, (44, 1), 14,
+ Add_Action (Table.States (68), 16, (46, 1), 79);
+ Add_Action (Table.States (68), 29, Reduce, (46, 0), 3);
+ Add_Action (Table.States (68), 32, Reduce, (46, 0), 3);
+ Add_Action (Table.States (68), 36, Reduce, (46, 0), 3);
+ Table.States (68).Kernel := To_Vector ((((46, 0), 39, 0, (46,
0), 3), ((46, 1), 39, 3, (32767, 0),
+ 0)));
+ Table.States (68).Minimal_Complete_Actions := To_Vector (((Reduce,
(46, 0), 3), (Shift, (46, 1), 16,
79)));
Table.States (69).Action_List.Set_Capacity (3);
- Add_Action (Table.States (69), (27, 30, 34), (56, 1), 3, null,
null);
- Table.States (69).Kernel := To_Vector ((0 => ((56, 1), 71, 0,
(56, 1), 3)));
- Table.States (69).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (56, 1), 3)));
+ Add_Action (Table.States (69), (29, 32, 36), (58, 1), 3);
+ Table.States (69).Kernel := To_Vector ((0 => ((58, 1), 73, 0,
(58, 1), 3)));
+ Table.States (69).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 1), 3)));
Table.States (70).Action_List.Set_Capacity (5);
- Add_Action (Table.States (70), (27, 30, 31, 33, 34), (59, 1), 3,
null, null);
- Table.States (70).Kernel := To_Vector ((0 => ((59, 1), 37, 0,
(59, 1), 3)));
- Table.States (70).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (59, 1), 3)));
+ Add_Action (Table.States (70), (29, 32, 33, 35, 36), (61, 1), 3);
+ Table.States (70).Kernel := To_Vector ((0 => ((61, 1), 39, 0,
(61, 1), 3)));
+ Table.States (70).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (61, 1), 3)));
Table.States (71).Action_List.Set_Capacity (3);
- Add_Action (Table.States (71), 27, (56, 1), 49);
- Add_Action (Table.States (71), 30, Reduce, (70, 1), 3, null,
null);
- Add_Action (Table.States (71), 34, Reduce, (70, 1), 3, null,
null);
- Table.States (71).Kernel := To_Vector ((((56, 1), 56, 1,
(2147483647, 0), 0), ((70, 1), 56, 0, (70,
- 1), 3)));
- Table.States (71).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (70, 1), 3)));
+ Add_Action (Table.States (71), 29, (58, 1), 49);
+ Add_Action (Table.States (71), 32, Reduce, (72, 1), 3);
+ Add_Action (Table.States (71), 36, Reduce, (72, 1), 3);
+ Table.States (71).Kernel := To_Vector ((((58, 1), 58, 1, (32767,
0), 0), ((72, 1), 58, 0, (72, 1),
+ 3)));
+ Table.States (71).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (72, 1), 3)));
Table.States (72).Action_List.Set_Capacity (2);
- Add_Action (Table.States (72), (9, 13), (58, 1), 1, null,
identifier_opt_1_check'Access);
- Table.States (72).Kernel := To_Vector ((0 => ((58, 1), 37, 0,
(58, 1), 1)));
- Table.States (72).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 1), 1)));
+ Add_Action (Table.States (72), (11, 15), (60, 1), 1);
+ Table.States (72).Kernel := To_Vector ((0 => ((60, 1), 39, 0,
(60, 1), 1)));
+ Table.States (72).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (60, 1), 1)));
Table.States (73).Action_List.Set_Capacity (2);
- Add_Action (Table.States (73), 9, (65, 0), 80);
- Add_Action (Table.States (73), 13, (68, 0), 81);
- Table.States (73).Kernel := To_Vector ((((65, 0), 58, 5,
(2147483647, 0), 0), ((68, 0), 58, 3,
- (2147483647, 0), 0)));
- Table.States (73).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (68, 0), 13, 81)));
+ Add_Action (Table.States (73), 11, (67, 0), 80);
+ Add_Action (Table.States (73), 15, (70, 0), 81);
+ Table.States (73).Kernel := To_Vector ((((67, 0), 60, 5, (32767,
0), 0), ((70, 0), 60, 3, (32767, 0),
+ 0)));
+ Table.States (73).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (70, 0), 15, 81)));
Table.States (74).Action_List.Set_Capacity (3);
- Add_Action (Table.States (74), (21, 27, 30), (41, 0), 3,
aggregate_g_0'Access, null);
- Table.States (74).Kernel := To_Vector ((0 => ((41, 0), 21, 0,
(41, 0), 3)));
- Table.States (74).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (41, 0), 3)));
+ Add_Action (Table.States (74), (23, 29, 32), (43, 0), 3);
+ Table.States (74).Kernel := To_Vector ((0 => ((43, 0), 23, 0,
(43, 0), 3)));
+ Table.States (74).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (43, 0), 3)));
Table.States (75).Action_List.Set_Capacity (4);
- Add_Action (Table.States (75), 14, (44, 1), 82);
- Add_Action (Table.States (75), 21, Reduce, (44, 0), 3, null,
null);
- Add_Action (Table.States (75), 27, Reduce, (44, 0), 3, null,
null);
- Add_Action (Table.States (75), 30, Reduce, (44, 0), 3, null,
null);
- Table.States (75).Kernel := To_Vector ((((44, 0), 37, 0, (44,
0), 3), ((44, 1), 37, 3, (2147483647,
- 0), 0)));
- Table.States (75).Minimal_Complete_Actions := To_Vector (((Reduce,
(44, 0), 3), (Shift, (44, 1), 14,
+ Add_Action (Table.States (75), 16, (46, 1), 82);
+ Add_Action (Table.States (75), 23, Reduce, (46, 0), 3);
+ Add_Action (Table.States (75), 29, Reduce, (46, 0), 3);
+ Add_Action (Table.States (75), 32, Reduce, (46, 0), 3);
+ Table.States (75).Kernel := To_Vector ((((46, 0), 39, 0, (46,
0), 3), ((46, 1), 39, 3, (32767, 0),
+ 0)));
+ Table.States (75).Minimal_Complete_Actions := To_Vector (((Reduce,
(46, 0), 3), (Shift, (46, 1), 16,
82)));
Table.States (76).Action_List.Set_Capacity (3);
- Add_Action (Table.States (76), (21, 27, 30), (56, 1), 3, null,
null);
- Table.States (76).Kernel := To_Vector ((0 => ((56, 1), 71, 0,
(56, 1), 3)));
- Table.States (76).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (56, 1), 3)));
+ Add_Action (Table.States (76), (23, 29, 32), (58, 1), 3);
+ Table.States (76).Kernel := To_Vector ((0 => ((58, 1), 73, 0,
(58, 1), 3)));
+ Table.States (76).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 1), 3)));
Table.States (77).Action_List.Set_Capacity (5);
- Add_Action (Table.States (77), (21, 27, 30, 31, 33), (59, 1), 3,
null, null);
- Table.States (77).Kernel := To_Vector ((0 => ((59, 1), 37, 0,
(59, 1), 3)));
- Table.States (77).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (59, 1), 3)));
+ Add_Action (Table.States (77), (23, 29, 32, 33, 35), (61, 1), 3);
+ Table.States (77).Kernel := To_Vector ((0 => ((61, 1), 39, 0,
(61, 1), 3)));
+ Table.States (77).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (61, 1), 3)));
Table.States (78).Action_List.Set_Capacity (3);
- Add_Action (Table.States (78), 21, Reduce, (70, 1), 3, null,
null);
- Add_Action (Table.States (78), 27, (56, 1), 64);
- Add_Action (Table.States (78), 30, Reduce, (70, 1), 3, null,
null);
- Table.States (78).Kernel := To_Vector ((((56, 1), 56, 1,
(2147483647, 0), 0), ((70, 1), 56, 0, (70,
- 1), 3)));
- Table.States (78).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (70, 1), 3)));
+ Add_Action (Table.States (78), 23, Reduce, (72, 1), 3);
+ Add_Action (Table.States (78), 29, (58, 1), 64);
+ Add_Action (Table.States (78), 32, Reduce, (72, 1), 3);
+ Table.States (78).Kernel := To_Vector ((((58, 1), 58, 1, (32767,
0), 0), ((72, 1), 58, 0, (72, 1),
+ 3)));
+ Table.States (78).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (72, 1), 3)));
Table.States (79).Action_List.Set_Capacity (1);
- Add_Action (Table.States (79), 38, (44, 1), 83);
- Table.States (79).Kernel := To_Vector ((0 => ((44, 1), 14, 2,
(2147483647, 0), 0)));
- Table.States (79).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 1), 38, 83)));
+ Add_Action (Table.States (79), 40, (46, 1), 83);
+ Table.States (79).Kernel := To_Vector ((0 => ((46, 1), 16, 2,
(32767, 0), 0)));
+ Table.States (79).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (46, 1), 40, 83)));
Table.States (80).Action_List.Set_Capacity (1);
- Add_Action (Table.States (80), 38, (65, 0), 84);
- Table.States (80).Kernel := To_Vector ((0 => ((65, 0), 9, 4,
(2147483647, 0), 0)));
- Table.States (80).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (65, 0), 38, 84)));
+ Add_Action (Table.States (80), 40, (67, 0), 84);
+ Table.States (80).Kernel := To_Vector ((0 => ((67, 0), 11, 4,
(32767, 0), 0)));
+ Table.States (80).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (67, 0), 40, 84)));
Table.States (81).Action_List.Set_Capacity (7);
- Add_Action (Table.States (81), 6, (45, 0), 85);
- Add_Action (Table.States (81), 8, Reduce, (53, 0), 0, null, null);
- Add_Action (Table.States (81), 12, (42, 0), 86);
- Add_Action (Table.States (81), 16, (67, 4), 87);
- Add_Action (Table.States (81), 18, (61, 0), 88);
- Add_Action (Table.States (81), 23, (72, 0), 89);
- Add_Action (Table.States (81), 37, (67, 0), 90);
+ Add_Action (Table.States (81), 8, (47, 0), 85);
+ Add_Action (Table.States (81), 10, Reduce, (55, 0), 0);
+ Add_Action (Table.States (81), 14, (44, 0), 86);
+ Add_Action (Table.States (81), 18, (69, 4), 87);
+ Add_Action (Table.States (81), 20, (63, 0), 88);
+ Add_Action (Table.States (81), 25, (74, 0), 89);
+ Add_Action (Table.States (81), 39, (69, 0), 90);
Table.States (81).Goto_List.Set_Capacity (11);
- Add_Goto (Table.States (81), 42, 91);
- Add_Goto (Table.States (81), 45, 92);
- Add_Goto (Table.States (81), 51, 93);
- Add_Goto (Table.States (81), 52, 94);
- Add_Goto (Table.States (81), 53, 95);
- Add_Goto (Table.States (81), 60, 96);
- Add_Goto (Table.States (81), 61, 97);
- Add_Goto (Table.States (81), 62, 98);
- Add_Goto (Table.States (81), 63, 99);
- Add_Goto (Table.States (81), 67, 100);
- Add_Goto (Table.States (81), 72, 101);
- Table.States (81).Kernel := To_Vector ((0 => ((68, 0), 13, 2,
(2147483647, 0), 0)));
- Table.States (81).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (53, 0), 0)));
+ Add_Goto (Table.States (81), 44, 91);
+ Add_Goto (Table.States (81), 47, 92);
+ Add_Goto (Table.States (81), 53, 93);
+ Add_Goto (Table.States (81), 54, 94);
+ Add_Goto (Table.States (81), 55, 95);
+ Add_Goto (Table.States (81), 62, 96);
+ Add_Goto (Table.States (81), 63, 97);
+ Add_Goto (Table.States (81), 64, 98);
+ Add_Goto (Table.States (81), 65, 99);
+ Add_Goto (Table.States (81), 69, 100);
+ Add_Goto (Table.States (81), 74, 101);
+ Table.States (81).Kernel := To_Vector ((0 => ((70, 0), 15, 2,
(32767, 0), 0)));
+ Table.States (81).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (55, 0), 0)));
Table.States (82).Action_List.Set_Capacity (1);
- Add_Action (Table.States (82), 38, (44, 1), 102);
- Table.States (82).Kernel := To_Vector ((0 => ((44, 1), 14, 2,
(2147483647, 0), 0)));
- Table.States (82).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 1), 38, 102)));
+ Add_Action (Table.States (82), 40, (46, 1), 102);
+ Table.States (82).Kernel := To_Vector ((0 => ((46, 1), 16, 2,
(32767, 0), 0)));
+ Table.States (82).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (46, 1), 40, 102)));
Table.States (83).Action_List.Set_Capacity (1);
- Add_Action (Table.States (83), 21, (44, 1), 103);
- Table.States (83).Kernel := To_Vector ((0 => ((44, 1), 38, 1,
(2147483647, 0), 0)));
- Table.States (83).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 1), 21, 103)));
+ Add_Action (Table.States (83), 23, (46, 1), 103);
+ Table.States (83).Kernel := To_Vector ((0 => ((46, 1), 40, 1,
(32767, 0), 0)));
+ Table.States (83).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (46, 1), 23, 103)));
Table.States (84).Action_List.Set_Capacity (1);
- Add_Action (Table.States (84), 13, (65, 0), 104);
- Table.States (84).Kernel := To_Vector ((0 => ((65, 0), 38, 3,
(2147483647, 0), 0)));
- Table.States (84).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (65, 0), 13, 104)));
+ Add_Action (Table.States (84), 15, (67, 0), 104);
+ Table.States (84).Kernel := To_Vector ((0 => ((67, 0), 40, 3,
(32767, 0), 0)));
+ Table.States (84).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (67, 0), 15, 104)));
Table.States (85).Action_List.Set_Capacity (3);
- Add_Action (Table.States (85), 13, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (85), 31, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (85), 37, (58, 1), 105);
+ Add_Action (Table.States (85), 15, Reduce, (60, 0), 0);
+ Add_Action (Table.States (85), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (85), 39, (60, 1), 105);
Table.States (85).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (85), 58, 106);
- Add_Goto (Table.States (85), 59, 107);
- Table.States (85).Kernel := To_Vector ((0 => ((45, 0), 6, 4,
(2147483647, 0), 0)));
- Table.States (85).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (59, 0), 0)));
+ Add_Goto (Table.States (85), 60, 106);
+ Add_Goto (Table.States (85), 61, 107);
+ Table.States (85).Kernel := To_Vector ((0 => ((47, 0), 8, 4,
(32767, 0), 0)));
+ Table.States (85).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (61, 0), 0)));
Table.States (86).Action_List.Set_Capacity (2);
- Add_Action (Table.States (86), 10, (42, 3), 108);
- Add_Action (Table.States (86), 37, (42, 0), 109);
- Table.States (86).Kernel := To_Vector ((((42, 0), 12, 3,
(2147483647, 0), 0), ((42, 1), 12, 5,
- (2147483647, 0), 0), ((42, 2), 12, 7, (2147483647, 0), 0),
((42, 3), 12, 6, (2147483647, 0), 0)));
- Table.States (86).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (42, 0), 37, 109)));
+ Add_Action (Table.States (86), 12, (44, 3), 108);
+ Add_Action (Table.States (86), 39, (44, 0), 109);
+ Table.States (86).Kernel := To_Vector ((((44, 0), 14, 3, (32767,
0), 0), ((44, 1), 14, 5, (32767, 0),
+ 0), ((44, 2), 14, 7, (32767, 0), 0), ((44, 3), 14, 6, (32767,
0), 0)));
+ Table.States (86).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 0), 39, 109)));
Table.States (87).Action_List.Set_Capacity (1);
- Add_Action (Table.States (87), 34, (67, 4), 110);
- Table.States (87).Kernel := To_Vector ((0 => ((67, 4), 16, 1,
(2147483647, 0), 0)));
- Table.States (87).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (67, 4), 34, 110)));
+ Add_Action (Table.States (87), 36, (69, 4), 110);
+ Table.States (87).Kernel := To_Vector ((0 => ((69, 4), 18, 1,
(32767, 0), 0)));
+ Table.States (87).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (69, 4), 36, 110)));
Table.States (88).Action_List.Set_Capacity (4);
- Add_Action (Table.States (88), 9, Reduce, (58, 0), 0, null, null);
- Add_Action (Table.States (88), 13, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (88), 20, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (88), 37, (58, 1), 111);
+ Add_Action (Table.States (88), 11, Reduce, (60, 0), 0);
+ Add_Action (Table.States (88), 15, Reduce, (60, 0), 0);
+ Add_Action (Table.States (88), 22, Reduce, (60, 0), 0);
+ Add_Action (Table.States (88), 39, (60, 1), 111);
Table.States (88).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (88), 58, 112);
- Table.States (88).Kernel := To_Vector ((((61, 0), 18, 3,
(2147483647, 0), 0), ((62, 0), 18, 4,
- (2147483647, 0), 0), ((63, 0), 18, 2, (2147483647, 0), 0)));
- Table.States (88).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 0), 0)));
+ Add_Goto (Table.States (88), 60, 112);
+ Table.States (88).Kernel := To_Vector ((((63, 0), 20, 3, (32767,
0), 0), ((64, 0), 20, 4, (32767, 0),
+ 0), ((65, 0), 20, 2, (32767, 0), 0)));
+ Table.States (88).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (60, 0), 0)));
Table.States (89).Action_List.Set_Capacity (1);
- Add_Action (Table.States (89), 37, (72, 0), 113);
- Table.States (89).Kernel := To_Vector ((0 => ((72, 0), 23, 5,
(2147483647, 0), 0)));
- Table.States (89).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (72, 0), 37, 113)));
+ Add_Action (Table.States (89), 39, (74, 0), 113);
+ Table.States (89).Kernel := To_Vector ((0 => ((74, 0), 25, 5,
(32767, 0), 0)));
+ Table.States (89).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (74, 0), 39, 113)));
Table.States (90).Action_List.Set_Capacity (2);
- Add_Action (Table.States (90), 28, (67, 1), 114);
- Add_Action (Table.States (90), 29, (67, 0), 115);
- Table.States (90).Kernel := To_Vector ((((67, 0), 37, 2,
(2147483647, 0), 0), ((67, 1), 37, 4,
- (2147483647, 0), 0)));
- Table.States (90).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (67, 0), 29, 115)));
+ Add_Action (Table.States (90), 30, (69, 1), 114);
+ Add_Action (Table.States (90), 31, (69, 0), 115);
+ Table.States (90).Kernel := To_Vector ((((69, 0), 39, 2, (32767,
0), 0), ((69, 1), 39, 4, (32767, 0),
+ 0)));
+ Table.States (90).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (69, 0), 31, 115)));
Table.States (91).Action_List.Set_Capacity (7);
- Add_Action (Table.States (91), (6, 8, 12, 16, 18, 23, 37), (67,
2), 1, null, null);
- Table.States (91).Kernel := To_Vector ((0 => ((67, 2), 42, 0,
(67, 2), 1)));
- Table.States (91).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (67, 2), 1)));
+ Add_Action (Table.States (91), (8, 10, 14, 18, 20, 25, 39), (69,
2), 1);
+ Table.States (91).Kernel := To_Vector ((0 => ((69, 2), 44, 0,
(69, 2), 1)));
+ Table.States (91).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (69, 2), 1)));
Table.States (92).Action_List.Set_Capacity (7);
- Add_Action (Table.States (92), (6, 8, 12, 16, 18, 23, 37), (67,
3), 1, null, null);
- Table.States (92).Kernel := To_Vector ((0 => ((67, 3), 45, 0,
(67, 3), 1)));
- Table.States (92).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (67, 3), 1)));
+ Add_Action (Table.States (92), (8, 10, 14, 18, 20, 25, 39), (69,
3), 1);
+ Table.States (92).Kernel := To_Vector ((0 => ((69, 3), 47, 0,
(69, 3), 1)));
+ Table.States (92).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (69, 3), 1)));
Table.States (93).Action_List.Set_Capacity (7);
- Add_Action (Table.States (93), (6, 8, 12, 16, 18, 23, 37), (52,
0), 1, null, null);
- Table.States (93).Kernel := To_Vector ((0 => ((52, 0), 51, 0,
(52, 0), 1)));
- Table.States (93).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (52, 0), 1)));
+ Add_Action (Table.States (93), (8, 10, 14, 18, 20, 25, 39), (54,
0), 1);
+ Table.States (93).Kernel := To_Vector ((0 => ((54, 0), 53, 0,
(54, 0), 1)));
+ Table.States (93).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (54, 0), 1)));
Table.States (94).Action_List.Set_Capacity (7);
- Add_Action (Table.States (94), 6, (45, 0), 85);
- Add_Action (Table.States (94), 8, Reduce, (53, 1), 1, null, null);
- Add_Action (Table.States (94), 12, (42, 0), 86);
- Add_Action (Table.States (94), 16, (67, 4), 87);
- Add_Action (Table.States (94), 18, (61, 0), 88);
- Add_Action (Table.States (94), 23, (72, 0), 89);
- Add_Action (Table.States (94), 37, (67, 0), 90);
+ Add_Action (Table.States (94), 8, (47, 0), 85);
+ Add_Action (Table.States (94), 10, Reduce, (55, 1), 1);
+ Add_Action (Table.States (94), 14, (44, 0), 86);
+ Add_Action (Table.States (94), 18, (69, 4), 87);
+ Add_Action (Table.States (94), 20, (63, 0), 88);
+ Add_Action (Table.States (94), 25, (74, 0), 89);
+ Add_Action (Table.States (94), 39, (69, 0), 90);
Table.States (94).Goto_List.Set_Capacity (9);
- Add_Goto (Table.States (94), 42, 91);
- Add_Goto (Table.States (94), 45, 92);
- Add_Goto (Table.States (94), 51, 116);
- Add_Goto (Table.States (94), 60, 96);
- Add_Goto (Table.States (94), 61, 97);
- Add_Goto (Table.States (94), 62, 98);
- Add_Goto (Table.States (94), 63, 99);
- Add_Goto (Table.States (94), 67, 100);
- Add_Goto (Table.States (94), 72, 101);
- Table.States (94).Kernel := To_Vector ((((52, 1), 52, 2,
(2147483647, 0), 0), ((53, 1), 52, 0, (53,
- 1), 1)));
- Table.States (94).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (53, 1), 1)));
+ Add_Goto (Table.States (94), 44, 91);
+ Add_Goto (Table.States (94), 47, 92);
+ Add_Goto (Table.States (94), 53, 116);
+ Add_Goto (Table.States (94), 62, 96);
+ Add_Goto (Table.States (94), 63, 97);
+ Add_Goto (Table.States (94), 64, 98);
+ Add_Goto (Table.States (94), 65, 99);
+ Add_Goto (Table.States (94), 69, 100);
+ Add_Goto (Table.States (94), 74, 101);
+ Table.States (94).Kernel := To_Vector ((((54, 1), 54, 2, (32767,
0), 0), ((55, 1), 54, 0, (55, 1),
+ 1)));
+ Table.States (94).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (55, 1), 1)));
Table.States (95).Action_List.Set_Capacity (1);
- Add_Action (Table.States (95), 8, (68, 0), 117);
- Table.States (95).Kernel := To_Vector ((0 => ((68, 0), 53, 2,
(2147483647, 0), 0)));
- Table.States (95).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (68, 0), 8, 117)));
+ Add_Action (Table.States (95), 10, (70, 0), 117);
+ Table.States (95).Kernel := To_Vector ((0 => ((70, 0), 55, 2,
(32767, 0), 0)));
+ Table.States (95).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (70, 0), 10, 117)));
Table.States (96).Action_List.Set_Capacity (7);
- Add_Action (Table.States (96), (6, 8, 12, 16, 18, 23, 37), (51,
2), 1, null, null);
- Table.States (96).Kernel := To_Vector ((0 => ((51, 2), 60, 0,
(51, 2), 1)));
- Table.States (96).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (51, 2), 1)));
+ Add_Action (Table.States (96), (8, 10, 14, 18, 20, 25, 39), (53,
2), 1);
+ Table.States (96).Kernel := To_Vector ((0 => ((53, 2), 62, 0,
(53, 2), 1)));
+ Table.States (96).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (53, 2), 1)));
Table.States (97).Action_List.Set_Capacity (7);
- Add_Action (Table.States (97), (6, 8, 12, 16, 18, 23, 37), (60,
0), 1, null, null);
- Table.States (97).Kernel := To_Vector ((0 => ((60, 0), 61, 0,
(60, 0), 1)));
- Table.States (97).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (60, 0), 1)));
+ Add_Action (Table.States (97), (8, 10, 14, 18, 20, 25, 39), (62,
0), 1);
+ Table.States (97).Kernel := To_Vector ((0 => ((62, 0), 63, 0,
(62, 0), 1)));
+ Table.States (97).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (62, 0), 1)));
Table.States (98).Action_List.Set_Capacity (7);
- Add_Action (Table.States (98), (6, 8, 12, 16, 18, 23, 37), (60,
1), 1, null, null);
- Table.States (98).Kernel := To_Vector ((0 => ((60, 1), 62, 0,
(60, 1), 1)));
- Table.States (98).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (60, 1), 1)));
+ Add_Action (Table.States (98), (8, 10, 14, 18, 20, 25, 39), (62,
1), 1);
+ Table.States (98).Kernel := To_Vector ((0 => ((62, 1), 64, 0,
(62, 1), 1)));
+ Table.States (98).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (62, 1), 1)));
Table.States (99).Action_List.Set_Capacity (7);
- Add_Action (Table.States (99), (6, 8, 12, 16, 18, 23, 37), (60,
2), 1, null, null);
- Table.States (99).Kernel := To_Vector ((0 => ((60, 2), 63, 0,
(60, 2), 1)));
- Table.States (99).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (60, 2), 1)));
+ Add_Action (Table.States (99), (8, 10, 14, 18, 20, 25, 39), (62,
2), 1);
+ Table.States (99).Kernel := To_Vector ((0 => ((62, 2), 65, 0,
(62, 2), 1)));
+ Table.States (99).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (62, 2), 1)));
Table.States (100).Action_List.Set_Capacity (7);
- Add_Action (Table.States (100), (6, 8, 12, 16, 18, 23, 37), (51,
0), 1, null, null);
- Table.States (100).Kernel := To_Vector ((0 => ((51, 0), 67, 0,
(51, 0), 1)));
- Table.States (100).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (51, 0), 1)));
+ Add_Action (Table.States (100), (8, 10, 14, 18, 20, 25, 39), (53,
0), 1);
+ Table.States (100).Kernel := To_Vector ((0 => ((53, 0), 69, 0,
(53, 0), 1)));
+ Table.States (100).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (53, 0), 1)));
Table.States (101).Action_List.Set_Capacity (7);
- Add_Action (Table.States (101), (6, 8, 12, 16, 18, 23, 37), (51,
1), 1, null, null);
- Table.States (101).Kernel := To_Vector ((0 => ((51, 1), 72, 0,
(51, 1), 1)));
- Table.States (101).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (51, 1), 1)));
- end Subr_1;
- procedure Subr_2
- is begin
+ Add_Action (Table.States (101), (8, 10, 14, 18, 20, 25, 39), (53,
1), 1);
+ Table.States (101).Kernel := To_Vector ((0 => ((53, 1), 74, 0,
(53, 1), 1)));
+ Table.States (101).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (53, 1), 1)));
Table.States (102).Action_List.Set_Capacity (1);
- Add_Action (Table.States (102), 21, (44, 1), 118);
- Table.States (102).Kernel := To_Vector ((0 => ((44, 1), 38, 1,
(2147483647, 0), 0)));
- Table.States (102).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 1), 21, 118)));
+ Add_Action (Table.States (102), 23, (46, 1), 118);
+ Table.States (102).Kernel := To_Vector ((0 => ((46, 1), 40, 1,
(32767, 0), 0)));
+ Table.States (102).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (46, 1), 23, 118)));
Table.States (103).Action_List.Set_Capacity (3);
- Add_Action (Table.States (103), (27, 30, 34), (44, 1), 6, null,
null);
- Table.States (103).Kernel := To_Vector ((0 => ((44, 1), 21, 0,
(44, 1), 6)));
- Table.States (103).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (44, 1), 6)));
+ Add_Action (Table.States (103), (29, 32, 36), (46, 1), 6);
+ Table.States (103).Kernel := To_Vector ((0 => ((46, 1), 23, 0,
(46, 1), 6)));
+ Table.States (103).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (46, 1), 6)));
+ end Subr_2;
+ procedure Subr_3
+ is begin
Table.States (104).Action_List.Set_Capacity (7);
- Add_Action (Table.States (104), 6, (45, 0), 85);
- Add_Action (Table.States (104), 8, Reduce, (53, 0), 0, null,
null);
- Add_Action (Table.States (104), 12, (42, 0), 86);
- Add_Action (Table.States (104), 16, (67, 4), 87);
- Add_Action (Table.States (104), 18, (61, 0), 88);
- Add_Action (Table.States (104), 23, (72, 0), 89);
- Add_Action (Table.States (104), 37, (67, 0), 90);
+ Add_Action (Table.States (104), 8, (47, 0), 85);
+ Add_Action (Table.States (104), 10, Reduce, (55, 0), 0);
+ Add_Action (Table.States (104), 14, (44, 0), 86);
+ Add_Action (Table.States (104), 18, (69, 4), 87);
+ Add_Action (Table.States (104), 20, (63, 0), 88);
+ Add_Action (Table.States (104), 25, (74, 0), 89);
+ Add_Action (Table.States (104), 39, (69, 0), 90);
Table.States (104).Goto_List.Set_Capacity (11);
- Add_Goto (Table.States (104), 42, 91);
- Add_Goto (Table.States (104), 45, 92);
- Add_Goto (Table.States (104), 51, 93);
- Add_Goto (Table.States (104), 52, 94);
- Add_Goto (Table.States (104), 53, 119);
- Add_Goto (Table.States (104), 60, 96);
- Add_Goto (Table.States (104), 61, 97);
- Add_Goto (Table.States (104), 62, 98);
- Add_Goto (Table.States (104), 63, 99);
- Add_Goto (Table.States (104), 67, 100);
- Add_Goto (Table.States (104), 72, 101);
- Table.States (104).Kernel := To_Vector ((0 => ((65, 0), 13, 2,
(2147483647, 0), 0)));
- Table.States (104).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (53, 0), 0)));
+ Add_Goto (Table.States (104), 44, 91);
+ Add_Goto (Table.States (104), 47, 92);
+ Add_Goto (Table.States (104), 53, 93);
+ Add_Goto (Table.States (104), 54, 94);
+ Add_Goto (Table.States (104), 55, 119);
+ Add_Goto (Table.States (104), 62, 96);
+ Add_Goto (Table.States (104), 63, 97);
+ Add_Goto (Table.States (104), 64, 98);
+ Add_Goto (Table.States (104), 65, 99);
+ Add_Goto (Table.States (104), 69, 100);
+ Add_Goto (Table.States (104), 74, 101);
+ Table.States (104).Kernel := To_Vector ((0 => ((67, 0), 15, 2,
(32767, 0), 0)));
+ Table.States (104).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (55, 0), 0)));
Table.States (105).Action_List.Set_Capacity (2);
- Add_Action (Table.States (105), (13, 31), (58, 1), 1, null,
identifier_opt_1_check'Access);
- Table.States (105).Kernel := To_Vector ((0 => ((58, 1), 37, 0,
(58, 1), 1)));
- Table.States (105).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 1), 1)));
+ Add_Action (Table.States (105), (15, 33), (60, 1), 1);
+ Table.States (105).Kernel := To_Vector ((0 => ((60, 1), 39, 0,
(60, 1), 1)));
+ Table.States (105).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (60, 1), 1)));
Table.States (106).Action_List.Set_Capacity (2);
- Add_Action (Table.States (106), (13, 31), (59, 0), 1, null, null);
- Table.States (106).Kernel := To_Vector ((0 => ((59, 0), 58, 0,
(59, 0), 1)));
- Table.States (106).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (59, 0), 1)));
+ Add_Action (Table.States (106), (15, 33), (61, 0), 1);
+ Table.States (106).Kernel := To_Vector ((0 => ((61, 0), 60, 0,
(61, 0), 1)));
+ Table.States (106).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (61, 0), 1)));
Table.States (107).Action_List.Set_Capacity (2);
- Add_Action (Table.States (107), 13, (45, 0), 120);
- Add_Action (Table.States (107), 31, (59, 1), 121);
- Table.States (107).Kernel := To_Vector ((((45, 0), 59, 4,
(2147483647, 0), 0), ((59, 1), 59, 2,
- (2147483647, 0), 0)));
- Table.States (107).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (45, 0), 13, 120)));
+ Add_Action (Table.States (107), 15, (47, 0), 120);
+ Add_Action (Table.States (107), 33, (61, 1), 121);
+ Table.States (107).Kernel := To_Vector ((((47, 0), 61, 4,
(32767, 0), 0), ((61, 1), 61, 2, (32767, 0),
+ 0)));
+ Table.States (107).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (47, 0), 15, 120)));
Table.States (108).Action_List.Set_Capacity (1);
- Add_Action (Table.States (108), 14, (42, 3), 122);
- Table.States (108).Kernel := To_Vector ((0 => ((42, 3), 10, 5,
(2147483647, 0), 0)));
- Table.States (108).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (42, 3), 14, 122)));
+ Add_Action (Table.States (108), 16, (44, 3), 122);
+ Table.States (108).Kernel := To_Vector ((0 => ((44, 3), 12, 5,
(32767, 0), 0)));
+ Table.States (108).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 3), 16, 122)));
Table.States (109).Action_List.Set_Capacity (2);
- Add_Action (Table.States (109), 14, (42, 1), 123);
- Add_Action (Table.States (109), 24, (42, 0), 124);
- Table.States (109).Kernel := To_Vector ((((42, 0), 37, 2,
(2147483647, 0), 0), ((42, 1), 37, 4,
- (2147483647, 0), 0), ((42, 2), 37, 6, (2147483647, 0), 0)));
- Table.States (109).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (42, 0), 24, 124)));
+ Add_Action (Table.States (109), 16, (44, 1), 123);
+ Add_Action (Table.States (109), 26, (44, 0), 124);
+ Table.States (109).Kernel := To_Vector ((((44, 0), 39, 2,
(32767, 0), 0), ((44, 1), 39, 4, (32767, 0),
+ 0), ((44, 2), 39, 6, (32767, 0), 0)));
+ Table.States (109).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 0), 26, 124)));
Table.States (110).Action_List.Set_Capacity (7);
- Add_Action (Table.States (110), (6, 8, 12, 16, 18, 23, 37), (67,
4), 2, simple_declarative_item_4'Access,
- null);
- Table.States (110).Kernel := To_Vector ((0 => ((67, 4), 34, 0,
(67, 4), 2)));
- Table.States (110).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (67, 4), 2)));
+ Add_Action (Table.States (110), (8, 10, 14, 18, 20, 25, 39), (69,
4), 2);
+ Table.States (110).Kernel := To_Vector ((0 => ((69, 4), 36, 0,
(69, 4), 2)));
+ Table.States (110).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (69, 4), 2)));
Table.States (111).Action_List.Set_Capacity (3);
- Add_Action (Table.States (111), (9, 13, 20), (58, 1), 1, null,
identifier_opt_1_check'Access);
- Table.States (111).Kernel := To_Vector ((0 => ((58, 1), 37, 0,
(58, 1), 1)));
- Table.States (111).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 1), 1)));
+ Add_Action (Table.States (111), (11, 15, 22), (60, 1), 1);
+ Table.States (111).Kernel := To_Vector ((0 => ((60, 1), 39, 0,
(60, 1), 1)));
+ Table.States (111).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (60, 1), 1)));
Table.States (112).Action_List.Set_Capacity (3);
- Add_Action (Table.States (112), 9, (62, 0), 125);
- Add_Action (Table.States (112), 13, (61, 0), 126);
- Add_Action (Table.States (112), 20, (63, 0), 127);
- Table.States (112).Kernel := To_Vector ((((61, 0), 58, 3,
(2147483647, 0), 0), ((62, 0), 58, 4,
- (2147483647, 0), 0), ((63, 0), 58, 2, (2147483647, 0), 0)));
- Table.States (112).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (63, 0), 20, 127)));
+ Add_Action (Table.States (112), 11, (64, 0), 125);
+ Add_Action (Table.States (112), 15, (63, 0), 126);
+ Add_Action (Table.States (112), 22, (65, 0), 127);
+ Table.States (112).Kernel := To_Vector ((((63, 0), 60, 3,
(32767, 0), 0), ((64, 0), 60, 4, (32767, 0),
+ 0), ((65, 0), 60, 2, (32767, 0), 0)));
+ Table.States (112).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (65, 0), 22, 127)));
Table.States (113).Action_List.Set_Capacity (1);
- Add_Action (Table.States (113), 13, (72, 0), 128);
- Table.States (113).Kernel := To_Vector ((0 => ((72, 0), 37, 4,
(2147483647, 0), 0)));
- Table.States (113).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (72, 0), 13, 128)));
+ Add_Action (Table.States (113), 15, (74, 0), 128);
+ Table.States (113).Kernel := To_Vector ((0 => ((74, 0), 39, 4,
(32767, 0), 0)));
+ Table.States (113).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (74, 0), 15, 128)));
Table.States (114).Action_List.Set_Capacity (1);
- Add_Action (Table.States (114), 37, (67, 1), 129);
- Table.States (114).Kernel := To_Vector ((0 => ((67, 1), 28, 3,
(2147483647, 0), 0)));
- Table.States (114).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (67, 1), 37, 129)));
+ Add_Action (Table.States (114), 39, (69, 1), 129);
+ Table.States (114).Kernel := To_Vector ((0 => ((69, 1), 30, 3,
(32767, 0), 0)));
+ Table.States (114).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (69, 1), 39, 129)));
Table.States (115).Action_List.Set_Capacity (10);
- Add_Action (Table.States (115), 10, (57, 0), 130);
- Add_Action (Table.States (115), 11, (57, 1), 131);
- Add_Action (Table.States (115), 14, (41, 0), 132);
- Add_Action (Table.States (115), 19, (43, 0), 9);
- Add_Action (Table.States (115), 27, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (115), 31, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (115), 33, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (115), 34, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (115), 37, (58, 1), 133);
- Add_Action (Table.States (115), 38, (69, 0), 134);
+ Add_Action (Table.States (115), 12, (59, 0), 130);
+ Add_Action (Table.States (115), 13, (59, 1), 131);
+ Add_Action (Table.States (115), 16, (43, 0), 132);
+ Add_Action (Table.States (115), 21, (45, 0), 9);
+ Add_Action (Table.States (115), 29, Reduce, (60, 0), 0);
+ Add_Action (Table.States (115), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (115), 35, Reduce, (60, 0), 0);
+ Add_Action (Table.States (115), 36, Reduce, (60, 0), 0);
+ Add_Action (Table.States (115), 39, (60, 1), 133);
+ Add_Action (Table.States (115), 40, (71, 0), 134);
Table.States (115).Goto_List.Set_Capacity (9);
- Add_Goto (Table.States (115), 41, 135);
- Add_Goto (Table.States (115), 43, 136);
- Add_Goto (Table.States (115), 44, 137);
- Add_Goto (Table.States (115), 56, 138);
- Add_Goto (Table.States (115), 57, 139);
- Add_Goto (Table.States (115), 58, 140);
- Add_Goto (Table.States (115), 59, 141);
- Add_Goto (Table.States (115), 69, 142);
- Add_Goto (Table.States (115), 71, 143);
- Table.States (115).Kernel := To_Vector ((0 => ((67, 0), 29, 1,
(2147483647, 0), 0)));
- Table.States (115).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (56, 0), 0)));
+ Add_Goto (Table.States (115), 43, 135);
+ Add_Goto (Table.States (115), 45, 136);
+ Add_Goto (Table.States (115), 46, 137);
+ Add_Goto (Table.States (115), 58, 138);
+ Add_Goto (Table.States (115), 59, 139);
+ Add_Goto (Table.States (115), 60, 140);
+ Add_Goto (Table.States (115), 61, 141);
+ Add_Goto (Table.States (115), 71, 142);
+ Add_Goto (Table.States (115), 73, 143);
+ Table.States (115).Kernel := To_Vector ((0 => ((69, 0), 31, 1,
(32767, 0), 0)));
+ Table.States (115).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 0), 0)));
Table.States (116).Action_List.Set_Capacity (7);
- Add_Action (Table.States (116), (6, 8, 12, 16, 18, 23, 37), (52,
1), 2, null, null);
- Table.States (116).Kernel := To_Vector ((0 => ((52, 1), 51, 0,
(52, 1), 2)));
- Table.States (116).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (52, 1), 2)));
+ Add_Action (Table.States (116), (8, 10, 14, 18, 20, 25, 39), (54,
1), 2);
+ Table.States (116).Kernel := To_Vector ((0 => ((54, 1), 53, 0,
(54, 1), 2)));
+ Table.States (116).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (54, 1), 2)));
Table.States (117).Action_List.Set_Capacity (2);
- Add_Action (Table.States (117), 34, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (117), 37, (58, 1), 144);
+ Add_Action (Table.States (117), 36, Reduce, (60, 0), 0);
+ Add_Action (Table.States (117), 39, (60, 1), 144);
Table.States (117).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (117), 58, 145);
- Table.States (117).Kernel := To_Vector ((0 => ((68, 0), 8, 1,
(2147483647, 0), 0)));
- Table.States (117).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 0), 0)));
+ Add_Goto (Table.States (117), 60, 145);
+ Table.States (117).Kernel := To_Vector ((0 => ((70, 0), 10, 1,
(32767, 0), 0)));
+ Table.States (117).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (60, 0), 0)));
Table.States (118).Action_List.Set_Capacity (3);
- Add_Action (Table.States (118), (21, 27, 30), (44, 1), 6, null,
null);
- Table.States (118).Kernel := To_Vector ((0 => ((44, 1), 21, 0,
(44, 1), 6)));
- Table.States (118).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (44, 1), 6)));
+ Add_Action (Table.States (118), (23, 29, 32), (46, 1), 6);
+ Table.States (118).Kernel := To_Vector ((0 => ((46, 1), 23, 0,
(46, 1), 6)));
+ Table.States (118).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (46, 1), 6)));
Table.States (119).Action_List.Set_Capacity (1);
- Add_Action (Table.States (119), 8, (65, 0), 146);
- Table.States (119).Kernel := To_Vector ((0 => ((65, 0), 53, 2,
(2147483647, 0), 0)));
- Table.States (119).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (65, 0), 8, 146)));
+ Add_Action (Table.States (119), 10, (67, 0), 146);
+ Table.States (119).Kernel := To_Vector ((0 => ((67, 0), 55, 2,
(32767, 0), 0)));
+ Table.States (119).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (67, 0), 10, 146)));
Table.States (120).Action_List.Set_Capacity (2);
- Add_Action (Table.States (120), 8, Reduce, (47, 0), 0, null,
null);
- Add_Action (Table.States (120), 25, (46, 0), 147);
- Add_Conflict (Table.States (120), 25, (47, 0), 0, null, null);
+ Add_Action (Table.States (120), 10, Reduce, (49, 0), 0);
+ Add_Action (Table.States (120), 27, (48, 0), 147);
+ Add_Conflict (Table.States (120), 27, (49, 0), 0);
Table.States (120).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (120), 46, 148);
- Add_Goto (Table.States (120), 47, 149);
- Table.States (120).Kernel := To_Vector ((0 => ((45, 0), 13, 3,
(2147483647, 0), 0)));
- Table.States (120).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (47, 0), 0)));
+ Add_Goto (Table.States (120), 48, 148);
+ Add_Goto (Table.States (120), 49, 149);
+ Table.States (120).Kernel := To_Vector ((0 => ((47, 0), 15, 3,
(32767, 0), 0)));
+ Table.States (120).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (49, 0), 0)));
Table.States (121).Action_List.Set_Capacity (1);
- Add_Action (Table.States (121), 37, (59, 1), 150);
- Table.States (121).Kernel := To_Vector ((0 => ((59, 1), 31, 1,
(2147483647, 0), 0)));
- Table.States (121).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (59, 1), 37, 150)));
+ Add_Action (Table.States (121), 39, (61, 1), 150);
+ Table.States (121).Kernel := To_Vector ((0 => ((61, 1), 33, 1,
(32767, 0), 0)));
+ Table.States (121).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (61, 1), 39, 150)));
Table.States (122).Action_List.Set_Capacity (1);
- Add_Action (Table.States (122), 38, (42, 3), 151);
- Table.States (122).Kernel := To_Vector ((0 => ((42, 3), 14, 4,
(2147483647, 0), 0)));
- Table.States (122).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (42, 3), 38, 151)));
+ Add_Action (Table.States (122), 40, (44, 3), 151);
+ Table.States (122).Kernel := To_Vector ((0 => ((44, 3), 16, 4,
(32767, 0), 0)));
+ Table.States (122).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 3), 40, 151)));
Table.States (123).Action_List.Set_Capacity (3);
- Add_Action (Table.States (123), 17, (54, 2), 152);
- Add_Action (Table.States (123), 21, Reduce, (54, 0), 0, null,
null);
- Add_Action (Table.States (123), 38, (54, 1), 153);
+ Add_Action (Table.States (123), 19, (56, 2), 152);
+ Add_Action (Table.States (123), 23, Reduce, (56, 0), 0);
+ Add_Action (Table.States (123), 40, (56, 1), 153);
Table.States (123).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (123), 54, 154);
- Table.States (123).Kernel := To_Vector ((((42, 1), 14, 3,
(2147483647, 0), 0), ((42, 2), 14, 5,
- (2147483647, 0), 0)));
- Table.States (123).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (54, 0), 0)));
+ Add_Goto (Table.States (123), 56, 154);
+ Table.States (123).Kernel := To_Vector ((((44, 1), 16, 3,
(32767, 0), 0), ((44, 2), 16, 5, (32767, 0),
+ 0)));
+ Table.States (123).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (56, 0), 0)));
Table.States (124).Action_List.Set_Capacity (10);
- Add_Action (Table.States (124), 10, (57, 0), 130);
- Add_Action (Table.States (124), 11, (57, 1), 131);
- Add_Action (Table.States (124), 14, (41, 0), 132);
- Add_Action (Table.States (124), 19, (43, 0), 9);
- Add_Action (Table.States (124), 27, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (124), 31, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (124), 33, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (124), 34, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (124), 37, (58, 1), 133);
- Add_Action (Table.States (124), 38, (69, 0), 134);
+ Add_Action (Table.States (124), 12, (59, 0), 130);
+ Add_Action (Table.States (124), 13, (59, 1), 131);
+ Add_Action (Table.States (124), 16, (43, 0), 132);
+ Add_Action (Table.States (124), 21, (45, 0), 9);
+ Add_Action (Table.States (124), 29, Reduce, (60, 0), 0);
+ Add_Action (Table.States (124), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (124), 35, Reduce, (60, 0), 0);
+ Add_Action (Table.States (124), 36, Reduce, (60, 0), 0);
+ Add_Action (Table.States (124), 39, (60, 1), 133);
+ Add_Action (Table.States (124), 40, (71, 0), 134);
Table.States (124).Goto_List.Set_Capacity (9);
- Add_Goto (Table.States (124), 41, 135);
- Add_Goto (Table.States (124), 43, 136);
- Add_Goto (Table.States (124), 44, 137);
- Add_Goto (Table.States (124), 56, 155);
- Add_Goto (Table.States (124), 57, 139);
- Add_Goto (Table.States (124), 58, 140);
- Add_Goto (Table.States (124), 59, 141);
- Add_Goto (Table.States (124), 69, 142);
- Add_Goto (Table.States (124), 71, 143);
- Table.States (124).Kernel := To_Vector ((0 => ((42, 0), 24, 1,
(2147483647, 0), 0)));
- Table.States (124).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (56, 0), 0)));
+ Add_Goto (Table.States (124), 43, 135);
+ Add_Goto (Table.States (124), 45, 136);
+ Add_Goto (Table.States (124), 46, 137);
+ Add_Goto (Table.States (124), 58, 155);
+ Add_Goto (Table.States (124), 59, 139);
+ Add_Goto (Table.States (124), 60, 140);
+ Add_Goto (Table.States (124), 61, 141);
+ Add_Goto (Table.States (124), 71, 142);
+ Add_Goto (Table.States (124), 73, 143);
+ Table.States (124).Kernel := To_Vector ((0 => ((44, 0), 26, 1,
(32767, 0), 0)));
+ Table.States (124).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 0), 0)));
Table.States (125).Action_List.Set_Capacity (3);
- Add_Action (Table.States (125), 13, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (125), 31, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (125), 37, (58, 1), 105);
+ Add_Action (Table.States (125), 15, Reduce, (60, 0), 0);
+ Add_Action (Table.States (125), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (125), 39, (60, 1), 105);
Table.States (125).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (125), 58, 106);
- Add_Goto (Table.States (125), 59, 156);
- Table.States (125).Kernel := To_Vector ((0 => ((62, 0), 9, 3,
(2147483647, 0), 0)));
- Table.States (125).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (59, 0), 0)));
+ Add_Goto (Table.States (125), 60, 106);
+ Add_Goto (Table.States (125), 61, 156);
+ Table.States (125).Kernel := To_Vector ((0 => ((64, 0), 11, 3,
(32767, 0), 0)));
+ Table.States (125).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (61, 0), 0)));
Table.States (126).Action_List.Set_Capacity (7);
- Add_Action (Table.States (126), 6, (45, 0), 85);
- Add_Action (Table.States (126), 8, Reduce, (53, 0), 0, null,
null);
- Add_Action (Table.States (126), 12, (42, 0), 86);
- Add_Action (Table.States (126), 16, (67, 4), 87);
- Add_Action (Table.States (126), 18, (61, 0), 88);
- Add_Action (Table.States (126), 23, (72, 0), 89);
- Add_Action (Table.States (126), 37, (67, 0), 90);
+ Add_Action (Table.States (126), 8, (47, 0), 85);
+ Add_Action (Table.States (126), 10, Reduce, (55, 0), 0);
+ Add_Action (Table.States (126), 14, (44, 0), 86);
+ Add_Action (Table.States (126), 18, (69, 4), 87);
+ Add_Action (Table.States (126), 20, (63, 0), 88);
+ Add_Action (Table.States (126), 25, (74, 0), 89);
+ Add_Action (Table.States (126), 39, (69, 0), 90);
Table.States (126).Goto_List.Set_Capacity (11);
- Add_Goto (Table.States (126), 42, 91);
- Add_Goto (Table.States (126), 45, 92);
- Add_Goto (Table.States (126), 51, 93);
- Add_Goto (Table.States (126), 52, 94);
- Add_Goto (Table.States (126), 53, 157);
- Add_Goto (Table.States (126), 60, 96);
- Add_Goto (Table.States (126), 61, 97);
- Add_Goto (Table.States (126), 62, 98);
- Add_Goto (Table.States (126), 63, 99);
- Add_Goto (Table.States (126), 67, 100);
- Add_Goto (Table.States (126), 72, 101);
- Table.States (126).Kernel := To_Vector ((0 => ((61, 0), 13, 2,
(2147483647, 0), 0)));
- Table.States (126).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (53, 0), 0)));
+ Add_Goto (Table.States (126), 44, 91);
+ Add_Goto (Table.States (126), 47, 92);
+ Add_Goto (Table.States (126), 53, 93);
+ Add_Goto (Table.States (126), 54, 94);
+ Add_Goto (Table.States (126), 55, 157);
+ Add_Goto (Table.States (126), 62, 96);
+ Add_Goto (Table.States (126), 63, 97);
+ Add_Goto (Table.States (126), 64, 98);
+ Add_Goto (Table.States (126), 65, 99);
+ Add_Goto (Table.States (126), 69, 100);
+ Add_Goto (Table.States (126), 74, 101);
+ Table.States (126).Kernel := To_Vector ((0 => ((63, 0), 15, 2,
(32767, 0), 0)));
+ Table.States (126).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (55, 0), 0)));
Table.States (127).Action_List.Set_Capacity (3);
- Add_Action (Table.States (127), 31, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (127), 34, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (127), 37, (58, 1), 158);
+ Add_Action (Table.States (127), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (127), 36, Reduce, (60, 0), 0);
+ Add_Action (Table.States (127), 39, (60, 1), 158);
Table.States (127).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (127), 58, 159);
- Add_Goto (Table.States (127), 59, 160);
- Table.States (127).Kernel := To_Vector ((0 => ((63, 0), 20, 1,
(2147483647, 0), 0)));
- Table.States (127).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (59, 0), 0)));
+ Add_Goto (Table.States (127), 60, 159);
+ Add_Goto (Table.States (127), 61, 160);
+ Table.States (127).Kernel := To_Vector ((0 => ((65, 0), 22, 1,
(32767, 0), 0)));
+ Table.States (127).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (61, 0), 0)));
Table.States (128).Action_List.Set_Capacity (1);
- Add_Action (Table.States (128), 14, (41, 0), 161);
+ Add_Action (Table.States (128), 16, (43, 0), 161);
Table.States (128).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (128), 41, 162);
- Table.States (128).Kernel := To_Vector ((0 => ((72, 0), 13, 3,
(2147483647, 0), 0)));
- Table.States (128).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (41, 0), 14, 161)));
+ Add_Goto (Table.States (128), 43, 162);
+ Table.States (128).Kernel := To_Vector ((0 => ((74, 0), 15, 3,
(32767, 0), 0)));
+ Table.States (128).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (43, 0), 16, 161)));
Table.States (129).Action_List.Set_Capacity (1);
- Add_Action (Table.States (129), 29, (67, 1), 163);
- Table.States (129).Kernel := To_Vector ((0 => ((67, 1), 37, 2,
(2147483647, 0), 0)));
- Table.States (129).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (67, 1), 29, 163)));
+ Add_Action (Table.States (129), 31, (69, 1), 163);
+ Table.States (129).Kernel := To_Vector ((0 => ((69, 1), 39, 2,
(32767, 0), 0)));
+ Table.States (129).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (69, 1), 31, 163)));
Table.States (130).Action_List.Set_Capacity (1);
- Add_Action (Table.States (130), 14, (41, 0), 164);
+ Add_Action (Table.States (130), 16, (43, 0), 164);
Table.States (130).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (130), 41, 165);
- Table.States (130).Kernel := To_Vector ((0 => ((57, 0), 10, 2,
(2147483647, 0), 0)));
- Table.States (130).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (41, 0), 14, 164)));
+ Add_Goto (Table.States (130), 43, 165);
+ Table.States (130).Kernel := To_Vector ((0 => ((59, 0), 12, 2,
(32767, 0), 0)));
+ Table.States (130).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (43, 0), 16, 164)));
Table.States (131).Action_List.Set_Capacity (1);
- Add_Action (Table.States (131), 14, (41, 0), 164);
+ Add_Action (Table.States (131), 16, (43, 0), 164);
Table.States (131).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (131), 41, 166);
- Table.States (131).Kernel := To_Vector ((0 => ((57, 1), 11, 2,
(2147483647, 0), 0)));
- Table.States (131).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (41, 0), 14, 164)));
+ Add_Goto (Table.States (131), 43, 166);
+ Table.States (131).Kernel := To_Vector ((0 => ((59, 1), 13, 2,
(32767, 0), 0)));
+ Table.States (131).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (43, 0), 16, 164)));
Table.States (132).Action_List.Set_Capacity (11);
- Add_Action (Table.States (132), 10, (57, 0), 32);
- Add_Action (Table.States (132), 11, (57, 1), 33);
- Add_Action (Table.States (132), 14, (41, 0), 34);
- Add_Action (Table.States (132), 19, (43, 0), 9);
- Add_Action (Table.States (132), 21, (71, 1), 167);
- Add_Conflict (Table.States (132), 21, (58, 0), 0, null, null);
- Add_Action (Table.States (132), 27, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (132), 30, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (132), 31, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (132), 33, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (132), 37, (58, 1), 36);
- Add_Action (Table.States (132), 38, (69, 0), 37);
+ Add_Action (Table.States (132), 12, (59, 0), 32);
+ Add_Action (Table.States (132), 13, (59, 1), 33);
+ Add_Action (Table.States (132), 16, (43, 0), 34);
+ Add_Action (Table.States (132), 21, (45, 0), 9);
+ Add_Action (Table.States (132), 23, (73, 1), 167);
+ Add_Conflict (Table.States (132), 23, (60, 0), 0);
+ Add_Action (Table.States (132), 29, Reduce, (60, 0), 0);
+ Add_Action (Table.States (132), 32, Reduce, (60, 0), 0);
+ Add_Action (Table.States (132), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (132), 35, Reduce, (60, 0), 0);
+ Add_Action (Table.States (132), 39, (60, 1), 36);
+ Add_Action (Table.States (132), 40, (71, 0), 37);
Table.States (132).Goto_List.Set_Capacity (10);
- Add_Goto (Table.States (132), 41, 38);
- Add_Goto (Table.States (132), 43, 39);
- Add_Goto (Table.States (132), 44, 40);
- Add_Goto (Table.States (132), 56, 41);
- Add_Goto (Table.States (132), 57, 42);
- Add_Goto (Table.States (132), 58, 43);
- Add_Goto (Table.States (132), 59, 44);
- Add_Goto (Table.States (132), 69, 45);
- Add_Goto (Table.States (132), 70, 168);
- Add_Goto (Table.States (132), 71, 47);
- Table.States (132).Kernel := To_Vector ((((41, 0), 14, 1,
(2147483647, 0), 0), ((71, 1), 14, 1,
- (2147483647, 0), 0)));
- Table.States (132).Minimal_Complete_Actions := To_Vector
(((Reduce, (70, 0), 0), (Shift, (71, 1), 21,
+ Add_Goto (Table.States (132), 43, 38);
+ Add_Goto (Table.States (132), 45, 39);
+ Add_Goto (Table.States (132), 46, 40);
+ Add_Goto (Table.States (132), 58, 41);
+ Add_Goto (Table.States (132), 59, 42);
+ Add_Goto (Table.States (132), 60, 43);
+ Add_Goto (Table.States (132), 61, 44);
+ Add_Goto (Table.States (132), 71, 45);
+ Add_Goto (Table.States (132), 72, 168);
+ Add_Goto (Table.States (132), 73, 47);
+ Table.States (132).Kernel := To_Vector ((((43, 0), 16, 1,
(32767, 0), 0), ((73, 1), 16, 1, (32767, 0),
+ 0)));
+ Table.States (132).Minimal_Complete_Actions := To_Vector
(((Reduce, (72, 0), 0), (Shift, (73, 1), 23,
167)));
Table.States (133).Action_List.Set_Capacity (4);
- Add_Action (Table.States (133), (27, 31, 33, 34), (58, 1), 1,
null, identifier_opt_1_check'Access);
- Table.States (133).Kernel := To_Vector ((0 => ((58, 1), 37, 0,
(58, 1), 1)));
- Table.States (133).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 1), 1)));
+ Add_Action (Table.States (133), (29, 33, 35, 36), (60, 1), 1);
+ Table.States (133).Kernel := To_Vector ((0 => ((60, 1), 39, 0,
(60, 1), 1)));
+ Table.States (133).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (60, 1), 1)));
Table.States (134).Action_List.Set_Capacity (2);
- Add_Action (Table.States (134), (27, 34), (69, 0), 1, null, null);
- Table.States (134).Kernel := To_Vector ((0 => ((69, 0), 38, 0,
(69, 0), 1)));
- Table.States (134).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (69, 0), 1)));
+ Add_Action (Table.States (134), (29, 36), (71, 0), 1);
+ Table.States (134).Kernel := To_Vector ((0 => ((71, 0), 40, 0,
(71, 0), 1)));
+ Table.States (134).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (71, 0), 1)));
Table.States (135).Action_List.Set_Capacity (2);
- Add_Action (Table.States (135), (27, 34), (71, 2), 1, null, null);
- Table.States (135).Kernel := To_Vector ((0 => ((71, 2), 41, 0,
(71, 2), 1)));
- Table.States (135).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (71, 2), 1)));
+ Add_Action (Table.States (135), (29, 36), (73, 2), 1);
+ Table.States (135).Kernel := To_Vector ((0 => ((73, 2), 43, 0,
(73, 2), 1)));
+ Table.States (135).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (73, 2), 1)));
Table.States (136).Action_List.Set_Capacity (1);
- Add_Action (Table.States (136), 33, (44, 0), 169);
- Table.States (136).Kernel := To_Vector ((((44, 0), 43, 2,
(2147483647, 0), 0), ((44, 1), 43, 5,
- (2147483647, 0), 0)));
- Table.States (136).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 0), 33, 169)));
+ Add_Action (Table.States (136), 35, (46, 0), 169);
+ Table.States (136).Kernel := To_Vector ((((46, 0), 45, 2,
(32767, 0), 0), ((46, 1), 45, 5, (32767, 0),
+ 0)));
+ Table.States (136).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (46, 0), 35, 169)));
Table.States (137).Action_List.Set_Capacity (2);
- Add_Action (Table.States (137), (27, 34), (69, 3), 1, null, null);
- Table.States (137).Kernel := To_Vector ((0 => ((69, 3), 44, 0,
(69, 3), 1)));
- Table.States (137).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (69, 3), 1)));
+ Add_Action (Table.States (137), (29, 36), (71, 3), 1);
+ Table.States (137).Kernel := To_Vector ((0 => ((71, 3), 46, 0,
(71, 3), 1)));
+ Table.States (137).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (71, 3), 1)));
Table.States (138).Action_List.Set_Capacity (2);
- Add_Action (Table.States (138), 27, (56, 1), 170);
- Add_Action (Table.States (138), 34, (67, 0), 171);
- Table.States (138).Kernel := To_Vector ((((56, 1), 56, 1,
(2147483647, 0), 0), ((67, 0), 56, 1,
- (2147483647, 0), 0)));
- Table.States (138).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (67, 0), 34, 171)));
+ Add_Action (Table.States (138), 29, (58, 1), 170);
+ Add_Action (Table.States (138), 36, (69, 0), 171);
+ Table.States (138).Kernel := To_Vector ((((58, 1), 58, 1,
(32767, 0), 0), ((69, 0), 58, 1, (32767, 0),
+ 0)));
+ Table.States (138).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (69, 0), 36, 171)));
Table.States (139).Action_List.Set_Capacity (2);
- Add_Action (Table.States (139), (27, 34), (69, 2), 1, null, null);
- Table.States (139).Kernel := To_Vector ((0 => ((69, 2), 57, 0,
(69, 2), 1)));
- Table.States (139).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (69, 2), 1)));
+ Add_Action (Table.States (139), (29, 36), (71, 2), 1);
+ Table.States (139).Kernel := To_Vector ((0 => ((71, 2), 59, 0,
(71, 2), 1)));
+ Table.States (139).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (71, 2), 1)));
Table.States (140).Action_List.Set_Capacity (4);
- Add_Action (Table.States (140), (27, 31, 33, 34), (59, 0), 1,
null, null);
- Table.States (140).Kernel := To_Vector ((0 => ((59, 0), 58, 0,
(59, 0), 1)));
- Table.States (140).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (59, 0), 1)));
+ Add_Action (Table.States (140), (29, 33, 35, 36), (61, 0), 1);
+ Table.States (140).Kernel := To_Vector ((0 => ((61, 0), 60, 0,
(61, 0), 1)));
+ Table.States (140).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (61, 0), 1)));
Table.States (141).Action_List.Set_Capacity (4);
- Add_Action (Table.States (141), 27, Reduce, (69, 1), 1, null,
null);
- Add_Action (Table.States (141), 31, (59, 1), 172);
- Add_Action (Table.States (141), 33, Reduce, (43, 1), 1, null,
null);
- Add_Action (Table.States (141), 34, Reduce, (69, 1), 1, null,
null);
- Table.States (141).Kernel := To_Vector ((((43, 1), 59, 0, (43,
1), 1), ((59, 1), 59, 2, (2147483647,
- 0), 0), ((69, 1), 59, 0, (69, 1), 1)));
- Table.States (141).Minimal_Complete_Actions := To_Vector
(((Reduce, (43, 1), 1), (Reduce, (69, 1), 1)));
+ Add_Action (Table.States (141), 29, Reduce, (71, 1), 1);
+ Add_Action (Table.States (141), 33, (61, 1), 172);
+ Add_Action (Table.States (141), 35, Reduce, (45, 1), 1);
+ Add_Action (Table.States (141), 36, Reduce, (71, 1), 1);
+ Table.States (141).Kernel := To_Vector ((((45, 1), 61, 0, (45,
1), 1), ((61, 1), 61, 2, (32767, 0),
+ 0), ((71, 1), 61, 0, (71, 1), 1)));
+ Table.States (141).Minimal_Complete_Actions := To_Vector
(((Reduce, (45, 1), 1), (Reduce, (71, 1), 1)));
Table.States (142).Action_List.Set_Capacity (2);
- Add_Action (Table.States (142), (27, 34), (71, 0), 1, null, null);
- Table.States (142).Kernel := To_Vector ((0 => ((71, 0), 69, 0,
(71, 0), 1)));
- Table.States (142).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (71, 0), 1)));
+ Add_Action (Table.States (142), (29, 36), (73, 0), 1);
+ Table.States (142).Kernel := To_Vector ((0 => ((73, 0), 71, 0,
(73, 0), 1)));
+ Table.States (142).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (73, 0), 1)));
Table.States (143).Action_List.Set_Capacity (2);
- Add_Action (Table.States (143), (27, 34), (56, 0), 1, null, null);
- Table.States (143).Kernel := To_Vector ((0 => ((56, 0), 71, 0,
(56, 0), 1)));
- Table.States (143).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (56, 0), 1)));
+ Add_Action (Table.States (143), (29, 36), (58, 0), 1);
+ Table.States (143).Kernel := To_Vector ((0 => ((58, 0), 73, 0,
(58, 0), 1)));
+ Table.States (143).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 0), 1)));
Table.States (144).Action_List.Set_Capacity (1);
- Add_Action (Table.States (144), (1 => 34), (58, 1), 1, null,
identifier_opt_1_check'Access);
- Table.States (144).Kernel := To_Vector ((0 => ((58, 1), 37, 0,
(58, 1), 1)));
- Table.States (144).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 1), 1)));
+ Add_Action (Table.States (144), (1 => 36), (60, 1), 1);
+ Table.States (144).Kernel := To_Vector ((0 => ((60, 1), 39, 0,
(60, 1), 1)));
+ Table.States (144).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (60, 1), 1)));
Table.States (145).Action_List.Set_Capacity (1);
- Add_Action (Table.States (145), 34, (68, 0), 173);
- Table.States (145).Kernel := To_Vector ((0 => ((68, 0), 58, 1,
(2147483647, 0), 0)));
- Table.States (145).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (68, 0), 34, 173)));
+ Add_Action (Table.States (145), 36, (70, 0), 173);
+ Table.States (145).Kernel := To_Vector ((0 => ((70, 0), 60, 1,
(32767, 0), 0)));
+ Table.States (145).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (70, 0), 36, 173)));
Table.States (146).Action_List.Set_Capacity (2);
- Add_Action (Table.States (146), 34, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (146), 37, (58, 1), 144);
+ Add_Action (Table.States (146), 36, Reduce, (60, 0), 0);
+ Add_Action (Table.States (146), 39, (60, 1), 144);
Table.States (146).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (146), 58, 174);
- Table.States (146).Kernel := To_Vector ((0 => ((65, 0), 8, 1,
(2147483647, 0), 0)));
- Table.States (146).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 0), 0)));
+ Add_Goto (Table.States (146), 60, 174);
+ Table.States (146).Kernel := To_Vector ((0 => ((67, 0), 10, 1,
(32767, 0), 0)));
+ Table.States (146).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (60, 0), 0)));
Table.States (147).Action_List.Set_Capacity (4);
- Add_Action (Table.States (147), 17, (54, 2), 175);
- Add_Action (Table.States (147), 32, Reduce, (54, 0), 0, null,
null);
- Add_Action (Table.States (147), 35, Reduce, (54, 0), 0, null,
null);
- Add_Action (Table.States (147), 38, (54, 1), 176);
+ Add_Action (Table.States (147), 19, (56, 2), 175);
+ Add_Action (Table.States (147), 34, Reduce, (56, 0), 0);
+ Add_Action (Table.States (147), 37, Reduce, (56, 0), 0);
+ Add_Action (Table.States (147), 40, (56, 1), 176);
Table.States (147).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (147), 54, 177);
- Add_Goto (Table.States (147), 55, 178);
- Table.States (147).Kernel := To_Vector ((0 => ((46, 0), 25, 1,
(2147483647, 0), 0)));
- Table.States (147).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (55, 0), 0)));
+ Add_Goto (Table.States (147), 56, 177);
+ Add_Goto (Table.States (147), 57, 178);
+ Table.States (147).Kernel := To_Vector ((0 => ((48, 0), 27, 1,
(32767, 0), 0)));
+ Table.States (147).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (57, 0), 0)));
Table.States (148).Action_List.Set_Capacity (2);
- Add_Action (Table.States (148), (8, 25), (47, 1), 1, null, null);
- Table.States (148).Kernel := To_Vector ((0 => ((47, 1), 46, 0,
(47, 1), 1)));
- Table.States (148).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (47, 1), 1)));
+ Add_Action (Table.States (148), (10, 27), (49, 1), 1);
+ Table.States (148).Kernel := To_Vector ((0 => ((49, 1), 48, 0,
(49, 1), 1)));
+ Table.States (148).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (49, 1), 1)));
Table.States (149).Action_List.Set_Capacity (2);
- Add_Action (Table.States (149), 8, (45, 0), 179);
- Add_Action (Table.States (149), 25, (46, 0), 147);
+ Add_Action (Table.States (149), 10, (47, 0), 179);
+ Add_Action (Table.States (149), 27, (48, 0), 147);
Table.States (149).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (149), 46, 180);
- Table.States (149).Kernel := To_Vector ((((45, 0), 47, 3,
(2147483647, 0), 0), ((47, 2), 47, 2,
- (2147483647, 0), 0)));
- Table.States (149).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (45, 0), 8, 179)));
+ Add_Goto (Table.States (149), 48, 180);
+ Table.States (149).Kernel := To_Vector ((((47, 0), 49, 3,
(32767, 0), 0), ((49, 2), 49, 2, (32767, 0),
+ 0)));
+ Table.States (149).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (47, 0), 10, 179)));
Table.States (150).Action_List.Set_Capacity (2);
- Add_Action (Table.States (150), (13, 31), (59, 1), 3, null, null);
- Table.States (150).Kernel := To_Vector ((0 => ((59, 1), 37, 0,
(59, 1), 3)));
- Table.States (150).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (59, 1), 3)));
+ Add_Action (Table.States (150), (15, 33), (61, 1), 3);
+ Table.States (150).Kernel := To_Vector ((0 => ((61, 1), 39, 0,
(61, 1), 3)));
+ Table.States (150).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (61, 1), 3)));
Table.States (151).Action_List.Set_Capacity (1);
- Add_Action (Table.States (151), 21, (42, 3), 181);
- Table.States (151).Kernel := To_Vector ((0 => ((42, 3), 38, 3,
(2147483647, 0), 0)));
- Table.States (151).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (42, 3), 21, 181)));
+ Add_Action (Table.States (151), 23, (44, 3), 181);
+ Table.States (151).Kernel := To_Vector ((0 => ((44, 3), 40, 3,
(32767, 0), 0)));
+ Table.States (151).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 3), 23, 181)));
Table.States (152).Action_List.Set_Capacity (1);
- Add_Action (Table.States (152), (1 => 21), (54, 2), 1, null,
null);
- Table.States (152).Kernel := To_Vector ((0 => ((54, 2), 17, 0,
(54, 2), 1)));
- Table.States (152).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (54, 2), 1)));
+ Add_Action (Table.States (152), (1 => 23), (56, 2), 1);
+ Table.States (152).Kernel := To_Vector ((0 => ((56, 2), 19, 0,
(56, 2), 1)));
+ Table.States (152).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (56, 2), 1)));
Table.States (153).Action_List.Set_Capacity (1);
- Add_Action (Table.States (153), (1 => 21), (54, 1), 1, null,
null);
- Table.States (153).Kernel := To_Vector ((0 => ((54, 1), 38, 0,
(54, 1), 1)));
- Table.States (153).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (54, 1), 1)));
+ Add_Action (Table.States (153), (1 => 23), (56, 1), 1);
+ Table.States (153).Kernel := To_Vector ((0 => ((56, 1), 40, 0,
(56, 1), 1)));
+ Table.States (153).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (56, 1), 1)));
Table.States (154).Action_List.Set_Capacity (1);
- Add_Action (Table.States (154), 21, (42, 1), 182);
- Table.States (154).Kernel := To_Vector ((((42, 1), 54, 3,
(2147483647, 0), 0), ((42, 2), 54, 5,
- (2147483647, 0), 0)));
- Table.States (154).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (42, 1), 21, 182)));
+ Add_Action (Table.States (154), 23, (44, 1), 182);
+ Table.States (154).Kernel := To_Vector ((((44, 1), 56, 3,
(32767, 0), 0), ((44, 2), 56, 5, (32767, 0),
+ 0)));
+ Table.States (154).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 1), 23, 182)));
Table.States (155).Action_List.Set_Capacity (2);
- Add_Action (Table.States (155), 27, (56, 1), 170);
- Add_Action (Table.States (155), 34, (42, 0), 183);
- Table.States (155).Kernel := To_Vector ((((42, 0), 56, 1,
(2147483647, 0), 0), ((56, 1), 56, 1,
- (2147483647, 0), 0)));
- Table.States (155).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (42, 0), 34, 183)));
+ Add_Action (Table.States (155), 29, (58, 1), 170);
+ Add_Action (Table.States (155), 36, (44, 0), 183);
+ Table.States (155).Kernel := To_Vector ((((44, 0), 58, 1,
(32767, 0), 0), ((58, 1), 58, 1, (32767, 0),
+ 0)));
+ Table.States (155).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 0), 36, 183)));
Table.States (156).Action_List.Set_Capacity (2);
- Add_Action (Table.States (156), 13, (62, 0), 184);
- Add_Action (Table.States (156), 31, (59, 1), 121);
- Table.States (156).Kernel := To_Vector ((((59, 1), 59, 2,
(2147483647, 0), 0), ((62, 0), 59, 3,
- (2147483647, 0), 0)));
- Table.States (156).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (62, 0), 13, 184)));
+ Add_Action (Table.States (156), 15, (64, 0), 184);
+ Add_Action (Table.States (156), 33, (61, 1), 121);
+ Table.States (156).Kernel := To_Vector ((((61, 1), 61, 2,
(32767, 0), 0), ((64, 0), 61, 3, (32767, 0),
+ 0)));
+ Table.States (156).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (64, 0), 15, 184)));
Table.States (157).Action_List.Set_Capacity (1);
- Add_Action (Table.States (157), 8, (61, 0), 185);
- Table.States (157).Kernel := To_Vector ((0 => ((61, 0), 53, 2,
(2147483647, 0), 0)));
- Table.States (157).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (61, 0), 8, 185)));
+ Add_Action (Table.States (157), 10, (63, 0), 185);
+ Table.States (157).Kernel := To_Vector ((0 => ((63, 0), 55, 2,
(32767, 0), 0)));
+ Table.States (157).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (63, 0), 10, 185)));
Table.States (158).Action_List.Set_Capacity (2);
- Add_Action (Table.States (158), (31, 34), (58, 1), 1, null,
identifier_opt_1_check'Access);
- Table.States (158).Kernel := To_Vector ((0 => ((58, 1), 37, 0,
(58, 1), 1)));
- Table.States (158).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 1), 1)));
+ Add_Action (Table.States (158), (33, 36), (60, 1), 1);
+ Table.States (158).Kernel := To_Vector ((0 => ((60, 1), 39, 0,
(60, 1), 1)));
+ Table.States (158).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (60, 1), 1)));
+ end Subr_3;
+ procedure Subr_4
+ is begin
Table.States (159).Action_List.Set_Capacity (2);
- Add_Action (Table.States (159), (31, 34), (59, 0), 1, null, null);
- Table.States (159).Kernel := To_Vector ((0 => ((59, 0), 58, 0,
(59, 0), 1)));
- Table.States (159).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (59, 0), 1)));
+ Add_Action (Table.States (159), (33, 36), (61, 0), 1);
+ Table.States (159).Kernel := To_Vector ((0 => ((61, 0), 60, 0,
(61, 0), 1)));
+ Table.States (159).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (61, 0), 1)));
Table.States (160).Action_List.Set_Capacity (2);
- Add_Action (Table.States (160), 31, (59, 1), 186);
- Add_Action (Table.States (160), 34, (63, 0), 187);
- Table.States (160).Kernel := To_Vector ((((59, 1), 59, 2,
(2147483647, 0), 0), ((63, 0), 59, 1,
- (2147483647, 0), 0)));
- Table.States (160).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (63, 0), 34, 187)));
+ Add_Action (Table.States (160), 33, (61, 1), 186);
+ Add_Action (Table.States (160), 36, (65, 0), 187);
+ Table.States (160).Kernel := To_Vector ((((61, 1), 61, 2,
(32767, 0), 0), ((65, 0), 61, 1, (32767, 0),
+ 0)));
+ Table.States (160).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (65, 0), 36, 187)));
Table.States (161).Action_List.Set_Capacity (11);
- Add_Action (Table.States (161), 10, (57, 0), 32);
- Add_Action (Table.States (161), 11, (57, 1), 33);
- Add_Action (Table.States (161), 14, (41, 0), 34);
- Add_Action (Table.States (161), 19, (43, 0), 9);
- Add_Action (Table.States (161), 21, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (161), 27, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (161), 30, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (161), 31, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (161), 33, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (161), 37, (58, 1), 36);
- Add_Action (Table.States (161), 38, (69, 0), 37);
+ Add_Action (Table.States (161), 12, (59, 0), 32);
+ Add_Action (Table.States (161), 13, (59, 1), 33);
+ Add_Action (Table.States (161), 16, (43, 0), 34);
+ Add_Action (Table.States (161), 21, (45, 0), 9);
+ Add_Action (Table.States (161), 23, Reduce, (60, 0), 0);
+ Add_Action (Table.States (161), 29, Reduce, (60, 0), 0);
+ Add_Action (Table.States (161), 32, Reduce, (60, 0), 0);
+ Add_Action (Table.States (161), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (161), 35, Reduce, (60, 0), 0);
+ Add_Action (Table.States (161), 39, (60, 1), 36);
+ Add_Action (Table.States (161), 40, (71, 0), 37);
Table.States (161).Goto_List.Set_Capacity (10);
- Add_Goto (Table.States (161), 41, 38);
- Add_Goto (Table.States (161), 43, 39);
- Add_Goto (Table.States (161), 44, 40);
- Add_Goto (Table.States (161), 56, 41);
- Add_Goto (Table.States (161), 57, 42);
- Add_Goto (Table.States (161), 58, 43);
- Add_Goto (Table.States (161), 59, 44);
- Add_Goto (Table.States (161), 69, 45);
- Add_Goto (Table.States (161), 70, 188);
- Add_Goto (Table.States (161), 71, 47);
- Table.States (161).Kernel := To_Vector ((0 => ((41, 0), 14, 1,
(2147483647, 0), 0)));
- Table.States (161).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (70, 0), 0)));
+ Add_Goto (Table.States (161), 43, 38);
+ Add_Goto (Table.States (161), 45, 39);
+ Add_Goto (Table.States (161), 46, 40);
+ Add_Goto (Table.States (161), 58, 41);
+ Add_Goto (Table.States (161), 59, 42);
+ Add_Goto (Table.States (161), 60, 43);
+ Add_Goto (Table.States (161), 61, 44);
+ Add_Goto (Table.States (161), 71, 45);
+ Add_Goto (Table.States (161), 72, 188);
+ Add_Goto (Table.States (161), 73, 47);
+ Table.States (161).Kernel := To_Vector ((0 => ((43, 0), 16, 1,
(32767, 0), 0)));
+ Table.States (161).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (72, 0), 0)));
Table.States (162).Action_List.Set_Capacity (1);
- Add_Action (Table.States (162), 34, (72, 0), 189);
- Table.States (162).Kernel := To_Vector ((0 => ((72, 0), 41, 1,
(2147483647, 0), 0)));
- Table.States (162).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (72, 0), 34, 189)));
+ Add_Action (Table.States (162), 36, (74, 0), 189);
+ Table.States (162).Kernel := To_Vector ((0 => ((74, 0), 43, 1,
(32767, 0), 0)));
+ Table.States (162).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (74, 0), 36, 189)));
Table.States (163).Action_List.Set_Capacity (10);
- Add_Action (Table.States (163), 10, (57, 0), 130);
- Add_Action (Table.States (163), 11, (57, 1), 131);
- Add_Action (Table.States (163), 14, (41, 0), 132);
- Add_Action (Table.States (163), 19, (43, 0), 9);
- Add_Action (Table.States (163), 27, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (163), 31, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (163), 33, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (163), 34, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (163), 37, (58, 1), 133);
- Add_Action (Table.States (163), 38, (69, 0), 134);
+ Add_Action (Table.States (163), 12, (59, 0), 130);
+ Add_Action (Table.States (163), 13, (59, 1), 131);
+ Add_Action (Table.States (163), 16, (43, 0), 132);
+ Add_Action (Table.States (163), 21, (45, 0), 9);
+ Add_Action (Table.States (163), 29, Reduce, (60, 0), 0);
+ Add_Action (Table.States (163), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (163), 35, Reduce, (60, 0), 0);
+ Add_Action (Table.States (163), 36, Reduce, (60, 0), 0);
+ Add_Action (Table.States (163), 39, (60, 1), 133);
+ Add_Action (Table.States (163), 40, (71, 0), 134);
Table.States (163).Goto_List.Set_Capacity (9);
- Add_Goto (Table.States (163), 41, 135);
- Add_Goto (Table.States (163), 43, 136);
- Add_Goto (Table.States (163), 44, 137);
- Add_Goto (Table.States (163), 56, 190);
- Add_Goto (Table.States (163), 57, 139);
- Add_Goto (Table.States (163), 58, 140);
- Add_Goto (Table.States (163), 59, 141);
- Add_Goto (Table.States (163), 69, 142);
- Add_Goto (Table.States (163), 71, 143);
- Table.States (163).Kernel := To_Vector ((0 => ((67, 1), 29, 1,
(2147483647, 0), 0)));
- Table.States (163).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (56, 0), 0)));
+ Add_Goto (Table.States (163), 43, 135);
+ Add_Goto (Table.States (163), 45, 136);
+ Add_Goto (Table.States (163), 46, 137);
+ Add_Goto (Table.States (163), 58, 190);
+ Add_Goto (Table.States (163), 59, 139);
+ Add_Goto (Table.States (163), 60, 140);
+ Add_Goto (Table.States (163), 61, 141);
+ Add_Goto (Table.States (163), 71, 142);
+ Add_Goto (Table.States (163), 73, 143);
+ Table.States (163).Kernel := To_Vector ((0 => ((69, 1), 31, 1,
(32767, 0), 0)));
+ Table.States (163).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 0), 0)));
Table.States (164).Action_List.Set_Capacity (11);
- Add_Action (Table.States (164), 10, (57, 0), 32);
- Add_Action (Table.States (164), 11, (57, 1), 33);
- Add_Action (Table.States (164), 14, (41, 0), 34);
- Add_Action (Table.States (164), 19, (43, 0), 9);
- Add_Action (Table.States (164), 21, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (164), 27, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (164), 30, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (164), 31, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (164), 33, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (164), 37, (58, 1), 36);
- Add_Action (Table.States (164), 38, (69, 0), 37);
+ Add_Action (Table.States (164), 12, (59, 0), 32);
+ Add_Action (Table.States (164), 13, (59, 1), 33);
+ Add_Action (Table.States (164), 16, (43, 0), 34);
+ Add_Action (Table.States (164), 21, (45, 0), 9);
+ Add_Action (Table.States (164), 23, Reduce, (60, 0), 0);
+ Add_Action (Table.States (164), 29, Reduce, (60, 0), 0);
+ Add_Action (Table.States (164), 32, Reduce, (60, 0), 0);
+ Add_Action (Table.States (164), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (164), 35, Reduce, (60, 0), 0);
+ Add_Action (Table.States (164), 39, (60, 1), 36);
+ Add_Action (Table.States (164), 40, (71, 0), 37);
Table.States (164).Goto_List.Set_Capacity (10);
- Add_Goto (Table.States (164), 41, 38);
- Add_Goto (Table.States (164), 43, 39);
- Add_Goto (Table.States (164), 44, 40);
- Add_Goto (Table.States (164), 56, 41);
- Add_Goto (Table.States (164), 57, 42);
- Add_Goto (Table.States (164), 58, 43);
- Add_Goto (Table.States (164), 59, 44);
- Add_Goto (Table.States (164), 69, 45);
- Add_Goto (Table.States (164), 70, 168);
- Add_Goto (Table.States (164), 71, 47);
- Table.States (164).Kernel := To_Vector ((0 => ((41, 0), 14, 1,
(2147483647, 0), 0)));
- Table.States (164).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (70, 0), 0)));
+ Add_Goto (Table.States (164), 43, 38);
+ Add_Goto (Table.States (164), 45, 39);
+ Add_Goto (Table.States (164), 46, 40);
+ Add_Goto (Table.States (164), 58, 41);
+ Add_Goto (Table.States (164), 59, 42);
+ Add_Goto (Table.States (164), 60, 43);
+ Add_Goto (Table.States (164), 61, 44);
+ Add_Goto (Table.States (164), 71, 45);
+ Add_Goto (Table.States (164), 72, 168);
+ Add_Goto (Table.States (164), 73, 47);
+ Table.States (164).Kernel := To_Vector ((0 => ((43, 0), 16, 1,
(32767, 0), 0)));
+ Table.States (164).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (72, 0), 0)));
Table.States (165).Action_List.Set_Capacity (2);
- Add_Action (Table.States (165), (27, 34), (57, 0), 2, null, null);
- Table.States (165).Kernel := To_Vector ((0 => ((57, 0), 41, 0,
(57, 0), 2)));
- Table.States (165).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (57, 0), 2)));
+ Add_Action (Table.States (165), (29, 36), (59, 0), 2);
+ Table.States (165).Kernel := To_Vector ((0 => ((59, 0), 43, 0,
(59, 0), 2)));
+ Table.States (165).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (59, 0), 2)));
Table.States (166).Action_List.Set_Capacity (2);
- Add_Action (Table.States (166), (27, 34), (57, 1), 2, null, null);
- Table.States (166).Kernel := To_Vector ((0 => ((57, 1), 41, 0,
(57, 1), 2)));
- Table.States (166).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (57, 1), 2)));
+ Add_Action (Table.States (166), (29, 36), (59, 1), 2);
+ Table.States (166).Kernel := To_Vector ((0 => ((59, 1), 43, 0,
(59, 1), 2)));
+ Table.States (166).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (59, 1), 2)));
Table.States (167).Action_List.Set_Capacity (2);
- Add_Action (Table.States (167), (27, 34), (71, 1), 2, null, null);
- Table.States (167).Kernel := To_Vector ((0 => ((71, 1), 21, 0,
(71, 1), 2)));
- Table.States (167).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (71, 1), 2)));
+ Add_Action (Table.States (167), (29, 36), (73, 1), 2);
+ Table.States (167).Kernel := To_Vector ((0 => ((73, 1), 23, 0,
(73, 1), 2)));
+ Table.States (167).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (73, 1), 2)));
Table.States (168).Action_List.Set_Capacity (2);
- Add_Action (Table.States (168), 21, (41, 0), 191);
- Add_Action (Table.States (168), 30, (70, 1), 67);
- Table.States (168).Kernel := To_Vector ((((41, 0), 70, 1,
(2147483647, 0), 0), ((70, 1), 70, 1,
- (2147483647, 0), 0)));
- Table.States (168).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (41, 0), 21, 191)));
+ Add_Action (Table.States (168), 23, (43, 0), 191);
+ Add_Action (Table.States (168), 32, (72, 1), 67);
+ Table.States (168).Kernel := To_Vector ((((43, 0), 72, 1,
(32767, 0), 0), ((72, 1), 72, 1, (32767, 0),
+ 0)));
+ Table.States (168).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (43, 0), 23, 191)));
Table.States (169).Action_List.Set_Capacity (1);
- Add_Action (Table.States (169), 37, (44, 0), 192);
- Table.States (169).Kernel := To_Vector ((((44, 0), 33, 1,
(2147483647, 0), 0), ((44, 1), 33, 4,
- (2147483647, 0), 0)));
- Table.States (169).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 0), 37, 192)));
+ Add_Action (Table.States (169), 39, (46, 0), 192);
+ Table.States (169).Kernel := To_Vector ((((46, 0), 35, 1,
(32767, 0), 0), ((46, 1), 35, 4, (32767, 0),
+ 0)));
+ Table.States (169).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (46, 0), 39, 192)));
Table.States (170).Action_List.Set_Capacity (10);
- Add_Action (Table.States (170), 10, (57, 0), 130);
- Add_Action (Table.States (170), 11, (57, 1), 131);
- Add_Action (Table.States (170), 14, (41, 0), 132);
- Add_Action (Table.States (170), 19, (43, 0), 9);
- Add_Action (Table.States (170), 27, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (170), 31, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (170), 33, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (170), 34, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (170), 37, (58, 1), 133);
- Add_Action (Table.States (170), 38, (69, 0), 134);
+ Add_Action (Table.States (170), 12, (59, 0), 130);
+ Add_Action (Table.States (170), 13, (59, 1), 131);
+ Add_Action (Table.States (170), 16, (43, 0), 132);
+ Add_Action (Table.States (170), 21, (45, 0), 9);
+ Add_Action (Table.States (170), 29, Reduce, (60, 0), 0);
+ Add_Action (Table.States (170), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (170), 35, Reduce, (60, 0), 0);
+ Add_Action (Table.States (170), 36, Reduce, (60, 0), 0);
+ Add_Action (Table.States (170), 39, (60, 1), 133);
+ Add_Action (Table.States (170), 40, (71, 0), 134);
Table.States (170).Goto_List.Set_Capacity (8);
- Add_Goto (Table.States (170), 41, 135);
- Add_Goto (Table.States (170), 43, 136);
- Add_Goto (Table.States (170), 44, 137);
- Add_Goto (Table.States (170), 57, 139);
- Add_Goto (Table.States (170), 58, 140);
- Add_Goto (Table.States (170), 59, 141);
- Add_Goto (Table.States (170), 69, 142);
- Add_Goto (Table.States (170), 71, 193);
- Table.States (170).Kernel := To_Vector ((0 => ((56, 1), 27, 0,
(71, 0), 1)));
- Table.States (170).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (71, 0), 1)));
+ Add_Goto (Table.States (170), 43, 135);
+ Add_Goto (Table.States (170), 45, 136);
+ Add_Goto (Table.States (170), 46, 137);
+ Add_Goto (Table.States (170), 59, 139);
+ Add_Goto (Table.States (170), 60, 140);
+ Add_Goto (Table.States (170), 61, 141);
+ Add_Goto (Table.States (170), 71, 142);
+ Add_Goto (Table.States (170), 73, 193);
+ Table.States (170).Kernel := To_Vector ((0 => ((58, 1), 29, 0,
(73, 0), 0)));
+ Table.States (170).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (73, 0), 0)));
Table.States (171).Action_List.Set_Capacity (7);
- Add_Action (Table.States (171), (6, 8, 12, 16, 18, 23, 37), (67,
0), 4, simple_declarative_item_0'Access,
- null);
- Table.States (171).Kernel := To_Vector ((0 => ((67, 0), 34, 0,
(67, 0), 4)));
- Table.States (171).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (67, 0), 4)));
+ Add_Action (Table.States (171), (8, 10, 14, 18, 20, 25, 39), (69,
0), 4);
+ Table.States (171).Kernel := To_Vector ((0 => ((69, 0), 36, 0,
(69, 0), 4)));
+ Table.States (171).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (69, 0), 4)));
Table.States (172).Action_List.Set_Capacity (1);
- Add_Action (Table.States (172), 37, (59, 1), 194);
- Table.States (172).Kernel := To_Vector ((0 => ((59, 1), 31, 1,
(2147483647, 0), 0)));
- Table.States (172).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (59, 1), 37, 194)));
+ Add_Action (Table.States (172), 39, (61, 1), 194);
+ Table.States (172).Kernel := To_Vector ((0 => ((61, 1), 33, 1,
(32767, 0), 0)));
+ Table.States (172).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (61, 1), 39, 194)));
Table.States (173).Action_List.Set_Capacity (1);
- Add_Action (Table.States (173), (1 => 39), (68, 0), 7,
simple_project_declaration_0'Access,
- simple_project_declaration_0_check'Access);
- Table.States (173).Kernel := To_Vector ((0 => ((68, 0), 34, 0,
(68, 0), 7)));
- Table.States (173).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (68, 0), 7)));
+ Add_Action (Table.States (173), (1 => 41), (70, 0), 7);
+ Table.States (173).Kernel := To_Vector ((0 => ((70, 0), 36, 0,
(70, 0), 7)));
+ Table.States (173).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (70, 0), 7)));
Table.States (174).Action_List.Set_Capacity (1);
- Add_Action (Table.States (174), 34, (65, 0), 195);
- Table.States (174).Kernel := To_Vector ((0 => ((65, 0), 58, 1,
(2147483647, 0), 0)));
- Table.States (174).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (65, 0), 34, 195)));
+ Add_Action (Table.States (174), 36, (67, 0), 195);
+ Table.States (174).Kernel := To_Vector ((0 => ((67, 0), 60, 1,
(32767, 0), 0)));
+ Table.States (174).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (67, 0), 36, 195)));
Table.States (175).Action_List.Set_Capacity (2);
- Add_Action (Table.States (175), (32, 35), (54, 2), 1, null, null);
- Table.States (175).Kernel := To_Vector ((0 => ((54, 2), 17, 0,
(54, 2), 1)));
- Table.States (175).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (54, 2), 1)));
+ Add_Action (Table.States (175), (34, 37), (56, 2), 1);
+ Table.States (175).Kernel := To_Vector ((0 => ((56, 2), 19, 0,
(56, 2), 1)));
+ Table.States (175).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (56, 2), 1)));
Table.States (176).Action_List.Set_Capacity (2);
- Add_Action (Table.States (176), (32, 35), (54, 1), 1, null, null);
- Table.States (176).Kernel := To_Vector ((0 => ((54, 1), 38, 0,
(54, 1), 1)));
- Table.States (176).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (54, 1), 1)));
+ Add_Action (Table.States (176), (34, 37), (56, 1), 1);
+ Table.States (176).Kernel := To_Vector ((0 => ((56, 1), 40, 0,
(56, 1), 1)));
+ Table.States (176).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (56, 1), 1)));
Table.States (177).Action_List.Set_Capacity (2);
- Add_Action (Table.States (177), (32, 35), (55, 0), 1, null, null);
- Table.States (177).Kernel := To_Vector ((0 => ((55, 0), 54, 0,
(55, 0), 1)));
- Table.States (177).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (55, 0), 1)));
+ Add_Action (Table.States (177), (34, 37), (57, 0), 1);
+ Table.States (177).Kernel := To_Vector ((0 => ((57, 0), 56, 0,
(57, 0), 1)));
+ Table.States (177).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (57, 0), 1)));
Table.States (178).Action_List.Set_Capacity (2);
- Add_Action (Table.States (178), 32, (46, 0), 196);
- Add_Action (Table.States (178), 35, (55, 1), 197);
- Table.States (178).Kernel := To_Vector ((((46, 0), 55, 1,
(2147483647, 0), 0), ((55, 1), 55, 1,
- (2147483647, 0), 0)));
- Table.States (178).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (46, 0), 32, 196)));
+ Add_Action (Table.States (178), 34, (48, 0), 196);
+ Add_Action (Table.States (178), 37, (57, 1), 197);
+ Table.States (178).Kernel := To_Vector ((((48, 0), 57, 1,
(32767, 0), 0), ((57, 1), 57, 1, (32767, 0),
+ 0)));
+ Table.States (178).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (48, 0), 34, 196)));
Table.States (179).Action_List.Set_Capacity (1);
- Add_Action (Table.States (179), 6, (45, 0), 198);
- Table.States (179).Kernel := To_Vector ((0 => ((45, 0), 8, 2,
(2147483647, 0), 0)));
- Table.States (179).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (45, 0), 6, 198)));
+ Add_Action (Table.States (179), 8, (47, 0), 198);
+ Table.States (179).Kernel := To_Vector ((0 => ((47, 0), 10, 2,
(32767, 0), 0)));
+ Table.States (179).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (47, 0), 8, 198)));
Table.States (180).Action_List.Set_Capacity (2);
- Add_Action (Table.States (180), (8, 25), (47, 2), 2, null, null);
- Table.States (180).Kernel := To_Vector ((0 => ((47, 2), 46, 0,
(47, 2), 2)));
- Table.States (180).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (47, 2), 2)));
+ Add_Action (Table.States (180), (10, 27), (49, 2), 2);
+ Table.States (180).Kernel := To_Vector ((0 => ((49, 2), 48, 0,
(49, 2), 2)));
+ Table.States (180).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (49, 2), 2)));
Table.States (181).Action_List.Set_Capacity (1);
- Add_Action (Table.States (181), 24, (42, 3), 199);
- Table.States (181).Kernel := To_Vector ((0 => ((42, 3), 21, 2,
(2147483647, 0), 0)));
- Table.States (181).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (42, 3), 24, 199)));
+ Add_Action (Table.States (181), 26, (44, 3), 199);
+ Table.States (181).Kernel := To_Vector ((0 => ((44, 3), 23, 2,
(32767, 0), 0)));
+ Table.States (181).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 3), 26, 199)));
Table.States (182).Action_List.Set_Capacity (1);
- Add_Action (Table.States (182), 24, (42, 1), 200);
- Table.States (182).Kernel := To_Vector ((((42, 1), 21, 2,
(2147483647, 0), 0), ((42, 2), 21, 4,
- (2147483647, 0), 0)));
- Table.States (182).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (42, 1), 24, 200)));
+ Add_Action (Table.States (182), 26, (44, 1), 200);
+ Table.States (182).Kernel := To_Vector ((((44, 1), 23, 2,
(32767, 0), 0), ((44, 2), 23, 4, (32767, 0),
+ 0)));
+ Table.States (182).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 1), 26, 200)));
Table.States (183).Action_List.Set_Capacity (7);
- Add_Action (Table.States (183), (6, 8, 12, 16, 18, 23, 37), (42,
0), 5, attribute_declaration_0'Access,
- null);
- Table.States (183).Kernel := To_Vector ((0 => ((42, 0), 34, 0,
(42, 0), 5)));
- Table.States (183).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (42, 0), 5)));
+ Add_Action (Table.States (183), (8, 10, 14, 18, 20, 25, 39), (44,
0), 5);
+ Table.States (183).Kernel := To_Vector ((0 => ((44, 0), 36, 0,
(44, 0), 5)));
+ Table.States (183).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (44, 0), 5)));
Table.States (184).Action_List.Set_Capacity (7);
- Add_Action (Table.States (184), 6, (45, 0), 85);
- Add_Action (Table.States (184), 8, Reduce, (53, 0), 0, null,
null);
- Add_Action (Table.States (184), 12, (42, 0), 86);
- Add_Action (Table.States (184), 16, (67, 4), 87);
- Add_Action (Table.States (184), 18, (61, 0), 88);
- Add_Action (Table.States (184), 23, (72, 0), 89);
- Add_Action (Table.States (184), 37, (67, 0), 90);
+ Add_Action (Table.States (184), 8, (47, 0), 85);
+ Add_Action (Table.States (184), 10, Reduce, (55, 0), 0);
+ Add_Action (Table.States (184), 14, (44, 0), 86);
+ Add_Action (Table.States (184), 18, (69, 4), 87);
+ Add_Action (Table.States (184), 20, (63, 0), 88);
+ Add_Action (Table.States (184), 25, (74, 0), 89);
+ Add_Action (Table.States (184), 39, (69, 0), 90);
Table.States (184).Goto_List.Set_Capacity (11);
- Add_Goto (Table.States (184), 42, 91);
- Add_Goto (Table.States (184), 45, 92);
- Add_Goto (Table.States (184), 51, 93);
- Add_Goto (Table.States (184), 52, 94);
- Add_Goto (Table.States (184), 53, 201);
- Add_Goto (Table.States (184), 60, 96);
- Add_Goto (Table.States (184), 61, 97);
- Add_Goto (Table.States (184), 62, 98);
- Add_Goto (Table.States (184), 63, 99);
- Add_Goto (Table.States (184), 67, 100);
- Add_Goto (Table.States (184), 72, 101);
- Table.States (184).Kernel := To_Vector ((0 => ((62, 0), 13, 2,
(2147483647, 0), 0)));
- Table.States (184).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (53, 0), 0)));
+ Add_Goto (Table.States (184), 44, 91);
+ Add_Goto (Table.States (184), 47, 92);
+ Add_Goto (Table.States (184), 53, 93);
+ Add_Goto (Table.States (184), 54, 94);
+ Add_Goto (Table.States (184), 55, 201);
+ Add_Goto (Table.States (184), 62, 96);
+ Add_Goto (Table.States (184), 63, 97);
+ Add_Goto (Table.States (184), 64, 98);
+ Add_Goto (Table.States (184), 65, 99);
+ Add_Goto (Table.States (184), 69, 100);
+ Add_Goto (Table.States (184), 74, 101);
+ Table.States (184).Kernel := To_Vector ((0 => ((64, 0), 15, 2,
(32767, 0), 0)));
+ Table.States (184).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (55, 0), 0)));
Table.States (185).Action_List.Set_Capacity (2);
- Add_Action (Table.States (185), 34, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (185), 37, (58, 1), 144);
+ Add_Action (Table.States (185), 36, Reduce, (60, 0), 0);
+ Add_Action (Table.States (185), 39, (60, 1), 144);
Table.States (185).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (185), 58, 202);
- Table.States (185).Kernel := To_Vector ((0 => ((61, 0), 8, 1,
(2147483647, 0), 0)));
- Table.States (185).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 0), 0)));
+ Add_Goto (Table.States (185), 60, 202);
+ Table.States (185).Kernel := To_Vector ((0 => ((63, 0), 10, 1,
(32767, 0), 0)));
+ Table.States (185).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (60, 0), 0)));
Table.States (186).Action_List.Set_Capacity (1);
- Add_Action (Table.States (186), 37, (59, 1), 203);
- Table.States (186).Kernel := To_Vector ((0 => ((59, 1), 31, 1,
(2147483647, 0), 0)));
- Table.States (186).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (59, 1), 37, 203)));
+ Add_Action (Table.States (186), 39, (61, 1), 203);
+ Table.States (186).Kernel := To_Vector ((0 => ((61, 1), 33, 1,
(32767, 0), 0)));
+ Table.States (186).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (61, 1), 39, 203)));
Table.States (187).Action_List.Set_Capacity (7);
- Add_Action (Table.States (187), (6, 8, 12, 16, 18, 23, 37), (63,
0), 5, package_renaming_0'Access, null);
- Table.States (187).Kernel := To_Vector ((0 => ((63, 0), 34, 0,
(63, 0), 5)));
- Table.States (187).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (63, 0), 5)));
+ Add_Action (Table.States (187), (8, 10, 14, 18, 20, 25, 39), (65,
0), 5);
+ Table.States (187).Kernel := To_Vector ((0 => ((65, 0), 36, 0,
(65, 0), 5)));
+ Table.States (187).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (65, 0), 5)));
Table.States (188).Action_List.Set_Capacity (2);
- Add_Action (Table.States (188), 21, (41, 0), 204);
- Add_Action (Table.States (188), 30, (70, 1), 67);
- Table.States (188).Kernel := To_Vector ((((41, 0), 70, 1,
(2147483647, 0), 0), ((70, 1), 70, 1,
- (2147483647, 0), 0)));
- Table.States (188).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (41, 0), 21, 204)));
+ Add_Action (Table.States (188), 23, (43, 0), 204);
+ Add_Action (Table.States (188), 32, (72, 1), 67);
+ Table.States (188).Kernel := To_Vector ((((43, 0), 72, 1,
(32767, 0), 0), ((72, 1), 72, 1, (32767, 0),
+ 0)));
+ Table.States (188).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (43, 0), 23, 204)));
Table.States (189).Action_List.Set_Capacity (7);
- Add_Action (Table.States (189), (6, 8, 12, 16, 18, 23, 37), (72,
0), 5, typed_string_declaration_0'Access,
- null);
- Table.States (189).Kernel := To_Vector ((0 => ((72, 0), 34, 0,
(72, 0), 5)));
- Table.States (189).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (72, 0), 5)));
+ Add_Action (Table.States (189), (8, 10, 14, 18, 20, 25, 39), (74,
0), 5);
+ Table.States (189).Kernel := To_Vector ((0 => ((74, 0), 36, 0,
(74, 0), 5)));
+ Table.States (189).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (74, 0), 5)));
Table.States (190).Action_List.Set_Capacity (2);
- Add_Action (Table.States (190), 27, (56, 1), 170);
- Add_Action (Table.States (190), 34, (67, 1), 205);
- Table.States (190).Kernel := To_Vector ((((56, 1), 56, 1,
(2147483647, 0), 0), ((67, 1), 56, 1,
- (2147483647, 0), 0)));
- Table.States (190).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (67, 1), 34, 205)));
+ Add_Action (Table.States (190), 29, (58, 1), 170);
+ Add_Action (Table.States (190), 36, (69, 1), 205);
+ Table.States (190).Kernel := To_Vector ((((58, 1), 58, 1,
(32767, 0), 0), ((69, 1), 58, 1, (32767, 0),
+ 0)));
+ Table.States (190).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (69, 1), 36, 205)));
Table.States (191).Action_List.Set_Capacity (2);
- Add_Action (Table.States (191), (27, 34), (41, 0), 3,
aggregate_g_0'Access, null);
- Table.States (191).Kernel := To_Vector ((0 => ((41, 0), 21, 0,
(41, 0), 3)));
- Table.States (191).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (41, 0), 3)));
+ Add_Action (Table.States (191), (29, 36), (43, 0), 3);
+ Table.States (191).Kernel := To_Vector ((0 => ((43, 0), 23, 0,
(43, 0), 3)));
+ Table.States (191).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (43, 0), 3)));
Table.States (192).Action_List.Set_Capacity (3);
- Add_Action (Table.States (192), 14, (44, 1), 206);
- Add_Action (Table.States (192), 27, Reduce, (44, 0), 3, null,
null);
- Add_Action (Table.States (192), 34, Reduce, (44, 0), 3, null,
null);
- Table.States (192).Kernel := To_Vector ((((44, 0), 37, 0, (44,
0), 3), ((44, 1), 37, 3, (2147483647,
- 0), 0)));
- Table.States (192).Minimal_Complete_Actions := To_Vector
(((Reduce, (44, 0), 3), (Shift, (44, 1), 14,
+ Add_Action (Table.States (192), 16, (46, 1), 206);
+ Add_Action (Table.States (192), 29, Reduce, (46, 0), 3);
+ Add_Action (Table.States (192), 36, Reduce, (46, 0), 3);
+ Table.States (192).Kernel := To_Vector ((((46, 0), 39, 0, (46,
0), 3), ((46, 1), 39, 3, (32767, 0),
+ 0)));
+ Table.States (192).Minimal_Complete_Actions := To_Vector
(((Reduce, (46, 0), 3), (Shift, (46, 1), 16,
206)));
Table.States (193).Action_List.Set_Capacity (2);
- Add_Action (Table.States (193), (27, 34), (56, 1), 3, null, null);
- Table.States (193).Kernel := To_Vector ((0 => ((56, 1), 71, 0,
(56, 1), 3)));
- Table.States (193).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (56, 1), 3)));
+ Add_Action (Table.States (193), (29, 36), (58, 1), 3);
+ Table.States (193).Kernel := To_Vector ((0 => ((58, 1), 73, 0,
(58, 1), 3)));
+ Table.States (193).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 1), 3)));
Table.States (194).Action_List.Set_Capacity (4);
- Add_Action (Table.States (194), (27, 31, 33, 34), (59, 1), 3,
null, null);
- Table.States (194).Kernel := To_Vector ((0 => ((59, 1), 37, 0,
(59, 1), 3)));
- Table.States (194).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (59, 1), 3)));
+ Add_Action (Table.States (194), (29, 33, 35, 36), (61, 1), 3);
+ Table.States (194).Kernel := To_Vector ((0 => ((61, 1), 39, 0,
(61, 1), 3)));
+ Table.States (194).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (61, 1), 3)));
Table.States (195).Action_List.Set_Capacity (1);
- Add_Action (Table.States (195), (1 => 39), (65, 0), 9,
project_extension_0'Access,
- project_extension_0_check'Access);
- Table.States (195).Kernel := To_Vector ((0 => ((65, 0), 34, 0,
(65, 0), 9)));
- Table.States (195).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (65, 0), 9)));
+ Add_Action (Table.States (195), (1 => 41), (67, 0), 9);
+ Table.States (195).Kernel := To_Vector ((0 => ((67, 0), 36, 0,
(67, 0), 9)));
+ Table.States (195).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (67, 0), 9)));
Table.States (196).Action_List.Set_Capacity (8);
- Add_Action (Table.States (196), 6, (45, 0), 207);
- Add_Action (Table.States (196), 8, Reduce, (53, 0), 0, null,
null);
- Add_Action (Table.States (196), 12, (42, 0), 208);
- Add_Action (Table.States (196), 16, (67, 4), 209);
- Add_Action (Table.States (196), 18, (61, 0), 210);
- Add_Action (Table.States (196), 23, (72, 0), 211);
- Add_Action (Table.States (196), 25, Reduce, (53, 0), 0, null,
null);
- Add_Action (Table.States (196), 37, (67, 0), 212);
+ Add_Action (Table.States (196), 8, (47, 0), 207);
+ Add_Action (Table.States (196), 10, Reduce, (55, 0), 0);
+ Add_Action (Table.States (196), 14, (44, 0), 208);
+ Add_Action (Table.States (196), 18, (69, 4), 209);
+ Add_Action (Table.States (196), 20, (63, 0), 210);
+ Add_Action (Table.States (196), 25, (74, 0), 211);
+ Add_Action (Table.States (196), 27, Reduce, (55, 0), 0);
+ Add_Action (Table.States (196), 39, (69, 0), 212);
Table.States (196).Goto_List.Set_Capacity (11);
- Add_Goto (Table.States (196), 42, 213);
- Add_Goto (Table.States (196), 45, 214);
- Add_Goto (Table.States (196), 51, 215);
- Add_Goto (Table.States (196), 52, 216);
- Add_Goto (Table.States (196), 53, 217);
- Add_Goto (Table.States (196), 60, 218);
- Add_Goto (Table.States (196), 61, 219);
- Add_Goto (Table.States (196), 62, 220);
- Add_Goto (Table.States (196), 63, 221);
- Add_Goto (Table.States (196), 67, 222);
- Add_Goto (Table.States (196), 72, 223);
- Table.States (196).Kernel := To_Vector ((0 => ((46, 0), 32, 0,
(53, 0), 0)));
- Table.States (196).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (53, 0), 0)));
+ Add_Goto (Table.States (196), 44, 213);
+ Add_Goto (Table.States (196), 47, 214);
+ Add_Goto (Table.States (196), 53, 215);
+ Add_Goto (Table.States (196), 54, 216);
+ Add_Goto (Table.States (196), 55, 217);
+ Add_Goto (Table.States (196), 62, 218);
+ Add_Goto (Table.States (196), 63, 219);
+ Add_Goto (Table.States (196), 64, 220);
+ Add_Goto (Table.States (196), 65, 221);
+ Add_Goto (Table.States (196), 69, 222);
+ Add_Goto (Table.States (196), 74, 223);
+ Table.States (196).Kernel := To_Vector ((0 => ((48, 0), 34, 0,
(55, 0), 0)));
+ Table.States (196).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (55, 0), 0)));
Table.States (197).Action_List.Set_Capacity (4);
- Add_Action (Table.States (197), 17, (54, 2), 175);
- Add_Action (Table.States (197), 32, Reduce, (54, 0), 0, null,
null);
- Add_Action (Table.States (197), 35, Reduce, (54, 0), 0, null,
null);
- Add_Action (Table.States (197), 38, (54, 1), 176);
+ Add_Action (Table.States (197), 19, (56, 2), 175);
+ Add_Action (Table.States (197), 34, Reduce, (56, 0), 0);
+ Add_Action (Table.States (197), 37, Reduce, (56, 0), 0);
+ Add_Action (Table.States (197), 40, (56, 1), 176);
Table.States (197).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (197), 54, 224);
- Table.States (197).Kernel := To_Vector ((0 => ((55, 1), 35, 0,
(54, 0), 0)));
- Table.States (197).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (54, 0), 0)));
+ Add_Goto (Table.States (197), 56, 224);
+ Table.States (197).Kernel := To_Vector ((0 => ((57, 1), 37, 0,
(56, 0), 0)));
+ Table.States (197).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (56, 0), 0)));
Table.States (198).Action_List.Set_Capacity (1);
- Add_Action (Table.States (198), 34, (45, 0), 225);
- Table.States (198).Kernel := To_Vector ((0 => ((45, 0), 6, 1,
(2147483647, 0), 0)));
- Table.States (198).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (45, 0), 34, 225)));
+ Add_Action (Table.States (198), 36, (47, 0), 225);
+ Table.States (198).Kernel := To_Vector ((0 => ((47, 0), 8, 1,
(32767, 0), 0)));
+ Table.States (198).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (47, 0), 36, 225)));
Table.States (199).Action_List.Set_Capacity (10);
- Add_Action (Table.States (199), 10, (57, 0), 130);
- Add_Action (Table.States (199), 11, (57, 1), 131);
- Add_Action (Table.States (199), 14, (41, 0), 132);
- Add_Action (Table.States (199), 19, (43, 0), 9);
- Add_Action (Table.States (199), 27, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (199), 31, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (199), 33, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (199), 34, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (199), 37, (58, 1), 133);
- Add_Action (Table.States (199), 38, (69, 0), 134);
+ Add_Action (Table.States (199), 12, (59, 0), 130);
+ Add_Action (Table.States (199), 13, (59, 1), 131);
+ Add_Action (Table.States (199), 16, (43, 0), 132);
+ Add_Action (Table.States (199), 21, (45, 0), 9);
+ Add_Action (Table.States (199), 29, Reduce, (60, 0), 0);
+ Add_Action (Table.States (199), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (199), 35, Reduce, (60, 0), 0);
+ Add_Action (Table.States (199), 36, Reduce, (60, 0), 0);
+ Add_Action (Table.States (199), 39, (60, 1), 133);
+ Add_Action (Table.States (199), 40, (71, 0), 134);
Table.States (199).Goto_List.Set_Capacity (9);
- Add_Goto (Table.States (199), 41, 135);
- Add_Goto (Table.States (199), 43, 136);
- Add_Goto (Table.States (199), 44, 137);
- Add_Goto (Table.States (199), 56, 226);
- Add_Goto (Table.States (199), 57, 139);
- Add_Goto (Table.States (199), 58, 140);
- Add_Goto (Table.States (199), 59, 141);
- Add_Goto (Table.States (199), 69, 142);
- Add_Goto (Table.States (199), 71, 143);
- Table.States (199).Kernel := To_Vector ((0 => ((42, 3), 24, 1,
(2147483647, 0), 0)));
- Table.States (199).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (56, 0), 0)));
+ Add_Goto (Table.States (199), 43, 135);
+ Add_Goto (Table.States (199), 45, 136);
+ Add_Goto (Table.States (199), 46, 137);
+ Add_Goto (Table.States (199), 58, 226);
+ Add_Goto (Table.States (199), 59, 139);
+ Add_Goto (Table.States (199), 60, 140);
+ Add_Goto (Table.States (199), 61, 141);
+ Add_Goto (Table.States (199), 71, 142);
+ Add_Goto (Table.States (199), 73, 143);
+ Table.States (199).Kernel := To_Vector ((0 => ((44, 3), 26, 1,
(32767, 0), 0)));
+ Table.States (199).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 0), 0)));
Table.States (200).Action_List.Set_Capacity (11);
- Add_Action (Table.States (200), 4, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (200), 10, (57, 0), 227);
- Add_Action (Table.States (200), 11, (57, 1), 228);
- Add_Action (Table.States (200), 14, (41, 0), 229);
- Add_Action (Table.States (200), 19, (43, 0), 9);
- Add_Action (Table.States (200), 27, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (200), 31, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (200), 33, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (200), 34, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (200), 37, (58, 1), 230);
- Add_Action (Table.States (200), 38, (69, 0), 231);
+ Add_Action (Table.States (200), 6, Reduce, (60, 0), 0);
+ Add_Action (Table.States (200), 12, (59, 0), 227);
+ Add_Action (Table.States (200), 13, (59, 1), 228);
+ Add_Action (Table.States (200), 16, (43, 0), 229);
+ Add_Action (Table.States (200), 21, (45, 0), 9);
+ Add_Action (Table.States (200), 29, Reduce, (60, 0), 0);
+ Add_Action (Table.States (200), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (200), 35, Reduce, (60, 0), 0);
+ Add_Action (Table.States (200), 36, Reduce, (60, 0), 0);
+ Add_Action (Table.States (200), 39, (60, 1), 230);
+ Add_Action (Table.States (200), 40, (71, 0), 231);
Table.States (200).Goto_List.Set_Capacity (9);
- Add_Goto (Table.States (200), 41, 232);
- Add_Goto (Table.States (200), 43, 233);
- Add_Goto (Table.States (200), 44, 234);
- Add_Goto (Table.States (200), 56, 235);
- Add_Goto (Table.States (200), 57, 236);
- Add_Goto (Table.States (200), 58, 237);
- Add_Goto (Table.States (200), 59, 238);
- Add_Goto (Table.States (200), 69, 239);
- Add_Goto (Table.States (200), 71, 240);
- Table.States (200).Kernel := To_Vector ((((42, 1), 24, 1,
(2147483647, 0), 0), ((42, 2), 24, 3,
- (2147483647, 0), 0)));
- Table.States (200).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (56, 0), 0)));
+ Add_Goto (Table.States (200), 43, 232);
+ Add_Goto (Table.States (200), 45, 233);
+ Add_Goto (Table.States (200), 46, 234);
+ Add_Goto (Table.States (200), 58, 235);
+ Add_Goto (Table.States (200), 59, 236);
+ Add_Goto (Table.States (200), 60, 237);
+ Add_Goto (Table.States (200), 61, 238);
+ Add_Goto (Table.States (200), 71, 239);
+ Add_Goto (Table.States (200), 73, 240);
+ Table.States (200).Kernel := To_Vector ((((44, 1), 26, 1,
(32767, 0), 0), ((44, 2), 26, 3, (32767, 0),
+ 0)));
+ Table.States (200).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 0), 0)));
Table.States (201).Action_List.Set_Capacity (1);
- Add_Action (Table.States (201), 8, (62, 0), 241);
- Table.States (201).Kernel := To_Vector ((0 => ((62, 0), 53, 2,
(2147483647, 0), 0)));
- Table.States (201).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (62, 0), 8, 241)));
+ Add_Action (Table.States (201), 10, (64, 0), 241);
+ Table.States (201).Kernel := To_Vector ((0 => ((64, 0), 55, 2,
(32767, 0), 0)));
+ Table.States (201).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (64, 0), 10, 241)));
Table.States (202).Action_List.Set_Capacity (1);
- Add_Action (Table.States (202), 34, (61, 0), 242);
- Table.States (202).Kernel := To_Vector ((0 => ((61, 0), 58, 1,
(2147483647, 0), 0)));
- Table.States (202).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (61, 0), 34, 242)));
+ Add_Action (Table.States (202), 36, (63, 0), 242);
+ Table.States (202).Kernel := To_Vector ((0 => ((63, 0), 60, 1,
(32767, 0), 0)));
+ Table.States (202).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (63, 0), 36, 242)));
Table.States (203).Action_List.Set_Capacity (2);
- Add_Action (Table.States (203), (31, 34), (59, 1), 3, null, null);
- Table.States (203).Kernel := To_Vector ((0 => ((59, 1), 37, 0,
(59, 1), 3)));
- Table.States (203).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (59, 1), 3)));
- end Subr_2;
- procedure Subr_3
- is begin
+ Add_Action (Table.States (203), (33, 36), (61, 1), 3);
+ Table.States (203).Kernel := To_Vector ((0 => ((61, 1), 39, 0,
(61, 1), 3)));
+ Table.States (203).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (61, 1), 3)));
Table.States (204).Action_List.Set_Capacity (1);
- Add_Action (Table.States (204), (1 => 34), (41, 0), 3,
aggregate_g_0'Access, null);
- Table.States (204).Kernel := To_Vector ((0 => ((41, 0), 21, 0,
(41, 0), 3)));
- Table.States (204).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (41, 0), 3)));
+ Add_Action (Table.States (204), (1 => 36), (43, 0), 3);
+ Table.States (204).Kernel := To_Vector ((0 => ((43, 0), 23, 0,
(43, 0), 3)));
+ Table.States (204).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (43, 0), 3)));
Table.States (205).Action_List.Set_Capacity (7);
- Add_Action (Table.States (205), (6, 8, 12, 16, 18, 23, 37), (67,
1), 6, simple_declarative_item_1'Access,
- null);
- Table.States (205).Kernel := To_Vector ((0 => ((67, 1), 34, 0,
(67, 1), 6)));
- Table.States (205).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (67, 1), 6)));
+ Add_Action (Table.States (205), (8, 10, 14, 18, 20, 25, 39), (69,
1), 6);
+ Table.States (205).Kernel := To_Vector ((0 => ((69, 1), 36, 0,
(69, 1), 6)));
+ Table.States (205).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (69, 1), 6)));
Table.States (206).Action_List.Set_Capacity (1);
- Add_Action (Table.States (206), 38, (44, 1), 243);
- Table.States (206).Kernel := To_Vector ((0 => ((44, 1), 14, 2,
(2147483647, 0), 0)));
- Table.States (206).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 1), 38, 243)));
+ Add_Action (Table.States (206), 40, (46, 1), 243);
+ Table.States (206).Kernel := To_Vector ((0 => ((46, 1), 16, 2,
(32767, 0), 0)));
+ Table.States (206).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (46, 1), 40, 243)));
+ end Subr_4;
+ procedure Subr_5
+ is begin
Table.States (207).Action_List.Set_Capacity (3);
- Add_Action (Table.States (207), 13, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (207), 31, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (207), 37, (58, 1), 105);
+ Add_Action (Table.States (207), 15, Reduce, (60, 0), 0);
+ Add_Action (Table.States (207), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (207), 39, (60, 1), 105);
Table.States (207).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (207), 58, 106);
- Add_Goto (Table.States (207), 59, 244);
- Table.States (207).Kernel := To_Vector ((0 => ((45, 0), 6, 4,
(2147483647, 0), 0)));
- Table.States (207).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (59, 0), 0)));
+ Add_Goto (Table.States (207), 60, 106);
+ Add_Goto (Table.States (207), 61, 244);
+ Table.States (207).Kernel := To_Vector ((0 => ((47, 0), 8, 4,
(32767, 0), 0)));
+ Table.States (207).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (61, 0), 0)));
Table.States (208).Action_List.Set_Capacity (2);
- Add_Action (Table.States (208), 10, (42, 3), 245);
- Add_Action (Table.States (208), 37, (42, 0), 246);
- Table.States (208).Kernel := To_Vector ((((42, 0), 12, 3,
(2147483647, 0), 0), ((42, 1), 12, 5,
- (2147483647, 0), 0), ((42, 2), 12, 7, (2147483647, 0), 0),
((42, 3), 12, 6, (2147483647, 0), 0)));
- Table.States (208).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (42, 0), 37, 246)));
+ Add_Action (Table.States (208), 12, (44, 3), 245);
+ Add_Action (Table.States (208), 39, (44, 0), 246);
+ Table.States (208).Kernel := To_Vector ((((44, 0), 14, 3,
(32767, 0), 0), ((44, 1), 14, 5, (32767, 0),
+ 0), ((44, 2), 14, 7, (32767, 0), 0), ((44, 3), 14, 6,
(32767, 0), 0)));
+ Table.States (208).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 0), 39, 246)));
Table.States (209).Action_List.Set_Capacity (1);
- Add_Action (Table.States (209), 34, (67, 4), 247);
- Table.States (209).Kernel := To_Vector ((0 => ((67, 4), 16, 1,
(2147483647, 0), 0)));
- Table.States (209).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (67, 4), 34, 247)));
+ Add_Action (Table.States (209), 36, (69, 4), 247);
+ Table.States (209).Kernel := To_Vector ((0 => ((69, 4), 18, 1,
(32767, 0), 0)));
+ Table.States (209).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (69, 4), 36, 247)));
Table.States (210).Action_List.Set_Capacity (4);
- Add_Action (Table.States (210), 9, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (210), 13, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (210), 20, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (210), 37, (58, 1), 111);
+ Add_Action (Table.States (210), 11, Reduce, (60, 0), 0);
+ Add_Action (Table.States (210), 15, Reduce, (60, 0), 0);
+ Add_Action (Table.States (210), 22, Reduce, (60, 0), 0);
+ Add_Action (Table.States (210), 39, (60, 1), 111);
Table.States (210).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (210), 58, 248);
- Table.States (210).Kernel := To_Vector ((((61, 0), 18, 3,
(2147483647, 0), 0), ((62, 0), 18, 4,
- (2147483647, 0), 0), ((63, 0), 18, 2, (2147483647, 0), 0)));
- Table.States (210).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 0), 0)));
+ Add_Goto (Table.States (210), 60, 248);
+ Table.States (210).Kernel := To_Vector ((((63, 0), 20, 3,
(32767, 0), 0), ((64, 0), 20, 4, (32767, 0),
+ 0), ((65, 0), 20, 2, (32767, 0), 0)));
+ Table.States (210).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (60, 0), 0)));
Table.States (211).Action_List.Set_Capacity (1);
- Add_Action (Table.States (211), 37, (72, 0), 249);
- Table.States (211).Kernel := To_Vector ((0 => ((72, 0), 23, 5,
(2147483647, 0), 0)));
- Table.States (211).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (72, 0), 37, 249)));
+ Add_Action (Table.States (211), 39, (74, 0), 249);
+ Table.States (211).Kernel := To_Vector ((0 => ((74, 0), 25, 5,
(32767, 0), 0)));
+ Table.States (211).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (74, 0), 39, 249)));
Table.States (212).Action_List.Set_Capacity (2);
- Add_Action (Table.States (212), 28, (67, 1), 250);
- Add_Action (Table.States (212), 29, (67, 0), 251);
- Table.States (212).Kernel := To_Vector ((((67, 0), 37, 2,
(2147483647, 0), 0), ((67, 1), 37, 4,
- (2147483647, 0), 0)));
- Table.States (212).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (67, 0), 29, 251)));
+ Add_Action (Table.States (212), 30, (69, 1), 250);
+ Add_Action (Table.States (212), 31, (69, 0), 251);
+ Table.States (212).Kernel := To_Vector ((((69, 0), 39, 2,
(32767, 0), 0), ((69, 1), 39, 4, (32767, 0),
+ 0)));
+ Table.States (212).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (69, 0), 31, 251)));
Table.States (213).Action_List.Set_Capacity (8);
- Add_Action (Table.States (213), (6, 8, 12, 16, 18, 23, 25, 37),
(67, 2), 1, null, null);
- Table.States (213).Kernel := To_Vector ((0 => ((67, 2), 42, 0,
(67, 2), 1)));
- Table.States (213).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (67, 2), 1)));
+ Add_Action (Table.States (213), (8, 10, 14, 18, 20, 25, 27, 39),
(69, 2), 1);
+ Table.States (213).Kernel := To_Vector ((0 => ((69, 2), 44, 0,
(69, 2), 1)));
+ Table.States (213).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (69, 2), 1)));
Table.States (214).Action_List.Set_Capacity (8);
- Add_Action (Table.States (214), (6, 8, 12, 16, 18, 23, 25, 37),
(67, 3), 1, null, null);
- Table.States (214).Kernel := To_Vector ((0 => ((67, 3), 45, 0,
(67, 3), 1)));
- Table.States (214).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (67, 3), 1)));
+ Add_Action (Table.States (214), (8, 10, 14, 18, 20, 25, 27, 39),
(69, 3), 1);
+ Table.States (214).Kernel := To_Vector ((0 => ((69, 3), 47, 0,
(69, 3), 1)));
+ Table.States (214).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (69, 3), 1)));
Table.States (215).Action_List.Set_Capacity (8);
- Add_Action (Table.States (215), (6, 8, 12, 16, 18, 23, 25, 37),
(52, 0), 1, null, null);
- Table.States (215).Kernel := To_Vector ((0 => ((52, 0), 51, 0,
(52, 0), 1)));
- Table.States (215).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (52, 0), 1)));
+ Add_Action (Table.States (215), (8, 10, 14, 18, 20, 25, 27, 39),
(54, 0), 1);
+ Table.States (215).Kernel := To_Vector ((0 => ((54, 0), 53, 0,
(54, 0), 1)));
+ Table.States (215).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (54, 0), 1)));
Table.States (216).Action_List.Set_Capacity (8);
- Add_Action (Table.States (216), 6, (45, 0), 207);
- Add_Action (Table.States (216), 8, Reduce, (53, 1), 1, null,
null);
- Add_Action (Table.States (216), 12, (42, 0), 208);
- Add_Action (Table.States (216), 16, (67, 4), 209);
- Add_Action (Table.States (216), 18, (61, 0), 210);
- Add_Action (Table.States (216), 23, (72, 0), 211);
- Add_Action (Table.States (216), 25, Reduce, (53, 1), 1, null,
null);
- Add_Action (Table.States (216), 37, (67, 0), 212);
+ Add_Action (Table.States (216), 8, (47, 0), 207);
+ Add_Action (Table.States (216), 10, Reduce, (55, 1), 1);
+ Add_Action (Table.States (216), 14, (44, 0), 208);
+ Add_Action (Table.States (216), 18, (69, 4), 209);
+ Add_Action (Table.States (216), 20, (63, 0), 210);
+ Add_Action (Table.States (216), 25, (74, 0), 211);
+ Add_Action (Table.States (216), 27, Reduce, (55, 1), 1);
+ Add_Action (Table.States (216), 39, (69, 0), 212);
Table.States (216).Goto_List.Set_Capacity (9);
- Add_Goto (Table.States (216), 42, 213);
- Add_Goto (Table.States (216), 45, 214);
- Add_Goto (Table.States (216), 51, 252);
- Add_Goto (Table.States (216), 60, 218);
- Add_Goto (Table.States (216), 61, 219);
- Add_Goto (Table.States (216), 62, 220);
- Add_Goto (Table.States (216), 63, 221);
- Add_Goto (Table.States (216), 67, 222);
- Add_Goto (Table.States (216), 72, 223);
- Table.States (216).Kernel := To_Vector ((((52, 1), 52, 2,
(2147483647, 0), 0), ((53, 1), 52, 0, (53,
- 1), 1)));
- Table.States (216).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (53, 1), 1)));
+ Add_Goto (Table.States (216), 44, 213);
+ Add_Goto (Table.States (216), 47, 214);
+ Add_Goto (Table.States (216), 53, 252);
+ Add_Goto (Table.States (216), 62, 218);
+ Add_Goto (Table.States (216), 63, 219);
+ Add_Goto (Table.States (216), 64, 220);
+ Add_Goto (Table.States (216), 65, 221);
+ Add_Goto (Table.States (216), 69, 222);
+ Add_Goto (Table.States (216), 74, 223);
+ Table.States (216).Kernel := To_Vector ((((54, 1), 54, 2,
(32767, 0), 0), ((55, 1), 54, 0, (55, 1),
+ 1)));
+ Table.States (216).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (55, 1), 1)));
Table.States (217).Action_List.Set_Capacity (2);
- Add_Action (Table.States (217), (8, 25), (46, 0), 4,
case_item_0'Access, null);
- Table.States (217).Kernel := To_Vector ((0 => ((46, 0), 53, 0,
(46, 0), 4)));
- Table.States (217).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (46, 0), 4)));
+ Add_Action (Table.States (217), (10, 27), (48, 0), 4);
+ Table.States (217).Kernel := To_Vector ((0 => ((48, 0), 55, 0,
(48, 0), 4)));
+ Table.States (217).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (48, 0), 4)));
Table.States (218).Action_List.Set_Capacity (8);
- Add_Action (Table.States (218), (6, 8, 12, 16, 18, 23, 25, 37),
(51, 2), 1, null, null);
- Table.States (218).Kernel := To_Vector ((0 => ((51, 2), 60, 0,
(51, 2), 1)));
- Table.States (218).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (51, 2), 1)));
+ Add_Action (Table.States (218), (8, 10, 14, 18, 20, 25, 27, 39),
(53, 2), 1);
+ Table.States (218).Kernel := To_Vector ((0 => ((53, 2), 62, 0,
(53, 2), 1)));
+ Table.States (218).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (53, 2), 1)));
Table.States (219).Action_List.Set_Capacity (8);
- Add_Action (Table.States (219), (6, 8, 12, 16, 18, 23, 25, 37),
(60, 0), 1, null, null);
- Table.States (219).Kernel := To_Vector ((0 => ((60, 0), 61, 0,
(60, 0), 1)));
- Table.States (219).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (60, 0), 1)));
+ Add_Action (Table.States (219), (8, 10, 14, 18, 20, 25, 27, 39),
(62, 0), 1);
+ Table.States (219).Kernel := To_Vector ((0 => ((62, 0), 63, 0,
(62, 0), 1)));
+ Table.States (219).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (62, 0), 1)));
Table.States (220).Action_List.Set_Capacity (8);
- Add_Action (Table.States (220), (6, 8, 12, 16, 18, 23, 25, 37),
(60, 1), 1, null, null);
- Table.States (220).Kernel := To_Vector ((0 => ((60, 1), 62, 0,
(60, 1), 1)));
- Table.States (220).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (60, 1), 1)));
+ Add_Action (Table.States (220), (8, 10, 14, 18, 20, 25, 27, 39),
(62, 1), 1);
+ Table.States (220).Kernel := To_Vector ((0 => ((62, 1), 64, 0,
(62, 1), 1)));
+ Table.States (220).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (62, 1), 1)));
Table.States (221).Action_List.Set_Capacity (8);
- Add_Action (Table.States (221), (6, 8, 12, 16, 18, 23, 25, 37),
(60, 2), 1, null, null);
- Table.States (221).Kernel := To_Vector ((0 => ((60, 2), 63, 0,
(60, 2), 1)));
- Table.States (221).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (60, 2), 1)));
+ Add_Action (Table.States (221), (8, 10, 14, 18, 20, 25, 27, 39),
(62, 2), 1);
+ Table.States (221).Kernel := To_Vector ((0 => ((62, 2), 65, 0,
(62, 2), 1)));
+ Table.States (221).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (62, 2), 1)));
Table.States (222).Action_List.Set_Capacity (8);
- Add_Action (Table.States (222), (6, 8, 12, 16, 18, 23, 25, 37),
(51, 0), 1, null, null);
- Table.States (222).Kernel := To_Vector ((0 => ((51, 0), 67, 0,
(51, 0), 1)));
- Table.States (222).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (51, 0), 1)));
+ Add_Action (Table.States (222), (8, 10, 14, 18, 20, 25, 27, 39),
(53, 0), 1);
+ Table.States (222).Kernel := To_Vector ((0 => ((53, 0), 69, 0,
(53, 0), 1)));
+ Table.States (222).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (53, 0), 1)));
Table.States (223).Action_List.Set_Capacity (8);
- Add_Action (Table.States (223), (6, 8, 12, 16, 18, 23, 25, 37),
(51, 1), 1, null, null);
- Table.States (223).Kernel := To_Vector ((0 => ((51, 1), 72, 0,
(51, 1), 1)));
- Table.States (223).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (51, 1), 1)));
+ Add_Action (Table.States (223), (8, 10, 14, 18, 20, 25, 27, 39),
(53, 1), 1);
+ Table.States (223).Kernel := To_Vector ((0 => ((53, 1), 74, 0,
(53, 1), 1)));
+ Table.States (223).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (53, 1), 1)));
Table.States (224).Action_List.Set_Capacity (2);
- Add_Action (Table.States (224), (32, 35), (55, 1), 3, null, null);
- Table.States (224).Kernel := To_Vector ((0 => ((55, 1), 54, 0,
(55, 1), 3)));
- Table.States (224).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (55, 1), 3)));
+ Add_Action (Table.States (224), (34, 37), (57, 1), 3);
+ Table.States (224).Kernel := To_Vector ((0 => ((57, 1), 56, 0,
(57, 1), 3)));
+ Table.States (224).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (57, 1), 3)));
Table.States (225).Action_List.Set_Capacity (7);
- Add_Action (Table.States (225), (6, 8, 12, 16, 18, 23, 37), (45,
0), 7, case_statement_0'Access, null);
- Table.States (225).Kernel := To_Vector ((0 => ((45, 0), 34, 0,
(45, 0), 7)));
- Table.States (225).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (45, 0), 7)));
+ Add_Action (Table.States (225), (8, 10, 14, 18, 20, 25, 39), (47,
0), 7);
+ Table.States (225).Kernel := To_Vector ((0 => ((47, 0), 36, 0,
(47, 0), 7)));
+ Table.States (225).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (47, 0), 7)));
Table.States (226).Action_List.Set_Capacity (2);
- Add_Action (Table.States (226), 27, (56, 1), 170);
- Add_Action (Table.States (226), 34, (42, 3), 253);
- Table.States (226).Kernel := To_Vector ((((42, 3), 56, 1,
(2147483647, 0), 0), ((56, 1), 56, 1,
- (2147483647, 0), 0)));
- Table.States (226).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (42, 3), 34, 253)));
+ Add_Action (Table.States (226), 29, (58, 1), 170);
+ Add_Action (Table.States (226), 36, (44, 3), 253);
+ Table.States (226).Kernel := To_Vector ((((44, 3), 58, 1,
(32767, 0), 0), ((58, 1), 58, 1, (32767, 0),
+ 0)));
+ Table.States (226).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 3), 36, 253)));
Table.States (227).Action_List.Set_Capacity (1);
- Add_Action (Table.States (227), 14, (41, 0), 254);
+ Add_Action (Table.States (227), 16, (43, 0), 254);
Table.States (227).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (227), 41, 255);
- Table.States (227).Kernel := To_Vector ((0 => ((57, 0), 10, 2,
(2147483647, 0), 0)));
- Table.States (227).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (41, 0), 14, 254)));
+ Add_Goto (Table.States (227), 43, 255);
+ Table.States (227).Kernel := To_Vector ((0 => ((59, 0), 12, 2,
(32767, 0), 0)));
+ Table.States (227).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (43, 0), 16, 254)));
Table.States (228).Action_List.Set_Capacity (1);
- Add_Action (Table.States (228), 14, (41, 0), 254);
+ Add_Action (Table.States (228), 16, (43, 0), 254);
Table.States (228).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (228), 41, 256);
- Table.States (228).Kernel := To_Vector ((0 => ((57, 1), 11, 2,
(2147483647, 0), 0)));
- Table.States (228).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (41, 0), 14, 254)));
+ Add_Goto (Table.States (228), 43, 256);
+ Table.States (228).Kernel := To_Vector ((0 => ((59, 1), 13, 2,
(32767, 0), 0)));
+ Table.States (228).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (43, 0), 16, 254)));
Table.States (229).Action_List.Set_Capacity (11);
- Add_Action (Table.States (229), 10, (57, 0), 32);
- Add_Action (Table.States (229), 11, (57, 1), 33);
- Add_Action (Table.States (229), 14, (41, 0), 34);
- Add_Action (Table.States (229), 19, (43, 0), 9);
- Add_Action (Table.States (229), 21, (71, 1), 257);
- Add_Conflict (Table.States (229), 21, (58, 0), 0, null, null);
- Add_Action (Table.States (229), 27, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (229), 30, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (229), 31, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (229), 33, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (229), 37, (58, 1), 36);
- Add_Action (Table.States (229), 38, (69, 0), 37);
+ Add_Action (Table.States (229), 12, (59, 0), 32);
+ Add_Action (Table.States (229), 13, (59, 1), 33);
+ Add_Action (Table.States (229), 16, (43, 0), 34);
+ Add_Action (Table.States (229), 21, (45, 0), 9);
+ Add_Action (Table.States (229), 23, (73, 1), 257);
+ Add_Conflict (Table.States (229), 23, (60, 0), 0);
+ Add_Action (Table.States (229), 29, Reduce, (60, 0), 0);
+ Add_Action (Table.States (229), 32, Reduce, (60, 0), 0);
+ Add_Action (Table.States (229), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (229), 35, Reduce, (60, 0), 0);
+ Add_Action (Table.States (229), 39, (60, 1), 36);
+ Add_Action (Table.States (229), 40, (71, 0), 37);
Table.States (229).Goto_List.Set_Capacity (10);
- Add_Goto (Table.States (229), 41, 38);
- Add_Goto (Table.States (229), 43, 39);
- Add_Goto (Table.States (229), 44, 40);
- Add_Goto (Table.States (229), 56, 41);
- Add_Goto (Table.States (229), 57, 42);
- Add_Goto (Table.States (229), 58, 43);
- Add_Goto (Table.States (229), 59, 44);
- Add_Goto (Table.States (229), 69, 45);
- Add_Goto (Table.States (229), 70, 258);
- Add_Goto (Table.States (229), 71, 47);
- Table.States (229).Kernel := To_Vector ((((41, 0), 14, 1,
(2147483647, 0), 0), ((71, 1), 14, 1,
- (2147483647, 0), 0)));
- Table.States (229).Minimal_Complete_Actions := To_Vector
(((Reduce, (70, 0), 0), (Shift, (71, 1), 21,
+ Add_Goto (Table.States (229), 43, 38);
+ Add_Goto (Table.States (229), 45, 39);
+ Add_Goto (Table.States (229), 46, 40);
+ Add_Goto (Table.States (229), 58, 41);
+ Add_Goto (Table.States (229), 59, 42);
+ Add_Goto (Table.States (229), 60, 43);
+ Add_Goto (Table.States (229), 61, 44);
+ Add_Goto (Table.States (229), 71, 45);
+ Add_Goto (Table.States (229), 72, 258);
+ Add_Goto (Table.States (229), 73, 47);
+ Table.States (229).Kernel := To_Vector ((((43, 0), 16, 1,
(32767, 0), 0), ((73, 1), 16, 1, (32767, 0),
+ 0)));
+ Table.States (229).Minimal_Complete_Actions := To_Vector
(((Reduce, (72, 0), 0), (Shift, (73, 1), 23,
257)));
Table.States (230).Action_List.Set_Capacity (5);
- Add_Action (Table.States (230), (4, 27, 31, 33, 34), (58, 1), 1,
null, identifier_opt_1_check'Access);
- Table.States (230).Kernel := To_Vector ((0 => ((58, 1), 37, 0,
(58, 1), 1)));
- Table.States (230).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 1), 1)));
+ Add_Action (Table.States (230), (6, 29, 33, 35, 36), (60, 1), 1);
+ Table.States (230).Kernel := To_Vector ((0 => ((60, 1), 39, 0,
(60, 1), 1)));
+ Table.States (230).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (60, 1), 1)));
Table.States (231).Action_List.Set_Capacity (3);
- Add_Action (Table.States (231), (4, 27, 34), (69, 0), 1, null,
null);
- Table.States (231).Kernel := To_Vector ((0 => ((69, 0), 38, 0,
(69, 0), 1)));
- Table.States (231).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (69, 0), 1)));
+ Add_Action (Table.States (231), (6, 29, 36), (71, 0), 1);
+ Table.States (231).Kernel := To_Vector ((0 => ((71, 0), 40, 0,
(71, 0), 1)));
+ Table.States (231).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (71, 0), 1)));
Table.States (232).Action_List.Set_Capacity (3);
- Add_Action (Table.States (232), (4, 27, 34), (71, 2), 1, null,
null);
- Table.States (232).Kernel := To_Vector ((0 => ((71, 2), 41, 0,
(71, 2), 1)));
- Table.States (232).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (71, 2), 1)));
+ Add_Action (Table.States (232), (6, 29, 36), (73, 2), 1);
+ Table.States (232).Kernel := To_Vector ((0 => ((73, 2), 43, 0,
(73, 2), 1)));
+ Table.States (232).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (73, 2), 1)));
Table.States (233).Action_List.Set_Capacity (1);
- Add_Action (Table.States (233), 33, (44, 0), 259);
- Table.States (233).Kernel := To_Vector ((((44, 0), 43, 2,
(2147483647, 0), 0), ((44, 1), 43, 5,
- (2147483647, 0), 0)));
- Table.States (233).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 0), 33, 259)));
+ Add_Action (Table.States (233), 35, (46, 0), 259);
+ Table.States (233).Kernel := To_Vector ((((46, 0), 45, 2,
(32767, 0), 0), ((46, 1), 45, 5, (32767, 0),
+ 0)));
+ Table.States (233).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (46, 0), 35, 259)));
Table.States (234).Action_List.Set_Capacity (3);
- Add_Action (Table.States (234), (4, 27, 34), (69, 3), 1, null,
null);
- Table.States (234).Kernel := To_Vector ((0 => ((69, 3), 44, 0,
(69, 3), 1)));
- Table.States (234).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (69, 3), 1)));
+ Add_Action (Table.States (234), (6, 29, 36), (71, 3), 1);
+ Table.States (234).Kernel := To_Vector ((0 => ((71, 3), 46, 0,
(71, 3), 1)));
+ Table.States (234).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (71, 3), 1)));
Table.States (235).Action_List.Set_Capacity (3);
- Add_Action (Table.States (235), 4, (42, 2), 260);
- Add_Action (Table.States (235), 27, (56, 1), 261);
- Add_Action (Table.States (235), 34, (42, 1), 262);
- Table.States (235).Kernel := To_Vector ((((42, 1), 56, 1,
(2147483647, 0), 0), ((42, 2), 56, 3,
- (2147483647, 0), 0), ((56, 1), 56, 1, (2147483647, 0), 0)));
- Table.States (235).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (42, 1), 34, 262)));
+ Add_Action (Table.States (235), 6, (44, 2), 260);
+ Add_Action (Table.States (235), 29, (58, 1), 261);
+ Add_Action (Table.States (235), 36, (44, 1), 262);
+ Table.States (235).Kernel := To_Vector ((((44, 1), 58, 1,
(32767, 0), 0), ((44, 2), 58, 3, (32767, 0),
+ 0), ((58, 1), 58, 1, (32767, 0), 0)));
+ Table.States (235).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 1), 36, 262)));
Table.States (236).Action_List.Set_Capacity (3);
- Add_Action (Table.States (236), (4, 27, 34), (69, 2), 1, null,
null);
- Table.States (236).Kernel := To_Vector ((0 => ((69, 2), 57, 0,
(69, 2), 1)));
- Table.States (236).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (69, 2), 1)));
+ Add_Action (Table.States (236), (6, 29, 36), (71, 2), 1);
+ Table.States (236).Kernel := To_Vector ((0 => ((71, 2), 59, 0,
(71, 2), 1)));
+ Table.States (236).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (71, 2), 1)));
Table.States (237).Action_List.Set_Capacity (5);
- Add_Action (Table.States (237), (4, 27, 31, 33, 34), (59, 0), 1,
null, null);
- Table.States (237).Kernel := To_Vector ((0 => ((59, 0), 58, 0,
(59, 0), 1)));
- Table.States (237).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (59, 0), 1)));
+ Add_Action (Table.States (237), (6, 29, 33, 35, 36), (61, 0), 1);
+ Table.States (237).Kernel := To_Vector ((0 => ((61, 0), 60, 0,
(61, 0), 1)));
+ Table.States (237).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (61, 0), 1)));
Table.States (238).Action_List.Set_Capacity (5);
- Add_Action (Table.States (238), 4, Reduce, (69, 1), 1, null,
null);
- Add_Action (Table.States (238), 27, Reduce, (69, 1), 1, null,
null);
- Add_Action (Table.States (238), 31, (59, 1), 263);
- Add_Action (Table.States (238), 33, Reduce, (43, 1), 1, null,
null);
- Add_Action (Table.States (238), 34, Reduce, (69, 1), 1, null,
null);
- Table.States (238).Kernel := To_Vector ((((43, 1), 59, 0, (43,
1), 1), ((59, 1), 59, 2, (2147483647,
- 0), 0), ((69, 1), 59, 0, (69, 1), 1)));
- Table.States (238).Minimal_Complete_Actions := To_Vector
(((Reduce, (43, 1), 1), (Reduce, (69, 1), 1)));
+ Add_Action (Table.States (238), 6, Reduce, (71, 1), 1);
+ Add_Action (Table.States (238), 29, Reduce, (71, 1), 1);
+ Add_Action (Table.States (238), 33, (61, 1), 263);
+ Add_Action (Table.States (238), 35, Reduce, (45, 1), 1);
+ Add_Action (Table.States (238), 36, Reduce, (71, 1), 1);
+ Table.States (238).Kernel := To_Vector ((((45, 1), 61, 0, (45,
1), 1), ((61, 1), 61, 2, (32767, 0),
+ 0), ((71, 1), 61, 0, (71, 1), 1)));
+ Table.States (238).Minimal_Complete_Actions := To_Vector
(((Reduce, (45, 1), 1), (Reduce, (71, 1), 1)));
Table.States (239).Action_List.Set_Capacity (3);
- Add_Action (Table.States (239), (4, 27, 34), (71, 0), 1, null,
null);
- Table.States (239).Kernel := To_Vector ((0 => ((71, 0), 69, 0,
(71, 0), 1)));
- Table.States (239).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (71, 0), 1)));
+ Add_Action (Table.States (239), (6, 29, 36), (73, 0), 1);
+ Table.States (239).Kernel := To_Vector ((0 => ((73, 0), 71, 0,
(73, 0), 1)));
+ Table.States (239).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (73, 0), 1)));
Table.States (240).Action_List.Set_Capacity (3);
- Add_Action (Table.States (240), (4, 27, 34), (56, 0), 1, null,
null);
- Table.States (240).Kernel := To_Vector ((0 => ((56, 0), 71, 0,
(56, 0), 1)));
- Table.States (240).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (56, 0), 1)));
+ Add_Action (Table.States (240), (6, 29, 36), (58, 0), 1);
+ Table.States (240).Kernel := To_Vector ((0 => ((58, 0), 73, 0,
(58, 0), 1)));
+ Table.States (240).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 0), 1)));
Table.States (241).Action_List.Set_Capacity (2);
- Add_Action (Table.States (241), 34, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (241), 37, (58, 1), 144);
+ Add_Action (Table.States (241), 36, Reduce, (60, 0), 0);
+ Add_Action (Table.States (241), 39, (60, 1), 144);
Table.States (241).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (241), 58, 264);
- Table.States (241).Kernel := To_Vector ((0 => ((62, 0), 8, 1,
(2147483647, 0), 0)));
- Table.States (241).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 0), 0)));
+ Add_Goto (Table.States (241), 60, 264);
+ Table.States (241).Kernel := To_Vector ((0 => ((64, 0), 10, 1,
(32767, 0), 0)));
+ Table.States (241).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (60, 0), 0)));
Table.States (242).Action_List.Set_Capacity (7);
- Add_Action (Table.States (242), (6, 8, 12, 16, 18, 23, 37), (61,
0), 7, package_spec_0'Access,
- package_spec_0_check'Access);
- Table.States (242).Kernel := To_Vector ((0 => ((61, 0), 34, 0,
(61, 0), 7)));
- Table.States (242).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (61, 0), 7)));
+ Add_Action (Table.States (242), (8, 10, 14, 18, 20, 25, 39), (63,
0), 7);
+ Table.States (242).Kernel := To_Vector ((0 => ((63, 0), 36, 0,
(63, 0), 7)));
+ Table.States (242).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (63, 0), 7)));
Table.States (243).Action_List.Set_Capacity (1);
- Add_Action (Table.States (243), 21, (44, 1), 265);
- Table.States (243).Kernel := To_Vector ((0 => ((44, 1), 38, 1,
(2147483647, 0), 0)));
- Table.States (243).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 1), 21, 265)));
+ Add_Action (Table.States (243), 23, (46, 1), 265);
+ Table.States (243).Kernel := To_Vector ((0 => ((46, 1), 40, 1,
(32767, 0), 0)));
+ Table.States (243).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (46, 1), 23, 265)));
Table.States (244).Action_List.Set_Capacity (2);
- Add_Action (Table.States (244), 13, (45, 0), 266);
- Add_Action (Table.States (244), 31, (59, 1), 121);
- Table.States (244).Kernel := To_Vector ((((45, 0), 59, 4,
(2147483647, 0), 0), ((59, 1), 59, 2,
- (2147483647, 0), 0)));
- Table.States (244).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (45, 0), 13, 266)));
+ Add_Action (Table.States (244), 15, (47, 0), 266);
+ Add_Action (Table.States (244), 33, (61, 1), 121);
+ Table.States (244).Kernel := To_Vector ((((47, 0), 61, 4,
(32767, 0), 0), ((61, 1), 61, 2, (32767, 0),
+ 0)));
+ Table.States (244).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (47, 0), 15, 266)));
Table.States (245).Action_List.Set_Capacity (1);
- Add_Action (Table.States (245), 14, (42, 3), 267);
- Table.States (245).Kernel := To_Vector ((0 => ((42, 3), 10, 5,
(2147483647, 0), 0)));
- Table.States (245).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (42, 3), 14, 267)));
+ Add_Action (Table.States (245), 16, (44, 3), 267);
+ Table.States (245).Kernel := To_Vector ((0 => ((44, 3), 12, 5,
(32767, 0), 0)));
+ Table.States (245).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 3), 16, 267)));
Table.States (246).Action_List.Set_Capacity (2);
- Add_Action (Table.States (246), 14, (42, 1), 268);
- Add_Action (Table.States (246), 24, (42, 0), 269);
- Table.States (246).Kernel := To_Vector ((((42, 0), 37, 2,
(2147483647, 0), 0), ((42, 1), 37, 4,
- (2147483647, 0), 0), ((42, 2), 37, 6, (2147483647, 0), 0)));
- Table.States (246).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (42, 0), 24, 269)));
+ Add_Action (Table.States (246), 16, (44, 1), 268);
+ Add_Action (Table.States (246), 26, (44, 0), 269);
+ Table.States (246).Kernel := To_Vector ((((44, 0), 39, 2,
(32767, 0), 0), ((44, 1), 39, 4, (32767, 0),
+ 0), ((44, 2), 39, 6, (32767, 0), 0)));
+ Table.States (246).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 0), 26, 269)));
Table.States (247).Action_List.Set_Capacity (8);
- Add_Action (Table.States (247), (6, 8, 12, 16, 18, 23, 25, 37),
(67, 4), 2,
- simple_declarative_item_4'Access, null);
- Table.States (247).Kernel := To_Vector ((0 => ((67, 4), 34, 0,
(67, 4), 2)));
- Table.States (247).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (67, 4), 2)));
+ Add_Action (Table.States (247), (8, 10, 14, 18, 20, 25, 27, 39),
(69, 4), 2);
+ Table.States (247).Kernel := To_Vector ((0 => ((69, 4), 36, 0,
(69, 4), 2)));
+ Table.States (247).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (69, 4), 2)));
Table.States (248).Action_List.Set_Capacity (3);
- Add_Action (Table.States (248), 9, (62, 0), 270);
- Add_Action (Table.States (248), 13, (61, 0), 271);
- Add_Action (Table.States (248), 20, (63, 0), 272);
- Table.States (248).Kernel := To_Vector ((((61, 0), 58, 3,
(2147483647, 0), 0), ((62, 0), 58, 4,
- (2147483647, 0), 0), ((63, 0), 58, 2, (2147483647, 0), 0)));
- Table.States (248).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (63, 0), 20, 272)));
+ Add_Action (Table.States (248), 11, (64, 0), 270);
+ Add_Action (Table.States (248), 15, (63, 0), 271);
+ Add_Action (Table.States (248), 22, (65, 0), 272);
+ Table.States (248).Kernel := To_Vector ((((63, 0), 60, 3,
(32767, 0), 0), ((64, 0), 60, 4, (32767, 0),
+ 0), ((65, 0), 60, 2, (32767, 0), 0)));
+ Table.States (248).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (65, 0), 22, 272)));
Table.States (249).Action_List.Set_Capacity (1);
- Add_Action (Table.States (249), 13, (72, 0), 273);
- Table.States (249).Kernel := To_Vector ((0 => ((72, 0), 37, 4,
(2147483647, 0), 0)));
- Table.States (249).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (72, 0), 13, 273)));
+ Add_Action (Table.States (249), 15, (74, 0), 273);
+ Table.States (249).Kernel := To_Vector ((0 => ((74, 0), 39, 4,
(32767, 0), 0)));
+ Table.States (249).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (74, 0), 15, 273)));
Table.States (250).Action_List.Set_Capacity (1);
- Add_Action (Table.States (250), 37, (67, 1), 274);
- Table.States (250).Kernel := To_Vector ((0 => ((67, 1), 28, 3,
(2147483647, 0), 0)));
- Table.States (250).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (67, 1), 37, 274)));
+ Add_Action (Table.States (250), 39, (69, 1), 274);
+ Table.States (250).Kernel := To_Vector ((0 => ((69, 1), 30, 3,
(32767, 0), 0)));
+ Table.States (250).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (69, 1), 39, 274)));
Table.States (251).Action_List.Set_Capacity (10);
- Add_Action (Table.States (251), 10, (57, 0), 130);
- Add_Action (Table.States (251), 11, (57, 1), 131);
- Add_Action (Table.States (251), 14, (41, 0), 132);
- Add_Action (Table.States (251), 19, (43, 0), 9);
- Add_Action (Table.States (251), 27, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (251), 31, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (251), 33, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (251), 34, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (251), 37, (58, 1), 133);
- Add_Action (Table.States (251), 38, (69, 0), 134);
+ Add_Action (Table.States (251), 12, (59, 0), 130);
+ Add_Action (Table.States (251), 13, (59, 1), 131);
+ Add_Action (Table.States (251), 16, (43, 0), 132);
+ Add_Action (Table.States (251), 21, (45, 0), 9);
+ Add_Action (Table.States (251), 29, Reduce, (60, 0), 0);
+ Add_Action (Table.States (251), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (251), 35, Reduce, (60, 0), 0);
+ Add_Action (Table.States (251), 36, Reduce, (60, 0), 0);
+ Add_Action (Table.States (251), 39, (60, 1), 133);
+ Add_Action (Table.States (251), 40, (71, 0), 134);
Table.States (251).Goto_List.Set_Capacity (9);
- Add_Goto (Table.States (251), 41, 135);
- Add_Goto (Table.States (251), 43, 136);
- Add_Goto (Table.States (251), 44, 137);
- Add_Goto (Table.States (251), 56, 275);
- Add_Goto (Table.States (251), 57, 139);
- Add_Goto (Table.States (251), 58, 140);
- Add_Goto (Table.States (251), 59, 141);
- Add_Goto (Table.States (251), 69, 142);
- Add_Goto (Table.States (251), 71, 143);
- Table.States (251).Kernel := To_Vector ((0 => ((67, 0), 29, 1,
(2147483647, 0), 0)));
- Table.States (251).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (56, 0), 0)));
+ Add_Goto (Table.States (251), 43, 135);
+ Add_Goto (Table.States (251), 45, 136);
+ Add_Goto (Table.States (251), 46, 137);
+ Add_Goto (Table.States (251), 58, 275);
+ Add_Goto (Table.States (251), 59, 139);
+ Add_Goto (Table.States (251), 60, 140);
+ Add_Goto (Table.States (251), 61, 141);
+ Add_Goto (Table.States (251), 71, 142);
+ Add_Goto (Table.States (251), 73, 143);
+ Table.States (251).Kernel := To_Vector ((0 => ((69, 0), 31, 1,
(32767, 0), 0)));
+ Table.States (251).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 0), 0)));
Table.States (252).Action_List.Set_Capacity (8);
- Add_Action (Table.States (252), (6, 8, 12, 16, 18, 23, 25, 37),
(52, 1), 2, null, null);
- Table.States (252).Kernel := To_Vector ((0 => ((52, 1), 51, 0,
(52, 1), 2)));
- Table.States (252).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (52, 1), 2)));
+ Add_Action (Table.States (252), (8, 10, 14, 18, 20, 25, 27, 39),
(54, 1), 2);
+ Table.States (252).Kernel := To_Vector ((0 => ((54, 1), 53, 0,
(54, 1), 2)));
+ Table.States (252).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (54, 1), 2)));
Table.States (253).Action_List.Set_Capacity (7);
- Add_Action (Table.States (253), (6, 8, 12, 16, 18, 23, 37), (42,
3), 8, attribute_declaration_3'Access,
- null);
- Table.States (253).Kernel := To_Vector ((0 => ((42, 3), 34, 0,
(42, 3), 8)));
- Table.States (253).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (42, 3), 8)));
+ Add_Action (Table.States (253), (8, 10, 14, 18, 20, 25, 39), (44,
3), 8);
+ Table.States (253).Kernel := To_Vector ((0 => ((44, 3), 36, 0,
(44, 3), 8)));
+ Table.States (253).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (44, 3), 8)));
Table.States (254).Action_List.Set_Capacity (11);
- Add_Action (Table.States (254), 10, (57, 0), 32);
- Add_Action (Table.States (254), 11, (57, 1), 33);
- Add_Action (Table.States (254), 14, (41, 0), 34);
- Add_Action (Table.States (254), 19, (43, 0), 9);
- Add_Action (Table.States (254), 21, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (254), 27, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (254), 30, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (254), 31, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (254), 33, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (254), 37, (58, 1), 36);
- Add_Action (Table.States (254), 38, (69, 0), 37);
+ Add_Action (Table.States (254), 12, (59, 0), 32);
+ Add_Action (Table.States (254), 13, (59, 1), 33);
+ Add_Action (Table.States (254), 16, (43, 0), 34);
+ Add_Action (Table.States (254), 21, (45, 0), 9);
+ Add_Action (Table.States (254), 23, Reduce, (60, 0), 0);
+ Add_Action (Table.States (254), 29, Reduce, (60, 0), 0);
+ Add_Action (Table.States (254), 32, Reduce, (60, 0), 0);
+ Add_Action (Table.States (254), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (254), 35, Reduce, (60, 0), 0);
+ Add_Action (Table.States (254), 39, (60, 1), 36);
+ Add_Action (Table.States (254), 40, (71, 0), 37);
Table.States (254).Goto_List.Set_Capacity (10);
- Add_Goto (Table.States (254), 41, 38);
- Add_Goto (Table.States (254), 43, 39);
- Add_Goto (Table.States (254), 44, 40);
- Add_Goto (Table.States (254), 56, 41);
- Add_Goto (Table.States (254), 57, 42);
- Add_Goto (Table.States (254), 58, 43);
- Add_Goto (Table.States (254), 59, 44);
- Add_Goto (Table.States (254), 69, 45);
- Add_Goto (Table.States (254), 70, 258);
- Add_Goto (Table.States (254), 71, 47);
- Table.States (254).Kernel := To_Vector ((0 => ((41, 0), 14, 1,
(2147483647, 0), 0)));
- Table.States (254).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (70, 0), 0)));
+ Add_Goto (Table.States (254), 43, 38);
+ Add_Goto (Table.States (254), 45, 39);
+ Add_Goto (Table.States (254), 46, 40);
+ Add_Goto (Table.States (254), 58, 41);
+ Add_Goto (Table.States (254), 59, 42);
+ Add_Goto (Table.States (254), 60, 43);
+ Add_Goto (Table.States (254), 61, 44);
+ Add_Goto (Table.States (254), 71, 45);
+ Add_Goto (Table.States (254), 72, 258);
+ Add_Goto (Table.States (254), 73, 47);
+ Table.States (254).Kernel := To_Vector ((0 => ((43, 0), 16, 1,
(32767, 0), 0)));
+ Table.States (254).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (72, 0), 0)));
Table.States (255).Action_List.Set_Capacity (3);
- Add_Action (Table.States (255), (4, 27, 34), (57, 0), 2, null,
null);
- Table.States (255).Kernel := To_Vector ((0 => ((57, 0), 41, 0,
(57, 0), 2)));
- Table.States (255).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (57, 0), 2)));
+ Add_Action (Table.States (255), (6, 29, 36), (59, 0), 2);
+ Table.States (255).Kernel := To_Vector ((0 => ((59, 0), 43, 0,
(59, 0), 2)));
+ Table.States (255).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (59, 0), 2)));
Table.States (256).Action_List.Set_Capacity (3);
- Add_Action (Table.States (256), (4, 27, 34), (57, 1), 2, null,
null);
- Table.States (256).Kernel := To_Vector ((0 => ((57, 1), 41, 0,
(57, 1), 2)));
- Table.States (256).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (57, 1), 2)));
+ Add_Action (Table.States (256), (6, 29, 36), (59, 1), 2);
+ Table.States (256).Kernel := To_Vector ((0 => ((59, 1), 43, 0,
(59, 1), 2)));
+ Table.States (256).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (59, 1), 2)));
Table.States (257).Action_List.Set_Capacity (3);
- Add_Action (Table.States (257), (4, 27, 34), (71, 1), 2, null,
null);
- Table.States (257).Kernel := To_Vector ((0 => ((71, 1), 21, 0,
(71, 1), 2)));
- Table.States (257).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (71, 1), 2)));
+ Add_Action (Table.States (257), (6, 29, 36), (73, 1), 2);
+ Table.States (257).Kernel := To_Vector ((0 => ((73, 1), 23, 0,
(73, 1), 2)));
+ Table.States (257).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (73, 1), 2)));
Table.States (258).Action_List.Set_Capacity (2);
- Add_Action (Table.States (258), 21, (41, 0), 276);
- Add_Action (Table.States (258), 30, (70, 1), 67);
- Table.States (258).Kernel := To_Vector ((((41, 0), 70, 1,
(2147483647, 0), 0), ((70, 1), 70, 1,
- (2147483647, 0), 0)));
- Table.States (258).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (41, 0), 21, 276)));
+ Add_Action (Table.States (258), 23, (43, 0), 276);
+ Add_Action (Table.States (258), 32, (72, 1), 67);
+ Table.States (258).Kernel := To_Vector ((((43, 0), 72, 1,
(32767, 0), 0), ((72, 1), 72, 1, (32767, 0),
+ 0)));
+ Table.States (258).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (43, 0), 23, 276)));
Table.States (259).Action_List.Set_Capacity (1);
- Add_Action (Table.States (259), 37, (44, 0), 277);
- Table.States (259).Kernel := To_Vector ((((44, 0), 33, 1,
(2147483647, 0), 0), ((44, 1), 33, 4,
- (2147483647, 0), 0)));
- Table.States (259).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 0), 37, 277)));
+ Add_Action (Table.States (259), 39, (46, 0), 277);
+ Table.States (259).Kernel := To_Vector ((((46, 0), 35, 1,
(32767, 0), 0), ((46, 1), 35, 4, (32767, 0),
+ 0)));
+ Table.States (259).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (46, 0), 39, 277)));
Table.States (260).Action_List.Set_Capacity (1);
- Add_Action (Table.States (260), 36, (42, 2), 278);
- Table.States (260).Kernel := To_Vector ((0 => ((42, 2), 4, 2,
(2147483647, 0), 0)));
- Table.States (260).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (42, 2), 36, 278)));
+ Add_Action (Table.States (260), 38, (44, 2), 278);
+ Table.States (260).Kernel := To_Vector ((0 => ((44, 2), 6, 2,
(32767, 0), 0)));
+ Table.States (260).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 2), 38, 278)));
Table.States (261).Action_List.Set_Capacity (11);
- Add_Action (Table.States (261), 4, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (261), 10, (57, 0), 227);
- Add_Action (Table.States (261), 11, (57, 1), 228);
- Add_Action (Table.States (261), 14, (41, 0), 229);
- Add_Action (Table.States (261), 19, (43, 0), 9);
- Add_Action (Table.States (261), 27, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (261), 31, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (261), 33, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (261), 34, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (261), 37, (58, 1), 230);
- Add_Action (Table.States (261), 38, (69, 0), 231);
+ Add_Action (Table.States (261), 6, Reduce, (60, 0), 0);
+ Add_Action (Table.States (261), 12, (59, 0), 227);
+ Add_Action (Table.States (261), 13, (59, 1), 228);
+ Add_Action (Table.States (261), 16, (43, 0), 229);
+ Add_Action (Table.States (261), 21, (45, 0), 9);
+ Add_Action (Table.States (261), 29, Reduce, (60, 0), 0);
+ Add_Action (Table.States (261), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (261), 35, Reduce, (60, 0), 0);
+ Add_Action (Table.States (261), 36, Reduce, (60, 0), 0);
+ Add_Action (Table.States (261), 39, (60, 1), 230);
+ Add_Action (Table.States (261), 40, (71, 0), 231);
Table.States (261).Goto_List.Set_Capacity (8);
- Add_Goto (Table.States (261), 41, 232);
- Add_Goto (Table.States (261), 43, 233);
- Add_Goto (Table.States (261), 44, 234);
- Add_Goto (Table.States (261), 57, 236);
- Add_Goto (Table.States (261), 58, 237);
- Add_Goto (Table.States (261), 59, 238);
- Add_Goto (Table.States (261), 69, 239);
- Add_Goto (Table.States (261), 71, 279);
- Table.States (261).Kernel := To_Vector ((0 => ((56, 1), 27, 0,
(71, 0), 1)));
- Table.States (261).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (71, 0), 1)));
+ Add_Goto (Table.States (261), 43, 232);
+ Add_Goto (Table.States (261), 45, 233);
+ Add_Goto (Table.States (261), 46, 234);
+ Add_Goto (Table.States (261), 59, 236);
+ Add_Goto (Table.States (261), 60, 237);
+ Add_Goto (Table.States (261), 61, 238);
+ Add_Goto (Table.States (261), 71, 239);
+ Add_Goto (Table.States (261), 73, 279);
+ Table.States (261).Kernel := To_Vector ((0 => ((58, 1), 29, 0,
(73, 0), 0)));
+ Table.States (261).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (73, 0), 0)));
Table.States (262).Action_List.Set_Capacity (7);
- Add_Action (Table.States (262), (6, 8, 12, 16, 18, 23, 37), (42,
1), 8, attribute_declaration_1'Access,
- null);
- Table.States (262).Kernel := To_Vector ((0 => ((42, 1), 34, 0,
(42, 1), 8)));
- Table.States (262).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (42, 1), 8)));
+ Add_Action (Table.States (262), (8, 10, 14, 18, 20, 25, 39), (44,
1), 8);
+ Table.States (262).Kernel := To_Vector ((0 => ((44, 1), 36, 0,
(44, 1), 8)));
+ Table.States (262).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (44, 1), 8)));
Table.States (263).Action_List.Set_Capacity (1);
- Add_Action (Table.States (263), 37, (59, 1), 280);
- Table.States (263).Kernel := To_Vector ((0 => ((59, 1), 31, 1,
(2147483647, 0), 0)));
- Table.States (263).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (59, 1), 37, 280)));
+ Add_Action (Table.States (263), 39, (61, 1), 280);
+ Table.States (263).Kernel := To_Vector ((0 => ((61, 1), 33, 1,
(32767, 0), 0)));
+ Table.States (263).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (61, 1), 39, 280)));
Table.States (264).Action_List.Set_Capacity (1);
- Add_Action (Table.States (264), 34, (62, 0), 281);
- Table.States (264).Kernel := To_Vector ((0 => ((62, 0), 58, 1,
(2147483647, 0), 0)));
- Table.States (264).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (62, 0), 34, 281)));
+ Add_Action (Table.States (264), 36, (64, 0), 281);
+ Table.States (264).Kernel := To_Vector ((0 => ((64, 0), 60, 1,
(32767, 0), 0)));
+ Table.States (264).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (64, 0), 36, 281)));
+ end Subr_5;
+ procedure Subr_6
+ is begin
Table.States (265).Action_List.Set_Capacity (2);
- Add_Action (Table.States (265), (27, 34), (44, 1), 6, null, null);
- Table.States (265).Kernel := To_Vector ((0 => ((44, 1), 21, 0,
(44, 1), 6)));
- Table.States (265).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (44, 1), 6)));
+ Add_Action (Table.States (265), (29, 36), (46, 1), 6);
+ Table.States (265).Kernel := To_Vector ((0 => ((46, 1), 23, 0,
(46, 1), 6)));
+ Table.States (265).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (46, 1), 6)));
Table.States (266).Action_List.Set_Capacity (2);
- Add_Action (Table.States (266), 8, Reduce, (47, 0), 0, null,
null);
- Add_Action (Table.States (266), 25, (46, 0), 147);
- Add_Conflict (Table.States (266), 25, (47, 0), 0, null, null);
+ Add_Action (Table.States (266), 10, Reduce, (49, 0), 0);
+ Add_Action (Table.States (266), 27, (48, 0), 147);
+ Add_Conflict (Table.States (266), 27, (49, 0), 0);
Table.States (266).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (266), 46, 148);
- Add_Goto (Table.States (266), 47, 282);
- Table.States (266).Kernel := To_Vector ((0 => ((45, 0), 13, 3,
(2147483647, 0), 0)));
- Table.States (266).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (47, 0), 0)));
+ Add_Goto (Table.States (266), 48, 148);
+ Add_Goto (Table.States (266), 49, 282);
+ Table.States (266).Kernel := To_Vector ((0 => ((47, 0), 15, 3,
(32767, 0), 0)));
+ Table.States (266).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (49, 0), 0)));
Table.States (267).Action_List.Set_Capacity (1);
- Add_Action (Table.States (267), 38, (42, 3), 283);
- Table.States (267).Kernel := To_Vector ((0 => ((42, 3), 14, 4,
(2147483647, 0), 0)));
- Table.States (267).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (42, 3), 38, 283)));
+ Add_Action (Table.States (267), 40, (44, 3), 283);
+ Table.States (267).Kernel := To_Vector ((0 => ((44, 3), 16, 4,
(32767, 0), 0)));
+ Table.States (267).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 3), 40, 283)));
Table.States (268).Action_List.Set_Capacity (3);
- Add_Action (Table.States (268), 17, (54, 2), 152);
- Add_Action (Table.States (268), 21, Reduce, (54, 0), 0, null,
null);
- Add_Action (Table.States (268), 38, (54, 1), 153);
+ Add_Action (Table.States (268), 19, (56, 2), 152);
+ Add_Action (Table.States (268), 23, Reduce, (56, 0), 0);
+ Add_Action (Table.States (268), 40, (56, 1), 153);
Table.States (268).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (268), 54, 284);
- Table.States (268).Kernel := To_Vector ((((42, 1), 14, 3,
(2147483647, 0), 0), ((42, 2), 14, 5,
- (2147483647, 0), 0)));
- Table.States (268).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (54, 0), 0)));
+ Add_Goto (Table.States (268), 56, 284);
+ Table.States (268).Kernel := To_Vector ((((44, 1), 16, 3,
(32767, 0), 0), ((44, 2), 16, 5, (32767, 0),
+ 0)));
+ Table.States (268).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (56, 0), 0)));
Table.States (269).Action_List.Set_Capacity (10);
- Add_Action (Table.States (269), 10, (57, 0), 130);
- Add_Action (Table.States (269), 11, (57, 1), 131);
- Add_Action (Table.States (269), 14, (41, 0), 132);
- Add_Action (Table.States (269), 19, (43, 0), 9);
- Add_Action (Table.States (269), 27, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (269), 31, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (269), 33, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (269), 34, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (269), 37, (58, 1), 133);
- Add_Action (Table.States (269), 38, (69, 0), 134);
+ Add_Action (Table.States (269), 12, (59, 0), 130);
+ Add_Action (Table.States (269), 13, (59, 1), 131);
+ Add_Action (Table.States (269), 16, (43, 0), 132);
+ Add_Action (Table.States (269), 21, (45, 0), 9);
+ Add_Action (Table.States (269), 29, Reduce, (60, 0), 0);
+ Add_Action (Table.States (269), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (269), 35, Reduce, (60, 0), 0);
+ Add_Action (Table.States (269), 36, Reduce, (60, 0), 0);
+ Add_Action (Table.States (269), 39, (60, 1), 133);
+ Add_Action (Table.States (269), 40, (71, 0), 134);
Table.States (269).Goto_List.Set_Capacity (9);
- Add_Goto (Table.States (269), 41, 135);
- Add_Goto (Table.States (269), 43, 136);
- Add_Goto (Table.States (269), 44, 137);
- Add_Goto (Table.States (269), 56, 285);
- Add_Goto (Table.States (269), 57, 139);
- Add_Goto (Table.States (269), 58, 140);
- Add_Goto (Table.States (269), 59, 141);
- Add_Goto (Table.States (269), 69, 142);
- Add_Goto (Table.States (269), 71, 143);
- Table.States (269).Kernel := To_Vector ((0 => ((42, 0), 24, 1,
(2147483647, 0), 0)));
- Table.States (269).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (56, 0), 0)));
+ Add_Goto (Table.States (269), 43, 135);
+ Add_Goto (Table.States (269), 45, 136);
+ Add_Goto (Table.States (269), 46, 137);
+ Add_Goto (Table.States (269), 58, 285);
+ Add_Goto (Table.States (269), 59, 139);
+ Add_Goto (Table.States (269), 60, 140);
+ Add_Goto (Table.States (269), 61, 141);
+ Add_Goto (Table.States (269), 71, 142);
+ Add_Goto (Table.States (269), 73, 143);
+ Table.States (269).Kernel := To_Vector ((0 => ((44, 0), 26, 1,
(32767, 0), 0)));
+ Table.States (269).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 0), 0)));
Table.States (270).Action_List.Set_Capacity (3);
- Add_Action (Table.States (270), 13, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (270), 31, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (270), 37, (58, 1), 105);
+ Add_Action (Table.States (270), 15, Reduce, (60, 0), 0);
+ Add_Action (Table.States (270), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (270), 39, (60, 1), 105);
Table.States (270).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (270), 58, 106);
- Add_Goto (Table.States (270), 59, 286);
- Table.States (270).Kernel := To_Vector ((0 => ((62, 0), 9, 3,
(2147483647, 0), 0)));
- Table.States (270).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (59, 0), 0)));
+ Add_Goto (Table.States (270), 60, 106);
+ Add_Goto (Table.States (270), 61, 286);
+ Table.States (270).Kernel := To_Vector ((0 => ((64, 0), 11, 3,
(32767, 0), 0)));
+ Table.States (270).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (61, 0), 0)));
Table.States (271).Action_List.Set_Capacity (7);
- Add_Action (Table.States (271), 6, (45, 0), 85);
- Add_Action (Table.States (271), 8, Reduce, (53, 0), 0, null,
null);
- Add_Action (Table.States (271), 12, (42, 0), 86);
- Add_Action (Table.States (271), 16, (67, 4), 87);
- Add_Action (Table.States (271), 18, (61, 0), 88);
- Add_Action (Table.States (271), 23, (72, 0), 89);
- Add_Action (Table.States (271), 37, (67, 0), 90);
+ Add_Action (Table.States (271), 8, (47, 0), 85);
+ Add_Action (Table.States (271), 10, Reduce, (55, 0), 0);
+ Add_Action (Table.States (271), 14, (44, 0), 86);
+ Add_Action (Table.States (271), 18, (69, 4), 87);
+ Add_Action (Table.States (271), 20, (63, 0), 88);
+ Add_Action (Table.States (271), 25, (74, 0), 89);
+ Add_Action (Table.States (271), 39, (69, 0), 90);
Table.States (271).Goto_List.Set_Capacity (11);
- Add_Goto (Table.States (271), 42, 91);
- Add_Goto (Table.States (271), 45, 92);
- Add_Goto (Table.States (271), 51, 93);
- Add_Goto (Table.States (271), 52, 94);
- Add_Goto (Table.States (271), 53, 287);
- Add_Goto (Table.States (271), 60, 96);
- Add_Goto (Table.States (271), 61, 97);
- Add_Goto (Table.States (271), 62, 98);
- Add_Goto (Table.States (271), 63, 99);
- Add_Goto (Table.States (271), 67, 100);
- Add_Goto (Table.States (271), 72, 101);
- Table.States (271).Kernel := To_Vector ((0 => ((61, 0), 13, 2,
(2147483647, 0), 0)));
- Table.States (271).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (53, 0), 0)));
+ Add_Goto (Table.States (271), 44, 91);
+ Add_Goto (Table.States (271), 47, 92);
+ Add_Goto (Table.States (271), 53, 93);
+ Add_Goto (Table.States (271), 54, 94);
+ Add_Goto (Table.States (271), 55, 287);
+ Add_Goto (Table.States (271), 62, 96);
+ Add_Goto (Table.States (271), 63, 97);
+ Add_Goto (Table.States (271), 64, 98);
+ Add_Goto (Table.States (271), 65, 99);
+ Add_Goto (Table.States (271), 69, 100);
+ Add_Goto (Table.States (271), 74, 101);
+ Table.States (271).Kernel := To_Vector ((0 => ((63, 0), 15, 2,
(32767, 0), 0)));
+ Table.States (271).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (55, 0), 0)));
Table.States (272).Action_List.Set_Capacity (3);
- Add_Action (Table.States (272), 31, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (272), 34, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (272), 37, (58, 1), 158);
+ Add_Action (Table.States (272), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (272), 36, Reduce, (60, 0), 0);
+ Add_Action (Table.States (272), 39, (60, 1), 158);
Table.States (272).Goto_List.Set_Capacity (2);
- Add_Goto (Table.States (272), 58, 159);
- Add_Goto (Table.States (272), 59, 288);
- Table.States (272).Kernel := To_Vector ((0 => ((63, 0), 20, 1,
(2147483647, 0), 0)));
- Table.States (272).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (59, 0), 0)));
+ Add_Goto (Table.States (272), 60, 159);
+ Add_Goto (Table.States (272), 61, 288);
+ Table.States (272).Kernel := To_Vector ((0 => ((65, 0), 22, 1,
(32767, 0), 0)));
+ Table.States (272).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (61, 0), 0)));
Table.States (273).Action_List.Set_Capacity (1);
- Add_Action (Table.States (273), 14, (41, 0), 161);
+ Add_Action (Table.States (273), 16, (43, 0), 161);
Table.States (273).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (273), 41, 289);
- Table.States (273).Kernel := To_Vector ((0 => ((72, 0), 13, 3,
(2147483647, 0), 0)));
- Table.States (273).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (41, 0), 14, 161)));
+ Add_Goto (Table.States (273), 43, 289);
+ Table.States (273).Kernel := To_Vector ((0 => ((74, 0), 15, 3,
(32767, 0), 0)));
+ Table.States (273).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (43, 0), 16, 161)));
Table.States (274).Action_List.Set_Capacity (1);
- Add_Action (Table.States (274), 29, (67, 1), 290);
- Table.States (274).Kernel := To_Vector ((0 => ((67, 1), 37, 2,
(2147483647, 0), 0)));
- Table.States (274).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (67, 1), 29, 290)));
+ Add_Action (Table.States (274), 31, (69, 1), 290);
+ Table.States (274).Kernel := To_Vector ((0 => ((69, 1), 39, 2,
(32767, 0), 0)));
+ Table.States (274).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (69, 1), 31, 290)));
Table.States (275).Action_List.Set_Capacity (2);
- Add_Action (Table.States (275), 27, (56, 1), 170);
- Add_Action (Table.States (275), 34, (67, 0), 291);
- Table.States (275).Kernel := To_Vector ((((56, 1), 56, 1,
(2147483647, 0), 0), ((67, 0), 56, 1,
- (2147483647, 0), 0)));
- Table.States (275).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (67, 0), 34, 291)));
+ Add_Action (Table.States (275), 29, (58, 1), 170);
+ Add_Action (Table.States (275), 36, (69, 0), 291);
+ Table.States (275).Kernel := To_Vector ((((58, 1), 58, 1,
(32767, 0), 0), ((69, 0), 58, 1, (32767, 0),
+ 0)));
+ Table.States (275).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (69, 0), 36, 291)));
Table.States (276).Action_List.Set_Capacity (3);
- Add_Action (Table.States (276), (4, 27, 34), (41, 0), 3,
aggregate_g_0'Access, null);
- Table.States (276).Kernel := To_Vector ((0 => ((41, 0), 21, 0,
(41, 0), 3)));
- Table.States (276).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (41, 0), 3)));
+ Add_Action (Table.States (276), (6, 29, 36), (43, 0), 3);
+ Table.States (276).Kernel := To_Vector ((0 => ((43, 0), 23, 0,
(43, 0), 3)));
+ Table.States (276).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (43, 0), 3)));
Table.States (277).Action_List.Set_Capacity (4);
- Add_Action (Table.States (277), 4, Reduce, (44, 0), 3, null,
null);
- Add_Action (Table.States (277), 14, (44, 1), 292);
- Add_Action (Table.States (277), 27, Reduce, (44, 0), 3, null,
null);
- Add_Action (Table.States (277), 34, Reduce, (44, 0), 3, null,
null);
- Table.States (277).Kernel := To_Vector ((((44, 0), 37, 0, (44,
0), 3), ((44, 1), 37, 3, (2147483647,
- 0), 0)));
- Table.States (277).Minimal_Complete_Actions := To_Vector
(((Reduce, (44, 0), 3), (Shift, (44, 1), 14,
+ Add_Action (Table.States (277), 6, Reduce, (46, 0), 3);
+ Add_Action (Table.States (277), 16, (46, 1), 292);
+ Add_Action (Table.States (277), 29, Reduce, (46, 0), 3);
+ Add_Action (Table.States (277), 36, Reduce, (46, 0), 3);
+ Table.States (277).Kernel := To_Vector ((((46, 0), 39, 0, (46,
0), 3), ((46, 1), 39, 3, (32767, 0),
+ 0)));
+ Table.States (277).Minimal_Complete_Actions := To_Vector
(((Reduce, (46, 0), 3), (Shift, (46, 1), 16,
292)));
Table.States (278).Action_List.Set_Capacity (1);
- Add_Action (Table.States (278), 34, (42, 2), 293);
- Table.States (278).Kernel := To_Vector ((0 => ((42, 2), 36, 1,
(2147483647, 0), 0)));
- Table.States (278).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (42, 2), 34, 293)));
+ Add_Action (Table.States (278), 36, (44, 2), 293);
+ Table.States (278).Kernel := To_Vector ((0 => ((44, 2), 38, 1,
(32767, 0), 0)));
+ Table.States (278).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 2), 36, 293)));
Table.States (279).Action_List.Set_Capacity (3);
- Add_Action (Table.States (279), (4, 27, 34), (56, 1), 3, null,
null);
- Table.States (279).Kernel := To_Vector ((0 => ((56, 1), 71, 0,
(56, 1), 3)));
- Table.States (279).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (56, 1), 3)));
+ Add_Action (Table.States (279), (6, 29, 36), (58, 1), 3);
+ Table.States (279).Kernel := To_Vector ((0 => ((58, 1), 73, 0,
(58, 1), 3)));
+ Table.States (279).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 1), 3)));
Table.States (280).Action_List.Set_Capacity (5);
- Add_Action (Table.States (280), (4, 27, 31, 33, 34), (59, 1), 3,
null, null);
- Table.States (280).Kernel := To_Vector ((0 => ((59, 1), 37, 0,
(59, 1), 3)));
- Table.States (280).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (59, 1), 3)));
+ Add_Action (Table.States (280), (6, 29, 33, 35, 36), (61, 1), 3);
+ Table.States (280).Kernel := To_Vector ((0 => ((61, 1), 39, 0,
(61, 1), 3)));
+ Table.States (280).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (61, 1), 3)));
Table.States (281).Action_List.Set_Capacity (7);
- Add_Action (Table.States (281), (6, 8, 12, 16, 18, 23, 37), (62,
0), 9, package_extension_0'Access,
- package_extension_0_check'Access);
- Table.States (281).Kernel := To_Vector ((0 => ((62, 0), 34, 0,
(62, 0), 9)));
- Table.States (281).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (62, 0), 9)));
+ Add_Action (Table.States (281), (8, 10, 14, 18, 20, 25, 39), (64,
0), 9);
+ Table.States (281).Kernel := To_Vector ((0 => ((64, 0), 36, 0,
(64, 0), 9)));
+ Table.States (281).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (64, 0), 9)));
Table.States (282).Action_List.Set_Capacity (2);
- Add_Action (Table.States (282), 8, (45, 0), 294);
- Add_Action (Table.States (282), 25, (46, 0), 147);
+ Add_Action (Table.States (282), 10, (47, 0), 294);
+ Add_Action (Table.States (282), 27, (48, 0), 147);
Table.States (282).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (282), 46, 180);
- Table.States (282).Kernel := To_Vector ((((45, 0), 47, 3,
(2147483647, 0), 0), ((47, 2), 47, 2,
- (2147483647, 0), 0)));
- Table.States (282).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (45, 0), 8, 294)));
+ Add_Goto (Table.States (282), 48, 180);
+ Table.States (282).Kernel := To_Vector ((((47, 0), 49, 3,
(32767, 0), 0), ((49, 2), 49, 2, (32767, 0),
+ 0)));
+ Table.States (282).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (47, 0), 10, 294)));
Table.States (283).Action_List.Set_Capacity (1);
- Add_Action (Table.States (283), 21, (42, 3), 295);
- Table.States (283).Kernel := To_Vector ((0 => ((42, 3), 38, 3,
(2147483647, 0), 0)));
- Table.States (283).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (42, 3), 21, 295)));
+ Add_Action (Table.States (283), 23, (44, 3), 295);
+ Table.States (283).Kernel := To_Vector ((0 => ((44, 3), 40, 3,
(32767, 0), 0)));
+ Table.States (283).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 3), 23, 295)));
Table.States (284).Action_List.Set_Capacity (1);
- Add_Action (Table.States (284), 21, (42, 1), 296);
- Table.States (284).Kernel := To_Vector ((((42, 1), 54, 3,
(2147483647, 0), 0), ((42, 2), 54, 5,
- (2147483647, 0), 0)));
- Table.States (284).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (42, 1), 21, 296)));
+ Add_Action (Table.States (284), 23, (44, 1), 296);
+ Table.States (284).Kernel := To_Vector ((((44, 1), 56, 3,
(32767, 0), 0), ((44, 2), 56, 5, (32767, 0),
+ 0)));
+ Table.States (284).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 1), 23, 296)));
Table.States (285).Action_List.Set_Capacity (2);
- Add_Action (Table.States (285), 27, (56, 1), 170);
- Add_Action (Table.States (285), 34, (42, 0), 297);
- Table.States (285).Kernel := To_Vector ((((42, 0), 56, 1,
(2147483647, 0), 0), ((56, 1), 56, 1,
- (2147483647, 0), 0)));
- Table.States (285).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (42, 0), 34, 297)));
+ Add_Action (Table.States (285), 29, (58, 1), 170);
+ Add_Action (Table.States (285), 36, (44, 0), 297);
+ Table.States (285).Kernel := To_Vector ((((44, 0), 58, 1,
(32767, 0), 0), ((58, 1), 58, 1, (32767, 0),
+ 0)));
+ Table.States (285).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 0), 36, 297)));
Table.States (286).Action_List.Set_Capacity (2);
- Add_Action (Table.States (286), 13, (62, 0), 298);
- Add_Action (Table.States (286), 31, (59, 1), 121);
- Table.States (286).Kernel := To_Vector ((((59, 1), 59, 2,
(2147483647, 0), 0), ((62, 0), 59, 3,
- (2147483647, 0), 0)));
- Table.States (286).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (62, 0), 13, 298)));
+ Add_Action (Table.States (286), 15, (64, 0), 298);
+ Add_Action (Table.States (286), 33, (61, 1), 121);
+ Table.States (286).Kernel := To_Vector ((((61, 1), 61, 2,
(32767, 0), 0), ((64, 0), 61, 3, (32767, 0),
+ 0)));
+ Table.States (286).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (64, 0), 15, 298)));
Table.States (287).Action_List.Set_Capacity (1);
- Add_Action (Table.States (287), 8, (61, 0), 299);
- Table.States (287).Kernel := To_Vector ((0 => ((61, 0), 53, 2,
(2147483647, 0), 0)));
- Table.States (287).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (61, 0), 8, 299)));
+ Add_Action (Table.States (287), 10, (63, 0), 299);
+ Table.States (287).Kernel := To_Vector ((0 => ((63, 0), 55, 2,
(32767, 0), 0)));
+ Table.States (287).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (63, 0), 10, 299)));
Table.States (288).Action_List.Set_Capacity (2);
- Add_Action (Table.States (288), 31, (59, 1), 186);
- Add_Action (Table.States (288), 34, (63, 0), 300);
- Table.States (288).Kernel := To_Vector ((((59, 1), 59, 2,
(2147483647, 0), 0), ((63, 0), 59, 1,
- (2147483647, 0), 0)));
- Table.States (288).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (63, 0), 34, 300)));
+ Add_Action (Table.States (288), 33, (61, 1), 186);
+ Add_Action (Table.States (288), 36, (65, 0), 300);
+ Table.States (288).Kernel := To_Vector ((((61, 1), 61, 2,
(32767, 0), 0), ((65, 0), 61, 1, (32767, 0),
+ 0)));
+ Table.States (288).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (65, 0), 36, 300)));
Table.States (289).Action_List.Set_Capacity (1);
- Add_Action (Table.States (289), 34, (72, 0), 301);
- Table.States (289).Kernel := To_Vector ((0 => ((72, 0), 41, 1,
(2147483647, 0), 0)));
- Table.States (289).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (72, 0), 34, 301)));
+ Add_Action (Table.States (289), 36, (74, 0), 301);
+ Table.States (289).Kernel := To_Vector ((0 => ((74, 0), 43, 1,
(32767, 0), 0)));
+ Table.States (289).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (74, 0), 36, 301)));
Table.States (290).Action_List.Set_Capacity (10);
- Add_Action (Table.States (290), 10, (57, 0), 130);
- Add_Action (Table.States (290), 11, (57, 1), 131);
- Add_Action (Table.States (290), 14, (41, 0), 132);
- Add_Action (Table.States (290), 19, (43, 0), 9);
- Add_Action (Table.States (290), 27, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (290), 31, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (290), 33, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (290), 34, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (290), 37, (58, 1), 133);
- Add_Action (Table.States (290), 38, (69, 0), 134);
+ Add_Action (Table.States (290), 12, (59, 0), 130);
+ Add_Action (Table.States (290), 13, (59, 1), 131);
+ Add_Action (Table.States (290), 16, (43, 0), 132);
+ Add_Action (Table.States (290), 21, (45, 0), 9);
+ Add_Action (Table.States (290), 29, Reduce, (60, 0), 0);
+ Add_Action (Table.States (290), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (290), 35, Reduce, (60, 0), 0);
+ Add_Action (Table.States (290), 36, Reduce, (60, 0), 0);
+ Add_Action (Table.States (290), 39, (60, 1), 133);
+ Add_Action (Table.States (290), 40, (71, 0), 134);
Table.States (290).Goto_List.Set_Capacity (9);
- Add_Goto (Table.States (290), 41, 135);
- Add_Goto (Table.States (290), 43, 136);
- Add_Goto (Table.States (290), 44, 137);
- Add_Goto (Table.States (290), 56, 302);
- Add_Goto (Table.States (290), 57, 139);
- Add_Goto (Table.States (290), 58, 140);
- Add_Goto (Table.States (290), 59, 141);
- Add_Goto (Table.States (290), 69, 142);
- Add_Goto (Table.States (290), 71, 143);
- Table.States (290).Kernel := To_Vector ((0 => ((67, 1), 29, 1,
(2147483647, 0), 0)));
- Table.States (290).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (56, 0), 0)));
+ Add_Goto (Table.States (290), 43, 135);
+ Add_Goto (Table.States (290), 45, 136);
+ Add_Goto (Table.States (290), 46, 137);
+ Add_Goto (Table.States (290), 58, 302);
+ Add_Goto (Table.States (290), 59, 139);
+ Add_Goto (Table.States (290), 60, 140);
+ Add_Goto (Table.States (290), 61, 141);
+ Add_Goto (Table.States (290), 71, 142);
+ Add_Goto (Table.States (290), 73, 143);
+ Table.States (290).Kernel := To_Vector ((0 => ((69, 1), 31, 1,
(32767, 0), 0)));
+ Table.States (290).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 0), 0)));
Table.States (291).Action_List.Set_Capacity (8);
- Add_Action (Table.States (291), (6, 8, 12, 16, 18, 23, 25, 37),
(67, 0), 4,
- simple_declarative_item_0'Access, null);
- Table.States (291).Kernel := To_Vector ((0 => ((67, 0), 34, 0,
(67, 0), 4)));
- Table.States (291).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (67, 0), 4)));
+ Add_Action (Table.States (291), (8, 10, 14, 18, 20, 25, 27, 39),
(69, 0), 4);
+ Table.States (291).Kernel := To_Vector ((0 => ((69, 0), 36, 0,
(69, 0), 4)));
+ Table.States (291).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (69, 0), 4)));
Table.States (292).Action_List.Set_Capacity (1);
- Add_Action (Table.States (292), 38, (44, 1), 303);
- Table.States (292).Kernel := To_Vector ((0 => ((44, 1), 14, 2,
(2147483647, 0), 0)));
- Table.States (292).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 1), 38, 303)));
+ Add_Action (Table.States (292), 40, (46, 1), 303);
+ Table.States (292).Kernel := To_Vector ((0 => ((46, 1), 16, 2,
(32767, 0), 0)));
+ Table.States (292).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (46, 1), 40, 303)));
Table.States (293).Action_List.Set_Capacity (7);
- Add_Action (Table.States (293), (6, 8, 12, 16, 18, 23, 37), (42,
2), 10, attribute_declaration_2'Access,
- null);
- Table.States (293).Kernel := To_Vector ((0 => ((42, 2), 34, 0,
(42, 2), 10)));
- Table.States (293).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (42, 2), 10)));
+ Add_Action (Table.States (293), (8, 10, 14, 18, 20, 25, 39), (44,
2), 10);
+ Table.States (293).Kernel := To_Vector ((0 => ((44, 2), 36, 0,
(44, 2), 10)));
+ Table.States (293).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (44, 2), 10)));
Table.States (294).Action_List.Set_Capacity (1);
- Add_Action (Table.States (294), 6, (45, 0), 304);
- Table.States (294).Kernel := To_Vector ((0 => ((45, 0), 8, 2,
(2147483647, 0), 0)));
- Table.States (294).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (45, 0), 6, 304)));
+ Add_Action (Table.States (294), 8, (47, 0), 304);
+ Table.States (294).Kernel := To_Vector ((0 => ((47, 0), 10, 2,
(32767, 0), 0)));
+ Table.States (294).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (47, 0), 8, 304)));
Table.States (295).Action_List.Set_Capacity (1);
- Add_Action (Table.States (295), 24, (42, 3), 305);
- Table.States (295).Kernel := To_Vector ((0 => ((42, 3), 21, 2,
(2147483647, 0), 0)));
- Table.States (295).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (42, 3), 24, 305)));
+ Add_Action (Table.States (295), 26, (44, 3), 305);
+ Table.States (295).Kernel := To_Vector ((0 => ((44, 3), 23, 2,
(32767, 0), 0)));
+ Table.States (295).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 3), 26, 305)));
Table.States (296).Action_List.Set_Capacity (1);
- Add_Action (Table.States (296), 24, (42, 1), 306);
- Table.States (296).Kernel := To_Vector ((((42, 1), 21, 2,
(2147483647, 0), 0), ((42, 2), 21, 4,
- (2147483647, 0), 0)));
- Table.States (296).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (42, 1), 24, 306)));
+ Add_Action (Table.States (296), 26, (44, 1), 306);
+ Table.States (296).Kernel := To_Vector ((((44, 1), 23, 2,
(32767, 0), 0), ((44, 2), 23, 4, (32767, 0),
+ 0)));
+ Table.States (296).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 1), 26, 306)));
Table.States (297).Action_List.Set_Capacity (8);
- Add_Action (Table.States (297), (6, 8, 12, 16, 18, 23, 25, 37),
(42, 0), 5,
- attribute_declaration_0'Access, null);
- Table.States (297).Kernel := To_Vector ((0 => ((42, 0), 34, 0,
(42, 0), 5)));
- Table.States (297).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (42, 0), 5)));
+ Add_Action (Table.States (297), (8, 10, 14, 18, 20, 25, 27, 39),
(44, 0), 5);
+ Table.States (297).Kernel := To_Vector ((0 => ((44, 0), 36, 0,
(44, 0), 5)));
+ Table.States (297).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (44, 0), 5)));
Table.States (298).Action_List.Set_Capacity (7);
- Add_Action (Table.States (298), 6, (45, 0), 85);
- Add_Action (Table.States (298), 8, Reduce, (53, 0), 0, null,
null);
- Add_Action (Table.States (298), 12, (42, 0), 86);
- Add_Action (Table.States (298), 16, (67, 4), 87);
- Add_Action (Table.States (298), 18, (61, 0), 88);
- Add_Action (Table.States (298), 23, (72, 0), 89);
- Add_Action (Table.States (298), 37, (67, 0), 90);
+ Add_Action (Table.States (298), 8, (47, 0), 85);
+ Add_Action (Table.States (298), 10, Reduce, (55, 0), 0);
+ Add_Action (Table.States (298), 14, (44, 0), 86);
+ Add_Action (Table.States (298), 18, (69, 4), 87);
+ Add_Action (Table.States (298), 20, (63, 0), 88);
+ Add_Action (Table.States (298), 25, (74, 0), 89);
+ Add_Action (Table.States (298), 39, (69, 0), 90);
Table.States (298).Goto_List.Set_Capacity (11);
- Add_Goto (Table.States (298), 42, 91);
- Add_Goto (Table.States (298), 45, 92);
- Add_Goto (Table.States (298), 51, 93);
- Add_Goto (Table.States (298), 52, 94);
- Add_Goto (Table.States (298), 53, 307);
- Add_Goto (Table.States (298), 60, 96);
- Add_Goto (Table.States (298), 61, 97);
- Add_Goto (Table.States (298), 62, 98);
- Add_Goto (Table.States (298), 63, 99);
- Add_Goto (Table.States (298), 67, 100);
- Add_Goto (Table.States (298), 72, 101);
- Table.States (298).Kernel := To_Vector ((0 => ((62, 0), 13, 2,
(2147483647, 0), 0)));
- Table.States (298).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (53, 0), 0)));
+ Add_Goto (Table.States (298), 44, 91);
+ Add_Goto (Table.States (298), 47, 92);
+ Add_Goto (Table.States (298), 53, 93);
+ Add_Goto (Table.States (298), 54, 94);
+ Add_Goto (Table.States (298), 55, 307);
+ Add_Goto (Table.States (298), 62, 96);
+ Add_Goto (Table.States (298), 63, 97);
+ Add_Goto (Table.States (298), 64, 98);
+ Add_Goto (Table.States (298), 65, 99);
+ Add_Goto (Table.States (298), 69, 100);
+ Add_Goto (Table.States (298), 74, 101);
+ Table.States (298).Kernel := To_Vector ((0 => ((64, 0), 15, 2,
(32767, 0), 0)));
+ Table.States (298).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (55, 0), 0)));
Table.States (299).Action_List.Set_Capacity (2);
- Add_Action (Table.States (299), 34, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (299), 37, (58, 1), 144);
+ Add_Action (Table.States (299), 36, Reduce, (60, 0), 0);
+ Add_Action (Table.States (299), 39, (60, 1), 144);
Table.States (299).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (299), 58, 308);
- Table.States (299).Kernel := To_Vector ((0 => ((61, 0), 8, 1,
(2147483647, 0), 0)));
- Table.States (299).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 0), 0)));
+ Add_Goto (Table.States (299), 60, 308);
+ Table.States (299).Kernel := To_Vector ((0 => ((63, 0), 10, 1,
(32767, 0), 0)));
+ Table.States (299).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (60, 0), 0)));
Table.States (300).Action_List.Set_Capacity (8);
- Add_Action (Table.States (300), (6, 8, 12, 16, 18, 23, 25, 37),
(63, 0), 5, package_renaming_0'Access,
- null);
- Table.States (300).Kernel := To_Vector ((0 => ((63, 0), 34, 0,
(63, 0), 5)));
- Table.States (300).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (63, 0), 5)));
+ Add_Action (Table.States (300), (8, 10, 14, 18, 20, 25, 27, 39),
(65, 0), 5);
+ Table.States (300).Kernel := To_Vector ((0 => ((65, 0), 36, 0,
(65, 0), 5)));
+ Table.States (300).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (65, 0), 5)));
Table.States (301).Action_List.Set_Capacity (8);
- Add_Action (Table.States (301), (6, 8, 12, 16, 18, 23, 25, 37),
(72, 0), 5,
- typed_string_declaration_0'Access, null);
- Table.States (301).Kernel := To_Vector ((0 => ((72, 0), 34, 0,
(72, 0), 5)));
- Table.States (301).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (72, 0), 5)));
+ Add_Action (Table.States (301), (8, 10, 14, 18, 20, 25, 27, 39),
(74, 0), 5);
+ Table.States (301).Kernel := To_Vector ((0 => ((74, 0), 36, 0,
(74, 0), 5)));
+ Table.States (301).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (74, 0), 5)));
Table.States (302).Action_List.Set_Capacity (2);
- Add_Action (Table.States (302), 27, (56, 1), 170);
- Add_Action (Table.States (302), 34, (67, 1), 309);
- Table.States (302).Kernel := To_Vector ((((56, 1), 56, 1,
(2147483647, 0), 0), ((67, 1), 56, 1,
- (2147483647, 0), 0)));
- Table.States (302).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (67, 1), 34, 309)));
+ Add_Action (Table.States (302), 29, (58, 1), 170);
+ Add_Action (Table.States (302), 36, (69, 1), 309);
+ Table.States (302).Kernel := To_Vector ((((58, 1), 58, 1,
(32767, 0), 0), ((69, 1), 58, 1, (32767, 0),
+ 0)));
+ Table.States (302).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (69, 1), 36, 309)));
Table.States (303).Action_List.Set_Capacity (1);
- Add_Action (Table.States (303), 21, (44, 1), 310);
- Table.States (303).Kernel := To_Vector ((0 => ((44, 1), 38, 1,
(2147483647, 0), 0)));
- Table.States (303).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 1), 21, 310)));
+ Add_Action (Table.States (303), 23, (46, 1), 310);
+ Table.States (303).Kernel := To_Vector ((0 => ((46, 1), 40, 1,
(32767, 0), 0)));
+ Table.States (303).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (46, 1), 23, 310)));
Table.States (304).Action_List.Set_Capacity (1);
- Add_Action (Table.States (304), 34, (45, 0), 311);
- Table.States (304).Kernel := To_Vector ((0 => ((45, 0), 6, 1,
(2147483647, 0), 0)));
- Table.States (304).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (45, 0), 34, 311)));
+ Add_Action (Table.States (304), 36, (47, 0), 311);
+ Table.States (304).Kernel := To_Vector ((0 => ((47, 0), 8, 1,
(32767, 0), 0)));
+ Table.States (304).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (47, 0), 36, 311)));
Table.States (305).Action_List.Set_Capacity (10);
- Add_Action (Table.States (305), 10, (57, 0), 130);
- Add_Action (Table.States (305), 11, (57, 1), 131);
- Add_Action (Table.States (305), 14, (41, 0), 132);
- Add_Action (Table.States (305), 19, (43, 0), 9);
- Add_Action (Table.States (305), 27, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (305), 31, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (305), 33, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (305), 34, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (305), 37, (58, 1), 133);
- Add_Action (Table.States (305), 38, (69, 0), 134);
+ Add_Action (Table.States (305), 12, (59, 0), 130);
+ Add_Action (Table.States (305), 13, (59, 1), 131);
+ Add_Action (Table.States (305), 16, (43, 0), 132);
+ Add_Action (Table.States (305), 21, (45, 0), 9);
+ Add_Action (Table.States (305), 29, Reduce, (60, 0), 0);
+ Add_Action (Table.States (305), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (305), 35, Reduce, (60, 0), 0);
+ Add_Action (Table.States (305), 36, Reduce, (60, 0), 0);
+ Add_Action (Table.States (305), 39, (60, 1), 133);
+ Add_Action (Table.States (305), 40, (71, 0), 134);
Table.States (305).Goto_List.Set_Capacity (9);
- Add_Goto (Table.States (305), 41, 135);
- Add_Goto (Table.States (305), 43, 136);
- Add_Goto (Table.States (305), 44, 137);
- Add_Goto (Table.States (305), 56, 312);
- Add_Goto (Table.States (305), 57, 139);
- Add_Goto (Table.States (305), 58, 140);
- Add_Goto (Table.States (305), 59, 141);
- Add_Goto (Table.States (305), 69, 142);
- Add_Goto (Table.States (305), 71, 143);
- Table.States (305).Kernel := To_Vector ((0 => ((42, 3), 24, 1,
(2147483647, 0), 0)));
- Table.States (305).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (56, 0), 0)));
+ Add_Goto (Table.States (305), 43, 135);
+ Add_Goto (Table.States (305), 45, 136);
+ Add_Goto (Table.States (305), 46, 137);
+ Add_Goto (Table.States (305), 58, 312);
+ Add_Goto (Table.States (305), 59, 139);
+ Add_Goto (Table.States (305), 60, 140);
+ Add_Goto (Table.States (305), 61, 141);
+ Add_Goto (Table.States (305), 71, 142);
+ Add_Goto (Table.States (305), 73, 143);
+ Table.States (305).Kernel := To_Vector ((0 => ((44, 3), 26, 1,
(32767, 0), 0)));
+ Table.States (305).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 0), 0)));
Table.States (306).Action_List.Set_Capacity (11);
- Add_Action (Table.States (306), 4, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (306), 10, (57, 0), 227);
- Add_Action (Table.States (306), 11, (57, 1), 228);
- Add_Action (Table.States (306), 14, (41, 0), 229);
- Add_Action (Table.States (306), 19, (43, 0), 9);
- Add_Action (Table.States (306), 27, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (306), 31, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (306), 33, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (306), 34, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (306), 37, (58, 1), 230);
- Add_Action (Table.States (306), 38, (69, 0), 231);
+ Add_Action (Table.States (306), 6, Reduce, (60, 0), 0);
+ Add_Action (Table.States (306), 12, (59, 0), 227);
+ Add_Action (Table.States (306), 13, (59, 1), 228);
+ Add_Action (Table.States (306), 16, (43, 0), 229);
+ Add_Action (Table.States (306), 21, (45, 0), 9);
+ Add_Action (Table.States (306), 29, Reduce, (60, 0), 0);
+ Add_Action (Table.States (306), 33, Reduce, (60, 0), 0);
+ Add_Action (Table.States (306), 35, Reduce, (60, 0), 0);
+ Add_Action (Table.States (306), 36, Reduce, (60, 0), 0);
+ Add_Action (Table.States (306), 39, (60, 1), 230);
+ Add_Action (Table.States (306), 40, (71, 0), 231);
Table.States (306).Goto_List.Set_Capacity (9);
- Add_Goto (Table.States (306), 41, 232);
- Add_Goto (Table.States (306), 43, 233);
- Add_Goto (Table.States (306), 44, 234);
- Add_Goto (Table.States (306), 56, 313);
- Add_Goto (Table.States (306), 57, 236);
- Add_Goto (Table.States (306), 58, 237);
- Add_Goto (Table.States (306), 59, 238);
- Add_Goto (Table.States (306), 69, 239);
- Add_Goto (Table.States (306), 71, 240);
- Table.States (306).Kernel := To_Vector ((((42, 1), 24, 1,
(2147483647, 0), 0), ((42, 2), 24, 3,
- (2147483647, 0), 0)));
- Table.States (306).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (56, 0), 0)));
+ Add_Goto (Table.States (306), 43, 232);
+ Add_Goto (Table.States (306), 45, 233);
+ Add_Goto (Table.States (306), 46, 234);
+ Add_Goto (Table.States (306), 58, 313);
+ Add_Goto (Table.States (306), 59, 236);
+ Add_Goto (Table.States (306), 60, 237);
+ Add_Goto (Table.States (306), 61, 238);
+ Add_Goto (Table.States (306), 71, 239);
+ Add_Goto (Table.States (306), 73, 240);
+ Table.States (306).Kernel := To_Vector ((((44, 1), 26, 1,
(32767, 0), 0), ((44, 2), 26, 3, (32767, 0),
+ 0)));
+ Table.States (306).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 0), 0)));
Table.States (307).Action_List.Set_Capacity (1);
- Add_Action (Table.States (307), 8, (62, 0), 314);
- Table.States (307).Kernel := To_Vector ((0 => ((62, 0), 53, 2,
(2147483647, 0), 0)));
- Table.States (307).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (62, 0), 8, 314)));
+ Add_Action (Table.States (307), 10, (64, 0), 314);
+ Table.States (307).Kernel := To_Vector ((0 => ((64, 0), 55, 2,
(32767, 0), 0)));
+ Table.States (307).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (64, 0), 10, 314)));
Table.States (308).Action_List.Set_Capacity (1);
- Add_Action (Table.States (308), 34, (61, 0), 315);
- Table.States (308).Kernel := To_Vector ((0 => ((61, 0), 58, 1,
(2147483647, 0), 0)));
- Table.States (308).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (61, 0), 34, 315)));
+ Add_Action (Table.States (308), 36, (63, 0), 315);
+ Table.States (308).Kernel := To_Vector ((0 => ((63, 0), 60, 1,
(32767, 0), 0)));
+ Table.States (308).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (63, 0), 36, 315)));
Table.States (309).Action_List.Set_Capacity (8);
- Add_Action (Table.States (309), (6, 8, 12, 16, 18, 23, 25, 37),
(67, 1), 6,
- simple_declarative_item_1'Access, null);
- Table.States (309).Kernel := To_Vector ((0 => ((67, 1), 34, 0,
(67, 1), 6)));
- Table.States (309).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (67, 1), 6)));
+ Add_Action (Table.States (309), (8, 10, 14, 18, 20, 25, 27, 39),
(69, 1), 6);
+ Table.States (309).Kernel := To_Vector ((0 => ((69, 1), 36, 0,
(69, 1), 6)));
+ Table.States (309).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (69, 1), 6)));
Table.States (310).Action_List.Set_Capacity (3);
- Add_Action (Table.States (310), (4, 27, 34), (44, 1), 6, null,
null);
- Table.States (310).Kernel := To_Vector ((0 => ((44, 1), 21, 0,
(44, 1), 6)));
- Table.States (310).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (44, 1), 6)));
+ Add_Action (Table.States (310), (6, 29, 36), (46, 1), 6);
+ Table.States (310).Kernel := To_Vector ((0 => ((46, 1), 23, 0,
(46, 1), 6)));
+ Table.States (310).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (46, 1), 6)));
Table.States (311).Action_List.Set_Capacity (8);
- Add_Action (Table.States (311), (6, 8, 12, 16, 18, 23, 25, 37),
(45, 0), 7, case_statement_0'Access,
- null);
- Table.States (311).Kernel := To_Vector ((0 => ((45, 0), 34, 0,
(45, 0), 7)));
- Table.States (311).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (45, 0), 7)));
+ Add_Action (Table.States (311), (8, 10, 14, 18, 20, 25, 27, 39),
(47, 0), 7);
+ Table.States (311).Kernel := To_Vector ((0 => ((47, 0), 36, 0,
(47, 0), 7)));
+ Table.States (311).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (47, 0), 7)));
Table.States (312).Action_List.Set_Capacity (2);
- Add_Action (Table.States (312), 27, (56, 1), 170);
- Add_Action (Table.States (312), 34, (42, 3), 316);
- Table.States (312).Kernel := To_Vector ((((42, 3), 56, 1,
(2147483647, 0), 0), ((56, 1), 56, 1,
- (2147483647, 0), 0)));
- Table.States (312).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (42, 3), 34, 316)));
- end Subr_3;
- procedure Subr_4
- is begin
+ Add_Action (Table.States (312), 29, (58, 1), 170);
+ Add_Action (Table.States (312), 36, (44, 3), 316);
+ Table.States (312).Kernel := To_Vector ((((44, 3), 58, 1,
(32767, 0), 0), ((58, 1), 58, 1, (32767, 0),
+ 0)));
+ Table.States (312).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 3), 36, 316)));
Table.States (313).Action_List.Set_Capacity (3);
- Add_Action (Table.States (313), 4, (42, 2), 317);
- Add_Action (Table.States (313), 27, (56, 1), 261);
- Add_Action (Table.States (313), 34, (42, 1), 318);
- Table.States (313).Kernel := To_Vector ((((42, 1), 56, 1,
(2147483647, 0), 0), ((42, 2), 56, 3,
- (2147483647, 0), 0), ((56, 1), 56, 1, (2147483647, 0), 0)));
- Table.States (313).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (42, 1), 34, 318)));
+ Add_Action (Table.States (313), 6, (44, 2), 317);
+ Add_Action (Table.States (313), 29, (58, 1), 261);
+ Add_Action (Table.States (313), 36, (44, 1), 318);
+ Table.States (313).Kernel := To_Vector ((((44, 1), 58, 1,
(32767, 0), 0), ((44, 2), 58, 3, (32767, 0),
+ 0), ((58, 1), 58, 1, (32767, 0), 0)));
+ Table.States (313).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 1), 36, 318)));
Table.States (314).Action_List.Set_Capacity (2);
- Add_Action (Table.States (314), 34, Reduce, (58, 0), 0, null,
null);
- Add_Action (Table.States (314), 37, (58, 1), 144);
+ Add_Action (Table.States (314), 36, Reduce, (60, 0), 0);
+ Add_Action (Table.States (314), 39, (60, 1), 144);
Table.States (314).Goto_List.Set_Capacity (1);
- Add_Goto (Table.States (314), 58, 319);
- Table.States (314).Kernel := To_Vector ((0 => ((62, 0), 8, 1,
(2147483647, 0), 0)));
- Table.States (314).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (58, 0), 0)));
+ Add_Goto (Table.States (314), 60, 319);
+ Table.States (314).Kernel := To_Vector ((0 => ((64, 0), 10, 1,
(32767, 0), 0)));
+ Table.States (314).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (60, 0), 0)));
Table.States (315).Action_List.Set_Capacity (8);
- Add_Action (Table.States (315), (6, 8, 12, 16, 18, 23, 25, 37),
(61, 0), 7, package_spec_0'Access,
- package_spec_0_check'Access);
- Table.States (315).Kernel := To_Vector ((0 => ((61, 0), 34, 0,
(61, 0), 7)));
- Table.States (315).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (61, 0), 7)));
+ Add_Action (Table.States (315), (8, 10, 14, 18, 20, 25, 27, 39),
(63, 0), 7);
+ Table.States (315).Kernel := To_Vector ((0 => ((63, 0), 36, 0,
(63, 0), 7)));
+ Table.States (315).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (63, 0), 7)));
Table.States (316).Action_List.Set_Capacity (8);
- Add_Action (Table.States (316), (6, 8, 12, 16, 18, 23, 25, 37),
(42, 3), 8,
- attribute_declaration_3'Access, null);
- Table.States (316).Kernel := To_Vector ((0 => ((42, 3), 34, 0,
(42, 3), 8)));
- Table.States (316).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (42, 3), 8)));
+ Add_Action (Table.States (316), (8, 10, 14, 18, 20, 25, 27, 39),
(44, 3), 8);
+ Table.States (316).Kernel := To_Vector ((0 => ((44, 3), 36, 0,
(44, 3), 8)));
+ Table.States (316).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (44, 3), 8)));
+ end Subr_6;
+ procedure Subr_7
+ is begin
Table.States (317).Action_List.Set_Capacity (1);
- Add_Action (Table.States (317), 36, (42, 2), 320);
- Table.States (317).Kernel := To_Vector ((0 => ((42, 2), 4, 2,
(2147483647, 0), 0)));
- Table.States (317).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (42, 2), 36, 320)));
+ Add_Action (Table.States (317), 38, (44, 2), 320);
+ Table.States (317).Kernel := To_Vector ((0 => ((44, 2), 6, 2,
(32767, 0), 0)));
+ Table.States (317).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 2), 38, 320)));
Table.States (318).Action_List.Set_Capacity (8);
- Add_Action (Table.States (318), (6, 8, 12, 16, 18, 23, 25, 37),
(42, 1), 8,
- attribute_declaration_1'Access, null);
- Table.States (318).Kernel := To_Vector ((0 => ((42, 1), 34, 0,
(42, 1), 8)));
- Table.States (318).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (42, 1), 8)));
+ Add_Action (Table.States (318), (8, 10, 14, 18, 20, 25, 27, 39),
(44, 1), 8);
+ Table.States (318).Kernel := To_Vector ((0 => ((44, 1), 36, 0,
(44, 1), 8)));
+ Table.States (318).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (44, 1), 8)));
Table.States (319).Action_List.Set_Capacity (1);
- Add_Action (Table.States (319), 34, (62, 0), 321);
- Table.States (319).Kernel := To_Vector ((0 => ((62, 0), 58, 1,
(2147483647, 0), 0)));
- Table.States (319).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (62, 0), 34, 321)));
+ Add_Action (Table.States (319), 36, (64, 0), 321);
+ Table.States (319).Kernel := To_Vector ((0 => ((64, 0), 60, 1,
(32767, 0), 0)));
+ Table.States (319).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (64, 0), 36, 321)));
Table.States (320).Action_List.Set_Capacity (1);
- Add_Action (Table.States (320), 34, (42, 2), 322);
- Table.States (320).Kernel := To_Vector ((0 => ((42, 2), 36, 1,
(2147483647, 0), 0)));
- Table.States (320).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (42, 2), 34, 322)));
+ Add_Action (Table.States (320), 36, (44, 2), 322);
+ Table.States (320).Kernel := To_Vector ((0 => ((44, 2), 38, 1,
(32767, 0), 0)));
+ Table.States (320).Minimal_Complete_Actions := To_Vector ((0 =>
(Shift, (44, 2), 36, 322)));
Table.States (321).Action_List.Set_Capacity (8);
- Add_Action (Table.States (321), (6, 8, 12, 16, 18, 23, 25, 37),
(62, 0), 9, package_extension_0'Access,
- package_extension_0_check'Access);
- Table.States (321).Kernel := To_Vector ((0 => ((62, 0), 34, 0,
(62, 0), 9)));
- Table.States (321).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (62, 0), 9)));
+ Add_Action (Table.States (321), (8, 10, 14, 18, 20, 25, 27, 39),
(64, 0), 9);
+ Table.States (321).Kernel := To_Vector ((0 => ((64, 0), 36, 0,
(64, 0), 9)));
+ Table.States (321).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (64, 0), 9)));
Table.States (322).Action_List.Set_Capacity (8);
- Add_Action (Table.States (322), (6, 8, 12, 16, 18, 23, 25, 37),
(42, 2), 10,
- attribute_declaration_2'Access, null);
- Table.States (322).Kernel := To_Vector ((0 => ((42, 2), 34, 0,
(42, 2), 10)));
- Table.States (322).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (42, 2), 10)));
- end Subr_4;
+ Add_Action (Table.States (322), (8, 10, 14, 18, 20, 25, 27, 39),
(44, 2), 10);
+ Table.States (322).Kernel := To_Vector ((0 => ((44, 2), 36, 0,
(44, 2), 10)));
+ Table.States (322).Minimal_Complete_Actions := To_Vector ((0 =>
(Reduce, (44, 2), 10)));
+ end Subr_7;
begin
Subr_1;
Subr_2;
Subr_3;
Subr_4;
+ Subr_5;
+ Subr_6;
+ Subr_7;
Table.Error_Action := new Parse_Action_Node'((Verb => Error, others
=> <>), null);
end;
- WisiToken.Parse.LR.Parser.New_Parser
- (Parser,
- Trace,
- Lexer.New_Lexer (Trace.Descriptor),
- Table,
- Language_Fixes,
- Language_Matching_Begin_Tokens,
- Language_String_ID_Set,
- User_Data,
- Max_Parallel => 15,
- Terminate_Same_State => True);
- end Create_Parser;
+ Table.Error_Recover_Enabled := True;
+ Table.McKenzie_Param := McKenzie_Param;
+ Table.Max_Parallel := 15;
+ return Table;
+ end Create_Parse_Table;
+
+ function Create_Lexer (Trace : in WisiToken.Trace_Access) return
WisiToken.Lexer.Handle
+ is begin
+ return Lexer.New_Lexer (Trace, Gpr_Process_Actions.Descriptor'Access);
+ end Create_Lexer;
+
+ function Create_Productions return
WisiToken.Syntax_Trees.Production_Info_Trees.Vector
+ is begin
+ return Result : WisiToken.Syntax_Trees.Production_Info_Trees.Vector do
+ Result.Set_First_Last (42, 75);
+ Result (43).RHSs.Set_First_Last (0, 0);
+ Result (43).RHSs (0).In_Parse_Action := null;
+ Result (43).RHSs (0).Post_Parse_Action := aggregate_g_0'Access;
+ Result (44).RHSs.Set_First_Last (0, 3);
+ Result (44).RHSs (0).In_Parse_Action := null;
+ Result (44).RHSs (0).Post_Parse_Action :=
attribute_declaration_0'Access;
+ Result (44).RHSs (1).In_Parse_Action := null;
+ Result (44).RHSs (1).Post_Parse_Action :=
attribute_declaration_1'Access;
+ Result (44).RHSs (2).In_Parse_Action := null;
+ Result (44).RHSs (2).Post_Parse_Action :=
attribute_declaration_2'Access;
+ Result (44).RHSs (3).In_Parse_Action := null;
+ Result (44).RHSs (3).Post_Parse_Action :=
attribute_declaration_3'Access;
+ Result (47).RHSs.Set_First_Last (0, 0);
+ Result (47).RHSs (0).In_Parse_Action := null;
+ Result (47).RHSs (0).Post_Parse_Action := case_statement_0'Access;
+ Result (48).RHSs.Set_First_Last (0, 0);
+ Result (48).RHSs (0).In_Parse_Action := null;
+ Result (48).RHSs (0).Post_Parse_Action := case_item_0'Access;
+ Result (50).RHSs.Set_First_Last (0, 0);
+ Result (50).RHSs (0).In_Parse_Action := null;
+ Result (50).RHSs (0).Post_Parse_Action := compilation_unit_0'Access;
+ Result (60).RHSs.Set_First_Last (0, 1);
+ Result (60).RHSs (0).In_Parse_Action := null;
+ Result (60).RHSs (0).Post_Parse_Action := null;
+ Result (60).RHSs (1).In_Parse_Action := identifier_opt_1_check'Access;
+ Result (60).RHSs (1).Post_Parse_Action := null;
+ Result (63).RHSs.Set_First_Last (0, 0);
+ Result (63).RHSs (0).In_Parse_Action := package_spec_0_check'Access;
+ Result (63).RHSs (0).Post_Parse_Action := package_spec_0'Access;
+ Result (64).RHSs.Set_First_Last (0, 0);
+ Result (64).RHSs (0).In_Parse_Action :=
package_extension_0_check'Access;
+ Result (64).RHSs (0).Post_Parse_Action := package_extension_0'Access;
+ Result (65).RHSs.Set_First_Last (0, 0);
+ Result (65).RHSs (0).In_Parse_Action := null;
+ Result (65).RHSs (0).Post_Parse_Action := package_renaming_0'Access;
+ Result (67).RHSs.Set_First_Last (0, 0);
+ Result (67).RHSs (0).In_Parse_Action :=
project_extension_0_check'Access;
+ Result (67).RHSs (0).Post_Parse_Action := project_extension_0'Access;
+ Result (69).RHSs.Set_First_Last (0, 4);
+ Result (69).RHSs (0).In_Parse_Action := null;
+ Result (69).RHSs (0).Post_Parse_Action :=
simple_declarative_item_0'Access;
+ Result (69).RHSs (1).In_Parse_Action := null;
+ Result (69).RHSs (1).Post_Parse_Action :=
simple_declarative_item_1'Access;
+ Result (69).RHSs (2).In_Parse_Action := null;
+ Result (69).RHSs (2).Post_Parse_Action := null;
+ Result (69).RHSs (3).In_Parse_Action := null;
+ Result (69).RHSs (3).Post_Parse_Action := null;
+ Result (69).RHSs (4).In_Parse_Action := null;
+ Result (69).RHSs (4).Post_Parse_Action :=
simple_declarative_item_4'Access;
+ Result (70).RHSs.Set_First_Last (0, 0);
+ Result (70).RHSs (0).In_Parse_Action :=
simple_project_declaration_0_check'Access;
+ Result (70).RHSs (0).Post_Parse_Action :=
simple_project_declaration_0'Access;
+ Result (74).RHSs.Set_First_Last (0, 0);
+ Result (74).RHSs (0).In_Parse_Action := null;
+ Result (74).RHSs (0).Post_Parse_Action :=
typed_string_declaration_0'Access;
+ end return;
+ end Create_Productions;
+
end Gpr_Process_Main;
diff --git a/gpr_process_main.ads b/gpr_process_main.ads
index 4632a89069..477df66e23 100644
--- a/gpr_process_main.ads
+++ b/gpr_process_main.ads
@@ -1,8 +1,8 @@
--- generated parser support file.
+-- generated parser support file. -*- buffer-read-only:t -*-
-- command line: wisitoken-bnf-generate.exe --generate LR1 Ada_Emacs re2c
PROCESS gpr.wy
--
--- Copyright (C) 2013 - 2020 Free Software Foundation, Inc.
+-- Copyright (C) 2013 - 2022 Free Software Foundation, Inc.
-- This program is free software; you can redistribute it and/or
-- modify it under the terms of the GNU General Public License as
@@ -18,15 +18,14 @@
-- along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>.
with WisiToken.Syntax_Trees;
-with WisiToken.Parse.LR.Parser;
+with WisiToken.Lexer;
+with WisiToken.Parse.LR;
package Gpr_Process_Main is
- procedure Create_Parser
- (Parser : out WisiToken.Parse.LR.Parser.Parser;
- Language_Fixes : in
WisiToken.Parse.LR.Parser.Language_Fixes_Access;
- Language_Matching_Begin_Tokens : in
WisiToken.Parse.LR.Parser.Language_Matching_Begin_Tokens_Access;
- Language_String_ID_Set : in
WisiToken.Parse.LR.Parser.Language_String_ID_Set_Access;
- Trace : not null access WisiToken.Trace'Class;
- User_Data : in
WisiToken.Syntax_Trees.User_Data_Access);
+ function Create_Parse_Table
+ return WisiToken.Parse.LR.Parse_Table_Ptr;
+ function Create_Productions return
WisiToken.Syntax_Trees.Production_Info_Trees.Vector;
+
+ function Create_Lexer (Trace : in WisiToken.Trace_Access) return
WisiToken.Lexer.Handle;
end Gpr_Process_Main;
diff --git a/gpr_query.adb b/gpr_query.adb
index d56d2e4b87..589055c04a 100644
--- a/gpr_query.adb
+++ b/gpr_query.adb
@@ -3,7 +3,7 @@
-- Support Emacs Ada mode and gpr-query minor mode queries about
-- GNAT projects and cross reference data
--
--- Copyright (C) 2014 - 2020 Free Software Foundation All Rights Reserved.
+-- Copyright (C) 2014 - 2022 Free Software Foundation All Rights Reserved.
--
-- This program is free software; you can redistribute it and/or
-- modify it under terms of the GNU General Public License as
@@ -36,6 +36,7 @@ with GNAT.Traceback.Symbolic;
with GNATCOLL.Arg_Lists;
with GNATCOLL.Paragraph_Filling;
with GNATCOLL.Projects;
+with GNATCOLL.SQL.Exec;
with GNATCOLL.SQL.Sqlite;
with GNATCOLL.Traces;
with GNATCOLL.Utils;
@@ -51,8 +52,9 @@ procedure Gpr_Query is
-- changes; must match gpr-query.el gpr-query-protocol-version
Me : constant GNATCOLL.Traces.Trace_Handle := GNATCOLL.Traces.Create
("gpr_query");
+ -- See gnatcoll-xref.adb for xref traces.
- Db_Error : exception;
+ DB_Error : exception;
Invalid_Command : exception;
function "+" (Item : in Ada.Strings.Unbounded.Unbounded_String) return
String
@@ -1063,6 +1065,31 @@ procedure Gpr_Query is
end loop;
end Put;
+ ----------
+ -- SQL error reporting
+ type SQL_Error_Reporter is new GNATCOLL.SQL.Exec.Error_Reporter with null
record;
+
+ overriding procedure On_Error
+ (Self : in out SQL_Error_Reporter;
+ Connection : access GNATCOLL.SQL.Exec.Database_Connection_Record'Class;
+ Message : in String)
+ is
+ pragma Unreferenced (Self, Connection);
+ begin
+ Ada.Text_IO.Put_Line ("gpr_query: sql error on create database: " &
Message);
+ end On_Error;
+
+ -- For some reason, gnat community 2020 doesn't like this:
+ -- overriding procedure On_Warning
+ -- (Self : in out SQL_Error_Reporter;
+ -- Connection : access
GNATCOLL.SQL.Exec.Database_Connection_Record'Class;
+ -- Message : in String)
+ -- is begin
+ -- Ada.Text_IO.Put_Line ("gpr_query: sql warning on create database: "
& Message);
+ -- end On_Warning;
+
+ Error_Reporter : aliased SQL_Error_Reporter;
+
begin
Ada.Text_IO.Put_Line ("version: " & Version);
@@ -1090,7 +1117,7 @@ begin
(Cmdline,
Output => DB_Name'Access,
Long_Switch => "--db=",
- Help => "Specifies the name of the database (or ':memory:')");
+ Help => "Specifies the name of the database file (or
':memory:')");
Define_Switch
(Cmdline,
Output => Force_Refresh'Access,
@@ -1126,6 +1153,10 @@ begin
"Specify a traces configuration file, set projects lib verbose.
File should contain ""gpr_query=yes""");
Getopt (Cmdline, Callback => null);
+ exception
+ when Exit_From_Command_Line =>
+ -- from "--help"
+ return;
end;
if Project_File_Name.all = "" then
@@ -1247,6 +1278,36 @@ begin
end;
end if;
+ declare
+ -- Error if DB_Name does not exist but is in a read-only directory.
+ -- The Errors parameter to Sqlite.Setup does not help here; it
+ -- reports no error. Ada.Directories does not support a "writeable"
+ -- query.
+ use Ada.Directories;
+ begin
+ if DB_Name.all = ":memory:" then
+ null;
+
+ elsif Exists (DB_Name.all) then
+ -- If this is read-only, we assume it is up to date and the user is
+ -- just browsing.
+ null;
+
+ else
+ declare
+ use GNATCOLL.VFS;
+ Dir_Name : constant String := Containing_Directory
(DB_Name.all);
+ Dir_File : constant Virtual_File := Create (Filesystem_String
(Dir_Name));
+ begin
+ if Is_Writable (Dir_File) then
+ null;
+ else
+ raise DB_Error with "database file '" & DB_Name.all & "' does
not exist, and directory is not writeable";
+ end if;
+ end;
+ end if;
+ end;
+
declare
use type GNAT.Strings.String_Access;
Error : GNAT.Strings.String_Access;
@@ -1254,14 +1315,16 @@ begin
GNATCOLL.Traces.Trace (Me, "using database " & DB_Name.all);
Setup_DB
- (Self => Xref,
- Tree => Tree'Unchecked_Access,
- DB => GNATCOLL.SQL.Sqlite.Setup (Database => DB_Name.all),
- Error => Error);
+ (Self => Xref,
+ Tree => Tree'Unchecked_Access,
+ DB => GNATCOLL.SQL.Sqlite.Setup
+ (Database => DB_Name.all,
+ Errors => Error_Reporter'Unchecked_Access),
+ Error => Error);
if Error /= null then
-- old db schema
- raise Db_Error with Error.all;
+ raise DB_Error with Error.all;
end if;
end;
@@ -1298,7 +1361,7 @@ when Ada.IO_Exceptions.End_Error =>
when E : GNATCOLL.Projects.Invalid_Project =>
Ada.Text_IO.Put_Line (Ada.Exceptions.Exception_Message (E));
Ada.Command_Line.Set_Exit_Status (Ada.Command_Line.Failure);
-when E : Db_Error =>
+when E : DB_Error =>
Ada.Text_IO.Put_Line (Ada.Exceptions.Exception_Message (E));
Ada.Command_Line.Set_Exit_Status (Ada.Command_Line.Failure);
when E : Invalid_Command =>
diff --git a/gpr_re2c.c b/gpr_re2c.c
index dcc2ac3af1..e875a72020 100644
--- a/gpr_re2c.c
+++ b/gpr_re2c.c
@@ -1,10 +1,10 @@
-/* Generated by re2c 1.3 */
-#line 1 "../gpr.re2c"
-// generated parser support file. -*- mode: C -*-
+/* Generated by re2c 2.0.2 */
+#line 1 "gpr.re2c"
+// generated parser support file. -*- buffer-read-only:t mode: C -*-
// command line: wisitoken-bnf-generate.exe --generate LR1 Ada_Emacs re2c
PROCESS gpr.wy
//
-// Copyright (C) 2013 - 2020 Free Software Foundation, Inc.
+// Copyright (C) 2013 - 2022 Free Software Foundation, Inc.
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
@@ -57,9 +57,9 @@ wisi_lexer* gpr_new_lexer
result->byte_token_start = input;
result->char_pos = 1; /* match WisiToken.Buffer_Region */
result->char_token_start = 1;
- result->line = (*result->cursor == 0x0A) ? 2 : 1;
+ result->line = 1;
result->line_token_start = result->line;
- result->verbosity = verbosity;
+ result->verbosity = 0;
return result;
}
@@ -75,7 +75,23 @@ gpr_reset_lexer(wisi_lexer* lexer)
{
lexer->cursor = lexer->buffer;
lexer->char_pos = 1;
- lexer->line = (*lexer->cursor == 0x0A) ? 2 : 1;
+ lexer->line = 1;
+}
+
+void
+gpr_set_verbosity
+ (wisi_lexer* lexer, int verbosity)
+{
+ lexer->verbosity = verbosity;
+}
+
+void
+gpr_set_position
+ (wisi_lexer* lexer, size_t byte_position, size_t char_position, int line)
+{
+ lexer->cursor = lexer->buffer + byte_position - 1;
+ lexer->char_pos = char_position;
+ lexer->line = line;
}
static void debug(wisi_lexer* lexer, int state, unsigned char ch)
@@ -95,20 +111,22 @@ static void debug(wisi_lexer* lexer, int state, unsigned
char ch)
static void skip(wisi_lexer* lexer)
{
- if (lexer->cursor <= lexer->buffer_last)
- ++lexer->cursor;
if (lexer->cursor <= lexer->buffer_last)
{
- /* UFT-8 encoding: https://en.wikipedia.org/wiki/UTF-8#Description */
- if (*lexer->cursor == 0x0A && lexer->cursor > lexer->buffer &&
*(lexer->cursor - 1) == 0x0D)
- {/* second byte of DOS line ending */
- }
- else if ((*lexer->cursor & 0x80) == 0x80 && (*lexer->cursor & 0xC0) !=
0xC0)
- {/* byte 2, 3 or 4 of multi-byte UTF-8 char */
- }
- else
- ++lexer->char_pos;
- if (*lexer->cursor == 0x0A) ++lexer->line;
+ ++lexer->cursor;
+ if (lexer->cursor <= lexer->buffer_last)
+ {
+ /* UFT-8 encoding: https://en.wikipedia.org/wiki/UTF-8#Description */
+ if (*lexer->cursor == 0x0A && lexer->cursor > lexer->buffer &&
*(lexer->cursor - 1) == 0x0D)
+ {/* second byte of DOS line ending */
+ }
+ else if ((*lexer->cursor & 0x80) == 0x80 && (*lexer->cursor & 0xC0)
!= 0xC0)
+ {/* byte 2, 3 or 4 of multi-byte UTF-8 char */
+ }
+ else
+ lexer->char_pos++;
+ } else
+ lexer->char_pos++;
}
}
#define YYSKIP() skip(lexer)
@@ -124,37 +142,36 @@ int gpr_next_token
size_t* byte_length,
size_t* char_position,
size_t* char_length,
- int* line_start)
+ int* line_start,
+ int* line_length)
{
int status = NO_ERROR;
*id = -1;
if (lexer->cursor > lexer->buffer_last)
{
- *id = 39;
- *byte_position = lexer->buffer_last - lexer->buffer + 1;
+ *id = 41;
+ *byte_position = lexer->buffer_last - lexer->buffer + 2;
*byte_length = 0;
- *char_position = lexer->char_token_start;
+ *char_position = lexer->char_pos;
*char_length = 0;
*line_start = lexer->line;
+ *line_length = 0;
return status;
}
lexer->byte_token_start = lexer->cursor;
lexer->char_token_start = lexer->char_pos;
- if (*lexer->cursor == 0x0A)
- lexer->line_token_start = lexer->line-1;
- else
- lexer->line_token_start = lexer->line;
+ lexer->line_token_start = lexer->line;
while (*id == -1 && status == 0)
{
-#line 153 "../gpr_re2c.c"
+#line 170 "gpr_re2c.c"
{
YYCTYPE yych;
unsigned int yyaccept = 0;
YYDEBUG(0, *YYCURSOR);
- yych = YYPEEK ();
+ yych = YYPEEK();
switch (yych) {
case 0x04: goto yy4;
case '\t':
@@ -162,13 +179,14 @@ int gpr_next_token
case '\n': goto yy8;
case '\r': goto yy10;
case '"': goto yy11;
- case '&': goto yy12;
- case '\'': goto yy14;
- case '(': goto yy16;
- case ')': goto yy18;
- case ',': goto yy20;
- case '-': goto yy22;
- case '.': goto yy23;
+ case '#': goto yy12;
+ case '&': goto yy13;
+ case '\'': goto yy15;
+ case '(': goto yy17;
+ case ')': goto yy19;
+ case ',': goto yy21;
+ case '-': goto yy23;
+ case '.': goto yy24;
case '0':
case '1':
case '2':
@@ -178,12 +196,12 @@ int gpr_next_token
case '6':
case '7':
case '8':
- case '9': goto yy25;
- case ':': goto yy28;
- case ';': goto yy30;
- case '=': goto yy32;
+ case '9': goto yy26;
+ case ':': goto yy29;
+ case ';': goto yy31;
+ case '=': goto yy33;
case 'A':
- case 'a': goto yy33;
+ case 'a': goto yy34;
case 'B':
case 'D':
case 'G':
@@ -207,34 +225,35 @@ int gpr_next_token
case 'v':
case 'x':
case 'y':
- case 'z': goto yy35;
+ case 'z': goto yy36;
case 'C':
- case 'c': goto yy37;
+ case 'c': goto yy38;
case 'E':
- case 'e': goto yy38;
+ case 'e': goto yy39;
case 'F':
- case 'f': goto yy39;
+ case 'f': goto yy40;
case 'I':
- case 'i': goto yy40;
+ case 'i': goto yy41;
case 'L':
- case 'l': goto yy41;
+ case 'l': goto yy42;
case 'N':
- case 'n': goto yy42;
+ case 'n': goto yy43;
case 'O':
- case 'o': goto yy43;
+ case 'o': goto yy44;
case 'P':
- case 'p': goto yy44;
+ case 'p': goto yy45;
case 'R':
- case 'r': goto yy45;
+ case 'r': goto yy46;
case 'S':
- case 's': goto yy46;
+ case 's': goto yy47;
case 'T':
- case 't': goto yy47;
+ case 't': goto yy48;
case 'U':
- case 'u': goto yy48;
+ case 'u': goto yy49;
case 'W':
- case 'w': goto yy49;
- case '|': goto yy50;
+ case 'w': goto yy50;
+ case '{': goto yy51;
+ case '|': goto yy52;
case 0xC2:
case 0xC3:
case 0xC4:
@@ -264,8 +283,8 @@ int gpr_next_token
case 0xDC:
case 0xDD:
case 0xDE:
- case 0xDF: goto yy52;
- case 0xE0: goto yy53;
+ case 0xDF: goto yy54;
+ case 0xE0: goto yy55;
case 0xE1:
case 0xE2:
case 0xE3:
@@ -280,63 +299,60 @@ int gpr_next_token
case 0xEC:
case 0xED:
case 0xEE:
- case 0xEF: goto yy54;
- case 0xF0: goto yy55;
+ case 0xEF: goto yy56;
+ case 0xF0: goto yy57;
case 0xF1:
case 0xF2:
- case 0xF3: goto yy56;
- case 0xF4: goto yy57;
+ case 0xF3: goto yy58;
+ case 0xF4: goto yy59;
default: goto yy2;
}
yy2:
- YYDEBUG(2, YYPEEK ());
- YYSKIP ();
+ YYDEBUG(2, YYPEEK());
+ YYSKIP();
yy3:
- YYDEBUG(3, YYPEEK ());
-#line 242 "../gpr.re2c"
+ YYDEBUG(3, YYPEEK());
+#line 260 "gpr.re2c"
{status = ERROR_unrecognized_character; continue;}
-#line 299 "../gpr_re2c.c"
+#line 318 "gpr_re2c.c"
yy4:
- YYDEBUG(4, YYPEEK ());
- YYSKIP ();
- YYDEBUG(5, YYPEEK ());
-#line 240 "../gpr.re2c"
- {*id = 39; continue;}
-#line 306 "../gpr_re2c.c"
+ YYDEBUG(4, YYPEEK());
+ YYSKIP();
+ YYDEBUG(5, YYPEEK());
+#line 258 "gpr.re2c"
+ {*id = 41; continue;}
+#line 325 "gpr_re2c.c"
yy6:
- YYDEBUG(6, YYPEEK ());
- YYSKIP ();
- YYDEBUG(7, YYPEEK ());
-#line 195 "../gpr.re2c"
+ YYDEBUG(6, YYPEEK());
+ YYSKIP();
+ YYDEBUG(7, YYPEEK());
+#line 214 "gpr.re2c"
{ lexer->byte_token_start = lexer->cursor;
lexer->char_token_start = lexer->char_pos;
- if (*lexer->cursor == 0x0A)
- lexer->line_token_start = lexer->line-1;
- else
- lexer->line_token_start = lexer->line;
+ lexer->line_token_start = lexer->line;
continue; }
-#line 319 "../gpr_re2c.c"
+#line 335 "gpr_re2c.c"
yy8:
- YYDEBUG(8, YYPEEK ());
- YYSKIP ();
- YYDEBUG(9, YYPEEK ());
-#line 202 "../gpr.re2c"
- {*id = 1; continue;}
-#line 326 "../gpr_re2c.c"
+ YYDEBUG(8, YYPEEK());
+ YYSKIP();
+ YYDEBUG(9, YYPEEK());
+#line 218 "gpr.re2c"
+ {*id = 1; lexer->line++; continue;}
+#line 342 "gpr_re2c.c"
yy10:
- YYDEBUG(10, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+ YYDEBUG(10, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case '\n': goto yy8;
default: goto yy3;
}
yy11:
- YYDEBUG(11, YYPEEK ());
+ YYDEBUG(11, YYPEEK());
yyaccept = 0;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case ' ':
case '!':
@@ -484,64 +500,77 @@ yy11:
case 0xF1:
case 0xF2:
case 0xF3:
- case 0xF4: goto yy59;
+ case 0xF4: goto yy61;
default: goto yy3;
}
yy12:
- YYDEBUG(12, YYPEEK ());
- YYSKIP ();
- YYDEBUG(13, YYPEEK ());
-#line 228 "../gpr.re2c"
- {*id = 27; continue;}
-#line 497 "../gpr_re2c.c"
-yy14:
- YYDEBUG(14, YYPEEK ());
- YYSKIP ();
- YYDEBUG(15, YYPEEK ());
-#line 234 "../gpr.re2c"
- {*id = 33; continue;}
-#line 504 "../gpr_re2c.c"
-yy16:
- YYDEBUG(16, YYPEEK ());
- YYSKIP ();
- YYDEBUG(17, YYPEEK ());
-#line 215 "../gpr.re2c"
- {*id = 14; continue;}
-#line 511 "../gpr_re2c.c"
-yy18:
- YYDEBUG(18, YYPEEK ());
- YYSKIP ();
- YYDEBUG(19, YYPEEK ());
-#line 222 "../gpr.re2c"
- {*id = 21; continue;}
-#line 518 "../gpr_re2c.c"
-yy20:
- YYDEBUG(20, YYPEEK ());
- YYSKIP ();
- YYDEBUG(21, YYPEEK ());
-#line 231 "../gpr.re2c"
- {*id = 30; continue;}
-#line 525 "../gpr_re2c.c"
-yy22:
- YYDEBUG(22, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
- switch (yych) {
- case '-': goto yy69;
+ YYDEBUG(12, YYPEEK());
+ yyaccept = 0;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'e': goto yy71;
+ case 'i': goto yy72;
default: goto yy3;
}
+yy13:
+ YYDEBUG(13, YYPEEK());
+ YYSKIP();
+ YYDEBUG(14, YYPEEK());
+#line 246 "gpr.re2c"
+ {*id = 29; continue;}
+#line 524 "gpr_re2c.c"
+yy15:
+ YYDEBUG(15, YYPEEK());
+ YYSKIP();
+ YYDEBUG(16, YYPEEK());
+#line 252 "gpr.re2c"
+ {*id = 35; continue;}
+#line 531 "gpr_re2c.c"
+yy17:
+ YYDEBUG(17, YYPEEK());
+ YYSKIP();
+ YYDEBUG(18, YYPEEK());
+#line 233 "gpr.re2c"
+ {*id = 16; continue;}
+#line 538 "gpr_re2c.c"
+yy19:
+ YYDEBUG(19, YYPEEK());
+ YYSKIP();
+ YYDEBUG(20, YYPEEK());
+#line 240 "gpr.re2c"
+ {*id = 23; continue;}
+#line 545 "gpr_re2c.c"
+yy21:
+ YYDEBUG(21, YYPEEK());
+ YYSKIP();
+ YYDEBUG(22, YYPEEK());
+#line 249 "gpr.re2c"
+ {*id = 32; continue;}
+#line 552 "gpr_re2c.c"
yy23:
- YYDEBUG(23, YYPEEK ());
- YYSKIP ();
- YYDEBUG(24, YYPEEK ());
-#line 232 "../gpr.re2c"
- {*id = 31; continue;}
-#line 540 "../gpr_re2c.c"
-yy25:
- YYDEBUG(25, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
- YYDEBUG(26, YYPEEK ());
+ YYDEBUG(23, YYPEEK());
+ yyaccept = 0;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case '-': goto yy73;
+ default: goto yy3;
+ }
+yy24:
+ YYDEBUG(24, YYPEEK());
+ YYSKIP();
+ YYDEBUG(25, YYPEEK());
+#line 250 "gpr.re2c"
+ {*id = 33; continue;}
+#line 569 "gpr_re2c.c"
+yy26:
+ YYDEBUG(26, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ YYDEBUG(27, YYPEEK());
switch (yych) {
case '0':
case '1':
@@ -552,70 +581,70 @@ yy25:
case '6':
case '7':
case '8':
- case '9': goto yy25;
- default: goto yy27;
- }
-yy27:
- YYDEBUG(27, YYPEEK ());
-#line 237 "../gpr.re2c"
- {*id = 36; continue;}
-#line 563 "../gpr_re2c.c"
+ case '9': goto yy26;
+ default: goto yy28;
+ }
yy28:
- YYDEBUG(28, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+ YYDEBUG(28, YYPEEK());
+#line 255 "gpr.re2c"
+ {*id = 38; continue;}
+#line 592 "gpr_re2c.c"
+yy29:
+ YYDEBUG(29, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case '=': goto yy72;
- default: goto yy29;
+ case '=': goto yy75;
+ default: goto yy30;
}
-yy29:
- YYDEBUG(29, YYPEEK ());
-#line 229 "../gpr.re2c"
- {*id = 28; continue;}
-#line 576 "../gpr_re2c.c"
yy30:
- YYDEBUG(30, YYPEEK ());
- YYSKIP ();
- YYDEBUG(31, YYPEEK ());
-#line 235 "../gpr.re2c"
- {*id = 34; continue;}
-#line 583 "../gpr_re2c.c"
-yy32:
- YYDEBUG(32, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
- switch (yych) {
- case '>': goto yy74;
+ YYDEBUG(30, YYPEEK());
+#line 247 "gpr.re2c"
+ {*id = 30; continue;}
+#line 605 "gpr_re2c.c"
+yy31:
+ YYDEBUG(31, YYPEEK());
+ YYSKIP();
+ YYDEBUG(32, YYPEEK());
+#line 253 "gpr.re2c"
+ {*id = 36; continue;}
+#line 612 "gpr_re2c.c"
+yy33:
+ YYDEBUG(33, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case '>': goto yy77;
default: goto yy3;
}
-yy33:
- YYDEBUG(33, YYPEEK ());
+yy34:
+ YYDEBUG(34, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'B':
- case 'b': goto yy76;
+ case 'b': goto yy79;
case 'G':
- case 'g': goto yy77;
+ case 'g': goto yy80;
case 'T':
- case 't': goto yy78;
- default: goto yy36;
+ case 't': goto yy81;
+ default: goto yy37;
}
-yy34:
- YYDEBUG(34, YYPEEK ());
-#line 238 "../gpr.re2c"
- {*id = 37; continue;}
-#line 611 "../gpr_re2c.c"
yy35:
- YYDEBUG(35, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYDEBUG(35, YYPEEK());
+#line 256 "gpr.re2c"
+ {*id = 39; continue;}
+#line 640 "gpr_re2c.c"
yy36:
- YYDEBUG(36, YYPEEK ());
+ YYDEBUG(36, YYPEEK());
+ yyaccept = 1;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+yy37:
+ YYDEBUG(37, YYPEEK());
switch (yych) {
case '0':
case '1':
@@ -679,7 +708,7 @@ yy36:
case 'w':
case 'x':
case 'y':
- case 'z': goto yy35;
+ case 'z': goto yy36;
case 0xC2:
case 0xC3:
case 0xC4:
@@ -709,8 +738,8 @@ yy36:
case 0xDC:
case 0xDD:
case 0xDE:
- case 0xDF: goto yy80;
- case 0xE0: goto yy81;
+ case 0xDF: goto yy83;
+ case 0xE0: goto yy84;
case 0xE1:
case 0xE2:
case 0xE3:
@@ -725,176 +754,362 @@ yy36:
case 0xEC:
case 0xED:
case 0xEE:
- case 0xEF: goto yy82;
- case 0xF0: goto yy83;
+ case 0xEF: goto yy85;
+ case 0xF0: goto yy86;
case 0xF1:
case 0xF2:
- case 0xF3: goto yy84;
- case 0xF4: goto yy85;
- default: goto yy34;
+ case 0xF3: goto yy87;
+ case 0xF4: goto yy88;
+ default: goto yy35;
}
-yy37:
- YYDEBUG(37, YYPEEK ());
+yy38:
+ YYDEBUG(38, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'A':
- case 'a': goto yy86;
+ case 'a': goto yy89;
case 'O':
- case 'o': goto yy87;
- default: goto yy36;
+ case 'o': goto yy90;
+ default: goto yy37;
}
-yy38:
- YYDEBUG(38, YYPEEK ());
+yy39:
+ YYDEBUG(39, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'N':
- case 'n': goto yy88;
+ case 'n': goto yy91;
case 'X':
- case 'x': goto yy89;
- default: goto yy36;
+ case 'x': goto yy92;
+ default: goto yy37;
}
-yy39:
- YYDEBUG(39, YYPEEK ());
+yy40:
+ YYDEBUG(40, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'O':
- case 'o': goto yy90;
- default: goto yy36;
+ case 'o': goto yy93;
+ default: goto yy37;
}
-yy40:
- YYDEBUG(40, YYPEEK ());
+yy41:
+ YYDEBUG(41, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'S':
- case 's': goto yy91;
- default: goto yy36;
+ case 's': goto yy94;
+ default: goto yy37;
}
-yy41:
- YYDEBUG(41, YYPEEK ());
+yy42:
+ YYDEBUG(42, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'I':
- case 'i': goto yy93;
- default: goto yy36;
+ case 'i': goto yy96;
+ default: goto yy37;
}
-yy42:
- YYDEBUG(42, YYPEEK ());
+yy43:
+ YYDEBUG(43, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'U':
- case 'u': goto yy94;
- default: goto yy36;
+ case 'u': goto yy97;
+ default: goto yy37;
}
-yy43:
- YYDEBUG(43, YYPEEK ());
+yy44:
+ YYDEBUG(44, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'T':
- case 't': goto yy95;
- default: goto yy36;
+ case 't': goto yy98;
+ default: goto yy37;
}
-yy44:
- YYDEBUG(44, YYPEEK ());
+yy45:
+ YYDEBUG(45, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'A':
- case 'a': goto yy96;
+ case 'a': goto yy99;
case 'R':
- case 'r': goto yy97;
- default: goto yy36;
+ case 'r': goto yy100;
+ default: goto yy37;
}
-yy45:
- YYDEBUG(45, YYPEEK ());
+yy46:
+ YYDEBUG(46, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy98;
- default: goto yy36;
+ case 'e': goto yy101;
+ default: goto yy37;
}
-yy46:
- YYDEBUG(46, YYPEEK ());
+yy47:
+ YYDEBUG(47, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'T':
- case 't': goto yy99;
- default: goto yy36;
+ case 't': goto yy102;
+ default: goto yy37;
}
-yy47:
- YYDEBUG(47, YYPEEK ());
+yy48:
+ YYDEBUG(48, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'Y':
- case 'y': goto yy100;
- default: goto yy36;
+ case 'y': goto yy103;
+ default: goto yy37;
}
-yy48:
- YYDEBUG(48, YYPEEK ());
+yy49:
+ YYDEBUG(49, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'S':
- case 's': goto yy101;
- default: goto yy36;
+ case 's': goto yy104;
+ default: goto yy37;
}
-yy49:
- YYDEBUG(49, YYPEEK ());
+yy50:
+ YYDEBUG(50, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'H':
- case 'h': goto yy102;
+ case 'h': goto yy105;
case 'I':
- case 'i': goto yy103;
- default: goto yy36;
+ case 'i': goto yy106;
+ default: goto yy37;
+ }
+yy51:
+ YYDEBUG(51, YYPEEK());
+ yyaccept = 0;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x00:
+ case 0x01:
+ case 0x02:
+ case 0x03:
+ case 0x05:
+ case 0x06:
+ case 0x07:
+ case 0x08:
+ case '\t':
+ case '\v':
+ case '\f':
+ case '\r':
+ case 0x0E:
+ case 0x0F:
+ case 0x10:
+ case 0x11:
+ case 0x12:
+ case 0x13:
+ case 0x14:
+ case 0x15:
+ case 0x16:
+ case 0x17:
+ case 0x18:
+ case 0x19:
+ case 0x1A:
+ case 0x1B:
+ case 0x1C:
+ case 0x1D:
+ case 0x1E:
+ case 0x1F:
+ case ' ':
+ case '!':
+ case '"':
+ case '#':
+ case '$':
+ case '%':
+ case '&':
+ case '\'':
+ case '(':
+ case ')':
+ case '*':
+ case '+':
+ case ',':
+ case '-':
+ case '.':
+ case '/':
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
+ case ':':
+ case ';':
+ case '<':
+ case '=':
+ case '>':
+ case '?':
+ case '@':
+ case 'A':
+ case 'B':
+ case 'C':
+ case 'D':
+ case 'E':
+ case 'F':
+ case 'G':
+ case 'H':
+ case 'I':
+ case 'J':
+ case 'K':
+ case 'L':
+ case 'M':
+ case 'N':
+ case 'O':
+ case 'P':
+ case 'Q':
+ case 'R':
+ case 'S':
+ case 'T':
+ case 'U':
+ case 'V':
+ case 'W':
+ case 'X':
+ case 'Y':
+ case 'Z':
+ case '[':
+ case '\\':
+ case ']':
+ case '^':
+ case '_':
+ case '`':
+ case 'a':
+ case 'b':
+ case 'c':
+ case 'd':
+ case 'e':
+ case 'f':
+ case 'g':
+ case 'h':
+ case 'i':
+ case 'j':
+ case 'k':
+ case 'l':
+ case 'm':
+ case 'n':
+ case 'o':
+ case 'p':
+ case 'q':
+ case 'r':
+ case 's':
+ case 't':
+ case 'u':
+ case 'v':
+ case 'w':
+ case 'x':
+ case 'y':
+ case 'z':
+ case '{':
+ case '|':
+ case '}':
+ case '~':
+ case 0x7F:
+ case 0xC2:
+ case 0xC3:
+ case 0xC4:
+ case 0xC5:
+ case 0xC6:
+ case 0xC7:
+ case 0xC8:
+ case 0xC9:
+ case 0xCA:
+ case 0xCB:
+ case 0xCC:
+ case 0xCD:
+ case 0xCE:
+ case 0xCF:
+ case 0xD0:
+ case 0xD1:
+ case 0xD2:
+ case 0xD3:
+ case 0xD4:
+ case 0xD5:
+ case 0xD6:
+ case 0xD7:
+ case 0xD8:
+ case 0xD9:
+ case 0xDA:
+ case 0xDB:
+ case 0xDC:
+ case 0xDD:
+ case 0xDE:
+ case 0xDF:
+ case 0xE0:
+ case 0xE1:
+ case 0xE2:
+ case 0xE3:
+ case 0xE4:
+ case 0xE5:
+ case 0xE6:
+ case 0xE7:
+ case 0xE8:
+ case 0xE9:
+ case 0xEA:
+ case 0xEB:
+ case 0xEC:
+ case 0xED:
+ case 0xEE:
+ case 0xEF:
+ case 0xF0:
+ case 0xF1:
+ case 0xF2:
+ case 0xF3:
+ case 0xF4: goto yy108;
+ default: goto yy3;
}
-yy50:
- YYDEBUG(50, YYPEEK ());
- YYSKIP ();
- YYDEBUG(51, YYPEEK ());
-#line 236 "../gpr.re2c"
- {*id = 35; continue;}
-#line 894 "../gpr_re2c.c"
yy52:
- YYDEBUG(52, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+ YYDEBUG(52, YYPEEK());
+ YYSKIP();
+ YYDEBUG(53, YYPEEK());
+#line 254 "gpr.re2c"
+ {*id = 37; continue;}
+#line 1109 "gpr_re2c.c"
+yy54:
+ YYDEBUG(54, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -959,15 +1174,15 @@ yy52:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy35;
+ case 0xBF: goto yy36;
default: goto yy3;
}
-yy53:
- YYDEBUG(53, YYPEEK ());
+yy55:
+ YYDEBUG(55, YYPEEK());
yyaccept = 0;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 0xA0:
case 0xA1:
@@ -1000,15 +1215,15 @@ yy53:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy80;
+ case 0xBF: goto yy83;
default: goto yy3;
}
-yy54:
- YYDEBUG(54, YYPEEK ());
+yy56:
+ YYDEBUG(56, YYPEEK());
yyaccept = 0;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -1073,15 +1288,15 @@ yy54:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy80;
+ case 0xBF: goto yy83;
default: goto yy3;
}
-yy55:
- YYDEBUG(55, YYPEEK ());
+yy57:
+ YYDEBUG(57, YYPEEK());
yyaccept = 0;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 0x90:
case 0x91:
@@ -1130,15 +1345,15 @@ yy55:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy82;
+ case 0xBF: goto yy85;
default: goto yy3;
}
-yy56:
- YYDEBUG(56, YYPEEK ());
+yy58:
+ YYDEBUG(58, YYPEEK());
yyaccept = 0;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -1203,15 +1418,15 @@ yy56:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy82;
+ case 0xBF: goto yy85;
default: goto yy3;
}
-yy57:
- YYDEBUG(57, YYPEEK ());
+yy59:
+ YYDEBUG(59, YYPEEK());
yyaccept = 0;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -1228,15 +1443,15 @@ yy57:
case 0x8C:
case 0x8D:
case 0x8E:
- case 0x8F: goto yy82;
+ case 0x8F: goto yy85;
default: goto yy3;
}
-yy58:
- YYDEBUG(58, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
-yy59:
- YYDEBUG(59, YYPEEK ());
+yy60:
+ YYDEBUG(60, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+yy61:
+ YYDEBUG(61, YYPEEK());
switch (yych) {
case ' ':
case '!':
@@ -1332,8 +1547,8 @@ yy59:
case '|':
case '}':
case '~':
- case 0x7F: goto yy58;
- case '"': goto yy61;
+ case 0x7F: goto yy60;
+ case '"': goto yy63;
case 0xC2:
case 0xC3:
case 0xC4:
@@ -1363,8 +1578,8 @@ yy59:
case 0xDC:
case 0xDD:
case 0xDE:
- case 0xDF: goto yy63;
- case 0xE0: goto yy64;
+ case 0xDF: goto yy65;
+ case 0xE0: goto yy66;
case 0xE1:
case 0xE2:
case 0xE3:
@@ -1379,64 +1594,88 @@ yy59:
case 0xEC:
case 0xED:
case 0xEE:
- case 0xEF: goto yy65;
- case 0xF0: goto yy66;
+ case 0xEF: goto yy67;
+ case 0xF0: goto yy68;
case 0xF1:
case 0xF2:
- case 0xF3: goto yy67;
- case 0xF4: goto yy68;
- default: goto yy60;
+ case 0xF3: goto yy69;
+ case 0xF4: goto yy70;
+ default: goto yy62;
}
-yy60:
- YYDEBUG(60, YYPEEK ());
- YYRESTORE ();
+yy62:
+ YYDEBUG(62, YYPEEK());
+ YYRESTORE();
switch (yyaccept) {
- case 0: goto yy3;
- case 1: goto yy34;
- case 2: goto yy62;
- case 3: goto yy71;
- case 4: goto yy79;
- case 5: goto yy92;
- case 6: goto yy115;
- case 7: goto yy118;
- case 8: goto yy128;
- case 9: goto yy134;
- case 10: goto yy139;
- case 11: goto yy146;
- case 12: goto yy148;
- case 13: goto yy150;
- case 14: goto yy169;
- case 15: goto yy178;
- case 16: goto yy181;
- case 17: goto yy183;
- case 18: goto yy185;
- case 19: goto yy187;
- case 20: goto yy190;
- case 21: goto yy194;
- case 22: goto yy196;
- case 23: goto yy198;
- case 24: goto yy208;
- default: goto yy213;
+ case 0:
+ goto yy3;
+ case 1:
+ goto yy35;
+ case 2:
+ goto yy64;
+ case 3:
+ goto yy82;
+ case 4:
+ goto yy95;
+ case 5:
+ goto yy134;
+ case 6:
+ goto yy137;
+ case 7:
+ goto yy147;
+ case 8:
+ goto yy162;
+ case 9:
+ goto yy167;
+ case 10:
+ goto yy174;
+ case 11:
+ goto yy176;
+ case 12:
+ goto yy178;
+ case 13:
+ goto yy197;
+ case 14:
+ goto yy206;
+ case 15:
+ goto yy209;
+ case 16:
+ goto yy211;
+ case 17:
+ goto yy213;
+ case 18:
+ goto yy215;
+ case 19:
+ goto yy218;
+ case 20:
+ goto yy222;
+ case 21:
+ goto yy224;
+ case 22:
+ goto yy226;
+ case 23:
+ goto yy236;
+ default:
+ goto yy241;
}
-yy61:
- YYDEBUG(61, YYPEEK ());
+yy63:
+ YYDEBUG(63, YYPEEK());
yyaccept = 2;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
- case '"': goto yy58;
- default: goto yy62;
+ case '"': goto yy60;
+ default: goto yy64;
}
-yy62:
- YYDEBUG(62, YYPEEK ());
-#line 239 "../gpr.re2c"
- {*id = 38; continue;}
-#line 1436 "../gpr_re2c.c"
-yy63:
- YYDEBUG(63, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy64:
+ YYDEBUG(64, YYPEEK());
+#line 257 "gpr.re2c"
+ {*id = 40; continue;}
+#line 1675 "gpr_re2c.c"
+yy65:
+ YYDEBUG(65, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -1501,13 +1740,13 @@ yy63:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy58;
- default: goto yy60;
+ case 0xBF: goto yy60;
+ default: goto yy62;
}
-yy64:
- YYDEBUG(64, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy66:
+ YYDEBUG(66, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0xA0:
case 0xA1:
@@ -1540,13 +1779,13 @@ yy64:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy63;
- default: goto yy60;
+ case 0xBF: goto yy65;
+ default: goto yy62;
}
-yy65:
- YYDEBUG(65, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy67:
+ YYDEBUG(67, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -1611,13 +1850,13 @@ yy65:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy63;
- default: goto yy60;
+ case 0xBF: goto yy65;
+ default: goto yy62;
}
-yy66:
- YYDEBUG(66, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy68:
+ YYDEBUG(68, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x90:
case 0x91:
@@ -1666,13 +1905,13 @@ yy66:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy65;
- default: goto yy60;
+ case 0xBF: goto yy67;
+ default: goto yy62;
}
-yy67:
- YYDEBUG(67, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy69:
+ YYDEBUG(69, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -1737,13 +1976,13 @@ yy67:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy65;
- default: goto yy60;
+ case 0xBF: goto yy67;
+ default: goto yy62;
}
-yy68:
- YYDEBUG(68, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy70:
+ YYDEBUG(70, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -1760,16 +1999,31 @@ yy68:
case 0x8C:
case 0x8D:
case 0x8E:
- case 0x8F: goto yy65;
- default: goto yy60;
+ case 0x8F: goto yy67;
+ default: goto yy62;
}
-yy69:
- YYDEBUG(69, YYPEEK ());
- yyaccept = 3;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
- YYDEBUG(70, YYPEEK ());
+yy71:
+ YYDEBUG(71, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'l': goto yy117;
+ case 'n': goto yy118;
+ default: goto yy62;
+ }
+yy72:
+ YYDEBUG(72, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'f': goto yy119;
+ default: goto yy62;
+ }
+yy73:
+ YYDEBUG(73, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ YYDEBUG(74, YYPEEK());
switch (yych) {
case 0x00:
case 0x01:
@@ -1896,7 +2150,9 @@ yy69:
case '|':
case '}':
case '~':
- case 0x7F: goto yy69;
+ case 0x7F: goto yy73;
+ case 0x04:
+ case '\n': goto yy121;
case 0xC2:
case 0xC3:
case 0xC4:
@@ -1926,8 +2182,8 @@ yy69:
case 0xDC:
case 0xDD:
case 0xDE:
- case 0xDF: goto yy104;
- case 0xE0: goto yy105;
+ case 0xDF: goto yy123;
+ case 0xE0: goto yy124;
case 0xE1:
case 0xE2:
case 0xE3:
@@ -1942,61 +2198,56 @@ yy69:
case 0xEC:
case 0xED:
case 0xEE:
- case 0xEF: goto yy106;
- case 0xF0: goto yy107;
+ case 0xEF: goto yy125;
+ case 0xF0: goto yy126;
case 0xF1:
case 0xF2:
- case 0xF3: goto yy108;
- case 0xF4: goto yy109;
- default: goto yy71;
+ case 0xF3: goto yy127;
+ case 0xF4: goto yy128;
+ default: goto yy62;
}
-yy71:
- YYDEBUG(71, YYPEEK ());
-#line 203 "../gpr.re2c"
- {*id = 2; continue;}
-#line 1958 "../gpr_re2c.c"
-yy72:
- YYDEBUG(72, YYPEEK ());
- YYSKIP ();
- YYDEBUG(73, YYPEEK ());
-#line 230 "../gpr.re2c"
- {*id = 29; continue;}
-#line 1965 "../gpr_re2c.c"
-yy74:
- YYDEBUG(74, YYPEEK ());
- YYSKIP ();
- YYDEBUG(75, YYPEEK ());
-#line 233 "../gpr.re2c"
- {*id = 32; continue;}
-#line 1972 "../gpr_re2c.c"
-yy76:
- YYDEBUG(76, YYPEEK ());
+yy75:
+ YYDEBUG(75, YYPEEK());
+ YYSKIP();
+ YYDEBUG(76, YYPEEK());
+#line 248 "gpr.re2c"
+ {*id = 31; continue;}
+#line 2216 "gpr_re2c.c"
+yy77:
+ YYDEBUG(77, YYPEEK());
+ YYSKIP();
+ YYDEBUG(78, YYPEEK());
+#line 251 "gpr.re2c"
+ {*id = 34; continue;}
+#line 2223 "gpr_re2c.c"
+yy79:
+ YYDEBUG(79, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'S':
- case 's': goto yy110;
- default: goto yy36;
+ case 's': goto yy129;
+ default: goto yy37;
}
-yy77:
- YYDEBUG(77, YYPEEK ());
+yy80:
+ YYDEBUG(80, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'G':
- case 'g': goto yy111;
- default: goto yy36;
+ case 'g': goto yy130;
+ default: goto yy37;
}
-yy78:
- YYDEBUG(78, YYPEEK ());
- yyaccept = 4;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy81:
+ YYDEBUG(81, YYPEEK());
+ yyaccept = 3;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -2111,18 +2362,18 @@ yy78:
case 0xF1:
case 0xF2:
case 0xF3:
- case 0xF4: goto yy36;
- default: goto yy79;
+ case 0xF4: goto yy37;
+ default: goto yy82;
}
-yy79:
- YYDEBUG(79, YYPEEK ());
-#line 205 "../gpr.re2c"
- {*id = 4; continue;}
-#line 2122 "../gpr_re2c.c"
-yy80:
- YYDEBUG(80, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy82:
+ YYDEBUG(82, YYPEEK());
+#line 223 "gpr.re2c"
+ {*id = 6; continue;}
+#line 2373 "gpr_re2c.c"
+yy83:
+ YYDEBUG(83, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -2187,13 +2438,13 @@ yy80:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy35;
- default: goto yy60;
+ case 0xBF: goto yy36;
+ default: goto yy62;
}
-yy81:
- YYDEBUG(81, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy84:
+ YYDEBUG(84, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0xA0:
case 0xA1:
@@ -2226,13 +2477,13 @@ yy81:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy80;
- default: goto yy60;
+ case 0xBF: goto yy83;
+ default: goto yy62;
}
-yy82:
- YYDEBUG(82, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy85:
+ YYDEBUG(85, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -2297,13 +2548,13 @@ yy82:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy80;
- default: goto yy60;
+ case 0xBF: goto yy83;
+ default: goto yy62;
}
-yy83:
- YYDEBUG(83, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy86:
+ YYDEBUG(86, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x90:
case 0x91:
@@ -2352,13 +2603,13 @@ yy83:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy82;
- default: goto yy60;
+ case 0xBF: goto yy85;
+ default: goto yy62;
}
-yy84:
- YYDEBUG(84, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy87:
+ YYDEBUG(87, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -2423,13 +2674,13 @@ yy84:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy82;
- default: goto yy60;
+ case 0xBF: goto yy85;
+ default: goto yy62;
}
-yy85:
- YYDEBUG(85, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy88:
+ YYDEBUG(88, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -2446,70 +2697,70 @@ yy85:
case 0x8C:
case 0x8D:
case 0x8E:
- case 0x8F: goto yy82;
- default: goto yy60;
+ case 0x8F: goto yy85;
+ default: goto yy62;
}
-yy86:
- YYDEBUG(86, YYPEEK ());
+yy89:
+ YYDEBUG(89, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'S':
- case 's': goto yy112;
- default: goto yy36;
+ case 's': goto yy131;
+ default: goto yy37;
}
-yy87:
- YYDEBUG(87, YYPEEK ());
+yy90:
+ YYDEBUG(90, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'N':
- case 'n': goto yy113;
- default: goto yy36;
+ case 'n': goto yy132;
+ default: goto yy37;
}
-yy88:
- YYDEBUG(88, YYPEEK ());
+yy91:
+ YYDEBUG(91, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'D':
- case 'd': goto yy114;
- default: goto yy36;
+ case 'd': goto yy133;
+ default: goto yy37;
}
-yy89:
- YYDEBUG(89, YYPEEK ());
+yy92:
+ YYDEBUG(92, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'T':
- case 't': goto yy116;
- default: goto yy36;
+ case 't': goto yy135;
+ default: goto yy37;
}
-yy90:
- YYDEBUG(90, YYPEEK ());
+yy93:
+ YYDEBUG(93, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'R':
- case 'r': goto yy117;
- default: goto yy36;
+ case 'r': goto yy136;
+ default: goto yy37;
}
-yy91:
- YYDEBUG(91, YYPEEK ());
- yyaccept = 5;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy94:
+ YYDEBUG(94, YYPEEK());
+ yyaccept = 4;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -2624,296 +2875,919 @@ yy91:
case 0xF1:
case 0xF2:
case 0xF3:
- case 0xF4: goto yy36;
- default: goto yy92;
+ case 0xF4: goto yy37;
+ default: goto yy95;
}
-yy92:
- YYDEBUG(92, YYPEEK ());
-#line 214 "../gpr.re2c"
- {*id = 13; continue;}
-#line 2635 "../gpr_re2c.c"
-yy93:
- YYDEBUG(93, YYPEEK ());
+yy95:
+ YYDEBUG(95, YYPEEK());
+#line 232 "gpr.re2c"
+ {*id = 15; continue;}
+#line 2886 "gpr_re2c.c"
+yy96:
+ YYDEBUG(96, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'B':
- case 'b': goto yy119;
- default: goto yy36;
+ case 'b': goto yy138;
+ default: goto yy37;
}
-yy94:
- YYDEBUG(94, YYPEEK ());
+yy97:
+ YYDEBUG(97, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'L':
- case 'l': goto yy120;
- default: goto yy36;
+ case 'l': goto yy139;
+ default: goto yy37;
}
-yy95:
- YYDEBUG(95, YYPEEK ());
+yy98:
+ YYDEBUG(98, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'H':
- case 'h': goto yy121;
- default: goto yy36;
+ case 'h': goto yy140;
+ default: goto yy37;
}
-yy96:
- YYDEBUG(96, YYPEEK ());
+yy99:
+ YYDEBUG(99, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'C':
- case 'c': goto yy122;
- default: goto yy36;
+ case 'c': goto yy141;
+ default: goto yy37;
}
-yy97:
- YYDEBUG(97, YYPEEK ());
+yy100:
+ YYDEBUG(100, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'O':
- case 'o': goto yy123;
- default: goto yy36;
+ case 'o': goto yy142;
+ default: goto yy37;
}
-yy98:
- YYDEBUG(98, YYPEEK ());
+yy101:
+ YYDEBUG(101, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'N':
- case 'n': goto yy124;
- default: goto yy36;
+ case 'n': goto yy143;
+ default: goto yy37;
}
-yy99:
- YYDEBUG(99, YYPEEK ());
+yy102:
+ YYDEBUG(102, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'A':
- case 'a': goto yy125;
- default: goto yy36;
+ case 'a': goto yy144;
+ default: goto yy37;
}
-yy100:
- YYDEBUG(100, YYPEEK ());
+yy103:
+ YYDEBUG(103, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'P':
- case 'p': goto yy126;
- default: goto yy36;
+ case 'p': goto yy145;
+ default: goto yy37;
}
-yy101:
- YYDEBUG(101, YYPEEK ());
+yy104:
+ YYDEBUG(104, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy127;
- default: goto yy36;
+ case 'e': goto yy146;
+ default: goto yy37;
}
-yy102:
- YYDEBUG(102, YYPEEK ());
+yy105:
+ YYDEBUG(105, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy129;
- default: goto yy36;
+ case 'e': goto yy148;
+ default: goto yy37;
}
-yy103:
- YYDEBUG(103, YYPEEK ());
+yy106:
+ YYDEBUG(106, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'T':
- case 't': goto yy130;
- default: goto yy36;
- }
-yy104:
- YYDEBUG(104, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
- switch (yych) {
- case 0x80:
- case 0x81:
- case 0x82:
- case 0x83:
- case 0x84:
- case 0x85:
- case 0x86:
- case 0x87:
- case 0x88:
- case 0x89:
- case 0x8A:
- case 0x8B:
- case 0x8C:
- case 0x8D:
- case 0x8E:
- case 0x8F:
- case 0x90:
- case 0x91:
- case 0x92:
- case 0x93:
- case 0x94:
- case 0x95:
- case 0x96:
- case 0x97:
- case 0x98:
- case 0x99:
- case 0x9A:
- case 0x9B:
- case 0x9C:
- case 0x9D:
- case 0x9E:
- case 0x9F:
- case 0xA0:
- case 0xA1:
- case 0xA2:
- case 0xA3:
- case 0xA4:
- case 0xA5:
- case 0xA6:
- case 0xA7:
- case 0xA8:
- case 0xA9:
- case 0xAA:
- case 0xAB:
- case 0xAC:
- case 0xAD:
- case 0xAE:
- case 0xAF:
- case 0xB0:
- case 0xB1:
- case 0xB2:
- case 0xB3:
- case 0xB4:
- case 0xB5:
- case 0xB6:
- case 0xB7:
- case 0xB8:
- case 0xB9:
- case 0xBA:
- case 0xBB:
- case 0xBC:
- case 0xBD:
- case 0xBE:
- case 0xBF: goto yy69;
- default: goto yy60;
- }
-yy105:
- YYDEBUG(105, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
- switch (yych) {
- case 0xA0:
- case 0xA1:
- case 0xA2:
- case 0xA3:
- case 0xA4:
- case 0xA5:
- case 0xA6:
- case 0xA7:
- case 0xA8:
- case 0xA9:
- case 0xAA:
- case 0xAB:
- case 0xAC:
- case 0xAD:
- case 0xAE:
- case 0xAF:
- case 0xB0:
- case 0xB1:
- case 0xB2:
- case 0xB3:
- case 0xB4:
- case 0xB5:
- case 0xB6:
- case 0xB7:
- case 0xB8:
- case 0xB9:
- case 0xBA:
- case 0xBB:
- case 0xBC:
- case 0xBD:
- case 0xBE:
- case 0xBF: goto yy104;
- default: goto yy60;
+ case 't': goto yy149;
+ default: goto yy37;
}
-yy106:
- YYDEBUG(106, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy107:
+ YYDEBUG(107, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+yy108:
+ YYDEBUG(108, YYPEEK());
switch (yych) {
- case 0x80:
- case 0x81:
- case 0x82:
- case 0x83:
- case 0x84:
- case 0x85:
- case 0x86:
- case 0x87:
- case 0x88:
- case 0x89:
- case 0x8A:
- case 0x8B:
- case 0x8C:
- case 0x8D:
- case 0x8E:
- case 0x8F:
- case 0x90:
- case 0x91:
- case 0x92:
- case 0x93:
- case 0x94:
- case 0x95:
- case 0x96:
- case 0x97:
- case 0x98:
- case 0x99:
- case 0x9A:
- case 0x9B:
- case 0x9C:
- case 0x9D:
- case 0x9E:
- case 0x9F:
- case 0xA0:
- case 0xA1:
- case 0xA2:
- case 0xA3:
- case 0xA4:
- case 0xA5:
- case 0xA6:
- case 0xA7:
- case 0xA8:
- case 0xA9:
- case 0xAA:
- case 0xAB:
- case 0xAC:
- case 0xAD:
+ case 0x00:
+ case 0x01:
+ case 0x02:
+ case 0x03:
+ case 0x05:
+ case 0x06:
+ case 0x07:
+ case 0x08:
+ case '\t':
+ case '\v':
+ case '\f':
+ case '\r':
+ case 0x0E:
+ case 0x0F:
+ case 0x10:
+ case 0x11:
+ case 0x12:
+ case 0x13:
+ case 0x14:
+ case 0x15:
+ case 0x16:
+ case 0x17:
+ case 0x18:
+ case 0x19:
+ case 0x1A:
+ case 0x1B:
+ case 0x1C:
+ case 0x1D:
+ case 0x1E:
+ case 0x1F:
+ case ' ':
+ case '!':
+ case '"':
+ case '#':
+ case '$':
+ case '%':
+ case '&':
+ case '\'':
+ case '(':
+ case ')':
+ case '*':
+ case '+':
+ case ',':
+ case '-':
+ case '.':
+ case '/':
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
+ case ':':
+ case ';':
+ case '<':
+ case '=':
+ case '>':
+ case '?':
+ case '@':
+ case 'A':
+ case 'B':
+ case 'C':
+ case 'D':
+ case 'E':
+ case 'F':
+ case 'G':
+ case 'H':
+ case 'I':
+ case 'J':
+ case 'K':
+ case 'L':
+ case 'M':
+ case 'N':
+ case 'O':
+ case 'P':
+ case 'Q':
+ case 'R':
+ case 'S':
+ case 'T':
+ case 'U':
+ case 'V':
+ case 'W':
+ case 'X':
+ case 'Y':
+ case 'Z':
+ case '[':
+ case '\\':
+ case ']':
+ case '^':
+ case '_':
+ case '`':
+ case 'a':
+ case 'b':
+ case 'c':
+ case 'd':
+ case 'e':
+ case 'f':
+ case 'g':
+ case 'h':
+ case 'i':
+ case 'j':
+ case 'k':
+ case 'l':
+ case 'm':
+ case 'n':
+ case 'o':
+ case 'p':
+ case 'q':
+ case 'r':
+ case 's':
+ case 't':
+ case 'u':
+ case 'v':
+ case 'w':
+ case 'x':
+ case 'y':
+ case 'z':
+ case '{':
+ case '|':
+ case '~':
+ case 0x7F: goto yy107;
+ case '}': goto yy109;
+ case 0xC2:
+ case 0xC3:
+ case 0xC4:
+ case 0xC5:
+ case 0xC6:
+ case 0xC7:
+ case 0xC8:
+ case 0xC9:
+ case 0xCA:
+ case 0xCB:
+ case 0xCC:
+ case 0xCD:
+ case 0xCE:
+ case 0xCF:
+ case 0xD0:
+ case 0xD1:
+ case 0xD2:
+ case 0xD3:
+ case 0xD4:
+ case 0xD5:
+ case 0xD6:
+ case 0xD7:
+ case 0xD8:
+ case 0xD9:
+ case 0xDA:
+ case 0xDB:
+ case 0xDC:
+ case 0xDD:
+ case 0xDE:
+ case 0xDF: goto yy111;
+ case 0xE0: goto yy112;
+ case 0xE1:
+ case 0xE2:
+ case 0xE3:
+ case 0xE4:
+ case 0xE5:
+ case 0xE6:
+ case 0xE7:
+ case 0xE8:
+ case 0xE9:
+ case 0xEA:
+ case 0xEB:
+ case 0xEC:
+ case 0xED:
+ case 0xEE:
+ case 0xEF: goto yy113;
+ case 0xF0: goto yy114;
+ case 0xF1:
+ case 0xF2:
+ case 0xF3: goto yy115;
+ case 0xF4: goto yy116;
+ default: goto yy62;
+ }
+yy109:
+ YYDEBUG(109, YYPEEK());
+ YYSKIP();
+ YYDEBUG(110, YYPEEK());
+#line 221 "gpr.re2c"
+ {*id = 4; if (lexer->cursor[-1] == 0x0a || (lexer->cursor[-1] == 0x0d
&& lexer->cursor[-2] == 0x0a)) lexer->line++; continue;}
+#line 3200 "gpr_re2c.c"
+yy111:
+ YYDEBUG(111, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy107;
+ default: goto yy62;
+ }
+yy112:
+ YYDEBUG(112, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy111;
+ default: goto yy62;
+ }
+yy113:
+ YYDEBUG(113, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy111;
+ default: goto yy62;
+ }
+yy114:
+ YYDEBUG(114, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy113;
+ default: goto yy62;
+ }
+yy115:
+ YYDEBUG(115, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy113;
+ default: goto yy62;
+ }
+yy116:
+ YYDEBUG(116, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F: goto yy113;
+ default: goto yy62;
+ }
+yy117:
+ YYDEBUG(117, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 's': goto yy150;
+ default: goto yy62;
+ }
+yy118:
+ YYDEBUG(118, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'd': goto yy119;
+ default: goto yy62;
+ }
+yy119:
+ YYDEBUG(119, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ YYDEBUG(120, YYPEEK());
+ switch (yych) {
+ case 0x00:
+ case 0x01:
+ case 0x02:
+ case 0x03:
+ case 0x05:
+ case 0x06:
+ case 0x07:
+ case 0x08:
+ case '\t':
+ case '\v':
+ case '\f':
+ case '\r':
+ case 0x0E:
+ case 0x0F:
+ case 0x10:
+ case 0x11:
+ case 0x12:
+ case 0x13:
+ case 0x14:
+ case 0x15:
+ case 0x16:
+ case 0x17:
+ case 0x18:
+ case 0x19:
+ case 0x1A:
+ case 0x1B:
+ case 0x1C:
+ case 0x1D:
+ case 0x1E:
+ case 0x1F:
+ case ' ':
+ case '!':
+ case '"':
+ case '#':
+ case '$':
+ case '%':
+ case '&':
+ case '\'':
+ case '(':
+ case ')':
+ case '*':
+ case '+':
+ case ',':
+ case '-':
+ case '.':
+ case '/':
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
+ case ':':
+ case ';':
+ case '<':
+ case '=':
+ case '>':
+ case '?':
+ case '@':
+ case 'A':
+ case 'B':
+ case 'C':
+ case 'D':
+ case 'E':
+ case 'F':
+ case 'G':
+ case 'H':
+ case 'I':
+ case 'J':
+ case 'K':
+ case 'L':
+ case 'M':
+ case 'N':
+ case 'O':
+ case 'P':
+ case 'Q':
+ case 'R':
+ case 'S':
+ case 'T':
+ case 'U':
+ case 'V':
+ case 'W':
+ case 'X':
+ case 'Y':
+ case 'Z':
+ case '[':
+ case '\\':
+ case ']':
+ case '^':
+ case '_':
+ case '`':
+ case 'a':
+ case 'b':
+ case 'c':
+ case 'd':
+ case 'e':
+ case 'f':
+ case 'g':
+ case 'h':
+ case 'i':
+ case 'j':
+ case 'k':
+ case 'l':
+ case 'm':
+ case 'n':
+ case 'o':
+ case 'p':
+ case 'q':
+ case 'r':
+ case 's':
+ case 't':
+ case 'u':
+ case 'v':
+ case 'w':
+ case 'x':
+ case 'y':
+ case 'z':
+ case '{':
+ case '|':
+ case '}':
+ case '~':
+ case 0x7F: goto yy119;
+ case 0x04:
+ case '\n': goto yy151;
+ case 0xC2:
+ case 0xC3:
+ case 0xC4:
+ case 0xC5:
+ case 0xC6:
+ case 0xC7:
+ case 0xC8:
+ case 0xC9:
+ case 0xCA:
+ case 0xCB:
+ case 0xCC:
+ case 0xCD:
+ case 0xCE:
+ case 0xCF:
+ case 0xD0:
+ case 0xD1:
+ case 0xD2:
+ case 0xD3:
+ case 0xD4:
+ case 0xD5:
+ case 0xD6:
+ case 0xD7:
+ case 0xD8:
+ case 0xD9:
+ case 0xDA:
+ case 0xDB:
+ case 0xDC:
+ case 0xDD:
+ case 0xDE:
+ case 0xDF: goto yy153;
+ case 0xE0: goto yy154;
+ case 0xE1:
+ case 0xE2:
+ case 0xE3:
+ case 0xE4:
+ case 0xE5:
+ case 0xE6:
+ case 0xE7:
+ case 0xE8:
+ case 0xE9:
+ case 0xEA:
+ case 0xEB:
+ case 0xEC:
+ case 0xED:
+ case 0xEE:
+ case 0xEF: goto yy155;
+ case 0xF0: goto yy156;
+ case 0xF1:
+ case 0xF2:
+ case 0xF3: goto yy157;
+ case 0xF4: goto yy158;
+ default: goto yy62;
+ }
+yy121:
+ YYDEBUG(121, YYPEEK());
+ YYSKIP();
+ YYDEBUG(122, YYPEEK());
+#line 219 "gpr.re2c"
+ {*id = 2; if (lexer->cursor[-1] == 0x0a || (lexer->cursor[-1] == 0x0d
&& lexer->cursor[-2] == 0x0a)) lexer->line++; continue;}
+#line 3740 "gpr_re2c.c"
+yy123:
+ YYDEBUG(123, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
case 0xAE:
case 0xAF:
case 0xB0:
@@ -2931,14 +3805,69 @@ yy106:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy104;
- default: goto yy60;
+ case 0xBF: goto yy73;
+ default: goto yy62;
}
-yy107:
- YYDEBUG(107, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy124:
+ YYDEBUG(124, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy123;
+ default: goto yy62;
+ }
+yy125:
+ YYDEBUG(125, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
case 0x90:
case 0x91:
case 0x92:
@@ -2986,13 +3915,68 @@ yy107:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy106;
- default: goto yy60;
+ case 0xBF: goto yy123;
+ default: goto yy62;
}
-yy108:
- YYDEBUG(108, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy126:
+ YYDEBUG(126, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy125;
+ default: goto yy62;
+ }
+yy127:
+ YYDEBUG(127, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -3057,13 +4041,13 @@ yy108:
case 0xBC:
case 0xBD:
case 0xBE:
- case 0xBF: goto yy106;
- default: goto yy60;
+ case 0xBF: goto yy125;
+ default: goto yy62;
}
-yy109:
- YYDEBUG(109, YYPEEK ());
- YYSKIP ();
- yych = YYPEEK ();
+yy128:
+ YYDEBUG(128, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
case 0x80:
case 0x81:
@@ -3080,59 +4064,59 @@ yy109:
case 0x8C:
case 0x8D:
case 0x8E:
- case 0x8F: goto yy106;
- default: goto yy60;
+ case 0x8F: goto yy125;
+ default: goto yy62;
}
-yy110:
- YYDEBUG(110, YYPEEK ());
+yy129:
+ YYDEBUG(129, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'T':
- case 't': goto yy131;
- default: goto yy36;
+ case 't': goto yy159;
+ default: goto yy37;
}
-yy111:
- YYDEBUG(111, YYPEEK ());
+yy130:
+ YYDEBUG(130, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'R':
- case 'r': goto yy132;
- default: goto yy36;
+ case 'r': goto yy160;
+ default: goto yy37;
}
-yy112:
- YYDEBUG(112, YYPEEK ());
+yy131:
+ YYDEBUG(131, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy133;
- default: goto yy36;
+ case 'e': goto yy161;
+ default: goto yy37;
}
-yy113:
- YYDEBUG(113, YYPEEK ());
+yy132:
+ YYDEBUG(132, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'F':
- case 'f': goto yy135;
- default: goto yy36;
+ case 'f': goto yy163;
+ default: goto yy37;
}
-yy114:
- YYDEBUG(114, YYPEEK ());
- yyaccept = 6;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy133:
+ YYDEBUG(133, YYPEEK());
+ yyaccept = 5;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -3247,31 +4231,31 @@ yy114:
case 0xF1:
case 0xF2:
case 0xF3:
- case 0xF4: goto yy36;
- default: goto yy115;
+ case 0xF4: goto yy37;
+ default: goto yy134;
}
-yy115:
- YYDEBUG(115, YYPEEK ());
-#line 209 "../gpr.re2c"
- {*id = 8; continue;}
-#line 3258 "../gpr_re2c.c"
-yy116:
- YYDEBUG(116, YYPEEK ());
+yy134:
+ YYDEBUG(134, YYPEEK());
+#line 227 "gpr.re2c"
+ {*id = 10; continue;}
+#line 4242 "gpr_re2c.c"
+yy135:
+ YYDEBUG(135, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy136;
- default: goto yy36;
+ case 'e': goto yy164;
+ default: goto yy37;
}
-yy117:
- YYDEBUG(117, YYPEEK ());
- yyaccept = 7;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy136:
+ YYDEBUG(136, YYPEEK());
+ yyaccept = 6;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -3386,108 +4370,108 @@ yy117:
case 0xF1:
case 0xF2:
case 0xF3:
- case 0xF4: goto yy36;
- default: goto yy118;
+ case 0xF4: goto yy37;
+ default: goto yy137;
}
-yy118:
- YYDEBUG(118, YYPEEK ());
-#line 213 "../gpr.re2c"
- {*id = 12; continue;}
-#line 3397 "../gpr_re2c.c"
-yy119:
- YYDEBUG(119, YYPEEK ());
+yy137:
+ YYDEBUG(137, YYPEEK());
+#line 231 "gpr.re2c"
+ {*id = 14; continue;}
+#line 4381 "gpr_re2c.c"
+yy138:
+ YYDEBUG(138, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'R':
- case 'r': goto yy137;
- default: goto yy36;
+ case 'r': goto yy165;
+ default: goto yy37;
}
-yy120:
- YYDEBUG(120, YYPEEK ());
+yy139:
+ YYDEBUG(139, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'L':
- case 'l': goto yy138;
- default: goto yy36;
+ case 'l': goto yy166;
+ default: goto yy37;
}
-yy121:
- YYDEBUG(121, YYPEEK ());
+yy140:
+ YYDEBUG(140, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy140;
- default: goto yy36;
+ case 'e': goto yy168;
+ default: goto yy37;
}
-yy122:
- YYDEBUG(122, YYPEEK ());
+yy141:
+ YYDEBUG(141, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'K':
- case 'k': goto yy141;
- default: goto yy36;
+ case 'k': goto yy169;
+ default: goto yy37;
}
-yy123:
- YYDEBUG(123, YYPEEK ());
+yy142:
+ YYDEBUG(142, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'J':
- case 'j': goto yy142;
- default: goto yy36;
+ case 'j': goto yy170;
+ default: goto yy37;
}
-yy124:
- YYDEBUG(124, YYPEEK ());
+yy143:
+ YYDEBUG(143, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'A':
- case 'a': goto yy143;
- default: goto yy36;
+ case 'a': goto yy171;
+ default: goto yy37;
}
-yy125:
- YYDEBUG(125, YYPEEK ());
+yy144:
+ YYDEBUG(144, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'N':
- case 'n': goto yy144;
- default: goto yy36;
+ case 'n': goto yy172;
+ default: goto yy37;
}
-yy126:
- YYDEBUG(126, YYPEEK ());
+yy145:
+ YYDEBUG(145, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy145;
- default: goto yy36;
+ case 'e': goto yy173;
+ default: goto yy37;
}
-yy127:
- YYDEBUG(127, YYPEEK ());
- yyaccept = 8;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy146:
+ YYDEBUG(146, YYPEEK());
+ yyaccept = 7;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -3602,64 +4586,410 @@ yy127:
case 0xF1:
case 0xF2:
case 0xF3:
- case 0xF4: goto yy36;
- default: goto yy128;
+ case 0xF4: goto yy37;
+ default: goto yy147;
}
-yy128:
- YYDEBUG(128, YYPEEK ());
-#line 225 "../gpr.re2c"
- {*id = 24; continue;}
-#line 3613 "../gpr_re2c.c"
-yy129:
- YYDEBUG(129, YYPEEK ());
+yy147:
+ YYDEBUG(147, YYPEEK());
+#line 243 "gpr.re2c"
+ {*id = 26; continue;}
+#line 4597 "gpr_re2c.c"
+yy148:
+ YYDEBUG(148, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'N':
- case 'n': goto yy147;
- default: goto yy36;
+ case 'n': goto yy175;
+ default: goto yy37;
+ }
+yy149:
+ YYDEBUG(149, YYPEEK());
+ yyaccept = 1;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'H':
+ case 'h': goto yy177;
+ default: goto yy37;
+ }
+yy150:
+ YYDEBUG(150, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 'e': goto yy119;
+ case 'i': goto yy72;
+ default: goto yy62;
+ }
+yy151:
+ YYDEBUG(151, YYPEEK());
+ YYSKIP();
+ YYDEBUG(152, YYPEEK());
+#line 220 "gpr.re2c"
+ {*id = 3; if (lexer->cursor[-1] == 0x0a || (lexer->cursor[-1] == 0x0d
&& lexer->cursor[-2] == 0x0a)) lexer->line++; continue;}
+#line 4635 "gpr_re2c.c"
+yy153:
+ YYDEBUG(153, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy119;
+ default: goto yy62;
+ }
+yy154:
+ YYDEBUG(154, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy153;
+ default: goto yy62;
+ }
+yy155:
+ YYDEBUG(155, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy153;
+ default: goto yy62;
+ }
+yy156:
+ YYDEBUG(156, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy155;
+ default: goto yy62;
+ }
+yy157:
+ YYDEBUG(157, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
+ switch (yych) {
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F:
+ case 0x90:
+ case 0x91:
+ case 0x92:
+ case 0x93:
+ case 0x94:
+ case 0x95:
+ case 0x96:
+ case 0x97:
+ case 0x98:
+ case 0x99:
+ case 0x9A:
+ case 0x9B:
+ case 0x9C:
+ case 0x9D:
+ case 0x9E:
+ case 0x9F:
+ case 0xA0:
+ case 0xA1:
+ case 0xA2:
+ case 0xA3:
+ case 0xA4:
+ case 0xA5:
+ case 0xA6:
+ case 0xA7:
+ case 0xA8:
+ case 0xA9:
+ case 0xAA:
+ case 0xAB:
+ case 0xAC:
+ case 0xAD:
+ case 0xAE:
+ case 0xAF:
+ case 0xB0:
+ case 0xB1:
+ case 0xB2:
+ case 0xB3:
+ case 0xB4:
+ case 0xB5:
+ case 0xB6:
+ case 0xB7:
+ case 0xB8:
+ case 0xB9:
+ case 0xBA:
+ case 0xBB:
+ case 0xBC:
+ case 0xBD:
+ case 0xBE:
+ case 0xBF: goto yy155;
+ default: goto yy62;
}
-yy130:
- YYDEBUG(130, YYPEEK ());
- yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy158:
+ YYDEBUG(158, YYPEEK());
+ YYSKIP();
+ yych = YYPEEK();
switch (yych) {
- case 'H':
- case 'h': goto yy149;
- default: goto yy36;
+ case 0x80:
+ case 0x81:
+ case 0x82:
+ case 0x83:
+ case 0x84:
+ case 0x85:
+ case 0x86:
+ case 0x87:
+ case 0x88:
+ case 0x89:
+ case 0x8A:
+ case 0x8B:
+ case 0x8C:
+ case 0x8D:
+ case 0x8E:
+ case 0x8F: goto yy155;
+ default: goto yy62;
}
-yy131:
- YYDEBUG(131, YYPEEK ());
+yy159:
+ YYDEBUG(159, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'R':
- case 'r': goto yy151;
- default: goto yy36;
+ case 'r': goto yy179;
+ default: goto yy37;
}
-yy132:
- YYDEBUG(132, YYPEEK ());
+yy160:
+ YYDEBUG(160, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy152;
- default: goto yy36;
+ case 'e': goto yy180;
+ default: goto yy37;
}
-yy133:
- YYDEBUG(133, YYPEEK ());
- yyaccept = 9;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy161:
+ YYDEBUG(161, YYPEEK());
+ yyaccept = 8;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -3774,55 +5104,55 @@ yy133:
case 0xF1:
case 0xF2:
case 0xF3:
- case 0xF4: goto yy36;
- default: goto yy134;
+ case 0xF4: goto yy37;
+ default: goto yy162;
}
-yy134:
- YYDEBUG(134, YYPEEK ());
-#line 207 "../gpr.re2c"
- {*id = 6; continue;}
-#line 3785 "../gpr_re2c.c"
-yy135:
- YYDEBUG(135, YYPEEK ());
+yy162:
+ YYDEBUG(162, YYPEEK());
+#line 225 "gpr.re2c"
+ {*id = 8; continue;}
+#line 5115 "gpr_re2c.c"
+yy163:
+ YYDEBUG(163, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'I':
- case 'i': goto yy153;
- default: goto yy36;
+ case 'i': goto yy181;
+ default: goto yy37;
}
-yy136:
- YYDEBUG(136, YYPEEK ());
+yy164:
+ YYDEBUG(164, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'N':
- case 'n': goto yy154;
+ case 'n': goto yy182;
case 'R':
- case 'r': goto yy155;
- default: goto yy36;
+ case 'r': goto yy183;
+ default: goto yy37;
}
-yy137:
- YYDEBUG(137, YYPEEK ());
+yy165:
+ YYDEBUG(165, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'A':
- case 'a': goto yy156;
- default: goto yy36;
+ case 'a': goto yy184;
+ default: goto yy37;
}
-yy138:
- YYDEBUG(138, YYPEEK ());
- yyaccept = 10;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy166:
+ YYDEBUG(166, YYPEEK());
+ yyaccept = 9;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -3937,75 +5267,75 @@ yy138:
case 0xF1:
case 0xF2:
case 0xF3:
- case 0xF4: goto yy36;
- default: goto yy139;
+ case 0xF4: goto yy37;
+ default: goto yy167;
}
-yy139:
- YYDEBUG(139, YYPEEK ());
-#line 217 "../gpr.re2c"
- {*id = 16; continue;}
-#line 3948 "../gpr_re2c.c"
-yy140:
- YYDEBUG(140, YYPEEK ());
+yy167:
+ YYDEBUG(167, YYPEEK());
+#line 235 "gpr.re2c"
+ {*id = 18; continue;}
+#line 5278 "gpr_re2c.c"
+yy168:
+ YYDEBUG(168, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'R':
- case 'r': goto yy157;
- default: goto yy36;
+ case 'r': goto yy185;
+ default: goto yy37;
}
-yy141:
- YYDEBUG(141, YYPEEK ());
+yy169:
+ YYDEBUG(169, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'A':
- case 'a': goto yy158;
- default: goto yy36;
+ case 'a': goto yy186;
+ default: goto yy37;
}
-yy142:
- YYDEBUG(142, YYPEEK ());
+yy170:
+ YYDEBUG(170, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy159;
- default: goto yy36;
+ case 'e': goto yy187;
+ default: goto yy37;
}
-yy143:
- YYDEBUG(143, YYPEEK ());
+yy171:
+ YYDEBUG(171, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'M':
- case 'm': goto yy160;
- default: goto yy36;
+ case 'm': goto yy188;
+ default: goto yy37;
}
-yy144:
- YYDEBUG(144, YYPEEK ());
+yy172:
+ YYDEBUG(172, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'D':
- case 'd': goto yy161;
- default: goto yy36;
+ case 'd': goto yy189;
+ default: goto yy37;
}
-yy145:
- YYDEBUG(145, YYPEEK ());
- yyaccept = 11;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy173:
+ YYDEBUG(173, YYPEEK());
+ yyaccept = 10;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -4120,20 +5450,20 @@ yy145:
case 0xF1:
case 0xF2:
case 0xF3:
- case 0xF4: goto yy36;
- default: goto yy146;
+ case 0xF4: goto yy37;
+ default: goto yy174;
}
-yy146:
- YYDEBUG(146, YYPEEK ());
-#line 224 "../gpr.re2c"
- {*id = 23; continue;}
-#line 4131 "../gpr_re2c.c"
-yy147:
- YYDEBUG(147, YYPEEK ());
- yyaccept = 12;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy174:
+ YYDEBUG(174, YYPEEK());
+#line 242 "gpr.re2c"
+ {*id = 25; continue;}
+#line 5461 "gpr_re2c.c"
+yy175:
+ YYDEBUG(175, YYPEEK());
+ yyaccept = 11;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -4248,20 +5578,20 @@ yy147:
case 0xF1:
case 0xF2:
case 0xF3:
- case 0xF4: goto yy36;
- default: goto yy148;
+ case 0xF4: goto yy37;
+ default: goto yy176;
}
-yy148:
- YYDEBUG(148, YYPEEK ());
-#line 226 "../gpr.re2c"
- {*id = 25; continue;}
-#line 4259 "../gpr_re2c.c"
-yy149:
- YYDEBUG(149, YYPEEK ());
- yyaccept = 13;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy176:
+ YYDEBUG(176, YYPEEK());
+#line 244 "gpr.re2c"
+ {*id = 27; continue;}
+#line 5589 "gpr_re2c.c"
+yy177:
+ YYDEBUG(177, YYPEEK());
+ yyaccept = 12;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -4376,207 +5706,207 @@ yy149:
case 0xF1:
case 0xF2:
case 0xF3:
- case 0xF4: goto yy36;
- default: goto yy150;
+ case 0xF4: goto yy37;
+ default: goto yy178;
}
-yy150:
- YYDEBUG(150, YYPEEK ());
-#line 227 "../gpr.re2c"
- {*id = 26; continue;}
-#line 4387 "../gpr_re2c.c"
-yy151:
- YYDEBUG(151, YYPEEK ());
+yy178:
+ YYDEBUG(178, YYPEEK());
+#line 245 "gpr.re2c"
+ {*id = 28; continue;}
+#line 5717 "gpr_re2c.c"
+yy179:
+ YYDEBUG(179, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'A':
- case 'a': goto yy162;
- default: goto yy36;
+ case 'a': goto yy190;
+ default: goto yy37;
}
-yy152:
- YYDEBUG(152, YYPEEK ());
+yy180:
+ YYDEBUG(180, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'G':
- case 'g': goto yy163;
- default: goto yy36;
+ case 'g': goto yy191;
+ default: goto yy37;
}
-yy153:
- YYDEBUG(153, YYPEEK ());
+yy181:
+ YYDEBUG(181, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'G':
- case 'g': goto yy164;
- default: goto yy36;
+ case 'g': goto yy192;
+ default: goto yy37;
}
-yy154:
- YYDEBUG(154, YYPEEK ());
+yy182:
+ YYDEBUG(182, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'D':
- case 'd': goto yy165;
- default: goto yy36;
+ case 'd': goto yy193;
+ default: goto yy37;
}
-yy155:
- YYDEBUG(155, YYPEEK ());
+yy183:
+ YYDEBUG(183, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'N':
- case 'n': goto yy166;
- default: goto yy36;
+ case 'n': goto yy194;
+ default: goto yy37;
}
-yy156:
- YYDEBUG(156, YYPEEK ());
+yy184:
+ YYDEBUG(184, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'R':
- case 'r': goto yy167;
- default: goto yy36;
+ case 'r': goto yy195;
+ default: goto yy37;
}
-yy157:
- YYDEBUG(157, YYPEEK ());
+yy185:
+ YYDEBUG(185, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'S':
- case 's': goto yy168;
- default: goto yy36;
+ case 's': goto yy196;
+ default: goto yy37;
}
-yy158:
- YYDEBUG(158, YYPEEK ());
+yy186:
+ YYDEBUG(186, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'G':
- case 'g': goto yy170;
- default: goto yy36;
+ case 'g': goto yy198;
+ default: goto yy37;
}
-yy159:
- YYDEBUG(159, YYPEEK ());
+yy187:
+ YYDEBUG(187, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'C':
- case 'c': goto yy171;
- default: goto yy36;
+ case 'c': goto yy199;
+ default: goto yy37;
}
-yy160:
- YYDEBUG(160, YYPEEK ());
+yy188:
+ YYDEBUG(188, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy172;
- default: goto yy36;
+ case 'e': goto yy200;
+ default: goto yy37;
}
-yy161:
- YYDEBUG(161, YYPEEK ());
+yy189:
+ YYDEBUG(189, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'A':
- case 'a': goto yy173;
- default: goto yy36;
+ case 'a': goto yy201;
+ default: goto yy37;
}
-yy162:
- YYDEBUG(162, YYPEEK ());
+yy190:
+ YYDEBUG(190, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'C':
- case 'c': goto yy174;
- default: goto yy36;
+ case 'c': goto yy202;
+ default: goto yy37;
}
-yy163:
- YYDEBUG(163, YYPEEK ());
+yy191:
+ YYDEBUG(191, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'A':
- case 'a': goto yy175;
- default: goto yy36;
+ case 'a': goto yy203;
+ default: goto yy37;
}
-yy164:
- YYDEBUG(164, YYPEEK ());
+yy192:
+ YYDEBUG(192, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'U':
- case 'u': goto yy176;
- default: goto yy36;
+ case 'u': goto yy204;
+ default: goto yy37;
}
-yy165:
- YYDEBUG(165, YYPEEK ());
+yy193:
+ YYDEBUG(193, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'S':
- case 's': goto yy177;
- default: goto yy36;
+ case 's': goto yy205;
+ default: goto yy37;
}
-yy166:
- YYDEBUG(166, YYPEEK ());
+yy194:
+ YYDEBUG(194, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'A':
- case 'a': goto yy179;
- default: goto yy36;
+ case 'a': goto yy207;
+ default: goto yy37;
}
-yy167:
- YYDEBUG(167, YYPEEK ());
+yy195:
+ YYDEBUG(195, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'Y':
- case 'y': goto yy180;
- default: goto yy36;
+ case 'y': goto yy208;
+ default: goto yy37;
}
-yy168:
- YYDEBUG(168, YYPEEK ());
- yyaccept = 14;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy196:
+ YYDEBUG(196, YYPEEK());
+ yyaccept = 13;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -4691,97 +6021,97 @@ yy168:
case 0xF1:
case 0xF2:
case 0xF3:
- case 0xF4: goto yy36;
- default: goto yy169;
+ case 0xF4: goto yy37;
+ default: goto yy197;
}
-yy169:
- YYDEBUG(169, YYPEEK ());
-#line 218 "../gpr.re2c"
- {*id = 17; continue;}
-#line 4702 "../gpr_re2c.c"
-yy170:
- YYDEBUG(170, YYPEEK ());
+yy197:
+ YYDEBUG(197, YYPEEK());
+#line 236 "gpr.re2c"
+ {*id = 19; continue;}
+#line 6032 "gpr_re2c.c"
+yy198:
+ YYDEBUG(198, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy182;
- default: goto yy36;
+ case 'e': goto yy210;
+ default: goto yy37;
}
-yy171:
- YYDEBUG(171, YYPEEK ());
+yy199:
+ YYDEBUG(199, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'T':
- case 't': goto yy184;
- default: goto yy36;
+ case 't': goto yy212;
+ default: goto yy37;
}
-yy172:
- YYDEBUG(172, YYPEEK ());
+yy200:
+ YYDEBUG(200, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'S':
- case 's': goto yy186;
- default: goto yy36;
+ case 's': goto yy214;
+ default: goto yy37;
}
-yy173:
- YYDEBUG(173, YYPEEK ());
+yy201:
+ YYDEBUG(201, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'R':
- case 'r': goto yy188;
- default: goto yy36;
+ case 'r': goto yy216;
+ default: goto yy37;
}
-yy174:
- YYDEBUG(174, YYPEEK ());
+yy202:
+ YYDEBUG(202, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'T':
- case 't': goto yy189;
- default: goto yy36;
+ case 't': goto yy217;
+ default: goto yy37;
}
-yy175:
- YYDEBUG(175, YYPEEK ());
+yy203:
+ YYDEBUG(203, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'T':
- case 't': goto yy191;
- default: goto yy36;
+ case 't': goto yy219;
+ default: goto yy37;
}
-yy176:
- YYDEBUG(176, YYPEEK ());
+yy204:
+ YYDEBUG(204, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'R':
- case 'r': goto yy192;
- default: goto yy36;
+ case 'r': goto yy220;
+ default: goto yy37;
}
-yy177:
- YYDEBUG(177, YYPEEK ());
- yyaccept = 15;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy205:
+ YYDEBUG(205, YYPEEK());
+ yyaccept = 14;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -4896,31 +6226,31 @@ yy177:
case 0xF1:
case 0xF2:
case 0xF3:
- case 0xF4: goto yy36;
- default: goto yy178;
+ case 0xF4: goto yy37;
+ default: goto yy206;
}
-yy178:
- YYDEBUG(178, YYPEEK ());
-#line 210 "../gpr.re2c"
- {*id = 9; continue;}
-#line 4907 "../gpr_re2c.c"
-yy179:
- YYDEBUG(179, YYPEEK ());
+yy206:
+ YYDEBUG(206, YYPEEK());
+#line 228 "gpr.re2c"
+ {*id = 11; continue;}
+#line 6237 "gpr_re2c.c"
+yy207:
+ YYDEBUG(207, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'L':
- case 'l': goto yy193;
- default: goto yy36;
+ case 'l': goto yy221;
+ default: goto yy37;
}
-yy180:
- YYDEBUG(180, YYPEEK ());
- yyaccept = 16;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy208:
+ YYDEBUG(208, YYPEEK());
+ yyaccept = 15;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -5035,20 +6365,20 @@ yy180:
case 0xF1:
case 0xF2:
case 0xF3:
- case 0xF4: goto yy36;
- default: goto yy181;
+ case 0xF4: goto yy37;
+ default: goto yy209;
}
-yy181:
- YYDEBUG(181, YYPEEK ());
-#line 216 "../gpr.re2c"
- {*id = 15; continue;}
-#line 5046 "../gpr_re2c.c"
-yy182:
- YYDEBUG(182, YYPEEK ());
- yyaccept = 17;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy209:
+ YYDEBUG(209, YYPEEK());
+#line 234 "gpr.re2c"
+ {*id = 17; continue;}
+#line 6376 "gpr_re2c.c"
+yy210:
+ YYDEBUG(210, YYPEEK());
+ yyaccept = 16;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -5163,20 +6493,20 @@ yy182:
case 0xF1:
case 0xF2:
case 0xF3:
- case 0xF4: goto yy36;
- default: goto yy183;
+ case 0xF4: goto yy37;
+ default: goto yy211;
}
-yy183:
- YYDEBUG(183, YYPEEK ());
-#line 219 "../gpr.re2c"
- {*id = 18; continue;}
-#line 5174 "../gpr_re2c.c"
-yy184:
- YYDEBUG(184, YYPEEK ());
- yyaccept = 18;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy211:
+ YYDEBUG(211, YYPEEK());
+#line 237 "gpr.re2c"
+ {*id = 20; continue;}
+#line 6504 "gpr_re2c.c"
+yy212:
+ YYDEBUG(212, YYPEEK());
+ yyaccept = 17;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -5291,20 +6621,20 @@ yy184:
case 0xF1:
case 0xF2:
case 0xF3:
- case 0xF4: goto yy36;
- default: goto yy185;
+ case 0xF4: goto yy37;
+ default: goto yy213;
}
-yy185:
- YYDEBUG(185, YYPEEK ());
-#line 220 "../gpr.re2c"
- {*id = 19; continue;}
-#line 5302 "../gpr_re2c.c"
-yy186:
- YYDEBUG(186, YYPEEK ());
- yyaccept = 19;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy213:
+ YYDEBUG(213, YYPEEK());
+#line 238 "gpr.re2c"
+ {*id = 21; continue;}
+#line 6632 "gpr_re2c.c"
+yy214:
+ YYDEBUG(214, YYPEEK());
+ yyaccept = 18;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -5419,31 +6749,31 @@ yy186:
case 0xF1:
case 0xF2:
case 0xF3:
- case 0xF4: goto yy36;
- default: goto yy187;
- }
-yy187:
- YYDEBUG(187, YYPEEK ());
-#line 221 "../gpr.re2c"
- {*id = 20; continue;}
-#line 5430 "../gpr_re2c.c"
-yy188:
- YYDEBUG(188, YYPEEK ());
+ case 0xF4: goto yy37;
+ default: goto yy215;
+ }
+yy215:
+ YYDEBUG(215, YYPEEK());
+#line 239 "gpr.re2c"
+ {*id = 22; continue;}
+#line 6760 "gpr_re2c.c"
+yy216:
+ YYDEBUG(216, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'D':
- case 'd': goto yy195;
- default: goto yy36;
+ case 'd': goto yy223;
+ default: goto yy37;
}
-yy189:
- YYDEBUG(189, YYPEEK ());
- yyaccept = 20;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy217:
+ YYDEBUG(217, YYPEEK());
+ yyaccept = 19;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -5558,42 +6888,42 @@ yy189:
case 0xF1:
case 0xF2:
case 0xF3:
- case 0xF4: goto yy36;
- default: goto yy190;
- }
-yy190:
- YYDEBUG(190, YYPEEK ());
-#line 204 "../gpr.re2c"
- {*id = 3; continue;}
-#line 5569 "../gpr_re2c.c"
-yy191:
- YYDEBUG(191, YYPEEK ());
+ case 0xF4: goto yy37;
+ default: goto yy218;
+ }
+yy218:
+ YYDEBUG(218, YYPEEK());
+#line 222 "gpr.re2c"
+ {*id = 5; continue;}
+#line 6899 "gpr_re2c.c"
+yy219:
+ YYDEBUG(219, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'E':
- case 'e': goto yy197;
- default: goto yy36;
+ case 'e': goto yy225;
+ default: goto yy37;
}
-yy192:
- YYDEBUG(192, YYPEEK ());
+yy220:
+ YYDEBUG(220, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'A':
- case 'a': goto yy199;
- default: goto yy36;
+ case 'a': goto yy227;
+ default: goto yy37;
}
-yy193:
- YYDEBUG(193, YYPEEK ());
- yyaccept = 21;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy221:
+ YYDEBUG(221, YYPEEK());
+ yyaccept = 20;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -5707,21 +7037,21 @@ yy193:
case 0xF1:
case 0xF2:
case 0xF3:
- case 0xF4: goto yy36;
- case '_': goto yy200;
- default: goto yy194;
- }
-yy194:
- YYDEBUG(194, YYPEEK ());
-#line 211 "../gpr.re2c"
- {*id = 10; continue;}
-#line 5719 "../gpr_re2c.c"
-yy195:
- YYDEBUG(195, YYPEEK ());
- yyaccept = 22;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ case 0xF4: goto yy37;
+ case '_': goto yy228;
+ default: goto yy222;
+ }
+yy222:
+ YYDEBUG(222, YYPEEK());
+#line 229 "gpr.re2c"
+ {*id = 12; continue;}
+#line 7049 "gpr_re2c.c"
+yy223:
+ YYDEBUG(223, YYPEEK());
+ yyaccept = 21;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -5836,20 +7166,20 @@ yy195:
case 0xF1:
case 0xF2:
case 0xF3:
- case 0xF4: goto yy36;
- default: goto yy196;
- }
-yy196:
- YYDEBUG(196, YYPEEK ());
-#line 223 "../gpr.re2c"
- {*id = 22; continue;}
-#line 5847 "../gpr_re2c.c"
-yy197:
- YYDEBUG(197, YYPEEK ());
- yyaccept = 23;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ case 0xF4: goto yy37;
+ default: goto yy224;
+ }
+yy224:
+ YYDEBUG(224, YYPEEK());
+#line 241 "gpr.re2c"
+ {*id = 24; continue;}
+#line 7177 "gpr_re2c.c"
+yy225:
+ YYDEBUG(225, YYPEEK());
+ yyaccept = 22;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -5964,107 +7294,107 @@ yy197:
case 0xF1:
case 0xF2:
case 0xF3:
- case 0xF4: goto yy36;
- default: goto yy198;
- }
-yy198:
- YYDEBUG(198, YYPEEK ());
-#line 206 "../gpr.re2c"
- {*id = 5; continue;}
-#line 5975 "../gpr_re2c.c"
-yy199:
- YYDEBUG(199, YYPEEK ());
+ case 0xF4: goto yy37;
+ default: goto yy226;
+ }
+yy226:
+ YYDEBUG(226, YYPEEK());
+#line 224 "gpr.re2c"
+ {*id = 7; continue;}
+#line 7305 "gpr_re2c.c"
+yy227:
+ YYDEBUG(227, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'T':
- case 't': goto yy201;
- default: goto yy36;
+ case 't': goto yy229;
+ default: goto yy37;
}
-yy200:
- YYDEBUG(200, YYPEEK ());
+yy228:
+ YYDEBUG(228, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'A':
- case 'a': goto yy202;
- default: goto yy36;
+ case 'a': goto yy230;
+ default: goto yy37;
}
-yy201:
- YYDEBUG(201, YYPEEK ());
+yy229:
+ YYDEBUG(229, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'I':
- case 'i': goto yy203;
- default: goto yy36;
+ case 'i': goto yy231;
+ default: goto yy37;
}
-yy202:
- YYDEBUG(202, YYPEEK ());
+yy230:
+ YYDEBUG(230, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'S':
- case 's': goto yy204;
- default: goto yy36;
+ case 's': goto yy232;
+ default: goto yy37;
}
-yy203:
- YYDEBUG(203, YYPEEK ());
+yy231:
+ YYDEBUG(231, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'O':
- case 'o': goto yy205;
- default: goto yy36;
+ case 'o': goto yy233;
+ default: goto yy37;
}
-yy204:
- YYDEBUG(204, YYPEEK ());
+yy232:
+ YYDEBUG(232, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
- case '_': goto yy206;
- default: goto yy36;
+ case '_': goto yy234;
+ default: goto yy37;
}
-yy205:
- YYDEBUG(205, YYPEEK ());
+yy233:
+ YYDEBUG(233, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'N':
- case 'n': goto yy207;
- default: goto yy36;
+ case 'n': goto yy235;
+ default: goto yy37;
}
-yy206:
- YYDEBUG(206, YYPEEK ());
+yy234:
+ YYDEBUG(234, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'L':
- case 'l': goto yy209;
- default: goto yy36;
+ case 'l': goto yy237;
+ default: goto yy37;
}
-yy207:
- YYDEBUG(207, YYPEEK ());
- yyaccept = 24;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy235:
+ YYDEBUG(235, YYPEEK());
+ yyaccept = 23;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -6179,53 +7509,53 @@ yy207:
case 0xF1:
case 0xF2:
case 0xF3:
- case 0xF4: goto yy36;
- default: goto yy208;
- }
-yy208:
- YYDEBUG(208, YYPEEK ());
-#line 208 "../gpr.re2c"
- {*id = 7; continue;}
-#line 6190 "../gpr_re2c.c"
-yy209:
- YYDEBUG(209, YYPEEK ());
+ case 0xF4: goto yy37;
+ default: goto yy236;
+ }
+yy236:
+ YYDEBUG(236, YYPEEK());
+#line 226 "gpr.re2c"
+ {*id = 9; continue;}
+#line 7520 "gpr_re2c.c"
+yy237:
+ YYDEBUG(237, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'I':
- case 'i': goto yy210;
- default: goto yy36;
+ case 'i': goto yy238;
+ default: goto yy37;
}
-yy210:
- YYDEBUG(210, YYPEEK ());
+yy238:
+ YYDEBUG(238, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'S':
- case 's': goto yy211;
- default: goto yy36;
+ case 's': goto yy239;
+ default: goto yy37;
}
-yy211:
- YYDEBUG(211, YYPEEK ());
+yy239:
+ YYDEBUG(239, YYPEEK());
yyaccept = 1;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case 'T':
- case 't': goto yy212;
- default: goto yy36;
+ case 't': goto yy240;
+ default: goto yy37;
}
-yy212:
- YYDEBUG(212, YYPEEK ());
- yyaccept = 25;
- YYSKIP ();
- YYBACKUP ();
- yych = YYPEEK ();
+yy240:
+ YYDEBUG(240, YYPEEK());
+ yyaccept = 24;
+ YYSKIP();
+ YYBACKUP();
+ yych = YYPEEK();
switch (yych) {
case '0':
case '1':
@@ -6340,16 +7670,16 @@ yy212:
case 0xF1:
case 0xF2:
case 0xF3:
- case 0xF4: goto yy36;
- default: goto yy213;
- }
-yy213:
- YYDEBUG(213, YYPEEK ());
-#line 212 "../gpr.re2c"
- {*id = 11; continue;}
-#line 6351 "../gpr_re2c.c"
+ case 0xF4: goto yy37;
+ default: goto yy241;
+ }
+yy241:
+ YYDEBUG(241, YYPEEK());
+#line 230 "gpr.re2c"
+ {*id = 13; continue;}
+#line 7681 "gpr_re2c.c"
}
-#line 243 "../gpr.re2c"
+#line 261 "gpr.re2c"
}
/* lexer->cursor and lexer ->char_pos are one char past end of token */
@@ -6358,5 +7688,6 @@ yy213:
*char_position = lexer->char_token_start;
*char_length = lexer->char_pos - lexer->char_token_start;
*line_start = lexer->line_token_start;
+ *line_length = lexer->line - lexer->line_token_start;
return status;
}
diff --git a/gpr_re2c_c.ads b/gpr_re2c_c.ads
index f78de90fa4..11b6fb962a 100644
--- a/gpr_re2c_c.ads
+++ b/gpr_re2c_c.ads
@@ -1,8 +1,8 @@
--- generated parser support file.
+-- generated parser support file. -*- buffer-read-only:t -*-
-- command line: wisitoken-bnf-generate.exe --generate LR1 Ada_Emacs re2c
PROCESS gpr.wy
--
--- Copyright (C) 2013 - 2020 Free Software Foundation, Inc.
+-- Copyright (C) 2013 - 2022 Free Software Foundation, Inc.
-- This program is free software; you can redistribute it and/or
-- modify it under the terms of the GNU General Public License as
@@ -24,13 +24,12 @@ package gpr_re2c_c is
function New_Lexer
(Buffer : in System.Address;
- Length : in Interfaces.C.size_t;
- Verbosity : in Interfaces.C.int)
+ Length : in Interfaces.C.size_t)
return System.Address
with Import => True,
Convention => C,
External_Name => "gpr_new_lexer";
- -- Create the lexer object, passing it the full text to process.
+ -- Create the lexer object, passing it the text buffer.
procedure Free_Lexer (Lexer : in out System.Address)
with Import => True,
@@ -43,6 +42,21 @@ package gpr_re2c_c is
Convention => C,
External_Name => "gpr_reset_lexer";
+ procedure Set_Verbosity
+ (Lexer : in System.Address;
+ Verbosity : in Interfaces.C.int)
+ with Import => True,
+ Convention => C,
+ External_Name => "gpr_set_verbosity";
+ procedure Set_Position
+ (Lexer : in System.Address;
+ Byte_Position : in Interfaces.C.size_t;
+ Char_Position : in Interfaces.C.size_t;
+ Line : in Interfaces.C.int)
+ with Import => True,
+ Convention => C,
+ External_Name => "gpr_set_position";
+
function Next_Token
(Lexer : in System.Address;
ID : out WisiToken.Token_ID;
@@ -50,7 +64,8 @@ package gpr_re2c_c is
Byte_Length : out Interfaces.C.size_t;
Char_Position : out Interfaces.C.size_t;
Char_Length : out Interfaces.C.size_t;
- Line_Start : out Interfaces.C.int)
+ Line_Start : out Interfaces.C.int;
+ Line_Length : out Interfaces.C.int)
return Interfaces.C.int
with Import => True,
Convention => C,
diff --git a/run_ada_lalr_parse.ads b/run_ada_lalr_parse.ads
index 7eac49df40..0e21bd566f 100644
--- a/run_ada_lalr_parse.ads
+++ b/run_ada_lalr_parse.ads
@@ -2,7 +2,7 @@
--
-- Run the Ada LALR parser standalone. Useful for debugging grammar issues.
--
--- Copyright (C) 2017 - 2019 Free Software Foundation, Inc.
+-- Copyright (C) 2017 - 2020, 2022 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or
-- modify it under terms of the GNU General Public License as
@@ -18,15 +18,19 @@
pragma License (GPL);
-with Ada_Process_Actions;
-with Ada_Process_LALR_Main;
+with Ada_Annex_P_Process_Actions;
+with Ada_Annex_P_Process_LALR_Main;
with Gen_Run_Wisi_LR_Parse;
with WisiToken.Parse.LR.McKenzie_Recover.Ada;
with Wisi.Ada;
procedure Run_Ada_LALR_Parse is new Gen_Run_Wisi_LR_Parse
(Wisi.Ada.Parse_Data_Type,
- Ada_Process_Actions.Descriptor,
+ Ada_Annex_P_Process_Actions.Descriptor'Access,
+ Ada_Annex_P_Process_Actions.Partial_Parse_Active'Access,
+ Ada_Annex_P_Process_Actions.Partial_Parse_Byte_Goal'Access,
WisiToken.Parse.LR.McKenzie_Recover.Ada.Language_Fixes'Access,
WisiToken.Parse.LR.McKenzie_Recover.Ada.Matching_Begin_Tokens'Access,
WisiToken.Parse.LR.McKenzie_Recover.Ada.String_ID_Set'Access,
- Ada_Process_LALR_Main.Create_Parser);
+ Ada_Annex_P_Process_LALR_Main.Create_Lexer,
+ Ada_Annex_P_Process_LALR_Main.Create_Parse_Table,
+ Ada_Annex_P_Process_LALR_Main.Create_Productions);
diff --git a/run_ada_lr1_parse.ads b/run_ada_lr1_parse.ads
index 76984a75ca..1fda5276a7 100644
--- a/run_ada_lr1_parse.ads
+++ b/run_ada_lr1_parse.ads
@@ -2,7 +2,7 @@
--
-- Run the Ada parser standalone. Useful for debugging grammar issues.
--
--- Copyright (C) 2017, 2018, 2019 Free Software Foundation, Inc.
+-- Copyright (C) 2017 - 2020, 2022 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or
-- modify it under terms of the GNU General Public License as
@@ -18,16 +18,20 @@
pragma License (GPL);
-with Ada_Process_Actions;
-with Ada_Process_LR1_Main;
+with Ada_Annex_P_Process_Actions;
+with Ada_Annex_P_Process_LR1_Main;
with Gen_Run_Wisi_LR_Text_Rep_Parse;
with WisiToken.Parse.LR.McKenzie_Recover.Ada;
with Wisi.Ada;
procedure Run_Ada_LR1_Parse is new Gen_Run_Wisi_LR_Text_Rep_Parse
(Wisi.Ada.Parse_Data_Type,
- Ada_Process_Actions.Descriptor,
+ Ada_Annex_P_Process_Actions.Descriptor'Access,
+ Ada_Annex_P_Process_Actions.Partial_Parse_Active'Access,
+ Ada_Annex_P_Process_Actions.Partial_Parse_Byte_Goal'Access,
WisiToken.Parse.LR.McKenzie_Recover.Ada.Language_Fixes'Access,
WisiToken.Parse.LR.McKenzie_Recover.Ada.Matching_Begin_Tokens'Access,
WisiToken.Parse.LR.McKenzie_Recover.Ada.String_ID_Set'Access,
- "ada_lr1_parse_table.txt",
- Ada_Process_LR1_Main.Create_Parser);
+ "ada_annex_p_lr1_parse_table.txt",
+ Ada_Annex_P_Process_LR1_Main.Create_Lexer,
+ Ada_Annex_P_Process_LR1_Main.Create_Parse_Table,
+ Ada_Annex_P_Process_LR1_Main.Create_Productions);
diff --git a/run_gpr_parse.ads b/run_gpr_parse.ads
index 216a5b8974..4cf1b932cc 100644
--- a/run_gpr_parse.ads
+++ b/run_gpr_parse.ads
@@ -2,7 +2,7 @@
--
-- Run the gpr parser standalone. Useful for debugging grammar issues.
--
--- Copyright (C) 2017 - 2019 Free Software Foundation, Inc.
+-- Copyright (C) 2017 - 2020, 2022 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or
-- modify it under terms of the GNU General Public License as
@@ -24,8 +24,12 @@ with Gpr_Process_Main;
with Wisi.Gpr;
procedure Run_Gpr_Parse is new Gen_Run_Wisi_LR_Parse
(Wisi.Gpr.Parse_Data_Type,
- Gpr_Process_Actions.Descriptor,
+ Gpr_Process_Actions.Descriptor'Access,
+ Gpr_Process_Actions.Partial_Parse_Active'Access,
+ Gpr_Process_Actions.Partial_Parse_Byte_Goal'Access,
null,
null,
null,
- Gpr_Process_Main.Create_Parser);
+ Gpr_Process_Main.Create_Lexer,
+ Gpr_Process_Main.Create_Parse_Table,
+ Gpr_Process_Main.Create_Productions);
diff --git a/wisi-ada-format_parameter_list.adb
b/wisi-ada-format_parameter_list.adb
index f4957e1e6a..17b1e090ff 100644
--- a/wisi-ada-format_parameter_list.adb
+++ b/wisi-ada-format_parameter_list.adb
@@ -2,7 +2,7 @@
--
--
--
--- Copyright (C) 2019 - 2020 Free Software Foundation, Inc.
+-- Copyright (C) 2019 - 2022 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or
-- modify it under terms of the GNU General Public License as
@@ -21,12 +21,11 @@ pragma License (GPL);
with WisiToken.Syntax_Trees.LR_Utils; use WisiToken.Syntax_Trees.LR_Utils;
separate (Wisi.Ada)
procedure Format_Parameter_List
- (Tree : in out WisiToken.Syntax_Trees.Tree;
- Data : in out Parse_Data_Type;
- Edit_Begin : in WisiToken.Buffer_Pos)
+ (Tree : in out WisiToken.Syntax_Trees.Tree;
+ Edit_Begin_Char : in WisiToken.Buffer_Pos)
is
use Standard.Ada.Containers;
- use Ada_Process_Actions;
+ use Ada_Annex_P_Process_Actions;
use Standard.Ada.Text_IO;
use WisiToken.Syntax_Trees;
@@ -45,9 +44,9 @@ is
Default_Exp : Buffer_Region := Null_Buffer_Region;
end record;
- Formal_Part : constant Node_Index := Find_ID_At (Tree, +formal_part_ID,
Edit_Begin);
+ Formal_Part : constant Node_Access := Find_ID_Containing (Tree, (1 =>
+formal_part_ID), Edit_Begin_Char);
Param_List : constant Constant_List :=
- (if Formal_Part = Invalid_Node_Index
+ (if Formal_Part = Invalid_Node_Access
then Creators.Invalid_List (Tree)
else Creators.Create_List
(Tree,
@@ -55,29 +54,26 @@ is
List_ID => +parameter_specification_list_ID,
Element_ID => +parameter_specification_ID));
- Edit_End : Buffer_Pos;
Param_Count : Count_Type := 0;
function Get_Text (Region : in WisiToken.Buffer_Region) return String
is begin
- return Data.Lexer.Buffer_Text (Region);
+ return Tree.Lexer.Buffer_Text (Region);
end Get_Text;
begin
- if Formal_Part = Invalid_Node_Index then
+ if Formal_Part = Invalid_Node_Access then
-- Most likely the edit point is wrong.
- raise SAL.Parameter_Error with "no parameter list found at byte_pos" &
Edit_Begin'Image;
+ raise SAL.Parameter_Error with "no parameter list found containing
byte_pos" & Edit_Begin_Char'Image;
end if;
if WisiToken.Trace_Action > Detail then
- Put_Line (";; format parameter list node" & Formal_Part'Image);
+ Put_Line (";; format parameter list node " & Tree.Image (Formal_Part,
Node_Numbers => True));
end if;
- Edit_End := Tree.Byte_Region (Formal_Part).Last;
-
-- The last parameter might be empty, due to syntax errors.
for N of Param_List loop
- if not Tree.Buffer_Region_Is_Empty (N) then
+ if not Tree.Is_Empty_Nonterm (N) then
Param_Count := Param_Count + 1;
end if;
end loop;
@@ -86,25 +82,26 @@ begin
Params : array (1 .. Param_Count) of Parameter;
Param_Cur : Cursor := Param_List.First;
Param_Iter : constant Constant_Iterator :=
Param_List.Iterate_Constant;
- First_Param_Node : constant Node_Index := Node (Param_Cur);
- Last_Param_Node : Node_Index;
+ First_Param_Node : constant Node_Access := Element (Param_Cur);
+ Last_Param_Node : Node_Access;
begin
for Param of Params loop
- Last_Param_Node := Node (Param_Cur);
+ Last_Param_Node := Element (Param_Cur);
declare
- Children : constant Valid_Node_Index_Array := Tree.Children (Node
(Param_Cur));
+ Children : constant Node_Access_Array := Tree.Children (Element
(Param_Cur));
begin
- for Ident of Creators.Create_List (Tree, Children (1),
+identifier_list_ID, +IDENTIFIER_ID) loop
- Param.Identifiers.Append (Tree.Byte_Region (Ident));
+ for Ident of Creators.Create_List (Tree, Children (1),
+defining_identifier_list_ID, +IDENTIFIER_ID) loop
+ Param.Identifiers.Append (Tree.Byte_Region (Ident,
Trailing_Non_Grammar => False));
end loop;
- Param.Aliased_P := not Tree.Buffer_Region_Is_Empty (Children (3));
-
- for I in 4 .. Children'Last loop
+ for I in 3 .. Children'Last loop
case To_Token_Enum (Tree.ID (Children (I))) is
- when mode_opt_ID =>
- if Tree.Buffer_Region_Is_Empty (Children (I)) then
+ when ALIASED_ID =>
+ Param.Aliased_P := True;
+
+ when mode_ID =>
+ if Tree.Is_Empty_Nonterm (Children (I)) then
Param.In_P := False;
Param.Out_P := False;
else
@@ -113,44 +110,45 @@ begin
Tree.Children (Children (I))'Length > 1; -- 'in out'
end if;
- when null_exclusion_opt_ID =>
- Param.Not_Null_P := not Tree.Buffer_Region_Is_Empty
(Children (I));
+ when null_exclusion_ID =>
+ Param.Not_Null_P := True;
when name_ID =>
- Param.Type_Region := Tree.Byte_Region (Children (I));
+ Param.Type_Region := Tree.Byte_Region (Children (I),
Trailing_Non_Grammar => False);
when access_definition_ID =>
- -- First two children are always:
- -- null_exclusion_opt ACCESS
declare
- Access_Children : constant Valid_Node_Index_Array :=
Tree.Children (Children (I));
+ use all type SAL.Base_Peek_Type;
+ Access_Children : constant Node_Access_Array :=
Tree.Children (Children (I));
+ Last_Child : SAL.Base_Peek_Type := 1;
begin
- Param.Not_Null_P := not Tree.Buffer_Region_Is_Empty
(Access_Children (1));
- Param.Access_P := True;
+ if Tree.ID (Access_Children (Last_Child)) =
+null_exclusion_ID then
+ Last_Child := @ + 1;
+ Param.Not_Null_P := True;
+ end if;
- if Tree.ID (Access_Children (3)) =
+general_access_modifier_opt_ID then
- Param.Constant_P := not Tree.Buffer_Region_Is_Empty
(Access_Children (3));
- Param.Type_Region := Tree.Byte_Region (Access_Children
(4));
- else
- Param.Protected_P := not Tree.Buffer_Region_Is_Empty
(Access_Children (3));
- Param.Type_Region :=
- (Tree.Byte_Region (Access_Children (4)).First,
- Tree.Byte_Region (Children (I)).Last);
+ pragma Assert (Tree.ID (Access_Children (Last_Child)) =
+ACCESS_ID);
+ Param.Access_P := True;
+ Last_Child := @ + 1;
+
+ if Tree.ID (Access_Children (Last_Child)) = +CONSTANT_ID
then
+ Param.Constant_P := True;
+ Last_Child := @ + 1;
+ elsif Tree.ID (Access_Children (Last_Child)) =
+PROTECTED_ID then
+ Param.Protected_P := True;
+ Last_Child := @ + 1;
end if;
- end;
- when COLON_EQUAL_ID =>
- null;
+ Param.Type_Region :=
+ (Tree.Byte_Region (Access_Children (Last_Child),
Trailing_Non_Grammar => False).First,
+ Tree.Byte_Region (Children (I), Trailing_Non_Grammar
=> False).Last);
+ end;
- when expression_opt_ID =>
- if not Tree.Buffer_Region_Is_Empty (Children (I)) then
- Param.Default_Exp := Tree.Byte_Region (Children (I));
- end if;
+ when assign_value_ID =>
+ Param.Default_Exp := Tree.Byte_Region (Tree.Child (Children
(I), 2), Trailing_Non_Grammar => False);
when others =>
- Raise_Programmer_Error
- ("format_parameter_list param id", Data.Descriptor.all,
Data.Lexer, Tree, Data.Base_Terminals.all,
- Children (I));
+ Raise_Programmer_Error ("unknown format_parameter_list token
id", Tree, Children (I));
end case;
end loop;
end;
@@ -162,7 +160,8 @@ begin
Result : Unbounded_String := +"(";
Line_End : Integer := 0; -- Index of last LF char in
Result.
Multi_Line : constant Boolean :=
- Tree.Augmented (First_Param_Node).Line < Tree.Augmented
(Last_Param_Node).Line;
+ Tree.Line_Region (First_Param_Node, Trailing_Non_Grammar =>
False).First <
+ Tree.Line_Region (Last_Param_Node, Trailing_Non_Grammar =>
False).First;
Ident_Len : Integer := 0; -- Maximum over all params,
includes commas
Type_Len : Integer := 0;
Aliased_P : Boolean := False; -- "_P" for "present"
@@ -203,7 +202,7 @@ begin
end loop;
declare
subtype Count is Standard.Ada.Text_IO.Count;
- Open_Paren_Col : constant Count := Tree.Augmented
(Formal_Part).Column;
+ Open_Paren_Col : constant Count := Tree.Column (Formal_Part);
Ident_Col : constant Count := Open_Paren_Col + 1;
Colon_Col : constant Count := Ident_Col + Count
(Ident_Len) + 1;
In_Col : constant Count := Colon_Col + (if Aliased_P
then 10 else 2);
@@ -227,9 +226,13 @@ begin
(Length (Result) - Line_End)) * ' ';
end Indent_To;
begin
+ if WisiToken.Trace_Action > Detail then
+ Put_Line (";; open_paren_col:" & Open_Paren_Col'Image);
+ end if;
+
for Param of Params loop
if Need_New_Line then
- Result := Result & ";" & ASCII.LF;
+ Result := Result & ";" & Emacs_Lisp_New_Line;
Line_End := Length (Result);
end if;
@@ -310,10 +313,16 @@ begin
Need_New_Line := True;
end loop;
- Result := Result & ")";
+ Result := Result & ")";
end if;
- Put_Line
- ("[" & Edit_Action_Code & Edit_Begin'Image & Edit_End'Image & " """
& Elisp_Escape_Quotes (-Result) & """]");
+ declare
+ Region : constant Buffer_Region := Tree.Char_Region
+ (Formal_Part, Trailing_Non_Grammar => False);
+ begin
+ Put_Line
+ ("[" & Edit_Action_Code & Region.First'Image & Region.Last'Image
&
+ " """ & Elisp_Escape_Quotes (-Result) & """]");
+ end;
end;
end;
end Format_Parameter_List;
diff --git a/wisi-ada.adb b/wisi-ada.adb
index 686df33a3d..eea8a65432 100644
--- a/wisi-ada.adb
+++ b/wisi-ada.adb
@@ -2,7 +2,7 @@
--
-- see spec.
--
--- Copyright (C) 2017 - 2020 Free Software Foundation, Inc.
+-- Copyright (C) 2017 - 2022 Free Software Foundation, Inc.
--
-- This library is free software; you can redistribute it and/or modify it
-- under terms of the GNU General Public License as published by the Free
@@ -13,10 +13,12 @@
pragma License (GPL);
+with Ada.Exceptions;
with Ada.Strings.Fixed;
with Ada.Strings.Unbounded;
with Ada.Text_IO;
-with Ada_Process_Actions; -- token_enum_id
+with Ada_Annex_P_Process_Actions; -- token_enum_id
+with GNAT.Traceback.Symbolic;
package body Wisi.Ada is
use WisiToken;
@@ -24,335 +26,334 @@ package body Wisi.Ada is
-- body local subprograms
function Indent_Record
- (Data : in out Parse_Data_Type;
- Tree : in Syntax_Trees.Tree;
- Anchor_Token : in Augmented_Token;
- Record_Token : in Augmented_Token;
- Indenting_Token : in Augmented_Token;
- Indenting_Comment : in Boolean;
- Offset : in Integer)
+ (Data : in out Parse_Data_Type;
+ Tree : in Syntax_Trees.Tree;
+ Controlling_Token_Line : in Line_Number_Type;
+ Anchor_Token : in Syntax_Trees.Valid_Node_Access;
+ Record_Token : in Syntax_Trees.Valid_Node_Access;
+ Indenting_Token : in Syntax_Trees.Valid_Node_Access;
+ Indenting_Comment : in Boolean;
+ Offset : in Integer)
return Wisi.Delta_Type
is
- use Ada_Process_Actions;
+ use Ada_Annex_P_Process_Actions;
begin
- if not Indenting_Comment and Indenting_Token.ID = +RECORD_ID then
+ if not Indenting_Comment and Tree.ID (Indenting_Token) = +RECORD_ID then
-- Indenting 'record'
return Indent_Anchored_2
- (Data, Anchor_Token.Line, Record_Token.Last_Line
(Indenting_Comment), Ada_Indent_Record_Rel_Type,
- Accumulate => True);
+ (Data, Tree, Anchor_Token, Indenting_Token, Indenting_Comment,
Ada_Indent_Record_Rel_Type);
- elsif Indenting_Comment and Indenting_Token.ID = +WITH_ID then
+ elsif Indenting_Comment and Tree.ID (Indenting_Token) = +WITH_ID then
-- comment before 'record'. test/ada_mode-nominal-child.ads
Child_Type_1
return Indent_Anchored_2
- (Data, Anchor_Token.Line, Indenting_Token.Last_Line
(Indenting_Comment), Ada_Indent_Record_Rel_Type,
- Accumulate => True);
+ (Data, Tree, Anchor_Token, Indenting_Token, Indenting_Comment,
Ada_Indent_Record_Rel_Type);
- elsif Indenting_Comment and Indenting_Token.ID = +IS_ID then
+ elsif Indenting_Comment and Tree.ID (Indenting_Token) = +IS_ID then
-- comment after 'is'
- if Record_Token.ID = +RECORD_ID then
+ if Tree.ID (Record_Token) = +RECORD_ID then
-- before 'record'. test/ada_mode-nominal.ads Record_Type_1
return Indent_Anchored_2
- (Data, Anchor_Token.Line, Indenting_Token.Last_Line
(Indenting_Comment), Ada_Indent_Record_Rel_Type,
- Accumulate => True);
+ (Data, Tree, Anchor_Token, Indenting_Token, Indenting_Comment,
Ada_Indent_Record_Rel_Type);
else
-- not before 'record'. test/ada_mode-nominal-child.ads
Child_Type_1
- return (Simple, (Int, Offset));
+ return (Simple, (Int, Controlling_Token_Line, Offset));
end if;
else
-- Indenting comment after 'record', other comment, component or
'end'
--
- -- Ensure 'record' line is anchored to Anchor_Token.
- if not (Data.Indents (Record_Token.Line).Label = Anchored or
- Data.Indents (Record_Token.Line).Label = Anchor_Anchored)
- then
- if Anchor_Token.Line /= Record_Token.Line then
+ -- Ensure line containing 'record' is anchored to Anchor_Token.
+ if Data.Indents (Tree.Line_Region (Record_Token, Trailing_Non_Grammar
=> True).First).Label /= Anchored then
+ if Tree.Line_Region (Anchor_Token, Trailing_Non_Grammar =>
True).First /=
+ Tree.Line_Region (Record_Token, Trailing_Non_Grammar =>
True).First
+ then
-- We don't pass Indenting_Comment here, because 'record' is
code.
Indent_Token_1
(Data,
Tree,
- Indenting_Token => Record_Token,
- Delta_Indent => Indent_Anchored_2
- (Data,
- Anchor_Token.Line,
- Record_Token.Last_Line
- (Indenting_Comment => False),
- Ada_Indent_Record_Rel_Type,
- Accumulate => True),
- Indenting_Comment => False);
+ Line_Region => Tree.Line_Region (Record_Token,
Trailing_Non_Grammar => False),
+ Delta_Indent => Indent_Anchored_2
+ (Data, Tree, Anchor_Token, Record_Token,
+ Indenting_Comment => False,
+ Offset => Ada_Indent_Record_Rel_Type),
+ Indenting_Comment => None);
end if;
end if;
return Indent_Anchored_2
- (Data,
- Anchor_Line => Anchor_Token.Line,
- Last_Line => Indenting_Token.Last_Line (Indenting_Comment),
- Offset => Current_Indent_Offset
- (Data, Anchor_Token,
- Offset =>
- (if Anchor_Token.Line = Record_Token.Line
- then Offset
- else Offset + Ada_Indent_Record_Rel_Type)),
- Accumulate => True);
+ (Data, Tree, Anchor_Token, Indenting_Token, Indenting_Comment,
Current_Indent_Offset
+ (Tree, Anchor_Token,
+ (if Tree.Line_Region (Anchor_Token, Trailing_Non_Grammar =>
True).First =
+ Tree.Line_Region (Record_Token, Trailing_Non_Grammar =>
True).First
+ then Offset
+ else Offset + Ada_Indent_Record_Rel_Type)));
end if;
end Indent_Record;
----------
-- Refactor body subprograms
- function Find_ID_At
- (Tree : in WisiToken.Syntax_Trees.Tree;
- ID : in Token_ID;
- Edit_Begin : in WisiToken.Buffer_Pos)
- return WisiToken.Node_Index
+ function Find_ID_Containing
+ (Tree : in WisiToken.Syntax_Trees.Tree;
+ IDs : in Token_ID_Array;
+ Edit_Begin_Char : in WisiToken.Buffer_Pos)
+ return WisiToken.Syntax_Trees.Node_Access
is
- function Match (Tree : in Syntax_Trees.Tree; Node : in Valid_Node_Index)
return Boolean
- is (Tree.ID (Node) = ID and then Get_Aug_Token_Const_1 (Tree,
Node).Byte_Region.First = Edit_Begin);
+ use Syntax_Trees;
+ Terminal : constant Node_Access := Tree.Find_Char_Pos
+ (Edit_Begin_Char, After => True, Trailing_Non_Grammar => True);
begin
- return Tree.Find_Descendant (Tree.Root, Predicate => Match'Access);
- end Find_ID_At;
+ return Tree.Find_Ancestor (Terminal, IDs);
+ end Find_ID_Containing;
procedure Unrecognized
- (Expecting : in String;
- Found : in WisiToken.Valid_Node_Index;
- Edit_Begin : in WisiToken.Buffer_Pos)
+ (Expecting : in String;
+ Tree : in WisiToken.Syntax_Trees.Tree;
+ Data : in out Parse_Data_Type;
+ Found : in WisiToken.Syntax_Trees.Valid_Node_Access)
with No_Return
is begin
- raise SAL.Parameter_Error with "unrecognized subprogram call at
byte_pos" & Edit_Begin'Image &
- "; expecting " & Expecting & " found node" & Found'Image;
+ raise SAL.Parameter_Error with "expecting '" & Expecting & "'; found " &
+ Tree.Image (Found, Node_Numbers => True) & " '" & Elisp_Escape_Quotes
(Data.Get_Text (Tree, Found)) & "'";
end Unrecognized;
procedure Method_Object_To_Object_Method
(Tree : in WisiToken.Syntax_Trees.Tree;
Data : in out Parse_Data_Type;
- Edit_Begin : in WisiToken.Buffer_Pos)
+ Edit_Begin_Char : in WisiToken.Buffer_Pos)
+ -- Data.Tree contains one statement or declaration; Edit_Begin_Char
+ -- is the character position at the start of a subprogram call.
+ -- Convert the subprogram call from Prefix.Method (Object, ...) to
+ -- Object.Method (...).
is
- -- Data.Tree contains one statement or declaration; Edit_Begin is at
- -- start of a subprogram call. Convert the subprogram call from
- -- Prefix.Method (Object, ...) to Object.Method (...).
-
- use Ada_Process_Actions;
+ use Ada_Annex_P_Process_Actions;
use Standard.Ada.Strings.Unbounded;
use Standard.Ada.Text_IO;
use WisiToken.Syntax_Trees;
- Call : Node_Index := Find_ID_At (Tree, +name_ID, Edit_Begin);
- Edit_End : WisiToken.Buffer_Pos;
- Method : Valid_Node_Index;
- Temp : Node_Index;
- Association_List : Node_Index;
- Object : Valid_Node_Index;
- Result : Unbounded_String;
+ Call : constant Node_Access := Find_ID_Containing (Tree, (1 =>
+function_call_ID), Edit_Begin_Char);
+
+ Edit_End : WisiToken.Buffer_Pos;
+ Actual_Parameter_Part : Node_Access;
+ Association_List : Node_Access;
+ Method : Node_Access;
+
begin
- if Call = Invalid_Node_Index then
+ if Call = Invalid_Node_Access then
-- Most likely the edit point is wrong.
- raise SAL.Parameter_Error with "no 'name' found at byte_pos" &
Edit_Begin'Image;
- elsif not (Tree.RHS_Index (Call) in 1 | 3) then
- raise SAL.Parameter_Error with "no subprogram call found at byte_pos"
& Edit_Begin'Image &
- " (found node" & Call'Image & ")";
+ raise SAL.Parameter_Error with "no subprogram call found at byte_pos"
& Edit_Begin_Char'Image;
end if;
- if WisiToken.Trace_Action > Detail then
- Put_Line (";; refactoring node" & Call'Image & " '" & Data.Get_Text
(Tree, Call) & "'");
+ if Trace_Action > Detail then
+ Tree.Lexer.Trace.Put_Line
+ ("refactoring node " & Tree.Image (Call, Node_Numbers => True) & "
'" & Data.Get_Text (Tree, Call) & "'");
end if;
- if Tree.RHS_Index (Call) = 3 then
- -- Code looks like: Length (Container)'Old. We only want to edit
- -- 'Length (Container)', keeping the trailing 'Old.
- Call := Tree.Child (Tree.Child (Call, 1), 1);
- end if;
+ Actual_Parameter_Part := Tree.Child (Call, 2);
+ pragma Assert (Tree.ID (Actual_Parameter_Part) =
+actual_parameter_part_ID);
- Association_List := Tree.Child (Tree.Child (Call, 2), 2);
- Edit_End := Tree.Byte_Region (Call).Last;
- Method := Tree.Child (Tree.Child (Call, 1), 1);
- loop
- case To_Token_Enum (Tree.ID (Method)) is
- when selected_component_ID | attribute_reference_ID =>
+ Association_List := Tree.Child (Actual_Parameter_Part, 2);
+ pragma Assert (Tree.ID (Association_List) =
+parameter_association_list_ID);
+
+ Edit_End := Tree.Byte_Region (Call, Trailing_Non_Grammar => False).Last;
+
+ Method := Tree.Child (Tree.Child (Call, 1), 1);
+
+ case To_Token_Enum (Tree.ID (Method)) is
+ when selected_component_ID =>
+ Method := Tree.Child (Method, 3);
+ pragma Assert (Tree.ID (Method) = +selector_name_ID);
+
+ Method := Tree.Child (Method, 1);
+
+ when attribute_reference_ID =>
+ case To_Token_Enum (Tree.ID (Tree.Child (Method, 1))) is
+ when name_ID =>
Method := Tree.Child (Method, 3);
+ pragma Assert (Tree.ID (Method) = +attribute_designator_ID);
- when qualified_expression_ID =>
- Method := Tree.Child (Method, 3); -- aggregate
- if Tree.ID (Tree.Child (Method, 2)) = +association_list_ID then
- Method := Tree.Child (Method, 2);
- if Tree.RHS_Index (Method) = 1 then
- Temp := Tree.Find_Descendant (Tree.Child (Method, 1),
+expression_ID);
- if Temp = Invalid_Node_Index then
- Unrecognized ("expression", Tree.Child (Method, 1),
Edit_Begin);
- else
- Method := Temp;
- exit;
- end if;
- else
- Unrecognized ("association", Method, Edit_Begin);
- end if;
- else
- Unrecognized ("association_list", Method, Edit_Begin);
- end if;
+ Method := Tree.Child (Method, 1);
+
+ when reduction_attribute_reference_ID =>
+ Unrecognized ("subprogram call", Tree, Data, Method);
- when IDENTIFIER_ID | STRING_LITERAL_ID =>
- exit;
when others =>
- Unrecognized ("supported token", Method, Edit_Begin);
+ raise SAL.Programmer_Error with "code does not match grammar";
end case;
- end loop;
- Temp := Tree.Find_Descendant (Association_List, +expression_ID);
- if Temp = Invalid_Node_Index then
- Unrecognized ("expression", Association_List, Edit_Begin);
- else
- Object := Temp;
- end if;
+ when qualified_expression_ID =>
+ raise SAL.Not_Implemented; -- need use case
- -- Build remaining arg list in Result.
- loop
- if Tree.RHS_Index (Association_List) = 0 then
- Result := Get_Text (Data, Tree, Tree.Child (Association_List, 3)) &
- (if Length (Result) = 0 then "" else ", ") &
- Result;
- Association_List := Tree.Child (Association_List, 1);
- else
- -- The remaining element in Association_List is the first one,
which is Object.
- if Length (Result) > 0 then
- Result := " (" & Result & ")";
- end if;
- exit;
+ when direct_name_ID =>
+ Method := Tree.Child (Method, 1);
+
+ when others =>
+ Unrecognized ("supported token", Tree, Data, Method);
+ end case;
+
+ pragma Assert (To_Token_Enum (Tree.ID (Method)) in IDENTIFIER_ID |
STRING_LITERAL_ID);
+
+ declare
+ Object : constant Node_Access := Tree.Find_Descendant
(Association_List, +expression_ID);
+ Result : Unbounded_String;
+ begin
+ if Object = Invalid_Node_Access then
+ Unrecognized ("expression", Tree, Data, Association_List);
end if;
- end loop;
- Result := (Get_Text (Data, Tree, Object) & "." & Get_Text (Data, Tree,
Method)) & Result;
- Put_Line ("[" & Edit_Action_Code & Edit_Begin'Image & Edit_End'Image & "
""" &
- Elisp_Escape_Quotes (To_String (Result)) & """]");
+
+ -- Build remaining arg list in Result.
+ loop
+ if Tree.RHS_Index (Association_List) = 1 then
+ Result := Get_Text (Data, Tree, Tree.Child (Association_List,
3)) &
+ (if Length (Result) = 0 then "" else ", ") &
+ Result;
+ Association_List := Tree.Child (Association_List, 1);
+ else
+ -- The remaining element in Association_List is the first one,
which is Object.
+ if Length (Result) > 0 then
+ Result := " (" & Result & ")";
+ end if;
+ exit;
+ end if;
+ end loop;
+ Result := (Get_Text (Data, Tree, Object) & "." & Get_Text (Data,
Tree, Method)) & Result;
+ Put_Line ("[" & Edit_Action_Code & Edit_Begin_Char'Image &
Edit_End'Image & " """ &
+ Elisp_Escape_Quotes (To_String (Result)) & """]");
+ end;
end Method_Object_To_Object_Method;
procedure Object_Method_To_Method_Object
(Tree : in WisiToken.Syntax_Trees.Tree;
Data : in out Parse_Data_Type;
- Edit_Begin : in WisiToken.Buffer_Pos)
+ Edit_Begin_Char : in WisiToken.Buffer_Pos)
is
- -- Data.Tree contains one statement or declaration; Edit_Begin is at
- -- start of a subprogram call. Convert the subprogram call from
- -- Object.Method (...) to Method (Object, ...).
- use Ada_Process_Actions;
+ -- Data.Tree contains one statement or declaration; Edit_Begin is the
+ -- character position at the start of a subprogram call. Convert the
+ -- subprogram call from Object.Method (...) to Method (Object, ...).
+ use Ada_Annex_P_Process_Actions;
use Standard.Ada.Strings.Unbounded;
- use Standard.Ada.Text_IO;
use WisiToken.Syntax_Trees;
- Call : Node_Index := Find_ID_At (Tree, +name_ID, Edit_Begin);
+ -- ada_mode-refactor_object_method_to_method_object.adb
+ Call : Node_Access := Find_ID_Containing
+ (Tree, (+primary_ID, +procedure_call_statement_ID), Edit_Begin_Char);
Edit_End : WisiToken.Buffer_Pos;
- Object_Method : Valid_Node_Index;
+ Object_Method : Node_Access;
+ Args : Node_Access := Invalid_Node_Access;
Method : Unbounded_String;
Object : Unbounded_String;
Result : Unbounded_String;
begin
- if Call = Invalid_Node_Index then
+ if Call = Invalid_Node_Access then
-- Most likely the edit point is wrong.
- raise SAL.Parameter_Error with "no 'name' at byte_pos" &
Edit_Begin'Image;
- elsif not (Tree.RHS_Index (Call) in 1 | 2 | 3) then
- raise SAL.Parameter_Error with "no subprogram call found at byte_pos"
& Edit_Begin'Image &
- " (found node" & Call'Image & ")";
+ raise SAL.Parameter_Error with "no 'name' at byte_pos" &
Edit_Begin_Char'Image;
end if;
- if WisiToken.Trace_Action > Detail then
- Put_Line (";; refactoring node" & Call'Image & " '" & Data.Get_Text
(Tree, Call) & "'");
+ if Trace_Action > Detail then
+ Tree.Lexer.Trace.Put_Line
+ ("refactoring node " & Tree.Image (Call, Node_Numbers => True) & "
'" & Data.Get_Text (Tree, Call) & "'");
end if;
- if Tree.RHS_Index (Call) = 3 then
+ Call := Tree.Child (Call, 1);
+ pragma Assert (Tree.ID (Call) = +name_ID);
+
+ if Tree.ID (Tree.Child (Call, 1)) = +attribute_reference_ID then
-- Code looks like: Container.Length'Old. We only want to edit
-- 'Container.Length', keeping the trailing 'Old.
Call := Tree.Child (Tree.Child (Call, 1), 1);
end if;
- Edit_End := Tree.Byte_Region (Call).Last;
+ Edit_End := Tree.Byte_Region (Call, Trailing_Non_Grammar =>
False).Last;
Object_Method := Tree.Child (Call, 1);
- loop
- case To_Token_Enum (Tree.ID (Object_Method)) is
- when name_ID =>
- Object_Method := Tree.Child (Object_Method, 1);
-
- when selected_component_ID =>
- Object := +Get_Text (Data, Tree, Tree.Child (Object_Method, 1));
- Method := +Get_Text (Data, Tree, Tree.Child (Object_Method, 3));
- exit;
+ loop
+ case To_Token_Enum (Tree.ID (Object_Method)) is
+ when function_call_ID =>
+ -- Object_Method looks like:
+ -- Object.Method (Args)
+ -- test/ada_mode-refactor_object_method_to_method_object.adb
+ Args := Tree.Child (Tree.Child (Object_Method, 2), 2);
+ pragma Assert (Tree.ID (Args) = +parameter_association_list_ID);
+
+ Object_Method := Tree.Child (Object_Method, 1);
+
+ when name_ID =>
+ Object_Method := Tree.Child (Object_Method, 1);
+
+ when selected_component_ID =>
+ Object := +Get_Text (Data, Tree, Tree.Child (Object_Method, 1));
+ Method := +Get_Text (Data, Tree, Tree.Child (Object_Method, 3));
+ exit;
- when others =>
- Unrecognized ("supported token", Object_Method, Edit_Begin);
- end case;
- end loop;
+ when others =>
+ Unrecognized ("supported token", Tree, Data, Object_Method);
+ end case;
+ end loop;
- Result := Method & " (" & Object;
- if Tree.RHS_Index (Call) = 1 then
- Result := Result & ", " & Get_Text (Data, Tree, Tree.Child
(Tree.Child (Call, 2), 2));
- end if;
- Result := Result & ")";
- Put_Line ("[" & Edit_Action_Code & Edit_Begin'Image & Edit_End'Image
& " """ &
- Elisp_Escape_Quotes (To_String (Result)) & """]");
+ Result := Method & " (" & Object;
+ if Args /= Invalid_Node_Access then
+ Result := Result & ", " & Get_Text (Data, Tree, Args);
+ end if;
+ Result := Result & ")";
+ Standard.Ada.Text_IO.Put_Line
+ ("[" & Edit_Action_Code & Edit_Begin_Char'Image & Edit_End'Image & "
""" &
+ Elisp_Escape_Quotes (To_String (Result)) & """]");
end Object_Method_To_Method_Object;
procedure Element_Object_To_Object_Index
(Tree : in WisiToken.Syntax_Trees.Tree;
Data : in out Parse_Data_Type;
- Edit_Begin : in WisiToken.Buffer_Pos)
+ Edit_Begin_Char : in WisiToken.Buffer_Pos)
+ -- Data.Tree contains one statement or declaration; Edit_Begin_Char
+ -- is the character position at the start of a subprogram call.
+ -- Convert the subprogram call from Prefix.Element (Object, Index) to
+ -- Object (Index).
is
- -- Data.Tree contains one statement or declaration; Edit_Begin is at
- -- start of a subprogram call. Convert the subprogram call from
- -- Prefix.Element (Object, Index) to Object (Index).
-
- use Ada_Process_Actions;
+ use Ada_Annex_P_Process_Actions;
use Standard.Ada.Text_IO;
use WisiToken.Syntax_Trees;
- Call : Node_Index := Find_ID_At (Tree, +name_ID, Edit_Begin);
+ Call : constant Node_Access := Find_ID_Containing (Tree, (1
=> +function_call_ID), Edit_Begin_Char);
Edit_End : WisiToken.Buffer_Pos;
- Temp : Node_Index;
- Association_List : Node_Index;
- Object : Valid_Node_Index;
- Index : Valid_Node_Index;
+ Temp : Node_Access;
+ Association_List : Node_Access;
+ Object : Node_Access;
+ Index : Node_Access;
begin
- if Call = Invalid_Node_Index then
+ if Call = Invalid_Node_Access then
-- Most likely the edit point is wrong.
- raise SAL.Parameter_Error with "no 'name' found at byte_pos" &
Edit_Begin'Image;
- elsif not (Tree.RHS_Index (Call) in 1 | 2 | 3) then
- raise SAL.Parameter_Error with "no subprogram call found at byte_pos"
& Edit_Begin'Image &
- " (found node" & Call'Image & ")";
- end if;
-
- if WisiToken.Trace_Action > Detail then
- Put_Line (";; refactoring node" & Call'Image & " '" & Data.Get_Text
(Tree, Call) & "'");
+ raise SAL.Parameter_Error with "no subprogram call found at byte_pos"
& Edit_Begin_Char'Image;
end if;
- if Tree.RHS_Index (Call) = 2 then
- -- Code looks like: Element (Container, I).Op. We only want to edit
- -- the subprogram call, keeping the trailing .Op.
- Call := Tree.Child (Tree.Child (Call, 1), 1);
-
- elsif Tree.RHS_Index (Call) = 3 then
- -- Code looks like: Element (Container, I)'Old. We only want to edit
- -- the subprogram call, keeping the trailing 'Old.
- Call := Tree.Child (Tree.Child (Call, 1), 1);
+ if Trace_Action > Detail then
+ Tree.Lexer.Trace.Put_Line
+ ("refactoring node " & Tree.Image (Call, Node_Numbers => True) & "
'" & Data.Get_Text (Tree, Call) & "'");
end if;
Association_List := Tree.Child (Tree.Child (Call, 2), 2);
- Edit_End := Tree.Byte_Region (Call).Last;
+ pragma Assert (Tree.ID (Association_List) =
+parameter_association_list_ID);
- if Tree.RHS_Index (Association_List) /= 0 then
- Unrecognized ("two args", Association_List, Edit_Begin);
+ Edit_End := Tree.Byte_Region (Call, Trailing_Non_Grammar => False).Last;
+
+ if Tree.RHS_Index (Association_List) /= 1 then
+ Unrecognized ("two args", Tree, Data, Association_List);
end if;
Temp := Tree.Find_Descendant (Association_List, +expression_ID);
- if Temp = Invalid_Node_Index then
- Unrecognized ("expression", Association_List, Edit_Begin);
+ if Temp = Invalid_Node_Access then
+ Unrecognized ("expression", Tree, Data, Association_List);
else
Object := Temp;
end if;
Temp := Tree.Find_Descendant (Tree.Child (Association_List, 3),
+expression_ID);
- if Temp = Invalid_Node_Index then
- Unrecognized ("expression", Association_List, Edit_Begin);
+ if Temp = Invalid_Node_Access then
+ Unrecognized ("expression", Tree, Data, Association_List);
else
Index := Temp;
end if;
Put_Line
- ("[" & Edit_Action_Code & Edit_Begin'Image & Edit_End'Image & " """ &
+ ("[" & Edit_Action_Code & Edit_Begin_Char'Image & Edit_End'Image & "
""" &
Elisp_Escape_Quotes (Get_Text (Data, Tree, Object) & " (" &
Get_Text (Data, Tree, Index) & ")") &
"""]");
end Element_Object_To_Object_Index;
@@ -360,75 +361,66 @@ package body Wisi.Ada is
procedure Object_Index_To_Element_Object
(Tree : in WisiToken.Syntax_Trees.Tree;
Data : in out Parse_Data_Type;
- Edit_Begin : in WisiToken.Buffer_Pos)
+ Edit_Begin_Char : in WisiToken.Buffer_Pos)
+ -- Data.Tree contains one statement or declaration; Edit_Begin_Char
+ -- is the character position at the start of a subprogram call.
+ -- Convert the subprogram call from Object (Index) to Element
+ -- (Object, Index).
is
- -- Data.Tree contains one statement or declaration; Edit_Begin is at
- -- start of a subprogram call. Convert the subprogram call from
- -- Object (Index) to Element (Object, Index).
-
- use Ada_Process_Actions;
+ use Ada_Annex_P_Process_Actions;
use Standard.Ada.Text_IO;
use WisiToken.Syntax_Trees;
- Call : Node_Index := Find_ID_At (Tree, +name_ID, Edit_Begin);
+ Call : constant Node_Access := Find_ID_Containing (Tree, (1
=> +function_call_ID), Edit_Begin_Char);
Edit_End : WisiToken.Buffer_Pos;
- Temp : Node_Index;
- Association_List : Node_Index;
- Object : Valid_Node_Index;
- Index : Valid_Node_Index;
+ Temp : Node_Access;
+ Association_List : Node_Access;
+ Object : Node_Access;
+ Index : Node_Access;
begin
- if Call = Invalid_Node_Index then
+ if Call = Invalid_Node_Access then
-- Most likely the edit point is wrong.
- raise SAL.Parameter_Error with "no 'name' found at byte_pos" &
Edit_Begin'Image;
- elsif not (Tree.RHS_Index (Call) in 1 | 2 | 3) then
- raise SAL.Parameter_Error with "no subprogram call found at byte_pos"
& Edit_Begin'Image &
- " (found node" & Call'Image & ")";
+ raise SAL.Parameter_Error with "no subprogram_call found at byte_pos"
& Edit_Begin_Char'Image;
end if;
- if WisiToken.Trace_Action > Detail then
- Put_Line (";; refactoring node" & Call'Image & " '" & Data.Get_Text
(Tree, Call) & "'");
+ if Trace_Action > Detail then
+ Tree.Lexer.Trace.Put_Line
+ ("refactoring node " & Tree.Image (Call, Node_Numbers => True) & "
'" & Data.Get_Text (Tree, Call) & "'");
end if;
- if Tree.RHS_Index (Call) = 2 then
- -- Code looks like: Object (I).Component. We only want to edit
- -- the subprogram call, keeping the trailing .Component.
- Call := Tree.Child (Tree.Child (Call, 1), 1);
-
- elsif Tree.RHS_Index (Call) = 3 then
- -- Code looks like: Container (I)'Old. We only want to edit
- -- the subprogram call, keeping the trailing 'Old.
- Call := Tree.Child (Tree.Child (Call, 1), 1);
- end if;
+ Object := Tree.Child (Call, 1);
+ pragma Assert (Tree.ID (Object) = +name_ID);
- Object := Tree.Child (Tree.Child (Call, 1), 1);
Association_List := Tree.Child (Tree.Child (Call, 2), 2);
- Edit_End := Tree.Byte_Region (Call).Last;
+ pragma Assert (Tree.ID (Association_List) =
+parameter_association_list_ID);
- if Tree.RHS_Index (Association_List) /= 1 then
- Unrecognized ("one args", Association_List, Edit_Begin);
+ Edit_End := Tree.Byte_Region (Call, Trailing_Non_Grammar => False).Last;
+
+ if Tree.RHS_Index (Association_List) /= 0 then
+ Unrecognized ("one arg", Tree, Data, Association_List);
end if;
Temp := Tree.Find_Descendant (Tree.Child (Association_List, 1),
+expression_ID);
- if Temp = Invalid_Node_Index then
- Unrecognized ("expression", Association_List, Edit_Begin);
+ if Temp = Invalid_Node_Access then
+ Unrecognized ("expression", Tree, Data, Association_List);
else
Index := Temp;
end if;
Put_Line
- ("[" & Edit_Action_Code & Edit_Begin'Image & Edit_End'Image & " """ &
+ ("[" & Edit_Action_Code & Edit_Begin_Char'Image & Edit_End'Image & "
""" &
Elisp_Escape_Quotes
("Element (" & Get_Text (Data, Tree, Object) & ", " & Get_Text
(Data, Tree, Index) & ")") &
"""]");
end Object_Index_To_Element_Object;
procedure Format_Parameter_List
- (Tree : in out WisiToken.Syntax_Trees.Tree;
- Data : in out Parse_Data_Type;
- Edit_Begin : in WisiToken.Buffer_Pos)
+ (Tree : in out WisiToken.Syntax_Trees.Tree;
+ Edit_Begin_Char : in WisiToken.Buffer_Pos)
is separate;
- -- Data.Tree contains a subprogram declaration or body; Edit_Begin is
- -- at the start of a parameter list. Format the parameter list.
+ -- Tree contains a subprogram declaration or body; Edit_Begin_Char is
+ -- the character position at the start of the parameter list. Format
+ -- the parameter list.
--
-- Handle virtual tokens as much as possible; at least closing paren.
@@ -436,33 +428,37 @@ package body Wisi.Ada is
-- Public subprograms, declaration order
overriding
- procedure Initialize
- (Data : in out Parse_Data_Type;
- Lexer : in WisiToken.Lexer.Handle;
- Descriptor : access constant WisiToken.Descriptor;
- Base_Terminals : in WisiToken.Base_Token_Array_Access;
- Post_Parse_Action : in Post_Parse_Action_Type;
- Begin_Line : in WisiToken.Line_Number_Type;
- End_Line : in WisiToken.Line_Number_Type;
- Begin_Indent : in Integer;
- Params : in String)
+ procedure Initialize (Data : in out Parse_Data_Type)
is
- use Standard.Ada.Strings.Fixed;
- use all type Ada_Process_Actions.Token_Enum_ID;
- First : Integer := Params'First;
- Last : Integer := Index (Params, " ");
+ use all type Ada_Annex_P_Process_Actions.Token_Enum_ID;
begin
- Wisi.Initialize
- (Wisi.Parse_Data_Type (Data), Lexer, Descriptor, Base_Terminals,
Post_Parse_Action, Begin_Line, End_Line,
- Begin_Indent, "");
-
Data.First_Comment_ID := +COMMENT_ID;
Data.Last_Comment_ID := WisiToken.Invalid_Token_ID;
Data.Left_Paren_ID := +LEFT_PAREN_ID;
Data.Right_Paren_ID := +RIGHT_PAREN_ID;
- Data.Embedded_Quote_Escape_Doubled := True;
+ -- All nonterms in compilation_unit, basic_declarative_item for
+ -- package specs, wisitoken_accept for point in leading/trailing
+ -- comments.
+ Data.Statement_IDs.Append (+compilation_unit_ID);
+ Data.Statement_IDs.Append (+with_clause_ID);
+ Data.Statement_IDs.Append (+declarative_item_ID);
+ Data.Statement_IDs.Append (+statement_ID);
+ Data.Statement_IDs.Append (+subunit_ID);
+ Data.Statement_IDs.Append (+basic_declarative_item_ID);
+ Data.Statement_IDs.Append (+wisitoken_accept_ID);
+ -- not entry_declaration; only needed with partial parse
+ end Initialize;
+ overriding
+ procedure Parse_Language_Params
+ (Data : in out Parse_Data_Type;
+ Params : in String)
+ is
+ use Standard.Ada.Strings.Fixed;
+ First : Integer := Params'First;
+ Last : Integer := Index (Params, " ");
+ begin
if Params /= "" then
Ada_Indent := Integer'Value (Params (First .. Last - 1));
@@ -507,374 +503,480 @@ package body Wisi.Ada is
Ada_Indent_With := Integer'Value (Params (First .. Last - 1));
First := Last + 1;
- Last := First + 1;
- Ada_Indent_Hanging_Rel_Exp := Params (First) = '1';
+ Last := Index (Params, " ", First);
+ Ada_Indent_Subprogram_Is := Integer'Value (Params (First .. Last -
1));
First := Last + 1;
Last := First + 1;
End_Names_Optional := Params (First) = '1';
+ else
+ Ada_Indent := Ada_Indent_Default;
+ Ada_Indent_Broken := Ada_Indent_Broken_Default;
+ Ada_Indent_Comment_Col_0 := Ada_Indent_Comment_Col_0_Default;
+ Ada_Indent_Comment_GNAT := Ada_Indent_Comment_GNAT_Default;
+ Ada_Indent_Label := Ada_Indent_Label_Default;
+ Ada_Indent_Record_Rel_Type := Ada_Indent_Record_Rel_Type_Default;
+ Ada_Indent_Renames := Ada_Indent_Renames_Default;
+ Ada_Indent_Return := Ada_Indent_Return_Default;
+ Ada_Indent_Use := Ada_Indent_Use_Default;
+ Ada_Indent_When := Ada_Indent_When_Default;
+ Ada_Indent_With := Ada_Indent_With_Default;
+ Ada_Indent_Subprogram_Is := Ada_Indent_Subprogram_Is_Default;
+ End_Names_Optional := End_Names_Optional_Default;
end if;
Data.Indent_Comment_Col_0 := Ada_Indent_Comment_Col_0;
- end Initialize;
+ end Parse_Language_Params;
- overriding function Insert_After
- (User_Data : in out Parse_Data_Type;
- Tree : in WisiToken.Syntax_Trees.Tree'Class;
- Token : in WisiToken.Valid_Node_Index;
- Insert_On_Blank_Line : in Boolean)
- return Boolean
+ overriding
+ function Get_Token_IDs
+ (User_Data : in Parse_Data_Type;
+ Command_Line : in String;
+ Last : in out Integer)
+ return WisiToken.Token_ID_Arrays.Vector
is
pragma Unreferenced (User_Data);
- use Ada_Process_Actions;
-
- -- We return True if Token affects indent (ie it is a block boundary)
- -- and normally has no code following it on the same line.
- --
- -- 'end' is not really an exception, it is normally followed by
- -- <name> and ';', but no more code. Except when indenting a blank
- -- line; see test/ada_mode-interactive_2.adb Record_1.
- --
- -- RIGHT_PAREN is an exception; it is often followed by more code,
- -- but clearly belongs on the same line as the preceding token (often
- -- other ')').
- --
- -- COLON is similar to RIGHT_PAREN.
+ use Ada_Annex_P_Process_Actions;
+ begin
+ return IDs : WisiToken.Token_ID_Arrays.Vector do
+ Wisi.Skip (Command_Line, Last, '(');
+ loop
+ IDs.Append (+Token_Enum_ID'Value (Wisi.Get_Enum (Command_Line,
Last)));
+ Wisi.Skip (Command_Line, Last, ' ');
+ exit when Command_Line (Last + 1) = ')';
+ end loop;
+ Last := Last + 1;
+ end return;
+ end Get_Token_IDs;
- ID : constant Token_ID := Tree.ID (Token);
+ overriding function Insert_After
+ (User_Data : in out Parse_Data_Type;
+ Tree : in WisiToken.Syntax_Trees.Tree'Class;
+ Insert_Token : in WisiToken.Syntax_Trees.Valid_Node_Access;
+ Insert_Before_Token : in WisiToken.Syntax_Trees.Valid_Node_Access;
+ Comment_Present : in Boolean;
+ Blank_Line_Present : in Boolean)
+ return WisiToken.Insert_Location
+ is
+ pragma Unreferenced (User_Data);
+ use Ada_Annex_P_Process_Actions;
+
+ Insert_ID : constant Token_Enum_ID := To_Token_Enum (Tree.ID
(Insert_Token));
+ Insert_Before_ID : constant Token_Enum_ID := To_Token_Enum (Tree.ID
(Insert_Before_Token));
+
+ After_End : constant array (Token_Enum_ID) of Boolean :=
+ -- Terminals that appear after 'end', other than ';'.
+ (
+ CASE_ID |
+ DO_ID |
+ IDENTIFIER_ID |
+ IF_ID |
+ LOOP_ID |
+ RECORD_ID |
+ RETURN_ID |
+ SELECT_ID => True,
+ others => False);
- Result : constant array (Ada_Process_Actions.Token_Enum_ID) of Boolean :=
- (BEGIN_ID | -- test/ada_mode-recover_exception_1.adb,
test/ada_mode-recover_extra_declare.adb
- COLON_ID | -- test/ada_mode-recover_partial_22.adb
+ After_Comment : constant array (Token_Enum_ID) of Insert_Location :=
+ (
+ ABORT_ID |
+ ACCEPT_ID |
+ BEGIN_ID |
+ CASE_ID |
DECLARE_ID |
- RIGHT_PAREN_ID | -- test/ada_mode-recover_20.adb
- SEMICOLON_ID | -- test/ada_mode-recover_13.adb
- THEN_ID -- test/ada_mode-recover_19
- => True,
- others => False);
+ DELAY_ID |
+ ELSE_ID |
+ ELSIF_ID |
+ ENTRY_ID |
+ EXCEPTION_ID |
+ EXIT_ID |
+ FOR_ID |
+ FUNCTION_ID |
+ GENERIC_ID |
+ GOTO_ID |
+ IF_ID |
+ LOOP_ID |
+ OVERRIDING_ID |
+ PRAGMA_ID |
+ PROCEDURE_ID |
+ RAISE_ID |
+ REQUEUE_ID |
+ SELECT_ID |
+ TYPE_ID |
+ WHILE_ID => After_Prev,
+ others => Before_Next);
begin
- case To_Token_Enum (ID) is
- when CASE_ID | IF_ID | LOOP_ID | RECORD_ID | RETURN_ID | SELECT_ID =>
- return -Tree.ID (Tree.Prev_Terminal (Token)) = END_ID;
+ if After_End (Insert_ID) and then -Tree.ID (Tree.Prev_Terminal
(Insert_Token)) = END_ID then
+ return After_Prev;
+ end if;
- when END_ID =>
- -- test/ada_mode-recover_20.adb, test/ada_mode-interactive_2.adb
Record_1.
- return not Insert_On_Blank_Line;
+ case Insert_Before_ID is
+ when ELSE_ID | END_ID | IS_ID | WHEN_ID =>
+ case Insert_ID is
+ when END_ID =>
+ -- Ending a block of statements. The desired result depends on
what
+ -- the user is doing, and what indent is begin computed (if any).
+ --
+ -- If continuing the block of statements and indenting a blank
line,
+ -- the 'end' should be placed after the indent line; before_next.
+ --
+ -- If indenting a block of code, keep the indent of the existing
+ -- 'end'; between or after_prev.
+ --
+ -- We don't know why the parse is being done, nor what lines are
+ -- being indented; we use the presence of a blank line and
comment to
+ -- hint at that, and we bias towards continuing a block of
+ -- statements, not inserting 'end'.
+ --
+ -- If there is a blank line followed by comments, we assume that
+ -- means we are not adding code on the blank line.
+ --
+ -- If there is a blank line not followed by comments, we assume
that
+ -- means we are adding code on the blank line.
+
+ -- Before ELSE_ID:
+ -- test/ada_mode-recover_27.adb
+ -- first 'else'
+ --
+ -- Before END_ID:
+ -- test/ada_mode-interactive_02 New_Line_2,
+ -- actually inserting 'end if;' before 'end case;'
+ -- blank line present => assume continuing code for 'if' body
+ -- => insert before 'end case;' => before_next.
+ --
+ -- test/ada_mode-recover_06.adb
+ -- actually inserting 'end;'
+ -- blank line and comment present; assume extending code for
block body
+ -- => insert on blank line => between
+ --
+ -- test/ada_mode-recover_08.adb
+ -- no blank line or comment; keep correct indent for existing
'end' => after_prev.
+ --
+ -- test/ada_mode-recover_17.adb
+ -- inserting missing 'end if;', but assume extending code
+ -- comment present, no blank line; keep correct indent for
existing 'end' => between
+ --
+ -- test/ada_mode-recover_repair_1.adb
+ -- deleted 'end if;', inserting 'end loop;'
+ -- comment followed by blank line; between.
+ --
+ -- Before IS_ID : test/ada_mode-recover_incremental_01.adb insert
"Float"
+ -- no blank line or comment
+ -- 'is' should be first. => after_prev
+ --
+ -- Before WHEN_ID : test/ada_mode-recover_34.adb
+ -- completing 'if'; keep existing indent of 'when' =>
after_prev
+ if Comment_Present then
+ return Between;
+ else
+ if Blank_Line_Present then
+ return Before_Next;
+ else
+ return After_Prev;
+ end if;
+ end if;
- when IDENTIFIER_ID =>
- return -Tree.ID (Tree.Prev_Terminal (Token)) in END_ID | COLON_ID;
+ when others =>
+ -- Before END_ID :
+ -- test/ada_mode-recover_10.adb,
+ -- test/ada_mode-recover_37.adb,
+ -- put trailing 'end' in correct column
+ --
+ -- test/ada_mode-recover_41.adb
+ -- insert on blank line; continue previous code
+ if Blank_Line_Present then
+ return Between;
+ else
+ return After_Prev;
+ end if;
+ end case;
- when others =>
- return Result (-ID);
- end case;
- end Insert_After;
+ when RETURN_ID =>
+ -- Before RETURN_ID : test/ada_mode-recover_16.adb
+ -- There is never code before 'return'. => after_prev
+ return After_Prev;
- overriding
- function Indent_Hanging_1
- (Data : in out Parse_Data_Type;
- Tree : in Syntax_Trees.Tree;
- Tokens : in Valid_Node_Index_Array;
- Tree_Indenting : in Valid_Node_Index;
- Indenting_Comment : in Boolean;
- Delta_1 : in Simple_Indent_Param;
- Delta_2 : in Simple_Indent_Param;
- Option : in Boolean;
- Accumulate : in Boolean)
- return Delta_Type
- is
- Indenting_Token : Aug_Token_Const_Ref renames Get_Aug_Token_Const_1
(Tree, Tree_Indenting);
-
- function Result (Delta_1 : in Simple_Indent_Param; Delta_2 : in
Simple_Delta_Type) return Delta_Type
- is begin
- return
- (Hanging,
- Hanging_First_Line => Indenting_Token.Line,
- Hanging_Paren_State => Indenting_Token.Paren_State,
- Hanging_Delta_1 => Indent_Compute_Delta
- (Data, Tree, Tokens, (Simple, Delta_1), Tree_Indenting,
Indenting_Comment).Simple_Delta,
- Hanging_Delta_2 => Delta_2,
- Hanging_Accumulate => Accumulate);
- end Result;
-
- function Result (Delta_1 : in Simple_Delta_Type) return Delta_Type
- is begin
- return
- (Hanging,
- Hanging_First_Line => Indenting_Token.Line,
- Hanging_Paren_State => Indenting_Token.Paren_State,
- Hanging_Delta_1 => Delta_1,
- Hanging_Delta_2 => Delta_1,
- Hanging_Accumulate => Accumulate);
- end Result;
-
- function Comment_Result (D : in Simple_Indent_Param) return Delta_Type
- is begin
- return Indent_Compute_Delta
- (Data, Tree, Tokens, (Simple, D), Tree_Indenting, Indenting_Comment
=> False);
- end Comment_Result;
-
- use Ada_Process_Actions;
- begin
- if Tree.ID (Tree.Parent (Tree_Indenting)) = +association_opt_ID and then
- Invalid_Node_Index /= Tree.Find_Ancestor (Tree_Indenting,
+aspect_specification_opt_ID)
- then
- -- In aspect_specification_opt
- -- See ada.wy association_opt for test cases
- if not Indenting_Comment then
- return Result
- (Delta_1,
- Indent_Anchored_2
- (Data, Indenting_Token.Line, Indenting_Token.Last_Indent_Line,
- Current_Indent_Offset (Data, Indenting_Token, 0),
- Accumulate => False).Simple_Delta);
- else
- -- Test case in test/aspects.ads
- return Result
- (Indent_Compute_Delta
- (Data, Tree, Tokens, (Simple, Delta_1), Tree_Indenting,
Indenting_Comment).Simple_Delta);
- end if;
+ when others =>
+ case Insert_ID is
+ when BEGIN_ID | DO_ID | ELSE_ID | GREATER_EQUAL_ID | LOOP_ID | IS_ID
| THEN_ID =>
+ -- Starting a block of statements
+ if Blank_Line_Present then
+ -- Assume editing; this and next token should start new line.
+ return Between;
+ else
+ -- Next token should start new line.
+ return After_Prev;
+ end if;
- elsif Ada_Indent_Hanging_Rel_Exp then
- declare
- New_Delta_2 : constant Simple_Delta_Type := Indent_Anchored_2
- (Data, Indenting_Token.Line, Indenting_Token.Last_Indent_Line,
- Current_Indent_Offset (Data, Indenting_Token,
Ada_Indent_Broken),
- Accumulate => False).Simple_Delta;
- begin
- if not Option or Indenting_Token.Line =
Indenting_Token.First_Indent_Line then
- return Result (Delta_1, New_Delta_2);
+ when SEMICOLON_ID =>
+ -- test/ada_mode-interactive_2.adb A := B \n+C; on blank line:
extending code => between | before_next
+ -- test/ada_mode-recover_03.adb after 'renames', _13.adb not on
blank line: after_prev
+ -- test/ada_mode-recover_30.adb before 'if', blank line present:
between
+ -- test/ada_mode-recover_36.adb after 'function Update\n
comments': before_next
+ --
+ -- test/ada_mode-recover_07.adb after 'loop' on blank line:
after_prev | Between,
+ if Blank_Line_Present then
+ return Between;
else
- return Result (New_Delta_2);
+ return After_Prev;
end if;
- end;
- elsif Indenting_Comment then
- -- Use delta for last line of Indenting_Token.
- -- Test cases in test/ada_mode-parens.adb Hello
- declare
- First_Terminal : Aug_Token_Const_Ref renames Get_Aug_Token_Const_1
- (Tree, Tree.First_Terminal (Tree_Indenting));
- begin
- if Option then
- -- Test cases with "Item => ..."
- if First_Terminal.First then
- if Indenting_Token.First_Indent_Line =
Indenting_Token.Last_Indent_Line then
- return Comment_Result (Delta_1);
- else
- return Comment_Result (Delta_2);
- end if;
- else
- if Indenting_Token.First_Indent_Line = Invalid_Line_Number
then
- return Comment_Result ((Int, 0));
- else
- return Comment_Result (Delta_1);
- end if;
- end if;
+ when others =>
+ if Blank_Line_Present then
+ -- Assume editing; continue previous code
+ return Before_Next;
+
+ elsif Comment_Present then
+ -- Don't continue previous code
+ return After_Comment (Insert_ID);
else
- if First_Terminal.First then
- if Indenting_Token.First_Indent_Line =
Indenting_Token.Last_Indent_Line then
- return Comment_Result (Delta_1);
- else
- return Comment_Result (Delta_2);
- end if;
- else
- if Indenting_Token.First_Indent_Line = Invalid_Line_Number
then
- -- Comment is after first line in token
- return Comment_Result (Delta_1);
- else
- return Comment_Result (Delta_2);
- end if;
- end if;
+ case Insert_ID is
+ when END_ID =>
+ -- test/ada_mode-recover_20.adb,
+ -- test/ada_mode-interactive_2.adb Record_1.
+ return Before_Next;
+
+ when IDENTIFIER_ID | NUMERIC_LITERAL_ID =>
+ -- test/ada_mode-recover_03.adb after 'renames'; completing
an expression: true.
+ -- Starting a procedure call or assignment statement: false
+ return
+ (if -Tree.ID (Tree.Prev_Terminal (Insert_Token)) /=
SEMICOLON_ID
+ then After_Prev
+ else Before_Next);
+
+ when BEGIN_ID | -- test/ada_mode-recover_exception_1.adb,
test/ada_mode-recover_extra_declare.adb
+ COLON_ID | -- test/ada_mode-recover_partial_22.adb
+ DECLARE_ID |
+ RIGHT_PAREN_ID | -- test/ada_mode-recover_20.adb
+ THEN_ID -- test/ada_mode-recover_19
+ =>
+ return After_Prev;
+
+ when others =>
+ return Before_Next;
+
+ end case;
end if;
- end;
-
- elsif not Option or Indenting_Token.Line =
Indenting_Token.First_Indent_Line then
- return Result
- (Delta_1,
- Indent_Compute_Delta
- (Data, Tree, Tokens, (Simple, Delta_2), Tree_Indenting,
Indenting_Comment).Simple_Delta);
+ end case;
+ end case;
+ end Insert_After;
- else
- return Result
- (Indent_Compute_Delta
- (Data, Tree, Tokens, (Simple, Delta_1), Tree_Indenting,
Indenting_Comment).Simple_Delta);
- end if;
- end Indent_Hanging_1;
+ overriding
+ procedure Refactor_Help (Data : in Parse_Data_Type)
+ is
+ use Standard.Ada.Text_IO;
+ begin
+ -- Must match "ada-refactor-*" in ada-core.el, Refactor_Label position
number
+ Put ("0 Method_Object_To_Object_Method");
+ Put ("1 Object_Method_To_Method_Object");
+ Put ("2 Element_Object_To_Object_Index");
+ Put ("3 Object_Index_To_Element_Object");
+ Put ("4 Format_Parameter_List ");
+ end Refactor_Help;
overriding
procedure Refactor
- (Data : in out Parse_Data_Type;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Action : in Positive;
- Edit_Begin : in WisiToken.Buffer_Pos)
+ (Data : in out Parse_Data_Type;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Action : in Refactor_Action;
+ Edit_Begin_Char : in WisiToken.Buffer_Pos)
is
- -- Must match "ada-refactor-*" in ada-wisi.el
- Method_Object_To_Object_Method : constant Positive := 1;
- Object_Method_To_Method_Object : constant Positive := 2;
- Element_Object_To_Object_Index : constant Positive := 3;
- Object_Index_To_Element_Object : constant Positive := 4;
- Format_Parameter_List : constant Positive := 5;
-
+ Enum_Action : Refactor_Label;
begin
- if WisiToken.Trace_Action > Detail then
- Tree.Print_Tree (Data.Descriptor.all);
+ begin
+ Enum_Action := Refactor_Label'Val (Action);
+ exception
+ when Constraint_Error =>
+ Standard.Ada.Text_IO.Put_Line ("(error ""unrecognized refactor action
'" & Action'Image & "'"")");
+ return;
+ end;
+
+ if Trace_Action > Detail then
+ Tree.Lexer.Trace.Put_Line (Tree.Image (Children => True));
end if;
- case Action is
+ case Enum_Action is
when Method_Object_To_Object_Method =>
- Wisi.Ada.Method_Object_To_Object_Method (Tree, Data, Edit_Begin);
+ Wisi.Ada.Method_Object_To_Object_Method (Tree, Data, Edit_Begin_Char);
when Object_Method_To_Method_Object =>
- Wisi.Ada.Object_Method_To_Method_Object (Tree, Data, Edit_Begin);
+ Wisi.Ada.Object_Method_To_Method_Object (Tree, Data, Edit_Begin_Char);
when Element_Object_To_Object_Index =>
- Wisi.Ada.Element_Object_To_Object_Index (Tree, Data, Edit_Begin);
+ Wisi.Ada.Element_Object_To_Object_Index (Tree, Data, Edit_Begin_Char);
when Object_Index_To_Element_Object =>
- Wisi.Ada.Object_Index_To_Element_Object (Tree, Data, Edit_Begin);
+ Wisi.Ada.Object_Index_To_Element_Object (Tree, Data, Edit_Begin_Char);
when Format_Parameter_List =>
- Wisi.Ada.Format_Parameter_List (Tree, Data, Edit_Begin);
-
- when others =>
- Standard.Ada.Text_IO.Put_Line ("(error ""unrecognized refactor action
" & Action'Image & """)");
+ Wisi.Ada.Format_Parameter_List (Tree, Edit_Begin_Char);
end case;
+ exception
+ when E : others =>
+ if Debug_Mode then
+ Tree.Lexer.Trace.Put_Line
+ (Standard.Ada.Exceptions.Exception_Name (E) & ": " &
Standard.Ada.Exceptions.Exception_Message (E));
+ Tree.Lexer.Trace.Put_Line (GNAT.Traceback.Symbolic.Symbolic_Traceback
(E));
+ Tree.Lexer.Trace.New_Line;
+ end if;
+ raise;
end Refactor;
function Ada_Indent_Aggregate
(Data : in out Wisi.Parse_Data_Type'Class;
Tree : in Syntax_Trees.Tree;
- Tokens : in Valid_Node_Index_Array;
- Tree_Indenting : in Valid_Node_Index;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access;
+ Indenting_Token : in Syntax_Trees.Valid_Node_Access;
Indenting_Comment : in Boolean;
Args : in Wisi.Indent_Arg_Arrays.Vector)
return Wisi.Delta_Type
is
+ pragma Unreferenced (Nonterm);
pragma Unreferenced (Data);
pragma Unreferenced (Indenting_Comment);
pragma Unreferenced (Args);
- pragma Unreferenced (Tokens);
- use Ada_Process_Actions;
+ use Ada_Annex_P_Process_Actions;
+ use Syntax_Trees;
-- In our grammar, 'aggregate' can be an Ada aggregate, or a
-- parenthesized expression.
--
- -- We always want an 'aggregate' to be indented by ada-indent-broken.
- -- However, in some places in the grammar, 'aggregate' is indented by
- -- ada-indent. The following checks for those places, and returns a
- -- correction value. The aggregate may be nested inside a conidtional
- -- expression, so we search for 'name' as well; see
+ -- We always want an 'aggregate' that begins an expression to be
+ -- indented by ada-indent-broken. However, in some places in the
+ -- grammar, 'aggregate' is indented by ada-indent. The following
+ -- checks for those places, and returns a correction value. The
+ -- aggregate may be nested inside a conditional expression, so we
+ -- search for 'name' as well; see
-- test/ada_mode-conditional_expressions-more_1.adb.
- Expression : constant Node_Index := Tree.Find_Ancestor (Tree_Indenting,
(+expression_opt_ID, +name_ID));
+ pragma Assert (Tree.ID (Indenting_Token) = +aggregate_ID);
+
+ Expression : constant Node_Access := Tree.Find_Ancestor
(Indenting_Token, (+expression_ID, +name_ID));
begin
- if Expression = Invalid_Node_Index or else
- Tree.Parent (Expression) = Invalid_Node_Index
+ if Expression = Invalid_Node_Access or else
+ Tree.Parent (Expression) = Invalid_Node_Access
then
return Null_Delta;
elsif Tree.ID (Tree.Parent (Expression)) in +if_expression_ID |
+elsif_expression_item_ID |
+case_expression_alternative_ID
then
- -- The controlling boolean expression in 'if_expression' and
- -- 'elsif_expression_item' cannot be an aggregate in legal Ada
- -- syntax.
- return (Simple, (Int, Ada_Indent_Broken - Ada_Indent));
+ -- test/ada_mode-conditional_expressions.adb K; value expression in
+ -- if_expression is indented by ada-indent.
+ --
+ -- test/ada_mode-conditional_expressions.adb M1 nested "(case C";
+ -- value expression in case_expression-alternative is indented by
+ -- ada-indent. But this aggregate does not start the value
expression.
+ declare
+ List : constant Node_Access := Tree.Find_Ancestor
(Indenting_Token, +term_binary_adding_operator_list_ID);
+ begin
+ if Tree.RHS_Index (List) = 0 then
+ -- Aggregate starts expression
+ return (Simple, (Int, Invalid_Line_Number, Ada_Indent_Broken -
Ada_Indent));
+ else
+ return Null_Delta;
+ end if;
+ end;
+
else
return Null_Delta;
end if;
end Ada_Indent_Aggregate;
+ function Ada_Indent_Aspect
+ (Data : in out Wisi.Parse_Data_Type'Class;
+ Tree : in Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access;
+ Indenting_Token : in Syntax_Trees.Valid_Node_Access;
+ Indenting_Comment : in Boolean;
+ Args : in Wisi.Indent_Arg_Arrays.Vector)
+ return Delta_Type
+ is
+ pragma Unreferenced (Nonterm, Args);
+
+ use Ada_Annex_P_Process_Actions;
+
+ pragma Assert (Tree.ID (Indenting_Token) = +aspect_definition_ID);
+
+ Indenting : constant Wisi.Indenting :=
Compute_Indenting (Data, Tree, Indenting_Token);
+ Anchor_Token : constant Syntax_Trees.Valid_Node_Access := Tree.Child
(Tree.Parent (Indenting_Token), 2);
+ begin
+ if Tree.Line_Region (Indenting_Token, Trailing_Non_Grammar =>
True).First = Indenting.Code.First then
+ -- aspect_definition starts a line; anchor the aspect_definition to
+ -- the line containing '=>' with offset ada_indent_broken.
+ return Indent_Anchored_2 (Data, Tree, Anchor_Token, Indenting_Token,
Indenting_Comment, Ada_Indent_Broken);
+ else
+ -- aspect_definition starts on same line as '=>'; anchor the
aspect_definition to '=>' with offset 3
+ return Indent_Anchored_2
+ (Data, Tree, Anchor_Token, Indenting_Token, Indenting_Comment,
+ Current_Indent_Offset (Tree, Anchor_Token, 3));
+ end if;
+ end Ada_Indent_Aspect;
+
function Ada_Indent_Renames_0
(Data : in out Wisi.Parse_Data_Type'Class;
Tree : in Syntax_Trees.Tree;
- Tokens : in Valid_Node_Index_Array;
- Tree_Indenting : in Valid_Node_Index;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access;
+ Indenting_Token : in Syntax_Trees.Valid_Node_Access;
Indenting_Comment : in Boolean;
Args : in Indent_Arg_Arrays.Vector)
return Wisi.Delta_Type
is
- Subp_Node : constant Valid_Node_Index := Tokens (Positive_Index_Type
(Integer'(Args (1))));
- Subp_Tok : Aug_Token_Const_Ref renames Get_Aug_Token_Const_1 (Tree,
Subp_Node);
- Renames_Tok : Aug_Token_Const_Ref renames Get_Aug_Token_Const_1 (Tree,
Tree_Indenting);
- Paren_I : Node_Index;
- begin
- Paren_I := Tree.Find_Descendant (Subp_Node, Data.Left_Paren_ID);
+ Subp_Node : constant Syntax_Trees.Valid_Node_Access := Tree.Child
+ (Nonterm, Positive_Index_Type (Integer'(Args (1))));
- if Paren_I /= Invalid_Node_Index then
+ Paren_I : constant Syntax_Trees.Node_Access := Tree.Find_Descendant
(Subp_Node, Data.Left_Paren_ID);
+ begin
+ if Paren_I /= Syntax_Trees.Invalid_Node_Access then
-- paren is present
if Ada_Indent_Renames > 0 then
- return Indent_Anchored_2
- (Data,
- Anchor_Line => Subp_Tok.Line,
- Last_Line => Renames_Tok.Last_Line (Indenting_Comment),
- Offset => Ada_Indent_Renames,
- Accumulate => True);
+ return Indent_Anchored_2 (Data, Tree, Subp_Node, Indenting_Token,
Indenting_Comment, Ada_Indent_Renames);
else
- declare
- Paren_Tok : Aug_Token_Const_Ref renames Get_Aug_Token_Const_1
(Tree, Paren_I);
- begin
- return Indent_Anchored_2
- (Data,
- Anchor_Line => Paren_Tok.Line,
- Last_Line => Renames_Tok.Last_Line (Indenting_Comment),
- Offset => Current_Indent_Offset (Data, Paren_Tok, abs
Ada_Indent_Renames),
- Accumulate => True);
- end;
+ return Indent_Anchored_2
+ (Data, Tree, Paren_I, Indenting_Token, Indenting_Comment,
Current_Indent_Offset
+ (Tree, Paren_I, abs Ada_Indent_Renames));
end if;
else
- return Indent_Anchored_2
- (Data,
- Anchor_Line => Subp_Tok.Line,
- Last_Line => Renames_Tok.Last_Line (Indenting_Comment),
- Offset => Ada_Indent_Broken,
- Accumulate => True);
+ return Indent_Anchored_2 (Data, Tree, Subp_Node, Indenting_Token,
Indenting_Comment, Ada_Indent_Broken);
end if;
end Ada_Indent_Renames_0;
function Ada_Indent_Return_0
(Data : in out Wisi.Parse_Data_Type'Class;
Tree : in Syntax_Trees.Tree;
- Tokens : in Valid_Node_Index_Array;
- Tree_Indenting : in Valid_Node_Index;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access;
+ Indenting_Token : in Syntax_Trees.Valid_Node_Access;
Indenting_Comment : in Boolean;
Args : in Wisi.Indent_Arg_Arrays.Vector)
return Wisi.Delta_Type
is
- use all type Ada_Process_Actions.Token_Enum_ID;
- -- Tokens (Args (1)) = 'formal_part'
- -- Indenting = 'result_profile'
+ use all type Ada_Annex_P_Process_Actions.Token_Enum_ID;
+ -- tree.child (Nonterm, Args (1)) = 'formal_part'
+ -- Indenting_Token = 'result_profile'
-- Args (2) = delta (= 0!)
--
-- We are indenting 'result_profile' in
-- 'parameter_and_result_profile'. The indent depends on whether the
-- 'formal_part' is present, and the location of 'FUNCTION'.
- Parameter_And_Result_Profile : constant Valid_Node_Index := Tree.Parent
(Tree_Indenting);
+ Parameter_And_Result_Profile : constant Syntax_Trees.Valid_Node_Access
:= Tree.Parent (Indenting_Token);
- Indenting : Aug_Token_Const_Ref renames Get_Aug_Token_Const_1 (Tree,
Tree_Indenting);
+ Indenting : constant Wisi.Indenting := Compute_Indenting (Data, Tree,
Indenting_Token);
begin
- if Indenting.Line = Indenting.First_Indent_Line then
+ if Tree.Line_Region (Indenting_Token, Trailing_Non_Grammar =>
True).First = Indenting.Code.First then
if Ada_Indent_Return <= 0 then
declare
- Anchor_Token : Aug_Token_Const_Ref renames Get_Aug_Token_Const_1
- (Tree, Tokens (Positive_Index_Type (Integer'(Args (1)))));
+ Anchor_Token : constant Syntax_Trees.Valid_Node_Access :=
+ Tree.Child (Nonterm, Positive_Index_Type (Integer'(Args
(1))));
begin
return Indent_Anchored_2
- (Data,
- Anchor_Line => Anchor_Token.Line,
- Last_Line => Indenting.Last_Line (Indenting_Comment),
- Offset => Current_Indent_Offset (Data, Anchor_Token,
Args (2) + abs Ada_Indent_Return),
- Accumulate => True);
+ (Data, Tree, Anchor_Token, Indenting_Token, Indenting_Comment,
+ Current_Indent_Offset (Tree, Anchor_Token, Args (2) + abs
Ada_Indent_Return));
end;
else
declare
- Function_N : constant Valid_Node_Index := Tree.Find_Sibling
+ Anchor_Token : constant Syntax_Trees.Valid_Node_Access :=
Tree.Find_Sibling
(Parameter_And_Result_Profile, +FUNCTION_ID);
- Anchor_Token : Aug_Token_Const_Ref renames
Get_Aug_Token_Const_1 (Tree, Function_N);
begin
return Indent_Anchored_2
- (Data,
- Anchor_Line => Anchor_Token.Line,
- Last_Line => Indenting.Last_Line (Indenting_Comment),
- Offset => Current_Indent_Offset (Data, Anchor_Token,
Args (2) + abs Ada_Indent_Return),
- Accumulate => True);
+ (Data, Tree, Anchor_Token, Indenting_Token, Indenting_Comment,
+ Current_Indent_Offset (Tree, Anchor_Token, Args (2) + abs
Ada_Indent_Return));
end;
end if;
@@ -886,8 +988,8 @@ package body Wisi.Ada is
function Ada_Indent_Record_0
(Data : in out Wisi.Parse_Data_Type'Class;
Tree : in Syntax_Trees.Tree;
- Tokens : in Valid_Node_Index_Array;
- Tree_Indenting : in Valid_Node_Index;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access;
+ Indenting_Token : in Syntax_Trees.Valid_Node_Access;
Indenting_Comment : in Boolean;
Args : in Wisi.Indent_Arg_Arrays.Vector)
return Wisi.Delta_Type
@@ -895,18 +997,19 @@ package body Wisi.Ada is
return Indent_Record
(Parse_Data_Type (Data),
Tree,
- Anchor_Token => Get_Aug_Token_Const_1 (Tree, Tokens
(Positive_Index_Type (Integer'(Args (1))))),
- Record_Token => Get_Aug_Token_Const_1 (Tree, Tokens
(Positive_Index_Type (Integer'(Args (2))))),
- Offset => Args (3),
- Indenting_Token => Get_Aug_Token_Const_1 (Tree, Tree_Indenting),
- Indenting_Comment => Indenting_Comment);
+ Tree.Line_Region (Nonterm, Trailing_Non_Grammar => True).First,
+ Anchor_Token => Tree.Child (Nonterm, Positive_Index_Type
(Integer'(Args (1)))),
+ Record_Token => Tree.Child (Nonterm, Positive_Index_Type
(Integer'(Args (2)))),
+ Indenting_Token => Indenting_Token,
+ Indenting_Comment => Indenting_Comment,
+ Offset => Args (3));
end Ada_Indent_Record_0;
function Ada_Indent_Record_1
(Data : in out Wisi.Parse_Data_Type'Class;
Tree : in Syntax_Trees.Tree;
- Tokens : in Valid_Node_Index_Array;
- Tree_Indenting : in Valid_Node_Index;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access;
+ Indenting_Token : in Syntax_Trees.Valid_Node_Access;
Indenting_Comment : in Boolean;
Args : in Wisi.Indent_Arg_Arrays.Vector)
return Wisi.Delta_Type
@@ -919,29 +1022,31 @@ package body Wisi.Ada is
-- full_type_declaration. If record_representation_clause, args (1)
-- is FOR, child of record_representation_clause.
- use Ada_Process_Actions;
+ use Ada_Annex_P_Process_Actions;
Anchor : constant Token_ID := Token_ID (Integer'(Args (1)));
- Declaration : constant Valid_Node_Index := Tree.Find_Ancestor
- (Tree_Indenting,
+ Declaration : constant Syntax_Trees.Valid_Node_Access :=
Tree.Find_Ancestor
+ (Indenting_Token,
(if To_Token_Enum (Anchor) = TYPE_ID
then +full_type_declaration_ID
else +record_representation_clause_ID));
- Tree_Anchor : constant Valid_Node_Index := Tree.Find_Child (Declaration,
Anchor);
+ Tree_Anchor : constant Syntax_Trees.Valid_Node_Access := Tree.Find_Child
(Declaration, Anchor);
- -- Args (2) is the index of RECORD (or a nonterminal possibly
- -- starting with RECORD) in Tokens
- Record_Token_Tree_Index : constant Node_Index := Tokens
(Positive_Index_Type (Integer'(Args (2))));
+ -- Args (2) is the child index of RECORD (or a nonterminal possibly
+ -- starting with RECORD) in Nonterm
+ Record_Token : constant Syntax_Trees.Node_Access := Tree.Child
+ (Nonterm, Positive_Index_Type (Integer'(Args (2))));
begin
-- Args (3) is the offset
return Indent_Record
(Parse_Data_Type (Data),
Tree,
- Anchor_Token => Get_Aug_Token_Const_1 (Tree, Tree_Anchor),
- Record_Token => Get_Aug_Token_Const_1 (Tree, Tree.First_Terminal
(Record_Token_Tree_Index)),
- Indenting_Token => Get_Aug_Token_Const_1 (Tree, Tree_Indenting),
+ Tree.Line_Region (Nonterm, Trailing_Non_Grammar => True).First,
+ Anchor_Token => Tree_Anchor,
+ Record_Token => Tree.First_Terminal (Record_Token),
+ Indenting_Token => Indenting_Token,
Indenting_Comment => Indenting_Comment,
Offset => Args (3));
end Ada_Indent_Record_1;
diff --git a/wisi-ada.ads b/wisi-ada.ads
index 5e0ba50879..0a30bdc562 100644
--- a/wisi-ada.ads
+++ b/wisi-ada.ads
@@ -2,10 +2,9 @@
--
-- Ada language specific indent options and functions
--
--- [1] ada.wy
-- [2] ada-indent-user-options.el
--
--- Copyright (C) 2017 - 2020 Free Software Foundation, Inc.
+-- Copyright (C) 2017 - 2022 Free Software Foundation, Inc.
--
-- This library is free software; you can redistribute it and/or modify it
-- under terms of the GNU General Public License as published by the Free
@@ -22,135 +21,179 @@ pragma License (Modified_GPL);
package Wisi.Ada is
- Language_Protocol_Version : constant String := "3";
+ Language_Protocol_Version : constant String := "4";
-- Defines the data passed to Initialize in Params.
--
-- This value must match ada-mode.el
-- ada-wisi-language-protocol-version.
--
-- Only changes once per ada-mode release. Increment as soon as
- -- required, record new version in NEWS-ada-mode.text.
+ -- required, record new version in NEWS.
-- Indent parameters from [2]
- Ada_Indent : Integer := 3;
- Ada_Indent_Broken : Integer := 2;
- Ada_Indent_Comment_Col_0 : Boolean := False;
- Ada_Indent_Comment_GNAT : Boolean := False;
- Ada_Indent_Label : Integer := -3;
- Ada_Indent_Record_Rel_Type : Integer := 3;
- Ada_Indent_Renames : Integer := 2;
- Ada_Indent_Return : Integer := 0;
- Ada_Indent_Use : Integer := 2;
- Ada_Indent_When : Integer := 3;
- Ada_Indent_With : Integer := 2;
- Ada_Indent_Hanging_Rel_Exp : Boolean := False;
+ Ada_Indent_Default : constant Integer := 3;
+ Ada_Indent : Integer := Ada_Indent_Default;
+
+ Ada_Indent_Broken_Default : constant Integer := 2;
+ Ada_Indent_Broken : Integer := Ada_Indent_Broken_Default;
+
+ Ada_Indent_Comment_Col_0_Default : constant Boolean := False;
+ Ada_Indent_Comment_Col_0 : Boolean :=
Ada_Indent_Comment_Col_0_Default;
+
+ Ada_Indent_Comment_GNAT_Default : constant Boolean := False;
+ Ada_Indent_Comment_GNAT : Boolean :=
Ada_Indent_Comment_GNAT_Default;
+
+ Ada_Indent_Label_Default : constant Integer := -3;
+ Ada_Indent_Label : Integer := Ada_Indent_Label_Default;
+
+ Ada_Indent_Record_Rel_Type_Default : constant Integer := 3;
+ Ada_Indent_Record_Rel_Type : Integer :=
Ada_Indent_Record_Rel_Type_Default;
+
+ Ada_Indent_Renames_Default : constant Integer := 2;
+ Ada_Indent_Renames : Integer := Ada_Indent_Renames_Default;
+
+ Ada_Indent_Return_Default : constant Integer := 0;
+ Ada_Indent_Return : Integer := Ada_Indent_Return_Default;
+
+ Ada_Indent_Use_Default : constant Integer := 2;
+ Ada_Indent_Use : Integer := Ada_Indent_Use_Default;
+
+ Ada_Indent_When_Default : constant Integer := 3;
+ Ada_Indent_When : Integer := Ada_Indent_When_Default;
+
+ Ada_Indent_With_Default : constant Integer := 2;
+ Ada_Indent_With : Integer := Ada_Indent_With_Default;
+
+ -- ada-indent-after-trailing-comment is implemented in elisp
+
+ Ada_Indent_Subprogram_Is_Default : constant Integer := 2;
+ Ada_Indent_Subprogram_Is : Integer :=
Ada_Indent_Subprogram_Is_Default;
-- Other parameters
- End_Names_Optional : Boolean := False;
+ End_Names_Optional_Default : constant Boolean := True;
+ End_Names_Optional : Boolean := End_Names_Optional_Default;
type Parse_Data_Type is new Wisi.Parse_Data_Type with null record;
overriding
- procedure Initialize
- (Data : in out Parse_Data_Type;
- Lexer : in WisiToken.Lexer.Handle;
- Descriptor : access constant WisiToken.Descriptor;
- Base_Terminals : in WisiToken.Base_Token_Array_Access;
- Post_Parse_Action : in Post_Parse_Action_Type;
- Begin_Line : in WisiToken.Line_Number_Type;
- End_Line : in WisiToken.Line_Number_Type;
- Begin_Indent : in Integer;
- Params : in String);
- -- Call Wisi_Runtime.Initialize, then:
- --
- -- If Params /= "", set all language-specific parameters from Params,
- -- in declaration order; otherwise keep default values. Boolean is
- -- represented by 0 | 1. Parameter values are space delimited.
- --
- -- Also do any other initialization that Data needs.
+ function New_User_Data (Template : in Parse_Data_Type) return
WisiToken.Syntax_Trees.User_Data_Access
+ is (new Parse_Data_Type);
+
+ overriding
+ procedure Initialize (Data : in out Parse_Data_Type);
+
+ overriding
+ procedure Parse_Language_Params
+ (Data : in out Parse_Data_Type;
+ Params : in String);
overriding
function Insert_After
- (User_Data : in out Parse_Data_Type;
- Tree : in WisiToken.Syntax_Trees.Tree'Class;
- Token : in WisiToken.Valid_Node_Index;
- Insert_On_Blank_Line : in Boolean)
- return Boolean;
+ (User_Data : in out Parse_Data_Type;
+ Tree : in WisiToken.Syntax_Trees.Tree'Class;
+ Insert_Token : in WisiToken.Syntax_Trees.Valid_Node_Access;
+ Insert_Before_Token : in WisiToken.Syntax_Trees.Valid_Node_Access;
+ Comment_Present : in Boolean;
+ Blank_Line_Present : in Boolean)
+ return WisiToken.Insert_Location;
+
+ -- Must match "ada-refactor-*" in ada-core.el
+ type Refactor_Label is
+ (Method_Object_To_Object_Method, -- 0
+ Object_Method_To_Method_Object, -- 1
+ Element_Object_To_Object_Index, -- 2
+ Object_Index_To_Element_Object, -- 3
+ Format_Parameter_List); -- 4
overriding
- function Indent_Hanging_1
- (Data : in out Parse_Data_Type;
- Tree : in WisiToken.Syntax_Trees.Tree;
- Tokens : in WisiToken.Valid_Node_Index_Array;
- Tree_Indenting : in WisiToken.Valid_Node_Index;
- Indenting_Comment : in Boolean;
- Delta_1 : in Simple_Indent_Param;
- Delta_2 : in Simple_Indent_Param;
- Option : in Boolean;
- Accumulate : in Boolean)
- return Delta_Type;
+ function Refactor_Parse (Data : in Parse_Data_Type; Item : in String)
return Refactor_Action
+ is (Refactor_Action (Refactor_Label'Pos (Refactor_Label'Value (Item))));
+
+ overriding
+ procedure Refactor_Help (Data : in Parse_Data_Type);
overriding
procedure Refactor
- (Data : in out Parse_Data_Type;
- Tree : in out WisiToken.Syntax_Trees.Tree;
- Action : in Positive;
- Edit_Begin : in WisiToken.Buffer_Pos);
+ (Data : in out Parse_Data_Type;
+ Tree : in out WisiToken.Syntax_Trees.Tree;
+ Action : in Refactor_Action;
+ Edit_Begin_Char : in WisiToken.Buffer_Pos);
+
+ overriding
+ function Get_Token_IDs
+ (User_Data : in Parse_Data_Type;
+ Command_Line : in String;
+ Last : in out Integer)
+ return WisiToken.Token_ID_Arrays.Vector;
----------
-- The following are declared in ada.wy %elisp_indent, and must match
- -- Language_Indent_Function.
+ -- Wisi.Language_Indent_Function.
function Ada_Indent_Aggregate
(Data : in out Wisi.Parse_Data_Type'Class;
Tree : in WisiToken.Syntax_Trees.Tree;
- Tokens : in WisiToken.Valid_Node_Index_Array;
- Tree_Indenting : in WisiToken.Valid_Node_Index;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access;
+ Indenting_Token : in WisiToken.Syntax_Trees.Valid_Node_Access;
Indenting_Comment : in Boolean;
Args : in Wisi.Indent_Arg_Arrays.Vector)
return Wisi.Delta_Type;
- -- [1] ada-indent-aggregate
+ -- ada-indent-aggregate
+ -- Args: none
+
+ function Ada_Indent_Aspect
+ (Data : in out Wisi.Parse_Data_Type'Class;
+ Tree : in WisiToken.Syntax_Trees.Tree;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access;
+ Indenting_Token : in WisiToken.Syntax_Trees.Valid_Node_Access;
+ Indenting_Comment : in Boolean;
+ Args : in Wisi.Indent_Arg_Arrays.Vector)
+ return Delta_Type;
+ -- ada-indent-aspect
+ -- Args: none
function Ada_Indent_Renames_0
(Data : in out Wisi.Parse_Data_Type'Class;
Tree : in WisiToken.Syntax_Trees.Tree;
- Tokens : in WisiToken.Valid_Node_Index_Array;
- Tree_Indenting : in WisiToken.Valid_Node_Index;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access;
+ Indenting_Token : in WisiToken.Syntax_Trees.Valid_Node_Access;
Indenting_Comment : in Boolean;
Args : in Wisi.Indent_Arg_Arrays.Vector)
return Wisi.Delta_Type;
- -- [1] ada-indent-renames
+ -- ada-indent-renames
+ -- Args: subprogram_token_index
function Ada_Indent_Return_0
(Data : in out Wisi.Parse_Data_Type'Class;
Tree : in WisiToken.Syntax_Trees.Tree;
- Tokens : in WisiToken.Valid_Node_Index_Array;
- Tree_Indenting : in WisiToken.Valid_Node_Index;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access;
+ Indenting_Token : in WisiToken.Syntax_Trees.Valid_Node_Access;
Indenting_Comment : in Boolean;
Args : in Wisi.Indent_Arg_Arrays.Vector)
return Wisi.Delta_Type;
- -- [1] ada-indent-return
+ -- ada-indent-return
+ -- Args: formal_part_token_index, offset
function Ada_Indent_Record_0
(Data : in out Wisi.Parse_Data_Type'Class;
Tree : in WisiToken.Syntax_Trees.Tree;
- Tokens : in WisiToken.Valid_Node_Index_Array;
- Tree_Indenting : in WisiToken.Valid_Node_Index;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access;
+ Indenting_Token : in WisiToken.Syntax_Trees.Valid_Node_Access;
Indenting_Comment : in Boolean;
Args : in Wisi.Indent_Arg_Arrays.Vector)
return Wisi.Delta_Type;
- -- [1] ada-indent-record
+ -- ada-indent-record
-- Args: anchor_token_index, record_token_index, offset
function Ada_Indent_Record_1
(Data : in out Wisi.Parse_Data_Type'Class;
Tree : in WisiToken.Syntax_Trees.Tree;
- Tokens : in WisiToken.Valid_Node_Index_Array;
- Tree_Indenting : in WisiToken.Valid_Node_Index;
+ Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Access;
+ Indenting_Token : in WisiToken.Syntax_Trees.Valid_Node_Access;
Indenting_Comment : in Boolean;
Args : in Wisi.Indent_Arg_Arrays.Vector)
return Wisi.Delta_Type;
- -- [1] ada-indent-record*
+ -- ada-indent-record*
-- Args: anchor_token_ID, record_token_index, offset
end Wisi.Ada;
diff --git a/wisi-gpr.adb b/wisi-gpr.adb
index 70071145ce..e8113dc0c4 100644
--- a/wisi-gpr.adb
+++ b/wisi-gpr.adb
@@ -2,7 +2,7 @@
--
-- See spec
--
--- Copyright (C) 2017 - 2019 Free Software Foundation, Inc.
+-- Copyright (C) 2017 - 2022 Free Software Foundation, Inc.
--
-- This library is free software; you can redistribute it and/or modify it
-- under terms of the GNU General Public License as published by the Free
@@ -22,31 +22,26 @@ with Gpr_Process_Actions;
package body Wisi.Gpr is
overriding
- procedure Initialize
- (Data : in out Parse_Data_Type;
- Lexer : in WisiToken.Lexer.Handle;
- Descriptor : access constant WisiToken.Descriptor;
- Base_Terminals : in WisiToken.Base_Token_Array_Access;
- Post_Parse_Action : in Post_Parse_Action_Type;
- Begin_Line : in WisiToken.Line_Number_Type;
- End_Line : in WisiToken.Line_Number_Type;
- Begin_Indent : in Integer;
- Params : in String)
+ procedure Initialize (Data : in out Parse_Data_Type)
is
- use Ada.Strings.Fixed;
use all type Gpr_Process_Actions.Token_Enum_ID;
- First : Integer := Params'First;
- Last : Integer := Index (Params, " ");
begin
- Wisi.Initialize
- (Wisi.Parse_Data_Type (Data), Lexer, Descriptor, Base_Terminals,
Post_Parse_Action, Begin_Line, End_Line,
- Begin_Indent, "");
-
Data.First_Comment_ID := +COMMENT_ID;
Data.Last_Comment_ID := WisiToken.Invalid_Token_ID;
Data.Left_Paren_ID := WisiToken.Invalid_Token_ID;
Data.Right_Paren_ID := WisiToken.Invalid_Token_ID;
+ end Initialize;
+ overriding
+ procedure Parse_Language_Params
+ (Data : in out Parse_Data_Type;
+ Params : in String)
+ is
+ pragma Unreferenced (Data);
+ use Ada.Strings.Fixed;
+ First : Integer := Params'First;
+ Last : Integer := Index (Params, " ");
+ begin
if Params /= "" then
-- must match [1] wisi-parse-format-language-options
Gpr_Indent := Integer'Value (Params (First .. Last - 1));
@@ -58,6 +53,27 @@ package body Wisi.Gpr is
First := Last + 1;
Gpr_Indent_When := Integer'Value (Params (First .. Params'Last));
end if;
- end Initialize;
+ end Parse_Language_Params;
+
+ overriding
+ function Get_Token_IDs
+ (User_Data : in Parse_Data_Type;
+ Command_Line : in String;
+ Last : in out Integer)
+ return WisiToken.Token_ID_Arrays.Vector
+ is
+ pragma Unreferenced (User_Data);
+ use Gpr_Process_Actions;
+ begin
+ return IDs : WisiToken.Token_ID_Arrays.Vector do
+ Wisi.Skip (Command_Line, Last, '(');
+ loop
+ IDs.Append (+Token_Enum_ID'Value (Wisi.Get_Enum (Command_Line,
Last)));
+ Wisi.Skip (Command_Line, Last, ' ');
+ exit when Command_Line (Last + 1) = ')';
+ end loop;
+ Last := Last + 1;
+ end return;
+ end Get_Token_IDs;
end Wisi.Gpr;
diff --git a/wisi-gpr.ads b/wisi-gpr.ads
index f3ef299a5a..8e402375f6 100644
--- a/wisi-gpr.ads
+++ b/wisi-gpr.ads
@@ -5,7 +5,7 @@
-- [1] gpr-wisi.el
-- [2] gpr-indent-user-options.el
--
--- Copyright (C) 2017 - 2019 Free Software Foundation, Inc.
+-- Copyright (C) 2017 - 2022 Free Software Foundation, Inc.
--
-- This library is free software; you can redistribute it and/or modify it
-- under terms of the GNU General Public License as published by the Free
@@ -39,22 +39,22 @@ package Wisi.Gpr is
type Parse_Data_Type is new Wisi.Parse_Data_Type with null record;
overriding
- procedure Initialize
- (Data : in out Parse_Data_Type;
- Lexer : in WisiToken.Lexer.Handle;
- Descriptor : access constant WisiToken.Descriptor;
- Base_Terminals : in WisiToken.Base_Token_Array_Access;
- Post_Parse_Action : in Post_Parse_Action_Type;
- Begin_Line : in WisiToken.Line_Number_Type;
- End_Line : in WisiToken.Line_Number_Type;
- Begin_Indent : in Integer;
- Params : in String);
- -- Call Wisi_Runtime.Initialize, then:
- --
- -- If Params /= "", set all indent parameters from Params, in
- -- declaration order; otherwise keep default values. Boolean is
- -- represented by 0 | 1. Parameter values are space delimited.
- --
- -- Also do any other initialization that Gpr_Data needs.
+ function New_User_Data (Template : in Parse_Data_Type) return
WisiToken.Syntax_Trees.User_Data_Access
+ is (new Parse_Data_Type);
+
+ overriding
+ procedure Initialize (Data : in out Parse_Data_Type);
+
+ overriding
+ procedure Parse_Language_Params
+ (Data : in out Parse_Data_Type;
+ Params : in String);
+
+ overriding
+ function Get_Token_IDs
+ (User_Data : in Parse_Data_Type;
+ Command_Line : in String;
+ Last : in out Integer)
+ return WisiToken.Token_ID_Arrays.Vector;
end Wisi.Gpr;
diff --git a/wisitoken-parse-lr-mckenzie_recover-ada.adb
b/wisitoken-parse-lr-mckenzie_recover-ada.adb
index 406b6c163e..4769c7aca2 100644
--- a/wisitoken-parse-lr-mckenzie_recover-ada.adb
+++ b/wisitoken-parse-lr-mckenzie_recover-ada.adb
@@ -2,7 +2,7 @@
--
-- see spec.
--
--- Copyright (C) 2018 - 2020 Free Software Foundation, Inc.
+-- Copyright (C) 2018 - 2022 Free Software Foundation, Inc.
--
-- This library is free software; you can redistribute it and/or modify it
-- under terms of the GNU General Public License as published by the Free
@@ -17,15 +17,15 @@
pragma License (Modified_GPL);
-with Ada.Exceptions;
-with Ada_Process_Actions;
-with System.Assertions;
+with Ada_Annex_P_Process_Actions;
+with WisiToken.Parse.LR.McKenzie_Recover.Base;
+with WisiToken.Parse.LR.McKenzie_Recover.Parse;
package body WisiToken.Parse.LR.McKenzie_Recover.Ada is
- use all type Ada_Process_Actions.Token_Enum_ID; -- token names
- use all type Semantic_Checks.Check_Status_Label;
+ use Ada_Annex_P_Process_Actions; -- token names, To_Token_Enum
+ use all type Syntax_Trees.In_Parse_Actions.Status_Label;
- Descriptor : WisiToken.Descriptor renames Ada_Process_Actions.Descriptor;
+ Descriptor : WisiToken.Descriptor renames
Ada_Annex_P_Process_Actions.Descriptor;
subtype Grammar_Token_ID_Set is WisiToken.Token_ID_Set
(Descriptor.First_Terminal .. Descriptor.Last_Nonterminal);
subtype Terminal_Token_ID_Set is WisiToken.Token_ID_Set
(Descriptor.First_Terminal .. Descriptor.Last_Terminal);
@@ -43,10 +43,10 @@ package body WisiToken.Parse.LR.McKenzie_Recover.Ada is
-- protected_body IDENTIFIER identifier_opt
-- protected_type_declaration IDENTIFIER
protected_definition
-- single_protected_declaration IDENTIFIER
protected_definition
- -- single_task_declaration IDENTIFIER identifier_opt
+ -- single_task_declaration IDENTIFIER task_definition
-- subprogram_body subprogram_specification name_opt
-- task_body IDENTIFIER identifier_opt
- -- task_type_declaration IDENTIFIER identifier_opt
+ -- task_type_declaration IDENTIFIER task_definition
No_Statements_Nonterm_IDs : constant Grammar_Token_ID_Set := To_Token_ID_Set
-- Nonterms that cannot contain a handled_sequence_of_statements
@@ -60,29 +60,34 @@ package body WisiToken.Parse.LR.McKenzie_Recover.Ada is
(Descriptor.First_Terminal, Descriptor.Last_Terminal,
+CASE_ID & (+IF_ID) & (+LOOP_ID) & (+RECORD_ID) & (+RETURN_ID) &
(+SELECT_ID));
- procedure Handle_Check_Fail
- (Trace : in out WisiToken.Trace'Class;
- Lexer : access constant WisiToken.Lexer.Instance'Class;
- Parser_Label : in Natural;
- Parse_Table : in WisiToken.Parse.LR.Parse_Table;
- Terminals : in Base_Token_Arrays.Vector;
- Tree : in Syntax_Trees.Tree;
- Local_Config_Heap : in out Config_Heaps.Heap_Type;
- Config : in Configuration)
- with Pre => Config.Check_Status.Label /= Ok
+ procedure Handle_In_Parse_Action_Fail
+ (Super : in out
WisiToken.Parse.LR.McKenzie_Recover.Base.Supervisor;
+ Shared_Parser : in out Parser.Parser;
+ Parser_Index : in SAL.Peek_Type;
+
+ Local_Config_Heap : in out Config_Heaps.Heap_Type;
+ Config : in Configuration)
+ with Pre => Config.In_Parse_Action_Status.Label /= Ok
is
+ use Syntax_Trees;
+
+ Tree : Syntax_Trees.Tree renames Shared_Parser.Tree;
+ Parse_Table : WisiToken.Parse.LR.Parse_Table renames
Shared_Parser.Table.all;
+ Parser_Label : constant Syntax_Trees.Stream_ID := Super.Stream
(Parser_Index);
+
procedure Put (Message : in String; Config : in Configuration)
is begin
- Put (Message, Trace, Parser_Label, Terminals, Config);
+ Put (Message, Tree, Parser_Label, Config);
end Put;
- End_Name_Token : Recover_Token renames Config.Check_Status.End_Name;
+ End_Name_Token : constant Recover_Token := Recover_Stacks.Peek
+ (Config.Stack, Config.In_Parse_Action_Token_Count -
Config.In_Parse_Action_Status.End_Name + 1).Token;
begin
-- There is a top level exception handler in McKenzie_Recover; the
-- user has no way to work around an exception. If we are trying to
-- fix a particular use case, the trace messages will be enough.
- case Config.Check_Status.Label is
+ case Config.In_Parse_Action_Status.Label is
when Ok =>
raise SAL.Programmer_Error;
@@ -108,7 +113,7 @@ package body WisiToken.Parse.LR.McKenzie_Recover.Ada is
-- matched <bad_begin_name_token> with <end_name_token>.
--
-- The fix is to insert one or more 'end ;' before <end_name_token>.
- -- See test_mckenzie_recover.adb Block_Match_Names_1, Extra_Name_2.
+ -- See test/ada_mode-recover_match_names.adb Package_Body_1
procedure A.
--
-- 2. The mismatch indicates a missing block start. The input looks
like:
--
@@ -136,16 +141,16 @@ package body WisiToken.Parse.LR.McKenzie_Recover.Ada is
-- This case doesn't use Tree, and it can handle some virtual tokens.
declare
- End_Name : constant String := Lexer.Buffer_Text
(End_Name_Token.Name);
+ End_Name : constant String := Tree.Lexer.Buffer_Text (Tree.Name
(End_Name_Token));
Matching_Name_Index : SAL.Peek_Type := 3; -- start search before
<end_name_token>
begin
- Find_Matching_Name (Config, Lexer, End_Name, Matching_Name_Index,
Case_Insensitive => True);
+ Find_Matching_Name (Config, Tree, End_Name, Matching_Name_Index,
Case_Insensitive => True);
if Matching_Name_Index = Config.Stack.Depth then
-- case 0 or 2.
- if Ada_Process_Actions.Token_Enum_ID'(-Config.Error_Token.ID) in
+ if To_Token_Enum (Tree.Element_ID (Config.Error_Token)) in
protected_body_ID | protected_type_declaration_ID |
single_protected_declaration_ID | single_task_declaration_ID
then
@@ -161,55 +166,77 @@ package body WisiToken.Parse.LR.McKenzie_Recover.Ada is
New_Config.Strategy_Counts (Language_Fix) :=
New_Config.Strategy_Counts (Language_Fix) + 1;
- New_Config.Error_Token.ID := Invalid_Token_ID;
- New_Config.Check_Status := (Label => Ok);
+ New_Config.Error_Token := (True, Invalid_Token_ID, others =>
<>);
+
+ New_Config.In_Parse_Action_Status := (Label => Ok);
- case
Ada_Process_Actions.Token_Enum_ID'(-Config.Error_Token.ID) is
+ case To_Token_Enum (Tree.Element_ID (Config.Error_Token)) is
when block_statement_ID =>
- Push_Back_Check (New_Config, (+SEMICOLON_ID,
+identifier_opt_ID, +END_ID));
- Insert (New_Config, +BEGIN_ID);
+ Push_Back_Check
+ (Super, Shared_Parser, New_Config,
+ (+SEMICOLON_ID, +identifier_opt_ID, +END_ID),
+ Push_Back_Undo_Reduce => True);
+ Insert (Super, Shared_Parser, New_Config, +BEGIN_ID);
when entry_body_ID =>
Push_Back_Check
- (New_Config,
- (+SEMICOLON_ID, +name_opt_ID, +END_ID,
+handled_sequence_of_statements_ID));
- Insert (New_Config, +BEGIN_ID);
+ (Super, Shared_Parser, New_Config,
+ (+SEMICOLON_ID, +name_opt_ID, +END_ID,
+handled_sequence_of_statements_ID),
+ Push_Back_Undo_Reduce => True);
+ Insert (Super, Shared_Parser, New_Config, +BEGIN_ID);
when loop_statement_ID =>
Push_Back_Check
- (New_Config,
- (+SEMICOLON_ID, +identifier_opt_ID, +LOOP_ID,
+END_ID));
- Insert (New_Config, +LOOP_ID);
+ (Super, Shared_Parser, New_Config,
+ (+SEMICOLON_ID, +identifier_opt_ID, +LOOP_ID, +END_ID),
+ Push_Back_Undo_Reduce => True);
+ Insert (Super, Shared_Parser, New_Config, +LOOP_ID);
when package_body_ID =>
- Push_Back_Check (New_Config, (+SEMICOLON_ID,
+name_opt_ID, +END_ID));
- if New_Config.Stack.Peek (1).Token.ID =
+handled_sequence_of_statements_ID then
+ Push_Back_Check
+ (Super, Shared_Parser, New_Config,
+ (+SEMICOLON_ID, +name_opt_ID, +END_ID),
+ Push_Back_Undo_Reduce => True);
+ if Tree.Element_ID (New_Config.Stack.Peek (1).Token) =
+handled_sequence_of_statements_ID then
Push_Back_Check
- (New_Config,
- (+handled_sequence_of_statements_ID, +BEGIN_ID));
+ (Super, Shared_Parser, New_Config,
+ (+handled_sequence_of_statements_ID, +BEGIN_ID),
+ Push_Back_Undo_Reduce => True);
end if;
- Push_Back_Check (New_Config, (1 =>
+declarative_part_opt_ID));
- Insert (New_Config, (+PACKAGE_ID, +BODY_ID,
+IDENTIFIER_ID, +IS_ID));
+ Push_Back_Check
+ (Super, Shared_Parser, New_Config,
+ (1 => +declarative_part_ID),
+ Push_Back_Undo_Reduce => True);
+ Insert (Super, Shared_Parser, New_Config, (+PACKAGE_ID,
+BODY_ID, +IDENTIFIER_ID, +IS_ID));
when package_specification_ID =>
- Push_Back_Check (New_Config, (+name_opt_ID, +END_ID,
+declarative_part_opt_ID));
- if New_Config.Stack.Peek (1).Token.ID = +PRIVATE_ID then
- Push_Back_Check (New_Config, (+PRIVATE_ID,
+declarative_part_opt_ID));
+ -- ada_mode-recover_bad_char.adb
+ Push_Back_Check
+ (Super, Shared_Parser, New_Config,
+ (+name_opt_ID, +END_ID,
+basic_declarative_item_list_ID),
+ Push_Back_Undo_Reduce => True);
+ if Tree.Element_ID (New_Config.Stack.Peek (1).Token) =
+PRIVATE_ID then
+ Push_Back_Check
+ (Super, Shared_Parser, New_Config,
+ (+PRIVATE_ID, +basic_declarative_item_list_ID),
+ Push_Back_Undo_Reduce => True);
end if;
- Insert (New_Config, (+PACKAGE_ID, +IDENTIFIER_ID,
+IS_ID));
+ Insert (Super, Shared_Parser, New_Config, (+PACKAGE_ID,
+IDENTIFIER_ID, +IS_ID));
when subprogram_body_ID =>
Push_Back_Check
- (New_Config,
+ (Super, Shared_Parser, New_Config,
(+SEMICOLON_ID, +name_opt_ID, +END_ID,
+handled_sequence_of_statements_ID, +BEGIN_ID,
- +declarative_part_opt_ID));
- Insert (New_Config, (+PROCEDURE_ID, +IDENTIFIER_ID,
+IS_ID));
+ +declarative_part_ID),
+ Push_Back_Undo_Reduce => True);
+ Insert (Super, Shared_Parser, New_Config, (+PROCEDURE_ID,
+IDENTIFIER_ID, +IS_ID));
when task_body_ID =>
Push_Back_Check
- (New_Config,
- (+SEMICOLON_ID, +name_opt_ID, +END_ID,
+handled_sequence_of_statements_ID));
- Insert (New_Config, +BEGIN_ID);
+ (Super, Shared_Parser, New_Config,
+ (+SEMICOLON_ID, +name_opt_ID, +END_ID,
+handled_sequence_of_statements_ID),
+ Push_Back_Undo_Reduce => True);
+ Insert (Super, Shared_Parser, New_Config, +BEGIN_ID);
when others =>
if Trace_McKenzie > Outline then
@@ -220,11 +247,11 @@ package body WisiToken.Parse.LR.McKenzie_Recover.Ada is
if Trace_McKenzie > Detail then
Put ("Language_Fixes Match_Names_Error 2 " &
- Image (Config.Error_Token.ID, Descriptor),
New_Config);
+ Image (Tree.Element_ID (Config.Error_Token),
Descriptor), New_Config);
end if;
Local_Config_Heap.Add (New_Config);
exception
- when Bad_Config =>
+ when Invalid_Case =>
null;
end;
@@ -233,52 +260,43 @@ package body WisiToken.Parse.LR.McKenzie_Recover.Ada is
declare
New_Config : Configuration := Config;
begin
- New_Config.Error_Token.ID := Invalid_Token_ID;
- New_Config.Check_Status := (Label => Ok);
+ New_Config.Error_Token := (True, Invalid_Token_ID, others =>
<>);
+ New_Config.In_Parse_Action_Status := (Label => Ok);
New_Config.Strategy_Counts (Language_Fix) :=
New_Config.Strategy_Counts (Language_Fix) + 1;
Push_Back_Check
- (New_Config,
+ (Super, Shared_Parser, New_Config,
(+SEMICOLON_ID,
- (case
Ada_Process_Actions.Token_Enum_ID'(-Config.Error_Token.ID) is
+ (case To_Token_Enum (Tree.Element_ID
(Config.Error_Token)) is
when package_body_ID | package_specification_ID |
subprogram_body_ID => +name_opt_ID,
when protected_type_declaration_ID |
single_protected_declaration_ID => +protected_definition_ID,
- when others => +identifier_opt_ID)));
-
- if New_Config.Stack.Peek.Token.Min_Terminal_Index =
Invalid_Token_Index then
- -- 'end' is on top of stack. We want to set
Current_Shared_Token to
- -- 'end'; we can't if it has an invalid index (which it
has if it was
- -- pushed after a previous fix).
- --
- -- We don't check earlier for Invalid_Indices, because
we can handle
- -- other tokens having invalid indices.
+ when others => +identifier_opt_ID)),
+ Push_Back_Undo_Reduce => True);
+ if New_Config.Stack.Peek.Token.Virtual then
+ -- 'end' is on top of stack, and is from a previous fix;
don't mess
+ -- with that.
return;
end if;
- Push_Back_Check (New_Config, +END_ID);
+ Push_Back_Check (Super, Shared_Parser, New_Config, +END_ID,
Push_Back_Undo_Reduce => True);
- -- We don't insert ';' here, because we may need to insert
other
- -- stuff first; let Minimal_Complete_Actions handle it.
- Insert (New_Config, +END_ID);
+ -- Minimal_Complete_Actions does not insert an optional
name, but we
+ -- know we need one here.
+ Insert (Super, Shared_Parser, New_Config, (+END_ID,
+IDENTIFIER_ID, +SEMICOLON_ID));
Local_Config_Heap.Add (New_Config);
if Trace_McKenzie > Detail then
- Put ("Language_Fixes Match_Names_Error 1 " & Image
(Config.Error_Token.ID, Descriptor),
- New_Config);
+ Put
+ ("Language_Fixes Match_Names_Error 1 " & Image
+ (Tree.Element_ID (Config.Error_Token), Descriptor),
+ New_Config);
end if;
exception
- when Bad_Config =>
+ when Invalid_Case =>
null;
-
- when E : System.Assertions.Assert_Failure =>
- if Trace_McKenzie > Outline then
- Trace.Put_Line
- ("Match_Names_Error 1 " &
Standard.Ada.Exceptions.Exception_Message (E) & " " &
- Image (Config.Error_Token.ID, Descriptor));
- end if;
end;
end if;
end;
@@ -304,7 +322,7 @@ package body WisiToken.Parse.LR.McKenzie_Recover.Ada is
-- "<begin_named_token> ... begin handled_sequence_of_statements
end <end_name_token> ;"
--
-- where the <end_name_token> is empty. See test_mckenzie_recover.adb
- -- Missing_Name_*, ada_mode-recover_15.adb.
+ -- Missing_Name_*, ada_mode-recover_15.adb, ada_mode-recover_42.adb.
--
-- There are two subcases:
--
@@ -324,33 +342,36 @@ package body WisiToken.Parse.LR.McKenzie_Recover.Ada is
-- ahead, except in case 0b. So we enqueue two solutions; 'ignore
-- error' and either 'insert begin' or 'delete end;'.
- if not Valid_Tree_Indices (Config.Stack, SAL.Base_Peek_Type
(Config.Check_Token_Count)) then
- -- Invalid tree indices happens when recover enqueues a config
that
- -- contains tokens pushed during recover. The logic below depends
on
- -- valid tree indices.
+ if not Valid_Tree_Indices (Config.Stack,
Config.In_Parse_Action_Token_Count) then
+ -- The logic below depends on valid tree refs, not virtual tokens.
return;
end if;
- if No_Statements_Nonterm_IDs (Config.Error_Token.ID) then
+ if No_Statements_Nonterm_IDs (Tree.Element_ID (Config.Error_Token))
then
-- case 0b.
-- test/ada_mode.ads
return;
end if;
- if Invalid_Node_Index = Tree.Find_Child (Config.Stack.Peek
(4).Tree_Index, +EXCEPTION_ID) then
+ if Config.Stack.Depth < 4 or else
+ Config.Stack.Peek (4).Token.Virtual or else
+ not Is_Nonterminal (Tree.Element_ID (Config.Stack.Peek (4).Token),
Tree.Lexer.Descriptor.all)
+ then
+ return;
+ end if;
+
+ if Invalid_Node_Access = Tree.Find_Child (Config.Stack.Peek
(4).Token.Node, +EXCEPTION_ID) then
-- 'exception' not found; case 1a - assume extra 'end [keyword]
;'; delete it.
declare
- use Config_Op_Arrays;
- New_Config : Configuration := Config;
- Ops : Config_Op_Arrays.Vector renames New_Config.Ops;
- Stack : Recover_Stacks.Stack renames New_Config.Stack;
- End_Item : Recover_Stack_Item; -- 'end' keyword; position
in stack varies with case
- Keyword_Item : Recover_Stack_Item; -- keyword after 'end';
may not be present
- Semicolon_Item : Recover_Stack_Item; -- semicolon after 'end'
+ use Recover_Op_Arrays;
+ New_Config : aliased Configuration := Config;
+ Ops : Recover_Op_Arrays.Vector renames New_Config.Ops;
+ Stack : Recover_Stacks.Stack renames New_Config.Stack;
+ Keyword_Item : Recover_Stack_Item; -- keyword after 'end'; may
not be present
begin
- New_Config.Error_Token.ID := Invalid_Token_ID;
- New_Config.Check_Status := (Label => Ok);
+ New_Config.Error_Token := (True, Invalid_Token_ID, others =>
<>);
+ New_Config.In_Parse_Action_Status := (Label => Ok);
-- This is a guess, and sometimes deleting the error keyword
is better, so
-- give it a cost.
@@ -358,82 +379,85 @@ package body WisiToken.Parse.LR.McKenzie_Recover.Ada is
New_Config.Strategy_Counts (Language_Fix) :=
New_Config.Strategy_Counts (Language_Fix) + 1;
- case To_Token_Enum (Config.Error_Token.ID) is
+ case To_Token_Enum (Tree.Element_ID (Config.Error_Token)) is
when block_statement_ID | package_body_ID | subprogram_body_ID
| task_body_ID =>
- Semicolon_Item := Stack.Peek (1);
- End_Item := Stack.Peek (3);
Push_Back_Check
- (New_Config,
+ (Super, Shared_Parser, New_Config,
(+SEMICOLON_ID,
- (if Config.Error_Token.ID in +block_statement_ID |
+task_body_ID
+ (if Tree.Element_ID (Config.Error_Token) in
+block_statement_ID | +task_body_ID
then +identifier_opt_ID
else +name_opt_ID),
- +END_ID));
-
- if Undo_Reduce_Valid (New_Config.Stack, Tree) and then
- New_Config.Stack.Peek.Token.ID =
+handled_sequence_of_statements_ID
- then
- Undo_Reduce_Check
- (New_Config, Tree,
- (+handled_sequence_of_statements_ID,
- +sequence_of_statements_opt_ID));
- else
- if Trace_McKenzie > Outline then
- Put ("Language_Fixes unimplemented nonterm for
Missing_Name_Error.", New_Config);
+ +END_ID),
+ Push_Back_Undo_Reduce => True);
+
+ if Undo_Reduce_Valid (Super, Shared_Parser, New_Config) then
+ if Tree.Element_ID (New_Config.Stack.Peek.Token) =
+handled_sequence_of_statements_ID then
+ Undo_Reduce_Check
+ (Super, Shared_Parser, New_Config,
+ (+handled_sequence_of_statements_ID,
+ +sequence_of_statements_ID));
+ else
+ if Debug_Mode then
+ raise Bad_Config with "Language_Fixes unimplemented
nonterm for Missing_Name_Error " &
+ Image (Tree.Element_ID (Config.Error_Token),
Descriptor);
+ else
+ raise Invalid_Case;
+ end if;
end if;
- raise Bad_Config;
+ else
+ raise Invalid_Case;
end if;
when package_specification_ID =>
- Semicolon_Item := Stack.Peek (1);
- End_Item := Stack.Peek (3);
-
- Push_Back_Check (New_Config, (+SEMICOLON_ID, +name_opt_ID,
+END_ID));
- Undo_Reduce_Check (New_Config, Tree,
+declarative_part_opt_ID);
+ Push_Back_Check
+ (Super, Shared_Parser, New_Config,
+ (+SEMICOLON_ID, +name_opt_ID, +END_ID),
+ Push_Back_Undo_Reduce => True);
+ Undo_Reduce_Check
+ (Super, Shared_Parser, New_Config,
+basic_declarative_item_list_ID);
when loop_statement_ID =>
- Semicolon_Item := Stack.Peek (1);
- Keyword_Item := Stack.Peek (3);
- End_Item := Stack.Peek (4);
+ Keyword_Item := Stack.Peek (3);
Push_Back_Check
- (New_Config, (+SEMICOLON_ID, +identifier_opt_ID, +LOOP_ID,
+END_ID));
+ (Super, Shared_Parser, New_Config,
+ (+SEMICOLON_ID, +identifier_opt_ID, +LOOP_ID, +END_ID),
+ Push_Back_Undo_Reduce => True);
- if Undo_Reduce_Valid (New_Config.Stack, Tree) and then
- New_Config.Stack.Peek (1).Token.ID =
+handled_sequence_of_statements_ID
+ if Undo_Reduce_Valid (Super, Shared_Parser, New_Config) and
then
+ Tree.Element_ID (New_Config.Stack.Peek.Token) =
+handled_sequence_of_statements_ID
then
Undo_Reduce_Check
- (New_Config, Tree,
+ (Super, Shared_Parser, New_Config,
(+handled_sequence_of_statements_ID,
- +sequence_of_statements_opt_ID));
+ +sequence_of_statements_ID));
end if;
when others =>
- if Trace_McKenzie > Outline then
- Put ("Language_Fixes unimplemented nonterm for
Missing_Name_Error.", Config);
- end if;
- raise Bad_Config;
+ raise Bad_Config with "Language_Fixes unimplemented nonterm
for Missing_Name_Error " &
+ Image (Tree.Element_ID (Config.Error_Token), Descriptor);
end case;
if not Has_Space (Ops, 3) then
- raise Bad_Config;
- end if;
- Append (Ops, (Delete, +END_ID,
End_Item.Token.Min_Terminal_Index));
- if Keyword_Item.Token.ID /= Invalid_Token_ID then
- Append (Ops, (Delete, Keyword_Item.Token.ID,
Keyword_Item.Token.Min_Terminal_Index));
+ raise Invalid_Case;
end if;
- -- We don't need to delete the identifier|name ; it is missing
and therefor empty.
- Append (Ops, (Delete, +SEMICOLON_ID,
Semicolon_Item.Token.Min_Terminal_Index));
- New_Config.Current_Shared_Token := Config.Current_Shared_Token;
-- After pushed_back SEMICOLON.
+ if Tree.Element_ID (Keyword_Item.Token) /= Invalid_Token_ID then
+ Delete_Check
+ (Super, Shared_Parser, New_Config, (+END_ID,
Tree.Element_ID (Keyword_Item.Token), +SEMICOLON_ID));
+ else
+ -- We don't need to delete the identifier|name ; it is
missing and therefor empty.
+ Delete_Check (Super, Shared_Parser, New_Config, (+END_ID,
+SEMICOLON_ID));
+ end if;
Local_Config_Heap.Add (New_Config);
if Trace_McKenzie > Detail then
- Put ("Language_Fixes Missing_Name_Error 1a " & Image
(Config.Error_Token.ID, Descriptor), New_Config);
+ Put ("Language_Fixes Missing_Name_Error 1a " & Image
+ (Tree.Element_ID (Config.Error_Token), Descriptor),
New_Config);
end if;
exception
- when Bad_Config =>
+ when Invalid_Case =>
null;
end;
@@ -443,30 +467,32 @@ package body WisiToken.Parse.LR.McKenzie_Recover.Ada is
declare
New_Config : Configuration := Config;
begin
- New_Config.Error_Token.ID := Invalid_Token_ID;
- New_Config.Check_Status := (Label => Ok);
+ New_Config.Error_Token := (True, Invalid_Token_ID, others =>
<>);
+ New_Config.In_Parse_Action_Status := (Label => Ok);
New_Config.Cost := New_Config.Cost + 1;
New_Config.Strategy_Counts (Language_Fix) :=
New_Config.Strategy_Counts (Language_Fix) + 1;
Push_Back_Check
- (New_Config,
+ (Super, Shared_Parser, New_Config,
(+SEMICOLON_ID,
- (if Config.Error_Token.ID = +block_statement_ID
+ (if Tree.Element_ID (Config.Error_Token) =
+block_statement_ID
then +identifier_opt_ID
else +name_opt_ID),
- +END_ID, +handled_sequence_of_statements_ID));
+ +END_ID, +handled_sequence_of_statements_ID),
+ Push_Back_Undo_Reduce => True);
- Insert (New_Config, +BEGIN_ID);
+ Insert (Super, Shared_Parser, New_Config, +BEGIN_ID);
Local_Config_Heap.Add (New_Config);
if Trace_McKenzie > Detail then
- Put ("Language_Fixes Missing_Name_Error 1b " & Image
(Config.Error_Token.ID, Descriptor), New_Config);
+ Put ("Language_Fixes Missing_Name_Error 1b " & Image
+ (Tree.Element_ID (Config.Error_Token), Descriptor),
New_Config);
end if;
exception
- when Bad_Config =>
+ when Invalid_Case =>
null;
end;
end if;
@@ -509,31 +535,39 @@ package body WisiToken.Parse.LR.McKenzie_Recover.Ada is
declare
New_Config : Configuration := Config;
begin
- New_Config.Error_Token.ID := Invalid_Token_ID;
- New_Config.Check_Status := (Label => Ok);
+ New_Config.Error_Token := (True, Invalid_Token_ID, others => <>);
+ New_Config.In_Parse_Action_Status := (Label => Ok);
New_Config.Strategy_Counts (Language_Fix) :=
New_Config.Strategy_Counts (Language_Fix) + 1;
-- Push_Back the failed reduce tokens.
- for I in 1 .. New_Config.Check_Token_Count loop
- if Push_Back_Valid (New_Config) then
- Push_Back (New_Config);
- else
- raise Bad_Config;
- end if;
+ for I in 1 .. New_Config.In_Parse_Action_Token_Count loop
+ Push_Back (Super, Shared_Parser, New_Config,
Push_Back_Undo_Reduce => True);
end loop;
- Insert (New_Config, +END_ID);
- -- Let Minimal_Complete_Actions handle (insert ';').
+ if New_Config.Stack.Depth <= 1 then
+ -- ada_mode-partial_parse_indent_begin.adb
+ raise Invalid_Case;
+ end if;
+
+ if To_Token_Enum (Tree.Element_ID (New_Config.Stack.Peek.Token))
/= sequence_of_statements_ID then
+ Insert (Super, Shared_Parser, New_Config, (+NULL_ID,
+SEMICOLON_ID));
+ -- We don't need Undo_Reduce if sequence_of_statements is
present;
+ -- parser will handle that.
+ end if;
+
+ -- We know there is no name here.
+ Insert (Super, Shared_Parser, New_Config, (+END_ID,
+SEMICOLON_ID));
Local_Config_Heap.Add (New_Config);
if Trace_McKenzie > Detail then
- Put ("Language_Fixes Extra_Name_Error 1 " & Image
(Config.Error_Token.ID, Descriptor), New_Config);
+ Put
+ ("Language_Fixes Extra_Name_Error 1 " & Image
+ (Tree.Element_ID (Config.Error_Token), Descriptor),
New_Config);
end if;
-
exception
- when Bad_Config =>
+ when Invalid_Case =>
null;
end;
@@ -541,68 +575,122 @@ package body WisiToken.Parse.LR.McKenzie_Recover.Ada is
declare
New_Config : Configuration := Config;
begin
- New_Config.Error_Token.ID := Invalid_Token_ID;
- New_Config.Check_Status := (Label => Ok);
+ New_Config.Error_Token := (True, Invalid_Token_ID,
others => <>);
+ New_Config.In_Parse_Action_Status := (Label
=> Ok);
New_Config.Strategy_Counts (Language_Fix) :=
New_Config.Strategy_Counts (Language_Fix) + 1;
- case Ada_Process_Actions.Token_Enum_ID'(-Config.Error_Token.ID) is
+ case To_Token_Enum (Tree.Element_ID (Config.Error_Token)) is
when block_statement_ID =>
- -- There is almost always an open block of some sort; not worth
- -- checking.
- Push_Back_Check (New_Config, (+SEMICOLON_ID,
+identifier_opt_ID, +END_ID));
+ Push_Back_Check
+ (Super, Shared_Parser, New_Config,
+ (+SEMICOLON_ID, +identifier_opt_ID, +END_ID),
+ Push_Back_Undo_Reduce => True);
when loop_statement_ID =>
Push_Back_Check
- (New_Config, (+SEMICOLON_ID, +identifier_opt_ID, +LOOP_ID,
+END_ID));
+ (Super, Shared_Parser, New_Config,
+ (+SEMICOLON_ID, +identifier_opt_ID, +LOOP_ID, +END_ID),
+ Push_Back_Undo_Reduce => True);
+
+ when package_specification_ID | package_body_ID =>
+ -- ada_mode-recover_string_quote_1.adb
+ if Tree.Element_ID (New_Config.Stack.Peek.Token) =
+SEMICOLON_ID then
+ -- ada_mode-recover_50.adb
+ Push_Back
+ (Super, Shared_Parser, New_Config,
+ Push_Back_Undo_Reduce => True);
+ end if;
- when others =>
- if Trace_McKenzie > Outline then
- Put ("Language_Fixes Extra_Name_Error 2: unrecognized
Error_Token", Config);
+ Push_Back_Check
+ (Super, Shared_Parser, New_Config,
+ (+name_opt_ID, +END_ID),
+ Push_Back_Undo_Reduce => True);
+
+ when protected_body_ID =>
+ -- ada_mode-recover_50.adb
+ if Tree.Element_ID (New_Config.Stack.Peek.Token) =
+SEMICOLON_ID then
+ Push_Back
+ (Super, Shared_Parser, New_Config,
+ Push_Back_Undo_Reduce => True);
end if;
- raise Bad_Config;
+
+ Push_Back_Check
+ (Super, Shared_Parser, New_Config,
+ (+identifier_opt_ID, +END_ID),
+ Push_Back_Undo_Reduce => True);
+
+ when protected_type_declaration_ID |
single_protected_declaration_ID | single_task_declaration_ID =>
+ -- ada_mode-recover_50.adb
+ Push_Back_Check (Super, Shared_Parser, New_Config,
+SEMICOLON_ID, Push_Back_Undo_Reduce => True);
+
+ case To_Token_Enum (Tree.Element_ID
(New_Config.Stack.Peek.Token)) is
+ when protected_definition_ID | task_definition_ID =>
+ raise Invalid_Case;
+
+ when identifier_opt_ID =>
+ Push_Back_Check
+ (Super, Shared_Parser, New_Config,
+ (+identifier_opt_ID, +END_ID),
+ Push_Back_Undo_Reduce => True);
+
+ when others =>
+ raise SAL.Programmer_Error with "code does not match
grammar";
+ end case;
+
+ when subprogram_body_ID =>
+ Push_Back_Check
+ (Super, Shared_Parser, New_Config,
+ (+SEMICOLON_ID, +name_opt_ID, +END_ID),
+ Push_Back_Undo_Reduce => True);
+
+ when others =>
+ raise Bad_Config with "Language_Fixes Extra_Name_Error 2:
unrecognized Error_Token " &
+ Image (Tree.Element_ID (Config.Error_Token),
Tree.Lexer.Descriptor.all);
end case;
- -- Let Minimal_Complete_Actions finish insert
- Insert (New_Config, +END_ID);
+ -- We know there is no name here.
+ Insert (Super, Shared_Parser, New_Config, (+END_ID,
+SEMICOLON_ID));
Local_Config_Heap.Add (New_Config);
if Trace_McKenzie > Detail then
- Put ("Language_Fixes Extra_Name_Error 2 " & Image
(Config.Error_Token.ID, Descriptor), New_Config);
+ Put
+ ("Language_Fixes Extra_Name_Error 2 " & Image
+ (Tree.Element_ID (Config.Error_Token), Descriptor),
New_Config);
end if;
exception
- when Bad_Config =>
+ when Invalid_Case =>
null;
end;
-- Case 3. Delete the extra begin
--
- -- If the first begin was inserted by recovery; we actually want to
+ -- If the first begin was inserted by recovery, we actually want to
-- delete the second begin. see test/ada_mode-recover_indent_4.adb
declare
- New_Config : Configuration := Config;
+ New_Config : aliased Configuration := Config;
I : SAL.Peek_Type := 1;
First_Begin_I : SAL.Peek_Type;
Second_Begin_I : SAL.Peek_Type;
begin
loop
- if New_Config.Stack.Peek (I).Token.ID = +BEGIN_ID then
+ if Tree.Element_ID (New_Config.Stack.Peek (I).Token) =
+BEGIN_ID then
Second_Begin_I := I;
exit;
end if;
I := I + 1;
if I >= New_Config.Stack.Depth then
- raise Bad_Config;
+ raise Invalid_Case;
end if;
end loop;
loop
I := I + 1;
if I >= New_Config.Stack.Depth then
- raise Bad_Config;
+ raise Invalid_Case;
end if;
- if New_Config.Stack.Peek (I).Token.ID = +BEGIN_ID then
+ if Tree.Element_ID (New_Config.Stack.Peek (I).Token) =
+BEGIN_ID then
First_Begin_I := I;
exit;
end if;
@@ -616,110 +704,102 @@ package body WisiToken.Parse.LR.McKenzie_Recover.Ada is
-- Delete the second begin
for I in 1 .. Second_Begin_I loop
- if Push_Back_Valid (New_Config) then
- Push_Back (New_Config);
- else
- raise Bad_Config;
- end if;
+ Push_Back (Super, Shared_Parser, New_Config,
Push_Back_Undo_Reduce => True);
end loop;
- pragma Assert (New_Config.Stack.Peek.Token.ID =
+block_label_opt_ID);
- if New_Config.Stack.Peek.Token.Byte_Region = Null_Buffer_Region
then
- -- block label is empty
- Push_Back (New_Config);
- Delete_Check (Terminals, New_Config, +BEGIN_ID);
- else
- Push_Back (New_Config);
+ case To_Token_Enum (Tree.Element_ID
(New_Config.Stack.Peek.Token)) is
+ when COLON_ID =>
+ -- block label is present
+ Push_Back_Check
+ (Super, Shared_Parser, New_Config, (+COLON_ID,
+statement_identifier_ID),
+ Push_Back_Undo_Reduce => True);
- declare
- Index : WisiToken.Token_Index :=
New_Config.Current_Shared_Token;
- begin
- Delete_Check (Terminals, New_Config, Index,
+IDENTIFIER_ID);
- Delete_Check (Terminals, New_Config, Index, +COLON_ID);
- Delete_Check (Terminals, New_Config, Index, +BEGIN_ID);
- end;
- end if;
+ Delete_Check (Super, Shared_Parser, New_Config,
(+IDENTIFIER_ID, +COLON_ID, +BEGIN_ID));
+
+ when label_opt_ID =>
+ if Tree.Is_Empty_Nonterm (New_Config.Stack.Peek.Token) then
+ Undo_Reduce_Check (Super, Shared_Parser, New_Config,
+label_opt_ID);
+ else
+ Undo_Reduce_Check (Super, Shared_Parser, New_Config,
+label_opt_ID);
+ Push_Back_Check
+ (Super, Shared_Parser, New_Config, (+COLON_ID,
+statement_identifier_ID),
+ Push_Back_Undo_Reduce => True);
+ Delete_Check (Super, Shared_Parser, New_Config,
(+IDENTIFIER_ID, +COLON_ID, +BEGIN_ID));
+ end if;
+
+ when others =>
+ Delete_Check (Super, Shared_Parser, New_Config, +BEGIN_ID);
+ end case;
- if Undo_Reduce_Valid (New_Config.Stack, Tree) then
- Undo_Reduce_Check (New_Config, Tree,
+sequence_of_statements_ID);
+ if Undo_Reduce_Valid (Super, Shared_Parser, New_Config) then
+ Undo_Reduce_Check (Super, Shared_Parser, New_Config,
+statement_statement_list_ID);
+ elsif Push_Back_Valid (Super, Shared_Parser, New_Config,
Push_Back_Undo_Reduce => True) then
+ Push_Back_Check (Super, Shared_Parser, New_Config,
+statement_statement_list_ID,
+ Push_Back_Undo_Reduce => True);
else
- Push_Back_Check (New_Config, +sequence_of_statements_ID);
+ raise Invalid_Case;
end if;
Local_Config_Heap.Add (New_Config);
if Trace_McKenzie > Detail then
Put ("Language_Fixes Extra_Name_Error 3a " &
- Image (Config.Error_Token.ID, Descriptor),
New_Config);
+ Image (Tree.Element_ID (Config.Error_Token),
Descriptor), New_Config);
end if;
else
-- Delete the first begin. We assume it is in a subprogram
body, so
-- we don't need to adjust anything else.
for I in 1 .. First_Begin_I loop
- if Push_Back_Valid (New_Config) then
- Push_Back (New_Config);
- else
- -- Probably trying to push back thru an earlier error
recovery; see
- -- test/ada_mode-recover_10.adb
- raise Bad_Config;
- end if;
+ Push_Back (Super, Shared_Parser, New_Config,
Push_Back_Undo_Reduce => True);
end loop;
- Delete_Check (Terminals, New_Config, +BEGIN_ID);
+ Delete_Check (Super, Shared_Parser, New_Config, +BEGIN_ID);
Local_Config_Heap.Add (New_Config);
if Trace_McKenzie > Detail then
Put ("Language_Fixes Extra_Name_Error 3b " &
- Image (Config.Error_Token.ID, Descriptor),
New_Config);
+ Image (Tree.Element_ID (Config.Error_Token),
Descriptor), New_Config);
end if;
end if;
exception
- when Bad_Config =>
+ when Invalid_Case =>
null;
-
end;
end case;
exception
when Bad_Config =>
- null;
-
- when E : System.Assertions.Assert_Failure =>
if Debug_Mode then
- Trace.Put
- ("Language_Fixes Handle_Check_Fail assert fail: " &
- Standard.Ada.Exceptions.Exception_Message (E),
- Prefix => True);
- Trace.New_Line;
raise;
elsif Trace_McKenzie > Outline then
- Trace.Put_Line ("Language_Fixes Handle_Check_Fail Assert fail");
+ Tree.Lexer.Trace.Put_Line ("Language_Fixes
Handle_In_Parse_Action_Fail Bad_Config");
end if;
- end Handle_Check_Fail;
+ end Handle_In_Parse_Action_Fail;
procedure Handle_Parse_Error
- (Trace : in out WisiToken.Trace'Class;
- Lexer : access constant WisiToken.Lexer.Instance'Class;
- Parser_Label : in Natural;
- Parse_Table : in WisiToken.Parse.LR.Parse_Table;
- Terminals : in Base_Token_Arrays.Vector;
- Tree : in Syntax_Trees.Tree;
+ (Super : in out
WisiToken.Parse.LR.McKenzie_Recover.Base.Supervisor;
+ Shared_Parser : in out Parser.Parser;
+ Parser_Index : in SAL.Peek_Type;
Local_Config_Heap : in out Config_Heaps.Heap_Type;
Config : in Configuration)
- with Pre => Config.Check_Status.Label = Ok
+ with Pre => Config.In_Parse_Action_Status.Label = Ok
is
- use Config_Op_Arrays;
+ use Syntax_Trees;
+
+ Tree : Syntax_Trees.Tree renames Shared_Parser.Tree;
+ Parser_Label : constant Syntax_Trees.Stream_ID := Super.Stream
(Parser_Index);
procedure Put (Message : in String; Config : in Configuration)
is begin
- Put (Message, Trace, Parser_Label, Terminals, Config);
+ Put (Message, Tree, Parser_Label, Config);
end Put;
begin
- if (Config.Error_Token.ID = +COLON_ID and
- Config.Stack.Peek.Token.ID = +IDENTIFIER_ID) and then
- Push_Back_Valid (Config)
+ if (Tree.Element_ID (Config.Error_Token) = +COLON_ID and
+ (Tree.Element_ID (Config.Stack.Peek.Token) /= Invalid_Token_ID and
then
+ -Tree.Element_ID (Config.Stack.Peek.Token) in direct_name_ID |
IDENTIFIER_ID)) and then
+ Push_Back_Valid (Super, Shared_Parser, Config, Push_Back_Undo_Reduce
=> True)
then
-- Code looks like:
--
- -- ... <variable_identifier> : [aliased constant]
<subtype_indication> := <expression> ...
+ -- ... <variable_name> : [aliased constant] <subtype_indication> :=
<expression> ...
--
-- Assume the user copied a declaration with an initializer, and is
-- converting it to an expression; see ada_mode-recover_02.adb,
@@ -739,43 +819,51 @@ package body WisiToken.Parse.LR.McKenzie_Recover.Ada is
-- compare to "decl as statement"/"missing end"/"extra begin" case
below.
declare
- New_Config : Configuration := Config;
- I : WisiToken.Token_Index;
+ New_Config : aliased Configuration := Config;
+ Peek_State : Peek_Sequential_State
(New_Config.Input_Stream'Access);
begin
- Push_Back_Check (New_Config, +IDENTIFIER_ID);
+ Push_Back (Super, Shared_Parser, New_Config, Push_Back_Undo_Reduce
=> True); -- variable_name
+
+ Peek_State := Peek_Sequential_Start (Super, Shared_Parser,
New_Config);
+
+ Delete_Check (Super, Shared_Parser, New_Config, Peek_State,
+IDENTIFIER_ID);
+ Delete_Check (Super, Shared_Parser, New_Config, Peek_State,
+COLON_ID);
- I := New_Config.Current_Shared_Token;
- Delete_Check (Terminals, New_Config, I, +IDENTIFIER_ID);
- Delete_Check (Terminals, New_Config, I, +COLON_ID);
- if Terminals (I).ID = +ALIASED_ID then
- Delete_Check (Terminals, New_Config, I, +ALIASED_ID);
+ if Tree.ID (Peek_Sequential_Terminal (Peek_State)) = +ALIASED_ID
then
+ Delete_Check (Super, Shared_Parser, New_Config, Peek_State,
+ALIASED_ID);
end if;
- if Terminals (I).ID = +CONSTANT_ID then
- Delete_Check (Terminals, New_Config, I, +CONSTANT_ID);
+
+ if Tree.ID (Peek_Sequential_Terminal (Peek_State)) = +CONSTANT_ID
then
+ Delete_Check (Super, Shared_Parser, New_Config, Peek_State,
+CONSTANT_ID);
end if;
- if Terminals (I).ID = +NOT_ID then
- Delete_Check (Terminals, New_Config, I, +NOT_ID);
+
+ if Tree.ID (Peek_Sequential_Terminal (Peek_State)) = +NOT_ID then
+ Delete_Check (Super, Shared_Parser, New_Config, Peek_State,
+NOT_ID);
end if;
- if Terminals (I).ID = +NULL_ID then
- Delete_Check (Terminals, New_Config, I, +NULL_ID);
+
+ if Tree.ID (Peek_Sequential_Terminal (Peek_State)) = +NULL_ID then
+ Delete_Check (Super, Shared_Parser, New_Config, Peek_State,
+NULL_ID);
end if;
-- look for ':='
loop
- exit when I = Terminals.Last_Index; -- last is EOI
- case To_Token_Enum (Terminals (I).ID) is
+ exit when Peek_Sequential_Terminal (Peek_State) =
Invalid_Node_Access;
+ case To_Token_Enum (Tree.ID (Peek_Sequential_Terminal
(Peek_State))) is
when IDENTIFIER_ID =>
- Delete_Check (Terminals, New_Config, I, +IDENTIFIER_ID);
+ Delete_Check (Super, Shared_Parser, New_Config, Peek_State,
+IDENTIFIER_ID);
when DOT_ID =>
- Delete_Check (Terminals, New_Config, I, +DOT_ID);
+ Delete_Check (Super, Shared_Parser, New_Config, Peek_State,
+DOT_ID);
when COLON_EQUAL_ID =>
- Delete_Check (Terminals, New_Config, I, +COLON_EQUAL_ID);
+ Delete_Check (Super, Shared_Parser, New_Config, Peek_State,
+COLON_EQUAL_ID);
+ exit;
+
+ when Wisi_EOI_ID =>
exit;
when others =>
- raise Bad_Config;
+ raise Invalid_Case;
end case;
end loop;
@@ -787,20 +875,20 @@ package body WisiToken.Parse.LR.McKenzie_Recover.Ada is
Put ("Language_Fixes variable decl as expression", New_Config);
end if;
exception
- when Bad_Config =>
+ when Invalid_Case =>
null;
end;
- elsif (To_Token_Enum (Config.Error_Token.ID) in ALIASED_ID | CONSTANT_ID
| IDENTIFIER_ID and
- Config.Stack.Peek.Token.ID = +COLON_ID) and then
- Push_Back_Valid (Config)
+ elsif (To_Token_Enum (Tree.Element_ID (Config.Error_Token)) in
ALIASED_ID | CONSTANT_ID | IDENTIFIER_ID and
+ Tree.Element_ID (Config.Stack.Peek.Token) = +COLON_ID) and then
+ Push_Back_Valid (Super, Shared_Parser, Config, Push_Back_Undo_Reduce
=> True)
then
-- Code looks like:
--
-- <statement> <variable_identifier> : [aliased constant]
<subtype_indication> <expression> ...
--
- -- The variable_name looks like a block_label. compare to "variable
decl as
- -- param" case above.
+ -- The variable_name looks like a statement_identifier (ie block
+ -- name). compare to "variable decl as expression" case above.
--
-- 1) This is a copied variable declaration that the user is
converting
-- to an assignment. See
@@ -819,43 +907,49 @@ package body WisiToken.Parse.LR.McKenzie_Recover.Ada is
--
-- 3) There is an extra 'begin' before the <variable_name>. See
-- test/ada_mode-recover_27.adb. Delete the 'begin'.
+ --
+ -- 4) This is an incomplete object_declaration; let minimal_complete
+ -- handle it. test/ada_mode-recover_38.adb.
-- case 1
declare
- New_Config : Configuration := Config;
- I : WisiToken.Token_Index;
+ New_Config : aliased Configuration := Config;
+ Peek_State : Peek_Sequential_State
(New_Config.Input_Stream'Access);
begin
- Push_Back_Check (New_Config, +COLON_ID);
- I := New_Config.Current_Shared_Token;
- Delete_Check (Terminals, New_Config, I, +COLON_ID);
- if Terminals (I).ID = +ALIASED_ID then
- Delete_Check (Terminals, New_Config, I, +ALIASED_ID);
+ Push_Back_Check (Super, Shared_Parser, New_Config, +COLON_ID,
Push_Back_Undo_Reduce => True);
+
+ Peek_State := Peek_Sequential_Start (Super, Shared_Parser,
New_Config);
+
+ Delete_Check (Super, Shared_Parser, New_Config, Peek_State,
+COLON_ID);
+
+ if Tree.ID (Peek_Sequential_Terminal (Peek_State)) = +ALIASED_ID
then
+ Delete_Check (Super, Shared_Parser, New_Config, Peek_State,
+ALIASED_ID);
end if;
- if Terminals (I).ID = +CONSTANT_ID then
- Delete_Check (Terminals, New_Config, I, +CONSTANT_ID);
+ if Tree.ID (Peek_Sequential_Terminal (Peek_State)) = +CONSTANT_ID
then
+ Delete_Check (Super, Shared_Parser, New_Config, Peek_State,
+CONSTANT_ID);
end if;
- if Terminals (I).ID = +NOT_ID then
- Delete_Check (Terminals, New_Config, I, +NOT_ID);
+ if Tree.ID (Peek_Sequential_Terminal (Peek_State)) = +NOT_ID then
+ Delete_Check (Super, Shared_Parser, New_Config, Peek_State,
+NOT_ID);
end if;
- if Terminals (I).ID = +NULL_ID then
- Delete_Check (Terminals, New_Config, I, +NULL_ID);
+ if Tree.ID (Peek_Sequential_Terminal (Peek_State)) = +NULL_ID then
+ Delete_Check (Super, Shared_Parser, New_Config, Peek_State,
+NULL_ID);
end if;
-- look for and keep ':='
loop
- exit when I = Terminals.Last_Index; -- last is EOI
- case To_Token_Enum (Terminals (I).ID) is
+ exit when Peek_Sequential_Terminal (Peek_State) =
Invalid_Node_Access;
+ case To_Token_Enum (Tree.ID (Peek_Sequential_Terminal
(Peek_State))) is
when IDENTIFIER_ID =>
- Delete_Check (Terminals, New_Config, I, +IDENTIFIER_ID);
+ Delete_Check (Super, Shared_Parser, New_Config, Peek_State,
+IDENTIFIER_ID);
when DOT_ID =>
- Delete_Check (Terminals, New_Config, I, +DOT_ID);
+ Delete_Check (Super, Shared_Parser, New_Config, Peek_State,
+DOT_ID);
- when COLON_EQUAL_ID =>
+ when COLON_EQUAL_ID | Wisi_EOI_ID =>
exit;
when others =>
- raise Bad_Config;
+ raise Invalid_Case;
end case;
end loop;
@@ -864,56 +958,58 @@ package body WisiToken.Parse.LR.McKenzie_Recover.Ada is
New_Config.Strategy_Counts (Language_Fix) :=
New_Config.Strategy_Counts (Language_Fix) + 1;
Local_Config_Heap.Add (New_Config);
if Trace_McKenzie > Detail then
- Put ("Language_Fixes variable decl as statement", New_Config);
+ Put ("Language_Fixes constant decl as statement 1", New_Config);
end if;
exception
- when Bad_Config =>
+ when Invalid_Case =>
null;
end;
declare
New_Config_1 : Configuration := Config;
begin
- -- Case 2
- Push_Back_Check (New_Config_1, (+COLON_ID, +IDENTIFIER_ID));
+ -- ada_mode-recover_38.adb, ada_mode-recover_46.adb
+ Push_Back_Check (Super, Shared_Parser, New_Config_1, +COLON_ID,
Push_Back_Undo_Reduce => True);
+ Push_Back_Check
+ (Super, Shared_Parser, New_Config_1,
+ Tree.Element_ID (New_Config_1.Stack.Peek.Token),
+ Push_Back_Undo_Reduce => True);
+
+ if Tree.Element_ID (New_Config_1.Stack.Peek.Token) =
+sequence_of_statements_ID then
+ -- Case 2
+ null;
- -- maybe case 3.
- if -New_Config_1.Stack.Peek.Token.ID = BEGIN_ID and
Push_Back_Valid (New_Config_1) then
+ elsif Tree.Element_ID (New_Config_1.Stack.Peek.Token) = +BEGIN_ID
then
+ -- Case 2 or 3
declare
New_Config_2 : Configuration := New_Config_1;
begin
- Push_Back_Check (New_Config_2, +BEGIN_ID);
- if Undo_Reduce_Valid (New_Config_2.Stack, Tree) and then
- -New_Config_2.Stack.Peek.Token.ID in
declarative_part_opt_ID | block_label_opt_ID
- then
- Undo_Reduce_Check (New_Config_2, Tree,
New_Config_2.Stack.Peek.Token.ID);
- else
- if Trace_McKenzie > Detail then
- Put ("Language_Fixes extra begin 1 unimplemented
case", New_Config_2);
+ if Push_Back_Valid (Super, Shared_Parser, New_Config_1,
Push_Back_Undo_Reduce => True) then
+ Push_Back_Check (Super, Shared_Parser, New_Config_2,
+BEGIN_ID, Push_Back_Undo_Reduce => True);
+ Delete_Check (Super, Shared_Parser, New_Config_2,
+BEGIN_ID);
+ if Undo_Reduce_Valid (Super, Shared_Parser, New_Config_2)
then
+ if Tree.Element_ID (New_Config_2.Stack.Peek.Token) =
+declarative_part_ID then
+ Undo_Reduce_Check (Super, Shared_Parser,
New_Config_2, +declarative_part_ID);
+ end if;
end if;
- raise Bad_Config;
- end if;
- Delete_Check (Terminals, New_Config_2, +BEGIN_ID);
- -- This is a guess, so add a cost, equal to case 1, 2.
- New_Config_2.Cost := New_Config_2.Cost + 1;
- New_Config_2.Strategy_Counts (Language_Fix) :=
New_Config_2.Strategy_Counts (Language_Fix) + 1;
- Local_Config_Heap.Add (New_Config_2);
+ -- This is a guess, so add a cost, equal to case 1, 2.
+ New_Config_2.Cost := New_Config_2.Cost + 1;
+ New_Config_2.Strategy_Counts (Language_Fix) :=
New_Config_2.Strategy_Counts (Language_Fix) + 1;
+ Local_Config_Heap.Add (New_Config_2);
- if Trace_McKenzie > Detail then
- Put ("Language_Fixes extra begin 1", New_Config_2);
+ if Trace_McKenzie > Detail then
+ Put ("Language_Fixes constant decl as statement 3",
New_Config_2);
+ end if;
end if;
- exception
- when Bad_Config =>
- null;
end;
- end if;
- Insert (New_Config_1, +END_ID);
+ Insert (Super, Shared_Parser, New_Config_1, (+NULL_ID,
+SEMICOLON_ID));
+ end if;
- Insert (New_Config_1, +SEMICOLON_ID);
-- If we don't insert the ';' here, <variable_name> looks like a
-- block end name.
+ Insert (Super, Shared_Parser, New_Config_1, (+END_ID,
+SEMICOLON_ID));
-- This is a guess, so add a cost, equal to case 1.
New_Config_1.Cost := New_Config_1.Cost + 1;
@@ -921,18 +1017,21 @@ package body WisiToken.Parse.LR.McKenzie_Recover.Ada is
Local_Config_Heap.Add (New_Config_1);
if Trace_McKenzie > Detail then
- Put ("Language_Fixes missing end 1", New_Config_1);
+ Put ("Language_Fixes constant decl as statement 2",
New_Config_1);
end if;
+ exception
+ when Invalid_Case =>
+ null;
end;
- elsif Config.Error_Token.ID = +DOT_ID then
- -- We've encountered a Selected_Component when we were expecting a
- -- simple IDENTIFIER or a name. If the name is preceded by 'end',
then
- -- this similar to a semantic check Extra_Name_Error, and the
+ elsif Tree.Element_ID (Config.Error_Token) = +DOT_ID then
+ -- We've encountered a selected_component when we were expecting a
+ -- simple IDENTIFIER. If the selected_component is preceded by 'end',
+ -- then this is similar to a semantic check Extra_Name_Error, and the
-- solutions are similar.
- if Config.Stack.Peek.Token.ID = +IDENTIFIER_ID and
- Config.Stack.Peek (2).Token.ID = +END_ID
+ if To_Token_Enum (Tree.Element_ID (Config.Stack.Peek.Token)) in
IDENTIFIER_ID | identifier_opt_ID and
+ Tree.Element_ID (Config.Stack.Peek (2).Token) = +END_ID
then
-- The input looks like one of:
--
@@ -943,9 +1042,10 @@ package body WisiToken.Parse.LR.McKenzie_Recover.Ada is
-- Case 1) is missing 'end <end_name_token_2> ;' between the
-- 'begin's, so parsing expects <end_name_token_1> to match the
-- second 'begin', which looks like an unnamed block. See
- -- test_mckenzie_recover Match_Selected_Component_1. 'declare ...'
- -- is _not_ present on the second begin. The solution is to
- -- insert 'end ;' before the second 'begin'.
+ -- test_mckenzie_recover Match_Selected_Component_1. 'declare
...' is
+ -- _not_ present on the second begin (because it is part of the
+ -- syntax for <begin_name_token_1>). The solution is to insert
'end
+ -- ;' before the second 'begin'.
--
-- Case 2) is missing 'end;' after the second 'begin'. See
-- test_mckenzie_recover Match_Selected_Component_2. 'declare ...'
@@ -963,159 +1063,259 @@ package body WisiToken.Parse.LR.McKenzie_Recover.Ada is
Label : constant String := "selected_component 1";
New_Config_1 : Configuration := Config;
begin
- New_Config_1.Error_Token.ID := Invalid_Token_ID;
+ New_Config_1.Error_Token := (True, Invalid_Token_ID, others =>
<>);
New_Config_1.Strategy_Counts (Language_Fix) :=
New_Config_1.Strategy_Counts (Language_Fix) + 1;
- Push_Back_Check (New_Config_1, (+IDENTIFIER_ID, +END_ID));
+ Push_Back_Check
+ (Super, Shared_Parser, New_Config_1, (Tree.Element_ID
(Config.Stack.Peek.Token), +END_ID),
+ Push_Back_Undo_Reduce => True);
+
+ if New_Config_1.Stack.Depth <= 3 then
+ raise Invalid_Case;
+ end if;
- case To_Token_Enum (New_Config_1.Stack.Peek (3).Token.ID) is
- when block_label_opt_ID =>
+ if Tree.Element_ID (New_Config_1.Stack.Peek (3).Token) =
+declarative_part_ID then
+ -- 'declare' is present; case 2
+ Insert (Super, Shared_Parser, New_Config_1, (+END_ID,
+IDENTIFIER_ID, +SEMICOLON_ID));
+ Local_Config_Heap.Add (New_Config_1);
+ else
-- no 'declare'; either case 1 or 2, so enqueue both
declare
New_Config_2 : Configuration := New_Config_1;
begin
- case To_Token_Enum (New_Config_2.Stack.Peek.Token.ID) is
- when handled_sequence_of_statements_ID =>
+ case To_Token_Enum (Tree.Element_ID
(New_Config_2.Stack.Peek.Token)) is
+ when handled_sequence_of_statements_ID |
+ sequence_of_statements_ID => -- see
test/ada_mode-recover_partial_24.adb
Push_Back_Check
- (New_Config_2,
- (+handled_sequence_of_statements_ID, +BEGIN_ID,
+block_label_opt_ID));
+ (Super, Shared_Parser, New_Config_2,
+ (+handled_sequence_of_statements_ID, +BEGIN_ID,
+label_opt_ID),
+ Push_Back_Undo_Reduce => True);
- when sequence_of_statements_ID =>
- -- see test/ada_mode-recover_partial_24.adb
- Push_Back_Check
- (New_Config_2,
- (+sequence_of_statements_ID, +BEGIN_ID,
+block_label_opt_ID));
+ when protected_operation_item_list_ID =>
+ -- ada_mode-recover_protected_01.adb
+ -- Can't be case 2.
+ raise Invalid_Case;
when others =>
- if Trace_McKenzie > Outline then
- Put ("Language_Fixes " & Label & " missing case 1 "
& Image
- (New_Config_2.Stack.Peek.Token.ID,
Descriptor), Config);
- end if;
- raise Bad_Config;
+ raise Bad_Config with "Language_Fixes " & Label & "
unimplemented case " & Image
+ (Tree.Element_ID (New_Config_2.Stack.Peek.Token),
Descriptor);
end case;
- Insert (New_Config_2, +END_ID);
- -- for case 1; let Minimal_Complete_Actions finish
insert.
+ Insert (Super, Shared_Parser, New_Config_2, (+END_ID,
+IDENTIFIER_ID, +SEMICOLON_ID));
Local_Config_Heap.Add (New_Config_2);
- if Length (New_Config_2.Ops) > 0 then
+ if Trace_McKenzie > Detail then
Put ("Language_Fixes " & Label, New_Config_2);
end if;
exception
- when Bad_Config =>
- -- We don't check Debug_Mode here, because the failure
is probably
- -- due to pushing back a virtual token, which is not a
programming
- -- error.
+ when Invalid_Case =>
null;
end;
- Insert (New_Config_1, +END_ID);
- -- for case 2; let Minimal_Complete_Actions finish insert.
+ Insert (Super, Shared_Parser, New_Config_1, (+END_ID,
+IDENTIFIER_ID, +SEMICOLON_ID));
Local_Config_Heap.Add (New_Config_1);
-
- when declarative_part_opt_ID =>
- -- 'declare' is present; case 2
- Insert (New_Config_1, +END_ID);
- Local_Config_Heap.Add (New_Config_1);
-
- when others =>
- if Trace_McKenzie > Outline then
- Put ("Language_Fixes " & Label & " missing case 2 " &
Image
- (New_Config_1.Stack.Peek (3).Token.ID,
Descriptor), Config);
- Trace.Put_Line ("... new_config stack: " & Image
(New_Config_1.Stack, Descriptor));
- end if;
- raise Bad_Config;
- end case;
+ end if;
if Trace_McKenzie > Detail then
Put ("Language_Fixes " & Label, New_Config_1);
end if;
exception
- when Bad_Config =>
+ when Invalid_Case =>
null;
end;
end if;
- elsif Config.Error_Token.ID = +IDENTIFIER_ID and
- Config.Stack.Peek.Token.ID = +END_ID
+ elsif To_Token_Enum (Tree.Element_ID (Config.Error_Token)) in
+ IDENTIFIER_ID | CASE_ID | IF_ID | LOOP_ID | RECORD_ID | RETURN_ID |
SELECT_ID | name_opt_ID and
+ Tree.Element_ID (Config.Stack.Peek.Token) = +END_ID
then
- -- We've encountered an identifier after 'end' when expecting a
- -- keyword. See test/ada_mode-recover_26.adb,
test/ada_mode-recover_20.adb.
- --
- -- If a matching 'begin name' is found on the stack, the input looks
like:
+ -- We've encountered a token after 'end' when expecting a
+ -- different token. See test/ada_mode-recover_17, _20, _24, _26,
_39.adb.
--
- -- 1) "<begin_name_token> ... begin ... <compound_statement_begin>
... end <end_name_token> ;"
+ -- There are several cases:
--
- -- There is a missing 'end <compound_statement_id> ;' before the
+ -- a: There is a missing 'end <compound_statement_id> ;' before the
-- 'end'. We can get the ID to insert from Parse_Table
-- Minimal_Complete_Actions.
--
- -- When searching for the matching name, we must allow name to be a
- -- selected_component; see test/ada_mode-recover_20.adb.
+ -- b: If the error token is IDENTIFIER or name_opt, and there is not
+ -- a matching name, the error token should be something else; delete
+ -- it.
--
- -- Minimal_Complete_Actions can handle this case, but it inserts
- -- '<compound_statement_id> ; end' instead. We want to insert 'end
+ -- If there is a matching name, Minimal_Complete_Actions inserts
+ -- '<compound_statement_id> ;'. We want to insert 'end
-- <id> ;' before the existing 'end', so Insert_After places the
- -- tokens better; see test/ada_mode-recover_20.adb.
+ -- tokens better; see test/ada_mode-recover_17, _20.adb.
+ --
+ -- c: There is a missing 'end <name>;' before the 'end'
+ --
+ -- d: There is a missing matching component_statement start
+ --
+ -- We can't reliably distinguish between a: and b:, so we do both. c:
+ -- is distinquished by the minimal action being 'reduce to name'. d:
+ -- is distinguished by searching for an open matching
+ -- component_statement start.
+
declare
- function Get_End_Name return String
+ procedure Insert_End_Token_Semi (Label : in String; New_Config :
in out Configuration)
is
- use Standard.Ada.Strings.Unbounded;
- Result : Unbounded_String := +Lexer.Buffer_Text
(Config.Error_Token.Byte_Region);
- I : WisiToken.Token_Index :=
Config.Error_Token.Min_Terminal_Index + 1;
+ End_ID_Actions : constant Minimal_Action_Arrays.Vector :=
Shared_Parser.Table.States
+ (Config.Stack.Peek.State).Minimal_Complete_Actions;
begin
- loop
- exit when I > Terminals.Last_Index;
- exit when -Terminals (I).ID not in IDENTIFIER_ID | DOT_ID;
- Result := Result & Lexer.Buffer_Text (Terminals
(I).Byte_Region);
- I := I + 1;
- end loop;
- return -Result;
- end Get_End_Name;
+ if End_ID_Actions.Length /= 1 then
+ -- FIXME: do all actions? need a test case
+ raise Bad_Config with "Language_Fixes Insert_End_Token_Semi
multiple actions";
+
+ else
+ New_Config.Error_Token := (True, Invalid_Token_ID, others =>
<>);
+
+ New_Config.Strategy_Counts (Language_Fix) :=
New_Config.Strategy_Counts (Language_Fix) + 1;
+
+ Push_Back_Check (Super, Shared_Parser, New_Config, +END_ID,
Push_Back_Undo_Reduce => True);
- End_ID_Actions : constant Minimal_Action_Arrays.Vector :=
Parse_Table.States
- (Config.Stack.Peek.State).Minimal_Complete_Actions;
- End_Name : constant String := Get_End_Name;
+ case End_ID_Actions (End_ID_Actions.First_Index).Verb is
+ when Shift =>
+ -- case a or b
+
+ -- Inserting the end keyword and semicolon here avoids
the costs added by
+ -- Insert_Minimal_Complete_Actions.
+ Insert
+ (Super, Shared_Parser, New_Config,
+ (+END_ID, End_ID_Actions
(End_ID_Actions.First_Index).ID, +SEMICOLON_ID));
+
+ Local_Config_Heap.Add (New_Config);
+ if Trace_McKenzie > Detail then
+ Put ("Language_Fixes " & "wrong end keyword a",
New_Config);
+ end if;
- Matching_Name_Index : SAL.Peek_Type := 2; -- start search before
'end'
+ when Reduce =>
+ -- case c: ada_mode-recover_39.adb.
+ Insert (Super, Shared_Parser, New_Config, (+END_ID,
+IDENTIFIER_ID, +SEMICOLON_ID));
+
+ Local_Config_Heap.Add (New_Config);
+ if Trace_McKenzie > Detail then
+ Put ("Language_Fixes " & Label, New_Config);
+ end if;
+ end case;
+ end if;
+ end Insert_End_Token_Semi;
begin
- Find_Matching_Name (Config, Lexer, End_Name, Matching_Name_Index,
Case_Insensitive => True);
+ if not (To_Token_Enum (Tree.Element_ID (Config.Error_Token)) in
IDENTIFIER_ID | name_opt_ID) then
+ -- First exclude case b
+ declare
+ New_Config : aliased Configuration := Config;
+ Error_Token_ID : constant Token_ID := Tree.Element_ID
(New_Config.Error_Token);
+ Found : constant Boolean := Find_ID (Tree,
New_Config, Error_Token_ID);
+ begin
+ if not Found then
+ -- case d. ada_mode-recover_extra_end_loop.adb
+ New_Config.Error_Token := (True, Invalid_Token_ID, others
=> <>);
+
+ New_Config.Strategy_Counts (Language_Fix) :=
New_Config.Strategy_Counts (Language_Fix) + 1;
+
+ -- We could push_back 'end' and insert a matching start,
but it's
+ -- simpler to delete 'end <keyword> ;'
+ Push_Back (Super, Shared_Parser, New_Config,
Push_Back_Undo_Reduce => True); -- END_ID
+ declare
+ Peek_State : Peek_Sequential_State :=
Peek_Sequential_Start (Super, Shared_Parser, New_Config);
+ begin
+ Delete_Check (Super, Shared_Parser, New_Config,
Peek_State, +END_ID);
+ Delete_Check (Super, Shared_Parser, New_Config,
Peek_State, Error_Token_ID);
+ if +SEMICOLON_ID = Tree.ID
+
(WisiToken.Parse.LR.McKenzie_Recover.Parse.Peek_Current_First_Sequential_Terminal
+ (Super, Shared_Parser, Config))
+ then
+ -- Might not be there while typing code;
ada_mode-interactive_09.adb
+ Delete_Check (Super, Shared_Parser, New_Config,
Peek_State, +SEMICOLON_ID);
+ end if;
+ end;
+ Local_Config_Heap.Add (New_Config);
+ if Trace_McKenzie > Detail then
+ Put ("Language_Fixes wrong end name", New_Config);
+ end if;
+
+ else
+ Insert_End_Token_Semi ("wrong end keyword c", New_Config);
+
+ end if;
+ exception
+ when Invalid_Case =>
+ null;
+ end;
+ end if;
- if Matching_Name_Index < Config.Stack.Depth and then
- End_ID_Actions.Length = 1 and then
- End_ID_Actions (End_ID_Actions.First_Index).Verb = Shift
- then
+ -- Now try case b.
+ if Tree.Element_ID (Config.Error_Token) in +IDENTIFIER_ID |
+name_opt_ID then
declare
- Label : constant String := "missing end keyword";
- New_Config : Configuration := Config;
+ New_Config : aliased Configuration := Config;
+
+ function Get_End_Name return String
+ is
+ use Standard.Ada.Strings.Unbounded;
+ Result : Unbounded_String := +Tree.Lexer.Buffer_Text
+ (Tree.Byte_Region (New_Config.Error_Token));
+ begin
+ if Tree.Element_Is_Terminal (New_Config.Error_Token) then
+ declare
+ Peek_State : Peek_Sequential_State :=
Peek_Sequential_Start
+ (Super, Shared_Parser, New_Config);
+ begin
+ loop
+ Peek_Next_Sequential_Terminal (Tree, Peek_State);
+ exit when Peek_Sequential_Terminal (Peek_State)
= Invalid_Node_Access;
+ exit when -Tree.ID (Peek_Sequential_Terminal
(Peek_State)) not in
+ IDENTIFIER_ID | DOT_ID;
+ Result := Result & Tree.Lexer.Buffer_Text
+ (Tree.Byte_Region
+ (Peek_Sequential_Terminal (Peek_State),
Trailing_Non_Grammar => False));
+ end loop;
+ end;
+ end if;
+ return -Result;
+ end Get_End_Name;
+
+ End_Name : constant String := Get_End_Name;
+ Matching_Name_Index : SAL.Peek_Type := 2; -- start search
before 'end'
+
begin
- New_Config.Error_Token.ID := Invalid_Token_ID;
+ Find_Matching_Name
+ (New_Config, Tree, End_Name, Matching_Name_Index,
Case_Insensitive => True);
- New_Config.Strategy_Counts (Language_Fix) :=
New_Config.Strategy_Counts (Language_Fix) + 1;
+ if Matching_Name_Index < New_Config.Stack.Depth then
+ -- Matching name found; insert 'end ... ;' before the
+ -- existing 'end'.
+ Insert_End_Token_Semi ("wrong end keyword b 1",
New_Config);
- Push_Back_Check (New_Config, +END_ID);
+ else
+ declare
+ Label : constant String := "wrong end keyword b 2";
+ begin
+ -- Matching name not found: delete Error_Token
+ New_Config.Strategy_Counts (Language_Fix) := @ + 1;
- -- Inserting the end keyword and semicolon here avoids the
costs added by
- -- Insert_Minimal_Complete_Actions.
- Insert (New_Config, (+END_ID, End_ID_Actions
(End_ID_Actions.First_Index).ID, +SEMICOLON_ID));
+ Delete_Check (Super, Shared_Parser, New_Config,
Invalid_Token_ID);
- Local_Config_Heap.Add (New_Config);
- if Trace_McKenzie > Detail then
- Put ("Language_Fixes " & Label, New_Config);
+ New_Config.Error_Token := (True, Invalid_Token_ID,
others => <>);
+
+ Local_Config_Heap.Add (New_Config);
+ if Trace_McKenzie > Detail then
+ Put ("Language_Fixes " & Label, New_Config);
+ end if;
+ end;
end if;
exception
- when Bad_Config =>
+ when Invalid_Case =>
null;
end;
end if;
end;
- elsif To_Token_Enum (Config.Error_Token.ID) in PRAGMA_ID | USE_ID and
- Config.Stack.Peek.Token.ID = +BEGIN_ID
+ elsif To_Token_Enum (Tree.Element_ID (Config.Error_Token)) in PRAGMA_ID
| USE_ID and
+ Tree.Element_ID (Config.Stack.Peek.Token) = +BEGIN_ID
then
-- Code looks like:
--
@@ -1125,36 +1325,36 @@ package body WisiToken.Parse.LR.McKenzie_Recover.Ada is
-- There is an extra 'begin' before 'use' or 'pragma'. See
-- test/ada_mode-recover_14.adb. Delete the 'begin'.
- if Push_Back_Valid (Config) then
+ if Push_Back_Valid (Super, Shared_Parser, Config,
Push_Back_Undo_Reduce => True) then
declare
New_Config : Configuration := Config;
begin
New_Config.Strategy_Counts (Language_Fix) :=
New_Config.Strategy_Counts (Language_Fix) + 1;
- Push_Back_Check (New_Config, +BEGIN_ID);
+ Push_Back_Check (Super, Shared_Parser, New_Config, +BEGIN_ID,
Push_Back_Undo_Reduce => True);
- if Undo_Reduce_Valid (New_Config.Stack, Tree) and then
- -New_Config.Stack.Peek.Token.ID in declarative_part_opt_ID |
block_label_opt_ID
- then
- Undo_Reduce_Check (New_Config, Tree,
New_Config.Stack.Peek.Token.ID);
- else
- if Trace_McKenzie > Detail then
- Put ("Language_Fixes extra begin 2 unimplemented case",
New_Config);
+ if Tree.Element_ID (New_Config.Stack.Peek.Token) =
+declarative_part_ID then
+ if Undo_Reduce_Valid (Super, Shared_Parser, New_Config) then
+ Undo_Reduce_Check (Super, Shared_Parser, New_Config,
+declarative_part_ID);
+ else
+ raise Invalid_Case;
end if;
- raise Bad_Config;
end if;
- Delete_Check (Terminals, New_Config, +BEGIN_ID);
+ Delete_Check (Super, Shared_Parser, New_Config, +BEGIN_ID);
Local_Config_Heap.Add (New_Config);
if Trace_McKenzie > Detail then
Put ("Language_Fixes extra begin 2", New_Config);
end if;
+ exception
+ when Invalid_Case =>
+ null;
end;
end if;
- elsif Config.Error_Token.ID = +OR_ID and then
- Config.Stack.Peek.Token.ID = +expression_opt_ID
+ elsif Tree.Element_ID (Config.Error_Token) = +OR_ID and then
+ Tree.Element_ID (Config.Stack.Peek.Token) = +expression_ID
then
-- Code looks like:
--
@@ -1163,7 +1363,7 @@ package body WisiToken.Parse.LR.McKenzie_Recover.Ada is
-- where 'expr1 and expr2' is in the expression on the stack. Missing
-- left paren before expr1. See test/ada_mode-recover_20.adb.
--
- -- We could check for the presence of 'and' in expression_opt, but
+ -- We could check for the presence of 'and' in expression, but
-- that requires a syntax tree. If the left paren doesn't help, this
-- config will be dropped.
@@ -1172,71 +1372,98 @@ package body WisiToken.Parse.LR.McKenzie_Recover.Ada is
begin
New_Config.Strategy_Counts (Language_Fix) :=
New_Config.Strategy_Counts (Language_Fix) + 1;
- if Push_Back_Valid (New_Config) then
- Push_Back_Check (New_Config, +expression_opt_ID);
- else
- raise Bad_Config;
- end if;
+ Push_Back_Check (Super, Shared_Parser, New_Config, +expression_ID,
Push_Back_Undo_Reduce => True);
- Insert (New_Config, +LEFT_PAREN_ID);
+ Insert (Super, Shared_Parser, New_Config, +LEFT_PAREN_ID);
-- Minimal_Complete will add the matching right paren.
Local_Config_Heap.Add (New_Config);
if Trace_McKenzie > Detail then
Put ("Language_Fixes and/or", New_Config);
end if;
+ exception
+ when Invalid_Case =>
+ null;
end;
- elsif Config.Error_Token.ID = +TICK_1_ID and Config.Error_Token.Virtual
= False then
- -- Editing "Put ('|');" => "Put ('|-');"; need to change ' to ".
- --
- -- We can get here with Virtual = False if this Error_Token comes
- -- from McKenzie_Recover.Parse.Parse rather than the main parser.
+ elsif Tree.Element_ID (Config.Error_Token) = +TICK_1_ID and
Config.Error_Token.Virtual = False then
+ -- Maybe editing "Put ('|');" => "Put ('|-');"; need to change ' to
".
+ -- ada_mode-recover_string_quote_6.adb is not doing this.
declare
- New_Config : Configuration := Config;
+ New_Config : aliased Configuration := Config;
+ Token_Count : Integer := 0;
begin
New_Config.Strategy_Counts (Language_Fix) :=
New_Config.Strategy_Counts (Language_Fix) + 1;
declare
- Index : WisiToken.Token_Index :=
New_Config.Current_Shared_Token;
- Start_Line : constant WisiToken.Line_Number_Type := Terminals
- (Config.Error_Token.Min_Terminal_Index).Line;
+ Peek_State : Peek_Sequential_State := Peek_Sequential_Start
(Super, Shared_Parser, New_Config);
+ pragma Assert
+ (Tree.Element_ID (New_Config.Error_Token) = Tree.ID
(Peek_Sequential_Terminal (Peek_State)));
begin
- Delete_Check (Terminals, New_Config, Index, +TICK_1_ID); --
increments index
+ Delete_Check (Super, Shared_Parser, New_Config, Peek_State,
+TICK_1_ID); -- increments Peek_State
loop
- if Index > Terminals.Last_Index then
- raise Bad_Config;
- end if;
- if Terminals (Index).Line /= Start_Line then
- raise Bad_Config;
+ Delete_Check (Super, Shared_Parser, New_Config, Peek_State,
Invalid_Token_ID);
+ Token_Count := @ + 1;
+ if Peek_Sequential_Terminal (Peek_State) =
Invalid_Node_Access or
+ -- ada_mode-interactive_01.adb,
ada_mode-recover_string_quote_6.adb
+ Token_Count > 9
+ then
+ raise Invalid_Case;
end if;
- exit when Terminals (Index).ID = +TICK_1_ID;
- Delete (Terminals, New_Config, Index); -- increments index
+ exit when Tree.ID (Peek_Sequential_Terminal (Peek_State)) =
+TICK_1_ID;
end loop;
- Delete_Check (Terminals, New_Config, Index, +TICK_1_ID);
- Insert (New_Config, Index, +STRING_LITERAL_ID);
+ Delete_Check (Super, Shared_Parser, New_Config, Peek_State,
+TICK_1_ID);
+ Insert (Super, Shared_Parser, New_Config,
Peek_Sequential_Terminal (Peek_State), +STRING_LITERAL_ID);
end;
Local_Config_Heap.Add (New_Config);
if Trace_McKenzie > Detail then
Put ("Language_Fixes char_literal to string", New_Config);
end if;
+ exception
+ when Invalid_Case =>
+ null;
end;
+
+ elsif Tree.Element_ID (Config.Error_Token) = +IN_ID and then
+ (Tree.Element_ID (Config.Stack.Peek.Token) = +COLON_ID and
+ Tree.Element_ID (Config.Stack.Peek (2).Token) =
+defining_identifier_list_ID)
+ then
+ -- See test/ada_mode-recover_partial_03.adb.
+ -- Code looks like:
+ --
+ -- is Node : in Valid_Node_Index)
+ --
+ -- error on "in"; missing 'procedure IDENTIFIER (' before 'Node'
+ declare
+ New_Config : Configuration := Config;
+ begin
+ New_Config.Strategy_Counts (Language_Fix) :=
New_Config.Strategy_Counts (Language_Fix) + 1;
+
+ Push_Back_Check
+ (Super, Shared_Parser, New_Config, (+COLON_ID,
+defining_identifier_list_ID),
+ Push_Back_Undo_Reduce => True);
+
+ -- We could search ahead for 'return', but that's not simple; let
+ -- recover handle it.
+ Insert (Super, Shared_Parser, New_Config, (+PROCEDURE_ID,
+IDENTIFIER_ID, +LEFT_PAREN_ID));
+
+ Local_Config_Heap.Add (New_Config);
+ if Trace_McKenzie > Detail then
+ Put ("Language_Fixes exposed argument list", New_Config);
+ end if;
+ exception
+ when Invalid_Case =>
+ null;
+ end;
+
end if;
exception
when Bad_Config =>
- null;
-
- when E : System.Assertions.Assert_Failure =>
if Debug_Mode then
- Trace.Put
- ("Language_Fixes Handle_Parse_Error assert fail: " &
- Standard.Ada.Exceptions.Exception_Message (E),
- Prefix => True);
- Trace.New_Line;
raise;
elsif Trace_McKenzie > Outline then
- Trace.Put_Line ("Language_Fixes Handle_Parse_Error assert fail");
+ Tree.Lexer.Trace.Put_Line ("Language_Fixes Handle_Parse_Error
Bad_Config");
end if;
end Handle_Parse_Error;
@@ -1244,40 +1471,43 @@ package body WisiToken.Parse.LR.McKenzie_Recover.Ada is
-- Public subprograms
procedure Language_Fixes
- (Trace : in out WisiToken.Trace'Class;
- Lexer : access constant WisiToken.Lexer.Instance'Class;
- Parser_Label : in Natural;
- Parse_Table : in WisiToken.Parse.LR.Parse_Table;
- Terminals : in Base_Token_Arrays.Vector;
- Tree : in Syntax_Trees.Tree;
+ (Super : in out
WisiToken.Parse.LR.McKenzie_Recover.Base.Supervisor;
+ Shared_Parser : in out Parser.Parser;
+ Parser_Index : in SAL.Peek_Type;
Local_Config_Heap : in out Config_Heaps.Heap_Type;
Config : in Configuration)
is begin
if Trace_McKenzie > Extra then
- Put ("Language_Fixes", Trace, Parser_Label, Terminals, Config);
- Put_Line (Trace, Parser_Label, "config stack: " & Image
(Config.Stack, Descriptor));
+ Put ("Language_Fixes", Shared_Parser.Tree, Super.Stream
(Parser_Index), Config);
+ Put_Line (Shared_Parser.Tree, Super.Stream (Parser_Index),
+ "config stack: " & Image (Config.Stack,
Shared_Parser.Tree));
end if;
- case Config.Check_Status.Label is
+ case Config.In_Parse_Action_Status.Label is
when Ok =>
- Handle_Parse_Error (Trace, Lexer, Parser_Label, Parse_Table,
Terminals, Tree, Local_Config_Heap, Config);
+ Handle_Parse_Error (Super, Shared_Parser, Parser_Index,
Local_Config_Heap, Config);
when others =>
- Handle_Check_Fail (Trace, Lexer, Parser_Label, Parse_Table,
Terminals, Tree, Local_Config_Heap, Config);
+ Handle_In_Parse_Action_Fail (Super, Shared_Parser, Parser_Index,
Local_Config_Heap, Config);
end case;
end Language_Fixes;
procedure Matching_Begin_Tokens
- (Tokens : in Token_ID_Array_1_3;
- Config : in Configuration;
- Matching_Tokens : out Token_ID_Arrays.Vector;
- Forbid_Minimal_Complete : out Boolean)
+ (Super : in out
WisiToken.Parse.LR.McKenzie_Recover.Base.Supervisor;
+ Shared_Parser : in out Parser.Parser;
+ Tokens : in Token_ID_Array_1_3;
+ Config : aliased in Configuration;
+ Matching_Tokens : in out Token_ID_Arrays.Vector;
+ Forbid_Minimal_Complete : in out Boolean)
is
- use Ada_Process_Actions;
use Token_ID_Arrays;
- function Matching_Begin_For_End (Next_Index : in Positive) return
Token_ID_Arrays.Vector
- is begin
+ Tree : Syntax_Trees.Tree renames Shared_Parser.Tree;
+
+ function Matching_Begin_For_End return Token_ID_Arrays.Vector
+ is
+ Next_Index : constant Positive := 2;
+ begin
return Result : Token_ID_Arrays.Vector do
if Tokens (Next_Index) = Invalid_Token_ID then
-- Better to delete 'end'
@@ -1288,13 +1518,45 @@ package body WisiToken.Parse.LR.McKenzie_Recover.Ada is
Result := To_Vector (Tokens (Next_Index));
when IDENTIFIER_ID =>
- if Tokens (Next_Index + 1) /= Invalid_Token_ID and then
- To_Token_Enum (Tokens (Next_Index + 1)) = DOT_ID
- then
- Result := To_Vector ((+PACKAGE_ID, +BODY_ID,
+IDENTIFIER_ID, +IS_ID)); -- package body
- else
- Result := To_Vector ((+IDENTIFIER_ID, +COLON_ID,
+BEGIN_ID)); -- named block begin
- end if;
+ -- Check for existing 'begin' with matching name.
ada_mode-recover_03.adb
+ declare
+ function Get_End_Name return String
+ is
+ use Standard.Ada.Strings.Unbounded;
+ use Syntax_Trees;
+ Result : Unbounded_String;
+
+ Peek_State : Peek_Sequential_State :=
Peek_Sequential_Start (Super, Shared_Parser, Config);
+ begin
+ loop
+ Peek_Next_Sequential_Terminal (Tree, Peek_State);
+ exit when Peek_Sequential_Terminal (Peek_State) =
Invalid_Node_Access;
+ exit when -Tree.ID (Peek_Sequential_Terminal
(Peek_State)) not in
+ IDENTIFIER_ID | DOT_ID;
+ Result := Result & Tree.Lexer.Buffer_Text
+ (Tree.Byte_Region (Peek_Sequential_Terminal
(Peek_State), Trailing_Non_Grammar => False));
+ end loop;
+ return -Result;
+ end Get_End_Name;
+
+ End_Name : constant String := Get_End_Name;
+ Matching_Name_Index : SAL.Peek_Type := 1;
+ begin
+ Find_Matching_Name
+ (Config, Tree, End_Name, Matching_Name_Index,
Case_Insensitive => True);
+
+ if Matching_Name_Index < Config.Stack.Depth then
+ -- Matching name found; let minimal_complete handle
it.
+ null;
+
+ elsif Tokens (Next_Index + 1) /= Invalid_Token_ID and then
+ To_Token_Enum (Tokens (Next_Index + 1)) = DOT_ID
+ then
+ Result := To_Vector ((+PACKAGE_ID, +BODY_ID,
+IDENTIFIER_ID, +IS_ID)); -- package body
+ else
+ Result := To_Vector ((+IDENTIFIER_ID, +COLON_ID,
+BEGIN_ID)); -- named block begin
+ end if;
+ end;
when SEMICOLON_ID =>
Result := To_Vector (+BEGIN_ID);
@@ -1307,34 +1569,119 @@ package body WisiToken.Parse.LR.McKenzie_Recover.Ada is
end Matching_Begin_For_End;
begin
+ Forbid_Minimal_Complete := False;
+
case To_Token_Enum (Tokens (1)) is
+ -- Token_Enum_ID alphabetical order
+ when COMMA_ID =>
+ -- Commas always occur in parens; if no left paren on stack, insert
+ -- one. Also start an expression before the comma.
+ -- ada_mode-recover_39.adb
+ Forbid_Minimal_Complete := True;
+
+ if Stack_Has (Tree, Config.Stack, +LEFT_PAREN_ID) then
+ Matching_Tokens := To_Vector (+IDENTIFIER_ID);
+ else
+ Matching_Tokens := To_Vector ((+IDENTIFIER_ID, +LEFT_PAREN_ID,
+IDENTIFIER_ID));
+ end if;
+
when END_ID =>
- Matching_Tokens := Matching_Begin_For_End (2);
+ if Config.Stack.Depth = 1 then
+ -- ada_mode-partial_parse.adb
+ return;
+ end if;
- when ELSE_ID | ELSIF_ID | THEN_ID =>
- Matching_Tokens := To_Vector (+IF_ID);
+ case To_Token_Enum (Tree.Element_ID (Config.Stack.Peek.Token)) is
+ when
+ ABORT_ID | -- asynchronous_select
+ BEGIN_ID | -- ada_mode-recover_indent_3.adb
+ DO_ID | -- return_statement, accept_statement
+ ELSE_ID | -- if_statement, select_statement, conditional_entry_call
+ THEN_ID =>
+ -- Empty sequence_of_statements. This can be handled by
+ -- minimal_complete, but we want to prevent
Matching_Begin_For_End,
+ -- and we know what to insert.
+ Matching_Tokens := To_Vector ((+NULL_ID, +SEMICOLON_ID));
+ Forbid_Minimal_Complete := True;
+
+ when LOOP_ID =>
+ if To_Token_Enum (Tree.Element_ID (Config.Stack.Peek (2).Token)) =
END_ID then
+ -- Let minimal_complete insert the semicolon.
+ return;
+ else
+ -- empty sequence of statements.
+ Matching_Tokens := To_Vector ((+NULL_ID, +SEMICOLON_ID));
+ Forbid_Minimal_Complete := True;
+ end if;
- when EXCEPTION_ID =>
- Matching_Tokens := To_Vector (+BEGIN_ID);
+ when
+ AND_ID | -- parallel_block_statement or expression
+ IS_ID | -- variant_part,package_spec, *_body, case_statement ...
+ OR_ID | -- timed_entry_call, expression
+ PRIVATE_ID | -- package_specification, protected_definition,
task_item_list
+ RECORD_ID -- record_representation_clause or record_defition
+ =>
+ -- We don't know what to insert; let minimal_complete handle it.
+ return;
+
+ when others =>
+ Matching_Tokens := Matching_Begin_For_End;
+ end case;
+
+ when ELSE_ID | ELSIF_ID =>
+ if Tree.Element_ID (Config.Stack.Peek.Token) = +THEN_ID then
+ -- Empty sequence_of_statements in 'if then else';
ada_mode-recover_27.adb
+ Matching_Tokens := To_Vector ((+NULL_ID, +SEMICOLON_ID));
+ Forbid_Minimal_Complete := True;
+ else
+ -- ada_mode-recover_40.adb
+ Matching_Tokens := To_Vector ((+IF_ID, +IDENTIFIER_ID, +THEN_ID,
+NULL_ID, +SEMICOLON_ID));
+ end if;
+
+ when THEN_ID =>
+ if Tree.Element_ID (Config.Stack.Peek.Token) = +IF_ID then
+ -- Empty expression in 'if then'
+ Matching_Tokens := To_Vector (+IDENTIFIER_ID);
+ Forbid_Minimal_Complete := True;
+ else
+ Matching_Tokens := To_Vector ((+IF_ID, +IDENTIFIER_ID));
+ end if;
+ when EXCEPTION_ID =>
+ if Tree.Element_ID (Config.Stack.Peek.Token) = +BEGIN_ID then
+ -- Empty sequence_of_statements
+ Matching_Tokens := To_Vector ((+NULL_ID, +SEMICOLON_ID));
+ Forbid_Minimal_Complete := True;
+ else
+ Matching_Tokens := To_Vector (+BEGIN_ID);
+ end if;
-- We don't return LEFT_PAREN for RIGHT_PAREN; better to delete it.
when WHEN_ID =>
- Matching_Tokens := To_Vector ((+CASE_ID, +IDENTIFIER_ID, +IS_ID));
+ if Tree.Element_ID (Config.Stack.Peek.Token) = +EQUAL_GREATER_ID then
+ -- Empty sequence_of_statements
+ Matching_Tokens := To_Vector ((+NULL_ID, +SEMICOLON_ID));
+ Forbid_Minimal_Complete := True;
+ else
+ Matching_Tokens := To_Vector ((+CASE_ID, +IDENTIFIER_ID, +IS_ID));
+ end if;
when others =>
null;
end case;
- if Config.Stack.Peek.Token.ID = +END_ID and
- ((Tokens (1) = +IDENTIFIER_ID and
- (Tokens (2) /= Invalid_Token_ID and then
- -Tokens (2) in DOT_ID | SEMICOLON_ID)) or
- End_Keyword_IDs (Tokens (1)))
- then
- Forbid_Minimal_Complete := True;
- else
- Forbid_Minimal_Complete := False;
+ if not Forbid_Minimal_Complete then
+ if Tree.Element_ID (Config.Stack.Peek.Token) = +END_ID and
+ ((Tokens (1) = +IDENTIFIER_ID and
+ (Tokens (2) /= Invalid_Token_ID and then
+ -Tokens (2) in DOT_ID | SEMICOLON_ID)) or
+ End_Keyword_IDs (Tokens (1)))
+ then
+ Forbid_Minimal_Complete := True;
+
+ else
+ Forbid_Minimal_Complete := False;
+ end if;
end if;
end Matching_Begin_Tokens;
@@ -1342,9 +1689,7 @@ package body WisiToken.Parse.LR.McKenzie_Recover.Ada is
(Descriptor : in WisiToken.Descriptor;
String_Literal_ID : in Token_ID)
return Token_ID_Set
- is
- use Ada_Process_Actions;
- begin
+ is begin
-- Character literal can be part of a string primary, so the nonterms
-- are independent of String_Literal_ID.
@@ -1355,7 +1700,6 @@ package body WisiToken.Parse.LR.McKenzie_Recover.Ada is
Result (+primary_ID) := True;
Result (+factor_ID) := True;
Result (+term_ID) := True;
- Result (+term_list_ID) := True;
Result (+simple_expression_ID) := True;
Result (+relation_ID) := True;
Result (+expression_ID) := True;
diff --git a/wisitoken-parse-lr-mckenzie_recover-ada.ads
b/wisitoken-parse-lr-mckenzie_recover-ada.ads
index a6df020cae..43e9358ca1 100644
--- a/wisitoken-parse-lr-mckenzie_recover-ada.ads
+++ b/wisitoken-parse-lr-mckenzie_recover-ada.ads
@@ -2,7 +2,7 @@
--
-- Ada language specific algorithms for McKenzie_Recover
--
--- Copyright (C) 2018, 2019 Free Software Foundation, Inc.
+-- Copyright (C) 2018 - 2022 Free Software Foundation, Inc.
--
-- This library is free software; you can redistribute it and/or modify it
-- under terms of the GNU General Public License as published by the Free
@@ -20,21 +20,20 @@ pragma License (Modified_GPL);
package WisiToken.Parse.LR.McKenzie_Recover.Ada is
procedure Language_Fixes
- (Trace : in out WisiToken.Trace'Class;
- Lexer : access constant WisiToken.Lexer.Instance'Class;
- Parser_Label : in Natural;
- Parse_Table : in WisiToken.Parse.LR.Parse_Table;
- Terminals : in Base_Token_Arrays.Vector;
- Tree : in Syntax_Trees.Tree;
+ (Super : in out
WisiToken.Parse.LR.McKenzie_Recover.Base.Supervisor;
+ Shared_Parser : in out Parser.Parser;
+ Parser_Index : in SAL.Peek_Type;
Local_Config_Heap : in out Config_Heaps.Heap_Type;
Config : in Configuration);
-- See wisitoken-parse-lr-parser.ads Language_Fixes_Access for description.
procedure Matching_Begin_Tokens
- (Tokens : in Token_ID_Array_1_3;
- Config : in Configuration;
- Matching_Tokens : out Token_ID_Arrays.Vector;
- Forbid_Minimal_Complete : out Boolean);
+ (Super : in out
WisiToken.Parse.LR.McKenzie_Recover.Base.Supervisor;
+ Shared_Parser : in out Parser.Parser;
+ Tokens : in Token_ID_Array_1_3;
+ Config : aliased in Configuration;
+ Matching_Tokens : in out Token_ID_Arrays.Vector;
+ Forbid_Minimal_Complete : in out Boolean);
-- See wisitoken-parse-lr-parser.ads Language_Matching_Begin_Tokens_Access
-- for description.
- [elpa] externals/ada-mode updated (d5428433e3 -> 1bed747968), Stephen Leake, 2022/07/10
- [elpa] externals/ada-mode fa4f86a75b 1/6: Release ada-mode 7.2.1; minor bug fixes, Stephen Leake, 2022/07/10
- [elpa] externals/ada-mode ca7f481130 2/6: Merge commit 'd5428433e39f3de7168fdc891127a2dcff849904' into externals/ada-mode, Stephen Leake, 2022/07/10
- [elpa] externals/ada-mode 701457fc18 5/6: * benchmark-xref.el: Add copyright notice, Stephen Leake, 2022/07/10
- [elpa] externals/ada-mode 74978b1a90 3/6: Update to current devel version, for beta test,
Stephen Leake <=
- [elpa] externals/ada-mode 1bed747968 6/6: * Makefile (clean): New, Stephen Leake, 2022/07/10
- [elpa] externals/ada-mode c1dc7da319 4/6: * Makefile: Add byte-compile, Stephen Leake, 2022/07/10