FANDOM


ExampleEdit

List Prolog Interpreter is a version of Prolog that can be used to write algorithms with CAWMP  because the List Prolog algorithms are in list format.

For example:

test(7,[[n,reverse],[[1,2,3],[],[v,l]]],
[
        [[n,reverse],[[],[v,l],[v,l]]],
        [[n,reverse],[[v,l],[v,m],[v,n]],":-",
        [       [[n,head],[[v,l],[v,h]]],
                [[n,tail],[[v,l],[v,t]]],
                [[n,wrap],[[v,h],[v,h1]]],
                [[n,append],[[v,h1],[v,m],[v,o]]],
                [[n,reverse],[[v,t],[v,o],[v,n]]]
        ]
        ]
],[[[v,l], [3, 2, 1]]]).

GrammarsEdit

Definite Clause Grammars in List Prolog are like base cases, e.g.

	  [[n,compound212],["","",[v,t],[v,t]]],

and a "bottom case" in case it is not at the end of the string, e.g.:

		  [[n,compound212],[[v,u],[v,u],[v,t],[v,t]]],

given the clause:

		  [[n,compound21],[[v,t],[v,u]],"->",
		  [[[n,a]],
		  [[n,code],[[n,wrap],["a",[v,itemname1]]],
		  [[n,append],[[v,t],[v,itemname1],[v,v]]]],
		  [[n,compound212],[[v,v],[v,u]]]]],

Functional List Prolog (FLP)Edit

Predicate names and variables may be substituted for variable names, e.g. in [[n,function],[[[n,function2],[2]],1,1,[v,c]]] function2 is passed as a variable.

Strong Type StatementsEdit

FLP may optionally use strong type statements, e.g.

test_types_cases(2,[[n,function],[[v,a],[v,b],[v,c]]],
[[[n,function],[[t,number],[t,string],[t,predicatename]]]],
[
        [[n,function],[[v,a],[v,b],[v,c]],":-",
        [
                [[n,=],[[v,a],1]],
                [[n,=],[[v,b],"a"]],
                [[n,=],[[v,c],[n,a]]]
        ]]
]
,[[[[v,a], 1],[[v,b], "a"],[[v,c], [n,a]]]]).

Further Reading Edit

See also Text to Breasoning (formerly part of the List Prolog Interpreter Repository).

Community content is available under CC-BY-SA unless otherwise noted.