Skip to content

Commit 554970a

Browse files
author
Colin Robertson
committed
Clean up stray characters
1 parent 7a002b8 commit 554970a

1 file changed

Lines changed: 17 additions & 16 deletions

File tree

docs/assembler/masm/masm-bnf-grammar.md

Lines changed: 17 additions & 16 deletions
Original file line numberDiff line numberDiff line change
@@ -253,7 +253,7 @@ The BNF grammar allows recursive definitions. For example, the grammar uses qual
253253
    | **`TYPE`** *`e10`*\
254254
    | **`THIS`** *`e10`*\
255255
    | *`e09`* **`PTR`** *`e10`*\
256-
    | *`e09`* : *`e10`*\
256+
    | *`e09`* **`:`** *`e10`*\
257257
    | *`e10`*
258258

259259
*`e10`*\
@@ -262,7 +262,7 @@ The BNF grammar allows recursive definitions. For example, the grammar uses qual
262262
    | *`e11`*
263263

264264
*`e11`*\
265-
    ( *`expr`* )\
265+
    **`(`** *`expr`* **`)`**\
266266
    | ⟦ *`expr`*\
267267
    | **`WIDTH`** *`id`*\
268268
    | **`MASK`** *`id`*\
@@ -284,12 +284,12 @@ The BNF grammar allows recursive definitions. For example, the grammar uses qual
284284
*`echoDir`*\
285285
    **`ECHO`**\
286286
    *`arbitraryText`* *`;;`*\
287-
%**`OUT`** *`arbitraryText`* *`;;`*\
287+
    **`%OUT`** *`arbitraryText`* *`;;`*
288288

289289
*`elseifBlock`*\
290290
    *`elseifStatement`* *`;;`*\
291291
    *`directiveList`*\
292-
    *`elseifBlock`*\
292+
    *`elseifBlock`*
293293

294294
*`elseifStatement`*\
295295
    **`ELSEIF`** *`constExpr`*\
@@ -395,7 +395,7 @@ The BNF grammar allows recursive definitions. For example, the grammar uses qual
395395

396396
*`floatNumber`*\
397397
    *`sign`**`decNumber`* **`.`***`decNumber`* ⟧ ⟦ *`exponent`*\
398-
    | *`digits`* **`R`** | *`digits`* r
398+
    | *`digits`* **`R`** | *`digits`* **`r`**
399399

400400
*`forcDir`*\
401401
    **`FORC`** | **`IRPC`**
@@ -457,7 +457,7 @@ The BNF grammar allows recursive definitions. For example, the grammar uses qual
457457
    *`directiveList`*\
458458
    *`elseifBlock`*\
459459
    **`ELSE`** *`;;`* \
460-
    *`directiveList`**`;;`*\
460+
    *`directiveList`**`;;`*
461461

462462
*`ifStatement`*\
463463
    **`IF`** *`constExpr`*\
@@ -553,7 +553,7 @@ The BNF grammar allows recursive definitions. For example, the grammar uses qual
553553
    | **`.TFCOND`**\
554554
    | **`.LISTMACROALL`** | **`.LALL`**\
555555
    | **`.NOLISTMACRO`** | **`.SALL`**\
556-
    | **`.LISTMACRO`** | **`.XALL`**\
556+
    | **`.LISTMACRO`** | **`.XALL`**
557557

558558
*`localDef`*\
559559
    **`LOCAL`** *`idList`* *`;;`*
@@ -573,7 +573,7 @@ The BNF grammar allows recursive definitions. For example, the grammar uses qual
573573
    | **`%`** *`macroFuncId`* **`(`** *`macroArgList`* **`)`**\
574574
    | *`string`*\
575575
    | *`arbitraryText`*\
576-
&nbsp;&nbsp;&nbsp;&nbsp;| **`<`** *`arbitraryText`* >
576+
&nbsp;&nbsp;&nbsp;&nbsp;| **`<`** *`arbitraryText`* **`>`**
577577

578578
*`macroArgList`*\
579579
&nbsp;&nbsp;&nbsp;&nbsp;*`macroArg`* | *`macroArgList`* **`,`** *`macroArg`*
@@ -630,8 +630,7 @@ The BNF grammar allows recursive definitions. For example, the grammar uses qual
630630
&nbsp;&nbsp;&nbsp;&nbsp;*`directive`* \
631631
&nbsp;&nbsp;&nbsp;&nbsp;| *`exitmDir`*\
632632
&nbsp;&nbsp;&nbsp;&nbsp;| **`:`** *`macroLabel`*\
633-
&nbsp;&nbsp;&nbsp;&nbsp;| **`GOTO`**\
634-
&nbsp;&nbsp;&nbsp;&nbsp;*`macroLabel`*
633+
&nbsp;&nbsp;&nbsp;&nbsp;| **`GOTO`** *`macroLabel`*
635634

636635
*`macroStmtList`*\
637636
&nbsp;&nbsp;&nbsp;&nbsp;*`macroStmt`* *`;;`*\
@@ -669,15 +668,15 @@ The BNF grammar allows recursive definitions. For example, the grammar uses qual
669668

670669
*`nameDir`*\
671670
&nbsp;&nbsp;&nbsp;&nbsp;**`NAME`**\
672-
&nbsp;&nbsp;&nbsp;&nbsp;*`id`* *`;;`*\
671+
&nbsp;&nbsp;&nbsp;&nbsp;*`id`* *`;;`*
673672

674673
*`nearfar`*\
675674
&nbsp;&nbsp;&nbsp;&nbsp;**`NEAR`** | **`FAR`**
676675

677676
*`nestedStruct`*\
678677
&nbsp;&nbsp;&nbsp;&nbsp;*`structHdr`**`id`**`;;`*\
679678
&nbsp;&nbsp;&nbsp;&nbsp;*`structBody`*\
680-
&nbsp;&nbsp;&nbsp;&nbsp;**`ENDS`** *`;;`*\
679+
&nbsp;&nbsp;&nbsp;&nbsp;**`ENDS`** *`;;`*
681680

682681
*`offsetDir`*\
683682
&nbsp;&nbsp;&nbsp;&nbsp;*`offsetDirType`* *`;;`*
@@ -749,7 +748,7 @@ The BNF grammar allows recursive definitions. For example, the grammar uses qual
749748
&nbsp;&nbsp;&nbsp;&nbsp;*`parm`* | *`parmList`* **`,`***`;;`**`parm`*
750749

751750
*`parmType`*\
752-
&nbsp;&nbsp;&nbsp;&nbsp;**`REQ`** | = *`textLiteral`* | **`VARARG`**
751+
&nbsp;&nbsp;&nbsp;&nbsp;**`REQ`** | **`=`** *`textLiteral`* | **`VARARG`**
753752

754753
*`pOptions`*\
755754
&nbsp;&nbsp;&nbsp;&nbsp;*`distance`* ⟧ ⟦ *`langType`* ⟧ ⟦ *`oVisibility`*
@@ -925,7 +924,9 @@ The BNF grammar allows recursive definitions. For example, the grammar uses qual
925924
&nbsp;&nbsp;&nbsp;&nbsp;**`+`** | **`-`**
926925

927926
*`simdRegister`*\
928-
&nbsp;&nbsp;&nbsp;&nbsp;**`MM0`** | **`MM1`** | **`MM2`** | **`MM3`** | **`MM4`** | **`MM5`** | **`MM6`** | **`MM7`** | *`xmmRegister`* | **`YMM0`** | **`YMM1`** | **`YMM2`** | **`YMM3`** | **`YMM4`** | **`YMM5`** | **`YMM6`** | **`YMM7`** | **`YMM8`** | **`YMM9`** | **`YMM10`** | **`YMM11`** | **`YMM12`** | **`YMM13`** | **`YMM14`** | **`YMM15`**
927+
&nbsp;&nbsp;&nbsp;&nbsp;**`MM0`** | **`MM1`** | **`MM2`** | **`MM3`** | **`MM4`** | **`MM5`** | **`MM6`** | **`MM7`**\
928+
&nbsp;&nbsp;&nbsp;&nbsp;| *`xmmRegister`*\
929+
&nbsp;&nbsp;&nbsp;&nbsp;| **`YMM0`** | **`YMM1`** | **`YMM2`** | **`YMM3`** | **`YMM4`** | **`YMM5`** | **`YMM6`** | **`YMM7`** | **`YMM8`** | **`YMM9`** | **`YMM10`** | **`YMM11`** | **`YMM12`** | **`YMM13`** | **`YMM14`** | **`YMM15`**
929930

930931
*`simpleExpr`*\
931932
&nbsp;&nbsp;&nbsp;&nbsp;**`(`** *`cExpr`* **`)`** | *`primary`*
@@ -967,7 +968,7 @@ The BNF grammar allows recursive definitions. For example, the grammar uses qual
967968

968969
*`structDir`*\
969970
&nbsp;&nbsp;&nbsp;&nbsp;*`structTag`* *`structHdr`**`fieldAlign`*\
970-
&nbsp;&nbsp;&nbsp;&nbsp;, **`NONUNIQUE`***`;;`*\
971+
&nbsp;&nbsp;&nbsp;&nbsp; **`,`** **`NONUNIQUE`***`;;`*\
971972
&nbsp;&nbsp;&nbsp;&nbsp;*`structBody`*\
972973
&nbsp;&nbsp;&nbsp;&nbsp;*`structTag`*\
973974
&nbsp;&nbsp;&nbsp;&nbsp;**`ENDS`** *`;;`*
@@ -978,7 +979,7 @@ The BNF grammar allows recursive definitions. For example, the grammar uses qual
978979
*`structInstance`*\
979980
&nbsp;&nbsp;&nbsp;&nbsp;**`<`***`fieldInitList`***`>`**\
980981
&nbsp;&nbsp;&nbsp;&nbsp;| **`{`***`;;`* ⟧ ⟦ *`fieldInitList`* ⟧ ⟦ *`;;`***`}`**\
981-
&nbsp;&nbsp;&nbsp;&nbsp;| *`constExpr`* **`DUP`** ( *`structInstList`* )\
982+
&nbsp;&nbsp;&nbsp;&nbsp;| *`constExpr`* **`DUP`** ( *`structInstList`* )
982983

983984
*`structInstList`*\
984985
&nbsp;&nbsp;&nbsp;&nbsp;*`structInstance`* | *`structInstList`* **`,`***`;;`**`structInstance`*

0 commit comments

Comments
 (0)