http://www.rejinpaul.com/2012/05/anna-university-revised-mayjune-2012.html

COMPILER QUESTION BANK

KCG College of Technology, Chennai-97

COMPUTER SCIENCE & ENGINEERING

CS1352-Principles of Compiler Design Question Bank

PART-B

Unit-I

1)      With a neat block diagram, explain the various phases of a compiler in detail. Assuming an expression give the output of each phase.

2)      Explain input buffering in detail.

3)      Construct a DFA for the given regular expression using subset construction method. Also minimize

the number of states ( a / b ) * a bb

4)      Explain in detail about the role of lexical analyzer with the possible error recovery actions.

5)      Explain in detail the cousins of the compiler.

6)      What are the compiler construction tools. Explain.

7)      Define regular expressions?  What are the rules that define regular expressions over alphabet E ?

8)      Write short notes on

a)      tokens, patterns and lexemes

b)      regular definitions

c)      transition diagrams.

      9)  What are Lex and Lex    specification ?  How lexical analyzer is constructed using lex? Write a

            Lex program that recognizer the tokens.

10)  Construct NFA for (a/b)* and convert into DFA.

Unit-II

1)      Construct a predictive parsing.table for the grammar

E -> E + T / F

T -> T * F / F

F -> (E) / id

      2)  Give the LALR parsing table  for the grammar.

             S -> L = R / R

             L -> * R / id

             R -> L

      3)  Consider the grammar

             E -> TE’

             E’ -> + TE’ / E

             T -> FT’

             T’ -> *FT’ / E

             F -> (E) / id

             Construct a predictive parsing table for the grammar shown above. Verify whether the input string

             id + id * id is accepted by the grammar or not.

       4) Consider the grammar.

             E -> E + T

             E -> T

             T -> T * F

             T -> F

             F -> (E) / id

             Construct an LR parsing table for the above grammar. Give the moves of the LR parser on

             id * id + id

         5) For the grammar given below, calculate the operator   precedence  relation and

                      the precedence functions

              E -> E + E | E – E |

              | E * E | E | E |

              | E ^ E | (E) |

              | -E | id

          6) Compare top down parsing and bottom up parsing methods.

          7) What are LR parsers? Explain with a diagram the LR parsing algorithm.

         8) What are parser generators?

         9) Explain recursive   descent   parser with appropriate examples.

        10) Compare SLR, LALR and LR parses.

Unit-III

1)      How would you generate intermediate coder for the flow of control statements? Explain with examples.

2)      Explain various data structures used for symbol table construction. Compare them.

3)      Explain about the different types of three address statements.

4)      What are the methods of translating Boolean expressions.

5)      What is back batching? Explain with an example.

6)      Explain procedure call with an example.

7)      How assignment statements are translated into three address code?

8)      Explain how declarations are done in a procedure using syntax directed translations.

9)      What is a three address code? Mention its types. How would you implement these address statements? Explain with suitable examples.

10)  Write syntax directed translation for arrays.

Unit-IV

1)      Discuss in detail about the run time storage arrangement.

2)      What are different storage allocation strategies. Explain.

3)      Write in detail about the issues in the design of code generator.

4)      Discuss briefly about DAG

5)      Explain in detail about primary structure processing transformations  of basic

Unit-V

1)      Explain in detail about principal sources of optimization.

2)      Describe in detail the optimization of basic blocks with an example.

3)      Explain in detail various methods of passing parameters

4)      Explain   peep hole optimization with suitable examples.

5)      What are activation trees? Construct an activation tree for quick sort. Example.

6)      What are the questions to be asked to understand how a compiler    must organize its storage and bind names.

7)      What is an activation record? What are its fields represent?

8)      Write about data flow analysis of structured program.

9)      What do you me an by machine dependent and machine independent optimizations?

10)   Give an algorithm to construct DAG from given basic block.

COMPILER 2 MARKS

Compiler Design - Set 1

1. What is a compiler?

A compiler is a program that reads a program written in one language –the source language and translates it into an equivalent program in another language-the target language. The compiler reports to its user the presence of errors in the source program.

2. What are the two parts of a compilation? Explain briefly.

Analysis and Synthesis are the two parts of compilation.

The analysis part breaks up the source program into constituent pieces and creates an intermediate representation of the source program.

The synthesis part constructs the desired target program from the intermediate representation.

3. List the subparts or phases of analysis part.

Analysis consists of three phases:

• Linear Analysis.
• Hierarchical Analysis.
• Semantic Analysis.

4. Depict diagrammatically how a language is processed.

Skeletal source program

↓

Preprocessor

↓

Source program

↓

Compiler

↓

Target assembly program

↓

Assembler

↓

Relocatable machine code

↓

Loader/ link editor ←library, relocatable object files

↓

Absolute machine code

5. What is linear analysis?

Linear analysis is one in which the stream of characters making up the source program is read from left to right and grouped into tokens that are sequences of characters having a collective meaning.

Also called lexical analysis or scanning.

6. List the various phases of a compiler.

The following are the various phases of a compiler:

• Lexical Analyzer
• Syntax Analyzer
• Semantic Analyzer
• Intermediate code generator
• Code optimizer
• Code generator

7. What are the classifications of a compiler?

Compilers are classified as:

· Single- pass

· Multi-pass

· Load-and-go

· Debugging or optimizing

8. What is a symbol table?

A symbol table is a data structure containing a record for each identifier, with fields for the attributes of the identifier. The data structure allows us to find the record for each identifier quickly and to store or retrieve data from that record quickly.

Whenever an identifier is detected by a lexical analyzer, it is entered into the symbol table. The attributes of an identifier cannot be determined by the lexical analyzer.

9. Mention some of the cousins of a compiler.

Cousins of the compiler are:

· Preprocessors

· Assemblers

· Loaders and Link-Editors

10. List the phases that constitute the front end of a compiler.

The front end consists of those phases or parts of phases that depend primarily on the source language and are largely independent of the target machine. These include

· Lexical and Syntactic analysis

· The creation of symbol table

· Semantic analysis

· Generation of intermediate code

A certain amount of code optimization can be done by the front end as well. Also includes error handling that goes along with each of these phases.

11. Mention the back-end phases of a compiler.

The back end of compiler includes those portions that depend on the target machine and generally those portions do not depend on the source language, just the intermediate language. These include

· Code optimization

· Code generation, along with error handling and symbol- table operations.

12. Define compiler-compiler.

Systems to help with the compiler-writing process are often been referred to as compiler-compilers, compiler-generators or translator-writing systems.

Largely they are oriented around a particular model of languages , and they are suitable for generating compilers of languages similar model.

13. List the various compiler construction tools.

The following is a list of some compiler construction tools:

· Parser generators

· Scanner generators

· Syntax-directed translation engines

· Automatic code generators

· Data-flow engines

14. Differentiate tokens, patterns, lexeme.

· Tokens- Sequence of characters that have a collective meaning.

· Patterns- There is a set of strings in the input for which the same token is produced as output. This set of strings is described by a rule called a pattern associated with the token

· Lexeme- A sequence of characters in the source program that is matched by the pattern for a token.

15. List the operations on languages.

· Union - L U M ={s | s is in L or s is in M}

· Concatenation – LM ={st | s is in L and t is in M}

· Kleene Closure – L* (zero or more concatenations of L)

· Positive Closure – L+ ( one or more concatenations of L)

16. Write a regular expression for an identifier.

An identifier is defined as a letter followed by zero or more letters or digits.

The regular expression for an identifier is given as

letter (letter | digit)*

17. Mention the various notational shorthands for representing regular expressions.

· One or more instances (+)

· Zero or one instance (?)

· Character classes ([abc] where a,b,c are alphabet symbols denotes the regular expressions a | b | c.)

· Non regular sets

18. What is the function of a hierarchical analysis?

Hierarchical analysis is one in which the tokens are grouped hierarchically into nested collections with collective meaning.

Also termed as Parsing.

19. What does a semantic analysis do?

Semantic analysis is one in which certain checks are performed to ensure that components of a program fit together meaningfully.

Mainly performs type checking.

20. List the various error recovery strategies for a lexical analysis.

Possible error recovery actions are:

· Panic mode recovery

· Deleting an extraneous character

· Inserting a missing character

· Replacing an incorrect character by a correct character

· Transposing two adjacent characters

Compiler Design - Set 2

1. Define parser.

Hierarchical analysis is one in which the tokens are grouped hierarchically into nested collections with collective meaning.

Also termed as Parsing.

2. Mention the basic issues in parsing.

There are two important issues in parsing.

· Specification of syntax

· Representation of input after parsing.

3. Why lexical and syntax analyzers are separated out?

Reasons for separating the analysis phase into lexical and syntax analyzers:

• Simpler design.
• Compiler efficiency is improved.
• Compiler portability is enhanced.

4. Define a context free grammar.

A context free grammar G is a collection of the following

· V is a set of non terminals

· T is a set of terminals

· S is a start symbol

· P is a set of production rules

G can be represented as G = (V,T,S,P)

Production rules are given in the following form

Non terminal → (V U T)*

5. Briefly explain the concept of derivation.

Derivation from S means generation of string w from S. For constructing derivation two things are important.

i) Choice of non terminal from several others.

ii) Choice of rule from production rules for corresponding non terminal.

Instead of choosing the arbitrary non terminal one can choose

i) either leftmost derivation – leftmost non terminal in a sentinel form

ii) or rightmost derivation – rightmost non terminal in a sentinel form

6. Define ambiguous grammar.

A grammar G is said to be ambiguous if it generates more than one parse tree for some sentence of language L(G).

i.e. both leftmost and rightmost derivations are same for the given sentence.

7. What is a operator precedence parser?

A grammar is said to be operator precedence if it possess the following properties:

1. No production on the right side is ε.

2. There should not be any production rule possessing two adjacent non terminals at the right hand side.

8. List the properties of LR parser.

1. LR parsers can be constructed to recognize most of the programming languages for which the context free grammar can be written.

2. The class of grammar that can be parsed by LR parser is a superset of class of grammars that can be parsed using predictive parsers.

3. LR parsers work using non backtracking shift reduce technique yet it is efficient one.

9. Mention the types of LR parser.

· SLR parser- simple LR parser

· LALR parser- lookahead LR parser

· Canonical LR parser

10. What are the problems with top down parsing?

The following are the problems associated with top down parsing:

· Backtracking

· Left recursion

· Left factoring

· Ambiguity

11. Write the algorithm for FIRST and FOLLOW.

FIRST

1. If X is terminal, then FIRST(X) IS {X}.

2. If X → ε is a production, then add ε to FIRST(X).

3. If X is non terminal and X → Y1,Y2..Yk is a production, then place a in FIRST(X) if for some i , a is in FIRST(Yi) , and ε is in all of FIRST(Y1),…FIRST(Yi-1);

FOLLOW

1. Place $ in FOLLOW(S),where S is the start symbol and $ is the input right endmarker.

2. If there is a production A → αBβ, then everything in FIRST(β) except for ε is placed in FOLLOW(B).

3. If there is a production A → αB, or a production A→ αBβ where FIRST(β) contains ε , then everything in FOLLOW(A) is in FOLLOW(B).

12. List the advantages and disadvantages of operator precedence parsing.

Advantages

This typeof parsing is simple to implement.

Disadvantages

1. The operator like minus has two different precedence(unary and binary).Hence it is hard to handle tokens like minus sign.

2. This kind of parsing is applicable to only small class of grammars.

13. What is dangling else problem?

Ambiguity can be eliminated by means of dangling-else grammar which is show below:

stmt → if expr then stmt

| if expr then stmt else stmt

| other

14. Write short notes on YACC.

YACC is an automatic tool for generating the parser program.

YACC stands for Yet Another Compiler Compiler which is basically the utility available from UNIX.

Basically YACC is LALR parser generator.

It can report conflict or ambiguities in the form of error messages.

15. What is meant by handle pruning?

A rightmost derivation in reverse can be obtained by handle pruning.

If w is a sentence of the grammar at hand, then w = γn, where γn is the nth right-sentential form of some as yet unknown rightmost derivation

S = γ0 => γ1…=> γn-1 => γn = w

16. Define LR(0) items.

An LR(0) item of a grammar G is a production of G with a dot at some position of the right side. Thus, production A → XYZ yields the four items

A→.XYZ

A→X.YZ

A→XY.Z

A→XYZ.

17. What is meant by viable prefixes?

The set of prefixes of right sentential forms that can appear on the stack of a shift-reduce parser are called viable prefixes. An equivalent definition of a viable prefix is that it is a prefix of a right sentential form that does not continue past the right end of the rightmost handle of that sentential form.

18. Define handle.

A handle of a string is a substring that matches the right side of a production, and whose reduction to the nonterminal on the left side of the production represents one step along the reverse of a rightmost derivation.

A handle of a right – sentential form γ is a production A→β and a position of γ where the string β may be found and replaced by A to produce the previous right-sentential form in a rightmost derivation of γ. That is , if S =>αAw =>αβw,then A→β in the position following α is a handle of αβw.

19. What are kernel & non-kernel items?

Kernel items, whish include the initial item, S'→ .S, and all items whose dots are not at the left end.

Non-kernel items, which have their dots at the left end.

20. What is phrase level error recovery?

Phrase level error recovery is implemented by filling in the blank entries in the predictive parsing table with pointers to error routines. These routines may change, insert, or delete symbols on the input and issue appropriate error messages. They may also pop from the stack.

Compiler Design - Set 3

1. What are the benefits of intermediate code generation?
• A Compiler for different machines can be created by attaching different back end to the existing front ends of each machine.
• A Compiler for different source languages can be created by proving different front ends for corresponding source languages t existing back end.
• A machine independent code optimizer can be applied to intermediate code in order to optimize the code generation.

2. What are the various types of intermediate code representation?

There are mainly three types of intermediate code representations.

· Syntax tree

· Posix

· Three address code

3. Define backpatching.

Backpatching is the activity of filling up unspecified information of labels using appropriate semantic actions in during the code generation process.In the semantic actions the functions used are mklist(i),merge_list(p1,p2) and backpatch(p,i)

4. Mention the functions that are used in backpatching.

· mklist(i) creates the new list. The index i is passed as an argument to this function where I is an index to the array of quadruple.

· merge_list(p1,p2) this function concatenates two lists pointed by p1 and p2. It returns the pointer to the concatenated list.

· backpatch(p,i) inserts i as target label for the statement pointed by pointer p.

5. What is the intermediate code representation for the expression a or b and not c?

The intermediate code representation for the expression a or b and not c is the three address sequence

t1 := not c

t2 := b and t1

t3 := a or t2

6. What are the various methods of implementing three address statements?

The three address statements can be implemented using the following methods.

· Quadruple : a structure with atmost four fields such as operator(OP),arg1,arg2,result.

· Triples : the use of temporary variables is avoided by referring the pointers in the symbol table.

· Indirect triples : the listing of triples has been done and listing pointers are used instead of using statements.

7. Give the syntax-directed definition for if-else statement.

1. S → if E then S1

E.true := new_label()

E.false :=S.next

S1.next :=S.next

S.code :=E.code | | gen_code(E.true ‘: ‘) | | S1.code

2. S → if E then S1 else S2

E.true := new_label()

E.false := new_label()

S1.next :=S.next

S2.next :=S.next

S.code :=E.code | | gen_code(E.true ‘: ‘) | | S1.code| | gen_code(‘go to’,S.next) | |gen_code(E.false ‘:’) | | S2.code

Compiler Design - Set 4

1. Mention the properties that a code generator should possess.

· The code generator should produce the correct and high quality code. In other words, the code generated should be such that it should make effective use of the resources of the target machine.

· Code generator should run efficiently.

2. List the terminologies used in basic blocks.

· Define and use – the three address statement a:=b+c is said to define a and to use b and c.

· Live and dead – the name in the basic block is said to be live at a given point if its value is used after that point in the program. And the name in the basic block is said to be dead at a given point if its value is never used after that point in the program.

3. What is a flow graph?

A flow graph is a directed graph in which the flow control information is added to the basic blocks.

· The nodes to the flow graph are represented by basic blocks

· The block whose leader is the first statement is called initial block.

· There is a directed edge from block B1 to block B2 if B2 immediately follows B1 in the given sequence. We can say that B1 is a predecessor of B2.

4. What is a DAG? Mention its applications.

Directed acyclic graph(DAG) is a useful data structure for implementing transformations on basic blocks.

DAG is used in

· Determining the common sub-expressions.

· Determining which names are used inside the block and computed outside the block.

· Determining which statements of the block could have their computed value outside the block.

· Simplifying the list of quadruples by eliminating the common su-expressions and not performing the assignment of the form x := y unless and until it is a must.

5. Define peephole optimization.

Peephole optimization is a simple and effective technique for locally improving target code. This technique is applied to improve the performance of the target program by examining the short sequence of target instructions and replacing these instructions by shorter or faster sequence.

6. List the characteristics of peephole optimization.

· Redundant instruction elimination

· Flow of control optimization

· Algebraic simplification

· Use of machine idioms

7. How do you calculate the cost of an instruction?

The cost of an instruction can be computed as one plus cost associated with the source and destination addressing modes given by added cost.

MOV R0,R1 1

MOV R1,M 2

SUB 5(R0),*10(R1) 3

8. What is a basic block?

A basic block is a sequence of consecutive statements in which flow of control enters at the beginning and leaves at the end without halt or possibility of branching.

Eg. t1:=a*5

t2:=t1+7

t3:=t2-5

t4:=t1+t3

t5:=t2+b

9. How would you represent the following equation using DAG?

a:=b*-c+b*-c

Compiler Design - Set 5

1. Mention the issues to be considered while applying the techniques for code optimization.

· The semantic equivalence of the source program must not be changed.

· The improvement over the program efficiency must be achieved without changing the algorithm of the program.

2. What are the basic goals of code movement?
• To reduce the size of the code i.e. to obtain the space complexity.
• To reduce the frequency of execution of code i.e. to obtain the time complexity.

3. What do you mean by machine dependent and machine independent optimization?

· The machine dependent optimization is based on the characteristics of the target machine for the instruction set used and addressing modes used for the instructions to produce the efficient target code.

· The machine independent optimization is based on the characteristics of the programming languages for appropriate programming structure and usage of efficient arithmetic properties in order to reduce the execution time.

4. What are the different data flow properties?

· Available expressions

· Reaching definitions

· Live variables

· Busy variables

5. List the different storage allocation strategies.

The strategies are:

· Static allocation

· Stack allocation

· Heap allocation

6. What are the contents of activation record?

The activation record is a block of memory used for managing the information needed by a single execution of a procedure. Various fields f activation record are:

· Temporary variables

· Local variables

· Saved machine registers

· Control link

· Access link

· Actual parameters

· Return values

7. What is dynamic scoping?

In dynamic scoping a use of non-local variable refers to the non-local data declared in most recently called and still active procedure. Therefore each time new findings are set up for local names called procedure. In dynamic scoping symbol tables can be required at run time.

8. Define symbol table.

Symbol table is a data structure used by the compiler to keep track of semantics of the variables. It stores information about scope and binding information about names.

9. What is code motion?

Code motion is an optimization technique in which amount of code in a loop is decreased. This transformation is applicable to the expression that yields the same result independent of the number of times the loop is executed. Such an expression is placed before the loop.

10. What are the properties of optimizing compiler?

The source code should be such that it should produce minimum amount of target code.

There should not be any unreachable code.

Dead code should be completely removed from source language.

The optimizing compilers should apply following code improving transformations on source language.

i) common subexpression elimination

ii) dead code elimination

iii) code movement

iv) strength reduction

11. What are the various ways to pass a parameter in a function?

· Call by value

· Call by reference

· Copy-restore

· Call by name

12. Suggest a suitable approach for computing hash function.

Using hash function we should obtain exact locations of name in symbol table.

The hash function should result in uniform distribution of names in symbol table.

The hash function should be such that there will be minimum number of collisions. Collision is such a situation where hash function results in same location for storing the names.

that have been added to the new OS. Just keep this quick reference handy to speed common Windows 7 tasks. 

  Note: The Windows key ( ) is located between the Ctrl and Alt keys on most keyboards. However, some vendor 

keyboards and laptops don't have this key. The Application key ( ) is adjacent to the right Windows key or in 

the upper-right corner on some laptop keyboards. 

The shortcuts 

Keystroke  Function 

  Opens the Start menu 

 + E  Opens Computer 

 + R  Opens the Run dialog box 

 + F  Opens Search 

 + U Opens Ease Of Access Center 

 + X Open Windows Mobility Center 

 + Ctrl + F Opens the Find Computers dialog box 

 + Pause/Break Open the System page 

 + P Chooses a Network Projector presentation display mode 

 + 1..0 Launches a program pinned on the Taskbar in the position indicated by the 

number; or accesses a running program on the Taskbar in the position 

indicated by the number 

 + Shift + 1..0 Launches a new instance of a program pinned on the Taskbar in the position 

indicated by the number 

 + Ctrl + 1..0 Accesses the last active instance of a program pinned on the Taskbar in the 

position indicated by the number 

 + Alt + 1..0 Accesses the Jump List of a program pinned on the Taskbar in the position 

indicated by the number 

 + B  Selects the first item in the Notification Area; use the arrow keys to cycle 

through the items and press Enter to open the selected item. 

100 keyboard shortcuts for moving faster in Windows 7 

 + Ctrl + B Accesses the program that is displaying a message in the Notification Area 

 + T  Cycles through the items on the Taskbar 

 + M Minimizes all windows 

 + Shift + M Restores all minimized windows 

 + D Show/Hide Desktop (minimizes/restores all windows) 

 + L Locks the computer 

 + Tab Accesses Windows Flip 3D and cycles forward through open programs 

 + Shift + Tab Accesses Windows Flip 3D and cycles backward through open programs 

 + Ctrl + Tab Opens Windows Flip 3D as a stationary object; use the arrow keys to cycle 

through open programs and press Enter to access the selected program. 

 + Spacebar Preview Desktop (makes all open windows transparent) 

 + G Cycles through gadgets 

 + Up Arrow Maximizes the current window 

 + Down Arrow Minimizes/restores the current window 

 + Home Minimizes all but the current window 

 + Left Arrow Tiles the window on the left side of the screen 

 + Right Arrow Tiles the window on the right side of the screen 

 + Shift + Up Arrow Extends the current window from the top to the bottom of the screen 

 + Shift + Left/Right Arrow Moves the current window from one monitor to the next 

 + F1 Launches Windows Help And Support 

Alt  Displays hidden Menu Bar 

Alt + D  Selects the Address Bar 

Alt + P  Displays the Preview Pane in Windows Explorer 

Alt + Tab  Cycles forward through open windows 

Alt + Shift + Tab  Cycles backward through open windows 

100 keyboard shortcuts for moving faster in Windows 7 

Alt + F4  Closes the current window; opens the Shut Down Windows dialog box from 

the Desktop 

Alt + Spacebar  Accesses the shortcut menu for the current window 

Alt + Esc  Cycles between open programs in the order they were opened 

Alt + Enter  Opens the Properties dialog box of the selected item 

Alt + PrtScn  Takes a screen shot of the active window and places it on the Clipboard 

Alt + Up Arrow  Moves up one folder level in Windows Explorer (like the Up Arrow in XP) 

Alt + Left Arrow  Displays the previous folder 

Alt + Right Arrow  Displays the next folder 

Shift + Insert CD/DVD  Loads CD/DVD without triggering Autoplay or Autorun 

Shift + Delete  Permanently deletes the item (rather than sending it to the Recycle Bin) 

Shift + F6  Cycles backward through the elements in a window or dialog box 

Shift + F10  Accesses the context menu for the selected item 

Shift + Tab  Cycles backward through the elements in a window or dialog box 

Shift + Click  Selects a consecutive group of items 

Shift + Click on a Taskbar button  Launches a new instance of a program 

Shift + Right-click on a Taskbar 

button 

Accesses the context menu for the selected item 

Ctrl + A  Selects all items 

Ctrl + C  Copies the selected item 

Ctrl + X  Cuts the selected item 

Ctrl + V  Pastes the selected item 

Ctrl + D  Deletes the selected item 

Ctrl + Z  Undoes an action 

Ctrl + Y  Redoes an action 

Ctrl + N  Opens a new window in Windows Explorer 

Ctrl + W  Closes the current window in Windows Explorer 

100 keyboard shortcuts for moving faster in Windows 7 

Ctrl + E  Selects the Search box in the upper-right corner of a window 

Ctrl + Shift + N  Creates a new folder 

Ctrl + Esc  Opens the Start menu 

Ctrl + Shift + Esc  Opens the Windows Task Manager 

Ctrl + Alt + Tab  Uses arrow keys to cycle through open windows 

Ctrl + Alt + Delete  Accesses the Windows Security screen 

Ctrl + Mouse scroll wheel  Changes the icon size on the desktop or the Views setting in Windows 

Explorer  

Ctrl + Click  Selects multiple individual items 

Ctrl + Click and drag an item  Copies that item in the same folder 

Ctrl + Shift + Click and drag an 

item 

Creates a shortcut for that item in the same folder 

Ctrl + Tab   Moves forward through tabs 

Ctrl + Shift + Tab  Moves backward through tabs 

Ctrl + Shift + Click on a Taskbar 

button 

Launches a new instance of a program as an Administrator 

Ctrl + Click on a grouped Taskbar 

button 

Cycles through the instances of a program in the group 

F1  Displays Help 

F2  Renames a file 

F3  Opens Search 

F4  Displays the Address Bar list 

F5  Refreshes the display 

F6  Cycles forward through the elements in a window or dialog box 

F7  Displays the command history in a Command Prompt 

F10  Displays hidden Menu Bar 

F11  Toggles full screen display 

Tab  Cycles forward through the elements in a window or dialog box 

100 keyboard shortcuts for moving faster in Windows 7 

PrtScn  Takes a screen shot of the entire screen and places it on the Clipboard 

  (Application Key)  Accesses the context menu for the selected item 

Home  Moves to the top of the active window 

End  Moves to the bottom of the active window 

Delete  Deletes the selected item 

Backspace  Displays the previous folder in Windows Explorer; moves up one folder level 

in the Open or Save dialog box 

Esc  Closes a dialog box 

Num Lock Enabled + Plus (+)  Displays the contents of the selected folder 

Num Lock Enabled + Minus (-)  Collapses the selected folder 

Num Lock Enabled + Asterisk (*)  Expands all subfolders under the selected folder 

Press Shift 5 times  Turns StickyKeys on or off 

Hold down right Shift for 8 

seconds 

Turns FilterKeys on or off 

Hold down Num Lock for 5 

seconds 

Turns ToggleKeys on or off 

 

 

Additional shortcut lists 

  50+ keyboard shortcuts for moving faster in Windows XP 

  76 keyboard shortcuts for moving faster in Windows Vista 

  Microsoft Word 2003 keyboard shortcuts 

  85 keyboard shortcuts for moving faster in Microsoft Excel 

  70+ Keyboard shortcuts to move faster in Microsoft Access 

  50+ Keyboard shortcuts to move faster in Microsoft PowerPoint