Purchase Solution

Recognize Digit String Surrounded by Optional White Spaces

Not what you're looking for?

Ask Custom Question

Char line [MAXLINE];
int error,;
do {
printf("Input a positive integer: ");
fgets(line, MAXLINE,stdin);
error=sscanf(line,"%d",&n) !=1II n<=0;
if(error)
printf("|nERROR:Do it again.n");
} while(error);

Purchase this Solution
Solution Preview

I assume that you do it in C (so the code looks).

An example of how to modify the code to do what you request is given below.

In case you do it in Visual Studio, I also attach a whole VS6 project in the zip file (it can easily be modified for VS7 and VS8, if needed).
It is worth to look into it in any case, as some of the characters used in ...

Purchase this Solution
Free BrainMass Quizzes
Basic UNIX commands

Use this quiz to check your knowledge of a few common UNIX commands. The quiz covers some of the most essential UNIX commands and their basic usage. If you can pass this quiz then you are clearly on your way to becoming an effective UNIX command line user.

Javscript Basics

Quiz on basics of javascript programming language.

C++ Operators

This quiz tests a student's knowledge about C++ operators.

Word 2010: Table of Contents

Ever wondered where a Table of Contents in a Word document comes from? Maybe you need a refresher on the topic? This quiz will remind you of the keywords and options used when working with a T.O.C. in Word 2010.

Inserting and deleting in a linked list

This quiz tests your understanding of how to insert and delete elements in a linked list. Understanding of the use of linked lists, and the related performance aspects, is an important fundamental skill of computer science data structures.

View More Free Quizzes
Related BrainMass Solutions

  • UNIX COMMANDS

    In our example, we want to make the string "ederic" following "Fred" optional, we don't just want one optional character. An expression surrounded by "escaped" parentheses is treated by a single character. Example Fred\(eric\)\?

  • BNF grammar and parse tree

    Assume that contains an optional + sign followed by exactly 2 decimal digits, the first of which cannot be a 0. Thus 23, +91, and +40 are legal, but 9, +01, and 123 are not. Using this grammar, show a parse tree for the value +90. 2.

  • Strings recognized by deterministic finite-state automaton

    these results, we find that the machine recognizes the strings in (a), (c), and (d), but it does not recognize the string in (b). -------------------------------------------------------------- For each string, every step which is executed by the automaton

  • C project for Students Scores

    The number of optional fields is determined by the Publications field: if the student has published 0 papers, there are no optional fields; if the student has published 1 paper, there is 1 optional field; and if the student has published 2 papers, there

  • How many r-digit ternary sequences are there in which...

    So, if the first digit is 0 or 1, then remaining n-1 digits can be any ternary string with no 22's, if the first digit is 2, then second digit is 0 or 1 and remaining n-2 can be any ternary string with no two 22's.

  • how to convert a octal value for UNIX file permissions to a text value

    Your algorithm may look something like the following for each digit beginning from MSB if digit = 7 then string += rwx else if digit = 6 then string += rw- else if digit = 5 string += r-x else if digit = 4 string += r-- else if digit =

  • Algorithm to validate a US phone number (xxx) xxx-xxxx

    The algorithm should accept any string in the form (xxx) xxx-xxxx, where x represents a digit and the other characters represent themselves, and reject all others.

  • Webpage - Strings

    198221 Webpage - Strings Define a function named Classify that takes a string as input and then determines whether the string is a single word (containing no spaces) or a phrase (containing one or more spaces).

  • String function evaluation and algorithm analysis

    If x is the string hrwa, what is returned by g(f(x),x)? Explain your answer and result 2) Use big-O notation to classify the traditional grade school algorithms for addition and multiplication.

View More Related Solutions