Welcome to the NetCologne GmbH open source mirroring service!

This machine mirrors various open-source projects. 20 Gbit/s uplink.

If there are any issues or you want another project mirrored, please contact mirror-service -=AT=- netcologne DOT de !

include/comma/parser/Parser.h

Go to the documentation of this file.

//===-- parser/Parser.h --------------------------------------- -*- C++ -*-===//
//
// This file is distributed under the MIT license.  See LICENSE.txt for details.
//
// Copyright (C) 2008-2010, Stephen Wilson
//
//===----------------------------------------------------------------------===//

#ifndef COMMA_PARSER_PARSER_HDR_GUARD
#define COMMA_PARSER_PARSER_HDR_GUARD

#include "comma/basic/IdentifierPool.h"
#include "comma/basic/ParameterModes.h"
#include "comma/parser/Lexer.h"
#include "comma/parser/ParseClient.h"
#include "llvm/ADT/SmallVector.h"
#include <iosfwd>
#include <stack>

namespace llvm {

class APInt;

} // end llvm namespace.

namespace comma {

class Parser {

public:
    Parser(TextProvider   &txtProvider,
           IdentifierPool &idPool,
           ParseClient    &client,
           Diagnostic     &diag);

    // Generic pointer to a parse method.
    typedef void (Parser::*parseFn)();

    // Generic pointer to a parse method returning a Node.
    typedef Node (Parser::*parseNodeFn)();

    void parseModel();

    void parseGenericFormalParams();
    void parseGenericFormalDomain();

    void parseSignatureProfile();
    void parseSupersignatureProfile();
    void parseWithComponents();

    bool parseSubroutineParameter();
    void parseSubroutineParameters();

    Node parseFunctionDeclaration(bool parsingSignatureProfile = false);
    Node parseProcedureDeclaration(bool parsingSignatureProfile = false);
    void parseFunctionDeclOrDefinition();
    void parseProcedureDeclOrDefinition();

    void parseSubroutineBody(Node declarationNode);

    bool parseDeclaration();
    bool parseObjectDeclaration();
    bool parseImportDeclaration();

    void parseCarrier();
    void parseAddComponents();

    Node parseStatement();
    Node parseIfStmt();
    Node parseReturnStmt();
    Node parseAssignmentStmt();
    Node parseBlockStmt();
    Node parseWhileStmt();
    Node parseLoopStmt();
    Node parseForStmt();
    Node parsePragmaStmt();
    Node parseProcedureCallStatement();
    Node parseRaiseStmt();

    void parseExceptionStmt(Node context);

    Node parseExpr();
    Node parsePrimaryExpr();
    Node parseParenExpr();
    Node parseOperatorExpr();
    Node parseIntegerLiteral();
    Node parseStringLiteral();
    Node parseQualifiedExpr(Node qualifier);
    Node parseAllocatorExpr();

    enum NameOption {
        No_Option,

        Statement_Name,

        Accept_Range_Attribute,
    };

    Node parseName(NameOption option = No_Option);
    Node parseDirectName(NameOption option);
    Node parseSelectedComponent(Node prefix, NameOption option);
    Node parseApplication(Node prefix);
    Node parseParameterAssociation();
    Node parseAttribute(Node prefix, NameOption option);
    Node parseInj();
    Node parsePrj();

    bool parseType();
    bool parseSubtype();
    void parseEnumerationList();
    bool parseIntegerRange(IdentifierInfo *name, Location loc);

    void parseArrayIndexProfile(NodeVector &indices);
    bool parseArrayTypeDecl(IdentifierInfo *name, Location loc);
    bool parseRecordTypeDecl(IdentifierInfo *name, Location loc);
    bool parseAccessTypeDecl(IdentifierInfo *name, Location loc);

    bool parseTopLevelDeclaration();

    bool parseSuccessful() const { return diagnostic.numErrors() == 0; }

private:
    TextProvider   &txtProvider;
    IdentifierPool &idPool;
    ParseClient    &client;
    Diagnostic     &diagnostic;
    Lexer           lexer;

    Lexer::Token token;

    // The kind of end tag which is expected.  This enumeration will be
    // expanded.
    enum EndTagKind {
        NAMED_TAG               
    };

    // As the parser encounters constructs which must be matched by an end tag
    // an EndTagEntry is pushed onto the EndTagStack.
    struct EndTagEntry {

        EndTagEntry(EndTagKind kind, Location loc, IdentifierInfo *tag = 0)
            : kind(kind), location(loc), tag(tag) { }

        // The kind of end tag expected.
        EndTagKind kind;

        // Location of the construct introducing this scope.  Used for reporting
        // nesting errors or tag missmatches.
        Location location;

        // The expected tag or NULL if no tag is required.
        IdentifierInfo *tag;
    };

    std::stack<EndTagEntry> endTagStack;

    // Generic vector type to accumulate locations.
    typedef llvm::SmallVector<Location, 4> LocationVector;

    // Accumulation of IdentifierInfo nodes.
    typedef llvm::SmallVector<IdentifierInfo*, 4> IdInfoVector;

    unsigned currentLine();
    unsigned currentColumn();
    Location currentLocation();

    IdentifierInfo *getIdentifierInfo(const Lexer::Token &tkn);

    Lexer::Token &nextToken();
    Lexer::Token &currentToken();
    Lexer::Token  peekToken();
    void setCurrentToken(Lexer::Token &tkn);

    // Ignores the current token and returns the location of the token skipped.
    // This method is used to support the idiom of skipping reserved words and
    // saving the location of the construct.
    Location ignoreToken();

    Lexer::Code currentTokenCode();
    Lexer::Code peekTokenCode();

    bool currentTokenIs(Lexer::Code code);
    bool nextTokenIs(Lexer::Code code);
    bool expectToken(Lexer::Code code);
    bool reduceToken(Lexer::Code code);
    bool requireToken(Lexer::Code code);

    // Matches a right paren assuming that the opening paren has already been
    // consumed, keeping track of nested pairs.  Consumes the closing
    // paren. Note that this method does not save the state of the token stream.
    bool seekCloseParen();

    // Assuming an 'if' token has been consumed, moves the token stream past a
    // matching 'end if' sequence (taking into account inner 'if' expressions.
    bool seekEndIf();

    // Moves the token stream past an 'end loop' sequence, taking into account
    // inner loop statmement.
    bool seekEndLoop();

    bool seekToken(Lexer::Code code);
    bool seekAndConsumeToken(Lexer::Code code);

    bool seekTokens(Lexer::Code code0,
                    Lexer::Code code1 = Lexer::UNUSED_ID,
                    Lexer::Code code2 = Lexer::UNUSED_ID,
                    Lexer::Code code3 = Lexer::UNUSED_ID,
                    Lexer::Code code4 = Lexer::UNUSED_ID,
                    Lexer::Code code5 = Lexer::UNUSED_ID);


    bool seekAndConsumeTokens(Lexer::Code code0,
                              Lexer::Code code1 = Lexer::UNUSED_ID,
                              Lexer::Code code2 = Lexer::UNUSED_ID,
                              Lexer::Code code3 = Lexer::UNUSED_ID,
                              Lexer::Code code4 = Lexer::UNUSED_ID);

    // Seeks a terminating semicolon.  This method skips all semicolons which
    // appear nested within braces.  It trys to find a semicolon at the same
    // syntatic level it was envoked at.  Note that this method does not save
    // the state of the token stream.
    bool seekSemi();

    std::string currentTokenString() {
        return currentToken().getString();
    }

    DiagnosticStream &report(Location loc, diag::Kind kind) {
        SourceLocation sloc = txtProvider.getSourceLocation(loc);
        return diagnostic.report(sloc, kind);
    }

    DiagnosticStream &report(SourceLocation sloc, diag::Kind kind) {
        return diagnostic.report(sloc, kind);
    }

    DiagnosticStream &report(diag::Kind kind) {
        SourceLocation sloc = txtProvider.getSourceLocation(currentLocation());
        return diagnostic.report(sloc, kind);
    }

    IdentifierInfo *parseIdentifier();
    IdentifierInfo *parseFunctionIdentifier();
    IdentifierInfo *parseCharacter();
    IdentifierInfo *parseIdentifierOrCharacter();
    IdentifierInfo *parseAnyIdentifier();

    PM::ParameterMode parseParameterMode();

    // Parses the argument list of a subroutine call.  The current token must be
    // a TKN_LPAREN.  If the parsing succeeds, dst is populated with the nodes
    // for each argument and true is returned.  Otherwise, false is returned and
    // the token stream has been adjusted such that the closing paren of the
    // argument list has been consumed.
    bool parseSubroutineArgumentList(NodeVector &dst);

    bool seekEndTag(IdentifierInfo *tag);

    bool seekAndConsumeEndTag(IdentifierInfo *tag);

    // Parses an end tag.  If expectedTag is non-null, parse "end <tag>", otherwise
    // parse "end".  Returns true if tokens were consumed (which can happen when the
    // parse fails due to a missing or unexpected end tag) and false otherwise.
    bool parseEndTag(IdentifierInfo *expectedTag = 0);

    // Seeks to the end of a Comma name.
    void seekNameEnd();

    // If a name follows on the token stream, consume it and return true
    // (without invoking any client callbacks). This method is useful for
    // tentative parsing.  However, it is not full parser.  For example, it
    // skips over mathing pairs of parenthesis.
    bool consumeName();

    // Returns true if a matching pair of parens "()" is next on the stream of
    // tokens.
    bool unitExprFollows();

    // Returns true if an assignment statement is next on the stream of tokens.
    bool assignmentFollows();

    // Returns true if a keyword selection expression follows:  That is, if
    // the token stream admits an IdentifierInfo followed by a '=>' token.
    bool keywordSelectionFollows();

    // Returns true if a selected component (a name followed by a '.') is
    // upcoming on the token stream.
    bool selectedComponentFollows();

    bool aggregateFollows();

    Node parseAggregate();

    bool parseAggregateComponent(bool &seenKeyedComponent);

    bool blockStmtFollows();

    bool qualificationFollows();

    bool attributeFollows();

    Node parseExponentialOperator();
    Node parseMultiplicativeOperator();
    Node parseBinaryAdditiveOperator(Node lhs);
    Node parseAdditiveOperator();
    Node parseRelationalOperator();
    Node parseLogicalOperator(Lexer::Code expectedKind, Node lhs);

    Node parseDSTDefinition(bool acceptDiamond);

    Node parseOthersExpr();

    Node parsePragmaAssert(IdentifierInfo *name, Location loc);

    // Parses a pragma in a declaration context.
    void parseDeclarationPragma();
    void parsePragmaImport(Location pragmaLoc);

    // Convenience function for obtaining null nodes.
    Node getNullNode() { return client.getNullNode(); }

    // Convenience function for obtaining invalid nodes.
    Node getInvalidNode() { return client.getInvalidNode(); }

    // Converts a character array representing a Comma integer literal into an
    // llvm::APInt.  The bit width of the resulting APInt is always set to the
    // minimal number of bits needed to represent the given number.
    void decimalLiteralToAPInt(const char *start, unsigned length,
                               llvm::APInt &value);
};

} // End comma namespace

#endif

---