Mill's Algorithm

This is a discussion on Mill's Algorithm within the A Brief History of Cprogramming.com forums, part of the Community Boards category; Any of you ever tried implementing Mill's Algorithm before? An instructor of mine suggested that we try it as it ...

  1. #1
    Magically delicious LuckY's Avatar
    Join Date
    Oct 2001
    Posts
    856

    Mill's Algorithm

    Any of you ever tried implementing Mill's Algorithm before? An instructor of mine suggested that we try it as it would be a highly marketable product seeing as how know one has ever done it before (as far as he knows). Of course when I hear about something so intriguing I want to give it a go. Actually I was considering making that my thesis...
    If you are unfamiliar with Mill's Algorithm is, it defines a few steps you can perform on any code to turn it into a program with _only_ D-Structures (Dijkstra Structures are if..else, while, a single statement, and multiple statements).

  2. #2
    l'Anziano DavidP's Avatar
    Join Date
    Aug 2001
    Location
    Plano, Texas, United States
    Posts
    2,738
    I have never even heard of Mill's Algorithm before.

    It is not on the Dictionary of Algorithms website:

    http://www.nist.gov/dads/

    Do you have any websites or other sources with information on this algorithm?
    My Website

    "Circular logic is good because it is."

  3. #3
    Magically delicious LuckY's Avatar
    Join Date
    Oct 2001
    Posts
    856
    Yeah I was actually surprised to find only 2 hits when searching google for any info on it.

    The only description I know of for the algorithm is illustratory. I'm attaching a couple drawing I did. One shows how the algorithm works and the other is a homework assignment on it so you can see it in action.

    About the diagrams:
    The way you're supposed to look at it is, to start with, the entire program is a big bundle of messy wires (a circle) with a single line going in and a single line coming out. You pull on the wire at the top and see what is next in the code. One of four things gets pulled out: Square = statement, diamond = if condition, circle = some unknown code, the arrowhead at the end of an arrow from somewhere else.

    D-Structures:
    1) a single statement
    2) multiple statements
    3) if-else statement (NOT just if)
    4) while loop (NOT do-while)

    Again, the algorithm is supposed to take bad code (defined as code that uses anything other than a D-Structure) and recode it using only D-Structures.

    For example, this:
    Code:
    int main() {
      if (true)
        statement;
      return 0;
    }
    Turns into this:
    Code:
    int main() {
      bool v = true;
      while (v) {
        if (true) {
          statement;
          v = false;
        }
        else
          v = false;
      }
      return 0;
    }
    Attached Files Attached Files

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. Implement of a Fast Time Series Evaluation Algorithm
    By BiGreat in forum C Programming
    Replies: 7
    Last Post: 12-04-2007, 01:30 AM
  2. Replies: 4
    Last Post: 12-10-2006, 06:08 PM
  3. Binary Search Trees Part III
    By Prelude in forum A Brief History of Cprogramming.com
    Replies: 16
    Last Post: 10-02-2004, 03:00 PM
  4. Request for comments
    By Prelude in forum A Brief History of Cprogramming.com
    Replies: 15
    Last Post: 01-02-2004, 09:33 AM

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21