objectLambda extends ParsingREPL[Query] with Parser
Simple lambda calculus implementation to illustrate Kiama's support for
nominal rewriting. This implementation is closely based on the example
used in Scrap your Nameplate, James Cheney, ICFP 2005.
Linear Supertypes
Parser, PositionedParserUtilities, ParserUtilities, PackratParsers, ParsingREPL[Query], RegexParsers, Parsers, REPL, AnyRef, Any
Ordering
Alphabetic
By inheritance
Inherited
Hide All
Show all
Lambda
Parser
PositionedParserUtilities
ParserUtilities
PackratParsers
ParsingREPL
RegexParsers
Parsers
REPL
AnyRef
Any
Visibility
Public
All
Type Members
typeElem = Char
Definition Classes
RegexParsers → Parsers
typeInput = Reader[Elem]
Definition Classes
Parsers
abstract type_$4
Definition Classes
PackratParsers
abstract type_$4
Definition Classes
PackratParsers
abstract type_$4
Definition Classes
PackratParsers
abstract type_$5
Definition Classes
PackratParsers
abstract type_$5
Definition Classes
PackratParsers
abstract type_$5
Definition Classes
PackratParsers
abstract type_$6
Definition Classes
PackratParsers
abstract type_$6
Definition Classes
PackratParsers
abstract type_$6
Definition Classes
PackratParsers
abstract type_$7
Definition Classes
PackratParsers
abstract type_$7
Definition Classes
PackratParsers
abstract type_$7
Definition Classes
PackratParsers
abstract type_$8
Definition Classes
PackratParsers
abstract type_$8
Definition Classes
PackratParsers
abstract type_$8
Definition Classes
PackratParsers
abstract type_$9
Definition Classes
PackratParsers
abstract type_$9
Definition Classes
PackratParsers
abstract type_$9
Definition Classes
PackratParsers
Value Members
final def!=(arg0: AnyRef): Boolean
Definition Classes
AnyRef
final def!=(arg0: Any): Boolean
Definition Classes
Any
final def##(): Int
Definition Classes
AnyRef → Any
final def==(arg0: AnyRef): Boolean
Definition Classes
AnyRef
final def==(arg0: Any): Boolean
Definition Classes
Any
defOnceParser[T](f: (Input) ⇒ ParseResult[T]): Parser[T] with OnceParser[T]
(Changed in version 2.9.0) The p0 call-by-name arguments is evaluated at most once per constructed Parser object, instead of on every need that arises during parsing.
Simple lambda calculus implementation to illustrate Kiama's support for nominal rewriting. This implementation is closely based on the example used in Scrap your Nameplate, James Cheney, ICFP 2005.