-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
feat: Support different active parameter
- Loading branch information
Showing
6 changed files
with
108 additions
and
23 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,18 +1,41 @@ | ||
import {ParseTree, TerminalNode} from "antlr4ts/tree"; | ||
import {Position} from "vscode-languageserver"; | ||
import {Position, uinteger} from "vscode-languageserver"; | ||
import {TokenStream} from "antlr4ts/TokenStream"; | ||
import {Token} from "antlr4ts"; | ||
import {ProverifLexer} from "../parser-proverif/ProverifLexer"; | ||
|
||
export const getPositionOfTokenBefore = (tokens: TokenStream, position: Position): Position | undefined => { | ||
export const getPositionOfTokenBeforeLastLParen = (tokens: TokenStream, position: Position): Position | undefined => { | ||
let lastToken: Token|undefined = undefined; | ||
let nextLastToken: Token|undefined = undefined; | ||
for (let i = 0; i < tokens.size; i++) { | ||
const token = tokens.get(i); // lookup seems to be O(1) | ||
if (token.line >= position.line + 1 && token.charPositionInLine >= position.character) { | ||
break; | ||
} | ||
|
||
lastToken = token; | ||
if (token.type === ProverifLexer.LPAREN) { | ||
lastToken = nextLastToken; | ||
} else { | ||
nextLastToken = token; | ||
} | ||
} | ||
|
||
return lastToken ? Position.create(lastToken.line-1, lastToken.charPositionInLine) : undefined; | ||
}; | ||
|
||
export const countCommasAfterLParenButBeforeToken = (tokens: TokenStream, position: Position): uinteger | undefined => { | ||
let commaCount: uinteger = 0; | ||
for (let i = 0; i < tokens.size; i++) { | ||
const token = tokens.get(i); // lookup seems to be O(1) | ||
if (token.line >= position.line + 1 && token.charPositionInLine >= position.character) { | ||
break; | ||
} | ||
|
||
if (token.type === ProverifLexer.COMMA) { | ||
commaCount++; | ||
} else if (token.type === ProverifLexer.LPAREN) { | ||
commaCount = 0; | ||
} | ||
} | ||
|
||
return commaCount; | ||
}; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters