Open Source Linux Compilers - Page 26

flatcc has no external dependencies except for build and compiler tools, and the C runtime library. With concurrent Ninja builds, a small client project can build flatcc with libraries, generate schema code, link the project and execute a test case in a few seconds, produce binaries between 15K and 60K, read small buffers in 30ns, build FlatBuffers in about 600ns, and with a larger executable also handle optional json parsing or printing in less than 2 us for a 10 field mixed type message. The JSON parser may change the interface for parsing union vectors in a future release which requires code generation to match library versions. This project builds flatcc, a compiler that generates FlatBuffers code for C given a FlatBuffer schema file. This introduction also creates a separate test project with the traditional monster example, here in a C version. The setup script builds flatcc using CMake, then creates a test project directory with the monster example.

Compiler targeting the 18F line of Microchip PIC embedded microcontrollers. Written in C# 2.0.

Flora-2 is a powerful knowledge representation and reasoning system designed for building knowledge-intensive applications. It is based on F-logic, HiLog, Transaction Logic, and also supports defeasible reasoning. Applications include intelligent agents, Semantic Web, ontology management, and more. If you use Flora-2 and like it, please acknowledge it in your project!

Flow4J is a java framework, that enables the user to model process flow with a gui interface. The flow may include tasks, decisions or calls to other process flows. The saved flow is in a jar file together with its bytecode.

The fluffy language is a toy language designed around the libfirm intermediate representation library. It supports the typical low-level constructions known from C combined with generic programming constructs. Lexer and parser are extensible with plugins

Formula Compiler Source for writing your own compiler. Arithmetic expressions & functions; IF-THEN; AND OR ..; EQ GT ..; user functions like threshold, flipflop; others are easy to be implemented

A program for syntactically correct sentence generation. Guided by a Bison grammar file as input, it provides random or coverage testing sentences. The program can be used for compiler or parser testing or didactical purposes.

Author : André Rezende - andrerezende_br@yahoo.com.br Since Oracle stopped to support the Pro*Fortran compiler all the users of this preprocessor don't have alternative to use Embeded SQL c

A free pascal compiler targeting the Microsoft .NET and Mono platform; Full compatibility to the Borland Delphi.NET compilers is one of the main goals.

Freefactor is a Java refactoring framework. It consists of a tool-independent refactoring system and an interface to allow it to be integrated with other tools. Currently a prototype Java-based tool is provided as well as bindings for Emacs.

FreeForm can be described as a 'language language'. It can be used for specifying new formal language and the way how code written in such language is resolved. It allows defining syntax like libraries and combining and embedding custom syntaxes.

FreeTV is aimed at two things; to create a Linux port of the OpenTV GCC toolchain and to make sure that the source code for the OpenTV GPL'd software is TRULY available upon request.

Freude is a new general purpose, very type safe, postfix / concatenative language in the style of \"Manfred von Thun\'s\" Joy. Freude programs are composed of axiomatic mathematical structures and verifiably correct concrete implementations thereof.

Tool to transcribe Parsing Expression Grammar into a parser written in Java. Parsing Expression Grammar (PEG) is a way to specify recursive-descent parsers with limited backtracking. The use of backtracking lifts the LL(1) restriction usually imposed by top-down parsers. In addition, PEG can define parsers with integrated lexing. Unlike some existing parser generators for PEG, the tool does not produce a complex and storage-hungry "packrat parser", but a collection of transparent recursive procedures. The tool can handle left recursion. An integral feature of "Mouse" is the mechanism for specifying semantics (also in Java). This makes "Mouse" a convenient tool if one needs an ad-hoc language processor. Being written in Java, the processor is operating-system independent. Included in the package is PEG Explorer, an interactive tool to investigate the effect of limited backtracking. Sample grammars for Java & C are available from the Web Site.

FOCA (Fudeba: Optimizer, Compiler and Assembler) is a free development system for the MSX architecture (Z80-based), aiming to provide developer support for the Uzix operating system.

This repository gathers Google’s practical tooling for Fully Homomorphic Encryption (FHE), focused on making it possible to run computations on encrypted data without ever decrypting it. At its core is a “transpiler” that converts ordinary functions (typically written in a restricted subset of C++ or similar) into FHE circuits, plus backends that execute those circuits with different FHE libraries. The workflow usually mirrors normal software development: write and test a cleartext implementation, run a simulator to validate logic and performance characteristics, then compile to an encrypted form to run with real FHE parameters. The project includes benchmarking harnesses, examples, and tutorials that demystify parameter selection, gate costs, and latency/throughput trade-offs. Multiple runtimes and backends are supported so teams can choose Boolean or integer schemes depending on accuracy and speed needs.

Interested in a functional language but scared of S-expressions, monads, or other weird syntax? Try fuphyl! While still being functional, you can also program using procedural-style syntax or take advantage of object-orientation.

Fusion is a powerful high level programming language that merges several feature from Ruby, Python, Java, C++, Visual Basic, etc, in a only language. It's implemented by means of a compiler written in Haskell that generates Ruby code.

The goal of the g95 project is to create a free Fortran 95 compiler and runtime libraries

The GAA Argument Analyser helps programmers to analyze the arguments given to their program from the command line.

A GCC front end for the BCPL programming language.

GCC-MELT is a high-level domain specific language to extend the GCC compiler. It provides several features (pattern-matching, first-class dynamically typed values, functional/applicative/object-oriented/reflective programming styles, Lisp-y syntax) MELT can also be used to explore the internal representations used by GCC (Gimple, etc...)

This is an offspin of the GCC-XML project (http://gccxml.org), providing the lacking support for dumping of function bodies.