My goal is to have this input: L = [a,b,c], build_tree(L,T). With this output: L = [1,30,kth,5], T = b(l(a),b(l(b),b(l(c)))) ?
I\'ve been trying to parse a file containing lines of integers using phrase_from_file with the grammar rules
From what I understand, in Prolog you capture features while parsing 开发者_JS百科like so: foo(feature(X)) --> [X], bar.
Can I get a recursive Prolog predicate having two arguments, called reverse, which returns the inverse of a list:
Let\'s assume that we\'re reading from standard input and building a list of all the开发者_StackOverflow中文版 lines that have been read.In the end, we need to display those lines, separated by commas
run([H|T]) --> num(H),run(T). run([T]) --> num(T). num(increase) --> [increase],{write(1),nl}.
Suppose I have a substitution S and list Xs, where each variable occurring in Xs also occurs in S. How would I find the list S(Xs), i.e., the list obtained by applying the substitution S to the list X
Consider the following Prolog code.It edits lines of a particular type in its input and prints out the remaining lines w/o any change.It uses a DCG called rule which isn\'t included below, since it\'s
If I have the following grammar: S → ε S → a S b S How do I implement it in Prolog? I tried this: isMatched([]).
Does anyone know of any examples of code written in prolog to implement a DSL to generate开发者_StackOverflow社区 perl code?DCGs might be an excellent choice!
加载中,请稍侯......