@@ -4050,13 +4050,13 @@ module ts {
4050
4050
4051
4051
/// Classifier
4052
4052
export function createClassifier ( host : Logger ) : Classifier {
4053
- var scanner : Scanner ;
4054
- var noRegexTable : boolean [ ] ;
4053
+ var scanner = createScanner ( ScriptTarget . ES5 , /*skipTrivia*/ false ) ;
4055
4054
4056
4055
/// We do not have a full parser support to know when we should parse a regex or not
4057
4056
/// If we consider every slash token to be a regex, we could be missing cases like "1/2/3", where
4058
4057
/// we have a series of divide operator. this list allows us to be more accurate by ruling out
4059
4058
/// locations where a regexp cannot exist.
4059
+ var noRegexTable : boolean [ ] ;
4060
4060
if ( ! noRegexTable ) {
4061
4061
noRegexTable = [ ] ;
4062
4062
noRegexTable [ SyntaxKind . Identifier ] = true ;
@@ -4077,7 +4077,7 @@ module ts {
4077
4077
var offset = 0 ;
4078
4078
var lastTokenOrCommentEnd = 0 ;
4079
4079
var lastNonTriviaToken = SyntaxKind . Unknown ;
4080
-
4080
+
4081
4081
// If we're in a string literal, then prepend: "\
4082
4082
// (and a newline). That way when we lex we'll think we're still in a string literal.
4083
4083
//
@@ -4098,13 +4098,14 @@ module ts {
4098
4098
break ;
4099
4099
}
4100
4100
4101
+ scanner . setText ( text ) ;
4102
+
4101
4103
var result : ClassificationResult = {
4102
4104
finalLexState : EndOfLineState . Start ,
4103
4105
entries : [ ]
4104
4106
} ;
4105
4107
4106
- scanner = createScanner ( ScriptTarget . ES5 , /*skipTrivia*/ false , text , /*onError*/ undefined , /*onComment*/ undefined ) ;
4107
-
4108
+
4108
4109
var token = SyntaxKind . Unknown ;
4109
4110
do {
4110
4111
token = scanner . scan ( ) ;
0 commit comments