You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: spec/Appendix A -- Notation Conventions.md
+6-6Lines changed: 6 additions & 6 deletions
Original file line number
Diff line number
Diff line change
@@ -22,7 +22,7 @@ of the sequences it is defined by, until all non-terminal symbols have been
22
22
replaced by terminal characters.
23
23
24
24
Terminals are represented in this document in a monospace font in two forms: a
25
-
specific unicode character or sequence of unicode characters (ex. {`=`} or {`terminal`}), and a pattern of unicode characters defined by a regular expression
25
+
specific Unicode character or sequence of Unicode characters (ex. {`=`} or {`terminal`}), and a pattern of Unicode characters defined by a regular expression
26
26
(ex {/[0-9]+/}).
27
27
28
28
Non-terminal production rules are represented in this document using the
@@ -48,12 +48,12 @@ ListOfLetterA :
48
48
49
49
The GraphQL language is defined in a syntactic grammar where terminal symbols
50
50
are tokens. Tokens are defined in a lexical grammar which matches patterns of
51
-
source characters. The result of parsing a sequence of source unicode characters
51
+
source characters. The result of parsing a sequence of source Unicode characters
52
52
produces a GraphQL AST.
53
53
54
54
A Lexical grammar production describes non-terminal "tokens" by
55
-
patterns of terminal unicode characters. No "whitespace" or other ignored
56
-
characters may appear between any terminal unicode characters in the lexical
55
+
patterns of terminal Unicode characters. No "whitespace" or other ignored
56
+
characters may appear between any terminal Unicode characters in the lexical
57
57
grammar production. A lexical grammar production is distinguished by a two colon
58
58
`::` definition.
59
59
@@ -166,13 +166,13 @@ Example_param :
166
166
This specification describes the semantic value of many grammar productions in
167
167
the form of a list of algorithmic steps.
168
168
169
-
For example, this describes how a parser should interpret a unicode escape
169
+
For example, this describes how a parser should interpret a Unicode escape
170
170
sequence which appears in a string literal:
171
171
172
172
EscapedUnicode :: u /[0-9A-Fa-f]{4}/
173
173
174
174
* Let {codePoint} be the number represented by the four-digit hexadecimal sequence.
175
-
* The string value is the unicode character represented by {codePoint}.
175
+
* The string value is the Unicode character represented by {codePoint}.
0 commit comments