1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2007, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING3. If not, go to --
19 -- http://www.gnu.org/licenses for a complete copy of the license. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 ------------------------------------------------------------------------------
26 pragma Style_Checks
(All_Checks
);
27 -- Turn off subprogram body ordering check. Subprograms are in order
28 -- by RM section rather than alphabetical
33 -- Local functions, used only in this chapter
35 function P_Case_Statement
return Node_Id
;
36 function P_Case_Statement_Alternative
return Node_Id
;
37 function P_Condition
return Node_Id
;
38 function P_Exit_Statement
return Node_Id
;
39 function P_Goto_Statement
return Node_Id
;
40 function P_If_Statement
return Node_Id
;
41 function P_Label
return Node_Id
;
42 function P_Loop_Parameter_Specification
return Node_Id
;
43 function P_Null_Statement
return Node_Id
;
45 function P_Assignment_Statement
(LHS
: Node_Id
) return Node_Id
;
46 -- Parse assignment statement. On entry, the caller has scanned the left
47 -- hand side (passed in as Lhs), and the colon-equal (or some symbol
48 -- taken to be an error equivalent such as equal).
50 function P_Begin_Statement
(Block_Name
: Node_Id
:= Empty
) return Node_Id
;
51 -- Parse begin-end statement. If Block_Name is non-Empty on entry, it is
52 -- the N_Identifier node for the label on the block. If Block_Name is
53 -- Empty on entry (the default), then the block statement is unlabeled.
55 function P_Declare_Statement
(Block_Name
: Node_Id
:= Empty
) return Node_Id
;
56 -- Parse declare block. If Block_Name is non-Empty on entry, it is
57 -- the N_Identifier node for the label on the block. If Block_Name is
58 -- Empty on entry (the default), then the block statement is unlabeled.
60 function P_For_Statement
(Loop_Name
: Node_Id
:= Empty
) return Node_Id
;
61 -- Parse for statement. If Loop_Name is non-Empty on entry, it is
62 -- the N_Identifier node for the label on the loop. If Loop_Name is
63 -- Empty on entry (the default), then the for statement is unlabeled.
65 function P_Loop_Statement
(Loop_Name
: Node_Id
:= Empty
) return Node_Id
;
66 -- Parse loop statement. If Loop_Name is non-Empty on entry, it is
67 -- the N_Identifier node for the label on the loop. If Loop_Name is
68 -- Empty on entry (the default), then the loop statement is unlabeled.
70 function P_While_Statement
(Loop_Name
: Node_Id
:= Empty
) return Node_Id
;
71 -- Parse while statement. If Loop_Name is non-Empty on entry, it is
72 -- the N_Identifier node for the label on the loop. If Loop_Name is
73 -- Empty on entry (the default), then the while statement is unlabeled.
75 function Set_Loop_Block_Name
(L
: Character) return Name_Id
;
76 -- Given a letter 'L' for a loop or 'B' for a block, returns a name
77 -- of the form L_nn or B_nn where nn is a serial number obtained by
78 -- incrementing the variable Loop_Block_Count.
81 -- Scan past THEN token, testing for illegal junk after it
83 ---------------------------------
84 -- 5.1 Sequence of Statements --
85 ---------------------------------
87 -- SEQUENCE_OF_STATEMENTS ::= STATEMENT {STATEMENT}
90 -- {LABEL} SIMPLE_STATEMENT | {LABEL} COMPOUND_STATEMENT
92 -- SIMPLE_STATEMENT ::= NULL_STATEMENT
93 -- | ASSIGNMENT_STATEMENT | EXIT_STATEMENT
94 -- | GOTO_STATEMENT | PROCEDURE_CALL_STATEMENT
95 -- | RETURN_STATEMENT | ENTRY_CALL_STATEMENT
96 -- | REQUEUE_STATEMENT | DELAY_STATEMENT
97 -- | ABORT_STATEMENT | RAISE_STATEMENT
100 -- COMPOUND_STATEMENT ::=
101 -- IF_STATEMENT | CASE_STATEMENT
102 -- | LOOP_STATEMENT | BLOCK_STATEMENT
103 -- | ACCEPT_STATEMENT | SELECT_STATEMENT
105 -- This procedure scans a sequence of statements. The caller sets SS_Flags
106 -- to indicate acceptable termination conditions for the sequence:
108 -- SS_Flags.Eftm Terminate on ELSIF
109 -- SS_Flags.Eltm Terminate on ELSE
110 -- SS_Flags.Extm Terminate on EXCEPTION
111 -- SS_Flags.Ortm Terminate on OR
112 -- SS_Flags.Tatm Terminate on THEN ABORT (Token = ABORT on return)
113 -- SS_Flags.Whtm Terminate on WHEN
114 -- SS_Flags.Unco Unconditional terminate after scanning one statement
116 -- In addition, the scan is always terminated by encountering END or the
117 -- end of file (EOF) condition. If one of the six above terminators is
118 -- encountered with the corresponding SS_Flags flag not set, then the
119 -- action taken is as follows:
121 -- If the keyword occurs to the left of the expected column of the end
122 -- for the current sequence (as recorded in the current end context),
123 -- then it is assumed to belong to an outer context, and is considered
124 -- to terminate the sequence of statements.
126 -- If the keyword occurs to the right of, or in the expected column of
127 -- the end for the current sequence, then an error message is output,
128 -- the keyword together with its associated context is skipped, and
129 -- the statement scan continues until another terminator is found.
131 -- Note that the first action means that control can return to the caller
132 -- with Token set to a terminator other than one of those specified by the
133 -- SS parameter. The caller should treat such a case as equivalent to END.
135 -- In addition, the flag SS_Flags.Sreq is set to True to indicate that at
136 -- least one real statement (other than a pragma) is required in the
137 -- statement sequence. During the processing of the sequence, this
138 -- flag is manipulated to indicate the current status of the requirement
139 -- for a statement. For example, it is turned off by the occurrence of a
140 -- statement, and back on by a label (which requires a following statement)
142 -- Error recovery: cannot raise Error_Resync. If an error occurs during
143 -- parsing a statement, then the scan pointer is advanced past the next
144 -- semicolon and the parse continues.
146 function P_Sequence_Of_Statements
(SS_Flags
: SS_Rec
) return List_Id
is
148 Statement_Required
: Boolean;
149 -- This flag indicates if a subsequent statement (other than a pragma)
150 -- is required. It is initialized from the Sreq flag, and modified as
151 -- statements are scanned (a statement turns it off, and a label turns
152 -- it back on again since a statement must follow a label).
154 Declaration_Found
: Boolean := False;
155 -- This flag is set True if a declaration is encountered, so that the
156 -- error message about declarations in the statement part is only
157 -- given once for a given sequence of statements.
159 Scan_State_Label
: Saved_Scan_State
;
160 Scan_State
: Saved_Scan_State
;
162 Statement_List
: List_Id
;
163 Block_Label
: Name_Id
;
167 procedure Junk_Declaration
;
168 -- Procedure called to handle error of declaration encountered in
169 -- statement sequence.
171 procedure Test_Statement_Required
;
172 -- Flag error if Statement_Required flag set
174 ----------------------
175 -- Junk_Declaration --
176 ----------------------
178 procedure Junk_Declaration
is
180 if (not Declaration_Found
) or All_Errors_Mode
then
181 Error_Msg_SC
("declarations must come before BEGIN");
182 Declaration_Found
:= True;
185 Skip_Declaration
(Statement_List
);
186 end Junk_Declaration
;
188 -----------------------------
189 -- Test_Statement_Required --
190 -----------------------------
192 procedure Test_Statement_Required
is
194 if Statement_Required
then
195 Error_Msg_BC
("statement expected");
197 end Test_Statement_Required
;
199 -- Start of processing for P_Sequence_Of_Statements
202 Statement_List
:= New_List
;
203 Statement_Required
:= SS_Flags
.Sreq
;
206 while Token
= Tok_Semicolon
loop
207 Error_Msg_SC
("unexpected semicolon ignored");
208 Scan
; -- past junk semicolon
213 Style
.Check_Indentation
;
216 -- Deal with reserved identifier (in assignment or call)
218 if Is_Reserved_Identifier
then
219 Save_Scan_State
(Scan_State
); -- at possible bad identifier
220 Scan
; -- and scan past it
222 -- We have an reserved word which is spelled in identifier
223 -- style, so the question is whether it really is intended
224 -- to be an identifier.
227 -- If followed by a semicolon, then it is an identifier,
228 -- with the exception of the cases tested for below.
230 (Token
= Tok_Semicolon
231 and then Prev_Token
/= Tok_Return
232 and then Prev_Token
/= Tok_Null
233 and then Prev_Token
/= Tok_Raise
234 and then Prev_Token
/= Tok_End
235 and then Prev_Token
/= Tok_Exit
)
237 -- If followed by colon, colon-equal, or dot, then we
238 -- definitely have an identifier (could not be reserved)
240 or else Token
= Tok_Colon
241 or else Token
= Tok_Colon_Equal
242 or else Token
= Tok_Dot
244 -- Left paren means we have an identifier except for those
245 -- reserved words that can legitimately be followed by a
249 (Token
= Tok_Left_Paren
250 and then Prev_Token
/= Tok_Case
251 and then Prev_Token
/= Tok_Delay
252 and then Prev_Token
/= Tok_If
253 and then Prev_Token
/= Tok_Elsif
254 and then Prev_Token
/= Tok_Return
255 and then Prev_Token
/= Tok_When
256 and then Prev_Token
/= Tok_While
257 and then Prev_Token
/= Tok_Separate
)
259 -- Here we have an apparent reserved identifier and the
260 -- token past it is appropriate to this usage (and would
261 -- be a definite error if this is not an identifier). What
262 -- we do is to use P_Identifier to fix up the identifier,
263 -- and then fall into the normal processing.
265 Restore_Scan_State
(Scan_State
); -- back to the ID
266 Scan_Reserved_Identifier
(Force_Msg
=> False);
268 -- Not a reserved identifier after all (or at least we can't
269 -- be sure that it is), so reset the scan and continue.
272 Restore_Scan_State
(Scan_State
); -- back to the reserved word
276 -- Now look to see what kind of statement we have
280 -- Case of end or EOF
282 when Tok_End | Tok_EOF
=>
284 -- These tokens always terminate the statement sequence
286 Test_Statement_Required
;
293 -- Terminate if Eftm set or if the ELSIF is to the left
294 -- of the expected column of the end for this sequence
297 or else Start_Column
< Scope
.Table
(Scope
.Last
).Ecol
299 Test_Statement_Required
;
302 -- Otherwise complain and skip past ELSIF Condition then
305 Error_Msg_SC
("ELSIF not allowed here");
307 Discard_Junk_Node
(P_Expression_No_Right_Paren
);
309 Statement_Required
:= False;
316 -- Terminate if Eltm set or if the else is to the left
317 -- of the expected column of the end for this sequence
320 or else Start_Column
< Scope
.Table
(Scope
.Last
).Ecol
322 Test_Statement_Required
;
325 -- Otherwise complain and skip past else
328 Error_Msg_SC
("ELSE not allowed here");
330 Statement_Required
:= False;
335 when Tok_Exception
=>
336 Test_Statement_Required
;
338 -- If Extm not set and the exception is not to the left
339 -- of the expected column of the end for this sequence, then
340 -- we assume it belongs to the current sequence, even though
341 -- it is not permitted.
343 if not SS_Flags
.Extm
and then
344 Start_Column
>= Scope
.Table
(Scope
.Last
).Ecol
347 Error_Msg_SC
("exception handler not permitted here");
348 Scan
; -- past EXCEPTION
349 Discard_Junk_List
(Parse_Exception_Handlers
);
352 -- Always return, in the case where we scanned out handlers
353 -- that we did not expect, Parse_Exception_Handlers returned
354 -- with Token being either end or EOF, so we are OK
362 -- Terminate if Ortm set or if the or is to the left
363 -- of the expected column of the end for this sequence
366 or else Start_Column
< Scope
.Table
(Scope
.Last
).Ecol
368 Test_Statement_Required
;
371 -- Otherwise complain and skip past or
374 Error_Msg_SC
("OR not allowed here");
376 Statement_Required
:= False;
379 -- Case of THEN (deal also with THEN ABORT)
382 Save_Scan_State
(Scan_State
); -- at THEN
385 -- Terminate if THEN ABORT allowed (ATC case)
387 exit when SS_Flags
.Tatm
and then Token
= Tok_Abort
;
389 -- Otherwise we treat THEN as some kind of mess where we
390 -- did not see the associated IF, but we pick up assuming
391 -- it had been there!
393 Restore_Scan_State
(Scan_State
); -- to THEN
394 Append_To
(Statement_List
, P_If_Statement
);
395 Statement_Required
:= False;
397 -- Case of WHEN (error because we are not in a case)
399 when Tok_When | Tok_Others
=>
401 -- Terminate if Whtm set or if the WHEN is to the left
402 -- of the expected column of the end for this sequence
405 or else Start_Column
< Scope
.Table
(Scope
.Last
).Ecol
407 Test_Statement_Required
;
410 -- Otherwise complain and skip when Choice {| Choice} =>
413 Error_Msg_SC
("WHEN not allowed here");
415 Discard_Junk_List
(P_Discrete_Choice_List
);
417 Statement_Required
:= False;
420 -- Cases of statements starting with an identifier
422 when Tok_Identifier
=>
425 -- Save scan pointers and line number in case block label
427 Id_Node
:= Token_Node
;
428 Block_Label
:= Token_Name
;
429 Save_Scan_State
(Scan_State_Label
); -- at possible label
432 -- Check for common case of assignment, since it occurs
433 -- frequently, and we want to process it efficiently.
435 if Token
= Tok_Colon_Equal
then
436 Scan
; -- past the colon-equal
437 Append_To
(Statement_List
,
438 P_Assignment_Statement
(Id_Node
));
439 Statement_Required
:= False;
441 -- Check common case of procedure call, another case that
442 -- we want to speed up as much as possible.
444 elsif Token
= Tok_Semicolon
then
445 Append_To
(Statement_List
,
446 P_Statement_Name
(Id_Node
));
447 Scan
; -- past semicolon
448 Statement_Required
:= False;
450 -- Check for case of "go to" in place of "goto"
452 elsif Token
= Tok_Identifier
453 and then Block_Label
= Name_Go
454 and then Token_Name
= Name_To
456 Error_Msg_SP
("goto is one word");
457 Append_To
(Statement_List
, P_Goto_Statement
);
458 Statement_Required
:= False;
460 -- Check common case of = used instead of :=, just so we
461 -- give a better error message for this special misuse.
463 elsif Token
= Tok_Equal
then
464 T_Colon_Equal
; -- give := expected message
465 Append_To
(Statement_List
,
466 P_Assignment_Statement
(Id_Node
));
467 Statement_Required
:= False;
469 -- Check case of loop label or block label
471 elsif Token
= Tok_Colon
472 or else (Token
in Token_Class_Labeled_Stmt
473 and then not Token_Is_At_Start_Of_Line
)
475 T_Colon
; -- past colon (if there, or msg for missing one)
477 -- Test for more than one label
480 exit when Token
/= Tok_Identifier
;
481 Save_Scan_State
(Scan_State
); -- at second Id
484 if Token
= Tok_Colon
then
486 ("only one label allowed on block or loop");
487 Scan
; -- past colon on extra label
489 -- Use the second label as the "real" label
491 Scan_State_Label
:= Scan_State
;
493 -- We will set Error_name as the Block_Label since
494 -- we really don't know which of the labels might
495 -- be used at the end of the loop or block!
497 Block_Label
:= Error_Name
;
499 -- If Id with no colon, then backup to point to the
500 -- Id and we will issue the message below when we try
501 -- to scan out the statement as some other form.
504 Restore_Scan_State
(Scan_State
); -- to second Id
509 -- Loop_Statement (labeled Loop_Statement)
511 if Token
= Tok_Loop
then
512 Append_To
(Statement_List
,
513 P_Loop_Statement
(Id_Node
));
515 -- While statement (labeled loop statement with WHILE)
517 elsif Token
= Tok_While
then
518 Append_To
(Statement_List
,
519 P_While_Statement
(Id_Node
));
521 -- Declare statement (labeled block statement with
524 elsif Token
= Tok_Declare
then
525 Append_To
(Statement_List
,
526 P_Declare_Statement
(Id_Node
));
528 -- Begin statement (labeled block statement with no
531 elsif Token
= Tok_Begin
then
532 Append_To
(Statement_List
,
533 P_Begin_Statement
(Id_Node
));
535 -- For statement (labeled loop statement with FOR)
537 elsif Token
= Tok_For
then
538 Append_To
(Statement_List
,
539 P_For_Statement
(Id_Node
));
541 -- Improper statement follows label. If we have an
542 -- expression token, then assume the colon was part
543 -- of a misplaced declaration.
545 elsif Token
not in Token_Class_Eterm
then
546 Restore_Scan_State
(Scan_State_Label
);
549 -- Otherwise complain we have inappropriate statement
553 ("loop or block statement must follow label");
556 Statement_Required
:= False;
558 -- Here we have an identifier followed by something
559 -- other than a colon, semicolon or assignment symbol.
560 -- The only valid possibility is a name extension symbol
562 elsif Token
in Token_Class_Namext
then
563 Restore_Scan_State
(Scan_State_Label
); -- to Id
566 -- Skip junk right parens in this context
568 while Token
= Tok_Right_Paren
loop
569 Error_Msg_SC
("extra right paren");
573 -- Check context following call
575 if Token
= Tok_Colon_Equal
then
576 Scan
; -- past colon equal
577 Append_To
(Statement_List
,
578 P_Assignment_Statement
(Name_Node
));
579 Statement_Required
:= False;
581 -- Check common case of = used instead of :=
583 elsif Token
= Tok_Equal
then
584 T_Colon_Equal
; -- give := expected message
585 Append_To
(Statement_List
,
586 P_Assignment_Statement
(Name_Node
));
587 Statement_Required
:= False;
589 -- Check apostrophe cases
591 elsif Token
= Tok_Apostrophe
then
592 Append_To
(Statement_List
,
593 P_Code_Statement
(Name_Node
));
594 Statement_Required
:= False;
596 -- The only other valid item after a name is ; which
597 -- means that the item we just scanned was a call.
599 elsif Token
= Tok_Semicolon
then
600 Append_To
(Statement_List
,
601 P_Statement_Name
(Name_Node
));
602 Scan
; -- past semicolon
603 Statement_Required
:= False;
605 -- A slash following an identifier or a selected
606 -- component in this situation is most likely a period
607 -- (see location of keys on keyboard).
609 elsif Token
= Tok_Slash
610 and then (Nkind
(Name_Node
) = N_Identifier
612 Nkind
(Name_Node
) = N_Selected_Component
)
614 Error_Msg_SC
("""/"" should be "".""");
615 Statement_Required
:= False;
618 -- Else we have a missing semicolon
622 Statement_Required
:= False;
625 -- If junk after identifier, check if identifier is an
626 -- instance of an incorrectly spelled keyword. If so, we
627 -- do nothing. The Bad_Spelling_Of will have reset Token
628 -- to the appropriate keyword, so the next time round the
629 -- loop we will process the modified token. Note that we
630 -- check for ELSIF before ELSE here. That's not accidental.
631 -- We don't want to identify a misspelling of ELSE as
632 -- ELSIF, and in particular we do not want to treat ELSEIF
636 Restore_Scan_State
(Scan_State_Label
); -- to identifier
638 if Bad_Spelling_Of
(Tok_Abort
)
639 or else Bad_Spelling_Of
(Tok_Accept
)
640 or else Bad_Spelling_Of
(Tok_Case
)
641 or else Bad_Spelling_Of
(Tok_Declare
)
642 or else Bad_Spelling_Of
(Tok_Delay
)
643 or else Bad_Spelling_Of
(Tok_Elsif
)
644 or else Bad_Spelling_Of
(Tok_Else
)
645 or else Bad_Spelling_Of
(Tok_End
)
646 or else Bad_Spelling_Of
(Tok_Exception
)
647 or else Bad_Spelling_Of
(Tok_Exit
)
648 or else Bad_Spelling_Of
(Tok_For
)
649 or else Bad_Spelling_Of
(Tok_Goto
)
650 or else Bad_Spelling_Of
(Tok_If
)
651 or else Bad_Spelling_Of
(Tok_Loop
)
652 or else Bad_Spelling_Of
(Tok_Or
)
653 or else Bad_Spelling_Of
(Tok_Pragma
)
654 or else Bad_Spelling_Of
(Tok_Raise
)
655 or else Bad_Spelling_Of
(Tok_Requeue
)
656 or else Bad_Spelling_Of
(Tok_Return
)
657 or else Bad_Spelling_Of
(Tok_Select
)
658 or else Bad_Spelling_Of
(Tok_When
)
659 or else Bad_Spelling_Of
(Tok_While
)
663 -- If not a bad spelling, then we really have junk
666 Scan
; -- past identifier again
668 -- If next token is first token on line, then we
669 -- consider that we were missing a semicolon after
670 -- the identifier, and process it as a procedure
671 -- call with no parameters.
673 if Token_Is_At_Start_Of_Line
then
674 Append_To
(Statement_List
,
675 P_Statement_Name
(Id_Node
));
676 T_Semicolon
; -- to give error message
677 Statement_Required
:= False;
679 -- Otherwise we give a missing := message and
680 -- simply abandon the junk that is there now.
683 T_Colon_Equal
; -- give := expected message
690 -- Statement starting with operator symbol. This could be
691 -- a call, a name starting an assignment, or a qualified
694 when Tok_Operator_Symbol
=>
698 -- An attempt at a range attribute or a qualified expression
699 -- must be illegal here (a code statement cannot possibly
700 -- allow qualification by a function name).
702 if Token
= Tok_Apostrophe
then
703 Error_Msg_SC
("apostrophe illegal here");
707 -- Scan possible assignment if we have a name
709 if Expr_Form
= EF_Name
710 and then Token
= Tok_Colon_Equal
712 Scan
; -- past colon equal
713 Append_To
(Statement_List
,
714 P_Assignment_Statement
(Name_Node
));
716 Append_To
(Statement_List
,
717 P_Statement_Name
(Name_Node
));
721 Statement_Required
:= False;
723 -- Label starting with << which must precede real statement
725 when Tok_Less_Less
=>
726 Append_To
(Statement_List
, P_Label
);
727 Statement_Required
:= True;
729 -- Pragma appearing as a statement in a statement sequence
733 Append_To
(Statement_List
, P_Pragma
);
739 Append_To
(Statement_List
, P_Abort_Statement
);
740 Statement_Required
:= False;
746 Append_To
(Statement_List
, P_Accept_Statement
);
747 Statement_Required
:= False;
749 -- Begin_Statement (Block_Statement with no declare, no label)
753 Append_To
(Statement_List
, P_Begin_Statement
);
754 Statement_Required
:= False;
760 Append_To
(Statement_List
, P_Case_Statement
);
761 Statement_Required
:= False;
763 -- Block_Statement with DECLARE and no label
767 Append_To
(Statement_List
, P_Declare_Statement
);
768 Statement_Required
:= False;
774 Append_To
(Statement_List
, P_Delay_Statement
);
775 Statement_Required
:= False;
781 Append_To
(Statement_List
, P_Exit_Statement
);
782 Statement_Required
:= False;
784 -- Loop_Statement with FOR and no label
788 Append_To
(Statement_List
, P_For_Statement
);
789 Statement_Required
:= False;
795 Append_To
(Statement_List
, P_Goto_Statement
);
796 Statement_Required
:= False;
802 Append_To
(Statement_List
, P_If_Statement
);
803 Statement_Required
:= False;
809 Append_To
(Statement_List
, P_Loop_Statement
);
810 Statement_Required
:= False;
816 Append_To
(Statement_List
, P_Null_Statement
);
817 Statement_Required
:= False;
823 Append_To
(Statement_List
, P_Raise_Statement
);
824 Statement_Required
:= False;
830 Append_To
(Statement_List
, P_Requeue_Statement
);
831 Statement_Required
:= False;
837 Append_To
(Statement_List
, P_Return_Statement
);
838 Statement_Required
:= False;
844 Append_To
(Statement_List
, P_Select_Statement
);
845 Statement_Required
:= False;
847 -- While_Statement (Block_Statement with while and no loop)
851 Append_To
(Statement_List
, P_While_Statement
);
852 Statement_Required
:= False;
854 -- Anything else is some kind of junk, signal an error message
855 -- and then raise Error_Resync, to merge with the normal
856 -- handling of a bad statement.
860 if Token
in Token_Class_Declk
then
864 Error_Msg_BC
("statement expected");
869 -- On error resynchronization, skip past next semicolon, and, since
870 -- we are still in the statement loop, look for next statement. We
871 -- set Statement_Required False to avoid an unnecessary error message
872 -- complaining that no statement was found (i.e. we consider the
873 -- junk to satisfy the requirement for a statement being present).
877 Resync_Past_Semicolon_Or_To_Loop_Or_Then
;
878 Statement_Required
:= False;
881 exit when SS_Flags
.Unco
;
885 return Statement_List
;
887 end P_Sequence_Of_Statements
;
893 -- Parsed by P_Sequence_Of_Statements (5.1), except for the case
894 -- of a statement of the form of a name, which is handled here. The
895 -- argument passed in is the tree for the name which has been scanned
896 -- The returned value is the corresponding statement form.
898 -- This routine is also used by Par.Prag for processing the procedure
899 -- call that appears as the second argument of a pragma Assert.
901 -- Error recovery: cannot raise Error_Resync
903 function P_Statement_Name
(Name_Node
: Node_Id
) return Node_Id
is
907 -- Case of Indexed component, which is a procedure call with arguments
909 if Nkind
(Name_Node
) = N_Indexed_Component
then
911 Prefix_Node
: constant Node_Id
:= Prefix
(Name_Node
);
912 Exprs_Node
: constant List_Id
:= Expressions
(Name_Node
);
915 Change_Node
(Name_Node
, N_Procedure_Call_Statement
);
916 Set_Name
(Name_Node
, Prefix_Node
);
917 Set_Parameter_Associations
(Name_Node
, Exprs_Node
);
921 -- Case of function call node, which is a really a procedure call
923 elsif Nkind
(Name_Node
) = N_Function_Call
then
925 Fname_Node
: constant Node_Id
:= Name
(Name_Node
);
926 Params_List
: constant List_Id
:=
927 Parameter_Associations
(Name_Node
);
930 Change_Node
(Name_Node
, N_Procedure_Call_Statement
);
931 Set_Name
(Name_Node
, Fname_Node
);
932 Set_Parameter_Associations
(Name_Node
, Params_List
);
936 -- Case of call to attribute that denotes a procedure. Here we
937 -- just leave the attribute reference unchanged.
939 elsif Nkind
(Name_Node
) = N_Attribute_Reference
940 and then Is_Procedure_Attribute_Name
(Attribute_Name
(Name_Node
))
944 -- All other cases of names are parameterless procedure calls
948 New_Node
(N_Procedure_Call_Statement
, Sloc
(Name_Node
));
949 Set_Name
(Stmt_Node
, Name_Node
);
953 end P_Statement_Name
;
955 ---------------------------
956 -- 5.1 Simple Statement --
957 ---------------------------
959 -- Parsed by P_Sequence_Of_Statements (5.1)
961 -----------------------------
962 -- 5.1 Compound Statement --
963 -----------------------------
965 -- Parsed by P_Sequence_Of_Statements (5.1)
967 -------------------------
968 -- 5.1 Null Statement --
969 -------------------------
971 -- NULL_STATEMENT ::= null;
973 -- The caller has already checked that the current token is null
975 -- Error recovery: cannot raise Error_Resync
977 function P_Null_Statement
return Node_Id
is
978 Null_Stmt_Node
: Node_Id
;
981 Null_Stmt_Node
:= New_Node
(N_Null_Statement
, Token_Ptr
);
984 return Null_Stmt_Node
;
985 end P_Null_Statement
;
991 -- LABEL ::= <<label_STATEMENT_IDENTIFIER>>
993 -- STATEMENT_INDENTIFIER ::= DIRECT_NAME
995 -- The IDENTIFIER of a STATEMENT_IDENTIFIER shall be an identifier
996 -- (not an OPERATOR_SYMBOL)
998 -- The caller has already checked that the current token is <<
1000 -- Error recovery: can raise Error_Resync
1002 function P_Label
return Node_Id
is
1003 Label_Node
: Node_Id
;
1006 Label_Node
:= New_Node
(N_Label
, Token_Ptr
);
1008 Set_Identifier
(Label_Node
, P_Identifier
(C_Greater_Greater
));
1010 Append_Elmt
(Label_Node
, Label_List
);
1014 -------------------------------
1015 -- 5.1 Statement Identifier --
1016 -------------------------------
1018 -- Statement label is parsed by P_Label (5.1)
1020 -- Loop label is parsed by P_Loop_Statement (5.5), P_For_Statement (5.5)
1021 -- or P_While_Statement (5.5)
1023 -- Block label is parsed by P_Begin_Statement (5.6) or
1024 -- P_Declare_Statement (5.6)
1026 -------------------------------
1027 -- 5.2 Assignment Statement --
1028 -------------------------------
1030 -- ASSIGNMENT_STATEMENT ::=
1031 -- variable_NAME := EXPRESSION;
1033 -- Error recovery: can raise Error_Resync
1035 function P_Assignment_Statement
(LHS
: Node_Id
) return Node_Id
is
1036 Assign_Node
: Node_Id
;
1039 Assign_Node
:= New_Node
(N_Assignment_Statement
, Prev_Token_Ptr
);
1040 Set_Name
(Assign_Node
, LHS
);
1041 Set_Expression
(Assign_Node
, P_Expression_No_Right_Paren
);
1044 end P_Assignment_Statement
;
1046 -----------------------
1047 -- 5.3 If Statement --
1048 -----------------------
1051 -- if CONDITION then
1052 -- SEQUENCE_OF_STATEMENTS
1053 -- {elsif CONDITION then
1054 -- SEQUENCE_OF_STATEMENTS}
1056 -- SEQUENCE_OF_STATEMENTS]
1059 -- The caller has checked that the initial token is IF (or in the error
1060 -- case of a mysterious THEN, the initial token may simply be THEN, in
1061 -- which case, no condition (or IF) was scanned).
1063 -- Error recovery: can raise Error_Resync
1065 function P_If_Statement
return Node_Id
is
1067 Elsif_Node
: Node_Id
;
1070 procedure Add_Elsif_Part
;
1071 -- An internal procedure used to scan out a single ELSIF part. On entry
1072 -- the ELSIF (or an ELSE which has been determined should be ELSIF) is
1073 -- scanned out and is in Prev_Token.
1075 procedure Check_If_Column
;
1076 -- An internal procedure used to check that THEN, ELSE ELSE, or ELSIF
1077 -- appear in the right place if column checking is enabled (i.e. if
1078 -- they are the first token on the line, then they must appear in
1079 -- the same column as the opening IF).
1081 procedure Check_Then_Column
;
1082 -- This procedure carries out the style checks for a THEN token
1083 -- Note that the caller has set Loc to the Source_Ptr value for
1084 -- the previous IF or ELSIF token. These checks apply only to a
1085 -- THEN at the start of a line.
1087 function Else_Should_Be_Elsif
return Boolean;
1088 -- An internal routine used to do a special error recovery check when
1089 -- an ELSE is encountered. It determines if the ELSE should be treated
1090 -- as an ELSIF. A positive decision (TRUE returned, is made if the ELSE
1091 -- is followed by a sequence of tokens, starting on the same line as
1092 -- the ELSE, which are not expression terminators, followed by a THEN.
1093 -- On entry, the ELSE has been scanned out.
1095 procedure Add_Elsif_Part
is
1097 if No
(Elsif_Parts
(If_Node
)) then
1098 Set_Elsif_Parts
(If_Node
, New_List
);
1101 Elsif_Node
:= New_Node
(N_Elsif_Part
, Prev_Token_Ptr
);
1102 Loc
:= Prev_Token_Ptr
;
1103 Set_Condition
(Elsif_Node
, P_Condition
);
1107 (Elsif_Node
, P_Sequence_Of_Statements
(SS_Eftm_Eltm_Sreq
));
1108 Append
(Elsif_Node
, Elsif_Parts
(If_Node
));
1111 procedure Check_If_Column
is
1113 if Style
.RM_Column_Check
and then Token_Is_At_Start_Of_Line
1114 and then Start_Column
/= Scope
.Table
(Scope
.Last
).Ecol
1116 Error_Msg_Col
:= Scope
.Table
(Scope
.Last
).Ecol
;
1117 Error_Msg_SC
("(style) this token should be@");
1119 end Check_If_Column
;
1121 procedure Check_Then_Column
is
1123 if Token_Is_At_Start_Of_Line
and then Token
= Tok_Then
then
1127 Style
.Check_Then
(Loc
);
1130 end Check_Then_Column
;
1132 function Else_Should_Be_Elsif
return Boolean is
1133 Scan_State
: Saved_Scan_State
;
1136 if Token_Is_At_Start_Of_Line
then
1140 Save_Scan_State
(Scan_State
);
1143 if Token
in Token_Class_Eterm
then
1144 Restore_Scan_State
(Scan_State
);
1147 Scan
; -- past non-expression terminating token
1149 if Token
= Tok_Then
then
1150 Restore_Scan_State
(Scan_State
);
1156 end Else_Should_Be_Elsif
;
1158 -- Start of processing for P_If_Statement
1161 If_Node
:= New_Node
(N_If_Statement
, Token_Ptr
);
1164 Scope
.Table
(Scope
.Last
).Etyp
:= E_If
;
1165 Scope
.Table
(Scope
.Last
).Ecol
:= Start_Column
;
1166 Scope
.Table
(Scope
.Last
).Sloc
:= Token_Ptr
;
1167 Scope
.Table
(Scope
.Last
).Labl
:= Error
;
1168 Scope
.Table
(Scope
.Last
).Node
:= If_Node
;
1170 if Token
= Tok_If
then
1173 Set_Condition
(If_Node
, P_Condition
);
1175 -- Deal with misuse of IF expression => used instead
1176 -- of WHEN expression =>
1178 if Token
= Tok_Arrow
then
1179 Error_Msg_SC
("THEN expected");
1180 Scan
; -- past the arrow
1181 Pop_Scope_Stack
; -- remove unneeded entry
1188 Error_Msg_SC
("no IF for this THEN");
1189 Set_Condition
(If_Node
, Error
);
1195 (If_Node
, P_Sequence_Of_Statements
(SS_Eftm_Eltm_Sreq
));
1197 -- This loop scans out else and elsif parts
1200 if Token
= Tok_Elsif
then
1203 if Present
(Else_Statements
(If_Node
)) then
1204 Error_Msg_SP
("ELSIF cannot appear after ELSE");
1210 elsif Token
= Tok_Else
then
1214 if Else_Should_Be_Elsif
then
1215 Error_Msg_SP
("ELSE should be ELSIF");
1219 -- Here we have an else that really is an else
1221 if Present
(Else_Statements
(If_Node
)) then
1222 Error_Msg_SP
("only one ELSE part allowed");
1224 (P_Sequence_Of_Statements
(SS_Eftm_Eltm_Sreq
),
1225 Else_Statements
(If_Node
));
1228 (If_Node
, P_Sequence_Of_Statements
(SS_Eftm_Eltm_Sreq
));
1232 -- If anything other than ELSE or ELSIF, exit the loop. The token
1233 -- had better be END (and in fact it had better be END IF), but
1234 -- we will let End_Statements take care of checking that.
1246 --------------------
1248 --------------------
1250 -- CONDITION ::= boolean_EXPRESSION
1252 function P_Condition
return Node_Id
is
1256 Cond
:= P_Expression_No_Right_Paren
;
1258 -- It is never possible for := to follow a condition, so if we get
1259 -- a := we assume it is a mistyped equality. Note that we do not try
1260 -- to reconstruct the tree correctly in this case, but we do at least
1261 -- give an accurate error message.
1263 if Token
= Tok_Colon_Equal
then
1264 while Token
= Tok_Colon_Equal
loop
1265 Error_Msg_SC
(""":="" should be ""=""");
1266 Scan
; -- past junk :=
1267 Discard_Junk_Node
(P_Expression_No_Right_Paren
);
1272 -- Otherwise check for redundant parens
1276 and then Paren_Count
(Cond
) > 0
1278 Style
.Check_Xtra_Parens
(First_Sloc
(Cond
));
1281 -- And return the result
1287 -------------------------
1288 -- 5.4 Case Statement --
1289 -------------------------
1291 -- CASE_STATEMENT ::=
1292 -- case EXPRESSION is
1293 -- CASE_STATEMENT_ALTERNATIVE
1294 -- {CASE_STATEMENT_ALTERNATIVE}
1297 -- The caller has checked that the first token is CASE
1299 -- Can raise Error_Resync
1301 function P_Case_Statement
return Node_Id
is
1302 Case_Node
: Node_Id
;
1303 Alternatives_List
: List_Id
;
1304 First_When_Loc
: Source_Ptr
;
1307 Case_Node
:= New_Node
(N_Case_Statement
, Token_Ptr
);
1310 Scope
.Table
(Scope
.Last
).Etyp
:= E_Case
;
1311 Scope
.Table
(Scope
.Last
).Ecol
:= Start_Column
;
1312 Scope
.Table
(Scope
.Last
).Sloc
:= Token_Ptr
;
1313 Scope
.Table
(Scope
.Last
).Labl
:= Error
;
1314 Scope
.Table
(Scope
.Last
).Node
:= Case_Node
;
1317 Set_Expression
(Case_Node
, P_Expression_No_Right_Paren
);
1320 -- Prepare to parse case statement alternatives
1322 Alternatives_List
:= New_List
;
1323 P_Pragmas_Opt
(Alternatives_List
);
1324 First_When_Loc
:= Token_Ptr
;
1326 -- Loop through case statement alternatives
1329 -- If we have a WHEN or OTHERS, then that's fine keep going. Note
1330 -- that it is a semantic check to ensure the proper use of OTHERS
1332 if Token
= Tok_When
or else Token
= Tok_Others
then
1333 Append
(P_Case_Statement_Alternative
, Alternatives_List
);
1335 -- If we have an END, then probably we are at the end of the case
1336 -- but we only exit if Check_End thinks the END was reasonable.
1338 elsif Token
= Tok_End
then
1339 exit when Check_End
;
1341 -- Here if token is other than WHEN, OTHERS or END. We definitely
1342 -- have an error, but the question is whether or not to get out of
1343 -- the case statement. We don't want to get out early, or we will
1344 -- get a slew of junk error messages for subsequent when tokens.
1346 -- If the token is not at the start of the line, or if it is indented
1347 -- with respect to the current case statement, then the best guess is
1348 -- that we are still supposed to be inside the case statement. We
1349 -- complain about the missing WHEN, and discard the junk statements.
1351 elsif not Token_Is_At_Start_Of_Line
1352 or else Start_Column
> Scope
.Table
(Scope
.Last
).Ecol
1354 Error_Msg_BC
("WHEN (case statement alternative) expected");
1356 -- Here is a possibility for infinite looping if we don't make
1357 -- progress. So try to process statements, otherwise exit
1360 Error_Ptr
: constant Source_Ptr
:= Scan_Ptr
;
1362 Discard_Junk_List
(P_Sequence_Of_Statements
(SS_Whtm
));
1363 exit when Scan_Ptr
= Error_Ptr
and then Check_End
;
1366 -- Here we have a junk token at the start of the line and it is
1367 -- not indented. If Check_End thinks there is a missing END, then
1368 -- we will get out of the case, otherwise we keep going.
1371 exit when Check_End
;
1375 -- Make sure we have at least one alternative
1377 if No
(First_Non_Pragma
(Alternatives_List
)) then
1379 ("WHEN expected, must have at least one alternative in case",
1384 Set_Alternatives
(Case_Node
, Alternatives_List
);
1387 end P_Case_Statement
;
1389 -------------------------------------
1390 -- 5.4 Case Statement Alternative --
1391 -------------------------------------
1393 -- CASE_STATEMENT_ALTERNATIVE ::=
1394 -- when DISCRETE_CHOICE_LIST =>
1395 -- SEQUENCE_OF_STATEMENTS
1397 -- The caller has checked that the initial token is WHEN or OTHERS
1398 -- Error recovery: can raise Error_Resync
1400 function P_Case_Statement_Alternative
return Node_Id
is
1401 Case_Alt_Node
: Node_Id
;
1405 Style
.Check_Indentation
;
1408 Case_Alt_Node
:= New_Node
(N_Case_Statement_Alternative
, Token_Ptr
);
1409 T_When
; -- past WHEN (or give error in OTHERS case)
1410 Set_Discrete_Choices
(Case_Alt_Node
, P_Discrete_Choice_List
);
1412 Set_Statements
(Case_Alt_Node
, P_Sequence_Of_Statements
(SS_Sreq_Whtm
));
1413 return Case_Alt_Node
;
1414 end P_Case_Statement_Alternative
;
1416 -------------------------
1417 -- 5.5 Loop Statement --
1418 -------------------------
1420 -- LOOP_STATEMENT ::=
1421 -- [LOOP_STATEMENT_IDENTIFIER:]
1422 -- [ITERATION_SCHEME] loop
1423 -- SEQUENCE_OF_STATEMENTS
1424 -- end loop [loop_IDENTIFIER];
1426 -- ITERATION_SCHEME ::=
1428 -- | for LOOP_PARAMETER_SPECIFICATION
1430 -- The parsing of loop statements is handled by one of three functions
1431 -- P_Loop_Statement, P_For_Statement or P_While_Statement depending
1432 -- on the initial keyword in the construct (excluding the identifier)
1436 -- This function parses the case where no iteration scheme is present
1438 -- The caller has checked that the initial token is LOOP. The parameter
1439 -- is the node identifiers for the loop label if any (or is set to Empty
1440 -- if there is no loop label).
1442 -- Error recovery : cannot raise Error_Resync
1444 function P_Loop_Statement
(Loop_Name
: Node_Id
:= Empty
) return Node_Id
is
1445 Loop_Node
: Node_Id
;
1446 Created_Name
: Node_Id
;
1450 Scope
.Table
(Scope
.Last
).Labl
:= Loop_Name
;
1451 Scope
.Table
(Scope
.Last
).Ecol
:= Start_Column
;
1452 Scope
.Table
(Scope
.Last
).Sloc
:= Token_Ptr
;
1453 Scope
.Table
(Scope
.Last
).Etyp
:= E_Loop
;
1455 Loop_Node
:= New_Node
(N_Loop_Statement
, Token_Ptr
);
1458 if No
(Loop_Name
) then
1460 Make_Identifier
(Sloc
(Loop_Node
),
1461 Chars
=> Set_Loop_Block_Name
('L'));
1462 Set_Comes_From_Source
(Created_Name
, False);
1463 Set_Has_Created_Identifier
(Loop_Node
, True);
1464 Set_Identifier
(Loop_Node
, Created_Name
);
1465 Scope
.Table
(Scope
.Last
).Labl
:= Created_Name
;
1467 Set_Identifier
(Loop_Node
, Loop_Name
);
1470 Append_Elmt
(Loop_Node
, Label_List
);
1471 Set_Statements
(Loop_Node
, P_Sequence_Of_Statements
(SS_Sreq
));
1472 End_Statements
(Loop_Node
);
1474 end P_Loop_Statement
;
1478 -- This function parses a loop statement with a FOR iteration scheme
1480 -- The caller has checked that the initial token is FOR. The parameter
1481 -- is the node identifier for the block label if any (or is set to Empty
1482 -- if there is no block label).
1484 -- Note: the caller fills in the Identifier field if a label was present
1486 -- Error recovery: can raise Error_Resync
1488 function P_For_Statement
(Loop_Name
: Node_Id
:= Empty
) return Node_Id
is
1489 Loop_Node
: Node_Id
;
1490 Iter_Scheme_Node
: Node_Id
;
1491 Loop_For_Flag
: Boolean;
1492 Created_Name
: Node_Id
;
1496 Scope
.Table
(Scope
.Last
).Labl
:= Loop_Name
;
1497 Scope
.Table
(Scope
.Last
).Ecol
:= Start_Column
;
1498 Scope
.Table
(Scope
.Last
).Sloc
:= Token_Ptr
;
1499 Scope
.Table
(Scope
.Last
).Etyp
:= E_Loop
;
1501 Loop_For_Flag
:= (Prev_Token
= Tok_Loop
);
1503 Iter_Scheme_Node
:= New_Node
(N_Iteration_Scheme
, Token_Ptr
);
1504 Set_Loop_Parameter_Specification
1505 (Iter_Scheme_Node
, P_Loop_Parameter_Specification
);
1507 -- The following is a special test so that a miswritten for loop such
1508 -- as "loop for I in 1..10;" is handled nicely, without making an extra
1509 -- entry in the scope stack. We don't bother to actually fix up the
1510 -- tree in this case since it's not worth the effort. Instead we just
1511 -- eat up the loop junk, leaving the entry for what now looks like an
1512 -- unmodified loop intact.
1514 if Loop_For_Flag
and then Token
= Tok_Semicolon
then
1515 Error_Msg_SC
("LOOP belongs here, not before FOR");
1522 Loop_Node
:= New_Node
(N_Loop_Statement
, Token_Ptr
);
1524 if No
(Loop_Name
) then
1526 Make_Identifier
(Sloc
(Loop_Node
),
1527 Chars
=> Set_Loop_Block_Name
('L'));
1528 Set_Comes_From_Source
(Created_Name
, False);
1529 Set_Has_Created_Identifier
(Loop_Node
, True);
1530 Set_Identifier
(Loop_Node
, Created_Name
);
1531 Scope
.Table
(Scope
.Last
).Labl
:= Created_Name
;
1533 Set_Identifier
(Loop_Node
, Loop_Name
);
1537 Set_Statements
(Loop_Node
, P_Sequence_Of_Statements
(SS_Sreq
));
1538 End_Statements
(Loop_Node
);
1539 Set_Iteration_Scheme
(Loop_Node
, Iter_Scheme_Node
);
1540 Append_Elmt
(Loop_Node
, Label_List
);
1543 end P_For_Statement
;
1545 -- P_While_Statement
1547 -- This procedure scans a loop statement with a WHILE iteration scheme
1549 -- The caller has checked that the initial token is WHILE. The parameter
1550 -- is the node identifier for the block label if any (or is set to Empty
1551 -- if there is no block label).
1553 -- Error recovery: cannot raise Error_Resync
1555 function P_While_Statement
(Loop_Name
: Node_Id
:= Empty
) return Node_Id
is
1556 Loop_Node
: Node_Id
;
1557 Iter_Scheme_Node
: Node_Id
;
1558 Loop_While_Flag
: Boolean;
1559 Created_Name
: Node_Id
;
1563 Scope
.Table
(Scope
.Last
).Labl
:= Loop_Name
;
1564 Scope
.Table
(Scope
.Last
).Ecol
:= Start_Column
;
1565 Scope
.Table
(Scope
.Last
).Sloc
:= Token_Ptr
;
1566 Scope
.Table
(Scope
.Last
).Etyp
:= E_Loop
;
1568 Loop_While_Flag
:= (Prev_Token
= Tok_Loop
);
1569 Iter_Scheme_Node
:= New_Node
(N_Iteration_Scheme
, Token_Ptr
);
1571 Set_Condition
(Iter_Scheme_Node
, P_Condition
);
1573 -- The following is a special test so that a miswritten for loop such
1574 -- as "loop while I > 10;" is handled nicely, without making an extra
1575 -- entry in the scope stack. We don't bother to actually fix up the
1576 -- tree in this case since it's not worth the effort. Instead we just
1577 -- eat up the loop junk, leaving the entry for what now looks like an
1578 -- unmodified loop intact.
1580 if Loop_While_Flag
and then Token
= Tok_Semicolon
then
1581 Error_Msg_SC
("LOOP belongs here, not before WHILE");
1588 Loop_Node
:= New_Node
(N_Loop_Statement
, Token_Ptr
);
1591 if No
(Loop_Name
) then
1593 Make_Identifier
(Sloc
(Loop_Node
),
1594 Chars
=> Set_Loop_Block_Name
('L'));
1595 Set_Comes_From_Source
(Created_Name
, False);
1596 Set_Has_Created_Identifier
(Loop_Node
, True);
1597 Set_Identifier
(Loop_Node
, Created_Name
);
1598 Scope
.Table
(Scope
.Last
).Labl
:= Created_Name
;
1600 Set_Identifier
(Loop_Node
, Loop_Name
);
1603 Set_Statements
(Loop_Node
, P_Sequence_Of_Statements
(SS_Sreq
));
1604 End_Statements
(Loop_Node
);
1605 Set_Iteration_Scheme
(Loop_Node
, Iter_Scheme_Node
);
1606 Append_Elmt
(Loop_Node
, Label_List
);
1609 end P_While_Statement
;
1611 ---------------------------------------
1612 -- 5.5 Loop Parameter Specification --
1613 ---------------------------------------
1615 -- LOOP_PARAMETER_SPECIFICATION ::=
1616 -- DEFINING_IDENTIFIER in [reverse] DISCRETE_SUBTYPE_DEFINITION
1618 -- Error recovery: cannot raise Error_Resync
1620 function P_Loop_Parameter_Specification
return Node_Id
is
1621 Loop_Param_Specification_Node
: Node_Id
;
1624 Scan_State
: Saved_Scan_State
;
1627 Loop_Param_Specification_Node
:=
1628 New_Node
(N_Loop_Parameter_Specification
, Token_Ptr
);
1630 Save_Scan_State
(Scan_State
);
1631 ID_Node
:= P_Defining_Identifier
(C_In
);
1632 Set_Defining_Identifier
(Loop_Param_Specification_Node
, ID_Node
);
1634 if Token
= Tok_Left_Paren
then
1635 Error_Msg_SC
("subscripted loop parameter not allowed");
1636 Restore_Scan_State
(Scan_State
);
1637 Discard_Junk_Node
(P_Name
);
1639 elsif Token
= Tok_Dot
then
1640 Error_Msg_SC
("selected loop parameter not allowed");
1641 Restore_Scan_State
(Scan_State
);
1642 Discard_Junk_Node
(P_Name
);
1647 if Token
= Tok_Reverse
then
1648 Scan
; -- past REVERSE
1649 Set_Reverse_Present
(Loop_Param_Specification_Node
, True);
1652 Set_Discrete_Subtype_Definition
1653 (Loop_Param_Specification_Node
, P_Discrete_Subtype_Definition
);
1654 return Loop_Param_Specification_Node
;
1657 when Error_Resync
=>
1659 end P_Loop_Parameter_Specification
;
1661 --------------------------
1662 -- 5.6 Block Statement --
1663 --------------------------
1665 -- BLOCK_STATEMENT ::=
1666 -- [block_STATEMENT_IDENTIFIER:]
1668 -- DECLARATIVE_PART]
1670 -- HANDLED_SEQUENCE_OF_STATEMENTS
1671 -- end [block_IDENTIFIER];
1673 -- The parsing of block statements is handled by one of the two functions
1674 -- P_Declare_Statement or P_Begin_Statement depending on whether or not
1675 -- a declare section is present
1677 -- P_Declare_Statement
1679 -- This function parses a block statement with DECLARE present
1681 -- The caller has checked that the initial token is DECLARE
1683 -- Error recovery: cannot raise Error_Resync
1685 function P_Declare_Statement
1686 (Block_Name
: Node_Id
:= Empty
)
1689 Block_Node
: Node_Id
;
1690 Created_Name
: Node_Id
;
1693 Block_Node
:= New_Node
(N_Block_Statement
, Token_Ptr
);
1696 Scope
.Table
(Scope
.Last
).Etyp
:= E_Name
;
1697 Scope
.Table
(Scope
.Last
).Lreq
:= Present
(Block_Name
);
1698 Scope
.Table
(Scope
.Last
).Ecol
:= Start_Column
;
1699 Scope
.Table
(Scope
.Last
).Labl
:= Block_Name
;
1700 Scope
.Table
(Scope
.Last
).Sloc
:= Token_Ptr
;
1702 Scan
; -- past DECLARE
1704 if No
(Block_Name
) then
1706 Make_Identifier
(Sloc
(Block_Node
),
1707 Chars
=> Set_Loop_Block_Name
('B'));
1708 Set_Comes_From_Source
(Created_Name
, False);
1709 Set_Has_Created_Identifier
(Block_Node
, True);
1710 Set_Identifier
(Block_Node
, Created_Name
);
1711 Scope
.Table
(Scope
.Last
).Labl
:= Created_Name
;
1713 Set_Identifier
(Block_Node
, Block_Name
);
1716 Append_Elmt
(Block_Node
, Label_List
);
1717 Parse_Decls_Begin_End
(Block_Node
);
1719 end P_Declare_Statement
;
1721 -- P_Begin_Statement
1723 -- This function parses a block statement with no DECLARE present
1725 -- The caller has checked that the initial token is BEGIN
1727 -- Error recovery: cannot raise Error_Resync
1729 function P_Begin_Statement
1730 (Block_Name
: Node_Id
:= Empty
)
1733 Block_Node
: Node_Id
;
1734 Created_Name
: Node_Id
;
1737 Block_Node
:= New_Node
(N_Block_Statement
, Token_Ptr
);
1740 Scope
.Table
(Scope
.Last
).Etyp
:= E_Name
;
1741 Scope
.Table
(Scope
.Last
).Lreq
:= Present
(Block_Name
);
1742 Scope
.Table
(Scope
.Last
).Ecol
:= Start_Column
;
1743 Scope
.Table
(Scope
.Last
).Labl
:= Block_Name
;
1744 Scope
.Table
(Scope
.Last
).Sloc
:= Token_Ptr
;
1746 if No
(Block_Name
) then
1748 Make_Identifier
(Sloc
(Block_Node
),
1749 Chars
=> Set_Loop_Block_Name
('B'));
1750 Set_Comes_From_Source
(Created_Name
, False);
1751 Set_Has_Created_Identifier
(Block_Node
, True);
1752 Set_Identifier
(Block_Node
, Created_Name
);
1753 Scope
.Table
(Scope
.Last
).Labl
:= Created_Name
;
1755 Set_Identifier
(Block_Node
, Block_Name
);
1758 Append_Elmt
(Block_Node
, Label_List
);
1760 Scope
.Table
(Scope
.Last
).Ecol
:= Start_Column
;
1761 Scope
.Table
(Scope
.Last
).Sloc
:= Token_Ptr
;
1763 Set_Handled_Statement_Sequence
1764 (Block_Node
, P_Handled_Sequence_Of_Statements
);
1765 End_Statements
(Handled_Statement_Sequence
(Block_Node
));
1767 end P_Begin_Statement
;
1769 -------------------------
1770 -- 5.7 Exit Statement --
1771 -------------------------
1773 -- EXIT_STATEMENT ::=
1774 -- exit [loop_NAME] [when CONDITION];
1776 -- The caller has checked that the initial token is EXIT
1778 -- Error recovery: can raise Error_Resync
1780 function P_Exit_Statement
return Node_Id
is
1781 Exit_Node
: Node_Id
;
1783 function Missing_Semicolon_On_Exit
return Boolean;
1784 -- This function deals with the following specialized situation
1787 -- exit [identifier]
1790 -- This looks like a messed up EXIT WHEN, when in fact the problem
1791 -- is a missing semicolon. It is called with Token pointing to the
1792 -- WHEN token, and returns True if a semicolon is missing before
1793 -- the WHEN as in the above example.
1795 -------------------------------
1796 -- Missing_Semicolon_On_Exit --
1797 -------------------------------
1799 function Missing_Semicolon_On_Exit
return Boolean is
1800 State
: Saved_Scan_State
;
1803 if not Token_Is_At_Start_Of_Line
then
1806 elsif Scope
.Table
(Scope
.Last
).Etyp
/= E_Case
then
1810 Save_Scan_State
(State
);
1812 Scan
; -- past token after WHEN
1814 if Token
= Tok_Arrow
then
1815 Restore_Scan_State
(State
);
1818 Restore_Scan_State
(State
);
1822 end Missing_Semicolon_On_Exit
;
1824 -- Start of processing for P_Exit_Statement
1827 Exit_Node
:= New_Node
(N_Exit_Statement
, Token_Ptr
);
1830 if Token
= Tok_Identifier
then
1831 Set_Name
(Exit_Node
, P_Qualified_Simple_Name
);
1833 elsif Style_Check
then
1834 -- This EXIT has no name, so check that
1835 -- the innermost loop is unnamed too.
1837 Check_No_Exit_Name
:
1838 for J
in reverse 1 .. Scope
.Last
loop
1839 if Scope
.Table
(J
).Etyp
= E_Loop
then
1840 if Present
(Scope
.Table
(J
).Labl
)
1841 and then Comes_From_Source
(Scope
.Table
(J
).Labl
)
1843 -- Innermost loop in fact had a name, style check fails
1845 Style
.No_Exit_Name
(Scope
.Table
(J
).Labl
);
1848 exit Check_No_Exit_Name
;
1850 end loop Check_No_Exit_Name
;
1853 if Token
= Tok_When
and then not Missing_Semicolon_On_Exit
then
1855 Set_Condition
(Exit_Node
, P_Condition
);
1857 -- Allow IF instead of WHEN, giving error message
1859 elsif Token
= Tok_If
then
1861 Scan
; -- past IF used in place of WHEN
1862 Set_Condition
(Exit_Node
, P_Expression_No_Right_Paren
);
1867 end P_Exit_Statement
;
1869 -------------------------
1870 -- 5.8 Goto Statement --
1871 -------------------------
1873 -- GOTO_STATEMENT ::= goto label_NAME;
1875 -- The caller has checked that the initial token is GOTO (or TO in the
1876 -- error case where GO and TO were incorrectly separated).
1878 -- Error recovery: can raise Error_Resync
1880 function P_Goto_Statement
return Node_Id
is
1881 Goto_Node
: Node_Id
;
1884 Goto_Node
:= New_Node
(N_Goto_Statement
, Token_Ptr
);
1885 Scan
; -- past GOTO (or TO)
1886 Set_Name
(Goto_Node
, P_Qualified_Simple_Name_Resync
);
1887 Append_Elmt
(Goto_Node
, Goto_List
);
1891 end P_Goto_Statement
;
1893 ---------------------------
1894 -- Parse_Decls_Begin_End --
1895 ---------------------------
1897 -- This function parses the construct:
1901 -- HANDLED_SEQUENCE_OF_STATEMENTS
1904 -- The caller has built the scope stack entry, and created the node to
1905 -- whose Declarations and Handled_Statement_Sequence fields are to be
1906 -- set. On return these fields are filled in (except in the case of a
1907 -- task body, where the handled statement sequence is optional, and may
1908 -- thus be Empty), and the scan is positioned past the End sequence.
1910 -- If the BEGIN is missing, then the parent node is used to help construct
1911 -- an appropriate missing BEGIN message. Possibilities for the parent are:
1913 -- N_Block_Statement declare block
1914 -- N_Entry_Body entry body
1915 -- N_Package_Body package body (begin part optional)
1916 -- N_Subprogram_Body procedure or function body
1917 -- N_Task_Body task body
1919 -- Note: in the case of a block statement, there is definitely a DECLARE
1920 -- present (because a Begin statement without a DECLARE is handled by the
1921 -- P_Begin_Statement procedure, which does not call Parse_Decls_Begin_End.
1923 -- Error recovery: cannot raise Error_Resync
1925 procedure Parse_Decls_Begin_End
(Parent
: Node_Id
) is
1926 Body_Decl
: Node_Id
;
1927 Body_Sloc
: Source_Ptr
;
1930 Parent_Nkind
: Node_Kind
;
1931 Spec_Node
: Node_Id
;
1934 procedure Missing_Begin
(Msg
: String);
1935 -- Called to post a missing begin message. In the normal case this is
1936 -- posted at the start of the current token. A special case arises when
1937 -- P_Declarative_Items has previously found a missing begin, in which
1938 -- case we replace the original error message.
1940 procedure Set_Null_HSS
(Parent
: Node_Id
);
1941 -- Construct an empty handled statement sequence and install in Parent
1942 -- Leaves HSS set to reference the newly constructed statement sequence.
1948 procedure Missing_Begin
(Msg
: String) is
1950 if Missing_Begin_Msg
= No_Error_Msg
then
1953 Change_Error_Text
(Missing_Begin_Msg
, Msg
);
1955 -- Purge any messages issued after than, since a missing begin
1956 -- can cause a lot of havoc, and it is better not to dump these
1957 -- cascaded messages on the user.
1959 Purge_Messages
(Get_Location
(Missing_Begin_Msg
), Prev_Token_Ptr
);
1967 procedure Set_Null_HSS
(Parent
: Node_Id
) is
1972 Make_Null_Statement
(Token_Ptr
);
1973 Set_Comes_From_Source
(Null_Stm
, False);
1976 Make_Handled_Sequence_Of_Statements
(Token_Ptr
,
1977 Statements
=> New_List
(Null_Stm
));
1978 Set_Comes_From_Source
(HSS
, False);
1980 Set_Handled_Statement_Sequence
(Parent
, HSS
);
1983 -- Start of processing for Parse_Decls_Begin_End
1986 Decls
:= P_Declarative_Part
;
1988 -- Check for misplacement of later vs basic declarations in Ada 83
1990 if Ada_Version
= Ada_83
then
1991 Decl
:= First
(Decls
);
1993 -- Loop through sequence of basic declarative items
1995 Outer
: while Present
(Decl
) loop
1996 if Nkind
(Decl
) /= N_Subprogram_Body
1997 and then Nkind
(Decl
) /= N_Package_Body
1998 and then Nkind
(Decl
) /= N_Task_Body
1999 and then Nkind
(Decl
) not in N_Body_Stub
2003 -- Once a body is encountered, we only allow later declarative
2004 -- items. The inner loop checks the rest of the list.
2007 Body_Sloc
:= Sloc
(Decl
);
2009 Inner
: while Present
(Decl
) loop
2010 if Nkind
(Decl
) not in N_Later_Decl_Item
2011 and then Nkind
(Decl
) /= N_Pragma
2013 if Ada_Version
= Ada_83
then
2014 Error_Msg_Sloc
:= Body_Sloc
;
2016 ("(Ada 83) decl cannot appear after body#", Decl
);
2026 -- Here is where we deal with the case of IS used instead of semicolon.
2027 -- Specifically, if the last declaration in the declarative part is a
2028 -- subprogram body still marked as having a bad IS, then this is where
2029 -- we decide that the IS should really have been a semicolon and that
2030 -- the body should have been a declaration. Note that if the bad IS
2031 -- had turned out to be OK (i.e. a decent begin/end was found for it),
2032 -- then the Bad_Is_Detected flag would have been reset by now.
2034 Body_Decl
:= Last
(Decls
);
2036 if Present
(Body_Decl
)
2037 and then Nkind
(Body_Decl
) = N_Subprogram_Body
2038 and then Bad_Is_Detected
(Body_Decl
)
2040 -- OK, we have the case of a bad IS, so we need to fix up the tree.
2041 -- What we have now is a subprogram body with attached declarations
2042 -- and a possible statement sequence.
2044 -- First step is to take the declarations that were part of the bogus
2045 -- subprogram body and append them to the outer declaration chain.
2046 -- In other words we append them past the body (which we will later
2047 -- convert into a declaration).
2049 Append_List
(Declarations
(Body_Decl
), Decls
);
2051 -- Now take the handled statement sequence of the bogus body and
2052 -- set it as the statement sequence for the outer construct. Note
2053 -- that it may be empty (we specially allowed a missing BEGIN for
2054 -- a subprogram body marked as having a bad IS -- see below).
2056 Set_Handled_Statement_Sequence
(Parent
,
2057 Handled_Statement_Sequence
(Body_Decl
));
2059 -- Next step is to convert the old body node to a declaration node
2061 Spec_Node
:= Specification
(Body_Decl
);
2062 Change_Node
(Body_Decl
, N_Subprogram_Declaration
);
2063 Set_Specification
(Body_Decl
, Spec_Node
);
2065 -- Final step is to put the declarations for the parent where
2066 -- they belong, and then fall through the IF to scan out the
2069 Set_Declarations
(Parent
, Decls
);
2071 -- This is the normal case (i.e. any case except the bad IS case)
2072 -- If we have a BEGIN, then scan out the sequence of statements, and
2073 -- also reset the expected column for the END to match the BEGIN.
2076 Set_Declarations
(Parent
, Decls
);
2078 if Token
= Tok_Begin
then
2080 Style
.Check_Indentation
;
2083 Error_Msg_Col
:= Scope
.Table
(Scope
.Last
).Ecol
;
2085 if Style
.RM_Column_Check
2086 and then Token_Is_At_Start_Of_Line
2087 and then Start_Column
/= Error_Msg_Col
2089 Error_Msg_SC
("(style) BEGIN in wrong column, should be@");
2092 Scope
.Table
(Scope
.Last
).Ecol
:= Start_Column
;
2095 Scope
.Table
(Scope
.Last
).Sloc
:= Token_Ptr
;
2097 Set_Handled_Statement_Sequence
(Parent
,
2098 P_Handled_Sequence_Of_Statements
);
2103 Parent_Nkind
:= Nkind
(Parent
);
2105 -- A special check for the missing IS case. If we have a
2106 -- subprogram body that was marked as having a suspicious
2107 -- IS, and the current token is END, then we simply confirm
2108 -- the suspicion, and do not require a BEGIN to be present
2110 if Parent_Nkind
= N_Subprogram_Body
2111 and then Token
= Tok_End
2112 and then Scope
.Table
(Scope
.Last
).Etyp
= E_Suspicious_Is
2114 Scope
.Table
(Scope
.Last
).Etyp
:= E_Bad_Is
;
2116 -- Otherwise BEGIN is not required for a package body, so we
2117 -- don't mind if it is missing, but we do construct a dummy
2118 -- one (so that we have somewhere to set End_Label).
2120 -- However if we have something other than a BEGIN which
2121 -- looks like it might be statements, then we signal a missing
2122 -- BEGIN for these cases as well. We define "something which
2123 -- looks like it might be statements" as a token other than
2124 -- END, EOF, or a token which starts declarations.
2126 elsif Parent_Nkind
= N_Package_Body
2127 and then (Token
= Tok_End
2128 or else Token
= Tok_EOF
2129 or else Token
in Token_Class_Declk
)
2131 Set_Null_HSS
(Parent
);
2133 -- These are cases in which a BEGIN is required and not present
2136 Set_Null_HSS
(Parent
);
2138 -- Prepare to issue error message
2140 Error_Msg_Sloc
:= Scope
.Table
(Scope
.Last
).Sloc
;
2141 Error_Msg_Node_1
:= Scope
.Table
(Scope
.Last
).Labl
;
2143 -- Now issue appropriate message
2145 if Parent_Nkind
= N_Block_Statement
then
2146 Missing_Begin
("missing BEGIN for DECLARE#!");
2148 elsif Parent_Nkind
= N_Entry_Body
then
2149 Missing_Begin
("missing BEGIN for ENTRY#!");
2151 elsif Parent_Nkind
= N_Subprogram_Body
then
2152 if Nkind
(Specification
(Parent
))
2153 = N_Function_Specification
2155 Missing_Begin
("missing BEGIN for function&#!");
2157 Missing_Begin
("missing BEGIN for procedure&#!");
2160 -- The case for package body arises only when
2161 -- we have possible statement junk present.
2163 elsif Parent_Nkind
= N_Package_Body
then
2164 Missing_Begin
("missing BEGIN for package body&#!");
2167 pragma Assert
(Parent_Nkind
= N_Task_Body
);
2168 Missing_Begin
("missing BEGIN for task body&#!");
2171 -- Here we pick up the statements after the BEGIN that
2172 -- should have been present but was not. We don't insist
2173 -- on statements being present if P_Declarative_Part had
2174 -- already found a missing BEGIN, since it might have
2175 -- swallowed a lone statement into the declarative part.
2177 if Missing_Begin_Msg
/= No_Error_Msg
2178 and then Token
= Tok_End
2182 Set_Handled_Statement_Sequence
(Parent
,
2183 P_Handled_Sequence_Of_Statements
);
2189 -- Here with declarations and handled statement sequence scanned
2191 if Present
(Handled_Statement_Sequence
(Parent
)) then
2192 End_Statements
(Handled_Statement_Sequence
(Parent
));
2197 -- We know that End_Statements removed an entry from the scope stack
2198 -- (because it is required to do so under all circumstances). We can
2199 -- therefore reference the entry it removed one past the stack top.
2200 -- What we are interested in is whether it was a case of a bad IS.
2202 if Scope
.Table
(Scope
.Last
+ 1).Etyp
= E_Bad_Is
then
2203 Error_Msg
("IS should be "";""", Scope
.Table
(Scope
.Last
+ 1).S_Is
);
2204 Set_Bad_Is_Detected
(Parent
, True);
2207 end Parse_Decls_Begin_End
;
2209 -------------------------
2210 -- Set_Loop_Block_Name --
2211 -------------------------
2213 function Set_Loop_Block_Name
(L
: Character) return Name_Id
is
2215 Name_Buffer
(1) := L
;
2216 Name_Buffer
(2) := '_';
2218 Loop_Block_Count
:= Loop_Block_Count
+ 1;
2219 Add_Nat_To_Name_Buffer
(Loop_Block_Count
);
2221 end Set_Loop_Block_Name
;
2227 procedure Then_Scan
is
2231 while Token
= Tok_Then
loop
2232 Error_Msg_SC
("redundant THEN");
2236 if Token
= Tok_And
or else Token
= Tok_Or
then
2237 Error_Msg_SC
("unexpected logical operator");
2240 if (Prev_Token
= Tok_And
and then Token
= Tok_Then
)
2242 (Prev_Token
= Tok_Or
and then Token
= Tok_Else
)
2247 Discard_Junk_Node
(P_Expression
);
2250 if Token
= Tok_Then
then