Role of SemiColon in various Programming Languages Last Updated : 12 Jul, 2025 Comments Improve Suggest changes Like Article Like Report Semicolon is a punctuation mark (;) indicating a pause, typically between two main clauses, that is more pronounced than that indicated by a comma. In programming, Semicolon symbol plays a vital role. It is used to show the termination of instruction in various programming languages as well, like C, C++, Java, JavaScript and Python.In this article, let us see the act of Semicolon in different programming languages: Role of Semicolon in C: Semicolons are end statements in C. The Semicolon tells that the current statement has been terminated and other statements following are new statements. Usage of Semicolon in C will remove ambiguity and confusion while looking at the code. They are not used in between the control flow statements but are used in separating the conditions in looping. for(initialization/declaration; condition; increment/decrements){ // body}Role of Semicolon in C++:Semicolon is a command in C++.The Semicolon lets the compiler know that it's reached the end of a command. Semicolon is often used to delimit one bit of C++ source code, indicating it's intentionally separated from the respective code. Usage of Semicolon in C++ is after class and structure definitions, variable declarations, function declarations, after each statement generally.Role of Semicolon in Java:Java uses Semicolon similar to C.Semicolon is a part of syntax in Java. It shows the compiler where an instruction ends and where the next instruction begins.Semicolon allows the java program to be written in one line or multiple lines, by letting the compiler know where to end the instructions.Role of Semicolon in JavaScript:Semicolons in JavaScript are optional. In JavaScript, there is a process called Automatic Semicolon Insertion (ASI) which inserts a Semicolon whenever needed but not placed.Semicolons are also used to terminate the statements.Placing the new line next to the previous line will result in valid JavaScript which will not trigger ASI to correct it. So in conditional statements like if ..else and looping statements like while, for, do-while, doesn’t require Semicolon.Role of Semicolon in Python:Python doesn’t use Semicolons but it is not restricted.In Python, Semicolon is not used to denote the end of the line. Python is called the simple coding language because there is no need to use Semicolon and if we even forget to place, it doesn’t throw an error. Sometimes Python makes use of Semicolon as line terminator where it is used as a separator to separate multiple lines.Role of Semicolon in Perl:Perl language employs Semicolon after every line, except at the end of the block. Perl lets us omit the Semicolon because it can be used as a separator rather than a terminator. Every statement in Perl is terminated with Semicolon unless it is the last line of the program.Role of Semicolon in SQL:Semicolon in SQL allows the user to execute the program in the same call by separating the statements in the database. SQL has a unique feature of adding Semicolon by default to terminate the statements. Semicolon is a statement terminator which is purely used to identify the end of a statement.Generally, by looking at the syntax, we can identify but using a Semicolon makes it more clear.Role of Semicolon in Go language:Semicolon in Go language is used to separate the initializer, condition, and continuation elements.Semicolon is added as a terminator when the line’s last token is: An integer, floating-point, imaginary or string literal one of the keywords (eg. break, continue, return etc..,)an identifier.one of the operators and delimiters like ++, --, ), ], or }Role of Semicolon in C#:C# makes use of Semicolon to get rid of ambiguity and confusion as its usage makes the code clear, structured and organised. Like other languages especially C and C++, C# also follows the same rules in the Semicolon application. The absence of Semicolon throws an error by the compiler which has to be rectified. It also lets the compiler know the end of the statement. Role of Semicolon in Scala:Semicolon plays a vital role in all the programming language by marking the end of the statement. But Semicolon in Scala, not only marks the end of the statement but also the end of the expression. Scala's syntax encourages clear and concise code, so it is necessary to use Semicolon properly whenever needed. Scala adapts different syntaxes like dot syntax, syntax using braces, syntax using parenthesis and syntax using empty line separator which replaces the use of Semicolon.Role of Semicolon in PL/I:PL/I is a language which is a series of declarations and statements. So Semicolon is necessary to separate the statements to avoid ambiguity. Statements in PL/I should be placed in separate lines with Semicolon to improve the readability. In multi-line statements, Semicolon is used to separate the lines and in a single-line statement, Semicolon is used to terminate.Role of Semicolon in Pascal:Semicolon in Pascal acts as statement separator i.e it separates two or more statements.Exactly one Semicolon should be used in separating two statements. But using more than one Semicolon (extra Semicolon) will raise an error. Unlike other languages, Pascal makes use of Semicolon in a different way. There is no need for a direct Semicolon before else in Pascal. Also, the last statement before the end of the code/program doesn’t need a Semicolon. Pascal needs Semicolon when statements are written in a sequence. Pascal doesn’t need Semicolon for a case or a block and also before the keyword. Comment More infoAdvertise with us Next Article Analysis of Algorithms S suvarnarani23 Follow Improve Article Tags : DSA Similar Reads Basics & PrerequisitesLogic Building ProblemsLogic building is about creating clear, step-by-step methods to solve problems using simple rules and principles. Itâs the heart of coding, enabling programmers to think, reason, and arrive at smart solutions just like we do.Here are some tips for improving your programming logic: Understand the pro 2 min read Analysis of AlgorithmsAnalysis of Algorithms is a fundamental aspect of computer science that involves evaluating performance of algorithms and programs. Efficiency is measured in terms of time and space.BasicsWhy is Analysis Important?Order of GrowthAsymptotic Analysis Worst, Average and Best Cases Asymptotic NotationsB 1 min read Data StructuresArray Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous 3 min read String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut 2 min read Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The 2 min read Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Hereâs the comparison of Linked List vs Arrays Linked List: 2 min read Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first 2 min read Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems 2 min read Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most 4 min read Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of 3 min read Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this 15+ min read AlgorithmsSearching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input 2 min read Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ 3 min read Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution 14 min read Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get 3 min read Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net 3 min read Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of 3 min read Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit 4 min read AdvancedSegment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree 3 min read Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i 2 min read GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br 2 min read Interview PreparationInterview Corner: All Resources To Crack Any Tech InterviewThis article serves as your one-stop guide to interview preparation, designed to help you succeed across different experience levels and company expectations. Here is what you should expect in a Tech Interview, please remember the following points:Tech Interview Preparation does not have any fixed s 3 min read GfG160 - 160 Days of Problem SolvingAre you preparing for technical interviews and would like to be well-structured to improve your problem-solving skills? Well, we have good news for you! GeeksforGeeks proudly presents GfG160, a 160-day coding challenge starting on 15th November 2024. In this event, we will provide daily coding probl 3 min read Practice ProblemGeeksforGeeks Practice - Leading Online Coding PlatformGeeksforGeeks Practice is an online coding platform designed to help developers and students practice coding online and sharpen their programming skills with the following features. GfG 160: This consists of most popular interview problems organized topic wise and difficulty with with well written e 6 min read Problem of The Day - Develop the Habit of CodingDo you find it difficult to develop a habit of Coding? If yes, then we have a most effective solution for you - all you geeks need to do is solve one programming problem each day without any break, and BOOM, the results will surprise you! Let us tell you how:Suppose you commit to improve yourself an 5 min read Like