| blob | 85a2fde13e23c3d408c39c4ac6364c564bf94a4a |
1 ------------------------------------------------------------------------------
2 -- --
3 -- GNAT COMPILER COMPONENTS --
4 -- --
5 -- P A R --
6 -- --
7 -- B o d y --
8 -- --
9 -- Copyright (C) 1992-2004 Free Software Foundation, Inc. --
10 -- --
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. --
21 -- --
22 -- GNAT was originally developed by the GNAT team at New York University. --
23 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 -- --
25 ------------------------------------------------------------------------------
49 ---------
50 -- Par --
51 ---------
56 -- Count number of units parsed (relevant only in syntax check only mode,
57 -- since in semantics check mode only a single unit is permitted anyway)
60 -- Variable used to save values of config switches while we parse the
61 -- new unit, to be restored on exit for proper recursive behavior.
64 -- Counter used for constructing loop/block names (see the routine
65 -- Par.Ch5.Get_Loop_Block_Name)
67 --------------------
68 -- Error Recovery --
69 --------------------
71 -- When an error is encountered, a call is made to one of the Error_Msg
72 -- routines to record the error. If the syntax scan is not derailed by the
73 -- error (e.g. a complaint that logical operators are inconsistent in an
74 -- EXPRESSION), then control returns from the Error_Msg call, and the
75 -- parse continues unimpeded.
77 -- If on the other hand, the Error_Msg represents a situation from which
78 -- the parser cannot recover locally, the exception Error_Resync is raised
79 -- immediately after the call to Error_Msg. Handlers for Error_Resync
80 -- are located at strategic points to resynchronize the parse. For example,
81 -- when an error occurs in a statement, the handler skips to the next
82 -- semicolon and continues the scan from there.
84 -- Each parsing procedure contains a note with the heading "Error recovery"
85 -- which shows if it can propagate the Error_Resync exception. In order
86 -- not to propagate the exception, a procedure must either contain its own
87 -- handler for this exception, or it must not call any other routines which
88 -- propagate the exception.
90 -- Note: the arrangement of Error_Resync handlers is such that it should
91 -- never be possible to transfer control through a procedure which made
92 -- an entry in the scope stack, invalidating the contents of the stack.
95 -- Exception raised on error that is not handled locally, see above.
98 -- The resynchronization routines in Par.Sync run a risk of getting
99 -- stuck in an infinite loop if they do not skip a token, and the caller
100 -- keeps repeating the same resync call. On the other hand, if they skip
101 -- a token unconditionally, some recovery opportunities are missed. The
102 -- variable Last_Resync_Point records the token location previously set
103 -- by a Resync call, and if a subsequent Resync call occurs at the same
104 -- location, then the Resync routine does guarantee to skip a token.
106 --------------------------------------------
107 -- Handling Semicolon Used in Place of IS --
108 --------------------------------------------
110 -- The following global variables are used in handling the error situation
111 -- of using a semicolon in place of IS in a subprogram declaration as in:
113 -- procedure X (Y : Integer);
114 -- Q : Integer;
115 -- begin
116 -- ...
117 -- end;
119 -- The two contexts in which this can appear are at the outer level, and
120 -- within a declarative region. At the outer level, we know something is
121 -- wrong as soon as we see the Q (or begin, if there are no declarations),
122 -- and we can immediately decide that the semicolon should have been IS.
124 -- The situation in a declarative region is more complex. The declaration
125 -- of Q could belong to the outer region, and we do not know that we have
126 -- an error until we hit the begin. It is still not clear at this point
127 -- from a syntactic point of view that something is wrong, because the
128 -- begin could belong to the enclosing subprogram or package. However, we
129 -- can incorporate a bit of semantic knowledge and note that the body of
130 -- X is missing, so we definitely DO have an error. We diagnose this error
131 -- as semicolon in place of IS on the subprogram line.
133 -- There are two styles for this diagnostic. If the begin immediately
134 -- follows the semicolon, then we can place a flag (IS expected) right
135 -- on the semicolon. Otherwise we do not detect the error until we hit
136 -- the begin which refers back to the line with the semicolon.
138 -- To control the process in the second case, the following global
139 -- variables are set to indicate that we have a subprogram declaration
140 -- whose body is required and has not yet been found. The prefix SIS
141 -- stands for "Subprogram IS" handling.
144 -- Set True to indicate that an entry is active (i.e. that a subprogram
145 -- declaration has been encountered, and no body for this subprogram has
146 -- been encountered). The remaining fields are valid only if this is True.
149 -- Subprogram designator
152 -- Source location of FUNCTION/PROCEDURE keyword
155 -- Column number of FUNCTION/PROCEDURE keyword
158 -- Source location of semicolon at end of subprogram declaration
161 -- Pointer to tree node for subprogram declaration
164 -- Used to save message ID of missing semicolon message (which will be
165 -- modified to missing IS if necessary). Set to No_Error_Msg in the
166 -- normal (non-error) case.
168 -- Five things can happen to an active SIS entry
170 -- 1. If a BEGIN is encountered with an SIS entry active, then we have
171 -- exactly the situation in which we know the body of the subprogram is
172 -- missing. After posting an error message, we change the spec to a body,
173 -- rechaining the declarations that intervened between the spec and BEGIN.
175 -- 2. Another subprogram declaration or body is encountered. In this
176 -- case the entry gets overwritten with the information for the new
177 -- subprogram declaration. We don't catch some nested cases this way,
178 -- but it doesn't seem worth the effort.
180 -- 3. A nested declarative region (e.g. package declaration or package
181 -- body) is encountered. The SIS active indication is reset at the start
182 -- of such a nested region. Again, like case 2, this causes us to miss
183 -- some nested cases, but it doesn't seen worth the effort to stack and
184 -- unstack the SIS information. Maybe we will reconsider this if we ever
185 -- get a complaint about a missed case :-)
187 -- 4. We encounter a valid pragma INTERFACE or IMPORT that effectively
188 -- supplies the missing body. In this case we reset the entry.
190 -- 5. We encounter the end of the declarative region without encoutering
191 -- a BEGIN first. In this situation we simply reset the entry. We know
192 -- that there is a missing body, but it seems more reasonable to let the
193 -- later semantic checking discover this.
195 ----------------------------------------------------
196 -- Handling of Reserved Words Used as Identifiers --
197 ----------------------------------------------------
199 -- Note: throughout the parser, the terms reserved word and keyword
200 -- are used interchangably to refer to the same set of reserved
201 -- keywords (including until, protected, etc).
203 -- If a reserved word is used in place of an identifier, the parser
204 -- where possible tries to recover gracefully. In particular, if the
205 -- keyword is clearly spelled using identifier casing, e.g. Until in
206 -- a source program using mixed case identifiers and lower case keywords,
207 -- then the keyword is treated as an identifier if it appears in a place
208 -- where an identifier is required.
210 -- The situation is more complex if the keyword is spelled with normal
211 -- keyword casing. In this case, the parser is more reluctant to
212 -- consider it to be intended as an identifier, unless it has some
213 -- further confirmation.
215 -- In the case of an identifier appearing in the identifier list of a
216 -- declaration, the appearence of a comma or colon right after the
217 -- keyword on the same line is taken as confirmation. For an enumeration
218 -- literal, a comma or right paren right after the identifier is also
219 -- treated as adequate confirmation.
221 -- The following type is used in calls to Is_Reserved_Identifier and
222 -- also to P_Defining_Identifier and P_Identifier. The default for all
223 -- these functins is that reserved words in reserved word case are not
224 -- considered to be reserved identifiers. The Id_Check value indicates
225 -- tokens, which if they appear immediately after the identifier, are
226 -- taken as confirming that the use of an identifier was expected
230 -- Default, no special token test
232 C_Comma_Right_Paren,
233 -- Consider as identifier if followed by comma or right paren
235 C_Comma_Colon,
236 -- Consider as identifier if followed by comma or colon
238 C_Do,
239 -- Consider as identifier if followed by DO
241 C_Dot,
242 -- Consider as identifier if followed by period
244 C_Greater_Greater,
245 -- Consider as identifier if followed by >>
247 C_In,
248 -- Consider as identifier if followed by IN
250 C_Is,
251 -- Consider as identifier if followed by IS
253 C_Left_Paren_Semicolon,
254 -- Consider as identifier if followed by left paren or semicolon
256 C_Use,
257 -- Consider as identifier if followed by USE
259 C_Vertical_Bar_Arrow);
260 -- Consider as identifier if followed by | or =>
262 --------------------------------------------
263 -- Handling IS Used in Place of Semicolon --
264 --------------------------------------------
266 -- This is a somewhat trickier situation, and we can't catch it in all
267 -- cases, but we do our best to detect common situations resulting from
268 -- a "cut and paste" operation which forgets to change the IS to semicolon.
269 -- Consider the following example:
271 -- package body X is
272 -- procedure A;
273 -- procedure B is
274 -- procedure C;
275 -- ...
276 -- procedure D is
277 -- begin
278 -- ...
279 -- end;
280 -- begin
281 -- ...
282 -- end;
284 -- The trouble is that the section of text from PROCEDURE B through END;
285 -- consitutes a valid procedure body, and the danger is that we find out
286 -- far too late that something is wrong (indeed most compilers will behave
287 -- uncomfortably on the above example).
289 -- We have two approaches to helping to control this situation. First we
290 -- make every attempt to avoid swallowing the last END; if we can be
291 -- sure that some error will result from doing so. In particular, we won't
292 -- accept the END; unless it is exactly correct (in particular it must not
293 -- have incorrect name tokens), and we won't accept it if it is immediately
294 -- followed by end of file, WITH or SEPARATE (all tokens that unmistakeably
295 -- signal the start of a compilation unit, and which therefore allow us to
296 -- reserve the END; for the outer level.) For more details on this aspect
297 -- of the handling, see package Par.Endh.
299 -- If we can avoid eating up the END; then the result in the absense of
300 -- any additional steps would be to post a missing END referring back to
301 -- the subprogram with the bogus IS. Similarly, if the enclosing package
302 -- has no BEGIN, then the result is a missing BEGIN message, which again
303 -- refers back to the subprogram header.
305 -- Such an error message is not too bad (it's already a big improvement
306 -- over what many parsers do), but it's not ideal, because the declarations
307 -- following the IS have been absorbed into the wrong scope. In the above
308 -- case, this could result for example in a bogus complaint that the body
309 -- of D was missing from the package.
311 -- To catch at least some of these cases, we take the following additional
312 -- steps. First, a subprogram body is marked as having a suspicious IS if
313 -- the declaration line is followed by a line which starts with a symbol
314 -- that can start a declaration in the same column, or to the left of the
315 -- column in which the FUNCTION or PROCEDURE starts (normal style is to
316 -- indent any declarations which really belong a subprogram). If such a
317 -- subprogram encounters a missing BEGIN or missing END, then we decide
318 -- that the IS should have been a semicolon, and the subprogram body node
319 -- is marked (by setting the Bad_Is_Detected flag true. Note that we do
320 -- not do this for library level procedures, only for nested procedures,
321 -- since for library level procedures, we must have a body.
323 -- The processing for a declarative part checks to see if the last
324 -- declaration scanned is marked in this way, and if it is, the tree
325 -- is modified to reflect the IS being interpreted as a semicolon.
327 ---------------------------------------------------
328 -- Parser Type Definitions and Control Variables --
329 ---------------------------------------------------
331 -- The following variable and associated type declaration are used by the
332 -- expression parsing routines to return more detailed information about
333 -- the categorization of a parsed expression.
344 -- The following type is used for calls to P_Subprogram, P_Package, P_Task,
345 -- P_Protected to indicate which of several possibilities is acceptable.
363 Pf_Rec'(F, T, T, T, T, T, F, F);
364 Pf_Decl : constant Pf_Rec :=
367 Pf_Rec'(F, T, T, T, T, F, F, F);
368 Pf_Decl_Pbod : constant Pf_Rec :=
371 Pf_Rec'(F, F, F, T, F, F, F, F);
372 Pf_Spcn : constant Pf_Rec :=
374 -- The above are the only allowed values of Pf_Rec arguments
398 Label_List : Elist_Id;
399 -- List of label nodes for labels appearing in the current compilation.
400 -- Used by Par.Labl to construct the corresponding implicit declarations.
402 -----------------
403 -- Scope Table --
404 -----------------
406 -- The scope table, also referred to as the scope stack, is used to
407 -- record the current scope context. It is organized as a stack, with
408 -- inner nested entries corresponding to higher entries on the stack.
409 -- An entry is made when the parser encounters the opening of a nested
410 -- construct (such as a record, task, package etc.), and then package
411 -- Par.Endh uses this stack to deal with END lines (including properly
412 -- dealing with END nesting errors).
414 type SS_End_Type is
415 -- Type of end entry required for this scope. The last two entries are
416 -- used only in the subprogram body case to mark the case of a suspicious
417 -- IS, or a bad IS (i.e. suspicions confirmed by missing BEGIN or END).
418 -- See separate section on dealing with IS used in place of semicolon.
419 -- Note that for many purposes E_Name, E_Suspicious_Is and E_Bad_Is are
420 -- treated the same (E_Suspicious_Is and E_Bad_Is are simply special cases
421 -- of E_Name). They are placed at the end of the enumeration so that a
422 -- test for >= E_Name catches all three cases efficiently.
424 (E_Dummy, -- dummy entry at outer level
425 E_Case, -- END CASE;
426 E_If, -- END IF;
427 E_Loop, -- END LOOP;
428 E_Record, -- END RECORD;
429 E_Select, -- END SELECT;
430 E_Name, -- END [name];
431 E_Suspicious_Is, -- END [name]; (case of suspicious IS)
432 E_Bad_Is); -- END [name]; (case of bad IS)
434 -- The following describes a single entry in the scope table
436 type Scope_Table_Entry is record
437 Etyp : SS_End_Type;
438 -- Type of end entry, as per above description
440 Lreq : Boolean;
441 -- A flag indicating whether the label, if present, is required to
442 -- appear on the end line. It is referenced only in the case of
443 -- Etyp = E_Name or E_Suspicious_Is where the name may or may not be
444 -- required (yes for labeled block, no in other cases). Note that for
445 -- all cases except begin, the question of whether a label is required
446 -- can be determined from the other fields (for loop, it is required if
447 -- it is present, and for the other constructs it is never required or
448 -- allowed).
450 Ecol : Column_Number;
451 -- Contains the absolute column number (with tabs expanded) of the
452 -- the expected column of the end assuming normal Ada indentation
453 -- usage. If the RM_Column_Check mode is set, this value is used for
454 -- generating error messages about indentation. Otherwise it is used
455 -- only to control heuristic error recovery actions.
457 Labl : Node_Id;
458 -- This field is used only for the LOOP and BEGIN cases, and is the
459 -- Node_Id value of the label name. For all cases except child units,
460 -- this value is an entity whose Chars field contains the name pointer
461 -- that identifies the label uniquely. For the child unit case the Labl
462 -- field references an N_Defining_Program_Unit_Name node for the name.
463 -- For cases other than LOOP or BEGIN, the Label field is set to Error,
464 -- indicating that it is an error to have a label on the end line.
465 -- (this is really a misuse of Error since there is no Error ???)
467 Decl : List_Id;
468 -- Points to the list of declarations (i.e. the declarative part)
469 -- associated with this construct. It is set only in the END [name]
470 -- cases, and is set to No_List for all other cases which do not have a
471 -- declarative unit associated with them. This is used for determining
472 -- the proper location for implicit label declarations.
474 Node : Node_Id;
475 -- Empty except in the case of entries for IF and CASE statements,
476 -- in which case it contains the N_If_Statement or N_Case_Statement
477 -- node. This is used for setting the End_Span field.
479 Sloc : Source_Ptr;
480 -- Source location of the opening token of the construct. This is
481 -- used to refer back to this line in error messages (such as missing
482 -- or incorrect end lines). The Sloc field is not used, and is not set,
483 -- if a label is present (the Labl field provides the text name of the
484 -- label in this case, which is fine for error messages).
486 S_Is : Source_Ptr;
487 -- S_Is is relevant only if Etyp is set to E_Suspicious_Is or
488 -- E_Bad_Is. It records the location of the IS that is considered
489 -- to be suspicious.
491 Junk : Boolean;
492 -- A boolean flag that is set true if the opening entry is the dubious
493 -- result of some prior error, e.g. a record entry where the record
494 -- keyword was missing. It is used to suppress the issuing of a
495 -- corresponding junk complaint about the end line (we do not want
496 -- to complain about a missing end record when there was no record).
497 end record;
499 -- The following declares the scope table itself. The Last field is the
500 -- stack pointer, so that Scope.Table (Scope.Last) is the top entry. The
501 -- oldest entry, at Scope_Stack (0), is a dummy entry with Etyp set to
502 -- E_Dummy, and the other fields undefined. This dummy entry ensures that
503 -- Scope_Stack (Scope_Stack_Ptr).Etyp can always be tested, and that the
504 -- scope stack pointer is always in range.
506 package Scope is new Table.Table (
507 Table_Component_Type => Scope_Table_Entry,
508 Table_Index_Type => Int,
509 Table_Low_Bound => 0,
510 Table_Initial => 50,
511 Table_Increment => 100,
512 Table_Name => "Scope");
514 ---------------------------------
515 -- Parsing Routines by Chapter --
516 ---------------------------------
518 -- Uncommented declarations in this section simply parse the construct
519 -- corresponding to their name, and return an ID value for the Node or
520 -- List that is created.
522 -------------
523 -- Par.Ch2 --
524 -------------
526 package Ch2 is
527 function P_Pragma return Node_Id;
529 function P_Identifier (C : Id_Check := None) return Node_Id;
530 -- Scans out an identifier. The parameter C determines the treatment
531 -- of reserved identifiers. See declaration of Id_Check for details.
533 function P_Pragmas_Opt return List_Id;
534 -- This function scans for a sequence of pragmas in other than a
535 -- declaration sequence or statement sequence context. All pragmas
536 -- can appear except pragmas Assert and Debug, which are only allowed
537 -- in a declaration or statement sequence context.
539 procedure P_Pragmas_Misplaced;
540 -- Skips misplaced pragmas with a complaint
542 procedure P_Pragmas_Opt (List : List_Id);
543 -- Parses optional pragmas and appends them to the List
544 end Ch2;
546 -------------
547 -- Par.Ch3 --
548 -------------
550 package Ch3 is
551 Missing_Begin_Msg : Error_Msg_Id;
552 -- This variable is set by a call to P_Declarative_Part. Normally it
553 -- is set to No_Error_Msg, indicating that no special processing is
554 -- required by the caller. The special case arises when a statement
555 -- is found in the sequence of declarations. In this case the Id of
556 -- the message issued ("declaration expected") is preserved in this
557 -- variable, then the caller can change it to an appropriate missing
558 -- begin message if indeed the BEGIN is missing.
560 function P_Array_Type_Definition return Node_Id;
561 function P_Basic_Declarative_Items return List_Id;
562 function P_Constraint_Opt return Node_Id;
563 function P_Declarative_Part return List_Id;
564 function P_Discrete_Choice_List return List_Id;
565 function P_Discrete_Range return Node_Id;
566 function P_Discrete_Subtype_Definition return Node_Id;
567 function P_Known_Discriminant_Part_Opt return List_Id;
568 function P_Signed_Integer_Type_Definition return Node_Id;
569 function P_Range return Node_Id;
570 function P_Range_Or_Subtype_Mark return Node_Id;
571 function P_Range_Constraint return Node_Id;
572 function P_Record_Definition return Node_Id;
573 function P_Subtype_Mark return Node_Id;
574 function P_Subtype_Mark_Resync return Node_Id;
575 function P_Unknown_Discriminant_Part_Opt return Boolean;
577 function P_Access_Definition
578 (Null_Exclusion_Present : Boolean) return Node_Id;
579 -- Ada 0Y (AI-231/AI-254): The caller parses the null-exclusion part
580 -- and indicates if it was present
582 function P_Access_Type_Definition
583 (Header_Already_Parsed : Boolean := False) return Node_Id;
584 -- Ada 0Y (AI-254): The formal is used to indicate if the caller has
585 -- parsed the null_exclusion part. In this case the caller has also
586 -- removed the ACCESS token
588 procedure P_Component_Items (Decls : List_Id);
589 -- Scan out one or more component items and append them to the
590 -- given list. Only scans out more than one declaration in the
591 -- case where the source has a single declaration with multiple
592 -- defining identifiers.
594 function P_Defining_Identifier (C : Id_Check := None) return Node_Id;
595 -- Scan out a defining identifier. The parameter C controls the
596 -- treatment of errors in case a reserved word is scanned. See the
597 -- declaration of this type for details.
599 function P_Null_Exclusion return Boolean;
600 -- Ada 0Y (AI-231): Parse the null-excluding part. True indicates
601 -- that the null-excluding part was present.
603 function P_Subtype_Indication
604 (Not_Null_Present : Boolean := False) return Node_Id;
605 -- Ada 0Y (AI-231): The flag Not_Null_Present indicates that the
606 -- null-excluding part has been scanned out and it was present.
608 function Init_Expr_Opt (P : Boolean := False) return Node_Id;
609 -- If an initialization expression is present (:= expression), then
610 -- it is scanned out and returned, otherwise Empty is returned if no
611 -- initialization expression is present. This procedure also handles
612 -- certain common error cases cleanly. The parameter P indicates if
613 -- a right paren can follow the expression (default = no right paren
614 -- allowed).
616 procedure Skip_Declaration (S : List_Id);
617 -- Used when scanning statements to skip past a mispaced declaration
618 -- The declaration is scanned out and appended to the given list.
619 -- Token is known to be a declaration token (in Token_Class_Declk)
620 -- on entry, so there definition is a declaration to be scanned.
622 function P_Subtype_Indication
623 (Subtype_Mark : Node_Id;
624 Not_Null_Present : Boolean := False) return Node_Id;
625 -- This version of P_Subtype_Indication is called when the caller has
626 -- already scanned out the subtype mark which is passed as a parameter.
627 -- Ada 0Y (AI-231): The flag Not_Null_Present indicates that the
628 -- null-excluding part has been scanned out and it was present.
630 function P_Subtype_Mark_Attribute (Type_Node : Node_Id) return Node_Id;
631 -- Parse a subtype mark attribute. The caller has already parsed the
632 -- subtype mark, which is passed in as the argument, and has checked
633 -- that the current token is apostrophe.
634 end Ch3;
636 -------------
637 -- Par.Ch4 --
638 -------------
640 package Ch4 is
641 function P_Aggregate return Node_Id;
642 function P_Expression return Node_Id;
643 function P_Expression_No_Right_Paren return Node_Id;
644 function P_Expression_Or_Range_Attribute return Node_Id;
645 function P_Function_Name return Node_Id;
646 function P_Name return Node_Id;
647 function P_Qualified_Simple_Name return Node_Id;
648 function P_Qualified_Simple_Name_Resync return Node_Id;
649 function P_Simple_Expression return Node_Id;
650 function P_Simple_Expression_Or_Range_Attribute return Node_Id;
652 function P_Qualified_Expression
653 (Subtype_Mark : Node_Id)
654 return Node_Id;
655 -- This routine scans out a qualified expression when the caller has
656 -- already scanned out the name and apostrophe of the construct.
657 end Ch4;
659 -------------
660 -- Par.Ch5 --
661 -------------
663 package Ch5 is
664 function P_Statement_Name (Name_Node : Node_Id) return Node_Id;
665 -- Given a node representing a name (which is a call), converts it
666 -- to the syntactically corresponding procedure call statement.
668 function P_Sequence_Of_Statements (SS_Flags : SS_Rec) return List_Id;
669 -- The argument indicates the acceptable termination tokens.
670 -- See body in Par.Ch5 for details of the use of this parameter.
672 procedure Parse_Decls_Begin_End (Parent : Node_Id);
673 -- Parses declarations and handled statement sequence, setting
674 -- fields of Parent node appropriately.
675 end Ch5;
677 -------------
678 -- Par.Ch6 --
679 -------------
681 package Ch6 is
682 function P_Designator return Node_Id;
683 function P_Defining_Program_Unit_Name return Node_Id;
684 function P_Formal_Part return List_Id;
685 function P_Parameter_Profile return List_Id;
686 function P_Return_Statement return Node_Id;
687 function P_Subprogram_Specification return Node_Id;
689 procedure P_Mode (Node : Node_Id);
690 -- Sets In_Present and/or Out_Present flags in Node scanning past
691 -- IN, OUT or IN OUT tokens in the source.
693 function P_Subprogram (Pf_Flags : Pf_Rec) return Node_Id;
694 -- Scans out any construct starting with either of the keywords
695 -- PROCEDURE or FUNCTION. The parameter indicates which possible
696 -- possible kinds of construct (body, spec, instantiation etc.)
697 -- are permissible in the current context.
698 end Ch6;
700 -------------
701 -- Par.Ch7 --
702 -------------
704 package Ch7 is
705 function P_Package (Pf_Flags : Pf_Rec) return Node_Id;
706 -- Scans out any construct starting with the keyword PACKAGE. The
707 -- parameter indicates which possible kinds of construct (body, spec,
708 -- instantiation etc.) are permissible in the current context.
709 end Ch7;
711 -------------
712 -- Par.Ch8 --
713 -------------
715 package Ch8 is
716 function P_Use_Clause return Node_Id;
717 end Ch8;
719 -------------
720 -- Par.Ch9 --
721 -------------
723 package Ch9 is
724 function P_Abort_Statement return Node_Id;
725 function P_Abortable_Part return Node_Id;
726 function P_Accept_Statement return Node_Id;
727 function P_Delay_Statement return Node_Id;
728 function P_Entry_Body return Node_Id;
729 function P_Protected return Node_Id;
730 function P_Requeue_Statement return Node_Id;
731 function P_Select_Statement return Node_Id;
732 function P_Task return Node_Id;
733 function P_Terminate_Alternative return Node_Id;
734 end Ch9;
736 --------------
737 -- Par.Ch10 --
738 --------------
740 package Ch10 is
741 function P_Compilation_Unit return Node_Id;
742 -- Note: this function scans a single compilation unit, and
743 -- checks that an end of file follows this unit, diagnosing
744 -- any unexpected input as an error, and then skipping it, so
745 -- that Token is set to Tok_EOF on return. An exception is in
746 -- syntax-only mode, where multiple compilation units are
747 -- permitted. In this case, P_Compilation_Unit does not check
748 -- for end of file and there may be more compilation units to
749 -- scan. The caller can uniquely detect this situation by the
750 -- fact that Token is not set to Tok_EOF on return.
751 --
752 -- The Ignore parameter is normally set False. It is set True
753 -- in multiple unit per file mode if we are skipping past a unit
754 -- that we are not interested in.
755 end Ch10;
757 --------------
758 -- Par.Ch11 --
759 --------------
761 package Ch11 is
762 function P_Handled_Sequence_Of_Statements return Node_Id;
763 function P_Raise_Statement return Node_Id;
765 function Parse_Exception_Handlers return List_Id;
766 -- Parses the partial construct EXCEPTION followed by a list of
767 -- exception handlers which appears in a number of productions,
768 -- and returns the list of exception handlers.
769 end Ch11;
771 --------------
772 -- Par.Ch12 --
773 --------------
775 package Ch12 is
776 function P_Generic return Node_Id;
777 function P_Generic_Actual_Part_Opt return List_Id;
778 end Ch12;
780 --------------
781 -- Par.Ch13 --
782 --------------
784 package Ch13 is
785 function P_Representation_Clause return Node_Id;
787 function P_Code_Statement (Subtype_Mark : Node_Id) return Node_Id;
788 -- Function to parse a code statement. The caller has scanned out
789 -- the name to be used as the subtype mark (but has not checked that
790 -- it is suitable for use as a subtype mark, i.e. is either an
791 -- identifier or a selected component). The current token is an
792 -- apostrophe and the following token is either a left paren or
793 -- RANGE (the latter being an error to be caught by P_Code_Statement.
794 end Ch13;
796 -- Note: the parsing for annexe J features (i.e. obsolescent features)
797 -- is found in the logical section where these features would be if
798 -- they were not obsolescent. In particular:
800 -- Delta constraint is parsed by P_Delta_Constraint (3.5.9)
801 -- At clause is parsed by P_At_Clause (13.1)
802 -- Mod clause is parsed by P_Mod_Clause (13.5.1)
804 --------------
805 -- Par.Endh --
806 --------------
808 -- Routines for handling end lines, including scope recovery
810 package Endh is
811 function Check_End return Boolean;
812 -- Called when an end sequence is required. In the absence of an error
813 -- situation, Token contains Tok_End on entry, but in a missing end
814 -- case, this may not be the case. Pop_End_Context is used to determine
815 -- the appropriate action to be taken. The returned result is True if
816 -- an End sequence was encountered and False if no End sequence was
817 -- present. This occurs if the END keyword encountered was determined
818 -- to be improper and deleted (i.e. Pop_End_Context set End_Action to
819 -- Skip_And_Reject). Note that the END sequence includes a semicolon,
820 -- except in the case of END RECORD, where a semicolon follows the END
821 -- RECORD, but is not part of the record type definition itself.
823 procedure End_Skip;
824 -- Skip past an end sequence. On entry Token contains Tok_End, and we
825 -- we know that the end sequence is syntactically incorrect, and that
826 -- an appropriate error message has already been posted. The mission
827 -- is simply to position the scan pointer to be the best guess of the
828 -- position after the end sequence. We do not issue any additional
829 -- error messages while carrying this out.
831 procedure End_Statements (Parent : Node_Id := Empty);
832 -- Called when an end is required or expected to terminate a sequence
833 -- of statements. The caller has already made an appropriate entry in
834 -- the Scope.Table to describe the expected form of the end. This can
835 -- only be used in cases where the only appropriate terminator is end.
836 -- If Parent is non-empty, then if a correct END line is encountered,
837 -- the End_Label field of Parent is set appropriately.
838 end Endh;
840 --------------
841 -- Par.Sync --
842 --------------
844 -- These procedures are used to resynchronize after errors. Following an
845 -- error which is not immediately locally recoverable, the exception
846 -- Error_Resync is raised. The handler for Error_Resync typically calls
847 -- one of these recovery procedures to resynchronize the source position
848 -- to a point from which parsing can be restarted.
850 -- Note: these procedures output an information message that tokens are
851 -- being skipped, but this message is output only if the option for
852 -- Multiple_Errors_Per_Line is set in Options.
854 package Sync is
855 procedure Resync_Choice;
856 -- Used if an error occurs scanning a choice. The scan pointer is
857 -- advanced to the next vertical bar, arrow, or semicolon, whichever
858 -- comes first. We also quit if we encounter an end of file.
860 procedure Resync_Expression;
861 -- Used if an error is detected during the parsing of an expression.
862 -- It skips past tokens until either a token which cannot be part of
863 -- an expression is encountered (an expression terminator), or if a
864 -- comma or right parenthesis or vertical bar is encountered at the
865 -- current parenthesis level (a parenthesis level counter is maintained
866 -- to carry out this test).
868 procedure Resync_Past_Semicolon;
869 -- Used if an error occurs while scanning a sequence of declarations.
870 -- The scan pointer is positioned past the next semicolon and the scan
871 -- resumes. The scan is also resumed on encountering a token which
872 -- starts a declaration (but we make sure to skip at least one token
873 -- in this case, to avoid getting stuck in a loop).
875 procedure Resync_To_Semicolon;
876 -- Similar to Resync_Past_Semicolon, except that the scan pointer is
877 -- left pointing to the semicolon rather than past it.
879 procedure Resync_Past_Semicolon_Or_To_Loop_Or_Then;
880 -- Used if an error occurs while scanning a sequence of statements.
881 -- The scan pointer is positioned past the next semicolon, or to the
882 -- next occurrence of either then or loop, and the scan resumes.
884 procedure Resync_To_When;
885 -- Used when an error occurs scanning an entry index specification.
886 -- The scan pointer is positioned to the next WHEN (or to IS or
887 -- semicolon if either of these appear before WHEN, indicating
888 -- another error has occurred).
890 procedure Resync_Semicolon_List;
891 -- Used if an error occurs while scanning a parenthesized list of items
892 -- separated by semicolons. The scan pointer is advanced to the next
893 -- semicolon or right parenthesis at the outer parenthesis level, or
894 -- to the next is or RETURN keyword occurence, whichever comes first.
896 procedure Resync_Cunit;
897 -- Synchronize to next token which could be the start of a compilation
898 -- unit, or to the end of file token.
899 end Sync;
901 --------------
902 -- Par.Tchk --
903 --------------
905 -- Routines to check for expected tokens
907 package Tchk is
909 -- Procedures with names of the form T_xxx, where Tok_xxx is a token
910 -- name, check that the current token matches the required token, and
911 -- if so, scan past it. If not, an error is issued indicating that
912 -- the required token is not present (xxx expected). In most cases, the
913 -- scan pointer is not moved in the not-found case, but there are some
914 -- exceptions to this, see for example T_Id, where the scan pointer is
915 -- moved across a literal appearing where an identifier is expected.
917 procedure T_Abort;
918 procedure T_Arrow;
919 procedure T_At;
920 procedure T_Body;
921 procedure T_Box;
922 procedure T_Colon;
923 procedure T_Colon_Equal;
924 procedure T_Comma;
925 procedure T_Dot_Dot;
926 procedure T_For;
927 procedure T_Greater_Greater;
928 procedure T_Identifier;
929 procedure T_In;
930 procedure T_Is;
931 procedure T_Left_Paren;
932 procedure T_Loop;
933 procedure T_Mod;
934 procedure T_New;
935 procedure T_Of;
936 procedure T_Or;
937 procedure T_Private;
938 procedure T_Range;
939 procedure T_Record;
940 procedure T_Right_Paren;
941 procedure T_Semicolon;
942 procedure T_Then;
943 procedure T_Type;
944 procedure T_Use;
945 procedure T_When;
946 procedure T_With;
948 -- Procedures have names of the form TF_xxx, where Tok_xxx is a token
949 -- name check that the current token matches the required token, and
950 -- if so, scan past it. If not, an error message is issued indicating
951 -- that the required token is not present (xxx expected).
953 -- If the missing token is at the end of the line, then control returns
954 -- immediately after posting the message. If there are remaining tokens
955 -- on the current line, a search is conducted to see if the token
956 -- appears later on the current line, as follows:
958 -- A call to Scan_Save is issued and a forward search for the token
959 -- is carried out. If the token is found on the current line before a
960 -- semicolon, then it is scanned out and the scan continues from that
961 -- point. If not the scan is restored to the point where it was missing.
963 procedure TF_Arrow;
964 procedure TF_Is;
965 procedure TF_Loop;
966 procedure TF_Return;
967 procedure TF_Semicolon;
968 procedure TF_Then;
969 procedure TF_Use;
970 end Tchk;
972 --------------
973 -- Par.Util --
974 --------------
976 package Util is
977 function Bad_Spelling_Of (T : Token_Type) return Boolean;
978 -- This function is called in an error situation. It checks if the
979 -- current token is an identifier whose name is a plausible bad
980 -- spelling of the given keyword token, and if so, issues an error
981 -- message, sets Token from T, and returns True. Otherwise Token is
982 -- unchanged, and False is returned.
984 procedure Check_Bad_Layout;
985 -- Check for bad indentation in RM checking mode. Used for statements
986 -- and declarations. Checks if current token is at start of line and
987 -- is exdented from the current expected end column, and if so an
988 -- error message is generated.
990 procedure Check_Misspelling_Of (T : Token_Type);
991 pragma Inline (Check_Misspelling_Of);
992 -- This is similar to the function above, except that it does not
993 -- return a result. It is typically used in a situation where any
994 -- identifier is an error, and it makes sense to simply convert it
995 -- to the given token if it is a plausible misspelling of it.
997 procedure Check_95_Keyword (Token_95, Next : Token_Type);
998 -- This routine checks if the token after the current one matches the
999 -- Next argument. If so, the scan is backed up to the current token
1000 -- and Token_Type is changed to Token_95 after issuing an appropriate
1001 -- error message ("(Ada 83) keyword xx cannot be used"). If not,
1002 -- the scan is backed up with Token_Type unchanged. This routine
1003 -- is used to deal with an attempt to use a 95 keyword in Ada 83
1004 -- mode. The caller has typically checked that the current token,
1005 -- an identifier, matches one of the 95 keywords.
1007 procedure Check_Simple_Expression (E : Node_Id);
1008 -- Given an expression E, that has just been scanned, so that Expr_Form
1009 -- is still set, outputs an error if E is a non-simple expression. E is
1010 -- not modified by this call.
1012 procedure Check_Simple_Expression_In_Ada_83 (E : Node_Id);
1013 -- Like Check_Simple_Expression, except that the error message is only
1014 -- given when operating in Ada 83 mode, and includes "in Ada 83".
1016 function Check_Subtype_Mark (Mark : Node_Id) return Node_Id;
1017 -- Called to check that a node representing a name (or call) is
1018 -- suitable for a subtype mark, i.e, that it is an identifier or
1019 -- a selected component. If so, or if it is already Error, then
1020 -- it is returned unchanged. Otherwise an error message is issued
1021 -- and Error is returned.
1023 function Comma_Present return Boolean;
1024 -- Used in comma delimited lists to determine if a comma is present, or
1025 -- can reasonably be assumed to have been present (an error message is
1026 -- generated in the latter case). If True is returned, the scan has been
1027 -- positioned past the comma. If False is returned, the scan position
1028 -- is unchanged. Note that all comma-delimited lists are terminated by
1029 -- a right paren, so the only legitimate tokens when Comma_Present is
1030 -- called are right paren and comma. If some other token is found, then
1031 -- Comma_Present has the job of deciding whether it is better to pretend
1032 -- a comma was present, post a message for a missing comma and return
1033 -- True, or return False and let the caller diagnose the missing right
1034 -- parenthesis.
1036 procedure Discard_Junk_Node (N : Node_Id);
1037 procedure Discard_Junk_List (L : List_Id);
1038 pragma Inline (Discard_Junk_Node);
1039 pragma Inline (Discard_Junk_List);
1040 -- These procedures do nothing at all, their effect is simply to discard
1041 -- the argument. A typical use is to skip by some junk that is not
1042 -- expected in the current context.
1044 procedure Ignore (T : Token_Type);
1045 -- If current token matches T, then give an error message and skip
1046 -- past it, otherwise the call has no effect at all. T may be any
1047 -- reserved word token, or comma, left or right paren, or semicolon.
1049 function Is_Reserved_Identifier (C : Id_Check := None) return Boolean;
1050 -- Test if current token is a reserved identifier. This test is based
1051 -- on the token being a keyword and being spelled in typical identifier
1052 -- style (i.e. starting with an upper case letter). The parameter C
1053 -- determines the special treatment if a reserved word is encountered
1054 -- that has the normal casing of a reserved word.
1056 procedure Merge_Identifier (Prev : Node_Id; Nxt : Token_Type);
1057 -- Called when the previous token is an identifier (whose Token_Node
1058 -- value is given by Prev) to check if current token is an identifier
1059 -- that can be merged with the previous one adding an underscore. The
1060 -- merge is only attempted if the following token matches Nxt. If all
1061 -- conditions are met, an error message is issued, and the merge is
1062 -- carried out, modifying the Chars field of Prev.
1064 procedure No_Constraint;
1065 -- Called in a place where no constraint is allowed, but one might
1066 -- appear due to a common error (e.g. after the type mark in a procedure
1067 -- parameter. If a constraint is present, an error message is posted,
1068 -- and the constraint is scanned and discarded.
1070 function No_Right_Paren (Expr : Node_Id) return Node_Id;
1071 -- Function to check for no right paren at end of expression, returns
1072 -- its argument if no right paren, else flags paren and returns Error.
1074 procedure Push_Scope_Stack;
1075 pragma Inline (Push_Scope_Stack);
1076 -- Push a new entry onto the scope stack. Scope.Last (the stack pointer)
1077 -- is incremented. The Junk field is preinitialized to False. The caller
1078 -- is expected to fill in all remaining entries of the new new top stack
1079 -- entry at Scope.Table (Scope.Last).
1081 procedure Pop_Scope_Stack;
1082 -- Pop an entry off the top of the scope stack. Scope_Last (the scope
1083 -- table stack pointer) is decremented by one. It is a fatal error to
1084 -- try to pop off the dummy entry at the bottom of the stack (i.e.
1085 -- Scope.Last must be non-zero at the time of call).
1087 function Separate_Present return Boolean;
1088 -- Determines if the current token is either Tok_Separate, or an
1089 -- identifier that is a possible misspelling of "separate" followed
1090 -- by a semicolon. True is returned if so, otherwise False.
1092 procedure Signal_Bad_Attribute;
1093 -- The current token is an identifier that is supposed to be an
1094 -- attribute identifier but is not. This routine posts appropriate
1095 -- error messages, including a check for a near misspelling.
1097 function Token_Is_At_Start_Of_Line return Boolean;
1098 pragma Inline (Token_Is_At_Start_Of_Line);
1099 -- Determines if the current token is the first token on the line
1101 function Token_Is_At_End_Of_Line return Boolean;
1102 -- Determines if the current token is the last token on the line
1103 end Util;
1105 --------------
1106 -- Par.Prag --
1107 --------------
1109 -- The processing for pragmas is split off from chapter 2
1111 function Prag (Pragma_Node : Node_Id; Semi : Source_Ptr) return Node_Id;
1112 -- This function is passed a tree for a pragma that has been scanned out.
1113 -- The pragma is syntactically well formed according to the general syntax
1114 -- for pragmas and the pragma identifier is for one of the recognized
1115 -- pragmas. It performs specific syntactic checks for specific pragmas.
1116 -- The result is the input node if it is OK, or Error otherwise. The
1117 -- reason that this is separated out is to facilitate the addition
1118 -- of implementation defined pragmas. The second parameter records the
1119 -- location of the semicolon following the pragma (this is needed for
1120 -- correct processing of the List and Page pragmas). The returned value
1121 -- is a copy of Pragma_Node, or Error if an error is found. Note that
1122 -- at the point where Prag is called, the right paren ending the pragma
1123 -- has been scanned out, and except in the case of pragma Style_Checks,
1124 -- so has the following semicolon. For Style_Checks, the caller delays
1125 -- the scanning of the semicolon so that it will be scanned using the
1126 -- settings from the Style_Checks pragma preceding it.
1128 --------------
1129 -- Par.Labl --
1130 --------------
1132 procedure Labl;
1133 -- This procedure creates implicit label declarations for all label that
1134 -- are declared in the current unit. Note that this could conceptually
1135 -- be done at the point where the labels are declared, but it is tricky
1136 -- to do it then, since the tree is not hooked up at the point where the
1137 -- label is declared (e.g. a sequence of statements is not yet attached
1138 -- to its containing scope at the point a label in the sequence is found)
1140 --------------
1141 -- Par.Load --
1142 --------------
1144 procedure Load;
1145 -- This procedure loads all subsidiary units that are required by this
1146 -- unit, including with'ed units, specs for bodies, and parents for child
1147 -- units. It does not load bodies for inlined procedures and generics,
1148 -- since we don't know till semantic analysis is complete what is needed.
1150 -----------
1151 -- Stubs --
1152 -----------
1154 -- The package bodies can see all routines defined in all other subpackages
1156 use Ch2;
1157 use Ch3;
1158 use Ch4;
1159 use Ch5;
1160 use Ch6;
1161 use Ch7;
1162 use Ch8;
1163 use Ch9;
1164 use Ch10;
1165 use Ch11;
1166 use Ch12;
1167 use Ch13;
1169 use Endh;
1170 use Tchk;
1171 use Sync;
1172 use Util;
1174 package body Ch2 is separate;
1175 package body Ch3 is separate;
1176 package body Ch4 is separate;
1177 package body Ch5 is separate;
1178 package body Ch6 is separate;
1179 package body Ch7 is separate;
1180 package body Ch8 is separate;
1181 package body Ch9 is separate;
1182 package body Ch10 is separate;
1183 package body Ch11 is separate;
1184 package body Ch12 is separate;
1185 package body Ch13 is separate;
1187 package body Endh is separate;
1188 package body Tchk is separate;
1189 package body Sync is separate;
1190 package body Util is separate;
1192 function Prag (Pragma_Node : Node_Id; Semi : Source_Ptr) return Node_Id
1193 is separate;
1195 procedure Labl is separate;
1196 procedure Load is separate;
1198 -- Start of processing for Par
1200 begin
1202 -- Deal with configuration pragmas case first
1204 if Configuration_Pragmas then
1205 declare
1206 Ecount : constant Int := Serious_Errors_Detected;
1207 Pragmas : constant List_Id := Empty_List;
1208 P_Node : Node_Id;
1210 begin
1211 loop
1212 if Token = Tok_EOF then
1213 return Pragmas;
1215 elsif Token /= Tok_Pragma then
1216 Error_Msg_SC ("only pragmas allowed in configuration file");
1217 return Error_List;
1219 else
1220 P_Node := P_Pragma;
1222 if Serious_Errors_Detected > Ecount then
1223 return Error_List;
1224 end if;
1226 if Chars (P_Node) > Last_Configuration_Pragma_Name
1227 and then Chars (P_Node) /= Name_Source_Reference
1228 then
1229 Error_Msg_SC
1230 ("only configuration pragmas allowed " &
1231 "in configuration file");
1232 return Error_List;
1233 end if;
1235 Append (P_Node, Pragmas);
1236 end if;
1237 end loop;
1238 end;
1240 -- Normal case of compilation unit
1242 else
1243 Save_Opt_Config_Switches (Save_Config_Switches);
1245 -- The following loop runs more than once in syntax check mode
1246 -- where we allow multiple compilation units in the same file
1247 -- and in Multiple_Unit_Per_file mode where we skip units till
1248 -- we get to the unit we want.
1250 for Ucount in Pos loop
1251 Set_Opt_Config_Switches
1252 (Is_Internal_File_Name (File_Name (Current_Source_File)));
1254 -- Initialize scope table and other parser control variables
1256 Compiler_State := Parsing;
1257 Scope.Init;
1258 Scope.Increment_Last;
1259 Scope.Table (0).Etyp := E_Dummy;
1260 SIS_Entry_Active := False;
1261 Last_Resync_Point := No_Location;
1263 Label_List := New_Elmt_List;
1265 -- If in multiple unit per file mode, skip past ignored unit
1267 if Ucount < Multiple_Unit_Index then
1269 -- We skip in syntax check only mode, since we don't want
1270 -- to do anything more than skip past the unit and ignore it.
1271 -- This causes processing like setting up a unit table entry
1272 -- to be skipped.
1274 declare
1275 Save_Operating_Mode : constant Operating_Mode_Type :=
1276 Operating_Mode;
1278 Save_Style_Check : constant Boolean := Style_Check;
1280 begin
1281 Operating_Mode := Check_Syntax;
1282 Style_Check := False;
1283 Discard_Node (P_Compilation_Unit);
1284 Operating_Mode := Save_Operating_Mode;
1285 Style_Check := Save_Style_Check;
1287 -- If we are at an end of file, and not yet at the right
1288 -- unit, then we have a fatal error. The unit is missing.
1290 if Token = Tok_EOF then
1291 Error_Msg_SC ("file has too few compilation units");
1292 raise Unrecoverable_Error;
1293 end if;
1294 end;
1296 -- Here if we are not skipping a file in multiple unit per file
1297 -- mode. Parse the unit that we are interested in. Note that in
1298 -- check syntax mode we are interested in all units in the file.
1300 else
1301 declare
1302 Comp_Unit_Node : constant Node_Id := P_Compilation_Unit;
1304 begin
1305 -- If parsing was successful and we are not in check syntax
1306 -- mode, check that language defined units are compiled in
1307 -- GNAT mode. For this purpose we do NOT consider renamings
1308 -- in annex J as predefined. That allows users to compile
1309 -- their own versions of these files, and in particular,
1310 -- in the VMS implementation, the DEC versions can be
1311 -- substituted for the standard Ada 95 versions. Another
1312 -- exception is System.RPC and its children. This allows
1313 -- a user to supply their own communication layer.
1315 if Comp_Unit_Node /= Error
1316 and then Operating_Mode = Generate_Code
1317 and then Current_Source_Unit = Main_Unit
1318 and then not GNAT_Mode
1319 then
1320 declare
1321 Uname : constant String :=
1322 Get_Name_String
1323 (Unit_Name (Current_Source_Unit));
1324 Name : String (1 .. Uname'Length - 2);
1326 begin
1327 -- Because Unit_Name includes "%s" or "%b", we need to
1328 -- strip the last two characters to get the real unit
1329 -- name.
1331 Name := Uname (Uname'First .. Uname'Last - 2);
1333 if (Name = "ada" or else
1334 Name = "calendar" or else
1335 Name = "interfaces" or else
1336 Name = "system" or else
1337 Name = "machine_code" or else
1338 Name = "unchecked_conversion" or else
1339 Name = "unchecked_deallocation"
1340 or else (Name'Length > 4
1341 and then
1342 Name (Name'First .. Name'First + 3) =
1343 "ada.")
1344 or else (Name'Length > 11
1345 and then
1346 Name (Name'First .. Name'First + 10) =
1347 "interfaces.")
1348 or else (Name'Length > 7
1349 and then
1350 Name (Name'First .. Name'First + 6) =
1351 "system."))
1352 and then Name /= "system.rpc"
1353 and then
1354 (Name'Length < 11
1355 or else Name (Name'First .. Name'First + 10) /=
1356 "system.rpc.")
1357 then
1358 Error_Msg
1359 ("language defined units may not be recompiled",
1360 Sloc (Unit (Comp_Unit_Node)));
1361 end if;
1362 end;
1363 end if;
1364 end;
1366 -- All done if at end of file
1368 exit when Token = Tok_EOF;
1370 -- If we are not at an end of file, it means we are in syntax
1371 -- check only mode, and we keep the loop going to parse all
1372 -- remaining units in the file.
1374 end if;
1376 Restore_Opt_Config_Switches (Save_Config_Switches);
1377 end loop;
1379 -- Now that we have completely parsed the source file, we can
1380 -- complete the source file table entry.
1382 Complete_Source_File_Entry;
1384 -- An internal error check, the scope stack should now be empty
1386 pragma Assert (Scope.Last = 0);
1388 -- Remaining steps are to create implicit label declarations and to
1389 -- load required subsidiary sources. These steps are required only
1390 -- if we are doing semantic checking.
1392 if Operating_Mode /= Check_Syntax or else Debug_Flag_F then
1393 Par.Labl;
1394 Par.Load;
1395 end if;
1397 -- Restore settings of switches saved on entry
1399 Restore_Opt_Config_Switches (Save_Config_Switches);
1400 Set_Comes_From_Source_Default (False);
1401 return Empty_List;
1402 end if;
1403 end Par;