sargunv/cakeparse

Simple parser combinator library for Kotlin

cakeparse's Issues

Switch to Kobalt

This is still on Gradle...

Write documentation

• Source code documentation
• Readme
• Github Pages

Migrate from Gradle to Kobalt

Can't parse a certain grammar

I'm trying to use cakeparse to write the grammar for my shell, https://github.com/cbeust/kash and I can't seem to define a simple grammar to allow either "and" commands:

a && b && c

or "pipe" commands:

a | b | c

Here is what I have, in short:

        val andCommand = singleCommand and zeroOrMore(andAnd and singleCommand)
        val pipeCommand = singleCommand and zeroOrMore(pipe and singleCommand)
        val goal = andCommand or pipeCommand

With that goal, I can only parse one of these two lines but never both.

Am I missing something?

Stack overflow with large input

I may be doing something wrong, but I get a stack overflow when I do the following:

val number = token("number", "[0-9]+")
val space = token("space", "\\s+")
val goal = oneOrMore(number before optional(space))

val input = "557196 56123\n".repeat(5000)
println(input)
val lexed = setOf(number, space).lexer().lex(input).cached()
println("lexed")
val result = lexed.parseToEnd(goal).value
println("Result: $result")

Allow tokens without pattern via API

Need to be able to ignore some types of tokens

Gradle could not resolve dependencies

When using what's suggested in the docs: compile "me.sargunvohra.lib:CakeParse:1.1.1" gradle gives me a ModuleVersionNotFoundException, but that's easily solved by using lowercase instead. I don't know if this is OS related, specific to the gradle version I use, or just an error in the docs.

I use Window 10 and Gradle 3.3

Ensure maximal code coverage from tests

Write tests for lexing

Write failure and edge case tests for parsers

Need to write tests for:

• Unexpected end of file when expected a token
• Unexpected token when expected an end of file
• Unexpected token when expected another token
• Instantiate a lexer with tokens that have non-alphanumeric names

Write tests for parsing

Investigate performance of large input

Check both pure lexing and also lexing + parsing

Make sure parsing is streamable

This will be useful for interactive programs.