Variable: semantic--elisp-parse-table

semantic--elisp-parse-table is a variable defined in el.el.gz.

Value

((bovine-toplevel
  (semantic-list
   #[771 "\300@!\211<\203B�\211@\30118�\211:\2052�\211@;\2052�\211A@9\2052�\211A@\2052�\3028<\2052�\3038<0\262\202<�\210\304\262\203B�\211\237\207\211\211:\205\223�\211@\3051w�\211:\205q�\211@;\205q�\211A@9\205q�\211A@\205q�\3028<\205q�\3038<0\262\202{�\210\304\262\203\221�\306@\3078\262!\203\221�\211A\262\202H�\211?\262\203\231�\207\310D\"\207"
	 [semantic-elisp-use-read
	  (error)
	  2 3 nil
	  (error)
	  vectorp 4 append]
	 9 "\n\n(fn VALS START END)"])))

Documentation

Top level bovination table for elisp.

Source Code

;; Defined in /usr/src/emacs/lisp/cedet/semantic/bovine/el.el.gz
;;; Parser
;;
(defvar semantic--elisp-parse-table
  `((bovine-toplevel
     (semantic-list
      ,(lambda (vals start end)
         (let ((tag (semantic-elisp-use-read (car vals))))
	   (cond
	    ((and (listp tag) (semantic-tag-p (car tag)))
	     ;; We got a list of tags back.  This list is
	     ;; returned here in the correct order, but this
	     ;; list gets reversed later, putting the correctly ordered
	     ;; items into reverse order later.
	     (nreverse tag))
	    ((semantic--tag-expanded-p tag)
	     ;; At this point, if `semantic-elisp-use-read' returned an
	     ;; already expanded tag (from definitions parsed inside an
	     ;; eval and compile wrapper), just pass it!
	     tag)
	    (t
	     ;; We got the basics of a single tag.
	     (append tag (list start end))))))))
    )
  "Top level bovination table for elisp.")