Save
Upgrade to remove ads
Busy. Please wait.
Log in with Clever
or
show password
Forgot Password?
Don't have an account?  Sign up 
Sign up using Clever
or
Username is available taken
show password


Make sure to remember your password. If you forget it there is no way for StudyStack to send you a reset link. You would need to create a new account. Your email address is only used to allow you to reset your password. See our Privacy Policy and Terms of Service.

Already a StudyStack user? Log In

Reset Password
Enter the associated with your account, and we'll email you a link to reset your password.
focusNode
Didn't know it?
click below
 
Knew it?
click below
Don't Know
Remaining cards (0)
Know
0:00
edit
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.

  Normal Size     Small Size show me how

Stack #4658966

QuestionAnswer
FIRST set Terminals that can appear at the start of strings derived from a non-terminal
FOLLOW set Terminals that can appear immediately after a non-terminal
Syntax analysis Compiler phase where parsing happens
Semantic analysis Compiler phase that checks meaning (types, scope, etc.)
LL(1) parsing Top-down parsing using FIRST and FOLLOW sets
ε (epsilon) Represents the empty string
$ End-of-input marker added to FOLLOW of start symbol
Control Flow Graph (CFG) Graph representing flow of execution in a program
Basic block Straight-line code with one entry and one exit
Node (CFG) Represents a basic block
Edge (CFG) Represents flow of control between blocks
Label Marker for a position in code
Pointer (label reference) Reference to a specific instruction or block
Infix expression Operator between operands (A + B)
Postfix expression Operator after operands (AB+)
Prefix expression Operator before operands (+AB)
Stack Data structure used in parsing and expression conversion
Operator precedence Priority of operators (e.g., * before +)
Associativity Direction of evaluation (left-to-right or right-to-left)
Infix to postfix rule Use stack to reorder operators
"(" handling Push to stack
")" handling Pop until "(" is found
Postfix evaluation Use stack to compute values
FIRST(A) with ε A can derive empty string
FOLLOW usage Used when production can derive ε
Parsing table Table used to decide production rules in LL(1)
Grammar Set of production rules for a language
Non-terminal Symbol that can be expanded
Terminal Symbol that appears in final strings
Derivation Process of generating strings from grammar
Leftmost derivation Expand leftmost non-terminal first
Rightmost derivation Expand rightmost non-terminal first
Ambiguous grammar Grammar with more than one parse tree for a string
Parse tree Tree representation of derivation
Created by: kreiprie
 

 



Voices

Use these flashcards to help memorize information. Look at the large card and try to recall what is on the other side. Then click the card to flip it. If you knew the answer, click the green Know box. Otherwise, click the red Don't know box.

When you've placed seven or more cards in the Don't know box, click "retry" to try those cards again.

If you've accidentally put the card in the wrong box, just click on the card to take it out of the box.

You can also use your keyboard to move the cards as follows:

If you are logged in to your account, this website will remember which cards you know and don't know so that they are in the same box the next time you log in.

When you need a break, try one of the other activities listed below the flashcards like Matching, Snowman, or Hungry Bug. Although it may feel like you're playing a game, your brain is still making more connections with the information to help you out.

To see how well you know the information, try the Quiz or Test activity.

Pass complete!
"Know" box contains:
Time elapsed:
Retries:
restart all cards