1. The expression in the file is obviously not fully parenthesized. In fact, it may not be parenthesized at all, relying solely on the tree structure to express order of operations. Your program is not expected to insert any parentheses to clarify the expression.
2. Any reasonable operator (+, -, *, /, %, &, |, ^, etc.) which is a single character may appear in an expression. Any number that appears will consist of a single digit. Any identifier consists of a single letter.
3. The file contains nothing for the tree level below the lowest level shown. That is, there is not a series of periods to represent an unseen level below the lowest level that contains a non-period character.
4. Although the output shown in the problem description includes one space between each two symbols, it is acceptable to have no spaces between the symbols on output.
5. You are not expected to verify that the infix arithmetic expression "makes sense."
1. Each side of the property, edge of the survey, is represented by three numbers: a degree value, a minute value, and a distance value. Although these values in the sample are all whole numbers, that may not be the case in other test data.
2. There is no limit to the number of edges in the survey.
3. The distance between the starting point and the ending point must be measured in a straight line, shortest distance.
1. The size of the encrypted message is completely arbitrary. Your program should be able to handle messages of any size.
2. The MASKS.TXT file entries are always used starting with the first and going sequentially for each message character. At the 257th character of the message, the entries of MASKS.TXT are reused starting from the beginning. This also happens on the 513th character, the 769th character, the 1025th character, etc.
1. Whenever your program recognizes the keyword for a control structure, it should output the structure number, with one leading space. If the structure has a "begin" (or if the structure is "repeat"), the program should output the letter B, with no leading space. If there is no "begin", there should be no display of a B. When the "end" for a structure (or the "until") is recognized, the program should output a space, the structure number, and the letter E.
2. Records are not control structures; they do not have a "begin" but they do have an "end". They are to be ignored.
3. Your program should allow for the lexical units (continuous strings of characters) of the program to be as long as 55 characters. There are some very long variable names and data structure references in the test files.
1. Each IP address in the request file is unique.
2. No two requests have the same arrival time. This guarantees that there is only one solution schedule possible.
1. Your program should display the crossword solution in the same form as read in. That is, there should be no spaces between characters horizontally or vertically. And, an asterisk (*) should be used to represent a blackened out square.
2. Do not output the square numbers. The illustration on the back of the problem statement is simply to show you which squares should be numbered and what their numbers should be.
3. Squares are numbered left to right, top to bottom based on the rules for square numbering. The numbers start at 1 and go as far as necessary to identify all word starting places.
1. Here is an illustration of a sentence's derivation using the given grammar. The sentence is
the green dog stands by a horse .
S -> T J N P V R . S -> the J N P V R . Applying T -> the S -> the D N P V R . Applying J -> D S -> the green N P V R . Applying D -> green S -> the green dog P V R . Applying N -> dog S -> the green dog V R . Applying P -> ε S -> the green dog stands R . Applying V -> stands S -> the green dog stands E T J N . Applying R -> E T J N S -> the green dog stands by T J N . Applying E -> by S -> the green dog stands by a J N . Applying T -> a S -> the green dog stands by a N . Applying J -> ε S -> the green dog stands by a horse . Applying N -> horse
1. It is entirely possible for the fastest and second fastest paths to have the same delay time. In fact, there may be many paths whose delay is equal to the fastest. You may report any one of these paths as the fastest and any other one as the second fastest. Also, when there is a single fastest path, there may be several paths whose delay is equal to the second fastest. You may report any one of these paths as the second fastest.
2. The network is biconnected; there are no articulation points. There are at least two links to each node.
3. To be distinct, a path needs to have only one link (edge) that is different from each other path. There is no requirement that the fastest and second fastest paths use completely different links.