1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2005 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 2, 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 COPYING. If not, write --
19 -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
20 -- MA 02111-1307, USA. --
22 -- GNAT was originally developed by the GNAT team at New York University. --
23 -- Extensive contributions were provided by Ada Core Technologies Inc. --
25 ------------------------------------------------------------------------------
27 pragma Style_Checks (All_Checks);
28 -- Turn off subprogram body ordering check. Subprograms are in order
29 -- by RM section rather than alphabetical
34 -- Local subprograms, used only in this chapter
36 function P_Accept_Alternative return Node_Id;
37 function P_Delay_Alternative return Node_Id;
38 function P_Delay_Relative_Statement return Node_Id;
39 function P_Delay_Until_Statement return Node_Id;
40 function P_Entry_Barrier return Node_Id;
41 function P_Entry_Body_Formal_Part return Node_Id;
42 function P_Entry_Declaration return Node_Id;
43 function P_Entry_Index_Specification return Node_Id;
44 function P_Protected_Definition return Node_Id;
45 function P_Protected_Operation_Declaration_Opt return Node_Id;
46 function P_Protected_Operation_Items return List_Id;
47 function P_Task_Definition return Node_Id;
48 function P_Task_Items return List_Id;
50 -----------------------------
51 -- 9.1 Task (also 10.1.3) --
52 -----------------------------
54 -- TASK_TYPE_DECLARATION ::=
55 -- task type DEFINING_IDENTIFIER [KNOWN_DISCRIMINANT_PART]
56 -- [is [new INTERFACE_LIST with] TASK_DEFINITION];
58 -- SINGLE_TASK_DECLARATION ::=
59 -- task DEFINING_IDENTIFIER [is TASK_DEFINITION];
62 -- task body DEFINING_IDENTIFIER is
65 -- HANDLED_SEQUENCE_OF_STATEMENTS
66 -- end [task_IDENTIFIER]
69 -- task body DEFINING_IDENTIFIER is separate;
71 -- This routine scans out a task declaration, task body, or task stub
73 -- The caller has checked that the initial token is TASK and scanned
74 -- past it, so that Token is set to the token after TASK
76 -- Error recovery: cannot raise Error_Resync
78 function P_Task return Node_Id is
81 Task_Sloc : Source_Ptr;
85 Scope.Table (Scope.Last).Etyp := E_Name;
86 Scope.Table (Scope.Last).Ecol := Start_Column;
87 Scope.Table (Scope.Last).Sloc := Token_Ptr;
88 Scope.Table (Scope.Last).Lreq := False;
89 Task_Sloc := Prev_Token_Ptr;
91 if Token = Tok_Body then
93 Name_Node := P_Defining_Identifier (C_Is);
94 Scope.Table (Scope.Last).Labl := Name_Node;
96 if Token = Tok_Left_Paren then
97 Error_Msg_SC ("discriminant part not allowed in task body");
98 Discard_Junk_List (P_Known_Discriminant_Part_Opt);
105 if Token = Tok_Separate then
106 Scan; -- past SEPARATE
107 Task_Node := New_Node (N_Task_Body_Stub, Task_Sloc);
108 Set_Defining_Identifier (Task_Node, Name_Node);
110 Pop_Scope_Stack; -- remove unused entry
115 Task_Node := New_Node (N_Task_Body, Task_Sloc);
116 Set_Defining_Identifier (Task_Node, Name_Node);
117 Parse_Decls_Begin_End (Task_Node);
122 -- Otherwise we must have a task declaration
125 if Token = Tok_Type then
127 Task_Node := New_Node (N_Task_Type_Declaration, Task_Sloc);
128 Name_Node := P_Defining_Identifier;
129 Set_Defining_Identifier (Task_Node, Name_Node);
130 Scope.Table (Scope.Last).Labl := Name_Node;
131 Set_Discriminant_Specifications
132 (Task_Node, P_Known_Discriminant_Part_Opt);
135 Task_Node := New_Node (N_Single_Task_Declaration, Task_Sloc);
136 Name_Node := P_Defining_Identifier (C_Is);
137 Set_Defining_Identifier (Task_Node, Name_Node);
138 Scope.Table (Scope.Last).Labl := Name_Node;
140 if Token = Tok_Left_Paren then
141 Error_Msg_SC ("discriminant part not allowed for single task");
142 Discard_Junk_List (P_Known_Discriminant_Part_Opt);
146 -- Parse optional task definition. Note that P_Task_Definition scans
147 -- out the semicolon as well as the task definition itself.
149 if Token = Tok_Semicolon then
151 -- A little check, if the next token after semicolon is
152 -- Entry, then surely the semicolon should really be IS
154 Scan; -- past semicolon
156 if Token = Tok_Entry then
157 Error_Msg_SP (""";"" should be IS");
158 Set_Task_Definition (Task_Node, P_Task_Definition);
160 Pop_Scope_Stack; -- Remove unused entry
163 TF_Is; -- must have IS if no semicolon
167 if Token = Tok_New then
170 if Ada_Version < Ada_05 then
171 Error_Msg_SP ("task interface is an Ada 2005 extension");
172 Error_Msg_SP ("\unit must be compiled with -gnat05 switch");
175 Set_Interface_List (Task_Node, New_List);
178 Append (P_Qualified_Simple_Name, Interface_List (Task_Node));
179 exit when Token /= Tok_And;
183 if Token /= Tok_With then
184 Error_Msg_SC ("WITH expected");
189 if Token = Tok_Private then
191 ("PRIVATE not allowed in task type declaration");
195 Set_Task_Definition (Task_Node, P_Task_Definition);
202 --------------------------------
203 -- 9.1 Task Type Declaration --
204 --------------------------------
206 -- Parsed by P_Task (9.1)
208 ----------------------------------
209 -- 9.1 Single Task Declaration --
210 ----------------------------------
212 -- Parsed by P_Task (9.1)
214 --------------------------
215 -- 9.1 Task Definition --
216 --------------------------
218 -- TASK_DEFINITION ::=
222 -- end [task_IDENTIFIER];
224 -- The caller has already made the scope stack entry
226 -- Note: there is a small deviation from official syntax here in that we
227 -- regard the semicolon after end as part of the Task_Definition, and in
228 -- the official syntax, it's part of the enclosing declaration. The reason
229 -- for this deviation is that otherwise the end processing would have to
230 -- be special cased, which would be a nuisance!
232 -- Error recovery: cannot raise Error_Resync
234 function P_Task_Definition return Node_Id is
238 Def_Node := New_Node (N_Task_Definition, Token_Ptr);
239 Set_Visible_Declarations (Def_Node, P_Task_Items);
241 if Token = Tok_Private then
242 Scan; -- past PRIVATE
243 Set_Private_Declarations (Def_Node, P_Task_Items);
245 -- Deal gracefully with multiple PRIVATE parts
247 while Token = Tok_Private loop
248 Error_Msg_SC ("only one private part allowed per task");
249 Scan; -- past PRIVATE
250 Append_List (P_Task_Items, Private_Declarations (Def_Node));
254 End_Statements (Def_Node);
256 end P_Task_Definition;
262 -- TASK_ITEM ::= ENTRY_DECLARATION | REPRESENTATION_CLAUSE
264 -- This subprogram scans a (possibly empty) list of task items and pragmas
266 -- Error recovery: cannot raise Error_Resync
268 -- Note: a pragma can also be returned in this position
270 function P_Task_Items return List_Id is
273 Decl_Sloc : Source_Ptr;
276 -- Get rid of active SIS entry from outer scope. This means we will
277 -- miss some nested cases, but it doesn't seem worth the effort. See
278 -- discussion in Par for further details
280 SIS_Entry_Active := False;
282 -- Loop to scan out task items
287 Decl_Sloc := Token_Ptr;
289 if Token = Tok_Pragma then
290 Append (P_Pragma, Items);
292 -- Ada 2005 (AI-397): Reserved words NOT and OVERRIDING
293 -- may begin an entry declaration.
295 elsif Token = Tok_Entry
296 or else Token = Tok_Not
297 or else Token = Tok_Overriding
299 Append (P_Entry_Declaration, Items);
301 elsif Token = Tok_For then
302 -- Representation clause in task declaration. The only rep
303 -- clause which is legal in a protected is an address clause,
304 -- so that is what we try to scan out.
306 Item_Node := P_Representation_Clause;
308 if Nkind (Item_Node) = N_At_Clause then
309 Append (Item_Node, Items);
311 elsif Nkind (Item_Node) = N_Attribute_Definition_Clause
312 and then Chars (Item_Node) = Name_Address
314 Append (Item_Node, Items);
318 ("the only representation clause " &
319 "allowed here is an address clause!", Decl_Sloc);
322 elsif Token = Tok_Identifier
323 or else Token in Token_Class_Declk
325 Error_Msg_SC ("illegal declaration in task definition");
326 Resync_Past_Semicolon;
340 -- Parsed by P_Task (9.1)
342 ----------------------------------
343 -- 9.4 Protected (also 10.1.3) --
344 ----------------------------------
346 -- PROTECTED_TYPE_DECLARATION ::=
347 -- protected type DEFINING_IDENTIFIER [KNOWN_DISCRIMINANT_PART]
348 -- is [new INTERFACE_LIST with] PROTECTED_DEFINITION;
350 -- SINGLE_PROTECTED_DECLARATION ::=
351 -- protected DEFINING_IDENTIFIER is PROTECTED_DEFINITION;
353 -- PROTECTED_BODY ::=
354 -- protected body DEFINING_IDENTIFIER is
355 -- {PROTECTED_OPERATION_ITEM}
356 -- end [protected_IDENTIFIER];
358 -- PROTECTED_BODY_STUB ::=
359 -- protected body DEFINING_IDENTIFIER is separate;
361 -- This routine scans out a protected declaration, protected body
362 -- or a protected stub.
364 -- The caller has checked that the initial token is PROTECTED and
365 -- scanned past it, so Token is set to the following token.
367 -- Error recovery: cannot raise Error_Resync
369 function P_Protected return Node_Id is
371 Protected_Node : Node_Id;
372 Protected_Sloc : Source_Ptr;
376 Scope.Table (Scope.Last).Etyp := E_Name;
377 Scope.Table (Scope.Last).Ecol := Start_Column;
378 Scope.Table (Scope.Last).Lreq := False;
379 Protected_Sloc := Prev_Token_Ptr;
381 if Token = Tok_Body then
383 Name_Node := P_Defining_Identifier (C_Is);
384 Scope.Table (Scope.Last).Labl := Name_Node;
386 if Token = Tok_Left_Paren then
387 Error_Msg_SC ("discriminant part not allowed in protected body");
388 Discard_Junk_List (P_Known_Discriminant_Part_Opt);
395 if Token = Tok_Separate then
396 Scan; -- past SEPARATE
397 Protected_Node := New_Node (N_Protected_Body_Stub, Protected_Sloc);
398 Set_Defining_Identifier (Protected_Node, Name_Node);
400 Pop_Scope_Stack; -- remove unused entry
405 Protected_Node := New_Node (N_Protected_Body, Protected_Sloc);
406 Set_Defining_Identifier (Protected_Node, Name_Node);
407 Set_Declarations (Protected_Node, P_Protected_Operation_Items);
408 End_Statements (Protected_Node);
411 return Protected_Node;
413 -- Otherwise we must have a protected declaration
416 if Token = Tok_Type then
419 New_Node (N_Protected_Type_Declaration, Protected_Sloc);
420 Name_Node := P_Defining_Identifier (C_Is);
421 Set_Defining_Identifier (Protected_Node, Name_Node);
422 Scope.Table (Scope.Last).Labl := Name_Node;
423 Set_Discriminant_Specifications
424 (Protected_Node, P_Known_Discriminant_Part_Opt);
428 New_Node (N_Single_Protected_Declaration, Protected_Sloc);
429 Name_Node := P_Defining_Identifier (C_Is);
430 Set_Defining_Identifier (Protected_Node, Name_Node);
432 if Token = Tok_Left_Paren then
434 ("discriminant part not allowed for single protected");
435 Discard_Junk_List (P_Known_Discriminant_Part_Opt);
438 Scope.Table (Scope.Last).Labl := Name_Node;
445 if Token = Tok_New then
448 if Ada_Version < Ada_05 then
449 Error_Msg_SP ("task interface is an Ada 2005 extension");
450 Error_Msg_SP ("\unit must be compiled with -gnat05 switch");
453 Set_Interface_List (Protected_Node, New_List);
456 Append (P_Qualified_Simple_Name,
457 Interface_List (Protected_Node));
459 exit when Token /= Tok_And;
463 if Token /= Tok_With then
464 Error_Msg_SC ("WITH expected");
469 if Token = Tok_Private then
471 ("PRIVATE not allowed in protected type declaration");
475 Set_Protected_Definition (Protected_Node, P_Protected_Definition);
476 return Protected_Node;
480 -------------------------------------
481 -- 9.4 Protected Type Declaration --
482 -------------------------------------
484 -- Parsed by P_Protected (9.4)
486 ---------------------------------------
487 -- 9.4 Single Protected Declaration --
488 ---------------------------------------
490 -- Parsed by P_Protected (9.4)
492 -------------------------------
493 -- 9.4 Protected Definition --
494 -------------------------------
496 -- PROTECTED_DEFINITION ::=
497 -- {PROTECTED_OPERATION_DECLARATION}
499 -- {PROTECTED_ELEMENT_DECLARATION}]
500 -- end [protected_IDENTIFIER]
502 -- PROTECTED_ELEMENT_DECLARATION ::=
503 -- PROTECTED_OPERATION_DECLARATION
504 -- | COMPONENT_DECLARATION
506 -- The caller has already established the scope stack entry
508 -- Error recovery: cannot raise Error_Resync
510 function P_Protected_Definition return Node_Id is
515 Def_Node := New_Node (N_Protected_Definition, Token_Ptr);
517 -- Get rid of active SIS entry from outer scope. This means we will
518 -- miss some nested cases, but it doesn't seem worth the effort. See
519 -- discussion in Par for further details
521 SIS_Entry_Active := False;
523 -- Loop to scan visible declarations (protected operation declarations)
525 Set_Visible_Declarations (Def_Node, New_List);
528 Item_Node := P_Protected_Operation_Declaration_Opt;
529 exit when No (Item_Node);
530 Append (Item_Node, Visible_Declarations (Def_Node));
533 -- Deal with PRIVATE part (including graceful handling
534 -- of multiple PRIVATE parts).
536 Private_Loop : while Token = Tok_Private loop
537 if No (Private_Declarations (Def_Node)) then
538 Set_Private_Declarations (Def_Node, New_List);
540 Error_Msg_SC ("duplicate private part");
543 Scan; -- past PRIVATE
545 Declaration_Loop : loop
546 if Token = Tok_Identifier then
547 P_Component_Items (Private_Declarations (Def_Node));
549 Item_Node := P_Protected_Operation_Declaration_Opt;
550 exit Declaration_Loop when No (Item_Node);
551 Append (Item_Node, Private_Declarations (Def_Node));
553 end loop Declaration_Loop;
554 end loop Private_Loop;
556 End_Statements (Def_Node);
558 end P_Protected_Definition;
560 ------------------------------------------
561 -- 9.4 Protected Operation Declaration --
562 ------------------------------------------
564 -- PROTECTED_OPERATION_DECLARATION ::=
565 -- SUBPROGRAM_DECLARATION
566 -- | ENTRY_DECLARATION
567 -- | REPRESENTATION_CLAUSE
569 -- Error recovery: cannot raise Error_Resync
571 -- Note: a pragma can also be returned in this position
573 -- We are not currently permitting representation clauses to appear as
574 -- protected operation declarations, do we have to rethink this???
576 function P_Protected_Operation_Declaration_Opt return Node_Id is
580 function P_Entry_Or_Subprogram_With_Indicator return Node_Id;
581 -- Ada 2005 (AI-397): Parse an entry or a subprogram with an overriding
582 -- indicator. The caller has checked that the initial token is NOT or
585 ------------------------------------------
586 -- P_Entry_Or_Subprogram_With_Indicator --
587 ------------------------------------------
589 function P_Entry_Or_Subprogram_With_Indicator return Node_Id is
590 Decl : Node_Id := Error;
591 Is_Overriding : Boolean := False;
592 Not_Overriding : Boolean := False;
595 if Token = Tok_Not then
598 if Token = Tok_Overriding then
599 Scan; -- past OVERRIDING
600 Not_Overriding := True;
602 Error_Msg_SC ("OVERRIDING expected!");
606 Scan; -- past OVERRIDING
607 Is_Overriding := True;
610 if (Is_Overriding or else Not_Overriding) then
611 if Ada_Version < Ada_05 then
612 Error_Msg_SP (" overriding indicator is an Ada 2005 extension");
613 Error_Msg_SP ("\unit must be compiled with -gnat05 switch");
615 elsif Token = Tok_Entry then
616 Decl := P_Entry_Declaration;
618 Set_Must_Override (Decl, Is_Overriding);
619 Set_Must_Not_Override (Decl, Not_Overriding);
621 elsif Token = Tok_Function or else Token = Tok_Procedure then
622 Decl := P_Subprogram (Pf_Decl);
624 Set_Must_Override (Specification (Decl), Is_Overriding);
625 Set_Must_Not_Override (Specification (Decl), Not_Overriding);
628 Error_Msg_SC ("ENTRY, FUNCTION or PROCEDURE expected!");
633 end P_Entry_Or_Subprogram_With_Indicator;
635 -- Start of processing for P_Protected_Operation_Declaration_Opt
638 -- This loop runs more than once only when a junk declaration
642 if Token = Tok_Pragma then
645 elsif Token = Tok_Not or else Token = Tok_Overriding then
646 return P_Entry_Or_Subprogram_With_Indicator;
648 elsif Token = Tok_Entry then
649 return P_Entry_Declaration;
651 elsif Token = Tok_Function or else Token = Tok_Procedure then
652 return P_Subprogram (Pf_Decl);
654 elsif Token = Tok_Identifier then
657 Skip_Declaration (L);
659 if Nkind (First (L)) = N_Object_Declaration then
661 ("component must be declared in private part of " &
662 "protected type", P);
665 ("illegal declaration in protected definition", P);
668 elsif Token in Token_Class_Declk then
669 Error_Msg_SC ("illegal declaration in protected definition");
670 Resync_Past_Semicolon;
672 -- Return now to avoid cascaded messages if next declaration
673 -- is a valid component declaration.
677 elsif Token = Tok_For then
679 ("representation clause not allowed in protected definition");
680 Resync_Past_Semicolon;
686 end P_Protected_Operation_Declaration_Opt;
688 -----------------------------------
689 -- 9.4 Protected Operation Item --
690 -----------------------------------
692 -- PROTECTED_OPERATION_ITEM ::=
693 -- SUBPROGRAM_DECLARATION
696 -- | REPRESENTATION_CLAUSE
698 -- This procedure parses and returns a list of protected operation items
700 -- We are not currently permitting representation clauses to appear
701 -- as protected operation items, do we have to rethink this???
703 function P_Protected_Operation_Items return List_Id is
707 Item_List := New_List;
710 if Token = Tok_Entry or else Bad_Spelling_Of (Tok_Entry) then
711 Append (P_Entry_Body, Item_List);
713 elsif Token = Tok_Function or else Bad_Spelling_Of (Tok_Function)
715 Token = Tok_Procedure or else Bad_Spelling_Of (Tok_Procedure)
717 Append (P_Subprogram (Pf_Decl_Pbod), Item_List);
719 elsif Token = Tok_Pragma or else Bad_Spelling_Of (Tok_Pragma) then
720 P_Pragmas_Opt (Item_List);
722 elsif Token = Tok_Private or else Bad_Spelling_Of (Tok_Private) then
723 Error_Msg_SC ("PRIVATE not allowed in protected body");
724 Scan; -- past PRIVATE
726 elsif Token = Tok_Identifier then
728 ("all components must be declared in spec!");
729 Resync_Past_Semicolon;
731 elsif Token in Token_Class_Declk then
732 Error_Msg_SC ("this declaration not allowed in protected body");
733 Resync_Past_Semicolon;
741 end P_Protected_Operation_Items;
743 ------------------------------
744 -- 9.5.2 Entry Declaration --
745 ------------------------------
747 -- ENTRY_DECLARATION ::=
748 -- [OVERRIDING_INDICATOR]
749 -- entry DEFINING_IDENTIFIER [(DISCRETE_SUBTYPE_DEFINITION)]
750 -- PARAMETER_PROFILE;
752 -- The caller has checked that the initial token is ENTRY, NOT or
755 -- Error recovery: cannot raise Error_Resync
757 function P_Entry_Declaration return Node_Id is
759 Scan_State : Saved_Scan_State;
761 -- Flags for optional overriding indication. Two flags are needed,
762 -- to distinguish positive and negative overriding indicators from
763 -- the absence of any indicator.
765 Is_Overriding : Boolean := False;
766 Not_Overriding : Boolean := False;
769 -- Ada 2005 (AI-397): Scan leading overriding indicator.
771 if Token = Tok_Not then
774 if Token = Tok_Overriding then
775 Scan; -- part OVERRIDING
776 Not_Overriding := True;
778 Error_Msg_SC ("OVERRIDING expected!");
781 elsif Token = Tok_Overriding then
782 Scan; -- part OVERRIDING
783 Is_Overriding := True;
786 if (Is_Overriding or else Not_Overriding) then
787 if Ada_Version < Ada_05 then
788 Error_Msg_SP (" overriding indicator is an Ada 2005 extension");
789 Error_Msg_SP ("\unit must be compiled with -gnat05 switch");
791 elsif Token /= Tok_Entry then
792 Error_Msg_SC ("ENTRY expected!");
796 Decl_Node := New_Node (N_Entry_Declaration, Token_Ptr);
799 Set_Defining_Identifier
800 (Decl_Node, P_Defining_Identifier (C_Left_Paren_Semicolon));
802 -- If left paren, could be (Discrete_Subtype_Definition) or Formal_Part
804 if Token = Tok_Left_Paren then
807 -- If identifier after left paren, could still be either
809 if Token = Tok_Identifier then
810 Save_Scan_State (Scan_State); -- at Id
813 -- If comma or colon after Id, must be Formal_Part
815 if Token = Tok_Comma or else Token = Tok_Colon then
816 Restore_Scan_State (Scan_State); -- to Id
817 Set_Parameter_Specifications (Decl_Node, P_Formal_Part);
819 -- Else if Id wi no comma or colon, must be discrete subtype defn
822 Restore_Scan_State (Scan_State); -- to Id
823 Set_Discrete_Subtype_Definition
824 (Decl_Node, P_Discrete_Subtype_Definition);
826 Set_Parameter_Specifications (Decl_Node, P_Parameter_Profile);
829 -- If no Id, must be discrete subtype definition
832 Set_Discrete_Subtype_Definition
833 (Decl_Node, P_Discrete_Subtype_Definition);
835 Set_Parameter_Specifications (Decl_Node, P_Parameter_Profile);
839 if Is_Overriding then
840 Set_Must_Override (Decl_Node);
841 elsif Not_Overriding then
842 Set_Must_Not_Override (Decl_Node);
845 -- Error recovery check for illegal return
847 if Token = Tok_Return then
848 Error_Msg_SC ("entry cannot have return value!");
850 Discard_Junk_Node (P_Subtype_Indication);
853 -- Error recovery check for improper use of entry barrier in spec
855 if Token = Tok_When then
856 Error_Msg_SC ("barrier not allowed here (belongs in body)");
858 Discard_Junk_Node (P_Expression_No_Right_Paren);
863 end P_Entry_Declaration;
865 -----------------------------
866 -- 9.5.2 Accept Statement --
867 -----------------------------
869 -- ACCEPT_STATEMENT ::=
870 -- accept entry_DIRECT_NAME
871 -- [(ENTRY_INDEX)] PARAMETER_PROFILE [do
872 -- HANDLED_SEQUENCE_OF_STATEMENTS
873 -- end [entry_IDENTIFIER]];
875 -- The caller has checked that the initial token is ACCEPT
877 -- Error recovery: cannot raise Error_Resync. If an error occurs, the
878 -- scan is resynchronized past the next semicolon and control returns.
880 function P_Accept_Statement return Node_Id is
881 Scan_State : Saved_Scan_State;
882 Accept_Node : Node_Id;
887 Scope.Table (Scope.Last).Sloc := Token_Ptr;
888 Scope.Table (Scope.Last).Ecol := Start_Column;
890 Accept_Node := New_Node (N_Accept_Statement, Token_Ptr);
892 Scope.Table (Scope.Last).Labl := Token_Node;
894 Set_Entry_Direct_Name (Accept_Node, P_Identifier (C_Do));
896 -- Left paren could be (Entry_Index) or Formal_Part, determine which
898 if Token = Tok_Left_Paren then
899 Save_Scan_State (Scan_State); -- at left paren
900 Scan; -- past left paren
902 -- If first token after left paren not identifier, then Entry_Index
904 if Token /= Tok_Identifier then
905 Set_Entry_Index (Accept_Node, P_Expression);
907 Set_Parameter_Specifications (Accept_Node, P_Parameter_Profile);
909 -- First token after left paren is identifier, could be either case
911 else -- Token = Tok_Identifier
912 Scan; -- past identifier
914 -- If identifier followed by comma or colon, must be Formal_Part
916 if Token = Tok_Comma or else Token = Tok_Colon then
917 Restore_Scan_State (Scan_State); -- to left paren
918 Set_Parameter_Specifications (Accept_Node, P_Parameter_Profile);
920 -- If identifier not followed by comma/colon, must be entry index
923 Restore_Scan_State (Scan_State); -- to left paren
924 Scan; -- past left paren (again!)
925 Set_Entry_Index (Accept_Node, P_Expression);
927 Set_Parameter_Specifications (Accept_Node, P_Parameter_Profile);
932 -- Scan out DO if present
934 if Token = Tok_Do then
935 Scope.Table (Scope.Last).Etyp := E_Name;
936 Scope.Table (Scope.Last).Lreq := False;
938 Hand_Seq := P_Handled_Sequence_Of_Statements;
939 Set_Handled_Statement_Sequence (Accept_Node, Hand_Seq);
940 End_Statements (Handled_Statement_Sequence (Accept_Node));
942 -- Exception handlers not allowed in Ada 95 node
944 if Present (Exception_Handlers (Hand_Seq)) then
945 if Ada_Version = Ada_83 then
947 ("(Ada 83) exception handlers in accept not allowed",
948 First_Non_Pragma (Exception_Handlers (Hand_Seq)));
953 Pop_Scope_Stack; -- discard unused entry
959 -- If error, resynchronize past semicolon
963 Resync_Past_Semicolon;
964 Pop_Scope_Stack; -- discard unused entry
967 end P_Accept_Statement;
969 ------------------------
970 -- 9.5.2 Entry Index --
971 ------------------------
973 -- Parsed by P_Expression (4.4)
975 -----------------------
976 -- 9.5.2 Entry Body --
977 -----------------------
980 -- entry DEFINING_IDENTIFIER ENTRY_BODY_FORMAL_PART ENTRY_BARRIER is
983 -- HANDLED_SEQUENCE_OF_STATEMENTS
984 -- end [entry_IDENTIFIER];
986 -- The caller has checked that the initial token is ENTRY
988 -- Error_Recovery: cannot raise Error_Resync
990 function P_Entry_Body return Node_Id is
991 Entry_Node : Node_Id;
992 Formal_Part_Node : Node_Id;
997 Entry_Node := New_Node (N_Entry_Body, Token_Ptr);
1000 Scope.Table (Scope.Last).Ecol := Start_Column;
1001 Scope.Table (Scope.Last).Lreq := False;
1002 Scope.Table (Scope.Last).Etyp := E_Name;
1004 Name_Node := P_Defining_Identifier;
1005 Set_Defining_Identifier (Entry_Node, Name_Node);
1006 Scope.Table (Scope.Last).Labl := Name_Node;
1008 Formal_Part_Node := P_Entry_Body_Formal_Part;
1009 Set_Entry_Body_Formal_Part (Entry_Node, Formal_Part_Node);
1011 Set_Condition (Formal_Part_Node, P_Entry_Barrier);
1012 Parse_Decls_Begin_End (Entry_Node);
1016 -----------------------------------
1017 -- 9.5.2 Entry Body Formal Part --
1018 -----------------------------------
1020 -- ENTRY_BODY_FORMAL_PART ::=
1021 -- [(ENTRY_INDEX_SPECIFICATION)] [PARAMETER_PART]
1023 -- Error_Recovery: cannot raise Error_Resync
1025 function P_Entry_Body_Formal_Part return Node_Id is
1026 Fpart_Node : Node_Id;
1027 Scan_State : Saved_Scan_State;
1030 Fpart_Node := New_Node (N_Entry_Body_Formal_Part, Token_Ptr);
1032 -- See if entry index specification present, and if so parse it
1034 if Token = Tok_Left_Paren then
1035 Save_Scan_State (Scan_State); -- at left paren
1036 Scan; -- past left paren
1038 if Token = Tok_For then
1039 Set_Entry_Index_Specification
1040 (Fpart_Node, P_Entry_Index_Specification);
1043 Restore_Scan_State (Scan_State); -- to left paren
1046 -- Check for (common?) case of left paren omitted before FOR. This
1047 -- is a tricky case, because the corresponding missing left paren
1048 -- can cause real havoc if a formal part is present which gets
1049 -- treated as part of the discrete subtype definition of the
1050 -- entry index specification, so just give error and resynchronize
1052 elsif Token = Tok_For then
1053 T_Left_Paren; -- to give error message
1057 Set_Parameter_Specifications (Fpart_Node, P_Parameter_Profile);
1059 end P_Entry_Body_Formal_Part;
1061 --------------------------
1062 -- 9.5.2 Entry Barrier --
1063 --------------------------
1065 -- ENTRY_BARRIER ::= when CONDITION
1067 -- Error_Recovery: cannot raise Error_Resync
1069 function P_Entry_Barrier return Node_Id is
1073 if Token = Tok_When then
1075 Bnode := P_Expression_No_Right_Paren;
1077 if Token = Tok_Colon_Equal then
1078 Error_Msg_SC (""":="" should be ""=""");
1080 Bnode := P_Expression_No_Right_Paren;
1084 T_When; -- to give error message
1090 end P_Entry_Barrier;
1092 --------------------------------------
1093 -- 9.5.2 Entry Index Specification --
1094 --------------------------------------
1096 -- ENTRY_INDEX_SPECIFICATION ::=
1097 -- for DEFINING_IDENTIFIER in DISCRETE_SUBTYPE_DEFINITION
1099 -- Error recovery: can raise Error_Resync
1101 function P_Entry_Index_Specification return Node_Id is
1102 Iterator_Node : Node_Id;
1105 Iterator_Node := New_Node (N_Entry_Index_Specification, Token_Ptr);
1107 Set_Defining_Identifier (Iterator_Node, P_Defining_Identifier (C_In));
1109 Set_Discrete_Subtype_Definition
1110 (Iterator_Node, P_Discrete_Subtype_Definition);
1111 return Iterator_Node;
1112 end P_Entry_Index_Specification;
1114 ---------------------------------
1115 -- 9.5.3 Entry Call Statement --
1116 ---------------------------------
1118 -- Parsed by P_Name (4.1). Within a select, an entry call is parsed
1119 -- by P_Select_Statement (9.7)
1121 ------------------------------
1122 -- 9.5.4 Requeue Statement --
1123 ------------------------------
1125 -- REQUEUE_STATEMENT ::= requeue entry_NAME [with abort];
1127 -- The caller has checked that the initial token is requeue
1129 -- Error recovery: can raise Error_Resync
1131 function P_Requeue_Statement return Node_Id is
1132 Requeue_Node : Node_Id;
1135 Requeue_Node := New_Node (N_Requeue_Statement, Token_Ptr);
1136 Scan; -- past REQUEUE
1137 Set_Name (Requeue_Node, P_Name);
1139 if Token = Tok_With then
1142 Set_Abort_Present (Requeue_Node, True);
1146 return Requeue_Node;
1147 end P_Requeue_Statement;
1149 --------------------------
1150 -- 9.6 Delay Statement --
1151 --------------------------
1153 -- DELAY_STATEMENT ::=
1154 -- DELAY_UNTIL_STATEMENT
1155 -- | DELAY_RELATIVE_STATEMENT
1157 -- The caller has checked that the initial token is DELAY
1159 -- Error recovery: cannot raise Error_Resync
1161 function P_Delay_Statement return Node_Id is
1165 -- The following check for delay until misused in Ada 83 doesn't catch
1166 -- all cases, but it's good enough to catch most of them!
1168 if Token_Name = Name_Until then
1169 Check_95_Keyword (Tok_Until, Tok_Left_Paren);
1170 Check_95_Keyword (Tok_Until, Tok_Identifier);
1173 if Token = Tok_Until then
1174 return P_Delay_Until_Statement;
1176 return P_Delay_Relative_Statement;
1178 end P_Delay_Statement;
1180 --------------------------------
1181 -- 9.6 Delay Until Statement --
1182 --------------------------------
1184 -- DELAY_UNTIL_STATEMENT ::= delay until delay_EXPRESSION;
1186 -- The caller has checked that the initial token is DELAY, scanned it
1187 -- out and checked that the current token is UNTIL
1189 -- Error recovery: cannot raise Error_Resync
1191 function P_Delay_Until_Statement return Node_Id is
1192 Delay_Node : Node_Id;
1195 Delay_Node := New_Node (N_Delay_Until_Statement, Prev_Token_Ptr);
1197 Set_Expression (Delay_Node, P_Expression_No_Right_Paren);
1200 end P_Delay_Until_Statement;
1202 -----------------------------------
1203 -- 9.6 Delay Relative Statement --
1204 -----------------------------------
1206 -- DELAY_RELATIVE_STATEMENT ::= delay delay_EXPRESSION;
1208 -- The caller has checked that the initial token is DELAY, scanned it
1209 -- out and determined that the current token is not UNTIL
1211 -- Error recovery: cannot raise Error_Resync
1213 function P_Delay_Relative_Statement return Node_Id is
1214 Delay_Node : Node_Id;
1217 Delay_Node := New_Node (N_Delay_Relative_Statement, Prev_Token_Ptr);
1218 Set_Expression (Delay_Node, P_Expression_No_Right_Paren);
1219 Check_Simple_Expression_In_Ada_83 (Expression (Delay_Node));
1222 end P_Delay_Relative_Statement;
1224 ---------------------------
1225 -- 9.7 Select Statement --
1226 ---------------------------
1228 -- SELECT_STATEMENT ::=
1230 -- | TIMED_ENTRY_CALL
1231 -- | CONDITIONAL_ENTRY_CALL
1232 -- | ASYNCHRONOUS_SELECT
1234 -- SELECTIVE_ACCEPT ::=
1237 -- SELECT_ALTERNATIVE
1240 -- SELECT_ALTERNATIVE
1242 -- SEQUENCE_OF_STATEMENTS]
1245 -- GUARD ::= when CONDITION =>
1247 -- Note: the guard preceding a select alternative is included as part
1248 -- of the node generated for a selective accept alternative.
1250 -- SELECT_ALTERNATIVE ::=
1251 -- ACCEPT_ALTERNATIVE
1252 -- | DELAY_ALTERNATIVE
1253 -- | TERMINATE_ALTERNATIVE
1255 -- TIMED_ENTRY_CALL ::=
1257 -- ENTRY_CALL_ALTERNATIVE
1259 -- DELAY_ALTERNATIVE
1262 -- CONDITIONAL_ENTRY_CALL ::=
1264 -- ENTRY_CALL_ALTERNATIVE
1266 -- SEQUENCE_OF_STATEMENTS
1269 -- ENTRY_CALL_ALTERNATIVE ::=
1270 -- ENTRY_CALL_STATEMENT [SEQUENCE_OF_STATEMENTS]
1272 -- ASYNCHRONOUS_SELECT ::=
1274 -- TRIGGERING_ALTERNATIVE
1279 -- TRIGGERING_ALTERNATIVE ::=
1280 -- TRIGGERING_STATEMENT [SEQUENCE_OF_STATEMENTS]
1282 -- TRIGGERING_STATEMENT ::= ENTRY_CALL_STATEMENT | DELAY_STATEMENT
1284 -- The caller has checked that the initial token is SELECT
1286 -- Error recovery: can raise Error_Resync
1288 function P_Select_Statement return Node_Id is
1289 Select_Node : Node_Id;
1290 Select_Sloc : Source_Ptr;
1291 Stmnt_Sloc : Source_Ptr;
1292 Ecall_Node : Node_Id;
1293 Alternative : Node_Id;
1294 Select_Pragmas : List_Id;
1295 Alt_Pragmas : List_Id;
1296 Statement_List : List_Id;
1298 Cond_Expr : Node_Id;
1299 Delay_Stmnt : Node_Id;
1303 Scope.Table (Scope.Last).Etyp := E_Select;
1304 Scope.Table (Scope.Last).Ecol := Start_Column;
1305 Scope.Table (Scope.Last).Sloc := Token_Ptr;
1306 Scope.Table (Scope.Last).Labl := Error;
1308 Select_Sloc := Token_Ptr;
1309 Scan; -- past SELECT
1310 Stmnt_Sloc := Token_Ptr;
1311 Select_Pragmas := P_Pragmas_Opt;
1313 -- If first token after select is designator, then we have an entry
1314 -- call, which must be the start of a conditional entry call, timed
1315 -- entry call or asynchronous select
1317 if Token in Token_Class_Desig then
1319 -- Scan entry call statement
1322 Ecall_Node := P_Name;
1324 -- ?? The following two clauses exactly parallel code in ch5
1325 -- and should be commoned sometime
1327 if Nkind (Ecall_Node) = N_Indexed_Component then
1329 Prefix_Node : constant Node_Id := Prefix (Ecall_Node);
1330 Exprs_Node : constant List_Id := Expressions (Ecall_Node);
1333 Change_Node (Ecall_Node, N_Procedure_Call_Statement);
1334 Set_Name (Ecall_Node, Prefix_Node);
1335 Set_Parameter_Associations (Ecall_Node, Exprs_Node);
1338 elsif Nkind (Ecall_Node) = N_Function_Call then
1340 Fname_Node : constant Node_Id := Name (Ecall_Node);
1341 Params_List : constant List_Id :=
1342 Parameter_Associations (Ecall_Node);
1345 Change_Node (Ecall_Node, N_Procedure_Call_Statement);
1346 Set_Name (Ecall_Node, Fname_Node);
1347 Set_Parameter_Associations (Ecall_Node, Params_List);
1350 elsif Nkind (Ecall_Node) = N_Identifier
1351 or else Nkind (Ecall_Node) = N_Selected_Component
1353 -- Case of a call to a parameterless entry.
1356 C_Node : constant Node_Id :=
1357 New_Node (N_Procedure_Call_Statement, Stmnt_Sloc);
1359 Set_Name (C_Node, Ecall_Node);
1360 Set_Parameter_Associations (C_Node, No_List);
1361 Ecall_Node := C_Node;
1368 when Error_Resync =>
1369 Resync_Past_Semicolon;
1373 Statement_List := P_Sequence_Of_Statements (SS_Eltm_Ortm_Tatm);
1375 -- OR follows, we have a timed entry call
1377 if Token = Tok_Or then
1379 Alt_Pragmas := P_Pragmas_Opt;
1381 Select_Node := New_Node (N_Timed_Entry_Call, Select_Sloc);
1382 Set_Entry_Call_Alternative (Select_Node,
1383 Make_Entry_Call_Alternative (Stmnt_Sloc,
1384 Entry_Call_Statement => Ecall_Node,
1385 Pragmas_Before => Select_Pragmas,
1386 Statements => Statement_List));
1388 -- Only possibility is delay alternative. If we have anything
1389 -- else, give message, and treat as conditional entry call.
1391 if Token /= Tok_Delay then
1393 ("only allowed alternative in timed entry call is delay!");
1394 Discard_Junk_List (P_Sequence_Of_Statements (SS_Sreq));
1395 Set_Delay_Alternative (Select_Node, Error);
1398 Set_Delay_Alternative (Select_Node, P_Delay_Alternative);
1400 (Delay_Alternative (Select_Node), Alt_Pragmas);
1403 -- ELSE follows, we have a conditional entry call
1405 elsif Token = Tok_Else then
1407 Select_Node := New_Node (N_Conditional_Entry_Call, Select_Sloc);
1409 Set_Entry_Call_Alternative (Select_Node,
1410 Make_Entry_Call_Alternative (Stmnt_Sloc,
1411 Entry_Call_Statement => Ecall_Node,
1412 Pragmas_Before => Select_Pragmas,
1413 Statements => Statement_List));
1416 (Select_Node, P_Sequence_Of_Statements (SS_Sreq));
1418 -- Only remaining case is THEN ABORT (asynchronous select)
1420 elsif Token = Tok_Abort then
1422 Make_Asynchronous_Select (Select_Sloc,
1423 Triggering_Alternative =>
1424 Make_Triggering_Alternative (Stmnt_Sloc,
1425 Triggering_Statement => Ecall_Node,
1426 Pragmas_Before => Select_Pragmas,
1427 Statements => Statement_List),
1428 Abortable_Part => P_Abortable_Part);
1433 if Ada_Version = Ada_83 then
1434 Error_Msg_BC ("OR or ELSE expected");
1436 Error_Msg_BC ("OR or ELSE or THEN ABORT expected");
1439 Select_Node := Error;
1444 -- Here we have a selective accept or an an asynchronous select (first
1445 -- token after SELECT is other than a designator token).
1448 -- If we have delay with no guard, could be asynchronous select
1450 if Token = Tok_Delay then
1451 Delay_Stmnt := P_Delay_Statement;
1452 Statement_List := P_Sequence_Of_Statements (SS_Eltm_Ortm_Tatm);
1454 -- Asynchronous select
1456 if Token = Tok_Abort then
1458 Make_Asynchronous_Select (Select_Sloc,
1459 Triggering_Alternative =>
1460 Make_Triggering_Alternative (Stmnt_Sloc,
1461 Triggering_Statement => Delay_Stmnt,
1462 Pragmas_Before => Select_Pragmas,
1463 Statements => Statement_List),
1464 Abortable_Part => P_Abortable_Part);
1469 -- Delay which was not an asynchronous select. Must be a selective
1470 -- accept, and since at least one accept statement is required,
1471 -- we must have at least one OR phrase present.
1474 Alt_List := New_List (
1475 Make_Delay_Alternative (Stmnt_Sloc,
1476 Delay_Statement => Delay_Stmnt,
1477 Pragmas_Before => Select_Pragmas,
1478 Statements => Statement_List));
1480 Alt_Pragmas := P_Pragmas_Opt;
1483 -- If not a delay statement, then must be another possibility for
1484 -- a selective accept alternative, or perhaps a guard is present
1487 Alt_List := New_List;
1488 Alt_Pragmas := Select_Pragmas;
1491 Select_Node := New_Node (N_Selective_Accept, Select_Sloc);
1492 Set_Select_Alternatives (Select_Node, Alt_List);
1494 -- Scan out selective accept alternatives. On entry to this loop,
1495 -- we are just past a SELECT or OR token, and any pragmas that
1496 -- immediately follow the SELECT or OR are in Alt_Pragmas.
1499 if Token = Tok_When then
1501 if Present (Alt_Pragmas) then
1502 Error_Msg_SC ("pragmas may not precede guard");
1506 Cond_Expr := P_Expression_No_Right_Paren;
1508 Alt_Pragmas := P_Pragmas_Opt;
1514 if Token = Tok_Accept then
1515 Alternative := P_Accept_Alternative;
1517 -- Check for junk attempt at asynchronous select using
1518 -- an Accept alternative as the triggering statement
1520 if Token = Tok_Abort
1521 and then Is_Empty_List (Alt_List)
1522 and then No (Cond_Expr)
1525 ("triggering statement must be entry call or delay",
1526 Sloc (Alternative));
1527 Scan; -- past junk ABORT
1528 Discard_Junk_List (P_Sequence_Of_Statements (SS_Sreq));
1533 elsif Token = Tok_Delay then
1534 Alternative := P_Delay_Alternative;
1536 elsif Token = Tok_Terminate then
1537 Alternative := P_Terminate_Alternative;
1541 ("Select alternative (ACCEPT, ABORT, DELAY) expected");
1542 Alternative := Error;
1544 if Token = Tok_Semicolon then
1545 Scan; -- past junk semicolon
1549 -- THEN ABORT at this stage is just junk
1551 if Token = Tok_Abort then
1552 Error_Msg_SP ("misplaced `THEN ABORT`");
1553 Scan; -- past junk ABORT
1554 Discard_Junk_List (P_Sequence_Of_Statements (SS_Sreq));
1559 if Alternative /= Error then
1560 Set_Condition (Alternative, Cond_Expr);
1561 Set_Pragmas_Before (Alternative, Alt_Pragmas);
1562 Append (Alternative, Alt_List);
1565 exit when Token /= Tok_Or;
1569 Alt_Pragmas := P_Pragmas_Opt;
1572 if Token = Tok_Else then
1575 (Select_Node, P_Sequence_Of_Statements (SS_Ortm_Sreq));
1577 if Token = Tok_Or then
1578 Error_Msg_SC ("select alternative cannot follow else part!");
1586 end P_Select_Statement;
1588 -----------------------------
1589 -- 9.7.1 Selective Accept --
1590 -----------------------------
1592 -- Parsed by P_Select_Statement (9.7)
1598 -- Parsed by P_Select_Statement (9.7)
1600 -------------------------------
1601 -- 9.7.1 Select Alternative --
1602 -------------------------------
1604 -- SELECT_ALTERNATIVE ::=
1605 -- ACCEPT_ALTERNATIVE
1606 -- | DELAY_ALTERNATIVE
1607 -- | TERMINATE_ALTERNATIVE
1609 -- Note: the guard preceding a select alternative is included as part
1610 -- of the node generated for a selective accept alternative.
1612 -- Error recovery: cannot raise Error_Resync
1614 -------------------------------
1615 -- 9.7.1 Accept Alternative --
1616 -------------------------------
1618 -- ACCEPT_ALTERNATIVE ::=
1619 -- ACCEPT_STATEMENT [SEQUENCE_OF_STATEMENTS]
1621 -- Error_Recovery: Cannot raise Error_Resync
1623 -- Note: the caller is responsible for setting the Pragmas_Before
1624 -- field of the returned N_Terminate_Alternative node.
1626 function P_Accept_Alternative return Node_Id is
1627 Accept_Alt_Node : Node_Id;
1630 Accept_Alt_Node := New_Node (N_Accept_Alternative, Token_Ptr);
1631 Set_Accept_Statement (Accept_Alt_Node, P_Accept_Statement);
1633 -- Note: the reason that we accept THEN ABORT as a terminator for
1634 -- the sequence of statements is for error recovery which allows
1635 -- for misuse of an accept statement as a triggering statememt.
1638 (Accept_Alt_Node, P_Sequence_Of_Statements (SS_Eltm_Ortm_Tatm));
1639 return Accept_Alt_Node;
1640 end P_Accept_Alternative;
1642 ------------------------------
1643 -- 9.7.1 Delay Alternative --
1644 ------------------------------
1646 -- DELAY_ALTERNATIVE ::=
1647 -- DELAY_STATEMENT [SEQUENCE_OF_STATEMENTS]
1649 -- Error_Recovery: Cannot raise Error_Resync
1651 -- Note: the caller is responsible for setting the Pragmas_Before
1652 -- field of the returned N_Terminate_Alternative node.
1654 function P_Delay_Alternative return Node_Id is
1655 Delay_Alt_Node : Node_Id;
1658 Delay_Alt_Node := New_Node (N_Delay_Alternative, Token_Ptr);
1659 Set_Delay_Statement (Delay_Alt_Node, P_Delay_Statement);
1661 -- Note: the reason that we accept THEN ABORT as a terminator for
1662 -- the sequence of statements is for error recovery which allows
1663 -- for misuse of an accept statement as a triggering statememt.
1666 (Delay_Alt_Node, P_Sequence_Of_Statements (SS_Eltm_Ortm_Tatm));
1667 return Delay_Alt_Node;
1668 end P_Delay_Alternative;
1670 ----------------------------------
1671 -- 9.7.1 Terminate Alternative --
1672 ----------------------------------
1674 -- TERMINATE_ALTERNATIVE ::= terminate;
1676 -- Error_Recovery: Cannot raise Error_Resync
1678 -- Note: the caller is responsible for setting the Pragmas_Before
1679 -- field of the returned N_Terminate_Alternative node.
1681 function P_Terminate_Alternative return Node_Id is
1682 Terminate_Alt_Node : Node_Id;
1685 Terminate_Alt_Node := New_Node (N_Terminate_Alternative, Token_Ptr);
1686 Scan; -- past TERMINATE
1689 -- For all other select alternatives, the sequence of statements
1690 -- after the alternative statement will swallow up any pragmas
1691 -- coming in this position. But the terminate alternative has no
1692 -- sequence of statements, so the pragmas here must be treated
1695 Set_Pragmas_After (Terminate_Alt_Node, P_Pragmas_Opt);
1696 return Terminate_Alt_Node;
1697 end P_Terminate_Alternative;
1699 -----------------------------
1700 -- 9.7.2 Timed Entry Call --
1701 -----------------------------
1703 -- Parsed by P_Select_Statement (9.7)
1705 -----------------------------------
1706 -- 9.7.2 Entry Call Alternative --
1707 -----------------------------------
1709 -- Parsed by P_Select_Statement (9.7)
1711 -----------------------------------
1712 -- 9.7.3 Conditional Entry Call --
1713 -----------------------------------
1715 -- Parsed by P_Select_Statement (9.7)
1717 --------------------------------
1718 -- 9.7.4 Asynchronous Select --
1719 --------------------------------
1721 -- Parsed by P_Select_Statement (9.7)
1723 -----------------------------------
1724 -- 9.7.4 Triggering Alternative --
1725 -----------------------------------
1727 -- Parsed by P_Select_Statement (9.7)
1729 ---------------------------------
1730 -- 9.7.4 Triggering Statement --
1731 ---------------------------------
1733 -- Parsed by P_Select_Statement (9.7)
1735 ---------------------------
1736 -- 9.7.4 Abortable Part --
1737 ---------------------------
1739 -- ABORTABLE_PART ::= SEQUENCE_OF_STATEMENTS
1741 -- The caller has verified that THEN ABORT is present, and Token is
1742 -- pointing to the ABORT on entry (or if not, then we have an error)
1744 -- Error recovery: cannot raise Error_Resync
1746 function P_Abortable_Part return Node_Id is
1747 Abortable_Part_Node : Node_Id;
1750 Abortable_Part_Node := New_Node (N_Abortable_Part, Token_Ptr);
1751 T_Abort; -- scan past ABORT
1753 if Ada_Version = Ada_83 then
1754 Error_Msg_SP ("(Ada 83) asynchronous select not allowed!");
1757 Set_Statements (Abortable_Part_Node, P_Sequence_Of_Statements (SS_Sreq));
1758 return Abortable_Part_Node;
1759 end P_Abortable_Part;
1761 --------------------------
1762 -- 9.8 Abort Statement --
1763 --------------------------
1765 -- ABORT_STATEMENT ::= abort task_NAME {, task_NAME};
1767 -- The caller has checked that the initial token is ABORT
1769 -- Error recovery: cannot raise Error_Resync
1771 function P_Abort_Statement return Node_Id is
1772 Abort_Node : Node_Id;
1775 Abort_Node := New_Node (N_Abort_Statement, Token_Ptr);
1777 Set_Names (Abort_Node, New_List);
1780 Append (P_Name, Names (Abort_Node));
1781 exit when Token /= Tok_Comma;
1787 end P_Abort_Statement;