|
Ratfor
Ratfor (short for ''Rational Fortran'') is a programming language implemented as a preprocessor for Fortran 66. It provides modern control structures, unavailable in Fortran 66, to replace GOTOs and statement numbers. Features Ratfor provides the following kinds of flow-control statements, described by Kernighan and Plauger as "shamelessly stolen from the language C, developed for the UNIX operating system by D.M. Ritchie" ("Software Tools", p. 318): * statement grouping with braces * if-else, while, for, do, repeat-until, break, next * "free-form" statements, i.e., not constrained by Fortran format rules * , >=, ... in place of .LT., .GT., .GE., ... * include * # comments For example, the following code if (a > b) else might be translated as IF(.NOT.(A.GT.B))GOTO 1 MAX = A GOTO 2 1 CONTINUE MAX = B 2 CONTINUE The version of Ratfor in ''Software Tools'' is written in Ratfor, as are the sample programs, and inasmuch as its own trans ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ratfiv
Ratfor (short for ''Rational Fortran'') is a programming language implemented as a preprocessor for Fortran#FORTRAN 66, Fortran 66. It provides Structured programming, modern control structures, unavailable in Fortran 66, to replace GOTOs and statement numbers. Features Ratfor provides the following kinds of flow-control statements, described by Kernighan and Plauger as "shamelessly stolen from the language C (programming language), C, developed for the Unix, UNIX operating system by Dennis Ritchie, D.M. Ritchie" ("Software Tools", p. 318): * statement grouping with braces * if-else, while, for, do, repeat-until, break, next * "free-form" statements, i.e., not constrained by Fortran format rules * , >=, ... in place of .LT., .GT., .GE., ... * include * # comments For example, the following code if (a > b) else might be translated as IF(.NOT.(A.GT.B))GOTO 1 MAX = A GOTO 2 1 CONTINUE MAX = B 2 CONTINUE The version of Ratfor in ''Software ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ratfor Programming Language
Ratfor (short for ''Rational Fortran'') is a programming language implemented as a preprocessor for Fortran 66. It provides modern control structures, unavailable in Fortran 66, to replace GOTOs and statement numbers. Features Ratfor provides the following kinds of flow-control statements, described by Kernighan and Plauger as "shamelessly stolen from the language C, developed for the UNIX operating system by D.M. Ritchie" ("Software Tools", p. 318): * statement grouping with braces * if-else, while, for, do, repeat-until, break, next * "free-form" statements, i.e., not constrained by Fortran format rules * , >=, ... in place of .LT., .GT., .GE., ... * include * # comments For example, the following code if (a > b) else might be translated as IF(.NOT.(A.GT.B))GOTO 1 MAX = A GOTO 2 1 CONTINUE MAX = B 2 CONTINUE The version of Ratfor in ''Software Tools'' is written in Ratfor, as are the sample programs, and inasmuch as its own trans ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Brian Kernighan
Brian Wilson Kernighan (; born 1942) is a Canadian computer scientist. He worked at Bell Labs and contributed to the development of Unix alongside Unix creators Ken Thompson and Dennis Ritchie. Kernighan's name became widely known through co-authorship of the first book on the C programming language (''The C Programming Language'') with Dennis Ritchie. Kernighan affirmed that he had no part in the design of the C language ("it's entirely Dennis Ritchie's work"). He authored many Unix programs, including ditroff. Kernighan is coauthor of the AWK and AMPL programming languages. The "K" of K&R C and of AWK both stand for "Kernighan". In collaboration with Shen Lin he devised well-known heuristics for two NP-complete optimization problems: graph partitioning and the travelling salesman problem. In a display of authorial equity, the former is usually called the Kernighan–Lin algorithm, while the latter is known as the Lin–Kernighan heuristic. Kernighan has been a Professor of C ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
EFL (programming Language)
EFL is a programming language originated by programmer A.D. Hall in the late 1970s and completed by Stuart Feldman. It was intended to improve on Fortran by adding control structures similar to those of C and was implemented as a preprocessor to a Fortran compiler. Its name is an initialism for ''Extended Fortran Language''. It is roughly a superset of Ratfor Ratfor (short for ''Rational Fortran'') is a programming language implemented as a preprocessor for Fortran 66. It provides modern control structures, unavailable in Fortran 66, to replace GOTOs and statement numbers. Features Ratfor provides .... References * * {{DEFAULTSORT:Efl (Programming Language) Fortran programming language family ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
GNU Compiler Collection
The GNU Compiler Collection (GCC) is an optimizing compiler produced by the GNU Project supporting various programming languages, hardware architectures and operating systems. The Free Software Foundation (FSF) distributes GCC as free software under the GNU General Public License (GNU GPL). GCC is a key component of the GNU toolchain and the standard compiler for most projects related to GNU and the Linux kernel. With roughly 15 million lines of code in 2019, GCC is one of the biggest free programs in existence. It has played an important role in the growth of free software, as both a tool and an example. When it was first released in 1987 by Richard Stallman, GCC 1.0 was named the GNU C Compiler since it only handled the C programming language. It was extended to compile C++ in December of that year. Front ends were later developed for Objective-C, Objective-C++, Fortran, Ada, D and Go, among others. The OpenMP and OpenACC specifications are also supported in the C and C ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lawrence Berkeley National Laboratory
Lawrence Berkeley National Laboratory (LBNL), commonly referred to as the Berkeley Lab, is a United States Department of Energy National Labs, United States national laboratory that is owned by, and conducts scientific research on behalf of, the United States Department of Energy. Located in the Berkeley Hills, hills of Berkeley, California, the lab overlooks the campus of the University of California, Berkeley, and is managed by the University of California system. History 1931–1941 The laboratory was founded on August 26, 1931, by Ernest Lawrence, as the Radiation Laboratory of the University of California, Berkeley, associated with the Physics Department. It centered physics research around his new instrument, the cyclotron, a type of particle accelerator for which he was awarded the Nobel Prize in Physics in 1939. Throughout the 1930s, Lawrence pushed to create larger and larger machines for physics research, courting private philanthropy, philanthropists for funding. He ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
DECUS
The Digital Equipment Computer Users' Society (DECUS) was an independent computer user group related to Digital Equipment Corporation (DEC). The Connect User Group Community, formed from the consolidation in May, 2008 of DECUS, Encompass, HP-Interex, and ITUG is the Hewlett-Packard’s largest user community, representing more than 50,000 participants. History DECUS was the Digital Equipment Computer Users' Society, a users' group for Digital Equipment Corporation (DEC) computers. Members included companies and organizations who purchased DEC equipment; many members were application programmers who wrote code for DEC machines or system programmers who managed DEC systems. DECUS was founded in March 1961 by Edward Fredkin. DECUS was legally a part of Digital Equipment Corporation and subsidized by the company; however, it was run by unpaid volunteers. Digital staff members were not eligible to join DECUS, yet were allowed and encouraged to participate in DECUS activities. D ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Philadelphia
Philadelphia, often called Philly, is the largest city in the Commonwealth of Pennsylvania, the sixth-largest city in the U.S., the second-largest city in both the Northeast megalopolis and Mid-Atlantic regions after New York City. Since 1854, the city has been coextensive with Philadelphia County, the most populous county in Pennsylvania and the urban core of the Delaware Valley, the nation's seventh-largest and one of world's largest metropolitan regions, with 6.245 million residents . The city's population at the 2020 census was 1,603,797, and over 56 million people live within of Philadelphia. Philadelphia was founded in 1682 by William Penn, an English Quaker. The city served as capital of the Pennsylvania Colony during the British colonial era and went on to play a historic and vital role as the central meeting place for the nation's founding fathers whose plans and actions in Philadelphia ultimately inspired the American Revolution and the nation's inde ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fox Chase Cancer Center
Fox Chase Cancer Center is a National Cancer Institute-designated Comprehensive Cancer Center research facility and hospital located in the Fox Chase section of Philadelphia, Pennsylvania, United States. The main facilities of the center are located on property adjoining Burholme Park. The center is part of the Temple University Health System (TUHS) and specializes in the treatment and prevention of cancer. The center was formed in 1974 by the merger of the American Oncologic Hospital, which was founded in 1904 as the first cancer hospital in the United States, and the Institute for Cancer Research, founded in 1927. The center was an independent, non-profit institution until it became part of TUHS July 1, 2012. Today it has almost 2,400 employees and an operating budget of $300 million. Research is conducted in more than 80 laboratories by a staff of more than 325 physicians and scientists who hold medical degrees, Ph.D.s or both. Fox Chase's 100-bed hospital is one of the few ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Macro (computer Science)
In computer programming, a macro (short for "macro instruction"; ) is a rule or pattern that specifies how a certain input should be mapped to a replacement output. Applying a macro to an input is known as macro expansion. The input and output may be a sequence of lexical tokens or characters, or a syntax tree. Character macros are supported in software applications to make it easy to invoke common command sequences. Token and tree macros are supported in some programming languages to enable code reuse or to extend the language, sometimes for domain-specific languages. Macros are used to make a sequence of computing instructions available to the programmer as a single program statement, making the programming task less tedious and less error-prone. (Thus, they are called "macros" because a "big" block of code can be expanded from a "small" sequence of characters.) Macros often allow positional or keyword parameters that dictate what the conditional assembler program generates ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Goto
GoTo (goto, GOTO, GO TO 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. Many languages support the goto statement, and many do not (see § language support). The structured program theorem proved that the goto statement is not necessary to write programs that can be expressed as flow charts; some combination of the three programming constructs of sequence, selection/choice, and repetition/iteration are sufficient for any computation that can be performed by a Turing machine, with the caveat that code duplication and additional variables may need to be introduce ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Control Flow
In computer science, control flow (or flow of control) is the order in which individual statements, instructions or function calls of an imperative program are executed or evaluated. The emphasis on explicit control flow distinguishes an ''imperative programming'' language from a '' declarative programming'' language. Within an imperative programming language, a ''control flow statement'' is a statement that results in a choice being made as to which of two or more paths to follow. For non-strict functional languages, functions and language constructs exist to achieve the same result, but they are usually not termed control flow statements. A set of statements is in turn generally structured as a block, which in addition to grouping, also defines a lexical scope. Interrupts and signals are low-level mechanisms that can alter the flow of control in a way similar to a subroutine, but usually occur as a response to some external stimulus or event (that can occur asynchronously), ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.jpg "Click for more on -> Lawrence Berkeley National Laboratory")
.jpg "Click for more on -> Goto")
