Skip to content

Commit 213b6b7

Browse files
committed
Merge branch 'enaqx-unicode-appendix'
2 parents 787da70 + 4c18520 commit 213b6b7

File tree

1 file changed

+6
-6
lines changed

1 file changed

+6
-6
lines changed

spec/Appendix A -- Notation Conventions.md

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -22,7 +22,7 @@ of the sequences it is defined by, until all non-terminal symbols have been
2222
replaced by terminal characters.
2323

2424
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
2626
(ex {/[0-9]+/}).
2727

2828
Non-terminal production rules are represented in this document using the
@@ -48,12 +48,12 @@ ListOfLetterA :
4848

4949
The GraphQL language is defined in a syntactic grammar where terminal symbols
5050
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
5252
produces a GraphQL AST.
5353

5454
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
5757
grammar production. A lexical grammar production is distinguished by a two colon
5858
`::` definition.
5959

@@ -166,13 +166,13 @@ Example_param :
166166
This specification describes the semantic value of many grammar productions in
167167
the form of a list of algorithmic steps.
168168

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
170170
sequence which appears in a string literal:
171171

172172
EscapedUnicode :: u /[0-9A-Fa-f]{4}/
173173

174174
* 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}.
176176

177177

178178
## Algorithms

0 commit comments

Comments
 (0)