U E D R , A S I H C RSS

Programming Language Class/Report2002_2

Principles of Programming Languages Spring, 2002 Programming Assignment #2

Due : May 6th, 2002

No report will be accepted after due date.
  • ν•΄λ‹Ή λ‚ μ§œ 이후 λ ˆν¬νŠΈλŠ” 받지 μ•ŠμŒ

Problem Description


Design and implement simple test programs in Visual C++(V6.0), Visual Basic(V6.0) and Java(JDK 1.4).
  • Visual C++(6.0)κ³Ό Visual Basic(6.0), Java(JDK1.4)μ—μ„œ λ””μžμΈκ³Ό κ΅¬ν˜„μ— λŒ€ν•œ κ°„λ‹¨ν•œ ν…ŒμŠ€νŠΈ


  1. To find out the maximum length of a variable name
    • λ³€μˆ˜λͺ…μ˜ μ΅œλŒ€ 길이 값을 μ°ΎκΈ°
  2. To assess the type-compatibility rule adopted by the Compilers;
    • μ»΄νŒŒμΌλŸ¬κ°€ μ μš©ν•˜λŠ” type-compatibility κ·œμΉ™(λ¬΅μ‹œμ  ν˜•λ³€ν™˜ λ”°μœ„) 에 λŒ€ν•œ 평가.
      DeleteMe) μ—¬κΈ°μ„œλŠ” name-compatibility 와 structured-compatibilityλΌ μ΄μ•ΌκΈ°ν•˜λŠ”κ²ƒ 같은데 --μ„μ²œ
  3. To evaluate the security of pointers in the Compilers;
    • μ»΄νŒŒμΌλŸ¬μ—μ„œ 포인터에 λŒ€ν•œ λ³΄μ•ˆμ„±μ— κ΄€ν•œ 평가
  4. To check the evaluation order of operands in the Compilers by raising the functional side-effects if possible;
    • λ§Œμ•½ κ°€λŠ₯ν•˜λ‹€λ©΄ functional side-effectsκ°€ λ°œμƒμ΄ μ»΄νŒŒμΌλŸ¬μ—μ„œ operand의 μˆœμ„œμ— λŒ€ν•œ 평가 μ κ²€ν•œλ‹€. -μˆ˜μ • ν•„μš”
  5. To identify a situation in which the β€œadd” operator would not be associative;
    • "add" μ—°μ‚°μž(operator)κ°€ μ“°μΌμˆ˜ μ—†λŠ” 상황에 λŒ€ν•˜μ—¬ ν™•μΈν•˜κΈ°
  6. To determine the largest and smallest positive floating point number in Intel Pentium processor.
    • Intel Pentium processor μƒμ—μ„œ μ–‘μˆ˜μΈ 뢀동 μ†Œμˆ˜μ μ˜ κ°€μž₯ 큰값과 μž‘μ€ κ°’ κ²°μ •

Output


The output should be a sequence of test programs with the results generated from them. Your grade will be highly dependent on the quality of your test programs.
  • 결과물은 주어진 것듀에 μ˜ν•΄μ„œ λ§Œλ“€μ–΄μ§€λŠ” ν…ŒμŠ€νŠΈ ν”„λ‘œκ·Έλž¨μ„ μˆœμ„œλŒ€λ‘œ μ œμΆœν•˜λΌ. 채점은 μ•„λ§ˆ ν…ŒμŠ€νŠΈ ν”„λ‘œκ·Έλž¨μ˜ ν’ˆμ§ˆμ΄ λ§Žμ€ 영ν–₯을 λΈμΉ κ²ƒμ΄λ‹€.

Hand In


As usual, you shall submit a floppy diskette with a listing of your program and a set of test data of your own choice, and the output from running your program on your test data set.
  • 보톡, floppy diskette에 λ‹Ήμ‹ μ˜ ν”„λ‘œκ·Έλž¨κ³Ό, ν…ŒμŠ€νŠΈν•œ 데이터듀과 싀행에 μ˜ν•œ κ²°κ³ΌλΌ μ œμΆœν•œλ‹€.
Be sure to design carefully your test data set to exercise your program completely. You are also recommended in your documentation to include the rationale behind your test programs.
  • ν”„λ‘œκ·Έλž¨μ˜ μ™„λ²½ν•œ μˆ˜ν–‰μ„ μœ„ν•΄μ„œ λ‹Ήμ‹ μ˜ 데슀트 λ°μ΄ν„°λΌ μ‹ μ€‘νžˆ μ„κ³„ν•˜λΌ. λ˜ν•œ λ‹Ήμ‹ μ˜ ν…ŒμŠ€νŠΈ ν”„λ‘œκ·Έλž¨ 내뢀에 ν•©λ‹Ήν•œ λ¬Έμ„œλΌ μ²¨λΆ€ν•˜λŠ” 것을 μΆ”μ²œν•œλ‹€.
In order words, explain why you design them in such a way and what you intend to demonstrate
  • λ‹€μ‹œ λ§ν•˜μ—¬, 당신이 μ™œ κ·ΈλŸ¬ν•œ λ””μžμΈμ„ ν•˜μ˜€λŠ”μ§€, μ–΄λ– ν•œ μ˜λ„λ‘œ ν•΄λ‹Ή ν…ŒμŠ€νŠΈλΌ λ§Œλ“€μ—ˆλŠ”μ§€μ— λŒ€ν•œ 논리적 μ„λͺ…을 μ²¨λΆ€ν•˜λΌ.

Valid XHTML 1.0! Valid CSS! powered by MoniWiki
last modified 2021-02-07 05:24:03
Processing time 0.0177 sec