The COBOL DFA Tool: A Work in Progress - PowerPoint PPT Presentation

1 / 11
About This Presentation
Title:

The COBOL DFA Tool: A Work in Progress

Description:

Deterministic Finite Automaton. Finite State Machine. Abstract State Machine. Moore Machine ... READ INPUT-CHAR AT END MOVE YES' TO INPUT-EMPTY. PERFORM UNTIL ... – PowerPoint PPT presentation

Number of Views:38
Avg rating:3.0/5.0
Slides: 12
Provided by: Mik4151
Category:
Tags: cobol | dfa | automaton | progress | tool | work

less

Transcript and Presenter's Notes

Title: The COBOL DFA Tool: A Work in Progress


1
The COBOL DFA ToolA Work in Progress
  • Ronald Finkbine, Ph.D.Indiana University
    SoutheastNew Albany, INrfinkbine_at_ius.edu

2
Introduction
  • Software Complexity
  • Programmer Understandability
  • Maintainability
  • Reduction by Tools
  • Reduction by Technique

3
Deterministic Finite Automaton
  • Finite State Machine
  • Abstract State Machine
  • Moore Machine
  • Mealy Machine
  • Set of states
  • Set of transitions
  • Single input

4
Elementary DFA
  • Accepts language ab
  • Incomplete

5
Benefits of DFA
  • High-reliability
  • Is DFA a proof or show?
  • Mathematics is a modeling method
  • Proofs are social constructs
  • Diagrammatics

6
DFA File Sample
  • DFACONTROL
  • START A
  • ACCEPT B
  • OUTPUT-COBOL "DFA.COB"
  • INPUT-DATA "IN.TXT"
  • OUTPUT-DATA "OUT.TXT"
  • DFACODE
  • F-BEGIN
  • DISPLAY IN F_BEGIN
  • F-END
  • DISPLAY IN F_END
  • DFASTATE
  • A A "a" F-Begin
  • A B "b" F-End

7
Produced COBOL Sample
  • F-BEGIN.
  • DISPLAY IN F-BEGIN
  • F-END.
  • DISPLAY IN F-END
  • MAIN-PARAGRAPH.
  • MOVE A TO CURRENT-STATE
  • MOVE NO TO INPUT-EMPTY
  • READ INPUT-CHAR AT END MOVE YES TO INPUT-EMPTY
  • PERFORM UNTIL INPUT-EMPTY YES
  • IF CURRENT-STATE A AND INPUT-CHAR a
    THEN
  • MOVE A TO CURRENT-STATE
  • PERFORM F-BEGIN
  • ELSE IF CURRENT-STATE A AND INPUT-CHAR
    b THEN
  • MOVE B TO CURRENT-STATE
  • PERFORM F-END
  • ELSE IF NOT ((INPUT-CHAR a) OR (INPUT-CHAR
    b)) THEN
  • MOVE ERROR TO CURRENT-STATE
  • DISPLAY BAD INPUT CHARACTER
  • ELSE

8
Fox, Grain, Chicken Problem
  • A man is crossing a river on the way to market
    with a chicken, a bag of grain and a fox. If left
    unattended the fox will eat the chicken, and the
    chicken will eat the grain. The boat will only
    hold the man and one of these at a time. Your
    task is to work out a sequence of crossings that
    will affect a safe transfer of the man, the fox,
    the chicken and the grain safely across the
    river.

9
Fox, Chicken, Grain Solution
10
Text CeFCGeC
  • Translating into English, the input string
    represents
  • Man and chicken cross river
  • Man returns with empty boat
  • Man and fox cross river
  • Man returns with chicken
  • Man and grain cross river
  • Man returns with empty boat
  • Main and chicken cross river

11
Summary
  • COBOL tool to input/produce DFA
  • Vending machine assignment
  • Not controlled experiment
  • Intro to DFA Design methodology
Write a Comment
User Comments (0)
About PowerShow.com