CVS difference for ai05s/ai05-0176-1.txt
--- ai05s/ai05-0176-1.txt 2010/11/23 23:49:39 1.19
+++ ai05s/ai05-0176-1.txt 2010/12/15 00:10:58 1.20
@@ -193,8 +193,8 @@
@s8<@i<Syntax>>
-@xcode<@fa<quantified_expression ::= >@ft<@b<for>>@fa< quantifier loop_parameter_specification => predicate
- | >@ft<@b<for>>@fa< quantifier iterator_specification => predicate
+@xcode<@fa<quantified_expression ::= >@ft<@b<for>>@fa< quantifier loop_parameter_specification =@> predicate
+ | >@ft<@b<for>>@fa< quantifier iterator_specification =@> predicate
quantifier ::= >@ft<@b<all>>@fa< | >@ft<@b<some>>@fa<
predicate ::= >@ft<@i<boolean_>>@fa<expression>>
@@ -236,13 +236,13 @@
The postcondition for a sorting routine on an array A with an index subtype T
can be written:
-@xcode<Post =@> (@b A'Length < 2
- @b<or else> (@b<for all> I @b<in> A'First .. T'Pred(A'Last) => A (I) <= A (T'Succ (I))))>
+@xcode<Post =@> (A'Length < 2
+ @b<or else> (@b<for all> I @b<in> A'First .. T'Pred(A'Last) =@> A (I) <= A (T'Succ (I))))>
The assertion that a positive number is composite (as opposed to prime) can be
written:
-@xcode<@b<pragma> Assert (@b<for some> X @b<in> 2 .. N / 2 => N @b<mod> X = 0);>
+@xcode<@b<pragma> Assert (@b<for some> X @b<in> 2 .. N / 2 =@> N @b<mod> X = 0);>
!ACATS test
Questions? Ask the ACAA Technical Agent