Find Jobs
Hire Freelancers

DCG parsing using transformation rules and avoiding left recursion

$30-250 USD

Completed
Posted over 9 years ago

$30-250 USD

Paid on delivery
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.
Project ID: 6858668

About the project

1 proposal
Remote project
Active 9 yrs ago

Looking to make some money?

Benefits of bidding on Freelancer

Set your budget and timeframe
Get paid for your work
Outline your proposal
It's free to sign up and bid on jobs
Awarded to:
User Avatar
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.
$100 USD in 3 days
5.0 (8 reviews)
3.5
3.5

About the client

Flag of UNITED STATES
Omaha, United States
5.0
2
Payment method verified
Member since Dec 12, 2014

Client Verification

Other jobs from this client

Posix Project
$30-250 USD
Thanks! We’ve emailed you a link to claim your free credit.
Something went wrong while sending your email. Please try again.
Registered Users Total Jobs Posted
Freelancer ® is a registered Trademark of Freelancer Technology Pty Limited (ACN 142 189 759)
Copyright © 2024 Freelancer Technology Pty Limited (ACN 142 189 759)
Loading preview
Permission granted for Geolocation.
Your login session has expired and you have been logged out. Please log in again.