Examples of com.google.caja.parser.js.Parser

com.google.caja.parser.js.Parser
inal productions Program=> ? Statement=> | Expression=> // Non-terminal productions. Indentation indicates that a nonterminal is // used only by the unindented nonterminal above it. DirectivePrologue=> ? Directive=> ';' TerminatedStatement=> | StatementTerminator=> ';' | BlockStatement=> ? SimpleStatement=> ? InsertedSemicolon=> ε // abort if disallowed in context StatementLabel=> ':' BlockStatementAtom=> | | // Noop is a block statement atom since it's // guaranteed to end with a semicolon. If it were // a simple statement epsilon, then it could be // inserted anywhere that semicolon insertion is // allowed. | | | | | SimpleStatementAtom=> | | // Do-While loops are simple because, unlike other // loops their body isn't last, so they aren't // guaranteed to end with a right-curly or semi. | | | | | | Identifier != | Body=> Block=> '{' * '}' Conditional=> 'if' '(' ')' Else=> 'else' | ε For=> 'for' '(' ';' ? ')' | 'for' '(' 'in' ')' | 'for' '(' 'in' ')' | 'for' '(' ';' ? ')' | 'for' '(' ';' ? ')' Noop=> ';' Switch=> 'switch' '(' ')' '{' '}' Cases=> * ? DefaultAndCases=> Case=> 'case' ':' Default=> 'default' ':' Try=> 'try' TryClauses=> ? | Catch=> 'catch' '(' ')' Finally=> 'finally' While=> 'while' '(' ')' With=> 'with' '(' ')' Do=> 'do' 'while' '(' ')' Break=> 'break' [no LineTerminator] ? Continue=> 'continue' [no LineTerminator] ? Debugger=> 'debugger' Return=> 'return' [no LineTerminator] ? Throw=> 'throw' [no LineTerminator] ExprStatement=> ExpressionOrNoop=> ? DeclarationStart=> Declaration=> DeclarationKeyword=> 'var' | 'const' DeclarationBodyList=> DeclarationBodyTail=> ',' | ε DeclarationBody=> ? InitialValue=> '=' FunctionDeclaration=> FunctionConstructor=> | AnonymousFunction=> 'function' NamedFunction=> 'function' FunctionBody=> '{' '}' Formals=> '(' ? ')' IdentifierList=> IdentifierListTail=> ',' // All of the operators have an associated precedence defined in the Operator // enum. The p variable on the right of the productions is the precedence // of the most recently consumed operator. CommaOperator=> | ',' Operator(prec) => OperatorHead(prec) => | OperatorTail(prec) => [no LineTerminator] | | // below only match if p < prec | '[' ']' | '(' ? ')' | '?' ':' | // ActualList uses Operator(MAX) to prevent parsing actuals from being // treated as operands to the comma operator. Since the parentheses // recurse to Expression under ExpressionAtom, the result of a comma // operator can be passed to a function by nesting in parens. ActualList=> ? ActualListTail=> ',' | ε ExpressionAtom=> | | | 'null' | 'true' | 'false' | 'this' | | // error and treat as identifier | | '(' ')' | | | ε // in error-tolerant mode ArrayConstructor=> '[' ? ']' ArrayElements=> * | ε ArrayElementsHead=> ? ',' ObjectConstructor=> '{' '}' ObjPropertyList=> * ? ObjProperties=> ',' ObjProperty=> | | ValueProperty=> ':' GetterProperty=> 'get' SetterProperty=> 'set' ObjPropertyKey=> | | | // set allowed interpreter dependent TrailingComma=> ',' // warn See also {@link Keyword} for definitions of keywords, {@link Operator} foroperator precedences and associativity, and {@link JsTokenType} fordefinitions of Word, NumberLiteral, and StringLiteral.
Questions as to whether a semicolon should be inserted can only be answered at the lexical level. A lexer can emit a comment-like-token where semicolons can be inserted though this is not the approach taken in this implementation.
@author mikesamuel@gmail.com

    ParseTreeNode input;
    if (ContentType.JS == type) {
      JsLexer lexer = new JsLexer(cp);
      JsTokenQueue tq = new JsTokenQueue(lexer, is);
      if (tq.isEmpty()) { return null; }
      Parser p = new Parser(tq, mq);
      input = p.parse();
      tq.expectEmpty();
    } else if (ContentType.HTML == type) {
      DomParser p = new DomParser(new HtmlLexer(cp), false, is, mq);
      //if (p.getTokenQueue().isEmpty()) { return null; }
      input = Dom.transplant(p.parseDocument());
      p.getTokenQueue().expectEmpty();
    } else {
      throw new SomethingWidgyHappenedError("Can't classify input " + is);
    }
    return input;

View Full Code Here

    return jsParser(cp, mq).parse();
  }


  private static Expression jsExpr(CharProducer cp, MessageQueue mq)
      throws ParseException {
    Parser p = jsParser(cp, mq);
    Expression e = p.parseExpression(true);
    p.getTokenQueue().expectEmpty();
    return e;
  }

View Full Code Here


  private static Parser jsParser(CharProducer cp, MessageQueue mq) {
    JsLexer lexer = new JsLexer(cp, false);
    JsTokenQueue tq = new JsTokenQueue(lexer, cp.getCurrentPosition().source());
    tq.setInputRange(cp.filePositionForOffsets(cp.getOffset(), cp.getLimit()));
    return new Parser(tq, mq);
  }

View Full Code Here

  }


  private static ParseTreeNode parse(
      InputSource inputSource,
      String sourceText) throws ParseException {
    Parser parser = new Parser(
        new JsTokenQueue(
            new JsLexer(
                CharProducer.Factory.fromString(sourceText, inputSource),
                true),
            inputSource),
        DevNullMessageQueue.singleton(),
        true);


    Statement topLevelStatement = parser.parse();
    parser.getTokenQueue().expectEmpty();
    return topLevelStatement;
  }

View Full Code Here

      new PrintWriter(System.err), new MessageContext(), true);
  static String normJs(String js, MessageQueue mq) throws ParseException {
    JsLexer lexer = new JsLexer(
        CharProducer.Factory.fromString(js, FilePosition.UNKNOWN));
    JsTokenQueue tq = new JsTokenQueue(lexer, InputSource.UNKNOWN);
    Expression e = new Parser(tq, mq).parseExpression(true);
    tq.expectEmpty();
    StringBuilder sb = new StringBuilder(js.length() + 16);
    RenderContext rc = new RenderContext(new JsMinimalPrinter(sb));
    e.render(rc);
    rc.getOut().noMoreTokens();

View Full Code Here

    ParseTreeNode ptn;
    if (mime.contains("javascript")) {
      JsLexer lexer = new JsLexer(cp);
      JsTokenQueue tq = new JsTokenQueue(lexer, is);
      if (tq.isEmpty()) { return null; }
      Parser p = new Parser(tq, mq);
      ptn = p.parse();
      tq.expectEmpty();
    } else {
      DomParser p = new DomParser(new HtmlLexer(cp), false, is, mq);
      ptn = new Dom(p.parseFragment());
      p.getTokenQueue().expectEmpty();
    }
    return ptn;
  }

View Full Code Here

    ParseTreeNode ptn;
    if (mime.contains("javascript")) {
      JsLexer lexer = new JsLexer(cp);
      JsTokenQueue tq = new JsTokenQueue(lexer, is);
      if (tq.isEmpty()) { return null; }
      Parser p = new Parser(tq, mq);
      ptn = p.parse();
      tq.expectEmpty();
    } else {
      DomParser p = new DomParser(new HtmlLexer(cp), false, is, mq);
      ptn = new Dom(p.parseFragment());
      p.getTokenQueue().expectEmpty();
    }
    return ptn;
  }

View Full Code Here

    ParseTreeNode ptn;
    if (mime.contains("javascript")) {
      JsLexer lexer = new JsLexer(cp);
      JsTokenQueue tq = new JsTokenQueue(lexer, is);
      if (tq.isEmpty()) { return null; }
      Parser p = new Parser(tq, mq);
      ptn = p.parse();
      tq.expectEmpty();
    } else {
      DomParser p = new DomParser(new HtmlLexer(cp), false, is, mq);
      ptn = new Dom(p.parseFragment());
      p.getTokenQueue().expectEmpty();
    }
    return ptn;
  }

View Full Code Here

    // Parse the javascript
    try {
      StringReader strReader = new StringReader(resp.getContent());
      CharProducer cp = CharProducer.Factory.create(strReader, is);
      JsTokenQueue tq = new JsTokenQueue(new JsLexer(cp), is);
      ParseTreeNode input = new Parser(tq, mq).parse();
      tq.expectEmpty();


      compiler.addInput(AncestorChain.instance(input).node, contextUri.toJavaUri());
    } catch (ParseException e) {
      // Don't bother continuing.

View Full Code Here

    // Parse the javascript
    try {
      StringReader strReader = new StringReader(resp.getContent());
      CharProducer cp = CharProducer.Factory.create(strReader, is);
      JsTokenQueue tq = new JsTokenQueue(new JsLexer(cp), is);
      ParseTreeNode input = new Parser(tq, mq).parse();
      tq.expectEmpty();


      compiler.addInput(AncestorChain.instance(input).node, contextUri.toJavaUri());
    } catch (ParseException e) {
      // Don't bother continuing.

View Full Code Here

0 1 2 3 4

TOP

Related Classes of com.google.caja.parser.js.Parser

com.google.caja.ancillary.linter.Linter

com.google.caja.ancillary.opt.EnvironmentData

com.google.caja.ancillary.opt.JsOptimizer

com.google.caja.lexer.FilePosition

com.google.caja.lexer.Keyword

com.google.caja.lexer.TokenQueue.Mark

com.google.caja.parser.ParserContext

com.google.caja.parser.quasiliteral.MatchExperiments

com.google.caja.parser.quasiliteral.QuasiBuilder

com.google.caja.plugin.BuildServiceImplementation

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.