Skip to content
GitLab
Menu
Projects
Groups
Snippets
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
Menu
Open sidebar
Alexandru Dura
SPPF Earley Parser
Commits
20f5adb0
Commit
20f5adb0
authored
Mar 09, 2020
by
Alexandru Dura
Browse files
Disable debug printing
parent
f27f8dd6
Changes
3
Hide whitespace changes
Inline
Side-by-side
src/main/java/se/lth/sep/EarleyParser.java
View file @
20f5adb0
...
...
@@ -13,7 +13,7 @@ import java.util.TreeSet;
https://doi.org/10.1016/j.entcs.2008.03.044 .
*/
public
class
EarleyParser
{
private
boolean
DEBUG
=
tru
e
;
private
boolean
DEBUG
=
fals
e
;
private
ArrayList
<
TreeSet
<
EarleyRule
>>
rules
;
private
Grammar
grammar
;
...
...
src/test/java/EarleyParserTest.java
View file @
20f5adb0
...
...
@@ -35,7 +35,6 @@ public class EarleyParserTest {
@Test
public
void
testToString
()
{
EarleyParser
parser
=
makeParser
();
System
.
out
.
println
(
parser
);
assertEquals
(
"s -> s <+> p \ns -> p \np -> p <*> t \np -> t \nt -> <VAR> \nt -> <NUM> \n"
,
parser
.
toString
());
}
...
...
@@ -473,7 +472,6 @@ public class EarleyParserTest {
Grammar
g
=
new
Grammar
();
Java15Grammar
.
addRules
(
g
);
EarleyParser
parser
=
new
EarleyParser
(
g
);
System
.
out
.
println
(
g
);
/* enum E { .., MetaVarID,..; } */
Category
str
[]
=
{
...
...
src/test/java/UtilTest.java
View file @
20f5adb0
...
...
@@ -17,11 +17,13 @@ public class UtilTest {
LinkedList
<
LinkedList
<
Integer
>>
ll
=
new
LinkedList
<>(
Arrays
.
asList
(
l1
,
l2
,
l3
));
LinkedList
<
LinkedList
<
Integer
>>
r
=
Util
.<
Integer
>
product
(
ll
.
iterator
());
for
(
LinkedList
<
Integer
>
li
:
r
)
{
for
(
int
i
:
li
)
{
System
.
out
.
print
(
i
+
", "
);
}
System
.
out
.
println
();
}
assertEquals
(
18
,
r
.
size
());
// for (LinkedList<Integer> li : r) {
// for (int i : li) {
// System.out.print(i + ", ");
// }
// System.out.println();
// }
}
}
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment