🏷️ LIMITED TIME OFFER: GET 20% OFF GRADE+ YEARLY SUBSCRIPTION →
Log in
HomeClass Notes1,200,000CA670,000

CMPUT174 Lecture Notes - Computer Language

17 views1 pages
azurepug38
5 Feb 2023
School
University of Alberta
Department
Computing Science
Course
CMPUT174
Professor

For unlimited access to Class Notes, a Class+ subscription is required.

ceruleanzebra152 and 30 others unlocked
CMPUT174 Full Course Notes
25
CMPUT174 Full Course Notes
Verified Note
25 documents

Document Summary

Syntax - the structure of statements in a computer language. Syntax defines the structure or format of python statements. Token is apart of a phrase which is apart of a sentence must be. To be useful both natural language sentences and python statement mist be semantically valid in addition of being syntactically valid. Terminal state is a state that represents a single token. Non-terminal state is a state that does not represent a single token. Accepting state - a state that has a double boarder. One terminal accepting state is a identifier token. One terminal accepting state is a literal token. One terminal accepting state which is a set of 3 specific keyword tokens(true, false, Non-terminal state - rectangle(requires its own syntax diagram) Accepting state - rounded rectangle with double boarder.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Documents

CMPUT174
Final Exam
Study Guide
CMPUT174 Study Guide - Midterm Guide: Assembly Language, Multiplication Operator, Decimal Mark
cyangoat917
CMPUT174
Final Exam
Study Guide
CMPUT174 Study Guide - Quiz Guide: Pygame, Frame Rate, Operand
cerisegiraffe538
ENGINEER 1D04 Lecture Notes - Lecture 12: Local Variable, Selection Sort, Bubble Sort
harlequinworm769

Related Questions

  1. Complete the following problem using concepts of STACK.
  2. If you are using JAVA, you must include the main method as well which should test your other methods and print the outputs according to the tasks.
  3. If you are using PYTHON, make sure your code has the methods invoked and proper printing statements according to the tasks.
  4. Your program will take an arithmetic expression as a string input. For Example:

     

    • “1+2*(3/4)”

     

    • “1+2*[3*3+{4–5(6(7/8/9)+10)–11+(12*8)]+14”

     

    • “1+2*[3*3+{4–5(6(7/8/9)+10)}–11+(12*8)/{13+13}]+14”

     

    Program

     

    Your program will determine whether the open brackets (the square brackets, curly braces, and the parentheses) are closed in the correct order.

     

    Outputs:

     

    Output 1

     

    1+2*(3/4)

    This expression is correct.

     

    Output 2

     

    1+2*[3*3+{4–5(6(7/8/9)+10)–11+(12*8)]+14

    This expression is NOT correct.

    Error at character # 10. ‘{‘- not closed.

     

    Output 3

     

    1+2*[3*3+{4–5(6(7/8/9)+10)}–11+(12*8)/{13+13}]+14

    This expression is correct.


    Output 4

     

    1+2]*[3*3+{4–5(6(7/8/9)+10)–11+(12*8)]+14

    This expression is NOT correct.

    Error at character # 4. ‘]‘- not opened.

    Task 1

    Solve the above problem using an array-based stack.

     

    Task 2

    Solve the above problem using a linked list-based stack.

Which expression represents a reaction rate?

5. The Boolean expression circuit shown below: represents the combinational a. X = (A.B)' + (C.D)' b. X=(A.B) + (C.DY c. X= (A.B)' + (C.D) d. X=(A.B)+(C.D)