1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.PL2012
Pattern matching in compilers
Ondřej Bílka
In this thesis we develop tools for effective and flexible pattern matching. We introduce a new pattern matching system called amethyst. Amethyst is not only a generator of parsers…
cs.FL2012
Structured Grammars are Effective
Ondřej Bílka
Top-down parsing has received much attention recently. Parsing expression grammars (PEG) allows construction of linear time parsers using packrat algorithm. These techniques howeve…
math.CO2011★ 1 cited
On the Complexity of Planar Covering of Small Graphs
Ondřej Bílka, Jozef Jirásek, Pavel Klavík +2
The problem Cover(H) asks whether an input graph G covers a fixed graph H (i.e., whether there exists a homomorphism G to H which locally preserves the structure of the graphs). Co…