README.md in ebnf-2.3.1 vs README.md in ebnf-2.3.2

- old
+ new

@@ -97,11 +97,13 @@ ### Parser Errors On a parsing failure, and exception is raised with information that may be useful in determining the source of the error. ## EBNF Grammar -The [EBNF][] variant used here is based on [W3C](https://w3.org/) [EBNF][] (see {file:etc/ebnf.ebnf EBNF grammar}) as defined in the +The [EBNF][] variant used here is based on [W3C](https://w3.org/) [EBNF][] +(see [EBNF grammar](https://dryruby.github.io/ebnf/etc/ebnf.ebnf)) +as defined in the [XML 1.0 recommendation](https://www.w3.org/TR/REC-xml/), with minor extensions: Note that the grammar includes an optional `[identifer]` in front of rule names, which can be in conflict with the `RANGE` terminal. It is typically not a problem, but if it comes up, try parsing with the `native` parser, add comments or sequences to disambiguate. EBNF does not have beginning of line checks as all whitespace is treated the same, so the common practice of identifying each rule inherently leads to such ambiguity. The character set for EBNF is UTF-8. @@ -159,11 +161,16 @@ * All rules **MAY** start with an identifier, contained within square brackets. For example `[1] rule`, where the value within the brackets is a symbol `([a-z] | [A-Z] | [0-9] | "_" | ".")+` * `@terminals` causes following rules to be treated as terminals. Any terminal which is all upper-case (eg`TERMINAL`), or any rules with expressions that match characters (`#xN`, `[a-z]`, `[^a-z]`, `[abc]`, `[^abc]`, `"string"`, `'string'`, or `A - B`), are also treated as terminals. * `@pass` defines the expression used to detect whitespace, which is removed in processing. * No support for `wfc` (well-formedness constraint) or `vc` (validity constraint). -Parsing this grammar yields an [S-Expression][] version: {file:etc/ebnf.sxp} (or [LL(1)][] version {file:etc/ebnf.ll1.sxp} or [PEG][] version {file:etc/ebnf.peg.sxp}). +Parsing this grammar yields an [S-Expression][S-Expression] version: +[here](https://dryruby.github.io/ebnf/etc/ebnf.sxp) +(or [LL(1)][] version +[here](https://dryruby.github.io/ebnf/etc/ebnf.ll1.sxp) +or [PEG][] version +[here](https://dryruby.github.io/ebnf/etc/ebnf.peg.sxp)). ### Parser S-Expressions Intermediate representations of the grammar may be serialized to Lisp-like [S-Expressions][S-Expression]. For example, the rule [1] ebnf ::= (declaration | rule)* @@ -223,10 +230,10 @@ For a [PEG][] parser for a simple grammar implementing a calculator see [Calc example](https://dryruby.github.io/ebnf/examples/calc/doc/calc.html) For an example parser built using this gem that parses the [EBNF][] grammar, see [EBNF PEG Parser example](https://dryruby.github.io/ebnf/examples/ebnf-peg-parser/doc/parser.html). This example creates a parser for the [EBNF][] grammar which generates the same Abstract Syntax Tree as the built-in parser in the gem. There is also an -[EBNF LL(1) Parser example](https://dryruby.github.io/ebnf/examples/ebnf-peg-parser/doc/parser.html). +[EBNF LL(1) Parser example](https://dryruby.github.io/ebnf/examples/ebnf-ll1-parser/doc/parser.html). The [ISO EBNF Parser](https://dryruby.github.io/ebnf/examples/isoebnf/doc/parser.html) example parses [ISO/IEC 14977][] into [S-Expressions][S-Expression], which can be used to parse compatible grammars using this parser (either [PEG][] or [LL(1)][]). The [ABNF Parser](https://dryruby.github.io/ebnf/examples/abnf/doc/parser.html) example parses [ABNF][] into [S-Expressions][S-Expression], which can be used to parse compatible grammars using this [PEG][] parser.