Search Results for "define"

Protocol Buffers are Google’s fast and simple, language- and platform-neutral, extensible mechanism for serializing structured data. It allows you to define how your data should be structured once, and then using a special generated source code, you can then easily write and read your structured data to and from a variety of data streams and using a variety of languages. Protocol Buffers currently supports a wide array of languages, including C++, Java, Python, Ruby, and many others with more to come.

...It fills a monitoring niche by being the glue between applications that do not export their own internal state (other than via logs) and existing monitoring systems, such that system operators do not need to patch those applications to instrument them or writing custom extraction code for every such application. The extraction is controlled by mtail programs which define patterns and actions. Metrics are exported for scraping by a collector as JSON or Prometheus format over HTTP, or can be periodically sent to a collectd, StatsD, or Graphite collector socket. Precompiled binaries for released versions are available in the Releases page on Github. Using the latest production release binary is the recommended way of installing mtail.

...The precise effect typing gives Koka rock-solid semantics backed by well-studied category theory, which makes Koka particularly easy to reason about for both humans and compilers. Effect handlers let you define advanced control abstractions, like exceptions, async/await, or probabilistic programs, as a user library in a typed and composable way. Perceus is an advanced compilation method for reference counting.

ULS is a class library for creating lexical analyzer from language specification file. It's provided as C/C++/C# and Java (class) libraries with a few of tools on Linux/Windows platform.

...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). ...

...The expression language supports numbers, strings, external variables, arithmetic, comparisons, regular expression matching, and logical operations. Overall, it gives applications a safer way to let users define dynamic rules and filters.

oscript is script language. it have very simple syntax and cover how to define a string , integer, float, array, object and function... it be fit for embed script in host jave or c/c++ programe. it is a easy and fast VM implement for c/c++.

BBCode implentation for ASP.NET or Windows Projects. Support full BBCode syntax. Define Tags in XML or sourcecode. FrameWork 3.5

Library to define Tcl commands which manipulate C++ class and structure objects in manners similar to the way Tk manages widgets. Objects can then be manipulated from either C++ or Tcl. Based on the original TclObjectCommand

Object Mapping Project (OMaP) proposes a way to define and to perform mappings of Java object instances. The objects could be mapped to a XML String, another Java object, database records, Swing screens, etc. And, of course, mapping back is also supported

A run-time configurable character stream tokenizer that allows the user to define token classes via regular expressions. The developer is not limited to predefined notions of whitespace, commenting, or word modalities.

I wanted to create a simple program that was very portable that could process #include, #define, #ifdef, #ifndef, #else and #endif statements. M4 is too complicated and cannot handle nested if-else this program can be used with M4.

JPP is a simple macro preprocessor for Java. It is entirely written in Java and provides C-like preprocessor commands like #define #undef #ifdef #ifndef #else #endif #include. More to be developed.

The fast, flexible parsing engine. Parse anything in 4 steps: (1) define a grammar, (2) load the grammar into ClearParse, (3) call the engine to parse the source, and (4) traverse the parsing tree. You can even change your grammar at run time.

libnaru is a library written in C that supports you to define a type system for a programming language. It is thought to be another lego piece beside lexical and syntax analysis in a compiler project.