Scribd Logo
Unggah

Selamat datang di Scribd!

  • Assignment - Recursive Descent Parser 50 Points See Canvas For Due Date

    Diunggah oleh

    theomega76
    17 tayangan2 halaman
    This document provides an assignment to implement two classes: 1) SubstringGenerator that uses recursion to generate all substrings of a given string without using loops. 2) SubstringTester that interacts with the user to get a string, generate its substrings using SubstringGenerator, display the substrings, and repeat until the user chooses to quit. Documentation of the source code using Javadoc is also required. The zip file containing the source code should be submitted on Blackboard.

    Deskripsi Asli:

    Judul Asli

    AssignmentRecursionDescentParser.pdf

    Hak Cipta

    © © All Rights Reserved

    Format Tersedia

    PDF, TXT atau baca online dari Scribd

    Apakah menurut Anda dokumen ini bermanfaat?

    Apakah konten ini tidak pantas?

    Laporkan Dokumen Ini
    This document provides an assignment to implement two classes: 1) SubstringGenerator that uses recursion to generate all substrings of a given string without using loops. 2) SubstringTester that interacts with the user to get a string, generate its substrings using SubstringGenerator, display the substrings, and repeat until the user chooses to quit. Documentation of the source code using Javadoc is also required. The zip file containing the source code should be submitted on Blackboard.

    Hak Cipta:

    © All Rights Reserved
    Unduh sebagai PDF, TXT atau baca online dari Scribd
    Tandai sebagai konten tidak pantas
    17 tayangan2 halaman

    Assignment - Recursive Descent Parser 50 Points See Canvas For Due Date

    Diunggah oleh

    theomega76
    This document provides an assignment to implement two classes: 1) SubstringGenerator that uses recursion to generate all substrings of a given string without using loops. 2) SubstringTester that interacts with the user to get a string, generate its substrings using SubstringGenerator, display the substrings, and repeat until the user chooses to quit. Documentation of the source code using Javadoc is also required. The zip file containing the source code should be submitted on Blackboard.

    Hak Cipta:

    © All Rights Reserved
    Unduh sebagai PDF, TXT atau baca online dari Scribd
    Tandai sebagai konten tidak pantas
    dari 2

    CSCD211 Programming Principles II 11/12/2013

    Assignment Recursive Descent Parser


    50 points
    See Canvas for due date

    Implement a class called


    SubstringGenerator that uses
    recursion to generate all
    substrings of a given String.
    For example, the substrings of
    the string "Sluggo" are the 22
    strings:

    Sluggo
    Slugg
    Slug
    Slu
    Sl
    S
    luggo
    lugg
    lug
    lu
    l
    uggo
    ugg
    ug
    u
    ggo
    gg
    g
    go
    g
    o
    ""

    You are not allowed to use any loops to build the substrings -- at least in your final
    product. You may, however, find it productive to solve the problem using loops first,
    and then translate to recursive code.

    Implement a class called SubstringTester that is used to interact with the user and
    allow for testing of the SubstringGenerator class. This class should
    Get a string from the user
    Generate the substrings of the string
    CSCD211 Programming Principles II 11/12/2013

    Display the substrings


    Repeat the above three things until the user chooses to quit

    Javadoc
    Additionally, this assignment requires that you Javadoc your source code. That is,
    your source code must conform to the Javadoc documentation standards. See
    Course Documents for Javadoc examples.

    To Turn In
    Turn in all source code in a single zip file. Name your zip file as usual. Submit to
    Blackboard.

    Note
    You should not have a great deal of code for this assignment -- think about it -- its
    recursion :-)

    Anda mungkin juga menyukai