The scope of a variable x is the region of the program in which uses of x refers to its declaration. One of the basic reasons of scoping is to keep variables in different parts of program distinct from one another. Since there are only a small number of short variable names, and programmers share habits about naming of variables (e.g., i for an array index), in any program of moderate size the same variable name will be used in multiple different scopes.
Scoping is generally divided into two classes:
Static scoping is also called lexical scoping. In this scoping a variable always refers to its top level environment. This is a property of the program text and unrelated to the run time call stack. Static scoping also makes it much easier to make a modular code as programmer can figure out the scope just by looking at the code. In contrast, dynamic scope requires the programmer to anticipate all possible dynamic contexts.
In most of the programming languages including C, C++ and Java, variables are always statically (or lexically) scoped i.e., binding of a variable can be determined by program text and is independent of the run-time function call stack.
For example, output for the below program is 10, i.e., the value returned by f() is not dependent on who is calling it (Like g() calls it and has a x with value 20). f() always returns the value of global variable x.
To sum up in static scoping the compiler first searches in the current block, then in global variables, then in successively smaller scopes.
With dynamic scope, a global identifier refers to the identifier associated with the most recent environment, and is uncommon in modern languages. In technical terms, this means that each identifier has a global stack of bindings and the occurrence of a identifier is searched in the most recent binding.
In simpler terms, in dynamic scoping the compiler first searches the current block and then successively all the calling functions.
Output in a a language that uses Dynamic Scoping :
Static Vs Dynamic Scoping
In most of the programming languages static scoping is dominant. This is simply because in static scoping it’s easy to reason about and understand just by looking at code. We can see what variables are in the scope just by looking at the text in the editor.
Dynamic scoping does not care how the code is written, but instead how it executes. Each time a new function is executed, a new scope is pushed onto the stack.
Perl supports both dynamic ans static scoping. Perl’s keyword “my” defines a statically scoped local variable, while the keyword “local” defines dynamically scoped local variable.
This article is contributed by Vineet Joshi. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
- Difference between Static allocation and Stack allocation
- Difference between Static Allocation and Heap Allocation
- Shortest path in a complement graph
- Count number of Unique Triangles using Operator overloading
- Sorting algorithm visualization : Insertion Sort
- Fast Doubling method to find the Nth Fibonacci number
- Count number of ways to convert string S to T by performing K cyclic shifts
- Find the next greater element in a Circular Array
- Unique subsequences of length K with given sum
- Kth smallest or largest element in unsorted Array | Set 4
- Total number of cells covered in a matrix after D days
- Sum of absolute difference of all pairs raised to power K
- Sorting Algorithm Visualization : Quick Sort
- Sum of minimum value of x and y satisfying the equation ax + by = c