XCode build fixes for previous C++ patch.
This commit is contained in:
Mike Lischke
parent
c41426c87e
commit
f33fca6789
|
|
@ -534,9 +534,6 @@
|
|||
276E5F411CDB57AA003FF4B4 /* IntStream.h in Headers */ = {isa = PBXBuildFile; fileRef = 276E5CBF1CDB57AA003FF4B4 /* IntStream.h */; };
|
||||
276E5F421CDB57AA003FF4B4 /* IntStream.h in Headers */ = {isa = PBXBuildFile; fileRef = 276E5CBF1CDB57AA003FF4B4 /* IntStream.h */; };
|
||||
276E5F431CDB57AA003FF4B4 /* IntStream.h in Headers */ = {isa = PBXBuildFile; fileRef = 276E5CBF1CDB57AA003FF4B4 /* IntStream.h */; settings = {ATTRIBUTES = (Public, ); }; };
|
||||
276E5F441CDB57AA003FF4B4 /* IRecognizer.h in Headers */ = {isa = PBXBuildFile; fileRef = 276E5CC01CDB57AA003FF4B4 /* IRecognizer.h */; };
|
||||
276E5F451CDB57AA003FF4B4 /* IRecognizer.h in Headers */ = {isa = PBXBuildFile; fileRef = 276E5CC01CDB57AA003FF4B4 /* IRecognizer.h */; };
|
||||
276E5F461CDB57AA003FF4B4 /* IRecognizer.h in Headers */ = {isa = PBXBuildFile; fileRef = 276E5CC01CDB57AA003FF4B4 /* IRecognizer.h */; settings = {ATTRIBUTES = (Public, ); }; };
|
||||
276E5F471CDB57AA003FF4B4 /* Lexer.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 276E5CC11CDB57AA003FF4B4 /* Lexer.cpp */; };
|
||||
276E5F481CDB57AA003FF4B4 /* Lexer.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 276E5CC11CDB57AA003FF4B4 /* Lexer.cpp */; };
|
||||
276E5F491CDB57AA003FF4B4 /* Lexer.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 276E5CC11CDB57AA003FF4B4 /* Lexer.cpp */; };
|
||||
|
|
@ -800,6 +797,45 @@
|
|||
27745F081CE49C000067C6A3 /* RuntimeMetaData.h in Headers */ = {isa = PBXBuildFile; fileRef = 27745EFC1CE49C000067C6A3 /* RuntimeMetaData.h */; };
|
||||
27874F1E1CCB7A0700AF1C53 /* CoreFoundation.framework in Frameworks */ = {isa = PBXBuildFile; fileRef = 27874F1D1CCB7A0700AF1C53 /* CoreFoundation.framework */; };
|
||||
27874F211CCB7B1700AF1C53 /* CoreFoundation.framework in Frameworks */ = {isa = PBXBuildFile; fileRef = 27874F1D1CCB7A0700AF1C53 /* CoreFoundation.framework */; };
|
||||
2793DC851F08083F00A84290 /* TokenSource.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DC841F08083F00A84290 /* TokenSource.cpp */; };
|
||||
2793DC861F08083F00A84290 /* TokenSource.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DC841F08083F00A84290 /* TokenSource.cpp */; };
|
||||
2793DC871F08083F00A84290 /* TokenSource.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DC841F08083F00A84290 /* TokenSource.cpp */; };
|
||||
2793DC891F08087500A84290 /* Chunk.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DC881F08087500A84290 /* Chunk.cpp */; };
|
||||
2793DC8A1F08087500A84290 /* Chunk.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DC881F08087500A84290 /* Chunk.cpp */; };
|
||||
2793DC8B1F08087500A84290 /* Chunk.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DC881F08087500A84290 /* Chunk.cpp */; };
|
||||
2793DC8D1F08088F00A84290 /* ParseTreeListener.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DC8C1F08088F00A84290 /* ParseTreeListener.cpp */; };
|
||||
2793DC8E1F08088F00A84290 /* ParseTreeListener.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DC8C1F08088F00A84290 /* ParseTreeListener.cpp */; };
|
||||
2793DC8F1F08088F00A84290 /* ParseTreeListener.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DC8C1F08088F00A84290 /* ParseTreeListener.cpp */; };
|
||||
2793DC911F0808A200A84290 /* TerminalNode.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DC901F0808A200A84290 /* TerminalNode.cpp */; };
|
||||
2793DC921F0808A200A84290 /* TerminalNode.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DC901F0808A200A84290 /* TerminalNode.cpp */; };
|
||||
2793DC931F0808A200A84290 /* TerminalNode.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DC901F0808A200A84290 /* TerminalNode.cpp */; };
|
||||
2793DC961F0808E100A84290 /* ErrorNode.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DC941F0808E100A84290 /* ErrorNode.cpp */; };
|
||||
2793DC971F0808E100A84290 /* ErrorNode.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DC941F0808E100A84290 /* ErrorNode.cpp */; };
|
||||
2793DC981F0808E100A84290 /* ErrorNode.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DC941F0808E100A84290 /* ErrorNode.cpp */; };
|
||||
2793DC991F0808E100A84290 /* ParseTreeVisitor.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DC951F0808E100A84290 /* ParseTreeVisitor.cpp */; };
|
||||
2793DC9A1F0808E100A84290 /* ParseTreeVisitor.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DC951F0808E100A84290 /* ParseTreeVisitor.cpp */; };
|
||||
2793DC9B1F0808E100A84290 /* ParseTreeVisitor.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DC951F0808E100A84290 /* ParseTreeVisitor.cpp */; };
|
||||
2793DC9D1F08090D00A84290 /* Any.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DC9C1F08090D00A84290 /* Any.cpp */; };
|
||||
2793DC9E1F08090D00A84290 /* Any.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DC9C1F08090D00A84290 /* Any.cpp */; };
|
||||
2793DC9F1F08090D00A84290 /* Any.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DC9C1F08090D00A84290 /* Any.cpp */; };
|
||||
2793DCA41F08095F00A84290 /* ANTLRErrorListener.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DCA01F08095F00A84290 /* ANTLRErrorListener.cpp */; };
|
||||
2793DCA51F08095F00A84290 /* ANTLRErrorListener.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DCA01F08095F00A84290 /* ANTLRErrorListener.cpp */; };
|
||||
2793DCA61F08095F00A84290 /* ANTLRErrorListener.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DCA01F08095F00A84290 /* ANTLRErrorListener.cpp */; };
|
||||
2793DCA71F08095F00A84290 /* ANTLRErrorStrategy.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DCA11F08095F00A84290 /* ANTLRErrorStrategy.cpp */; };
|
||||
2793DCA81F08095F00A84290 /* ANTLRErrorStrategy.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DCA11F08095F00A84290 /* ANTLRErrorStrategy.cpp */; };
|
||||
2793DCA91F08095F00A84290 /* ANTLRErrorStrategy.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DCA11F08095F00A84290 /* ANTLRErrorStrategy.cpp */; };
|
||||
2793DCAA1F08095F00A84290 /* Token.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DCA21F08095F00A84290 /* Token.cpp */; };
|
||||
2793DCAB1F08095F00A84290 /* Token.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DCA21F08095F00A84290 /* Token.cpp */; };
|
||||
2793DCAC1F08095F00A84290 /* Token.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DCA21F08095F00A84290 /* Token.cpp */; };
|
||||
2793DCAD1F08095F00A84290 /* WritableToken.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DCA31F08095F00A84290 /* WritableToken.cpp */; };
|
||||
2793DCAE1F08095F00A84290 /* WritableToken.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DCA31F08095F00A84290 /* WritableToken.cpp */; };
|
||||
2793DCAF1F08095F00A84290 /* WritableToken.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DCA31F08095F00A84290 /* WritableToken.cpp */; };
|
||||
2793DCB31F08099C00A84290 /* BlockStartState.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DCB01F08099C00A84290 /* BlockStartState.cpp */; };
|
||||
2793DCB41F08099C00A84290 /* BlockStartState.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DCB01F08099C00A84290 /* BlockStartState.cpp */; };
|
||||
2793DCB51F08099C00A84290 /* BlockStartState.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DCB01F08099C00A84290 /* BlockStartState.cpp */; };
|
||||
2793DCB61F08099C00A84290 /* LexerAction.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DCB11F08099C00A84290 /* LexerAction.cpp */; };
|
||||
2793DCB71F08099C00A84290 /* LexerAction.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DCB11F08099C00A84290 /* LexerAction.cpp */; };
|
||||
2793DCB81F08099C00A84290 /* LexerAction.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 2793DCB11F08099C00A84290 /* LexerAction.cpp */; };
|
||||
2794D8561CE7821B00FADD0F /* antlr4-common.h in Headers */ = {isa = PBXBuildFile; fileRef = 2794D8551CE7821B00FADD0F /* antlr4-common.h */; };
|
||||
2794D8571CE7821B00FADD0F /* antlr4-common.h in Headers */ = {isa = PBXBuildFile; fileRef = 2794D8551CE7821B00FADD0F /* antlr4-common.h */; };
|
||||
2794D8581CE7821B00FADD0F /* antlr4-common.h in Headers */ = {isa = PBXBuildFile; fileRef = 2794D8551CE7821B00FADD0F /* antlr4-common.h */; };
|
||||
|
|
@ -1061,7 +1097,6 @@
|
|||
276E5CBD1CDB57AA003FF4B4 /* InterpreterRuleContext.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = InterpreterRuleContext.h; sourceTree = "<group>"; wrapsLines = 0; };
|
||||
276E5CBE1CDB57AA003FF4B4 /* IntStream.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = IntStream.cpp; sourceTree = "<group>"; };
|
||||
276E5CBF1CDB57AA003FF4B4 /* IntStream.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = IntStream.h; sourceTree = "<group>"; };
|
||||
276E5CC01CDB57AA003FF4B4 /* IRecognizer.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = IRecognizer.h; sourceTree = "<group>"; };
|
||||
276E5CC11CDB57AA003FF4B4 /* Lexer.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = Lexer.cpp; sourceTree = "<group>"; wrapsLines = 0; };
|
||||
276E5CC21CDB57AA003FF4B4 /* Lexer.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = Lexer.h; sourceTree = "<group>"; };
|
||||
276E5CC31CDB57AA003FF4B4 /* LexerInterpreter.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = LexerInterpreter.cpp; sourceTree = "<group>"; wrapsLines = 0; };
|
||||
|
|
@ -1152,6 +1187,19 @@
|
|||
27874F1D1CCB7A0700AF1C53 /* CoreFoundation.framework */ = {isa = PBXFileReference; lastKnownFileType = wrapper.framework; name = CoreFoundation.framework; path = System/Library/Frameworks/CoreFoundation.framework; sourceTree = SDKROOT; };
|
||||
278E313E1D9D6534001C28F9 /* Tests.m */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.objc; path = Tests.m; sourceTree = "<group>"; };
|
||||
278E31401D9D6534001C28F9 /* Info.plist */ = {isa = PBXFileReference; lastKnownFileType = text.plist.xml; path = Info.plist; sourceTree = "<group>"; };
|
||||
2793DC841F08083F00A84290 /* TokenSource.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = TokenSource.cpp; sourceTree = "<group>"; };
|
||||
2793DC881F08087500A84290 /* Chunk.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = Chunk.cpp; sourceTree = "<group>"; };
|
||||
2793DC8C1F08088F00A84290 /* ParseTreeListener.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = ParseTreeListener.cpp; sourceTree = "<group>"; };
|
||||
2793DC901F0808A200A84290 /* TerminalNode.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = TerminalNode.cpp; sourceTree = "<group>"; };
|
||||
2793DC941F0808E100A84290 /* ErrorNode.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = ErrorNode.cpp; sourceTree = "<group>"; };
|
||||
2793DC951F0808E100A84290 /* ParseTreeVisitor.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = ParseTreeVisitor.cpp; sourceTree = "<group>"; };
|
||||
2793DC9C1F08090D00A84290 /* Any.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = Any.cpp; sourceTree = "<group>"; };
|
||||
2793DCA01F08095F00A84290 /* ANTLRErrorListener.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = ANTLRErrorListener.cpp; sourceTree = "<group>"; };
|
||||
2793DCA11F08095F00A84290 /* ANTLRErrorStrategy.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = ANTLRErrorStrategy.cpp; sourceTree = "<group>"; };
|
||||
2793DCA21F08095F00A84290 /* Token.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = Token.cpp; sourceTree = "<group>"; };
|
||||
2793DCA31F08095F00A84290 /* WritableToken.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = WritableToken.cpp; sourceTree = "<group>"; };
|
||||
2793DCB01F08099C00A84290 /* BlockStartState.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = BlockStartState.cpp; sourceTree = "<group>"; };
|
||||
2793DCB11F08099C00A84290 /* LexerAction.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = LexerAction.cpp; sourceTree = "<group>"; };
|
||||
2794D8551CE7821B00FADD0F /* antlr4-common.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "antlr4-common.h"; sourceTree = "<group>"; };
|
||||
27AC52CF1CE773A80093AAAB /* antlr4-runtime.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "antlr4-runtime.h"; sourceTree = "<group>"; };
|
||||
27B36AC41DACE7AF0069C868 /* RuleContextWithAltNum.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = RuleContextWithAltNum.cpp; sourceTree = "<group>"; };
|
||||
|
|
@ -1230,7 +1278,9 @@
|
|||
276E5CF91CDB57AA003FF4B4 /* tree */,
|
||||
2794D8551CE7821B00FADD0F /* antlr4-common.h */,
|
||||
27AC52CF1CE773A80093AAAB /* antlr4-runtime.h */,
|
||||
2793DCA01F08095F00A84290 /* ANTLRErrorListener.cpp */,
|
||||
276E5C0C1CDB57AA003FF4B4 /* ANTLRErrorListener.h */,
|
||||
2793DCA11F08095F00A84290 /* ANTLRErrorStrategy.cpp */,
|
||||
276E5C0D1CDB57AA003FF4B4 /* ANTLRErrorStrategy.h */,
|
||||
276E5C0E1CDB57AA003FF4B4 /* ANTLRFileStream.cpp */,
|
||||
276E5C0F1CDB57AA003FF4B4 /* ANTLRFileStream.h */,
|
||||
|
|
@ -1266,7 +1316,6 @@
|
|||
276E5CBD1CDB57AA003FF4B4 /* InterpreterRuleContext.h */,
|
||||
276E5CBE1CDB57AA003FF4B4 /* IntStream.cpp */,
|
||||
276E5CBF1CDB57AA003FF4B4 /* IntStream.h */,
|
||||
276E5CC01CDB57AA003FF4B4 /* IRecognizer.h */,
|
||||
276E5CC11CDB57AA003FF4B4 /* Lexer.cpp */,
|
||||
276E5CC21CDB57AA003FF4B4 /* Lexer.h */,
|
||||
276E5CC31CDB57AA003FF4B4 /* LexerInterpreter.cpp */,
|
||||
|
|
@ -1295,8 +1344,10 @@
|
|||
27B36AC51DACE7AF0069C868 /* RuleContextWithAltNum.h */,
|
||||
27745EFB1CE49C000067C6A3 /* RuntimeMetaData.cpp */,
|
||||
27745EFC1CE49C000067C6A3 /* RuntimeMetaData.h */,
|
||||
2793DCA21F08095F00A84290 /* Token.cpp */,
|
||||
276E5CF01CDB57AA003FF4B4 /* Token.h */,
|
||||
276E5CF21CDB57AA003FF4B4 /* TokenFactory.h */,
|
||||
2793DC841F08083F00A84290 /* TokenSource.cpp */,
|
||||
276E5CF41CDB57AA003FF4B4 /* TokenSource.h */,
|
||||
276E5CF51CDB57AA003FF4B4 /* TokenStream.cpp */,
|
||||
276E5CF61CDB57AA003FF4B4 /* TokenStream.h */,
|
||||
|
|
@ -1308,6 +1359,7 @@
|
|||
276E5D251CDB57AA003FF4B4 /* UnbufferedTokenStream.h */,
|
||||
276E5D271CDB57AA003FF4B4 /* Vocabulary.cpp */,
|
||||
276E5D281CDB57AA003FF4B4 /* Vocabulary.h */,
|
||||
2793DCA31F08095F00A84290 /* WritableToken.cpp */,
|
||||
276E5D2A1CDB57AA003FF4B4 /* WritableToken.h */,
|
||||
);
|
||||
name = runtime;
|
||||
|
|
@ -1350,6 +1402,7 @@
|
|||
276E5C321CDB57AA003FF4B4 /* BasicState.h */,
|
||||
276E5C331CDB57AA003FF4B4 /* BlockEndState.cpp */,
|
||||
276E5C341CDB57AA003FF4B4 /* BlockEndState.h */,
|
||||
2793DCB01F08099C00A84290 /* BlockStartState.cpp */,
|
||||
276E5C351CDB57AA003FF4B4 /* BlockStartState.h */,
|
||||
276E5C371CDB57AA003FF4B4 /* ContextSensitivityInfo.cpp */,
|
||||
276E5C381CDB57AA003FF4B4 /* ContextSensitivityInfo.h */,
|
||||
|
|
@ -1365,6 +1418,7 @@
|
|||
276E5C421CDB57AA003FF4B4 /* EpsilonTransition.h */,
|
||||
276E5C431CDB57AA003FF4B4 /* ErrorInfo.cpp */,
|
||||
276E5C441CDB57AA003FF4B4 /* ErrorInfo.h */,
|
||||
2793DCB11F08099C00A84290 /* LexerAction.cpp */,
|
||||
276E5C451CDB57AA003FF4B4 /* LexerAction.h */,
|
||||
276E5C461CDB57AA003FF4B4 /* LexerActionExecutor.cpp */,
|
||||
276E5C471CDB57AA003FF4B4 /* LexerActionExecutor.h */,
|
||||
|
|
@ -1483,6 +1537,7 @@
|
|||
276E5CE41CDB57AA003FF4B4 /* support */ = {
|
||||
isa = PBXGroup;
|
||||
children = (
|
||||
2793DC9C1F08090D00A84290 /* Any.cpp */,
|
||||
27F4A8551D4CEB2A00E067EE /* Any.h */,
|
||||
276E5CE51CDB57AA003FF4B4 /* Arrays.cpp */,
|
||||
276E5CE61CDB57AA003FF4B4 /* Arrays.h */,
|
||||
|
|
@ -1504,6 +1559,7 @@
|
|||
276E5D061CDB57AA003FF4B4 /* pattern */,
|
||||
27DB448A1D045537007E790B /* xpath */,
|
||||
276E5CFA1CDB57AA003FF4B4 /* AbstractParseTreeVisitor.h */,
|
||||
2793DC941F0808E100A84290 /* ErrorNode.cpp */,
|
||||
276E5CFB1CDB57AA003FF4B4 /* ErrorNode.h */,
|
||||
276E5CFC1CDB57AA003FF4B4 /* ErrorNodeImpl.cpp */,
|
||||
276E5CFD1CDB57AA003FF4B4 /* ErrorNodeImpl.h */,
|
||||
|
|
@ -1511,11 +1567,14 @@
|
|||
27D414511DEB0D3D00D0F3F9 /* IterativeParseTreeWalker.h */,
|
||||
276566DF1DA93BFB000869BE /* ParseTree.cpp */,
|
||||
276E5CFE1CDB57AA003FF4B4 /* ParseTree.h */,
|
||||
2793DC8C1F08088F00A84290 /* ParseTreeListener.cpp */,
|
||||
276E5D001CDB57AA003FF4B4 /* ParseTreeListener.h */,
|
||||
276E5D021CDB57AA003FF4B4 /* ParseTreeProperty.h */,
|
||||
2793DC951F0808E100A84290 /* ParseTreeVisitor.cpp */,
|
||||
276E5D031CDB57AA003FF4B4 /* ParseTreeVisitor.h */,
|
||||
276E5D041CDB57AA003FF4B4 /* ParseTreeWalker.cpp */,
|
||||
276E5D051CDB57AA003FF4B4 /* ParseTreeWalker.h */,
|
||||
2793DC901F0808A200A84290 /* TerminalNode.cpp */,
|
||||
276E5D181CDB57AA003FF4B4 /* TerminalNode.h */,
|
||||
276E5D191CDB57AA003FF4B4 /* TerminalNodeImpl.cpp */,
|
||||
276E5D1A1CDB57AA003FF4B4 /* TerminalNodeImpl.h */,
|
||||
|
|
@ -1529,6 +1588,7 @@
|
|||
isa = PBXGroup;
|
||||
children = (
|
||||
276E5D071CDB57AA003FF4B4 /* Chunk.h */,
|
||||
2793DC881F08087500A84290 /* Chunk.cpp */,
|
||||
276E5D081CDB57AA003FF4B4 /* ParseTreeMatch.cpp */,
|
||||
276E5D091CDB57AA003FF4B4 /* ParseTreeMatch.h */,
|
||||
276E5D0A1CDB57AA003FF4B4 /* ParseTreePattern.cpp */,
|
||||
|
|
@ -1707,7 +1767,6 @@
|
|||
27DB44CC1D0463DB007E790B /* XPathElement.h in Headers */,
|
||||
276E5F581CDB57AA003FF4B4 /* LexerNoViableAltException.h in Headers */,
|
||||
276E5D811CDB57AA003FF4B4 /* ATNSimulator.h in Headers */,
|
||||
276E5F461CDB57AA003FF4B4 /* IRecognizer.h in Headers */,
|
||||
27DB44B61D0463CC007E790B /* XPathLexer.h in Headers */,
|
||||
276E5FC41CDB57AA003FF4B4 /* guid.h in Headers */,
|
||||
276E602D1CDB57AA003FF4B4 /* TagChunk.h in Headers */,
|
||||
|
|
@ -1875,7 +1934,6 @@
|
|||
276E60141CDB57AA003FF4B4 /* ParseTreeMatch.h in Headers */,
|
||||
276E5F571CDB57AA003FF4B4 /* LexerNoViableAltException.h in Headers */,
|
||||
276E5D801CDB57AA003FF4B4 /* ATNSimulator.h in Headers */,
|
||||
276E5F451CDB57AA003FF4B4 /* IRecognizer.h in Headers */,
|
||||
276E5FC31CDB57AA003FF4B4 /* guid.h in Headers */,
|
||||
276E602C1CDB57AA003FF4B4 /* TagChunk.h in Headers */,
|
||||
276E5E941CDB57AA003FF4B4 /* RuleStopState.h in Headers */,
|
||||
|
|
@ -2033,7 +2091,6 @@
|
|||
276E60131CDB57AA003FF4B4 /* ParseTreeMatch.h in Headers */,
|
||||
276E5F561CDB57AA003FF4B4 /* LexerNoViableAltException.h in Headers */,
|
||||
276E5D7F1CDB57AA003FF4B4 /* ATNSimulator.h in Headers */,
|
||||
276E5F441CDB57AA003FF4B4 /* IRecognizer.h in Headers */,
|
||||
276E5FC21CDB57AA003FF4B4 /* guid.h in Headers */,
|
||||
276E602B1CDB57AA003FF4B4 /* TagChunk.h in Headers */,
|
||||
276E5E931CDB57AA003FF4B4 /* RuleStopState.h in Headers */,
|
||||
|
|
@ -2225,10 +2282,12 @@
|
|||
276E60451CDB57AA003FF4B4 /* TerminalNodeImpl.cpp in Sources */,
|
||||
276E5DD21CDB57AA003FF4B4 /* ErrorInfo.cpp in Sources */,
|
||||
276E5F551CDB57AA003FF4B4 /* LexerNoViableAltException.cpp in Sources */,
|
||||
2793DCB81F08099C00A84290 /* LexerAction.cpp in Sources */,
|
||||
276E5E561CDB57AA003FF4B4 /* PlusBlockStartState.cpp in Sources */,
|
||||
276E5E1D1CDB57AA003FF4B4 /* LexerSkipAction.cpp in Sources */,
|
||||
276E5EBC1CDB57AA003FF4B4 /* StarLoopEntryState.cpp in Sources */,
|
||||
276E5D721CDB57AA003FF4B4 /* ATNDeserializer.cpp in Sources */,
|
||||
2793DC8B1F08087500A84290 /* Chunk.cpp in Sources */,
|
||||
276E5E2F1CDB57AA003FF4B4 /* LookaheadEventInfo.cpp in Sources */,
|
||||
276E5DFF1CDB57AA003FF4B4 /* LexerIndexedCustomAction.cpp in Sources */,
|
||||
276E60511CDB57AA003FF4B4 /* Trees.cpp in Sources */,
|
||||
|
|
@ -2256,6 +2315,8 @@
|
|||
276E5E921CDB57AA003FF4B4 /* RuleStopState.cpp in Sources */,
|
||||
276E60631CDB57AA003FF4B4 /* UnbufferedTokenStream.cpp in Sources */,
|
||||
276E5DDB1CDB57AA003FF4B4 /* LexerActionExecutor.cpp in Sources */,
|
||||
2793DC981F0808E100A84290 /* ErrorNode.cpp in Sources */,
|
||||
2793DCAF1F08095F00A84290 /* WritableToken.cpp in Sources */,
|
||||
276E5E9E1CDB57AA003FF4B4 /* SemanticContext.cpp in Sources */,
|
||||
276E5EC81CDB57AA003FF4B4 /* Transition.cpp in Sources */,
|
||||
276E601E1CDB57AA003FF4B4 /* ParseTreePatternMatcher.cpp in Sources */,
|
||||
|
|
@ -2263,12 +2324,15 @@
|
|||
276E5D481CDB57AA003FF4B4 /* ActionTransition.cpp in Sources */,
|
||||
276E5DC61CDB57AA003FF4B4 /* EmptyPredictionContext.cpp in Sources */,
|
||||
276E5ED41CDB57AA003FF4B4 /* BailErrorStrategy.cpp in Sources */,
|
||||
2793DC9B1F0808E100A84290 /* ParseTreeVisitor.cpp in Sources */,
|
||||
2793DCAC1F08095F00A84290 /* Token.cpp in Sources */,
|
||||
276E5FA31CDB57AA003FF4B4 /* Recognizer.cpp in Sources */,
|
||||
276E5D6C1CDB57AA003FF4B4 /* ATNDeserializationOptions.cpp in Sources */,
|
||||
276E60361CDB57AA003FF4B4 /* TokenTagToken.cpp in Sources */,
|
||||
27DB44D51D0463DB007E790B /* XPathTokenElement.cpp in Sources */,
|
||||
27DB44D11D0463DB007E790B /* XPathRuleElement.cpp in Sources */,
|
||||
276E5DED1CDB57AA003FF4B4 /* LexerATNSimulator.cpp in Sources */,
|
||||
2793DCB51F08099C00A84290 /* BlockStartState.cpp in Sources */,
|
||||
276E606C1CDB57AA003FF4B4 /* Vocabulary.cpp in Sources */,
|
||||
276E5F1C1CDB57AA003FF4B4 /* LexerDFASerializer.cpp in Sources */,
|
||||
276E60181CDB57AA003FF4B4 /* ParseTreePattern.cpp in Sources */,
|
||||
|
|
@ -2293,7 +2357,9 @@
|
|||
276E5D781CDB57AA003FF4B4 /* ATNSerializer.cpp in Sources */,
|
||||
27745F051CE49C000067C6A3 /* RuntimeMetaData.cpp in Sources */,
|
||||
276E5DAE1CDB57AA003FF4B4 /* ContextSensitivityInfo.cpp in Sources */,
|
||||
2793DCA61F08095F00A84290 /* ANTLRErrorListener.cpp in Sources */,
|
||||
276E5D661CDB57AA003FF4B4 /* ATNConfigSet.cpp in Sources */,
|
||||
2793DC9F1F08090D00A84290 /* Any.cpp in Sources */,
|
||||
276E5FAF1CDB57AA003FF4B4 /* Arrays.cpp in Sources */,
|
||||
276E5ECE1CDB57AA003FF4B4 /* WildcardTransition.cpp in Sources */,
|
||||
276E5E861CDB57AA003FF4B4 /* RangeTransition.cpp in Sources */,
|
||||
|
|
@ -2301,6 +2367,7 @@
|
|||
276E5D9C1CDB57AA003FF4B4 /* BasicState.cpp in Sources */,
|
||||
276E5FC11CDB57AA003FF4B4 /* guid.cpp in Sources */,
|
||||
276E5E801CDB57AA003FF4B4 /* ProfilingATNSimulator.cpp in Sources */,
|
||||
2793DCA91F08095F00A84290 /* ANTLRErrorStrategy.cpp in Sources */,
|
||||
276E5F401CDB57AA003FF4B4 /* IntStream.cpp in Sources */,
|
||||
276E5F5B1CDB57AA003FF4B4 /* ListTokenSource.cpp in Sources */,
|
||||
276E5F6D1CDB57AA003FF4B4 /* MurmurHash.cpp in Sources */,
|
||||
|
|
@ -2315,6 +2382,7 @@
|
|||
27DB44CF1D0463DB007E790B /* XPathRuleAnywhereElement.cpp in Sources */,
|
||||
276E5E441CDB57AA003FF4B4 /* OrderedATNConfigSet.cpp in Sources */,
|
||||
276E5DCC1CDB57AA003FF4B4 /* EpsilonTransition.cpp in Sources */,
|
||||
2793DC8F1F08088F00A84290 /* ParseTreeListener.cpp in Sources */,
|
||||
276E5D5A1CDB57AA003FF4B4 /* ATN.cpp in Sources */,
|
||||
276E5EE61CDB57AA003FF4B4 /* CharStream.cpp in Sources */,
|
||||
276E5EE01CDB57AA003FF4B4 /* BufferedTokenStream.cpp in Sources */,
|
||||
|
|
@ -2333,6 +2401,8 @@
|
|||
276E5DC01CDB57AA003FF4B4 /* DecisionState.cpp in Sources */,
|
||||
276E5E981CDB57AA003FF4B4 /* RuleTransition.cpp in Sources */,
|
||||
276E5EF81CDB57AA003FF4B4 /* CommonTokenStream.cpp in Sources */,
|
||||
2793DC871F08083F00A84290 /* TokenSource.cpp in Sources */,
|
||||
2793DC931F0808A200A84290 /* TerminalNode.cpp in Sources */,
|
||||
276E60121CDB57AA003FF4B4 /* ParseTreeMatch.cpp in Sources */,
|
||||
276566E21DA93BFB000869BE /* ParseTree.cpp in Sources */,
|
||||
276E5EEC1CDB57AA003FF4B4 /* CommonToken.cpp in Sources */,
|
||||
|
|
@ -2365,10 +2435,12 @@
|
|||
276E60441CDB57AA003FF4B4 /* TerminalNodeImpl.cpp in Sources */,
|
||||
276E5DD11CDB57AA003FF4B4 /* ErrorInfo.cpp in Sources */,
|
||||
276E5F541CDB57AA003FF4B4 /* LexerNoViableAltException.cpp in Sources */,
|
||||
2793DCB71F08099C00A84290 /* LexerAction.cpp in Sources */,
|
||||
276E5E551CDB57AA003FF4B4 /* PlusBlockStartState.cpp in Sources */,
|
||||
276E5E1C1CDB57AA003FF4B4 /* LexerSkipAction.cpp in Sources */,
|
||||
276E5EBB1CDB57AA003FF4B4 /* StarLoopEntryState.cpp in Sources */,
|
||||
276E5D711CDB57AA003FF4B4 /* ATNDeserializer.cpp in Sources */,
|
||||
2793DC8A1F08087500A84290 /* Chunk.cpp in Sources */,
|
||||
276E5E2E1CDB57AA003FF4B4 /* LookaheadEventInfo.cpp in Sources */,
|
||||
276E5DFE1CDB57AA003FF4B4 /* LexerIndexedCustomAction.cpp in Sources */,
|
||||
276E60501CDB57AA003FF4B4 /* Trees.cpp in Sources */,
|
||||
|
|
@ -2396,6 +2468,8 @@
|
|||
276E5E911CDB57AA003FF4B4 /* RuleStopState.cpp in Sources */,
|
||||
276E60621CDB57AA003FF4B4 /* UnbufferedTokenStream.cpp in Sources */,
|
||||
276E5DDA1CDB57AA003FF4B4 /* LexerActionExecutor.cpp in Sources */,
|
||||
2793DC971F0808E100A84290 /* ErrorNode.cpp in Sources */,
|
||||
2793DCAE1F08095F00A84290 /* WritableToken.cpp in Sources */,
|
||||
276E5E9D1CDB57AA003FF4B4 /* SemanticContext.cpp in Sources */,
|
||||
276E5EC71CDB57AA003FF4B4 /* Transition.cpp in Sources */,
|
||||
276E601D1CDB57AA003FF4B4 /* ParseTreePatternMatcher.cpp in Sources */,
|
||||
|
|
@ -2403,12 +2477,15 @@
|
|||
276E5D471CDB57AA003FF4B4 /* ActionTransition.cpp in Sources */,
|
||||
276E5DC51CDB57AA003FF4B4 /* EmptyPredictionContext.cpp in Sources */,
|
||||
276E5ED31CDB57AA003FF4B4 /* BailErrorStrategy.cpp in Sources */,
|
||||
2793DC9A1F0808E100A84290 /* ParseTreeVisitor.cpp in Sources */,
|
||||
2793DCAB1F08095F00A84290 /* Token.cpp in Sources */,
|
||||
276E5FA21CDB57AA003FF4B4 /* Recognizer.cpp in Sources */,
|
||||
276E5D6B1CDB57AA003FF4B4 /* ATNDeserializationOptions.cpp in Sources */,
|
||||
276E60351CDB57AA003FF4B4 /* TokenTagToken.cpp in Sources */,
|
||||
27DB44C31D0463DA007E790B /* XPathTokenElement.cpp in Sources */,
|
||||
27DB44BF1D0463DA007E790B /* XPathRuleElement.cpp in Sources */,
|
||||
276E5DEC1CDB57AA003FF4B4 /* LexerATNSimulator.cpp in Sources */,
|
||||
2793DCB41F08099C00A84290 /* BlockStartState.cpp in Sources */,
|
||||
276E606B1CDB57AA003FF4B4 /* Vocabulary.cpp in Sources */,
|
||||
276E5F1B1CDB57AA003FF4B4 /* LexerDFASerializer.cpp in Sources */,
|
||||
276E60171CDB57AA003FF4B4 /* ParseTreePattern.cpp in Sources */,
|
||||
|
|
@ -2433,7 +2510,9 @@
|
|||
276E5D771CDB57AA003FF4B4 /* ATNSerializer.cpp in Sources */,
|
||||
27745F041CE49C000067C6A3 /* RuntimeMetaData.cpp in Sources */,
|
||||
276E5DAD1CDB57AA003FF4B4 /* ContextSensitivityInfo.cpp in Sources */,
|
||||
2793DCA51F08095F00A84290 /* ANTLRErrorListener.cpp in Sources */,
|
||||
276E5D651CDB57AA003FF4B4 /* ATNConfigSet.cpp in Sources */,
|
||||
2793DC9E1F08090D00A84290 /* Any.cpp in Sources */,
|
||||
276E5FAE1CDB57AA003FF4B4 /* Arrays.cpp in Sources */,
|
||||
276E5ECD1CDB57AA003FF4B4 /* WildcardTransition.cpp in Sources */,
|
||||
276E5E851CDB57AA003FF4B4 /* RangeTransition.cpp in Sources */,
|
||||
|
|
@ -2441,6 +2520,7 @@
|
|||
276E5D9B1CDB57AA003FF4B4 /* BasicState.cpp in Sources */,
|
||||
276E5FC01CDB57AA003FF4B4 /* guid.cpp in Sources */,
|
||||
276E5E7F1CDB57AA003FF4B4 /* ProfilingATNSimulator.cpp in Sources */,
|
||||
2793DCA81F08095F00A84290 /* ANTLRErrorStrategy.cpp in Sources */,
|
||||
276E5F3F1CDB57AA003FF4B4 /* IntStream.cpp in Sources */,
|
||||
276E5F5A1CDB57AA003FF4B4 /* ListTokenSource.cpp in Sources */,
|
||||
276E5F6C1CDB57AA003FF4B4 /* MurmurHash.cpp in Sources */,
|
||||
|
|
@ -2455,6 +2535,7 @@
|
|||
27DB44BD1D0463DA007E790B /* XPathRuleAnywhereElement.cpp in Sources */,
|
||||
276E5E431CDB57AA003FF4B4 /* OrderedATNConfigSet.cpp in Sources */,
|
||||
276E5DCB1CDB57AA003FF4B4 /* EpsilonTransition.cpp in Sources */,
|
||||
2793DC8E1F08088F00A84290 /* ParseTreeListener.cpp in Sources */,
|
||||
276E5D591CDB57AA003FF4B4 /* ATN.cpp in Sources */,
|
||||
276E5EE51CDB57AA003FF4B4 /* CharStream.cpp in Sources */,
|
||||
276E5EDF1CDB57AA003FF4B4 /* BufferedTokenStream.cpp in Sources */,
|
||||
|
|
@ -2473,6 +2554,8 @@
|
|||
276E5DBF1CDB57AA003FF4B4 /* DecisionState.cpp in Sources */,
|
||||
276E5E971CDB57AA003FF4B4 /* RuleTransition.cpp in Sources */,
|
||||
276E5EF71CDB57AA003FF4B4 /* CommonTokenStream.cpp in Sources */,
|
||||
2793DC861F08083F00A84290 /* TokenSource.cpp in Sources */,
|
||||
2793DC921F0808A200A84290 /* TerminalNode.cpp in Sources */,
|
||||
276E60111CDB57AA003FF4B4 /* ParseTreeMatch.cpp in Sources */,
|
||||
276566E11DA93BFB000869BE /* ParseTree.cpp in Sources */,
|
||||
276E5EEB1CDB57AA003FF4B4 /* CommonToken.cpp in Sources */,
|
||||
|
|
@ -2505,10 +2588,12 @@
|
|||
276E5DB21CDB57AA003FF4B4 /* DecisionEventInfo.cpp in Sources */,
|
||||
276E60431CDB57AA003FF4B4 /* TerminalNodeImpl.cpp in Sources */,
|
||||
276E5DD01CDB57AA003FF4B4 /* ErrorInfo.cpp in Sources */,
|
||||
2793DCB61F08099C00A84290 /* LexerAction.cpp in Sources */,
|
||||
276E5F531CDB57AA003FF4B4 /* LexerNoViableAltException.cpp in Sources */,
|
||||
276E5E541CDB57AA003FF4B4 /* PlusBlockStartState.cpp in Sources */,
|
||||
276E5E1B1CDB57AA003FF4B4 /* LexerSkipAction.cpp in Sources */,
|
||||
276E5EBA1CDB57AA003FF4B4 /* StarLoopEntryState.cpp in Sources */,
|
||||
2793DC891F08087500A84290 /* Chunk.cpp in Sources */,
|
||||
276E5D701CDB57AA003FF4B4 /* ATNDeserializer.cpp in Sources */,
|
||||
276E5E2D1CDB57AA003FF4B4 /* LookaheadEventInfo.cpp in Sources */,
|
||||
276E5DFD1CDB57AA003FF4B4 /* LexerIndexedCustomAction.cpp in Sources */,
|
||||
|
|
@ -2536,6 +2621,8 @@
|
|||
276E60611CDB57AA003FF4B4 /* UnbufferedTokenStream.cpp in Sources */,
|
||||
276E5DD91CDB57AA003FF4B4 /* LexerActionExecutor.cpp in Sources */,
|
||||
27DB449D1D045537007E790B /* XPath.cpp in Sources */,
|
||||
2793DC961F0808E100A84290 /* ErrorNode.cpp in Sources */,
|
||||
2793DCAD1F08095F00A84290 /* WritableToken.cpp in Sources */,
|
||||
276E5E9C1CDB57AA003FF4B4 /* SemanticContext.cpp in Sources */,
|
||||
27DB44AD1D045537007E790B /* XPathWildcardElement.cpp in Sources */,
|
||||
276E5EC61CDB57AA003FF4B4 /* Transition.cpp in Sources */,
|
||||
|
|
@ -2543,12 +2630,15 @@
|
|||
27DB44A51D045537007E790B /* XPathRuleElement.cpp in Sources */,
|
||||
276E5F201CDB57AA003FF4B4 /* DiagnosticErrorListener.cpp in Sources */,
|
||||
276E5D461CDB57AA003FF4B4 /* ActionTransition.cpp in Sources */,
|
||||
2793DC991F0808E100A84290 /* ParseTreeVisitor.cpp in Sources */,
|
||||
2793DCAA1F08095F00A84290 /* Token.cpp in Sources */,
|
||||
276E5DC41CDB57AA003FF4B4 /* EmptyPredictionContext.cpp in Sources */,
|
||||
276E5ED21CDB57AA003FF4B4 /* BailErrorStrategy.cpp in Sources */,
|
||||
276E5FA11CDB57AA003FF4B4 /* Recognizer.cpp in Sources */,
|
||||
276E5D6A1CDB57AA003FF4B4 /* ATNDeserializationOptions.cpp in Sources */,
|
||||
276E60341CDB57AA003FF4B4 /* TokenTagToken.cpp in Sources */,
|
||||
276E5DEB1CDB57AA003FF4B4 /* LexerATNSimulator.cpp in Sources */,
|
||||
2793DCB31F08099C00A84290 /* BlockStartState.cpp in Sources */,
|
||||
276E606A1CDB57AA003FF4B4 /* Vocabulary.cpp in Sources */,
|
||||
276E5F1A1CDB57AA003FF4B4 /* LexerDFASerializer.cpp in Sources */,
|
||||
276E60161CDB57AA003FF4B4 /* ParseTreePattern.cpp in Sources */,
|
||||
|
|
@ -2573,7 +2663,9 @@
|
|||
276E5D761CDB57AA003FF4B4 /* ATNSerializer.cpp in Sources */,
|
||||
27745F031CE49C000067C6A3 /* RuntimeMetaData.cpp in Sources */,
|
||||
276E5DAC1CDB57AA003FF4B4 /* ContextSensitivityInfo.cpp in Sources */,
|
||||
2793DCA41F08095F00A84290 /* ANTLRErrorListener.cpp in Sources */,
|
||||
276E5D641CDB57AA003FF4B4 /* ATNConfigSet.cpp in Sources */,
|
||||
2793DC9D1F08090D00A84290 /* Any.cpp in Sources */,
|
||||
276E5FAD1CDB57AA003FF4B4 /* Arrays.cpp in Sources */,
|
||||
276E5ECC1CDB57AA003FF4B4 /* WildcardTransition.cpp in Sources */,
|
||||
276E5E841CDB57AA003FF4B4 /* RangeTransition.cpp in Sources */,
|
||||
|
|
@ -2581,6 +2673,7 @@
|
|||
276E5D9A1CDB57AA003FF4B4 /* BasicState.cpp in Sources */,
|
||||
276E5FBF1CDB57AA003FF4B4 /* guid.cpp in Sources */,
|
||||
276E5E7E1CDB57AA003FF4B4 /* ProfilingATNSimulator.cpp in Sources */,
|
||||
2793DCA71F08095F00A84290 /* ANTLRErrorStrategy.cpp in Sources */,
|
||||
276E5F3E1CDB57AA003FF4B4 /* IntStream.cpp in Sources */,
|
||||
276E5F591CDB57AA003FF4B4 /* ListTokenSource.cpp in Sources */,
|
||||
276E5F6B1CDB57AA003FF4B4 /* MurmurHash.cpp in Sources */,
|
||||
|
|
@ -2595,6 +2688,7 @@
|
|||
276E5D581CDB57AA003FF4B4 /* ATN.cpp in Sources */,
|
||||
276E5EE41CDB57AA003FF4B4 /* CharStream.cpp in Sources */,
|
||||
27DB44AB1D045537007E790B /* XPathWildcardAnywhereElement.cpp in Sources */,
|
||||
2793DC8D1F08088F00A84290 /* ParseTreeListener.cpp in Sources */,
|
||||
276E5EDE1CDB57AA003FF4B4 /* BufferedTokenStream.cpp in Sources */,
|
||||
276E5F021CDB57AA003FF4B4 /* DefaultErrorStrategy.cpp in Sources */,
|
||||
276E5D401CDB57AA003FF4B4 /* AbstractPredicateTransition.cpp in Sources */,
|
||||
|
|
@ -2613,6 +2707,8 @@
|
|||
276E5DBE1CDB57AA003FF4B4 /* DecisionState.cpp in Sources */,
|
||||
276E5E961CDB57AA003FF4B4 /* RuleTransition.cpp in Sources */,
|
||||
276E5EF61CDB57AA003FF4B4 /* CommonTokenStream.cpp in Sources */,
|
||||
2793DC851F08083F00A84290 /* TokenSource.cpp in Sources */,
|
||||
2793DC911F0808A200A84290 /* TerminalNode.cpp in Sources */,
|
||||
276E60101CDB57AA003FF4B4 /* ParseTreeMatch.cpp in Sources */,
|
||||
276566E01DA93BFB000869BE /* ParseTree.cpp in Sources */,
|
||||
276E5EEA1CDB57AA003FF4B4 /* CommonToken.cpp in Sources */,
|
||||
|
|
|
|||
|
|
@ -1,3 +1,8 @@
|
|||
/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
|
||||
* Use of this file is governed by the BSD 3-clause license that
|
||||
* can be found in the LICENSE.txt file in the project root.
|
||||
*/
|
||||
|
||||
#include "ANTLRErrorListener.h"
|
||||
|
||||
antlr4::ANTLRErrorListener::~ANTLRErrorListener()
|
||||
|
|
|
|||
|
|
@ -1,3 +1,8 @@
|
|||
/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
|
||||
* Use of this file is governed by the BSD 3-clause license that
|
||||
* can be found in the LICENSE.txt file in the project root.
|
||||
*/
|
||||
|
||||
#include "ANTLRErrorStrategy.h"
|
||||
|
||||
antlr4::ANTLRErrorStrategy::~ANTLRErrorStrategy()
|
||||
|
|
|
|||
|
|
@ -1,3 +1,8 @@
|
|||
/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
|
||||
* Use of this file is governed by the BSD 3-clause license that
|
||||
* can be found in the LICENSE.txt file in the project root.
|
||||
*/
|
||||
|
||||
#include "Token.h"
|
||||
|
||||
antlr4::Token::~Token() {
|
||||
|
|
|
|||
|
|
@ -1,3 +1,8 @@
|
|||
/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
|
||||
* Use of this file is governed by the BSD 3-clause license that
|
||||
* can be found in the LICENSE.txt file in the project root.
|
||||
*/
|
||||
|
||||
#include "TokenSource.h"
|
||||
|
||||
antlr4::TokenSource::~TokenSource() {
|
||||
|
|
|
|||
|
|
@ -1,3 +1,8 @@
|
|||
/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
|
||||
* Use of this file is governed by the BSD 3-clause license that
|
||||
* can be found in the LICENSE.txt file in the project root.
|
||||
*/
|
||||
|
||||
#include "WritableToken.h"
|
||||
|
||||
antlr4::WritableToken::~WritableToken() {
|
||||
|
|
|
|||
|
|
@ -1,3 +1,8 @@
|
|||
/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
|
||||
* Use of this file is governed by the BSD 3-clause license that
|
||||
* can be found in the LICENSE.txt file in the project root.
|
||||
*/
|
||||
|
||||
#include "BlockStartState.h"
|
||||
|
||||
antlr4::atn::BlockStartState::~BlockStartState() {
|
||||
|
|
|
|||
|
|
@ -1,3 +1,8 @@
|
|||
/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
|
||||
* Use of this file is governed by the BSD 3-clause license that
|
||||
* can be found in the LICENSE.txt file in the project root.
|
||||
*/
|
||||
|
||||
#include "LexerAction.h"
|
||||
|
||||
antlr4::atn::LexerAction::~LexerAction() {
|
||||
|
|
|
|||
|
|
@ -184,7 +184,7 @@ size_t ParserATNSimulator::execATN(dfa::DFA &dfa, dfa::DFAState *s0, TokenStream
|
|||
throw e;
|
||||
}
|
||||
|
||||
if (D->requiresFullContext && mode != PredictionMode::SLL) {
|
||||
if (D->requiresFullContext && _mode != PredictionMode::SLL) {
|
||||
// IF PREDS, MIGHT RESOLVE TO SINGLE ALT => SLL (or syntax error)
|
||||
BitSet conflictingAlts;
|
||||
if (D->predicates.size() != 0) {
|
||||
|
|
@ -283,7 +283,7 @@ dfa::DFAState *ParserATNSimulator::computeTargetState(dfa::DFA &dfa, dfa::DFASta
|
|||
D->isAcceptState = true;
|
||||
D->configs->uniqueAlt = predictedAlt;
|
||||
D->prediction = predictedAlt;
|
||||
} else if (PredictionModeClass::hasSLLConflictTerminatingPrediction(mode, D->configs.get())) {
|
||||
} else if (PredictionModeClass::hasSLLConflictTerminatingPrediction(_mode, D->configs.get())) {
|
||||
// MORE THAN ONE VIABLE ALTERNATIVE
|
||||
D->configs->conflictingAlts = getConflictingAlts(D->configs.get());
|
||||
D->requiresFullContext = true;
|
||||
|
|
@ -370,7 +370,7 @@ size_t ParserATNSimulator::execATNWithFullContext(dfa::DFA &dfa, dfa::DFAState *
|
|||
predictedAlt = reach->uniqueAlt;
|
||||
break;
|
||||
}
|
||||
if (mode != PredictionMode::LL_EXACT_AMBIG_DETECTION) {
|
||||
if (_mode != PredictionMode::LL_EXACT_AMBIG_DETECTION) {
|
||||
predictedAlt = PredictionModeClass::resolvesToJustOneViableAlt(altSubSets);
|
||||
if (predictedAlt != ATN::INVALID_ALT_NUMBER) {
|
||||
break;
|
||||
|
|
@ -1332,11 +1332,11 @@ void ParserATNSimulator::reportAmbiguity(dfa::DFA &dfa, dfa::DFAState * /*D*/, s
|
|||
}
|
||||
|
||||
void ParserATNSimulator::setPredictionMode(PredictionMode newMode) {
|
||||
mode = newMode;
|
||||
_mode = newMode;
|
||||
}
|
||||
|
||||
atn::PredictionMode ParserATNSimulator::getPredictionMode() {
|
||||
return mode;
|
||||
return _mode;
|
||||
}
|
||||
|
||||
Parser* ParserATNSimulator::getParser() {
|
||||
|
|
@ -1352,6 +1352,6 @@ bool ParserATNSimulator::getLrLoopSetting() {
|
|||
}
|
||||
|
||||
void ParserATNSimulator::InitializeInstanceFields() {
|
||||
mode = PredictionMode::LL;
|
||||
_mode = PredictionMode::LL;
|
||||
_startIndex = 0;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -243,20 +243,133 @@ namespace atn {
|
|||
* the input.</p>
|
||||
*/
|
||||
class ANTLR4CPP_PUBLIC ParserATNSimulator : public ATNSimulator {
|
||||
protected:
|
||||
Parser *const parser;
|
||||
|
||||
public:
|
||||
/// Testing only!
|
||||
ParserATNSimulator(const ATN &atn, std::vector<dfa::DFA> &decisionToDFA,
|
||||
PredictionContextCache &sharedContextCache);
|
||||
|
||||
ParserATNSimulator(Parser *parser, const ATN &atn, std::vector<dfa::DFA> &decisionToDFA,
|
||||
PredictionContextCache &sharedContextCache);
|
||||
|
||||
virtual void reset() override;
|
||||
virtual void clearDFA() override;
|
||||
virtual size_t adaptivePredict(TokenStream *input, size_t decision, ParserRuleContext *outerContext);
|
||||
|
||||
static const bool TURN_OFF_LR_LOOP_ENTRY_BRANCH_OPT;
|
||||
|
||||
std::vector<dfa::DFA> &decisionToDFA;
|
||||
|
||||
/** Implements first-edge (loop entry) elimination as an optimization
|
||||
* during closure operations. See antlr/antlr4#1398.
|
||||
*
|
||||
* The optimization is to avoid adding the loop entry config when
|
||||
* the exit path can only lead back to the same
|
||||
* StarLoopEntryState after popping context at the rule end state
|
||||
* (traversing only epsilon edges, so we're still in closure, in
|
||||
* this same rule).
|
||||
*
|
||||
* We need to detect any state that can reach loop entry on
|
||||
* epsilon w/o exiting rule. We don't have to look at FOLLOW
|
||||
* links, just ensure that all stack tops for config refer to key
|
||||
* states in LR rule.
|
||||
*
|
||||
* To verify we are in the right situation we must first check
|
||||
* closure is at a StarLoopEntryState generated during LR removal.
|
||||
* Then we check that each stack top of context is a return state
|
||||
* from one of these cases:
|
||||
*
|
||||
* 1. 'not' expr, '(' type ')' expr. The return state points at loop entry state
|
||||
* 2. expr op expr. The return state is the block end of internal block of (...)*
|
||||
* 3. 'between' expr 'and' expr. The return state of 2nd expr reference.
|
||||
* That state points at block end of internal block of (...)*.
|
||||
* 4. expr '?' expr ':' expr. The return state points at block end,
|
||||
* which points at loop entry state.
|
||||
*
|
||||
* If any is true for each stack top, then closure does not add a
|
||||
* config to the current config set for edge[0], the loop entry branch.
|
||||
*
|
||||
* Conditions fail if any context for the current config is:
|
||||
*
|
||||
* a. empty (we'd fall out of expr to do a global FOLLOW which could
|
||||
* even be to some weird spot in expr) or,
|
||||
* b. lies outside of expr or,
|
||||
* c. lies within expr but at a state not the BlockEndState
|
||||
* generated during LR removal
|
||||
*
|
||||
* Do we need to evaluate predicates ever in closure for this case?
|
||||
*
|
||||
* No. Predicates, including precedence predicates, are only
|
||||
* evaluated when computing a DFA start state. I.e., only before
|
||||
* the lookahead (but not parser) consumes a token.
|
||||
*
|
||||
* There are no epsilon edges allowed in LR rule alt blocks or in
|
||||
* the "primary" part (ID here). If closure is in
|
||||
* StarLoopEntryState any lookahead operation will have consumed a
|
||||
* token as there are no epsilon-paths that lead to
|
||||
* StarLoopEntryState. We do not have to evaluate predicates
|
||||
* therefore if we are in the generated StarLoopEntryState of a LR
|
||||
* rule. Note that when making a prediction starting at that
|
||||
* decision point, decision d=2, compute-start-state performs
|
||||
* closure starting at edges[0], edges[1] emanating from
|
||||
* StarLoopEntryState. That means it is not performing closure on
|
||||
* StarLoopEntryState during compute-start-state.
|
||||
*
|
||||
* How do we know this always gives same prediction answer?
|
||||
*
|
||||
* Without predicates, loop entry and exit paths are ambiguous
|
||||
* upon remaining input +b (in, say, a+b). Either paths lead to
|
||||
* valid parses. Closure can lead to consuming + immediately or by
|
||||
* falling out of this call to expr back into expr and loop back
|
||||
* again to StarLoopEntryState to match +b. In this special case,
|
||||
* we choose the more efficient path, which is to take the bypass
|
||||
* path.
|
||||
*
|
||||
* The lookahead language has not changed because closure chooses
|
||||
* one path over the other. Both paths lead to consuming the same
|
||||
* remaining input during a lookahead operation. If the next token
|
||||
* is an operator, lookahead will enter the choice block with
|
||||
* operators. If it is not, lookahead will exit expr. Same as if
|
||||
* closure had chosen to enter the choice block immediately.
|
||||
*
|
||||
* Closure is examining one config (some loopentrystate, some alt,
|
||||
* context) which means it is considering exactly one alt. Closure
|
||||
* always copies the same alt to any derived configs.
|
||||
*
|
||||
* How do we know this optimization doesn't mess up precedence in
|
||||
* our parse trees?
|
||||
*
|
||||
* Looking through expr from left edge of stat only has to confirm
|
||||
* that an input, say, a+b+c; begins with any valid interpretation
|
||||
* of an expression. The precedence actually doesn't matter when
|
||||
* making a decision in stat seeing through expr. It is only when
|
||||
* parsing rule expr that we must use the precedence to get the
|
||||
* right interpretation and, hence, parse tree.
|
||||
*/
|
||||
bool canDropLoopEntryEdgeInLeftRecursiveRule(ATNConfig *config) const;
|
||||
virtual std::string getRuleName(size_t index);
|
||||
|
||||
virtual Ref<ATNConfig> precedenceTransition(Ref<ATNConfig> const& config, PrecedencePredicateTransition *pt,
|
||||
bool collectPredicates, bool inContext, bool fullCtx);
|
||||
|
||||
void setPredictionMode(PredictionMode newMode);
|
||||
PredictionMode getPredictionMode();
|
||||
|
||||
Parser* getParser();
|
||||
|
||||
virtual std::string getTokenName(size_t t);
|
||||
|
||||
virtual std::string getLookaheadName(TokenStream *input);
|
||||
|
||||
private:
|
||||
/// <summary>
|
||||
/// SLL, LL, or LL + exact ambig detection? </summary>
|
||||
PredictionMode mode;
|
||||
|
||||
/// Used for debugging in adaptivePredict around execATN but I cut
|
||||
/// it out for clarity now that alg. works well. We can leave this
|
||||
/// "dead" code for a bit.
|
||||
/// </summary>
|
||||
virtual void dumpDeadEndConfigs(NoViableAltException &nvae);
|
||||
|
||||
protected:
|
||||
Parser *const parser;
|
||||
|
||||
/// <summary>
|
||||
/// Each prediction operation uses a cache for merge of prediction contexts.
|
||||
/// Don't keep around as it wastes huge amounts of memory. The merge cache
|
||||
|
|
@ -273,20 +386,7 @@ namespace atn {
|
|||
size_t _startIndex;
|
||||
ParserRuleContext *_outerContext;
|
||||
dfa::DFA *_dfa; // Reference into the decisionToDFA vector.
|
||||
|
||||
public:
|
||||
/// Testing only!
|
||||
ParserATNSimulator(const ATN &atn, std::vector<dfa::DFA> &decisionToDFA,
|
||||
PredictionContextCache &sharedContextCache);
|
||||
|
||||
ParserATNSimulator(Parser *parser, const ATN &atn, std::vector<dfa::DFA> &decisionToDFA,
|
||||
PredictionContextCache &sharedContextCache);
|
||||
|
||||
virtual void reset() override;
|
||||
virtual void clearDFA() override;
|
||||
virtual size_t adaptivePredict(TokenStream *input, size_t decision, ParserRuleContext *outerContext);
|
||||
|
||||
protected:
|
||||
|
||||
/// <summary>
|
||||
/// Performs ATN simulation to compute a predicted alternative based
|
||||
/// upon the remaining input, but also updates the DFA cache to avoid
|
||||
|
|
@ -350,7 +450,7 @@ namespace atn {
|
|||
|
||||
// comes back with reach.uniqueAlt set to a valid alt
|
||||
virtual size_t execATNWithFullContext(dfa::DFA &dfa, dfa::DFAState *D, ATNConfigSet *s0,
|
||||
TokenStream *input, size_t startIndex, ParserRuleContext *outerContext); // how far we got before failing over
|
||||
TokenStream *input, size_t startIndex, ParserRuleContext *outerContext); // how far we got before failing over
|
||||
|
||||
virtual std::unique_ptr<ATNConfigSet> computeReachSet(ATNConfigSet *closure, size_t t, bool fullCtx);
|
||||
|
||||
|
|
@ -549,10 +649,10 @@ namespace atn {
|
|||
virtual ATNState *getReachableTarget(Transition *trans, size_t ttype);
|
||||
|
||||
virtual std::vector<Ref<SemanticContext>> getPredsForAmbigAlts(const antlrcpp::BitSet &ambigAlts,
|
||||
ATNConfigSet *configs, size_t nalts);
|
||||
ATNConfigSet *configs, size_t nalts);
|
||||
|
||||
virtual std::vector<dfa::DFAState::PredPrediction*> getPredicatePredictions(const antlrcpp::BitSet &ambigAlts,
|
||||
std::vector<Ref<SemanticContext>> altToPred);
|
||||
std::vector<Ref<SemanticContext>> altToPred);
|
||||
|
||||
/**
|
||||
* This method is used to improve the localization of error messages by
|
||||
|
|
@ -601,7 +701,7 @@ namespace atn {
|
|||
* identified and {@link #adaptivePredict} should report an error instead.
|
||||
*/
|
||||
size_t getSynValidOrSemInvalidAltThatFinishedDecisionEntryRule(ATNConfigSet *configs,
|
||||
ParserRuleContext *outerContext);
|
||||
ParserRuleContext *outerContext);
|
||||
|
||||
virtual size_t getAltThatFinishedDecisionEntryRule(ATNConfigSet *configs);
|
||||
|
||||
|
|
@ -615,7 +715,7 @@ namespace atn {
|
|||
* prediction, which is where predicates need to evaluate.
|
||||
*/
|
||||
std::pair<ATNConfigSet *, ATNConfigSet *> splitAccordingToSemanticValidity(ATNConfigSet *configs,
|
||||
ParserRuleContext *outerContext);
|
||||
ParserRuleContext *outerContext);
|
||||
|
||||
/// <summary>
|
||||
/// Look through a list of predicate/alt pairs, returning alts for the
|
||||
|
|
@ -627,7 +727,6 @@ namespace atn {
|
|||
virtual antlrcpp::BitSet evalSemanticContext(std::vector<dfa::DFAState::PredPrediction*> predPredictions,
|
||||
ParserRuleContext *outerContext, bool complete);
|
||||
|
||||
|
||||
/**
|
||||
* Evaluate a semantic context within a specific parser context.
|
||||
*
|
||||
|
|
@ -672,111 +771,15 @@ namespace atn {
|
|||
|
||||
virtual void closureCheckingStopState(Ref<ATNConfig> const& config, ATNConfigSet *configs, ATNConfig::Set &closureBusy,
|
||||
bool collectPredicates, bool fullCtx, int depth, bool treatEofAsEpsilon);
|
||||
|
||||
|
||||
/// Do the actual work of walking epsilon edges.
|
||||
virtual void closure_(Ref<ATNConfig> const& config, ATNConfigSet *configs, ATNConfig::Set &closureBusy,
|
||||
bool collectPredicates, bool fullCtx, int depth, bool treatEofAsEpsilon);
|
||||
|
||||
public:
|
||||
/** Implements first-edge (loop entry) elimination as an optimization
|
||||
* during closure operations. See antlr/antlr4#1398.
|
||||
*
|
||||
* The optimization is to avoid adding the loop entry config when
|
||||
* the exit path can only lead back to the same
|
||||
* StarLoopEntryState after popping context at the rule end state
|
||||
* (traversing only epsilon edges, so we're still in closure, in
|
||||
* this same rule).
|
||||
*
|
||||
* We need to detect any state that can reach loop entry on
|
||||
* epsilon w/o exiting rule. We don't have to look at FOLLOW
|
||||
* links, just ensure that all stack tops for config refer to key
|
||||
* states in LR rule.
|
||||
*
|
||||
* To verify we are in the right situation we must first check
|
||||
* closure is at a StarLoopEntryState generated during LR removal.
|
||||
* Then we check that each stack top of context is a return state
|
||||
* from one of these cases:
|
||||
*
|
||||
* 1. 'not' expr, '(' type ')' expr. The return state points at loop entry state
|
||||
* 2. expr op expr. The return state is the block end of internal block of (...)*
|
||||
* 3. 'between' expr 'and' expr. The return state of 2nd expr reference.
|
||||
* That state points at block end of internal block of (...)*.
|
||||
* 4. expr '?' expr ':' expr. The return state points at block end,
|
||||
* which points at loop entry state.
|
||||
*
|
||||
* If any is true for each stack top, then closure does not add a
|
||||
* config to the current config set for edge[0], the loop entry branch.
|
||||
*
|
||||
* Conditions fail if any context for the current config is:
|
||||
*
|
||||
* a. empty (we'd fall out of expr to do a global FOLLOW which could
|
||||
* even be to some weird spot in expr) or,
|
||||
* b. lies outside of expr or,
|
||||
* c. lies within expr but at a state not the BlockEndState
|
||||
* generated during LR removal
|
||||
*
|
||||
* Do we need to evaluate predicates ever in closure for this case?
|
||||
*
|
||||
* No. Predicates, including precedence predicates, are only
|
||||
* evaluated when computing a DFA start state. I.e., only before
|
||||
* the lookahead (but not parser) consumes a token.
|
||||
*
|
||||
* There are no epsilon edges allowed in LR rule alt blocks or in
|
||||
* the "primary" part (ID here). If closure is in
|
||||
* StarLoopEntryState any lookahead operation will have consumed a
|
||||
* token as there are no epsilon-paths that lead to
|
||||
* StarLoopEntryState. We do not have to evaluate predicates
|
||||
* therefore if we are in the generated StarLoopEntryState of a LR
|
||||
* rule. Note that when making a prediction starting at that
|
||||
* decision point, decision d=2, compute-start-state performs
|
||||
* closure starting at edges[0], edges[1] emanating from
|
||||
* StarLoopEntryState. That means it is not performing closure on
|
||||
* StarLoopEntryState during compute-start-state.
|
||||
*
|
||||
* How do we know this always gives same prediction answer?
|
||||
*
|
||||
* Without predicates, loop entry and exit paths are ambiguous
|
||||
* upon remaining input +b (in, say, a+b). Either paths lead to
|
||||
* valid parses. Closure can lead to consuming + immediately or by
|
||||
* falling out of this call to expr back into expr and loop back
|
||||
* again to StarLoopEntryState to match +b. In this special case,
|
||||
* we choose the more efficient path, which is to take the bypass
|
||||
* path.
|
||||
*
|
||||
* The lookahead language has not changed because closure chooses
|
||||
* one path over the other. Both paths lead to consuming the same
|
||||
* remaining input during a lookahead operation. If the next token
|
||||
* is an operator, lookahead will enter the choice block with
|
||||
* operators. If it is not, lookahead will exit expr. Same as if
|
||||
* closure had chosen to enter the choice block immediately.
|
||||
*
|
||||
* Closure is examining one config (some loopentrystate, some alt,
|
||||
* context) which means it is considering exactly one alt. Closure
|
||||
* always copies the same alt to any derived configs.
|
||||
*
|
||||
* How do we know this optimization doesn't mess up precedence in
|
||||
* our parse trees?
|
||||
*
|
||||
* Looking through expr from left edge of stat only has to confirm
|
||||
* that an input, say, a+b+c; begins with any valid interpretation
|
||||
* of an expression. The precedence actually doesn't matter when
|
||||
* making a decision in stat seeing through expr. It is only when
|
||||
* parsing rule expr that we must use the precedence to get the
|
||||
* right interpretation and, hence, parse tree.
|
||||
*/
|
||||
bool canDropLoopEntryEdgeInLeftRecursiveRule(ATNConfig *config) const;
|
||||
virtual std::string getRuleName(size_t index);
|
||||
|
||||
protected:
|
||||
|
||||
virtual Ref<ATNConfig> getEpsilonTarget(Ref<ATNConfig> const& config, Transition *t, bool collectPredicates,
|
||||
bool inContext, bool fullCtx, bool treatEofAsEpsilon);
|
||||
virtual Ref<ATNConfig> actionTransition(Ref<ATNConfig> const& config, ActionTransition *t);
|
||||
|
||||
public:
|
||||
virtual Ref<ATNConfig> precedenceTransition(Ref<ATNConfig> const& config, PrecedencePredicateTransition *pt,
|
||||
bool collectPredicates, bool inContext, bool fullCtx);
|
||||
|
||||
protected:
|
||||
virtual Ref<ATNConfig> predTransition(Ref<ATNConfig> const& config, PredicateTransition *pt, bool collectPredicates,
|
||||
bool inContext, bool fullCtx);
|
||||
|
||||
|
|
@ -832,19 +835,6 @@ namespace atn {
|
|||
|
||||
virtual antlrcpp::BitSet getConflictingAltsOrUniqueAlt(ATNConfigSet *configs);
|
||||
|
||||
public:
|
||||
virtual std::string getTokenName(size_t t);
|
||||
|
||||
virtual std::string getLookaheadName(TokenStream *input);
|
||||
|
||||
/// <summary>
|
||||
/// Used for debugging in adaptivePredict around execATN but I cut
|
||||
/// it out for clarity now that alg. works well. We can leave this
|
||||
/// "dead" code for a bit.
|
||||
/// </summary>
|
||||
virtual void dumpDeadEndConfigs(NoViableAltException &nvae);
|
||||
|
||||
protected:
|
||||
virtual NoViableAltException noViableAlt(TokenStream *input, ParserRuleContext *outerContext,
|
||||
ATNConfigSet *configs, size_t startIndex);
|
||||
|
||||
|
|
@ -901,13 +891,10 @@ namespace atn {
|
|||
const antlrcpp::BitSet &ambigAlts,
|
||||
ATNConfigSet *configs); // configs that LL not SLL considered conflicting
|
||||
|
||||
public:
|
||||
void setPredictionMode(PredictionMode newMode);
|
||||
PredictionMode getPredictionMode();
|
||||
|
||||
Parser* getParser();
|
||||
|
||||
private:
|
||||
// SLL, LL, or LL + exact ambig detection?
|
||||
PredictionMode _mode;
|
||||
|
||||
static bool getLrLoopSetting();
|
||||
void InitializeInstanceFields();
|
||||
};
|
||||
|
|
|
|||
|
|
@ -1,3 +1,8 @@
|
|||
/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
|
||||
* Use of this file is governed by the BSD 3-clause license that
|
||||
* can be found in the LICENSE.txt file in the project root.
|
||||
*/
|
||||
|
||||
#include "Any.h"
|
||||
|
||||
antlrcpp::Any::~Any()
|
||||
|
|
|
|||
|
|
@ -1,3 +1,8 @@
|
|||
/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
|
||||
* Use of this file is governed by the BSD 3-clause license that
|
||||
* can be found in the LICENSE.txt file in the project root.
|
||||
*/
|
||||
|
||||
#include "tree/ErrorNode.h"
|
||||
|
||||
antlr4::tree::ErrorNode::~ErrorNode() {
|
||||
|
|
|
|||
|
|
@ -1,31 +1,6 @@
|
|||
/*
|
||||
* [The "BSD license"]
|
||||
* Copyright (c) 2012 Terence Parr
|
||||
* Copyright (c) 2012 Sam Harwell
|
||||
* All rights reserved.
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
*
|
||||
* 1. Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
* 2. Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
* 3. The name of the author may not be used to endorse or promote products
|
||||
* derived from this software without specific prior written permission.
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
||||
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
||||
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
||||
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||||
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
||||
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||||
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||||
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||||
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
||||
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
|
||||
* Use of this file is governed by the BSD 3-clause license that
|
||||
* can be found in the LICENSE.txt file in the project root.
|
||||
*/
|
||||
|
||||
#include "support/CPPUtils.h"
|
||||
|
|
|
|||
|
|
@ -1,3 +1,8 @@
|
|||
/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
|
||||
* Use of this file is governed by the BSD 3-clause license that
|
||||
* can be found in the LICENSE.txt file in the project root.
|
||||
*/
|
||||
|
||||
#include "ParseTreeListener.h"
|
||||
|
||||
antlr4::tree::ParseTreeListener::~ParseTreeListener() {
|
||||
|
|
|
|||
|
|
@ -1,3 +1,8 @@
|
|||
/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
|
||||
* Use of this file is governed by the BSD 3-clause license that
|
||||
* can be found in the LICENSE.txt file in the project root.
|
||||
*/
|
||||
|
||||
#include "ParseTreeVisitor.h"
|
||||
|
||||
antlr4::tree::ParseTreeVisitor::~ParseTreeVisitor() {
|
||||
|
|
|
|||
|
|
@ -1,3 +1,8 @@
|
|||
/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
|
||||
* Use of this file is governed by the BSD 3-clause license that
|
||||
* can be found in the LICENSE.txt file in the project root.
|
||||
*/
|
||||
|
||||
#include "tree/TerminalNode.h"
|
||||
|
||||
antlr4::tree::TerminalNode::~TerminalNode() {
|
||||
|
|
|
|||
|
|
@ -1,3 +1,8 @@
|
|||
/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
|
||||
* Use of this file is governed by the BSD 3-clause license that
|
||||
* can be found in the LICENSE.txt file in the project root.
|
||||
*/
|
||||
|
||||
#include "tree/pattern/Chunk.h"
|
||||
|
||||
antlr4::tree::pattern::Chunk::~Chunk() {
|
||||
|
|
|
|||
Loading…
Reference in New Issue