Linux -Blue forest free software | Return to home page | Site Map | Search WWW | Contact Us |
Your current position : Homepage > Free Software > Technological exchanges >Application Programming


    

Blue Forest http://www.lslnet.com at 10:18 on June 6, 2006


Question

Definition :

A. . Variable : Begin with character set [ 'a' - 'z' and '̲'] variable can
Contain char set [ 'a' - 'z' and '̲,' '0' - '9']. Sensitive Case.
B. . Constant : Only contain the char set [ '0' - '9'], and range is 0 to
2147483647.
C. . Assignment Expression :
A. . Assign to variable constant
For example :

A1 = 1;

O Assign variable to variable

For example :

A1 = 1;

A2 = 2;

A1 = A2

A. . Assignment mark : '='
B. . Assignment separator : '; '
A. . Error (optional implementation is the point marked by *)
A. . Number format error
For example :

A1 = 1a12;

A. . Variable format error
For example :

1A1 = HUST

A. . Assignment expression format error
For example :

A1 ====== 1a12;

A1 = A2 = 1a12;



A. . * Assignment separator expected
For example :

A1 = 112

A. . *Variable Expected
For example :

= 112;

A. . *Constant Expected
For example :

A1 =;

A. . Assign error
A. . No initial value
For example :

A1 = 1;

A2 = A3

A. . Modify Constant
For example :

1 = A1;

Input :

A text file contains a set of assignment expressions.

For example :

A1 = 1;

A2 = 2;

A3 = 3;

Rated A2 =

A1 = 3;



Output
List all the variables that have the same value and the list goes on with
Their value together.

For example :

After process of the above expressions, you need output
The result like this :

[A1, A2, A3] = 3;





Requirement :

A. . Design document (English only) is required. This document should write
Before you write any code.
B. . Code should be consistent with java code convention.
C. . Program can identify and handle all the errors in definition part.




Test point :

A. . Correctness
A. . Identify all error in expression
B. . Treat expressions correctly
C. . Output correct result


A. . Reliability
A. . Processing can not be interrupted by incorrect input or other reason
B. . Heap will not overflow when big amount of expressions are processed


A. . Performance
A. . Amount of the expressions can be treated in one second


A. . Memory
A. . Memory occupied when 100,000 correct expressions are treated.

Question

His top, you help out!



 Privacy Policy  Copyright © 1999-2000 LSLNET.COM. All rights reserved. Blue Forest website owners. E-mail : Webmaster@lslnet.com