Problem ID: apl
APL is an array programming language that uses a notation invented by Ken Iverson in 1957. In this problem we consider only a small subset of the language which we call apl (that is, small APL). Each apl expression appears on a line by itself and each expression has a value, which is displayed immediately after the expression is entered. Operators in apl donot have precedence like those in C, C++, or Java, but instead are applied right to left. However, parentheses may be used to control evaluation order. Similarly, operands for binary operators are evaluated in right to left order. Here are some examples of apl expressions. var = 1 2 3 Store the vector 1 2 3 in var, replacing its previous value. The value of the expression is 1 2 3. The leftoperand of the = operator must be a variable. Display the value of var with 4 added to each of its elements (result: 5 6 7); the stored version of var is not modified. Display the value of var as if a - operator had been inserted between each of its elements on each row (result: 2). If var has two dimensions, the result is a vector. If var has three dimensions, the result is a two-dimensional array. */ and + / have analogous behaviors. Generate a vector with the values 1 2 3 4 5. Reshape the vector 1 2 3 4 into a 2 by 2 array; 1 and 2 are in the first row, and 3 and 4 are in the second row. Same result as above. Another reshaping, yielding a first row with 1 2 3 and a second row with 4 1 2; if the right argument does not have a sufficient number of elements, then the elements of the rightoperand are reused starting from the beginning, in row-major order. Result: 3 4 5. Drops the two leading elements from iota 5. Result: 3 8. Illustrates element-wise multiplication. Operands must be conformable – either they have the same shape, or at least one must be a one-element vector (see second example). Result: -3 -2. Illustrates use of parentheses. Result: 22. Illustrates evaluation ordervar + 4 - / var
iota 5 2 2 rho 1 2 3 4 2 2 rho 1 2 3 4 5 6 2 3 rho 1 2 3 4
2 drop iota 5 1 2 * 3 4
( ( a = 1 ) drop 1 2 3 ) – 5 a + ( a = 5 ) + a + ( a = 6 )
In this problem you are to write an interpreter for apl. Integers in the input are non-negative and less than 104. All computed integer values (including intermediate values) have absolute values less than 104. The number ofentries in any matrix is always less than or equal to 104. Variable names consist of one to three alphabetic lowercase characters, and the names iota, rho, and drop are always interpreted as operators. Exactly one space separates elements of statements (constants, variables, operators, and parentheses). Constants in the input are vectors. All intermediate values are one, two, or three-dimensional arrayswith positive dimensions. This restricts some operand ranges: “2 0 rho 1 2 3”, “2 3 2 1 rho 5”, and “3 drop iota 3” are illegal. The only arithmetic operators provided are + (addition), – (subtraction), and * (multiplication). Their operands are conformable as illustrated in the examples. Observe that “1 1 rho 1” and “1 rho 1” have different shapes. The operand for iota evaluates to a one-elementpositive vector. The left operand of drop evaluates to a one-element non-negative vector and its right operand evaluates to a vector. Both operands of rho evaluate to vectors.
Input The input contains several test cases, each on a line by itself. The values of variables assigned in one test case are available for use in following test cases. No expression exceeds 80 characters in length,including space characters. No test case produces an invalid result (for example, an empty vector). The last test case is followed by a line containing the single character ‘#’. Output For each test case, display a line containing the case number and the input line. Then, starting on the next line, display the result of evaluating the expression. Vectors display as a single line of integers; m× n...