| blob | 5489765dcc859b7177824fb3da03aabdee2a76c3 |
1 ;;; semantic/lex-spp.el --- Semantic Lexical Pre-processor
3 ;; Copyright (C) 2006-2011 Free Software Foundation, Inc.
5 ;; Author: Eric M. Ludlam <zappo@gnu.org>
7 ;; This file is part of GNU Emacs.
9 ;; GNU Emacs is free software: you can redistribute it and/or modify
10 ;; it under the terms of the GNU General Public License as published by
11 ;; the Free Software Foundation, either version 3 of the License, or
12 ;; (at your option) any later version.
14 ;; GNU Emacs is distributed in the hope that it will be useful,
15 ;; but WITHOUT ANY WARRANTY; without even the implied warranty of
16 ;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 ;; GNU General Public License for more details.
19 ;; You should have received a copy of the GNU General Public License
20 ;; along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>.
22 ;;; Commentary:
23 ;;
24 ;; The Semantic Preprocessor works with semantic-lex to provide a phase
25 ;; during lexical analysis to do the work of a pre-processor.
26 ;;
27 ;; A pre-processor identifies lexical syntax mixed in with another language
28 ;; and replaces some keyword tokens with streams of alternate tokens.
29 ;;
30 ;; If you use SPP in your language, be sure to specify this in your
31 ;; semantic language setup function:
32 ;;
33 ;; (add-hook 'semantic-lex-reset-hooks 'semantic-lex-spp-reset-hook nil t)
34 ;;
35 ;;
36 ;; Special Lexical Tokens:
37 ;;
38 ;; There are several special lexical tokens that are used by the
39 ;; Semantic PreProcessor lexer. They are:
40 ;;
41 ;; Declarations:
42 ;; spp-macro-def - A definition of a lexical macro.
43 ;; spp-macro-undef - A removal of a definition of a lexical macro.
44 ;; spp-system-include - A system level include file
45 ;; spp-include - An include file
46 ;; spp-concat - A lexical token representing textual concatenation
47 ;; of symbol parts.
48 ;;
49 ;; Operational tokens:
50 ;; spp-arg-list - Represents an argument list to a macro.
51 ;; spp-symbol-merge - A request for multiple symbols to be textually merged.
52 ;;
53 ;;; TODO:
54 ;;
55 ;; Use `semantic-push-parser-warning' for situations where there are likely
56 ;; macros that are undefined unexpectedly, or other problem.
57 ;;
58 ;; TODO:
59 ;;
60 ;; Try to handle the case of:
61 ;;
62 ;; #define NN namespace nn {
63 ;; #define NN_END }
64 ;;
65 ;; NN
66 ;; int mydecl() {}
67 ;; NN_END
68 ;;
73 ;;; Code:
75 "Table of macro keywords used by the Semantic Preprocessor.
76 These symbols will be used in addition to those in
81 "Table of macro keywords for this project.
82 These symbols will be used in addition to those in
87 "Table of macro keywords used during lexical analysis.
88 Macros are lexical symbols which are replaced by other lexical
89 tokens during lexical analysis. During analysis symbols can be
99 ;; The above is not buffer local. Some macro expansions need to be
100 ;; dumped into a secondary buffer for re-lexing.
102 ;;; NON-RECURSIVE MACRO STACK
103 ;; C Pre-processor does not allow recursive macros. Here are some utils
104 ;; for managing the symbol stack of where we've been.
107 "With the macro NAME currently being expanded, execute BODY.
108 Pushes NAME into the macro stack. The above stack is checked
109 by `semantic-lex-spp-symbol' to not return true for any symbol
110 currently being expanded."
119 'edebug-setup-hook
124 )
126 ))
128 ;;; MACRO TABLE UTILS
129 ;;
130 ;; The dynamic macro table is a buffer local variable that is modified
131 ;; during the analysis. OBARRAYs are used, so the language must
132 ;; have symbols that are compatible with Emacs Lisp symbols.
133 ;;
135 "Return spp symbol with NAME or nil if not found.
136 The search priority is:
137 1. DYNAMIC symbols
138 2. PROJECT specified symbols.
139 3. SYSTEM specified symbols."
141 ;; Only strings...
143 ;; Make sure we don't recurse.
145 ;; Do the check of the various tables.
147 ;; DYNAMIC
150 ;; PROJECT
153 ;; SYSTEM
156 ;; ...
157 )))
160 "Return non-nil if a keyword with NAME exists in any keyword table."
162 t))
165 "Return the dynamic macro map for the current buffer."
171 "Return the dynamic macro map for the current buffer."
177 "Return non-nil if VALUE is valid."
188 "Enable debugging for symbol SYM.
189 Disable debugging by entering nothing."
196 "Validate the NAME and VALUE of a macro before it is set."
197 ; `(progn
198 ; (when (not (semantic-lex-spp-value-valid-p ,value))
199 ; (error "Symbol \"%s\" with bogus value %S" ,name ,value))
200 ; (when (and semantic-lex-spp-debug-symbol
201 ; (string= semantic-lex-spp-debug-symbol name))
202 ; (debug))
203 ; )
204 nil
205 )
208 "Set value of spp symbol with NAME to VALUE and return VALUE.
209 If optional OBARRAY-IN is non-nil, then use that obarray instead of
210 the dynamic map."
215 value))
218 "Remove the spp symbol with NAME.
219 If optional OBARRAY is non-nil, then use that obarray instead of
220 the dynamic map."
225 "Push macro NAME with VALUE into the map.
226 Reverse with `semantic-lex-spp-symbol-pop'."
233 )
235 ;; Make sure there is a stack
237 ;; If there is a value to push, then push it.
239 )
240 ;; Set our new value here.
242 ))
245 "Pop macro NAME from the stackmap into the orig map.
246 Reverse with `semantic-lex-spp-symbol-pop'."
252 )
255 ;; Nothing to pop, remove it.
257 ;; If there is a value to pop, then add it to the map.
260 )))
263 "Return replacement stream of macro with NAME."
269 "Convert spp macro list SPECS into an obarray and return it.
270 SPECS must be a list of (NAME . REPLACEMENT) elements, where:
272 NAME is the name of the spp macro symbol to define.
273 REPLACEMENT a string that would be substituted in for NAME."
275 ;; Create the symbol hash table
277 spec)
278 ;; fill it with stuff
285 semantic-lex-spp-macro-symbol-obarray))
286 semantic-lex-spp-macro-symbol-obarray))
289 "Return a list of spp macros and values.
290 The return list is meant to be saved in a semanticdb table."
297 macros)))
298 semantic-lex-spp-dynamic-macro-symbol-obarray))
299 macros))
302 "Return a list of spp macros as Lisp symbols.
303 The value of each symbol is the replacement stream."
309 semantic-lex-spp-macro-symbol-obarray))
314 semantic-lex-spp-project-macro-symbol-obarray))
319 semantic-lex-spp-dynamic-macro-symbol-obarray))
320 macros))
323 "Set the dynamic symbol table to NEW-ENTRIES.
324 For use with semanticdb restoration of state."
326 ;; Default obarray for below is the dynamic map.
330 "Reset anything needed by SPP for parsing.
331 In this case, reset the dynamic macro symbol table if
332 START is (point-min).
333 END is not used."
336 semantic-lex-spp-dynamic-macro-symbol-obarray-stack nil
337 ;; This shouldn't not be nil, but reset just in case.
338 semantic-lex-spp-expanded-macro-stack nil)
339 ))
341 ;;; MACRO EXPANSION: Simple cases
342 ;;
343 ;; If a user fills in the table with simple strings, we can
344 ;; support that by converting them into tokens with the
345 ;; various analyzers that are available.
348 "Extract a regexp from an ANALYZER and use to match VALUE.
349 Return non-nil if it matches"
354 nil))))
357 ))
360 "Convert lexical macro contents VAL into a macro expansion stream.
361 These are for simple macro expansions that a user may have typed in directly.
362 As such, we need to analyze the input text, to figure out what kind of real
363 lexical token we should be inserting in its place.
365 Argument VAL is the value of some macro to be converted into a stream.
366 BEG and END are the token bounds of the macro to be expanded
367 that will somehow gain a much longer token stream.
368 ARGVALUES are values for any arg list, or nil."
370 ;; We perform a replacement. Technically, this should
371 ;; be a full lexical step over the "val" string, but take
372 ;; a guess that its just a keyword or existing symbol.
373 ;;
374 ;; Probably a really bad idea. See how it goes.
376 semantic-lex-symbol-or-keyword val)
379 beg end
380 val)))
382 ;; Ok, the rest of these are various types of syntax.
383 ;; Conveniences for users that type in their symbol table.
385 semantic-lex-punctuation val)
388 semantic-lex-number val)
391 semantic-lex-paren-or-list val)
394 semantic-lex-string val)
397 ))
399 ;;; MACRO EXPANSION : Lexical token replacement
400 ;;
401 ;; When substituting in a macro from a token stream of formatted
402 ;; semantic lex tokens, things can be much more complicated.
403 ;;
404 ;; Some macros have arguments that get set into the dynamic macro
405 ;; table during replacement.
406 ;;
407 ;; In general, the macro tokens are substituted into the regular
408 ;; token stream, but placed under the characters of the original
409 ;; macro symbol.
410 ;;
411 ;; Argument lists are saved as a lexical token at the beginning
412 ;; of a replacement value.
415 "Convert the token TOK into a string.
416 If TOK is made of multiple tokens, convert those to text. This
417 conversion is needed if a macro has a merge symbol in it that
418 combines the text of two previously distinct symbols. For
419 example, in c:
421 #define (a,b) a ## b;
423 If optional string BLOCKTOK matches the expanded value, then do not
424 continue processing recursively."
427 )
429 ;; Recursion prevention
431 blocktok)
432 ;; A complex symbol
436 )
437 ;; Now that we have a symbol,
440 ;; This is another lexical token.
444 ;; This is a list of tokens.
450 val
452 ;; If val is nil, that's probably wrong.
453 ;; Found a system header case where this was true.
455 ;; Debug wierd stuff.
457 ))
459 txt)
461 ))
464 "If the macro value VAL has an argument list, return the arglist."
470 "Convert lexical macro contents VAL into a macro expansion stream.
471 Argument VAL is the value of some macro to be converted into a stream.
472 BEG and END are the token bounds of the macro to be expanded
473 that will somehow gain a much longer token stream.
474 ARGVALUES are values for any arg list, or nil.
475 See comments in code for information about how token streams are processed
476 and what valid VAL values are."
478 ;; A typical VAL value might be either a stream of tokens.
479 ;; Tokens saved into a macro stream always includes the text from the
480 ;; buffer, since the locations specified probably don't represent
481 ;; that text anymore, or even the same buffer.
482 ;;
483 ;; CASE 1: Simple token stream
484 ;;
485 ;; #define SUPER mysuper::
486 ;; ==>
487 ;;((symbol "mysuper" 480 . 487)
488 ;; (punctuation ":" 487 . 488)
489 ;; (punctuation ":" 488 . 489))
490 ;;
491 ;; CASE 2: Token stream with argument list
492 ;;
493 ;; #define INT_FCN(name) int name (int in)
494 ;; ==>
495 ;; ((spp-arg-list ("name") 558 . 564)
496 ;; (INT "int" 565 . 568)
497 ;; (symbol "name" 569 . 573)
498 ;; (semantic-list "(int in)" 574 . 582))
499 ;;
500 ;; In the second case, a macro with an argument list as the a rgs as the
501 ;; first entry.
502 ;;
503 ;; CASE 3: Symbol text merge
504 ;;
505 ;; #define TMP(a) foo_ ## a
506 ;; ==>
507 ;; ((spp-arg-list ("a") 20 . 23)
508 ;; (spp-symbol-merge ((symbol "foo_" 24 . 28) (symbol "a" 32 . 33))
509 ;; 24 . 33))
510 ;;
511 ;; Usually in conjunction with a macro with an argument, merging symbol
512 ;; parts is a way of fabricating new symbols from pieces inside the macro.
513 ;; These macros use `spp-symbol-merge' tokens whose TEXT part is another
514 ;; token stream. This sub-stream ought to consist of only 2 SYMBOL pieces,
515 ;; though I suppose keywords might be ok. The end result of this example
516 ;; merge symbol would be (symbol "foo_A" 24 . 33) where A is the symbol
517 ;; passed in from the arg list "a".
518 ;;
519 ;; CASE 4: Nested token streams
520 ;;
521 ;; #define FOO(f) f
522 ;; #define BLA bla FOO(foo)
523 ;; ==>
524 ;; ((INT "int" 82 . 85)
525 ;; (symbol "FOO" 86 . 89)
526 ;; (semantic-list "(foo)" 89 . 94))
527 ;;
528 ;; Nested token FOO shows up in the table of macros, and gets replace
529 ;; inline. This is the same as case 2.
535 )
536 ;; CASE 2: Dealing with the arg list.
538 ;; Skip the arg list.
541 ;; Push args into the replacement list.
549 )
551 ;; Set val-tmp after stripping arguments.
554 ;; CASE 1: Push everything else onto the list.
555 ;; Once the arg list is stripped off, CASE 2 is the same
556 ;; as CASE 1.
563 ;; Try to convert txt into a macro declaration. If it is
564 ;; not a macro, use nil.
566 ;; If our current token is a macro, then pull off the argument
567 ;; list.
571 )
572 ;; We need to peek at the next token when testing for
573 ;; used macros with arg lists.
575 )
578 ;; CASE 3: Merge symbols together.
580 ;; We need to merge the tokens in the 'text segement together,
581 ;; and produce a single symbol from it.
585 txt
589 ))
591 ;; CASE 2: Argument replacement. If a discovered symbol is in
592 ;; the active list of arguments, then we need to substitute
593 ;; in the new value.
597 )
602 ;; We used up these args. Pull from the stream.
604 )
607 ;; Don't recurse directly into this same fcn, because it is
608 ;; convenient to have plain string replacements too.
611 beg end AV))
612 ))
614 ;; This is a HACK for the C parser. The 'macros text
615 ;; property is some storage so that the parser can do
616 ;; some C specific text manipulations.
618 ;; Push our arg list onto the semantic list.
624 )
626 ;; CASE 1: Just another token in the stream.
628 ;; Nothing new.
631 )
632 )))
634 ;; CASE 2: The arg list we pushed onto the symbol table
635 ;; must now be removed.
638 ))
640 ;;; Macro Merging
641 ;;
642 ;; Used when token streams from different macros include eachother.
643 ;; Merged macro streams perform in place replacements.
646 "Merge elements from the RAW-STREAM together.
647 Handle spp-concat symbol concatenation.
648 Handle Nested macro replacements.
649 Return the cooked stream."
651 ;; Merge the stream
654 ;; handle hashhash, by skipping it.
656 ;; Now merge the symbols.
661 'spp-symbol-merge
665 cooked-stream)
666 ))
669 )
671 )
674 )
676 ;;; MACRO EXPANSION
677 ;;
678 ;; There are two types of expansion.
679 ;;
680 ;; 1. Expansion using a value made up of lexical tokens.
681 ;; 2. User input replacement from a plain string.
684 "Convert lexical macro contents VAL into a macro expansion stream.
685 Argument VAL is the value of some macro to be converted into a stream.
686 BEG and END are the token bounds of the macro to be expanded
687 that will somehow gain a much longer token stream.
688 ARGVALUES are values for any arg list, or nil."
690 ;; If val is nil, then just skip it.
692 ;; If it is a token, then return that token rebuilt.
696 ;; Test for a token list.
700 ;; Test for miscellaneous strings.
703 ))
705 ;;; --------------------------------------------------------
706 ;;;
707 ;;; ANALYZERS:
708 ;;;
710 ;;; Symbol Is Macro
711 ;;
712 ;; An analyzer that will push tokens from a macro in place
713 ;; of the macro symbol.
714 ;;
716 "Do the lexical replacement for SYM with VAL.
717 Argument BEG and END specify the bounds of SYM in the buffer."
723 )
725 ;; Check for arguments.
733 ;; NOTE: This used to be (point-at-eol), but
734 ;; that was too close for multi-line arguments
735 ;; to a macro. Point max may be too far if there
736 ;; is a typo in the buffer.
737 ;;
738 ;; Look here for performance issues while a user is typing
739 ;; incomplete code.
745 ;; Use lex to split up the contents of the argument list.
747 ))
748 ))
750 ;; if we have something to sub in, then do it.
753 )
754 ))
757 "Non-nil means do replacements when finding keywords.
761 "Push lexical tokens for the symbol or keyword STR.
762 STR occurs in the current buffer between BEG and END."
765 ;;
766 ;; It is a macro. Prepare for a replacement.
774 semantic-lex-spp-expanded-macro-stack))
777 ;; Do direct replacements of single value macros of macros.
778 ;; This solves issues with a macro containing one symbol that
779 ;; is another macro, and get arg lists passed around.
786 )
790 ;; Prevent recursion
792 ;; This prevents a different kind of recursion.
794 )
798 ))
799 ;; Anything else.
801 ;; A regular keyword.
804 beg end))))
805 ))
808 "Like 'semantic-lex-symbol-or-keyword' plus preprocessor macro replacement."
815 ;;; ANALYZERS FOR NEW MACROS
816 ;;
817 ;; These utilities and analyzer declaration function are for
818 ;; creating an analyzer which produces new macros in the macro table.
819 ;;
820 ;; There are two analyzers. One for new macros, and one for removing
821 ;; a macro.
824 "If TOKEN is a semantic-list, turn it into a an SPP ARG LIST."
828 ;; Convert TOKEN in place.
833 ))
836 "Lex up one token, and move to end of that token.
837 Don't go past MAX."
841 nil)
847 ))
850 "Lex up the contents of the arglist TOKEN.
851 Parsing starts inside the parens, and ends at the end of TOKEN."
858 ;; If the 2nd part of the token is a string, then we have
859 ;; a token specifically extracted from a buffer. Possibly
860 ;; a different buffer. This means we need to do something
861 ;; nice to parse its contents.
866 ;; This part is like the original
868 ;; A cheat for going into the semantic list.
881 "Lex the text string TEXT using the current buffer's state.
882 Use this to parse text extracted from a macro as if it came from
883 the current buffer. Since the lexer is designed to only work in
884 a buffer, we need to create a new buffer, and populate it with rules
885 and variable state from the current buffer."
888 semantic-lex-spp-hack-depth)))
894 semantic-lex-spp-project-macro-symbol-obarray
895 semantic-lex-spp-dynamic-macro-symbol-obarray
896 semantic-lex-spp-dynamic-macro-symbol-obarray-stack
897 semantic-lex-spp-expanded-macro-stack
898 ))
899 )
901 nil
904 ;; Below is a painful hack to make sure everything is setup correctly.
908 ;; Protect against user-hooks that throw errors.
913 ;; Hack in mode-local
916 ;; CHEATER! The following 3 lines are from
917 ;; `semantic-new-buffer-fcn', but we don't want to turn
918 ;; on all the other annoying modes for this little task.
923 t)
924 ))
926 ;; Second Cheat: copy key variables regarding macro state from the
927 ;; the originating buffer we are parsing. We need to do this every time
928 ;; since the state changes.
942 ;;;; FIRST DRAFT
943 ;; This is the fist version of semantic-lex-spp-stream-for-arglist
944 ;; that worked pretty well. It doesn't work if the TOKEN was derived
945 ;; from some other buffer, in which case it can get the wrong answer
946 ;; or throw an error if the token location in the originating buffer is
947 ;; larger than the current buffer.
948 ;;(defun semantic-lex-spp-stream-for-arglist-orig (token)
949 ;; "Lex up the contents of the arglist TOKEN.
950 ;; Parsing starts inside the parens, and ends at the end of TOKEN."
951 ;; (save-excursion
952 ;; (let ((end (semantic-lex-token-end token))
953 ;; (fresh-toks nil)
954 ;; (toks nil))
955 ;; (goto-char (semantic-lex-token-start token))
956 ;; ;; A cheat for going into the semantic list.
957 ;; (forward-char 1)
958 ;; (setq fresh-toks (semantic-lex-spp-stream-for-macro (1- end)))
959 ;; (dolist (tok fresh-toks)
960 ;; (when (memq (semantic-lex-token-class tok) '(symbol semantic-list))
961 ;; (setq toks (cons tok toks))))
962 ;; (nreverse toks))
963 ;; ))
965 ;;;; USING SPLIT
966 ;; This doesn't work, because some arguments passed into a macro
967 ;; might contain non-simple symbol words, which this doesn't handle.
968 ;;
969 ;; Thus, you need a full lex to occur.
970 ;; (defun semantic-lex-spp-stream-for-arglist-split (token)
971 ;; "Lex up the contents of the arglist TOKEN.
972 ;; Parsing starts inside the parens, and ends at the end of TOKEN."
973 ;; (let* ((txt (semantic-lex-token-text token))
974 ;; (split (split-string (substring txt 1 (1- (length txt)))
975 ;; "(), " t))
976 ;; ;; Hack for lexing.
977 ;; (semantic-lex-spp-analyzer-push-tokens-for-symbol nil))
978 ;; (dolist (S split)
979 ;; (semantic-lex-spp-analyzer-push-tokens-for-symbol S 0 1))
980 ;; (reverse semantic-lex-spp-analyzer-push-tokens-for-symbol)))
984 "Lex up a stream of tokens for a #define statement.
985 Parsing starts at the current point location.
986 EOS is the end of the stream to lex for this macro."
992 )
997 str)
998 stream)
999 ;; Nothing to push.
1000 nil)))
1002 ;; Fix the order
1004 ))
1008 "Define a lexical analyzer for defining new MACROS.
1009 NAME is the name of the analyzer.
1010 DOC is the documentation for the analyzer.
1011 REGEXP is a regular expression for the analyzer to match.
1012 See `define-lex-regex-analyzer' for more on regexp.
1013 TOKIDX is an index into REGEXP for which a new lexical token
1014 of type `spp-macro-def' is to be created.
1015 VALFORM are forms that return the value to be saved for this macro, or nil.
1016 When implementing a macro, you can use `semantic-lex-spp-stream-for-macro'
1017 to convert text into a lexical stream for storage in the macro."
1024 ,doc
1025 ,regexp
1037 ;; Preserve setting of the end point from the calling macro.
1041 ))))
1044 "Undefine a lexical analyzer for defining new MACROS.
1045 NAME is the name of the analyzer.
1046 DOC is the documentation for the analyzer.
1047 REGEXP is a regular expression for the analyzer to match.
1048 See `define-lex-regex-analyzer' for more on regexp.
1049 TOKIDX is an index into REGEXP for which a new lexical token
1050 of type `spp-macro-undef' is to be created."
1054 ,doc
1055 ,regexp
1058 )
1064 ))))
1066 ;;; INCLUDES
1067 ;;
1068 ;; These analyzers help a language define how include files
1069 ;; are identified. These are ONLY for languages that perform
1070 ;; an actual textual includesion, and not for imports.
1071 ;;
1072 ;; This section is supposed to allow the macros from the headers to be
1073 ;; added to the local dynamic macro table, but that hasn't been
1074 ;; written yet.
1075 ;;
1077 "*Non-nil means to pre-parse headers as we go.
1078 For languages that use the Semantic pre-processor, this can
1079 improve the accuracy of parsed files where include files
1080 can change the state of what's parsed in the current file.
1082 Note: Note implemented yet"
1087 "Extract and merge any macros from the header with NAME.
1088 Finds the header file belonging to NAME, gets the macros
1089 from that file, and then merge the macros with our current
1090 symbol table."
1092 ;; @todo - do this someday, ok?
1093 ))
1097 "Define a lexical analyzer for defining a new INCLUDE lexical token.
1098 Macros defined in the found include will be added to our running table
1099 at the time the include statement is found.
1100 NAME is the name of the analyzer.
1101 DOC is the documentation for the analyzer.
1102 REGEXP is a regular expression for the analyzer to match.
1103 See `define-lex-regex-analyzer' for more on regexp.
1104 TOKIDX is an index into REGEXP for which a new lexical token
1105 of type `spp-macro-include' is to be created.
1106 VALFORM are forms that return the name of the thing being included, and the
1107 type of include. The return value should be of the form:
1108 (NAME . TYPE)
1109 where NAME is the name of the include, and TYPE is the type of the include,
1110 where a valid symbol is 'system, or nil."
1117 ,doc
1118 ,regexp
1124 ;;(message "(car ,val) -> %S" (car ,val))
1128 'spp-system-include
1132 ;; Preserve setting of the end point from the calling macro.
1136 ))))
1138 ;;; EIEIO USAGE
1139 ;;
1140 ;; Semanticdb can save off macro tables for quick lookup later.
1141 ;;
1142 ;; These routines are for saving macro lists into an EIEIO persistent
1143 ;; file.
1147 ;;;###autoload
1149 "Write out the VALUE of a slot for EIEIO.
1150 The VALUE is a spp lexical table."
1154 ;(princ value)
1186 ;;; MACRO TABLE DEBUG
1187 ;;
1189 "Describe the current list of spp macros for BUFFER.
1190 If BUFFER is not provided, use the current buffer."
1207 ))))
1209 ;;; EDEBUG Handlers
1210 ;;
1212 'edebug-setup-hook
1217 )
1221 )
1228 ;; Local variables:
1229 ;; generated-autoload-file: "loaddefs.el"
1230 ;; generated-autoload-load-name: "semantic/lex-spp"
1231 ;; End:
1233 ;;; semantic/lex-spp.el ends here