Stanford Extended ASCII

Stanford Extended ASCII (SEASCII) is a derivation of the 7-bit ASCII character set developed at the Stanford Artificial Intelligence Laboratory (SAIL/SU-AI) in the early 1970s.[1] Not all symbols match ASCII.

Carnegie Mellon University, Massachusetts Institute of Technology, and the University of Southern California also had their own modified versions of ASCII.[1]

Character set

Each character is given with a potential Unicode equivalent. Differences to ASCII are shown boxed.

  Letter   Number   Punctuation   Symbol   Other   undefined

SEASCII[2][3][1]
_0 _1 _2 _3 _4 _5 _6 _7 _8 _9 _A _B _C _D _E _F
0_ ·[3] (NUL[3])
00B7 (0000)
0		 ↓
2193
1		 α
03B1
2		 β
03B2
3		 ∧[2] (^[2])
2227 (005E)
4		 ¬
00AC
5		 ε
03B5
6		 π
03C0
7		 λ
03BB
8		 γ[2] (HT/ TAB[2])
03B3 (0009)
9		 δ[2] (LF[2])
03B4 (000A)
10		 ∫[2] (VT[2])
222B (000B)
11		 ±[2] (FF[2])
00B1 (000C)
12		 ⊕[2] (CR[2])
2295 (000D)
13		 ∞
221E
14		 ∂ (∇) (DEL[2])
2202[3][2] (2207[1])
15
1_ ⊂
2282
16		 ⊃
2283
17		 ∩
2229
18		 ∪
222A
19		 ∀
2200
20		 ∃
2203
21		 ⊗
2297
22		 ↔
2194
23		 _
005F
24		 ←
2190
25		 ~
007E
26		 ≠
2260
27		 ≤
2264
28		 ≥
2265
29		 ≡[1][2] (≍)
2261 (224D[3])
30		 ∨
2228
31
2_ SP
0020
32		 !
0021
33		 "
0022
34		 #
0023
35		 $
0024
36		 %
0025
37		 &
0026
38		 '
0027
39		 (
0028
40		 )
0029
41		 *
002A
42		 +
002B
43		 ,
002C
44		 -
002D
45		 .
002E
46		 /
002F
47
3_ 0
0030
48		 1
0031
49		 2
0032
50		 3
0033
51		 4
0034
52		 5
0035
53		 6
0036
54		 7
0037
55		 8
0038
56		 9
0039
57		 :
003A
58		 ;
003B
59		 <
003C
60		 =
003D
61		 >
003E
62		 ?
003F
63
4_ @
0040
64		 A
0041
65		 B
0042
66		 C
0043
67		 D
0044
68		 E
0045
69		 F
0046
70		 G
0047
71		 H
0048
72		 I
0049
73		 J
004A
74		 K
004B
75		 L
004C
76		 M
004D
77		 N
004E
78		 O
004F
79
5_ P
0050
80		 Q
0051
81		 R
0052
82		 S
0053
83		 T
0054
84		 U
0055
85		 V
0056
86		 W
0057
87		 X
0058
88		 Y
0059
89		 Z
005A
90		 [
005B
91		 \
005C
92		 ]
005D
93		 ↑
2191
94		 → (←)
2192[3][2] (2190[1])
95
6_ `
0060
96		 a
0061
97		 b
0062
98		 c
0063
99		 d
0064
100		 e
0065
101		 f
0066
102		 g
0067
103		 h
0068
104		 i
0069
105		 j
006A
106		 k
006B
107		 l
006C
108		 m
006D
109		 n
006E
110		 o
006F
111
7_ p
0070
112		 q
0071
113		 r
0072
114		 s
0073
115		 t
0074
116		 u
0075
117		 v
0076
118		 w
0077
119		 x
0078
120		 y
0079
121		 z
007A
122		 {
007B
123		 |
007C
124		 ◊ (ALTMODE/[2] ESC[3])
25CA
125		 }
007D
126		 ^ (RUBOUT/[2] DEL[3])
005E
127
_0_1_2_3_4_5_6_7_8_9_A_B_C_D_E_F

See also

References

  1. 1 2 3 4 5 6 Beebe, Nelson H. F. (2005). "Proceedings of the Practical TEX 2005 Conference: The design of TEX and METAFONT: A retrospective" (PDF). TUGboat. Salt Lake City, Utah, USA: University of Utah, Department of Mathematics. 26 (1): 39-40. Retrieved 2017-03-07. The underscore operator in SAIL source-code assignments printed as a left arrow in the Stanford variant of ASCII, but PDP-10 sites elsewhere just saw it as a plain underscore. However, its use as the assignment operator meant that it could not be used as an extended letter to make compound names more readable, as is now common in many other programming languages. The left arrow in the Stanford variant of ASCII was not the only unusual character. (NB. Shows a table of Stanford extended ASCII following that described in RFC 698.)
  2. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 Mock, T. (1975-07-23). "RFC 698: Telnet extended ASCII option". RFC 698. NIC #32964. Archived from the original on 2017-03-07. Retrieved 2017-03-07. (NB. Replaced by RFC 5198.)
  3. 1 2 3 4 5 6 7 8 Cowan, John Woldemar (1999-09-08). "Stanford Extended ASCII to Unicode". 0.1. Unicode, Inc. Archived from the original on 2017-03-07. Retrieved 2017-03-07.

Further reading

  • "double bucky". Free On-line Dictionary of Computing (FOLDOC). 1994-12-07. Archived from the original on 2017-03-07. Retrieved 2017-03-07.
  • Knuth, Donald Ervin (1979). TEX and METAFONT — New Directions in Typesetting. Bedford, MA, USA: Digital Press. p. 169. ISBN 0-932376-02-9. (NB. Shows a table of SEASCII differing in a few code points from that described in RFC 698.)
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.