Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
T
tla2bAST
Manage
Activity
Members
Labels
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Locked files
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Analyze
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
general
stups
tla2bAST
Commits
9af8cc0a
Commit
9af8cc0a
authored
5 months ago
by
Jan Gruteser
Browse files
Options
Downloads
Patches
Plain Diff
minor simplifications
parent
74f25b39
Branches
Branches containing commit
Tags
Tags containing commit
No related merge requests found
Pipeline
#148717
passed
5 months ago
Stage: test
Stage: deploy
Changes
2
Pipelines
1
Show whitespace changes
Inline
Side-by-side
Showing
2 changed files
src/main/java/de/tla2b/translation/RecursiveFunctionHandler.java
+14
-25
14 additions, 25 deletions
...n/java/de/tla2b/translation/RecursiveFunctionHandler.java
src/main/java/de/tla2bAst/BAstCreator.java
+4
-5
4 additions, 5 deletions
src/main/java/de/tla2bAst/BAstCreator.java
with
18 additions
and
30 deletions
src/main/java/de/tla2b/translation/RecursiveFunctionHandler.java
+
14
−
25
View file @
9af8cc0a
...
...
@@ -4,19 +4,16 @@ import de.tla2b.analysis.AbstractASTVisitor;
import
de.tla2b.analysis.SpecAnalyser
;
import
tla2sany.semantic.*
;
import
java.util.ArrayList
;
import
java.util.Collections
;
import
java.util.HashSet
;
import
java.util.Hashtable
;
import
java.util.*
;
public
class
RecursiveFunctionHandler
extends
AbstractASTVisitor
{
private
Array
List
<
FormalParamNode
>
paramList
;
private
Array
List
<
FormalParamNode
>
ignoreParamList
;
private
Array
List
<
SymbolNode
>
externParams
;
private
List
<
FormalParamNode
>
paramList
;
private
List
<
FormalParamNode
>
ignoreParamList
;
private
List
<
SymbolNode
>
externParams
;
private
final
Hash
Set
<
OpApplNode
>
recursiveFunctions
=
new
HashSet
<>();
private
final
Hashtable
<
SemanticNode
,
Array
List
<
SymbolNode
>>
additionalParamsTable
=
new
Hash
table
<>();
private
final
Set
<
OpApplNode
>
recursiveFunctions
=
new
HashSet
<>();
private
final
Map
<
SemanticNode
,
List
<
SymbolNode
>>
additionalParamsTable
=
new
Hash
Map
<>();
public
RecursiveFunctionHandler
(
SpecAnalyser
specAnalyser
)
{
for
(
OpDefNode
recFunc
:
specAnalyser
.
getRecursiveFunctions
())
{
...
...
@@ -51,7 +48,7 @@ public class RecursiveFunctionHandler extends AbstractASTVisitor {
externParams
.
add
(
n
.
getOperator
());
}
public
Array
List
<
SymbolNode
>
getAdditionalParams
(
SemanticNode
n
)
{
public
List
<
SymbolNode
>
getAdditionalParams
(
SemanticNode
n
)
{
return
additionalParamsTable
.
get
(
n
);
}
...
...
@@ -69,30 +66,22 @@ public class RecursiveFunctionHandler extends AbstractASTVisitor {
case
OPCODE_bf:
// \A x \in S : P
case
OPCODE_bc:
// CHOOSE x \in S: P
case
OPCODE_sso:
// $SubsetOf Represents {x \in S : P}
case
OPCODE_soa:
// $SetOfAll Represents {e : p1 \in S, p2,p3 \in S2}
{
FormalParamNode
[][]
params
=
n
.
getBdedQuantSymbolLists
();
HashSet
<
FormalParamNode
>
set
=
new
HashSet
<>();
for
(
FormalParamNode
[]
param
:
params
)
{
case
OPCODE_soa:
{
// $SetOfAll Represents {e : p1 \in S, p2,p3 \in S2}
Set
<
FormalParamNode
>
set
=
new
HashSet
<>();
for
(
FormalParamNode
[]
param
:
n
.
getBdedQuantSymbolLists
())
{
Collections
.
addAll
(
set
,
param
);
}
ignoreParamList
.
addAll
(
set
);
ExprNode
[]
in
=
n
.
getBdedQuantBounds
();
for
(
ExprNode
exprNode
:
in
)
{
for
(
ExprNode
exprNode
:
n
.
getBdedQuantBounds
())
{
// in
visitExprNode
(
exprNode
);
}
ExprOrOpArgNode
[]
arguments
=
n
.
getArgs
();
for
(
ExprOrOpArgNode
exprOrOpArgNode
:
arguments
)
{
visitExprOrOpArgNode
(
exprOrOpArgNode
);
for
(
ExprOrOpArgNode
argument
:
n
.
getArgs
())
{
visitExprOrOpArgNode
(
argument
);
}
return
;
}
default
:
{
default
:
super
.
visitBuiltInNode
(
n
);
}
}
}
}
This diff is collapsed.
Click to expand it.
src/main/java/de/tla2bAst/BAstCreator.java
+
4
−
5
View file @
9af8cc0a
...
...
@@ -672,11 +672,11 @@ public class BAstCreator extends BuiltInOPs implements TranslationGlobals, BBuil
}
if
(
specAnalyser
.
getRecursiveFunctions
().
contains
(
def
))
{
Array
List
<
SymbolNode
>
list
=
recursiveFunctionHandler
.
getAdditionalParams
(
def
);
List
<
SymbolNode
>
list
=
recursiveFunctionHandler
.
getAdditionalParams
(
def
);
if
(!
list
.
isEmpty
())
{
AFunctionExpression
call
=
new
AFunctionExpression
();
call
.
setIdentifier
(
createIdentifierNode
(
def
));
Array
List
<
PExpression
>
params
=
new
ArrayList
<>();
List
<
PExpression
>
params
=
new
ArrayList
<>();
for
(
SymbolNode
symbolNode
:
list
)
{
params
.
add
(
createIdentifierNode
(
symbolNode
));
}
...
...
@@ -1241,11 +1241,10 @@ public class BAstCreator extends BuiltInOPs implements TranslationGlobals, BBuil
lambda
.
setExpression
(
visitExprOrOpArgNodeExpression
(
n
.
getArgs
()[
0
]));
if
(
recursiveFunctionHandler
.
isRecursiveFunction
(
n
))
{
ArrayList
<
SymbolNode
>
externParams
=
recursiveFunctionHandler
.
getAdditionalParams
(
n
);
List
<
SymbolNode
>
externParams
=
recursiveFunctionHandler
.
getAdditionalParams
(
n
);
if
(!
externParams
.
isEmpty
())
{
ALambdaExpression
lambda2
=
new
ALambdaExpression
();
Array
List
<
PExpression
>
shiftedParams
=
new
ArrayList
<>();
List
<
PExpression
>
shiftedParams
=
new
ArrayList
<>();
List
<
PPredicate
>
predList2
=
new
ArrayList
<>();
for
(
SymbolNode
p
:
externParams
)
{
shiftedParams
.
add
(
createIdentifierNode
(
p
));
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment