1 Replies - 1037 Views - Last Post: 27 May 2014 - 04:23 AM

#1 sillettig  Icon User is offline

  • New D.I.C Head

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

Implement a parser - Turing complete programming languages

Posted 27 May 2014 - 04:21 AM

(This is the same post of one in the section "other languages", i've just realize that i posted it on the wrong section, i'm sorry!")
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 implement 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!


Is This A Good Question/Topic? 0
  • +

Replies To: Implement a parser - Turing complete programming languages

#2 Atli  Icon User is offline

  • D.I.C Lover
  • member icon

Reputation: 3710
  • View blog
  • Posts: 5,958
  • Joined: 08-June 10

Re: Implement a parser - Turing complete programming languages

Posted 27 May 2014 - 04:23 AM

Duplicate thread closed. Do not open more than one thread for the same topic.
If you post in the wrong section, use the "Report" button to ask that it be moved.
Was This Post Helpful? 0
  • +
  • -

Page 1 of 1