DCG parsing using transformation rules and avoiding left recursion
$30-250 USD
Ukończony
Opublikowano ponad 9 lat temu
$30-250 USD
Płatne przy odbiorze
It requires to convert the given definite clause grammar to a left recursion free grammar by applying the transformation rules.I am attaching a file which consists of input to my project in prolog and the required output . This is my project and it is based on Definitive Clause Grammar in prolog.
I have extensive experience with DCGs and Prolog, and a good scholastic background on languages implementation, so I feel I could help you with your project.
But I didn't understood completely the document, seems incomplete. so you should be prepared to further explain to me.