Concept

Language construct

In computer programming, a language construct is a syntactically allowable part of a program that may be formed from one or more lexical tokens in accordance with the rules of the programming language. The term "language construct" is often used as a synonym for control structure. Control flow statements (such as conditionals, foreach loops, while loops, etc) are language constructs, not functions. So while (true) is a language construct, while add(10) is a function call. In PHP print is a language construct.

is the same as:

In Java a class is written in this format: public class MyClass { //Code . . . . . . } In C++ a class is written in this format: class MyCPlusPlusClass { //Code . . . .

Official source

https://en.wikipedia.org/wiki/Language_construct

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related courses (4)

CS-320: Computer language processing

We teach the fundamental aspects of analyzing and interpreting computer languages, including the techniques to build compilers. You will build a working compiler from an elegant functional language into machine code using a popular backend called LLVM (htt ...

CS-214: Software construction

Learn how to design and implement reliable, maintainable, and efficient software using a mix of programming skills (declarative style, higher-order functions, inductive types, parallelism) and fundamental software construction concepts (reusability, abstr ...

AR-365: Theory and architectural culture

Le cours offre un résumé de la théorie et la culture architecturales depuis 1789 dans le monde occidentale. Le but est de comprendre des textes dans lesquels l'architecture est définie comme une discipline synthétisant une variété de thèmes (sociales, arti ...

Related lectures (5)

Intermediate Representations: CPS/L3

Covers intermediate representations in compilers, focusing on CPS/L3 functional IR with local continuations and control constructs.

Homotopy Coherent Groups and Quasi-Categories

Covers the characterization of trivial Kan fibrations and the importance of homotopy coherent groups.

Code Generation Lab

Covers generating code for a compiler, translating an Amy program to WebAssembly, including memory management and pattern matching compilation.

Related publications (7)

Foundations of Implicit Function Types

Martin Odersky

Implicit parameters are used pervasively in Scala and are also present in a number of other programming and theorem proving languages. This paper describes a generalization of implicit parameters as they are currently found in Scala to implicit function types. We motivate the construct by a series of examples and provide formal foundations that closely follow the semantics implemented by the Scala compiler.

2017

Parser Macros for Scala

Parser macros are a new kind of macros that allow developers to create new language constructs and to define their own syntax for using them. In this report, we present why parser macros are useful and the kind of problems that they help to solve. We will also see how they are implemented and gain insight about how they take advantage from scala.meta, the new metaprogramming toolkit for Scala. Finally, we will discuss what are the current limitations of parser macros and what is left for future work.

2015

Constraints as Control

We present an extension of Scala that supports constraint programming over bounded and unbounded domains. The resulting language, Kaplan, provides the benefits of constraint programming while preserving the existing features of Scala. Kaplan integrates constraint and imperative programming by using constraints as an advanced control structure; the developers use the monadic 'for' construct to iterate over the solutions of constraints or branch on the existence of a solution. The constructs we introduce have

ACM Order Department, P O Box 64145, Baltimore, MD 21264 Usa2012

Related concepts (1)

Goto

Goto (goto, GOTO, GO TO, GoTo, or other case combinations, depending on the programming language) is a statement found in many computer programming languages. It performs a one-way transfer of control to another line of code; in contrast a function call normally returns control. The jumped-to locations are usually identified using labels, though some languages use line numbers. At the machine code level, a goto is a form of branch or jump statement, in some cases combined with a stack adjustment.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

is the same as:

In Java a class is written in this format: public class MyClass { //Code . . . . . . } In C++ a class is written in this format: class MyCPlusPlusClass { //Code . . . .

Official source

https://en.wikipedia.org/wiki/Language_construct

About this result

Related courses (4)

CS-320: Computer language processing

CS-214: Software construction

AR-365: Theory and architectural culture

Related lectures (5)

Intermediate Representations: CPS/L3

Covers intermediate representations in compilers, focusing on CPS/L3 functional IR with local continuations and control constructs.

Homotopy Coherent Groups and Quasi-Categories

Covers the characterization of trivial Kan fibrations and the importance of homotopy coherent groups.

Code Generation Lab

Covers generating code for a compiler, translating an Amy program to WebAssembly, including memory management and pattern matching compilation.

Related publications (7)

Foundations of Implicit Function Types

Martin Odersky

2017

Parser Macros for Scala

2015

Constraints as Control

ACM Order Department, P O Box 64145, Baltimore, MD 21264 Usa2012

Related people (1)

Viktor Kuncak

Viktor Kunčak joined EPFL in 2007, after receiving a PhD degree from MIT. Since then has been leading the Laboratory for Automated Reasoning and Analysis and supervised at least 12 completed PhD theses. His works on languages, algorithms and systems for verification and automated reasoning. He served as an initiator and one of the coordinators of a European network (COST action) in the area of automated reasoning, verification, and synthesis. In 2012 he received a 5-year single-investigator European Research Council (ERC) grant of 1.5M EUR. His invited talks include those at Lambda Days, Scala Days, NFM, LOPSTR, SYNT, ICALP, CSL, RV, VMCAI, and SMT. A paper on test generation he co-authored received an ACM SIGSOFT distinguished paper award at ICSE. A PLDI paper he co-authored was published in the Communications of the ACM as a Research Highlight article. His Google Scholar profile reports an over-approximate H-index of 38. He was an associate editor of ACM Transactions on Programming Languages and Systems (TOPLAS) and served as a co-chair of conferences on Computer-Aided Verification (CAV), Formal Methods in Computer Aided Design (FMCAD), Workshop on Synthesis (SYNT), and Verification, Model Checking, and Abstract Interpretation (VMCAI). At EPFL he teaches courses on functional and parallel programming, compilers, and verification. He has co-taught the MOOC "Parallel Programming" that was visited by over 100'000 learners and completed by thousands of students from all over the world.

Related concepts (1)

Goto