com.lithinos.amotoen.core — com.lithinos/amotoen 0.3.0-SNAPSHOT

debug clj

(debug n w i)

Very very inefficient but useful in some cases. Prints out 'i' number of characters from 'w' followed by 'n', and then resets the position in 'w' as if nothing had been consumed.

fastest-theoretical clj

(fastest-theoretical s)

Finding a lower-bound on any optimizations for speed starts by simply reading each character in the string to be parsed 'b'. The function 'end' is the conditional with 'm' consuming.

IAmotoen clj protocol

Currently oriented around strings and characters, but could easily be adapted for other approaches.

c clj

(c t)

The character at pos

end clj

(end t)

End of input

gp clj

(gp t)

Get pos

m clj

(m t)

Returns the 'c' then (inc pos)

sp clj

(sp t j)

Set pos

lpegs clj

(lpegs t s)

Produces a rule that allows any character in the string 's' as a valid match.

pegasus clj

(pegasus n g w)

Returns the AST resulting from parsing the wrapped input 'w' given a grammar definition 'g' and starting at rule 'n' in 'g'.

pegs clj

(pegs s)

Produces a rule that consumes each character in the string 's' in the order given in 's'.

post-process clj

(post-process n g w fn-map)

Similar to with-fns. Other parameters match pegasus. The final result is assumed to be the value of the root map that pegasus would have returned.

self-check clj

(self-check)

This ensures that grammar-grammar is a valid grammar. It attempts to parse itself. While not every part of valid grammars is used in grammar-grammar, it's a nice sanity check.

self-check-fastest clj

(self-check-fastest)

This returns the fastest time to read each character of grammar-grammar

validate clj

(validate g)

Validate can help identify problems in grammars. Using grammar-grammar as the grammar for valid grammars, it will return nil if the given grammar 'g' is not valid.

with-fns clj

(with-fns g fn-map)

(with-fns g fn-map fn-type)

Simplifies attaching 'post-processing' functions to Non-Terminals in the grammar. Keys in 'fn-map' should match keys in the grammar 'g'. Values in 'fn-map' should be functions accepting the result of having parsed some input according to the related value in 'g'.

wrap-string clj

(wrap-string s)

(wrap-string s j)

Reifies IAmotoen around a string 's', possibly at a given starting point 'j'. The function 'charAt' is part of the mechanism to walk through the string.