Arithmetic {

Exp = Number
number = "0" | "1" | "2" | "3" | "4" | "5" | "6" | "7" | "8" | "9" 

}

the node asks for a ";"

Everything in diagrams.css should be scoped to some wrapping css class, because as is it cannot be bundled with the rest of an app's css because of styles like this:

div {
    -webkit-touch-callout: none;
    -webkit-user-select: none;
    -khtml-user-select: none;
    -moz-user-select: none;
    -ms-user-select: none;
    user-select: none;
}

svg {
    width: 100%;
}

Curre

This page:

https://caster.readthedocs.io/en/latest/readthedocs/Getting_Started/Choose_Recognition_Engine/

mentions "Custom recognition weights for Grammar/Rule/Element" for kaldi but I don't see this documented anywhere. Docs should be added for this.

When I follow the instructions here: https://caster.readthedocs.io/en/latest/readthedocs/Installation/Kaldi/

then say "Enable Text Manipulation", which is a moderately complex CCR grammar, Kaldi stalls and no longer accepts speech. I found that with a different grammar if I stripped out complexity right until the limit then Kaldi would still perform really well so would it be possible to tweak

Examples seem to work, but go blank on a refresh.

Before:

After:

With Calyx almost ready for a 1.0 release, it does seem that documentation will need to be something to focus on.

I do think our current README is understandable, as it stands, but maybe I'm too used to the gem to really know whether the docs actually explain anything. And, of course, maybe a README may not be enough to show how Calyx can be used (and we may need to include a tutorial as well...b

Write here your suggestion for a snippet.

Example:

keyword: dochelp
body:

## Visit the site for documentation or help of Ren'Py engine. ##
## Documentation:
    "http://www.renpy.org/doc/html/"
## Wiki-Old Documentation:
    "http://www.renpy.org/wiki/renpy/Wiki_Home_Page"
## Forum:
    "http://lemmasoft.renai.us/forums/viewforum.php?f=42"
## Package Documentation:
    "ht

Self explanatory. Will evaluate to Option<T>.