Adds syntax highlighting and snippets to Ren'Py files in Atom. It also adds syntax highlighting to GitHub files, markdown code blocks and GitHub Gist (more info here). Originally converted from the Python package for Atom.
https://github.com/renpy/language-renpyTags | renpy ren-py visual-novel grammars language grammar snippets game-dev engine |
Implementation | Python |
License | MIT |
Platform | NodeJS |
Ren'Py development takes place on the master branch, and occasionally on feature branches. Ren'Py depends on a number of Python modules written in Cython and C. For changes to Ren'Py that only involve Python modules, you can use the modules found in the latest nightly build. Otherwise, you'll have to compile the modules yourself.
renpy visual-novel visual novel game engineJ Visual Novel Engine (JVNE) is, as it's name suggest, is a visual novel engine. With the JVNE you can create your own visual novel game with ease, without the need to know of any programming language.
Language grammar for all versions of JavaScript including ES2016 and ESNext, JSX syntax as used by Facebook React, Atom's etch and others, as well as optional typed JavaScript using Facebook flow. This package also supports highlighting of GraphQL language constructs when inside certain JavaScript template strings. For .graphql and .gql file support please see language-graphql . The colour of syntax is determined by the theme in use. By default the language-babel package will detect file types .js,.babel,.jsx, .es, .es6, .mjs and .flow. Use the standard ATOM interface to enable it for other file types. This provides a grammar that scopes the file in order to colour the text in a meaningful way. If other JavaScript grammars are enabled these may take precedence over language-babel. Look at the bottom right status bar indicator to determine the language grammar of a file being edited. language-babel will be shown as either Babel or Babel ES6 JavaScript. Clicking the name will allow the grammar for a file to be changed.
atom react jsx es5 es7 babel graphql styled-components es6 flow esnext es2015 es2016 es2017 relay apolloG2 is a visualization grammar, a data-driven visual language with a high level of usability and scalability. It provides a set of grammars, takes users beyond a limited set of charts to an almost unlimited world of graphical forms. With G2, users can describe the visual appearance of a visualization just by one statement. Special thanks to Leland Wilkinson, the author of The Grammar Of Graphics, whose book served as the foundation for G2.
visualization grammar graphics charts graph data-visualization canvas ant antvis data statistics g2 chartThis repository is a collection of Antlr4 grammars. The root directory name is the all-lowercase name of the language parsed by the grammar. For example, java, cpp, csharp, c, etc...
The Language Machine is a toolkit for language and grammar: a library, main program, and self-hosted rule compilers with one frontend. The system is easy to use. It directly implements unrestricted rule-based grammars with actions and external interfaces.
Languages can be split into two components, their syntax and their semantics. It's your understanding of English syntax that tells you the stream of words "Sleep furiously green ideas colorless" is not a valid sentence. Semantics is deeper. Even if we rearrange the above sentence to be "Colorless green ideas sleep furiously", which is syntactically correct, it remains nonsensical on a semantic level. With Treetop, you'll be dealing with languages that are much simpler than English, but these basic concepts apply. Your programs will need to address both the syntax and the semantics of the languages they interpret. Treetop equips you with powerful tools for each of these two aspects of interpreter writing. You'll describe the syntax of your language with a parsing expression grammar. From this description, Treetop will generate a Ruby parser that transforms streams of characters written into your language into abstract syntax trees representing their structure. You'll then describe the semantics of your language in Ruby by defining methods on the syntax trees the parser generates.
Vega-Lite is a high-level grammar of interactive graphics. It provides a concise JSON syntax for rapidly generating visualizations to support analysis. Vega-Lite specifications can be compiled to Vega specifications.
visual-analysis visualization-grammar visualization vega charts declarative-language vega-liteZetaSQL defines a language (grammar, types, data model, and semantics) as well as a parser and analyzer. It is not itself a database or query engine. Instead it is intended to be used by multiple engines wanting to provide consistent behavior for all semantic analysis, name resolution, type checking, implicit casting, etc. Specific query engines may not implement all features in the ZetaSQL language and may give errors if specific features are not supported. For example, engine A may not support any updates and engine B may not support analytic functions. Until all this code is released, we cannot provide any guarantees of API stability and cannot accept contributions. We will also be releasing more documentation over time, particular related to developing engines with this framework. Documentation on the language itself is fairly complete.
An IntelliJ IDEA plugin for language plugin developers.Adds BNF Grammars and JFlex files editing support including parser/PSI code generator.
JavaScript developers can now just open a .ts file and start hacking away like they are used to. No grunt no Visual Studio. Just pure coding. NOTE: When updating to v12, make sure language-typescript core package is enabled. We're discontinuing our own grammar in favor of language-typescript. Both are very similar and are basically Microsoft's TextMate grammar repackaged, and there's little reason to bundle our own if there's one available by default.
typescript htmlA curated list of delightful Visual Studio Code packages and resources. For more awesomeness, check out awesome. Language packages extend the editor with syntax highlighting and/or snippets for a specific language or file format.
visual-studio vscode vscode-theme vscode-extension awesome awesome-list list visualstudio visual-studio-code visual-studio-code-extension visual-studio-code-themeAutoLayout.js implements Apple's Auto Layout and Visual Format Language in Javascript. Auto layout is a system which lets you perform lay out using mathematical relationships (constraints). It uses the awesome Cassowary.js library to do the actual constraint resolving and implements Apple's constraint system and Visual Format Language (vfl) on top of that. It supports the Extended VFL syntax, including view-stacks and z-indexing. AutoLayout.js is an abstract library for integrating Auto Layout and VFL into other javascript technologies. It provides a simple API and programming model that you can use to build your own auto layout and VFL solution. A simple example of this is, is using position: absolute; to lay out DOM elements. A more elobarate example of this is the Visual Format Editor, which is built using famo.us and famous-flex. AutoLayout.js is written in ES6 and contains transpiled distribution files.
cassowary-constraints constraint-solver autolayout layout-engine visual-format-language vfl autolayoutjs autolayout.js auto-layout cassowary cassowaryjs cassowary.js evfl visualformatlanguageThis is an experimental Torch implementation of the VIS + LSTM visual question answering model from the paper Exploring Models and Data for Image Question Answering by Mengye Ren, Ryan Kiros & Richard Zemel. Download the MSCOCO train+val images and VQA data using sh data/download_data.sh. Extract all the downloaded zip files inside the data folder.
torch deep-learning computer-vision natural-language-processingThis is a small library for generating railroad diagrams (like what JSON.org uses) using SVG, with both JS and Python ports. Railroad diagrams are a way of visually representing a grammar in a form that is more readable than using regular expressions or BNF. They can easily represent any context-free grammar, and some more powerful grammars. There are several railroad-diagram generators out there, but none of them had the visual appeal I wanted, so I wrote my own.
railroad syntax diagrams grammar svgThe Bosque programming language is designed for writing code that is simple, obvious, and easy to reason about for both humans and machines. The key design features of the language provide ways to avoid accidental complexity in the development and coding process. The result is improved developer productivity, increased software quality, and enable a range of new compilers and developer tooling experiences. Small samples of code to give a sample flavor are below (Code Snippets). A rundown of notable and/or unique features in the Bosque language is provided in the language overview section 0. For a look at how the language works and flows in the large please see the code for a simple tic-tac-toe program that supports updating the board with user supplied moves, making an automated computer move, and managing the various game state.
Leo is a project to provide an architecture for defining XML specifications of grammars for different natural language parsing systems and tools for using that architecture to permit sharing of grammar resources across different systems.
Duckling is a Clojure library that parses text into structured data: “the first Tuesday of October” => {:value "2014-10-07T00:00:00.000-07:00" :grain :day}<div class="doc-website-link"> <p>You can try it out at <a href="http://duckling-lib.org">http://duckling-lib.org</a></p></div>See our [blog post announcement](https://wit.ai/blog/2014/10/01/open-source-parser-duckling) for more context.Duckling is shipped with modules that parse temporal expressions i
Go to the API documentation on Hackage. An embedded context-free grammar (CFG) domain-specific language (DSL) with semantic action specification in applicative style.
The Parsing Expression Grammar Template Library (PEGTL) is a zero-dependency C++ header-only parser combinator library for creating parsers according to a Parsing Expression Grammar (PEG). Grammars are written as regular C++ code, created with template programming (not template meta programming), i.e. nested template instantiations that naturally correspond to the inductive definition of PEGs (and other parser-combinator approaches).
peg header-only cpp parsing cpp17 cpp11 grammar parsing-expression-grammars
We have large collection of open source products. Follow the tags from
Tag Cloud >>
Open source products are scattered around the web. Please provide information
about the open source projects you own / you use.
Add Projects.