Stefan Mandel

Results 19 issues of Stefan Mandel

I encountered an unexpected behavior with my grammar for a datalog parser. I reduced it to a smaller grammar/example to make it easier to debug [example.zip](https://github.com/lalrpop/lalrpop/files/4762612/example.zip): I start with wrong...

My grammar contains a lexer token ``` StringVal:Rc = =>? recognize_string(s); ``` Parsing works fine on correct files, but printing an error when a StringVal is expected prints: ``` Expected...

I found an unexpected behavior on resolving dictionaries and tracked it down to attribute resolution. I found this code: ``` // got to root scope and no definition, try dictionaries...

The NPE supresses the real error and leads to bad error messages

If I call `assertThat(0).isEqualTo(1);`, I get an exception with a stacktrace ``` org.opentest4j.AssertionFailedError: expected: 1 but was: 0 at java.base/jdk.internal.reflect.DirectConstructorHandleAccessor.newInstance(DirectConstructorHandleAccessor.java:62) at java.base/java.lang.reflect.Constructor.newInstanceWithCaller(Constructor.java:502) at net.amygdalum.WorldTest.testStacktrace(WorldTest.java:13) at ... ``` The first two...

type: bug

The current trie actually is a directed acyclic word graph (DAWG), yet we have algorithms that do not depend on this: * Set-Horspool and Wu-Manber need simple tries (can be...

Yet none of the search algorithms supports approximate matching.

We yet support: - matching one pattern in text - matching multiple pattern in text Yet none of the algorithms have been tested for huge sets of patterns (containing thousands...

Yet none of the algorithms does support Case Insensitive Matching (or Char Classes).

Yet none of the search algorithms supports wildcard matching.