|
|
1.1 root 1: #
2: # Copyright (c) 1987 Regents of the University of California.
3: # All rights reserved.
4: #
5: # Redistribution and use in source and binary forms are permitted
6: # provided that the above copyright notice and this paragraph are
7: # duplicated in all such forms and that any documentation,
8: # advertising materials, and other materials related to such
9: # distribution and use acknowledge that the software was developed
10: # by the University of California, Berkeley. The name of the
11: # University may not be used to endorse or promote products derived
12: # from this software without specific prior written permission.
13: # THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
14: # IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
15: # WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
16: #
17: # @(#)vgrindefs.src 1.14 (Berkeley) 7/9/88
18: #
19:
20: C|c:\
21: :pb=^\d?*?\d?\p\d?\(\a?\)(\d|{):bb={:be=}:cb=/*:ce=*/:sb=":se=\e":lb=':\
22: :le=\e':tl:\
23: :kw=asm auto break case char continue default do double else enum\
24: extern float for fortran goto if int long register return short\
25: sizeof static struct switch typedef union unsigned void while #define\
26: #else #endif #if #ifdef #ifndef #include #undef # define else endif\
27: if ifdef ifndef include undef:
28: model|mod|m:\
29: :pb=^\d(space\d\p\drep)|(\p\dis|inline|public\dbeginproc):\
30: :bb=\dbeginproc|space|case\d:be=\dendproc|end\d|;:\
31: :cb=\$:ce=\$|$:sb=":se=":lb=':le=\a|$:\
32: :kw=abs and array beginproc boolean by case cdnl char copied dispose\
33: div do dynamic else elsif end endproc entry external FALSE false\
34: fi file for formal fortran global if iff ift\
35: in integer include inline is lbnd\
36: max min mod new NIL nil noresult not notin od of or procedure public\
37: read readln readonly record recursive rem rep repeat res\
38: result return set\
39: space string subscript such then TRUE true type ubnd union until\
40: varies while width:
41: pascal|pasc|p:\
42: :pb=(^\d?procedure|function|program\d\p\d|\(|;|\:)|(=\d?record\d):\
43: :bb=\dcase|begin\d:be=\dend|forward\d|;:\
44: :cb={:ce=}:\
45: :ab=\(*:ae=*\):\
46: :sb=':se=':\
47: :kw=and array assert begin case const div do downto else end file for\
48: forward function goto if in label mod nil not of or packed procedure\
49: program record repeat set then to type until var while with oct hex\
50: external:
51: ISP|isp|i:\
52: :cb=!:ce=!|$:oc:\
53: :kw=and begin decode define end eql eqv geq gtr if leave leq lss mod\
54: neq next not or otherwise repeat restart resume sr0 sr1 srd srr sl0 sl1\
55: sld slr tst xor:
56: SH|sh:\
57: :bb={:be=}:cb=#:ce=$:sb=":se=\e":lb=':\
58: :le=\e':tl:\
59: :kw=break case cd continue do done \
60: elif else esac eval exec exit export \
61: fi for if in then while until \
62: read readonly set shift test trap umask wait:
63: CSH|csh:\
64: :bb={:be=}:cb=#:ce=$:sb=":se=\e":lb=':\
65: :le=\e':tl:\
66: :kw=alias alloc break breaksw case cd chdir continue default\
67: echo else end endif endsw exec exit foreach \
68: glob goto history if logout nice nohup onintr repeat set\
69: setenv shift source switch then time \
70: while umask unalias unset wait while @ env \
71: argv child home ignoreeof noclobber noglob \
72: nomatch path prompt shell status verbose :
73: ldl|LDL:\
74: :pb=^\p\::bb=\::be=;:cb=/*:ce=*/:sb=":se=\e":\
75: :kw=constant functions grammar reswords tokens add1 addste\
76: car cdr check colno cond cons copy defun divide empty enter\
77: eq equal findattr firstchild ge getattr getfield gt hash label\
78: lambda lastchild le leftsibling lookone lookup lt minus name ne\
79: newnode nextcom nil null parent plus precnl prevcom prog progn\
80: quote reglob return rightsibling self set setattr setfield setq\
81: stjoin sub1 t times tnull tokno ttype:
82: Icon|icon|I:\
83: :pb=^\d?procedure\d\p\d?\(\a?\):\
84: :bb=(^\d?procedure\d\p\d?\(\a?\))|{:be=}|(^\d?end\d?$):\
85: :cb=#:ce=$:\
86: :sb=":se=\e":lb=':le=\e':tl:\
87: :kw=break by case create default do dynamic else end every external\
88: fail global if initial local next not of procedure record\
89: repeat return static suspend then to until using while\
90: &ascii &clock &cset &date &dateline &errout &fail &host &input\
91: &lcase &level &main &null &output &pos &random &source &subject\
92: &time &trace &ucase &version:
93: ratfor|rat|r:\
94: :pb=(subroutine|function)\d\p\d?\(\a?\):\
95: :bb=(subroutine|function)\d\p\d?\(\a?\):be=^\d?end:\
96: :cb=#:ce=$:\
97: :sb=":se=\e":lb=':le=\e':oc:\
98: :kw=DRETURN DRIVER arith break case character default define do\
99: else elsedef enddef filedes for function goto if ifdef ifelse\
100: ifnotdef include incr integer linepointer next opeq pointer\
101: real repeat return select string subroutine substr until:
102: modula2|mod2|m2:\
103: :pb=(^\d?(procedure|function|module)\d\p\d|\(|;|\:):\
104: :bb=\d(begin|case|for|if|loop|record|repeat|while|with)\d:\
105: :be=\dend|;:\
106: :cb={:ce=}:\
107: :ab=\(*:ae=*\):\
108: :sb=":se=":\
109: :oc:\
110: :kw=and array begin by case const\
111: definition div do else elsif end exit export\
112: for from if implementation import in\
113: loop mod module not of or pointer procedure qualified\
114: record repeat return set then to type\
115: until var while with:
116: yacc|Yacc|y:\
117: :cb=/*:ce=*/:sb=":se=\e":lb=':le=\e':tl:\
118: :kw=%{ %} %% %union %token %type\
119: #else #endif #if #ifdef #ifndef #include #undef # define else endif\
120: if ifdef ifndef include undef:
121: C++|c++:\
122: :pb=^\d?*?\d?\p\d?\(\a?\)(\d|{):bb={:be=}:cb=/*:ce=*/:ab=//:\
123: :ae=$:sb=":se=\e":lb=':\
124: :le=\e':tl:\
125: :kw=asm auto break case char continue default do double else enum\
126: extern float for fortran goto if int long register return short\
127: sizeof static struct switch typedef union unsigned while void #define\
128: #else #endif #if #ifdef #ifndef #include #undef # define endif\
129: ifdef ifndef include undef defined\
130: class const delete friend inline new operator overload private\
131: protected public virtual:
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.