dcg - how to define (sometimes) recursive prolog trees -


i've got 2 different types of sentences parse, i'll give them simples names now. basically, have 2 parse trees

1. --> , pp  --> dv, np  2. --> tv, np 

i hope makes sense, have no idea how program in prolog without getting lots of loops! great, please let me know if can provide more information (first time using stack overflow)


Comments

Popular posts from this blog

c# - ItextSharp font color issue in ver 5.5.4+ -

jquery - Multiple issues with pushstate: history, loading, calling functions -

ios - retrievePeripherals deprecated in IOS7 how to substitude it with retrievePeripheralsWithIdentifiers -