arnekeller/Typicalc
1
0
Fork 0
mirror of https://gitlab.kit.edu/uskyk/typicalc.git synced 2024-11-08 10:20:41 +00:00
Code Issues Packages Projects Releases Wiki Activity

Separate example assumptions by commas

Browse Source
This commit is contained in:
Moritz Dieing 2021-07-05 21:14:21 +02:00
parent d1ea244254
commit 60235bd757
2 changed files with 10 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/main/java/edu/kit/typicalc/view/main/AssumptionExampleContent.java
View File

@ -43,7 +43,7 @@ public class AssumptionExampleContent extends VerticalLayout {
selectedTermBar.setId(SELECTED_TERM_BAR_ID);
this.add(selectedTermBar);
String[] exampleAssumptions = getTranslation("root." + term.replaceAll("(\\s+|=)", "")).split(",");
String[] exampleAssumptions = getTranslation("root." + term.replaceAll("(\\s+|=)", "")).split(";");
for (String assumptions : exampleAssumptions) {
Button button = new Button(assumptions);
button.addClickListener(click -> forwardCallback.accept(assumptions.

18
src/main/resources/language/general.properties
View File

@ -16,15 +16,15 @@ root.exampleTerms=\
let f = λx. let g = λy. y in g x in f 3,\
let f = λx. let g = λy.5 5 in g x in f 3
root.λx.x=∅, x: int, y: bool
root.λx.λy.yx=∅, x: int, y: bool
root.λx.λy.y(xx)=∅, x: int, y: bool
root.letfλx.gyyinf3=∅, g: a->b->a, g: int->int->bool, g: int->int->bool; y: bool, g: int->int->bool; y: τ₁
root.letkλx.λy.xinka(kbc)=∅, a: τ₁, a: ∀τ₁.τ₁->int; b: a, a: int; b: bool; c: char
root.(λx.xx)(λx.xx)=∅, x: bool
root.(λx.λy.y(xy))(λz.λa.zga)=∅, g: bool, a: int; g: bool->int, g: ∀τ₂.τ₁->τ₂
root.letfλx.letgλy.yingxinf3=∅, g: bool->int->bool
root.letfλx.letgλy.55ingxinf3=∅, f: bool->int->bool
root.λx.x=∅; x: int; y: bool
root.λx.λy.yx=∅; x: int; y: bool
root.λx.λy.y(xx)=∅; x: int; y: bool
root.letfλx.gyyinf3=∅; g: a->b->a; g: int->int->bool; g: int->int->bool, y: bool; g: int->int->bool, y: τ₁
root.letkλx.λy.xinka(kbc)=∅; a: τ₁, a: ∀τ₁.τ₁->int; b: a, a: int; b: bool; c: char
root.(λx.xx)(λx.xx)=∅; x: bool
root.(λx.λy.y(xy))(λz.λa.zga)=∅; g: bool; a: int, g: bool->int; g: ∀τ₂.τ₁->τ₂
root.letfλx.letgλy.yingxinf3=∅; g: bool->int->bool
root.letfλx.letgλy.55ingxinf3=∅; f: bool->int->bool
root.termGrammar=\u2329Term\u232A ::= (\u2329Term\u232A) | \u2329App\u232A | \u2329Abs\u232A | \
\u2329Let\u232A | \u2329Var\u232A | \u2329Const\u232A <br> \