From 14b39eca76062d7bfb61ff7f150fc613893a3393 Mon Sep 17 00:00:00 2001 From: Michael Dyck Date: Tue, 20 Aug 2019 15:14:19 -0400 Subject: [PATCH] Editorial: Move the runtime semantics for QuantifiableAssertion ... down to its proper place in production order. (This commit's diff probably shows a complicated combination of tweaks, but it's really just taking a block of 22 lines and shifting it down the file.) --- spec.html | 26 +++++++++++++------------- 1 file changed, 13 insertions(+), 13 deletions(-) diff --git a/spec.html b/spec.html index 4519055fc8a..d5e14d93266 100644 --- a/spec.html +++ b/spec.html @@ -31827,9 +31827,14 @@

Assertion

1. If _a_ is *false* and _b_ is *true*, return *false*. 1. Return *true*. -

The production QuantifiableAssertion :: `(` `?` `=` Disjunction `)` evaluates as follows:

+

The production Assertion :: QuantifiableAssertion evaluates as follows:

- 1. Evaluate |Disjunction| with +1 as its _direction_ argument to obtain a Matcher _m_. + 1. Evaluate |QuantifiableAssertion| to obtain a Matcher _m_. + 1. Return _m_. + +

The production Assertion :: `(` `?` `<=` Disjunction `)` evaluates as follows:

+ + 1. Evaluate |Disjunction| with -1 as its _direction_ argument to obtain a Matcher _m_. 1. Return an internal Matcher closure that takes two arguments, a State _x_ and a Continuation _c_, and performs the following steps: 1. Let _d_ be a Continuation that always returns its State argument as a successful MatchResult. 1. Call _m_(_x_, _d_) and let _r_ be its result. @@ -31840,23 +31845,18 @@

Assertion

1. Let _z_ be the State (_xe_, _cap_). 1. Call _c_(_z_) and return its result. -

The production QuantifiableAssertion :: `(` `?` `!` Disjunction `)` evaluates as follows:

+

The production Assertion :: `(` `?` `<!` Disjunction `)` evaluates as follows:

- 1. Evaluate |Disjunction| with +1 as its _direction_ argument to obtain a Matcher _m_. + 1. Evaluate |Disjunction| with -1 as its _direction_ argument to obtain a Matcher _m_. 1. Return an internal Matcher closure that takes two arguments, a State _x_ and a Continuation _c_, and performs the following steps: 1. Let _d_ be a Continuation that always returns its State argument as a successful MatchResult. 1. Call _m_(_x_, _d_) and let _r_ be its result. 1. If _r_ is not ~failure~, return ~failure~. 1. Call _c_(_x_) and return its result. -

The production Assertion :: QuantifiableAssertion evaluates as follows:

- - 1. Evaluate |QuantifiableAssertion| to obtain a Matcher _m_. - 1. Return _m_. - -

The production Assertion :: `(` `?` `<=` Disjunction `)` evaluates as follows:

+

The production QuantifiableAssertion :: `(` `?` `=` Disjunction `)` evaluates as follows:

- 1. Evaluate |Disjunction| with -1 as its _direction_ argument to obtain a Matcher _m_. + 1. Evaluate |Disjunction| with +1 as its _direction_ argument to obtain a Matcher _m_. 1. Return an internal Matcher closure that takes two arguments, a State _x_ and a Continuation _c_, and performs the following steps: 1. Let _d_ be a Continuation that always returns its State argument as a successful MatchResult. 1. Call _m_(_x_, _d_) and let _r_ be its result. @@ -31867,9 +31867,9 @@

Assertion

1. Let _z_ be the State (_xe_, _cap_). 1. Call _c_(_z_) and return its result. -

The production Assertion :: `(` `?` `<!` Disjunction `)` evaluates as follows:

+

The production QuantifiableAssertion :: `(` `?` `!` Disjunction `)` evaluates as follows:

- 1. Evaluate |Disjunction| with -1 as its _direction_ argument to obtain a Matcher _m_. + 1. Evaluate |Disjunction| with +1 as its _direction_ argument to obtain a Matcher _m_. 1. Return an internal Matcher closure that takes two arguments, a State _x_ and a Continuation _c_, and performs the following steps: 1. Let _d_ be a Continuation that always returns its State argument as a successful MatchResult. 1. Call _m_(_x_, _d_) and let _r_ be its result.