2 Replies - 1513 Views - Last Post: 27 May 2014 - 04:44 AM

#1 sillettig  Icon User is offline

  • New D.I.C Head

Reputation: 0
  • View blog
  • Posts: 4
  • Joined: 27-May 14

Programming a parser - Turing complete programming languages

Posted 27 May 2014 - 04:04 AM

Hi people, this is my first post wow :) I have a question for you. In my exam of "programming languages" i have to make a parser. My teacher asked to implement a Turing-complete language. Now, i have a little confusion in my mind about the definition of Turing-completeness. I read that a language is T. complete if it has the selection and iteration costruct, it ables you to declare variables, it has math operator and it could solve any algorithms. It is right?
Ok now my idea for the parser is to realize a programming language to handle a robot that could pick and releas things. M ispirations is the language Karel. Now i don't know if that is a Turing-complete language. I really don't know and i ask you if you can help me with it :)
Thank you!

This post has been edited by Atli: 27 May 2014 - 04:27 AM
Reason for edit:: Removed excessive text formatting. Making the text bigger won't make it any more readable.


Is This A Good Question/Topic? 0
  • +

Replies To: Programming a parser - Turing complete programming languages

#2 Atli  Icon User is offline

  • D.I.C Lover
  • member icon

Reputation: 3719
  • View blog
  • Posts: 5,991
  • Joined: 08-June 10

Re: Programming a parser - Turing complete programming languages

Posted 27 May 2014 - 04:24 AM

Moved to the Student Campus section.
Was This Post Helpful? 0
  • +
  • -

#3 sillettig  Icon User is offline

  • New D.I.C Head

Reputation: 0
  • View blog
  • Posts: 4
  • Joined: 27-May 14

Re: Programming a parser - Turing complete programming languages

Posted 27 May 2014 - 04:44 AM

Thank you, I apologize for the inconvenience!
Was This Post Helpful? 0
  • +
  • -

Page 1 of 1