commit stringlengths 40 40 | old_file stringlengths 2 205 | new_file stringlengths 2 205 | old_contents stringlengths 0 32.9k | new_contents stringlengths 1 38.9k | subject stringlengths 3 9.4k | message stringlengths 6 9.84k | lang stringlengths 3 13 | license stringclasses 13
values | repos stringlengths 6 115k |
|---|---|---|---|---|---|---|---|---|---|
ddc36dae24c43d057f2b8f67f617631d371130bf | lib/Control/Process/Type.agda | lib/Control/Process/Type.agda | {-
On the one hand this module has nothing to do with JS, on the other
hand our JS binding relies on this particular type definition.
-}
module Control.Process.Type where
open import Data.String.Base using (String)
data Proc (C {-channels-} : Set₀) (M {-messages-} : Set₀) : Set₀ where
end : Proc C M
send :... | Add Control.Process.Type | Add Control.Process.Type
| Agda | bsd-3-clause | audreyt/agda-libjs,crypto-agda/agda-libjs | |
e0c6a8e5b17986de3b0562105b17b44fb570453b | FiniteField/FinImplem.agda | FiniteField/FinImplem.agda | -- Implements ℤq with Data.Fin
open import Type
open import Data.Nat
open import Data.Fin.NP as Fin
open import Relation.Binary.PropositionalEquality
open import Explore.Type
open import Explore.Explorable
open Fin.Modulo renaming (sucmod to [suc]; sucmod-inj to [suc]-inj)
module FiniteField.FinImplem (q-1 : ℕ) ([0]... | Add FiniteField/FinImplem.agda (unfinished) | Add FiniteField/FinImplem.agda (unfinished)
| Agda | bsd-3-clause | crypto-agda/crypto-agda | |
80516389760b8a704422d85e8bf6d5b682422d9d | Parametric/Change/Equivalence.agda | Parametric/Change/Equivalence.agda | ------------------------------------------------------------------------
-- INCREMENTAL λ-CALCULUS
--
-- Delta-observational equivalence
------------------------------------------------------------------------
import Parametric.Syntax.Type as Type
import Parametric.Denotation.Value as Value
module Parametric.Change.Eq... | Implement delta-observational equivalence (#244, #299) | Implement delta-observational equivalence (#244, #299)
This proof shows that delta-observational equivalence is an equivalence
relation.
Known limitations of this commit:
* it does not show that any function respects this relation;
* it does not rephrase existing results;
* this might better belong in Base.Change.Equ... | Agda | mit | inc-lc/ilc-agda | |
f58fb12a605924ada6a2cc1645dc725167a301ea | meaning.agda | meaning.agda | module meaning where
open import Level
record Meaning (Syntax : Set) {ℓ : Level} : Set (suc ℓ) where
constructor
meaning
field
Semantics : Set ℓ
⟦_⟧ : Syntax → Semantics
open Meaning {{...}} public
| Add missing file. | Add missing file.
Forgot to add this file in commit ba1d8a8be0778b4d917c4d98c7db8f78f8f3cbbc.
Old-commit-hash: 02fcec1035aa2e0190d1ba3fc335cecbade97c9b
| Agda | mit | inc-lc/ilc-agda | |
14b8f096b525d8a615d01965c700b05596b5d603 | New/Equivalence.agda | New/Equivalence.agda | module New.Equivalence where
open import Relation.Binary.PropositionalEquality
open import Function
open import Data.Product
open import Postulate.Extensionality
open import New.Changes
module _ {a} {A : Set a} {{CA : ChAlg A}} {x : A} where
-- Delta-observational equivalence: these asserts that two changes
-- g... | Add lemmas to prove function changes valid | Add lemmas to prove function changes valid
| Agda | mit | inc-lc/ilc-agda | |
02b7dc1fcde2d5ea5944dc426ae4920689962b5d | experiments/NonregularTraversable.agda | experiments/NonregularTraversable.agda | -- A traversable functor that is not regular.
open import Data.Nat
open import Data.Vec
open import Data.Product
record Applicative : Set₁ where
constructor
appl
field
Map : Set → Set
pure : ∀ {A} → A → Map A
call : ∀ {A B} → Map (A → B) → Map A → Map B
Traversable : (Set → Set) → Set₁
Tra... | add example of non-regular traversable functor | add example of non-regular traversable functor
| Agda | mit | yfcai/CREG | |
ccc91a1d485cba9d42a78ea4ff80597f0f7e7849 | bytecode.agda | bytecode.agda | -- This module is an example of the use of the circuit building library.
-- The point is to start with a tiny bytecode evaluator for bit operations.
module bytecode where
open import Function
open import Data.Nat
open import Data.Vec
open import Data.Product.NP
open import Data.Bits
open import Data.Bool
open import A... | Add bytecode.agda to experiment with circuits | Add bytecode.agda to experiment with circuits
| Agda | bsd-3-clause | crypto-agda/crypto-agda | |
095f53c09c64b3abe9688067512e48f0db0bf52b | ZK/SigmaProtocol/KnownStatement.agda | ZK/SigmaProtocol/KnownStatement.agda | open import Type using (Type)
open import Data.Bool.Base using (Bool; true)
open import Relation.Binary.Core using (_≡_; _≢_)
-- This module assumes the exact statement of the Zero-Knowledge proof to be
-- known by all parties.
module ZK.SigmaProtocol.KnownStatement
(Commitment : Type) ... | Add ZK.SigmaProtocol.KnowStatement | Add ZK.SigmaProtocol.KnowStatement
| Agda | bsd-3-clause | crypto-agda/crypto-agda | |
6419e6a499edf075accabe01063360bc7c867ef8 | formalization/agda/Spire/Examples/CompLev.agda | formalization/agda/Spire/Examples/CompLev.agda | {-# OPTIONS --type-in-type #-}
open import Data.Unit
open import Data.Product hiding ( curry ; uncurry )
open import Data.List hiding ( concat )
open import Data.String
open import Relation.Binary.PropositionalEquality
open import Function
module Spire.Examples.CompLev where
-------------------------------------------... | Fix internalized as a computational description. | Fix internalized as a computational description.
The idea is that the core could have computatial descriptions,
which do not mention things like which arguments are implicit,
and Desc can be internalized as a description like the current
primitive (non-computational) description that also mentions
which arguments are ... | Agda | bsd-3-clause | spire/spire | |
3be44d190ddb71b95417f9028965e046e7938081 | agda/Language/Greek.agda | agda/Language/Greek.agda | module Language.Greek where
data Maybe A : Set where
none : Maybe A
just : A → Maybe A
data Unicode : Set where
Α Β Γ Δ Ε Ζ Η Θ Ι Κ Λ Μ Ν Ξ Ο Π Ρ Σ Τ Υ Φ Χ Ψ Ω α β γ δ ε ζ η θ ι κ λ′ μ ν ξ ο π ρ σ ς τ υ φ χ ψ ω : Unicode
grave acute diaeresis smooth rough circumflex iotaSubscript : Unicode
postulate
Char :... | Add an initial start for an Agda model. | Add an initial start for an Agda model.
| Agda | mit | scott-fleischman/greek-grammar,scott-fleischman/greek-grammar | |
8eb3bf726fb7d12e74f6c4c5fd3b4b9b641cfefd | lib/Algebra/Nearring.agda | lib/Algebra/Nearring.agda | {-# OPTIONS --without-K #-}
open import Relation.Binary.PropositionalEquality.NP
import Algebra.FunctionProperties.Eq
open Algebra.FunctionProperties.Eq.Implicits
open import Function.Extensionality
open import Data.Product.NP
open import Data.Nat.NP using (ℕ; zero; fold) renaming (suc to 1+)
open import Data.Integer u... | Add Nearring+1 | Add Nearring+1
| Agda | bsd-3-clause | crypto-agda/agda-nplib | |
b5129ee5c0b5ffae12387ee403ca85c9cabd2fb1 | lib/FFI/JS/BigI.agda | lib/FFI/JS/BigI.agda | open import FFI.JS hiding (toString)
module FFI.JS.BigI where
abstract
BigI : Set
BigI = JSValue
BigI▹JSValue : BigI → JSValue
BigI▹JSValue x = x
unsafe-JSValue▹BigI : BigI → JSValue
unsafe-JSValue▹BigI x = x
postulate
bigI : (x base : String) → BigI
add : (x y : BigI) → BigI
multiply : ... | Add FFI.JS.BigI | Add FFI.JS.BigI
| Agda | bsd-3-clause | crypto-agda/agda-libjs,audreyt/agda-libjs | |
27acbf899d88340ad1d03042fa744d1a3b783e0c | Base/Change/Sums.agda | Base/Change/Sums.agda | module Base.Change.Sums where
open import Relation.Binary.PropositionalEquality
open import Level
open import Base.Change.Algebra
open import Base.Change.Equivalence
open import Postulate.Extensionality
open import Data.Sum
module SumChanges ℓ (X Y : Set ℓ) {{CX : ChangeAlgebra ℓ X}} {{CY : ChangeAlgebra ℓ Y}} where... | Implement change structure for sum types | Implement change structure for sum types
| Agda | mit | inc-lc/ilc-agda | |
98776944ea4983b6faeeced4116bc7798c5e3ebc | Crypto/Sig/Lamport.agda | Crypto/Sig/Lamport.agda | {-# OPTIONS --without-K #-}
open import Function using (_∘_)
open import Data.Nat.NP hiding (_==_)
open import Data.Product.NP hiding (map)
open import Data.Bit hiding (_==_)
open import Data.Bits
open import Data.Bits.Properties
open import Data.Vec.NP
open import Relation.Binary.PropositionalEquality.NP
import Crypto... | Add Crypto.Sig.Lamport | Add Crypto.Sig.Lamport
| Agda | bsd-3-clause | crypto-agda/crypto-agda | |
128af4af6ee42b630e845312b9e05e5b42880cae | Control/Strategy/Utils.agda | Control/Strategy/Utils.agda | {-# OPTIONS --copatterns #-}
open import Type
open import Function
open import Data.Product
open import Control.Strategy renaming (map to mapS)
module Control.Strategy.Utils where
record Proto : ★₁ where
constructor P[_,_]
field
Q : ★
R : Q → ★
Client : Proto → ★ → ★
Client P[ Q , R ] A = Strategy Q R A
... | Add Control.Strategy.Utils | Add Control.Strategy.Utils
| Agda | bsd-3-clause | crypto-agda/crypto-agda | |
f4f6e7a3cad61d0a276de2905272032cf125b5eb | lib/Data/Product/Param/Binary.agda | lib/Data/Product/Param/Binary.agda | {-# OPTIONS --without-K #-}
open import Level
open import Data.Product
renaming (proj₁ to fst; proj₂ to snd)
open import Function.Param.Binary
module Data.Product.Param.Binary where
record ⟦Σ⟧ {a₁ a₂ b₂ b₁ aᵣ bᵣ}
{A₁ : Set a₁} {A₂ : Set a₂}
{B₁ : A₁ → Set b₁}
{B₂ : A₂ → Set b₂}
... | add Data.Product.Param.Binary | add Data.Product.Param.Binary
| Agda | bsd-3-clause | np/agda-parametricity | |
8fd23013cafc4153d1b4a63b41e95bc6ecbbac7e | Crypto/Sig/LamportOneBit.agda | Crypto/Sig/LamportOneBit.agda | {-# OPTIONS --without-K #-}
open import Data.Nat.NP hiding (_==_)
open import Data.Product.NP hiding (map)
open import Data.Bit hiding (_==_)
open import Data.Bits
open import Data.Bits.Properties
open import Data.Vec.NP
open import Relation.Binary.PropositionalEquality.NP
module Crypto.Sig.LamportOneBit
(#s... | Add Crypto.Sig.LamportOneBit | Add Crypto.Sig.LamportOneBit
| Agda | bsd-3-clause | crypto-agda/crypto-agda | |
fefd4590ac23e7cdf91cbc2277dcce1be57d736e | Control/Strategy.agda | Control/Strategy.agda | module Control.Strategy where
open import Function
open import Type using (★)
open import Category.Monad
open import Relation.Binary.PropositionalEquality.NP
data Strategy (Q R A : ★) : ★ where
ask : (q? : Q) (cont : R → Strategy Q R A) → Strategy Q R A
done : A → Strategy Q R A
infix 2 _≈_
data _≈_ {Q R A} : (... | Add Control.Strategy | Add Control.Strategy
| Agda | bsd-3-clause | crypto-agda/crypto-agda | |
962dded37d6c55fa91fe570fbfe0821e7c37241a | ttfp1.agda | ttfp1.agda | -- some excises for learning ttfp (type theory for functional programming).
-- most of the code is *borrowed* from learn you an agda shamelessly
-- Function composition
_∘_ : {A : Set} { B : A -> Set} { C : (x : A) -> B x -> Set}
(f : {x : A}(y : B x) -> C x y) (g : (x : A) -> B x)
(x : A) -> C x (g x)
(f ... | Create ttfp1.agda | Create ttfp1.agda
notes while learning ttfp | Agda | bsd-3-clause | wangbj/excises,wangbj/excises,wangbj/excises | |
38dc0e74c8050099800069c05d5282fdff28dced | incremental.agda | incremental.agda | module incremental where
-- SIMPLE TYPES
-- Syntax
data Type : Set where
_⇒_ : (τ₁ τ₂ : Type) → Type
infixr 5 _⇒_
-- Semantics
Dom⟦_⟧ : Type -> Set
Dom⟦ τ₁ ⇒ τ₂ ⟧ = Dom⟦ τ₁ ⟧ → Dom⟦ τ₂ ⟧
-- TYPING CONTEXTS
-- Syntax
data Context : Set where
∅ : Context
_•_ : (τ : Type) (Γ : Context) → Context
infixr 9 _... | Implement STLC in AGDA (fix #13). | Implement STLC in AGDA (fix #13).
Old-commit-hash: 8c8d0d1e3a7f67f1a6640d7526542321b3a5a424
| Agda | mit | inc-lc/ilc-agda | |
2824f8185e103bd7e2500937eff9fb9af1077e07 | lib/Data/Nat/GCD/NP.agda | lib/Data/Nat/GCD/NP.agda | module Data.Nat.GCD.NP where
open import Data.Nat
open import Data.Nat.Properties
open import Data.Nat.Divisibility as Div
open import Relation.Binary
private module P = Poset Div.poset
open import Data.Product
open import Relation.Binary.PropositionalEquality as PropEq using (_≡_)
open import Induction
open import In... | Add a broken attempt at simplifying Nat.GCD: Nat.GCD.NP | Add a broken attempt at simplifying Nat.GCD: Nat.GCD.NP
| Agda | bsd-3-clause | crypto-agda/agda-nplib | |
4995bc2a3bd988bcf90ed2efe5b614e17b5554a0 | Game/IND-CPA-alt.agda | Game/IND-CPA-alt.agda |
{-# OPTIONS --without-K #-}
open import Type
open import Data.Product
open import Data.Bit
module Game.IND-CPA-alt
(PubKey : ★)
(SecKey : ★)
(Message : ★)
(CipherText : ★)
-- randomness supply for: encryption, key-generation, adversary, extensions
(Rₑ Rₖ Rₐ : ★)
(KeyGen : Rₖ → PubKey × SecK... | Add alternative defintion for IND CPA | Add alternative defintion for IND CPA
| Agda | bsd-3-clause | crypto-agda/crypto-agda | |
f9510280666609fdd9b8b35645bab6c0e17092c4 | lib/FFI/JS.agda | lib/FFI/JS.agda | module FFI.JS where
open import Data.Char.Base public using (Char)
open import Data.String.Base public using (String)
open import Data.Bool.Base public using (Bool; true; false)
open import Data.List.Base using (List)
open import Data.Product using (_×_) renaming (proj₁ to fst; proj₂ to snd)
open import Con... | Add FFI.JS | Add FFI.JS
| Agda | bsd-3-clause | audreyt/agda-libjs,crypto-agda/agda-libjs | |
9236c772d09686e999993e80d77ce8bd225d16f5 | lib/FFI/JS/SHA1.agda | lib/FFI/JS/SHA1.agda | module FFI.JS.SHA1 where
open import Data.String.Base using (String)
postulate SHA1 : String → String
{-# COMPILED_JS SHA1 function (x) { return require("sha1")(x); } #-}
| Add FFI.JS.SHA1 | Add FFI.JS.SHA1
| Agda | bsd-3-clause | audreyt/agda-libjs,crypto-agda/agda-libjs | |
d5f6beafc85ff125a91c2f035d2d29dd6409f54e | ZK/GroupHom/ElGamal/JS.agda | ZK/GroupHom/ElGamal/JS.agda | {-# OPTIONS --without-K #-}
open import FFI.JS.BigI
open import Data.Bool.Base using (Bool)
open import SynGrp
open import ZK.GroupHom.Types
import ZK.GroupHom.ElGamal
import ZK.GroupHom.JS
module ZK.GroupHom.ElGamal.JS (p q : BigI)(g : ℤ[ p ]★) where
module EG = ZK.GroupHom.ElGamal `ℤ[ q ]+ `ℤ[ p ]★ _`^_ g
module k... | Add ZK.GroupHom.ElGamal.JS, so far only known-enc-rnd | Add ZK.GroupHom.ElGamal.JS, so far only known-enc-rnd
| Agda | bsd-3-clause | crypto-agda/crypto-agda | |
1ffd391240cdf755b930cf4216a8231b81aee07d | FunUniverse/Fin/Op/Abstract.agda | FunUniverse/Fin/Op/Abstract.agda | open import Type
open import Function
open import Data.Product using (proj₂)
open import Data.Two renaming (mux to mux₂)
open import Data.Nat.NP using (ℕ; zero; suc; _+_; _*_; module ℕ°)
open import Data.Fin.NP as Fin using (Fin; inject+; raise; bound; free; zero; suc)
open import Data.Vec.NP using (Vec; []; _∷_; looku... | Add FunUniverse/Fin/Op/Abstract.agda | Add FunUniverse/Fin/Op/Abstract.agda
| Agda | bsd-3-clause | crypto-agda/crypto-agda | |
3887acc776498fc936c85a42b1ba8ed98dfe1593 | Everything.agda | Everything.agda | module Everything where
import Holes.Prelude
import Holes.Term
import Holes.Cong.Limited
import Holes.Cong.General
import Holes.Cong.Propositional
| Add Everything file | Add Everything file
| Agda | mit | bch29/agda-holes | |
22eab6635a40915cfce9e29a45fe31de8280bcbf | PLDI14-List-of-Theorems.agda | PLDI14-List-of-Theorems.agda | module PLDI14-List-of-Theorems where
open import Function
-- List of theorems in PLDI submission
--
-- For hints about installation and execution, please refer
-- to README.agda.
--
-- Agda modules corresponding to definitions, lemmas and theorems
-- are listed here with the most important name. For example,
-- after... | add list of theorems | add list of theorems
Old-commit-hash: ae20c5bded5fecd55d9723e7870ba03979cd0880
| Agda | mit | inc-lc/ilc-agda | |
dd18fcc5ba9cbb6d8cbf62d171887cf3a22893f5 | Base/Change/Products.agda | Base/Change/Products.agda | module Base.Change.Products where
open import Relation.Binary.PropositionalEquality
open import Level
open import Base.Change.Algebra
open import Data.Product
-- Also try defining sectioned change structures on the positives halves of
-- groups? Or on arbitrary subsets?
-- Restriction: we pair sets on the same lev... | Define a change structure for products | Define a change structure for products
Derivatives of curried functions seem challenging.
Accessing nested records too, but seems easy to fix.
Old-commit-hash: d89e6171d447aae6292cc025dc6db95ce2370b88
| Agda | mit | inc-lc/ilc-agda | |
16e3c79c254b8edd7f64b46df9c7c746fa4194c2 | Language/Simple/Free.agda | Language/Simple/Free.agda | {-# OPTIONS --without-K --copatterns #-}
open import Level.NP
open import Function hiding (_$_)
open import Type
open import Algebra
open import Algebra.FunctionProperties
open import Algebra.Structures
open import Data.Nat using (ℕ; zero; suc; _+_; _≤?_)
open import Data.Fin using (Fin; zero; suc)
open import Data.Vec... | Add Language.Simple.Free | Add Language.Simple.Free
| Agda | bsd-3-clause | crypto-agda/crypto-agda | |
a2284fe9263eadf1deb8ce96940c9f0cc72949bb | ModalLogic.agda | ModalLogic.agda | module ModalLogic where
-- Implement Frank Pfenning's lambda calculus based on modal logic S4, as
-- described in "A Modal Analysis of Staged Computation".
open import Denotational.Notation
data BaseType : Set where
Base : BaseType
Next : BaseType → BaseType
data Type : Set where
base : BaseType → Type
_⇒_ ... | Implement modal logic | Implement modal logic
This doesn't belong here, but it reuses @Toxaris modular library.
Old-commit-hash: 2f12ca949c8cb58e2b65b773607282bafbccb5c9
| Agda | mit | inc-lc/ilc-agda | |
006fd9c825ad2011f95bb01a40c7f000d4fd4f30 | bugs/Future.agda | bugs/Future.agda | module Future where
open import Denotational.Notation
-- Uses too much memory.
-- open import Data.Integer
open import Data.Product
open import Data.Sum
open import Data.Unit
postulate ⟦Int⟧ : Set
postulate ⟦Bag⟧ : Set → Set
--mutual
-- First, define a language of types, their denotations, and then the whole algeb... | add another bug example | Agda: add another bug example
Old-commit-hash: 82f681165ed59ccc36685cbf9c376026811e127f
| Agda | mit | inc-lc/ilc-agda | |
9bb44c3e31a11725d740b2f59d40ebbe7e0917a2 | FiniteField/JS.agda | FiniteField/JS.agda | {-# OPTIONS --without-K #-}
open import Function.NP
open import FFI.JS using (Number; Bool; true; false; String; warn-check; check; trace-call; _++_)
open import FFI.JS.BigI
open import Data.List.Base hiding (sum; _++_)
{-
open import Algebra.Raw
open import Algebra.Field
-}
module FiniteField.JS (q : BigI) where
abs... | Add FiniteField/JS | Add FiniteField/JS
| Agda | bsd-3-clause | crypto-agda/crypto-agda | |
a48ff25823603032db6b1a26e4605512aefd0561 | notes/FOT/FOTC/Data/Conat/ConatSL.agda | notes/FOT/FOTC/Data/Conat/ConatSL.agda | ------------------------------------------------------------------------------
-- Definition of FOTC Conat using Agda's co-inductive combinators
------------------------------------------------------------------------------
{-# OPTIONS --allow-unsolved-metas #-}
{-# OPTIONS --no-universe-polymorphism #-}
{-# OPTIONS -... | Add incomplete note on co-inductive natural numbers. | Add incomplete note on co-inductive natural numbers.
| Agda | mit | asr/fotc,asr/fotc | |
a5cd381752071ba8ed39615ef66d857a850a76f0 | autogen.ash | autogen.ash | #!/bin/ash
echo "compiling... be patient"
gccgo -o go `ls *.go | grep -v signal_notunix.go | grep -v _test.go | grep -v bootstrap | grep -v doc` -static-libgo
| #!/bin/ash
echo "compiling... be patient"
gccgo -Wl,-t -v -o go `ls *.go | grep -v signal_notunix.go | grep -v _test.go | grep -v bootstrap | grep -v doc` -static-libgo
| improve autogen | improve autogen
| AGS Script | bsd-3-clause | michalliu/faux-go,michalliu/faux-go |
9eb7bbb7bf83f8786c3c2722ec546f91fcb4078c | installation.ash | installation.ash | #!/bin/ash
#
# startscript: normaly run it only once
# (c) 2015/2016 sosyco@googlemail.com www.sosyco.de
#
# enhance the repositories and update the system
if ! [ -f "/etc/apk/repositories.org" ];
then
cp /etc/apk/repositories /etc/apk/repositories.org
sed -ni 'p; s/\/main/\/community/p' /etc/apk/repositories
f... | #!/bin/ash
#
# startscript: normaly run it only once
# (c) 2015/2016 sosyco@googlemail.com www.sosyco.de
#
# enhance the repositories and update the system
if ! [ -f "/etc/apk/repositories.org" ];
then
cp /etc/apk/repositories /etc/apk/repositories.org
sed -ni 'p; s/\/main/\/community/p' /etc/apk/repositories
f... | Update installation.ash | Update installation.ash
add central containeradmin-account | AGS Script | apache-2.0 | sosyco/alpine-dockerhost |
552849e3d082430f92e2182d72c234c380f8fd1e | web/generate_ssl_cert.ash | web/generate_ssl_cert.ash | #!/usr/bin/env ash
# Variables
BITS=${BITS:-'2048'}
CERT_DIR=${CERT_DIR:-'/etc/ssl/certs'}
DAYS=${DAYS:-'365'}
FQDN=${FQDN:-"example.churchoffoxx.net"}
# Functions
## Create the PEM format file
create_pem()
{
cat ${CERT_DIR}/${FQDN}.crt ${CERT_DIR}/${FQDN}.key | tee ${CERT_DIR}/${FQDN}.pem
}
## Create the certifi... | #!/usr/bin/env ash
# Variables
BITS=${BITS:-'2048'}
CERT_DIR=${CERT_DIR:-'/etc/ssl/certs'}
DAYS=${DAYS:-'365'}
FQDN=${FQDN:-"example.churchoffoxx.net"}
# Functions
## Create the PEM format file
create_pem()
{
cat ${CERT_DIR}/${FQDN}.crt ${CERT_DIR}/${FQDN}.key | tee ${CERT_DIR}/${FQDN}.pem
}
## Create the certifi... | Update generate_ssl_cert.ash | Update generate_ssl_cert.ash | AGS Script | apache-2.0 | frozenfoxx/util,frozenfoxx/util,frozenfoxx/util,frozenfoxx/util |
c4144239f70b735503df9032a52d7af7bd60c799 | autogen.ash | autogen.ash | #!/bin/ash
echo "compiling... be patient"
gccgo -o go `ls *.go | grep -v signal_notunix.go | grep -v _test.go | grep -v bootstrap | grep -v doc` -static-libgo
| add autogen.ash | add autogen.ash
| AGS Script | bsd-3-clause | michalliu/faux-go,michalliu/faux-go | |
e9761f45fc8540f3bd9ef379a8ed0797fe38c553 | src/scripts/lar-forecasting/lar-coverage.ash | src/scripts/lar-forecasting/lar-coverage.ash | notify "LeaChim";
import "lar-forecasting.ash";
boolean [location] quest_relevant_locations = $locations[
the spooky forest,
the dark neck of the woods,
the dark heart of the woods,
the dark elbow of the woods,
the black forest,
whitey's grove,
the hidden temple,
8-bit realm,
the old landfill,
the... | Add coverage script, to keep tabs on how far along the data is | Add coverage script, to keep tabs on how far along the data is
| AGS Script | apache-2.0 | mikebryant/kolmafia-lar-forecasting,mikebryant/kolmafia-lar-forecasting | |
926cad3f2b2ac96b2896af2d0f717f1f1867c228 | allopy/generate_test_target.als | allopy/generate_test_target.als | sig Person {
love: Person
}
run {
some x: Person {
x.love.love = x
}
} | sig Person {
love: Person
}
run {
some x: Person {
x.love.love = x
}
} | change indent | change indent
| Alloy | mit | nishio/learning_alloy,nishio/learning_alloy,nishio/learning_alloy |
49964b487b1d7cd475454e3036ba7dd43667f10d | illust_logic/illustLogic.als | illust_logic/illustLogic.als | open util/ordering[Col] as cols
open util/ordering[Row] as rows
abstract sig Region {
index: Int
}
sig Col extends Region {
cell: Row -> Color
}{
index >= 0
index <= 9
}
sig Row extends Region {}{
index >= 0
index <= 9
}
fact {
all r: Col - last {
add[r.index, 1] = r.next.index
}
all r: Row - last {
add[... | open util/ordering[Col] as cols
open util/ordering[Row] as rows
abstract sig Region {
index: Int
}
sig Col extends Region {
cell: Row -> Color
}{
index >= 0
index <= 9
}
sig Row extends Region {}{
index >= 0
index <= 9
}
fact {
all r: Col - last {
add[r.index, 1] = r.next.index
}
all r: Row - last {
add[... | add pred sorted | add pred sorted
| Alloy | mit | nishio/learning_alloy,nishio/learning_alloy,nishio/learning_alloy |
60fc274c9d162a75d488841ada03ce5bf5438751 | alloy/tutorial_questions.als | alloy/tutorial_questions.als | // This tutorial models a certain kind of state machine in Alloy
// A state machine is a set of states.
// Each state q has a successor relation.
// q.successors is the set of possible next states following state q
sig State {
successors: set State
}
// There is exactly one initial state
one sig Initial ext... | // This tutorial models a certain kind of state machine in Alloy
// A state machine is a set of states.
// Each state q has a successor relation.
// q.successors is the set of possible next states following state q
sig State {
successors: set State
}
// There is exactly one initial state
one sig Initial ext... | Update the alloy axercise | Update the alloy axercise
| Alloy | mit | jaanos/LVR-2016,jaanos/LVR-2016 |
17052eca0df60cfe2faeffbe5dbc6c54cd7dbdd9 | combinator.als | combinator.als | open util/ordering[Term]
some abstract sig Term {}
one sig K extends Term {}
sig Apply extends Term {
f, g: Term
}
fact {
all x, y: Term | (x -> y) in (f + g) => y not in (x.prevs + x)
}
pred equal (x, y: Term) {
x in Apply and x.f in Apply and x.f.f = K and y = x.f.g
}
fun apply(x, y: Term): Term{
{a: Apply... | open util/ordering[Term]
some abstract sig Term {}
one sig K extends Term {}
sig Apply extends Term {
f, g: Term
}
fact {
all x, y: Term | (x -> y) in (f + g) => y not in (x.prevs + x)
}
pred equal_k (x, y: Term) {
x in Apply and x.f in Apply and x.f.f = K and y = x.f.g
}
pred equal_k2 (x, y: Term) {
one a, b:... | clean pred equal | clean pred equal
| Alloy | mit | nishio/learning_alloy,nishio/learning_alloy,nishio/learning_alloy |
2237e8ad1fd93fdd535eb2cd435e5f5abf5f6515 | files/alloy/AUTH_without_unvalid.als | files/alloy/AUTH_without_unvalid.als | --------------------Initial State---------------
pred init [t: Time] {
no Track.op.t
Current_window.is_in.t = aws.Login
#List.elements.t = 0
}
---------------Generic AUTH Structure ----------
abstract sig Go, Login, Signup, Ok, Cancel, Logout extends Action_widget { }
abstract sig User, Password, User_save, Passwor... | --------------------Initial State---------------
pred init [t: Time] {
no Track.op.t
Current_window.is_in.t = aws.Login
#List.elements.t = 0
}
---------------Generic AUTH Structure ----------
abstract sig Go, Login, Signup, Ok, Cancel, Logout extends Action_widget { }
abstract sig User, Password, User_save, Passwor... | fix in auth | fix in auth
| Alloy | mit | danydunk/Augusto,danydunk/Augusto |
6bbb9dbef6ae80e0b5230041f1009b1478de3722 | tutorials/2017/wednesday/tutorial_questions.als | tutorials/2017/wednesday/tutorial_questions.als | // This tutorial models a certain kind of state machine in Alloy
// A state machine is a set of states.
// Each state q has a successor relation.
// q.successors is the set of possible next states following state q
sig State {
successors: set State
}
// There is exactly one initial state
one sig Initial ext... | // This tutorial models a certain kind of state machine in Alloy
// A state machine is a set of states.
// Each state q has a successor relation.
// q.successors is the set of possible next states following state q
sig State {
successors: set State
}
// There is exactly one initial state
one sig Initial ext... | Fix typo | Fix typo
| Alloy | mit | jaanos/LVR-2016,jaanos/LVR-2016 |
743a9ab9d3cdedc4ea99ab56450d64221ba72b45 | etude16.als | etude16.als | open util/ordering[Time]
open named_man_ja [Man]
open named_woman_ja [Woman]
sig Time {}
abstract sig Person {
state: State -> Time,
}
abstract sig Man, Woman extends Person {}
enum State {Married, NotMarried}
pred init (t: Time) {
all p: Person | p.state.t = NotMarried
}
pred step (t, t': Time) {
some disj p1... | open util/ordering[Time]
open named_man_ja [Man]
open named_woman_ja [Woman]
sig Time {}
abstract sig Person {
state: State -> Time,
}
abstract sig Man, Woman extends Person {}
enum State {Married, NotMarried}
pred init (t: Time) {
all p: Person | p.state.t = NotMarried
}
pred step (t, t': Time) {
some disj p1... | make not to marry women | make not to marry women
| Alloy | mit | nishio/learning_alloy,nishio/learning_alloy,nishio/learning_alloy |
45c8f608ddc12b021348c05aa0b48f3e0ab6a1df | alloy/tutorial_questions.als | alloy/tutorial_questions.als | // This tutorial models a certain kind of state machine in Alloy
// A state machine is a set of states.
// Each state q has a successor relation.
// q.successors is the set of possible next states following state q
sig State {
successors: set State
}
// There is exactly one initial state
one sig Initial ext... | // This tutorial models a certain kind of state machine in Alloy
// A state machine is a set of states.
// Each state q has a successor relation.
// q.successors is the set of possible next states following state q
sig State {
successors: set State
}
// There is exactly one initial state
one sig Initial ext... | Fix typo in exercises | Fix typo in exercises
| Alloy | mit | jaanos/LVR-2016,jaanos/LVR-2016 |
030b22e20b554947bf28db0f5a232fddfe04baf2 | Workspace/RASD/Alloy/PowerEnjoy.als | Workspace/RASD/Alloy/PowerEnjoy.als | module PowEnj
//SIGNATURES
sig Position{}
sig Email{}
sig Code{}
sig Plug{}
abstract sig Bool{}
sig False extends Bool{}
sig True extends Bool{}
abstract sig State{}
sig FreeState extends State{}
sig ReservedState extends State{}
sig RentedState extends State{}
sig DriverLicense{
code:one Code,
expiration:Int
}
... | module PowEnj
//SIGNATURES
sig Position{}
sig Email{}
sig Code{}
sig Plug{}
abstract sig Bool{}
sig False extends Bool{}
sig True extends Bool{}
abstract sig State{}
sig FreeState extends State{}
sig ReservedState extends State{}
sig RentedState extends State{}
sig DriverLicense{
code:one Code,
expiration:Int
}
... | Edit alloy model | Edit alloy model
| Alloy | mit | FrancescoZ/PowerEnJoy |
d81b0551c008d203ab157c4243ac905cc66eac31 | Perterson.als | Perterson.als | open util/ordering[Time]
sig Time {}
one sig Memory {
turn: Int -> Time,
flag: Int -> Int -> Time
}{
all t: Time {
one flag[0].t
one flag[1].t
}
}
one sig PC {
proc: Int -> Int -> Time
}{
all t: Time {
one proc[0].t
one proc[1].t
}
}
fact {
// 最初はメモリはみんな0
let t = first {
Memory.turn.t = 0
Memor... | add Peterson | add Peterson
| Alloy | mit | nishio/learning_alloy,nishio/learning_alloy,nishio/learning_alloy | |
7c590f18fad924f5b583f3807a736fb483e43cbc | Perterson.als | Perterson.als | open util/ordering[Time]
sig Time {}
one sig Memory {
turn: Int -> Time,
flag: Int -> Int -> Time
}{
all t: Time {
one flag[0].t
one flag[1].t
no flag[Int - 0 - 1].t
}
}
one sig PC {
proc: Int -> Int -> Time,
current_pid: Int -> Time
}{
all t: Time {
one proc[0].t
one proc[1].t
no proc[Int - 0 - 1]... | open util/ordering[Time]
sig Time {}
one sig Memory {
turn: Int -> Time,
flag: Int -> Int -> Time
}{
all t: Time {
one flag[0].t
one flag[1].t
no flag[Int - 0 - 1].t
}
}
one sig PC {
proc: Int -> Int -> Time,
current_pid: Int -> Time
}{
all t: Time {
one proc[0].t
one proc[1].t
no proc[Int - 0 - 1]... | fix bug in comment | fix bug in comment
| Alloy | mit | nishio/learning_alloy,nishio/learning_alloy,nishio/learning_alloy |
af2ce59dc2d8c72a71c67ab77f1c6ffa551c2531 | models/Voting.als | models/Voting.als | -- (c) 2010-2011, Dermot Cochran, IT University of Copenhagen
-- http://www.kindsoftware.com/about/people/dc
-- http://www.itu.dk/people/dero
module Voting
open util/integer
-- Note that all axioms should be expressed as facts appended to signatures
-- Standalone facts will be ignored by the API, but not by the anal... | -- (c) 2010-2011, Dermot Cochran, IT University of Copenhagen
-- http://www.kindsoftware.com/about/people/dc
-- http://www.itu.dk/people/dero
module Voting
open util/integer
-- Note that all axioms should be expressed as facts appended to signatures
-- Standalone facts will be ignored by the API, but not by the anal... | Add concept of non-transferable ballots, as this path through the code has not been covered. | Add concept of non-transferable ballots, as this path through the code has not been covered.
Incomplete - task : Coverage profiling of universal tests
| Alloy | mit | GaloisInc/Votail,GaloisInc/Votail,GaloisInc/Votail |
90efe81d660c504f16c2769ac870cb89c0cb80ac | illust_logic/illustlogic_not_work.als | illust_logic/illustlogic_not_work.als | // Illust Logic
abstract sig Cell {
color: Color,
hnext: lone Cell,
vnext: lone Cell
}
enum Color {Black, White}
fun range(start, end : Cell, r: Cell -> Cell): Cell{
(start + start.^r) & (end.^(~r) + end)
}
pred all_black(cells : Cell, size: Int){
#cells = size
all c: cells{
c.color = Black
}
}
pr... | add first version (not work) | add first version (not work)
| Alloy | mit | nishio/learning_alloy,nishio/learning_alloy,nishio/learning_alloy | |
55acd93d179d93478ac5d555680fba9179979ad9 | Perterson.als | Perterson.als | open util/ordering[Time]
sig Time {}
one sig Memory {
turn: Int -> Time,
flag: Int -> Int -> Time
}{
all t: Time {
one flag[0].t
one flag[1].t
no flag[Int - 0 - 1].t
}
}
one sig PC {
proc: Int -> Int -> Time
}{
all t: Time {
one proc[0].t
one proc[1].t
no proc[Int - 0 - 1].t
}
}
fact {
// 最初はメモリ... | open util/ordering[Time]
sig Time {}
one sig Memory {
turn: Int -> Time,
flag: Int -> Int -> Time
}{
all t: Time {
one flag[0].t
one flag[1].t
no flag[Int - 0 - 1].t
}
}
one sig PC {
proc: Int -> Int -> Time,
current_pid: Int -> Time
}{
all t: Time {
one proc[0].t
one proc[1].t
no proc[Int - 0 - 1]... | add correct assertion | add correct assertion
| Alloy | mit | nishio/learning_alloy,nishio/learning_alloy,nishio/learning_alloy |
5f7c91b7de64c8a2ca447af29382ed60da23b254 | etude16.als | etude16.als | open util/ordering[Time]
open named_man_ja [Man]
open named_woman_ja [Woman]
sig Time {}
abstract sig Person {
state: State -> Time,
}
abstract sig Man, Woman extends Person {}
enum State {Married, NotMarried}
pred init (t: Time) {
all p: Person | p.state.t = NotMarried
}
pred step (t, t': Time) {
some disj p1... | open util/ordering[Time]
open named_man_ja [Man]
open named_woman_ja [Woman]
sig Time {}
abstract sig Person {
state: State -> Time,
}
abstract sig Man, Woman extends Person {}
enum State {Married, NotMarried}
pred init (t: Time) {
all p: Person | p.state.t = NotMarried
}
pred change_state (
p1 : Man, p2 : Wom... | refactor and fix bug | refactor and fix bug
| Alloy | mit | nishio/learning_alloy,nishio/learning_alloy,nishio/learning_alloy |
fadf0bf492792210518a9c9db6dc8d80a599b71a | tutorials/2017/thursday/tutorial_questions.als | tutorials/2017/thursday/tutorial_questions.als | // This tutorial models a certain kind of state machine in Alloy
// A state machine is a set of states.
// Each state q has a successor relation.
// q.successors is the set of possible next states following state q
sig State {
successors: set State
}
// There is exactly one initial state
one sig Initial ext... | Copy Alloy exercise for Thursday's tutorial | Copy Alloy exercise for Thursday's tutorial
| Alloy | mit | jaanos/LVR-2016,jaanos/LVR-2016 | |
a66c8712251409e409354d628e5a8be436f1e103 | alloy/alloy_lecture_example.als | alloy/alloy_lecture_example.als | // A file system object in the file system
sig FSObject { parent: lone Dir }
// A directory in the file system
sig Dir extends FSObject { contents: set FSObject }
// A file in the file system
sig File extends FSObject { }
// There exists a root
one sig Root extends Dir { } { no parent }
//All file system objects ar... | // A file system object in the file system
// Every object has at most one parent
sig FSObject { parent: lone Dir }
// The set of directories in the file system
sig Dir extends FSObject { contents: set FSObject }
// The set of files in the file system
sig File extends FSObject { }
// There exists a unique root
one s... | Update lecture example | Update lecture example
| Alloy | mit | jaanos/LVR-2016,jaanos/LVR-2016 |
5905888708041e550b4601f58fac68fd12198056 | alloy/tutorial_questions.als | alloy/tutorial_questions.als | // This tutorial models a certain kind of state machine in Alloy
// A state machine is a set of states.
// Each state q has a successor relation.
// q.successors is the set of possible next states following state q
sig State {
successors: set State
}
// There is exactly one initial state
one sig Initial ext... | // This tutorial models a certain kind of state machine in Alloy
// A state machine is a set of states.
// Each state q has a successor relation.
// q.successors is the set of possible next states following state q
sig State {
successors: set State
}
// There is exactly one initial state
one sig Initial ext... | Add solutions from the tutorial | Add solutions from the tutorial
| Alloy | mit | jaanos/LVR-2016,jaanos/LVR-2016 |
a599bbe13c5538619b3cb7884745a89b13e395fa | illust_logic/illustLogic.als | illust_logic/illustLogic.als | open util/ordering[Col] as cols
open util/ordering[Row] as rows
abstract sig Region {}
sig Col extends Region {
cell: Row -> Cell
}
sig Row extends Region {}
enum Cell { Black, White }
fact {
all c: Col, r: Row | one cell [c, r]
}
-- about rows
pred blackHeadInRow (c: Col, r: Row) {
c in first or cell[c.prev, ... | open util/ordering[Col] as cols
open util/ordering[Row] as rows
abstract sig Region {}
sig Col extends Region {
cell: Row -> Cell
}
sig Row extends Region {}
enum Cell { Black, White }
fact {
all c: Col, r: Row | one cell [c, r]
}
-- about rows
pred blackHeadInRow (c: Col, r: Row) {
c in first or cell[c.prev, ... | add comment etc | add comment etc
| Alloy | mit | nishio/learning_alloy,nishio/learning_alloy,nishio/learning_alloy |
06f13901dc94e0f832eecdd79936f0d6d8cce84a | illust_logic/illustLogic.als | illust_logic/illustLogic.als | open util/ordering[Col] as cols
open util/ordering[Row] as rows
abstract sig Region {
index: Int
}
sig Col extends Region {
cell: Row -> Color
}{
index >= 0
index <= 9
}
sig Row extends Region {}{
index >= 0
index <= 9
}
fact {
all r: Col - last {
add[r.index, 1] = r.next.index
}
all r: Row - last {
add[... | open util/ordering[Col] as cols
open util/ordering[Row] as rows
abstract sig Region {
index: Int
}
sig Col extends Region {
cell: Row -> Color
}{
index >= 0
index <= 9
}
sig Row extends Region {}{
index >= 0
index <= 9
}
fact {
all r: Col - last {
add[r.index, 1] = r.next.index
}
all r: Row - last {
add[... | remove noOtherHeadsIn* because they are not used | remove noOtherHeadsIn* because they are not used
| Alloy | mit | nishio/learning_alloy,nishio/learning_alloy,nishio/learning_alloy |
db5973dec243e177440b5f4cefbbf85acaa47ab1 | tutorials/2017/thursday/tutorial_questions.als | tutorials/2017/thursday/tutorial_questions.als | // This tutorial models a certain kind of state machine in Alloy
// A state machine is a set of states.
// Each state q has a successor relation.
// q.successors is the set of possible next states following state q
sig State {
successors: set State
}
// There is exactly one initial state
one sig Initial ext... | // This tutorial models a certain kind of state machine in Alloy
// A state machine is a set of states.
// Each state q has a successor relation.
// q.successors is the set of possible next states following state q
sig State {
successors: set State
}
// There is exactly one initial state
one sig Initial ext... | Add Thursday's solutions | Add Thursday's solutions
| Alloy | mit | jaanos/LVR-2016,jaanos/LVR-2016 |
14a02557c59fb8630e6529266520f24b99bbc9dc | etude16.als | etude16.als | open util/ordering[Time]
sig Time {}
sig Person {
state: State -> Time,
}
enum State {Married, NotMarried}
pred init (t: Time) {
all p: Person | p.state.t = NotMarried
}
pred step (t, t': Time) {
some disj p1, p2 : Person {
{
// marrige
p1.state.t = NotMarried and p2.state.t = NotMarried
p1.state.t' ... | open util/ordering[Time]
open named_man_ja [Man]
open named_woman_ja [Woman]
sig Time {}
abstract sig Person {
state: State -> Time,
}
abstract sig Man, Woman extends Person {}
enum State {Married, NotMarried}
pred init (t: Time) {
all p: Person | p.state.t = NotMarried
}
pred step (t, t': Time) {
some disj p1... | add names | add names
| Alloy | mit | nishio/learning_alloy,nishio/learning_alloy,nishio/learning_alloy |
59e841b4220a473fc44fa0343818bd4298ee23ad | alloy/simple_maze.als | alloy/simple_maze.als | module maze_maker/simple_maze
open util/ordering[Col] as cols
open util/ordering[Row] as rows
// 迷路のサイズ
fun height : Int {
10
}
fun width: Int {
10
}
// 隣接する Cell
fun adjacent (col: Col, row: Row) : Col -> Row {
col.prev -> row +
col.next -> row +
col -> row.prev +
col -> row.next
}
sig Col {
paths: R... | module maze_maker/simple_maze
open util/ordering[Col] as cols
open util/ordering[Row] as rows
// 隣接する Cell
fun adjacent (col: Col, row: Row) : Col -> Row {
col.prev -> row +
col.next -> row +
col -> row.prev +
col -> row.next
}
sig Col {
paths: Row -> Col -> Row
} {
// 自分自身との接続はなし
all row: Row | no (th... | use Scope to specify maze's size. | use Scope to specify maze's size.
| Alloy | mit | nagachika/maze_maker,nagachika/maze_maker,nagachika/maze_maker |
fe9e0ce63d7ff6272b2c01ac17124a5e99e9dbf5 | manual/copying.als | manual/copying.als | Applied Logic Systems, Inc.'s "Copying ALS"
This is the file "Copying ALS". It applies to files which are marked
Copyright (c) xxxx Applied Logic Systems, Inc.
Distribution rights per Copying ALS
This document is Copyright (c) 1996-9 Applied Logic Systems, Inc., and may
be distributed verbatim, but changing... | Applied Logic Systems, Inc.'s "Copying ALS"
This is the file "Copying ALS". It applies to files which are marked
Copyright (c) xxxx Applied Logic Systems, Inc.
Distribution rights per Copying ALS
This document is Copyright (c) 1996-9 Applied Logic Systems, Inc., and may
be distributed verbatim, but changing... | Split long line | Split long line
| Alloy | mit | AppliedLogicSystems/ALSProlog,AppliedLogicSystems/ALSProlog,AppliedLogicSystems/ALSProlog,AppliedLogicSystems/ALSProlog,AppliedLogicSystems/ALSProlog,AppliedLogicSystems/ALSProlog,AppliedLogicSystems/ALSProlog,AppliedLogicSystems/ALSProlog,AppliedLogicSystems/ALSProlog |
9c7ddd8d5f48f30cdf4f3bfaba4359a00cc5cc45 | Alloy/PowerEnjoy.als | Alloy/PowerEnjoy.als | module PowEnj
//SIGNATURES
sig Position
{
latitude:Int, //should be float
longitude:Int //should be float
}
abstract sig User
{
rentedCar: one Car, //field that indicates which car the user is using at the moment
payInfo: some Payment,
position: one Position
}
fact driverIsUnique
{
//can’t exist two renters who r... | module PowEnj
//SIGNATURES
sig Position
{
latitude:Int, //should be float
longitude:Int //should be float
}
sig Visitor{
}
sig DriverLicense{
code:String,
expiration:Int,
drivername:String,
driversurname:String
}
sig User
{
rentedCar: one Car, //field that indicates which car the user is using at the moment
payIn... | Edit alloy model | Edit alloy model
| Alloy | mit | FrancescoZ/PowerEnJoy |
da8b5936c5115ae2636ab763e86f072a9849f3e7 | mappings/c11_x86a.als | mappings/c11_x86a.als | open ../archs/exec_C[SE] as SW
open ../archs/exec_x86[HE] as HW
/*
A C11-to-x86 mapping that implements SC atomics using
atomic hardware events. Currently broken.
*/
module c11_x86a[SE,HE]
fun myfr_init [X:HW/Exec_X86] : HE->HE {
((stor[X.R]) - ((~(X.rf)) . (X.rf))) . (X.sloc) . (stor[X.W])
}
fun myfr [X:HW/Exec... | Revert "mappings: remove unused experiment" | Revert "mappings: remove unused experiment"
This reverts commit e4da5cad5d3f7878bb65ab8b9704c9ab4a8951c0.
| Alloy | mit | johnwickerson/memalloy,johnwickerson/memalloy,johnwickerson/memalloy | |
78198c963089b784f988f0babd3c8335daf9acbe | make_puzzle2.als | make_puzzle2.als | enum Person {X, Y, Z}
enum Bool {T, F}
// 制約
abstract sig Constrain{}
// 「Xが『Yは嘘つきだ』と言った」という制約
sig is_liar extends Constrain {
by: one Person,
who: some Person
}
// 与えられたx, y, zの真偽値の対が制約を満たすかどうか返す
// 引数を変えて試すため、述語にくくり出されている必要がある
pred satisfy(cs: Constrain, x, y, z: Bool){
let p2b = (X -> x) + (Y -> y) + (Z -> z) {... | enum Person {A, B, C, D, E}
enum Bool {T, F}
// 制約
abstract sig Constrain{}
// 「Xが『Yは嘘つきだ』と言った」という制約
sig is_liar extends Constrain {
by: one Person,
who: one Person
}{
by not in who
}
fact {
// 違う人は違うことを言う
all disj p1, p2: Person {
by.p1 != by.p2
}
// 一人の人は3人以上を嘘つき呼ばわりしない
all p: Person {
#{by.p} < 3
}
}
... | make puzzle | make puzzle
| Alloy | mit | nishio/learning_alloy,nishio/learning_alloy,nishio/learning_alloy |
8dedca93d5989ff5092d8b9cf1d3d083273814ee | demo_of_named_man.als | demo_of_named_man.als | open named_man_ja [Man]
open named_woman_ja [Woman]
abstract sig Person {
love: Person
}
abstract sig Man extends Person {
}
abstract sig Woman extends Person {
}
run {
#Man = 3
#Woman = 5
} for 10
| add sample to use named_* module | add sample to use named_* module
| Alloy | mit | nishio/learning_alloy,nishio/learning_alloy,nishio/learning_alloy | |
211ecc55250422ad24b208a986ac841d33641fc8 | etude17.als | etude17.als | open util/ordering[Time]
open named_man_ja [Man]
open named_woman_ja [Woman]
sig Time {}
abstract sig Person {
state: State -> Time,
}{
all t: Time | one state.t
}
abstract sig Man, Woman extends Person {}
enum State {NotExist, Married, NotMarried}
pred init (t: Time) {
all p: Person | p.state.t in NotMarried +... | open util/ordering[Time]
open named_man_ja [Man]
open named_woman_ja [Woman]
sig Time {}
abstract sig Person {
state: State -> Time,
partner: Person -> Time,
parent_bio: set Person
}{
all t: Time | one state.t
all t: Time | lone partner.t
let p = parent_bio {no p or {one p & Man and one p & Woman}}
}
abstract ... | add parent | add parent
| Alloy | mit | nishio/learning_alloy,nishio/learning_alloy,nishio/learning_alloy |
b39ab89eeeae8be460ac223f634fc8a71da6cd15 | etude17.als | etude17.als | open util/ordering[Time]
open named_man_ja [Man]
open named_woman_ja [Woman]
sig Time {}
abstract sig Person {
state: State -> Time,
partner: Person -> Time,
parent_bio: set Person
}{
all t: Time | one state.t
all t: Time | lone partner.t
let p = parent_bio {no p or {one p & Man and one p & Woman}}
}
abstract ... | open util/ordering[Time]
open named_man_ja [Man]
open named_woman_ja [Woman]
sig Time {
event: lone Event
}
fact {
no first.event
all t: Time - first {one t.event}
}
abstract sig Person {
state: State -> Time,
partner: Person -> Time,
parent_bio: set Person
}{
all t: Time | one state.t
all t: Time | lone par... | fix bug: parent works now | fix bug: parent works now
| Alloy | mit | nishio/learning_alloy,nishio/learning_alloy,nishio/learning_alloy |
c2eba126be95e1fd1e57206138c2115fe34be63a | tutorials/2017/wednesday/tutorial_questions.als | tutorials/2017/wednesday/tutorial_questions.als | // This tutorial models a certain kind of state machine in Alloy
// A state machine is a set of states.
// Each state q has a successor relation.
// q.successors is the set of possible next states following state q
sig State {
successors: set State
}
// There is exactly one initial state
one sig Initial ext... | Add Alloy exercise for Wednesday's tutorial | Add Alloy exercise for Wednesday's tutorial
| Alloy | mit | jaanos/LVR-2016,jaanos/LVR-2016 | |
95a459c61053f8ed3a817ecfb37615440b966c4b | alloy/simple_maze.als | alloy/simple_maze.als | module maze_maker/simple_maze
open util/ordering[Col] as cols
open util/ordering[Row] as rows
// 迷路のサイズ
fun height : Int {
3
}
fun width: Int {
3
}
// 隣接する Cell
fun adjacent (col: Col, row: Row) : Col -> Row {
col.prev -> row +
col.next -> row +
col -> row.prev +
col -> row.next
}
sig Col {
paths: Row... | module maze_maker/simple_maze
open util/ordering[Col] as cols
open util/ordering[Row] as rows
// 迷路のサイズ
fun height : Int {
10
}
fun width: Int {
10
}
// 隣接する Cell
fun adjacent (col: Col, row: Row) : Col -> Row {
col.prev -> row +
col.next -> row +
col -> row.prev +
col -> row.next
}
sig Col {
paths: R... | increase maze size 3x3 -> 10x10. | increase maze size 3x3 -> 10x10.
| Alloy | mit | nagachika/maze_maker,nagachika/maze_maker,nagachika/maze_maker |
ef0a80a0983b91f920cff19c9b29374a63b2d4c2 | illust_logic/illustLogic.als | illust_logic/illustLogic.als | open util/ordering[Col] as cols
open util/ordering[Row] as rows
abstract sig Region {
index: Int
}
sig Col extends Region {
cell: Row -> Color
}{
index >= 0
index <= 9
}
sig Row extends Region {}{
index >= 0
index <= 9
}
fact {
all r: Col - last {
add[r.index, 1] = r.next.index
}
all r: Row - last {
a... | open util/ordering[Col] as cols
open util/ordering[Row] as rows
abstract sig Region {
index: Int
}
sig Col extends Region {
cell: Row -> Color
}{
index >= 0
index <= 9
}
sig Row extends Region {}{
index >= 0
index <= 9
}
fact {
all r: Col - last {
add[r.index, 1] = r.next.index
}
all r: Row - last {
add... | remove Int2* | remove Int2*
| Alloy | mit | nishio/learning_alloy,nishio/learning_alloy,nishio/learning_alloy |
907e3b761e0c8df1d546137d0f78887a5e5437bc | illust_logic/illustLogic.als | illust_logic/illustLogic.als | open util/ordering[Col] as cols
open util/ordering[Row] as rows
abstract sig Region {
index: Int
}
sig Col extends Region {
cell: Row -> Color
}{
index >= 0
index <= 9
}
sig Row extends Region {}{
index >= 0
index <= 9
}
fact {
all r: Col - last {
add[r.index, 1] = r.next.index
}
all r: Row - last {
add[... | open util/ordering[Col] as cols
open util/ordering[Row] as rows
abstract sig Region {
index: Int
}
sig Col extends Region {
cell: Row -> Color
}{
index >= 0
index <= 9
}
sig Row extends Region {}{
index >= 0
index <= 9
}
fact {
all r: Col - last {
add[r.index, 1] = r.next.index
}
all r: Row - last {
add[... | refactor fun range | refactor fun range
| Alloy | mit | nishio/learning_alloy,nishio/learning_alloy,nishio/learning_alloy |
a79d06c2d7b8dc1dfc073973e633ecc09632e57c | tutorials/2017/wednesday/tutorial_questions.als | tutorials/2017/wednesday/tutorial_questions.als | // This tutorial models a certain kind of state machine in Alloy
// A state machine is a set of states.
// Each state q has a successor relation.
// q.successors is the set of possible next states following state q
sig State {
successors: set State
}
// There is exactly one initial state
one sig Initial ext... | // This tutorial models a certain kind of state machine in Alloy
// A state machine is a set of states.
// Each state q has a successor relation.
// q.successors is the set of possible next states following state q
sig State {
successors: set State
}
// There is exactly one initial state
one sig Initial ext... | Add solutions from Wednesday's tutorials | Add solutions from Wednesday's tutorials
| Alloy | mit | jaanos/LVR-2016,jaanos/LVR-2016 |
ccedfcb547d48f97f50301ef72e28d7def6014a7 | illust_logic/illustLogic.als | illust_logic/illustLogic.als | open util/ordering[Col] as cols
open util/ordering[Row] as rows
abstract sig Region {
index: Int
}
sig Col extends Region {
cell: Row -> Color
}{
index >= 0
index <= 9
}
sig Row extends Region {}{
index >= 0
index <= 9
}
fact {
all r: Col - last {
add[r.index, 1] = r.next.index
}
all r: Row - last {
add... | open util/ordering[Col] as cols
open util/ordering[Row] as rows
abstract sig Region {
index: Int
}
sig Col extends Region {
cell: Row -> Color
}{
index >= 0
index <= 9
}
sig Row extends Region {}{
index >= 0
index <= 9
}
fact {
all r: Col - last {
add[r.index, 1] = r.next.index
}
all r: Row - last {
a... | remove blackHeadIn* | remove blackHeadIn*
| Alloy | mit | nishio/learning_alloy,nishio/learning_alloy,nishio/learning_alloy |
3334bdd3a0bfb5b3533ea6e36840926d24eea248 | src/dot.g4 | src/dot.g4 | grammar dot;
graph : (STRICT)? (GRAPH | DIGRAPH) (ID)? '{' stmt_list '}';
stmt_list : (stmt ';'?)* ;
stmt : node_stmt
| edge_stmt
| attr_stmt
| id '=' id
| subgraph;
attr_stmt : (GRAPH | NODE | EDGE) attr_list;
attr_list : '[' ( a_lis... | grammar dot;
graph : STRICT? (GRAPH | DIGRAPH) id? '{' stmt_list '}';
stmt_list : (stmt ';'?)* ;
stmt : node_stmt
| edge_stmt
| attr_stmt
| id '=' id
| subgraph;
attr_stmt : (GRAPH | NODE | EDGE) attr_list;
attr_list : ('[' a_list? ']... | Update dot grammar. | Update dot grammar.
| ANTLR | mit | migulorama/AutoAnalyze,migulorama/AutoAnalyze |
eee3c3f97bf170a8e7c31fd52aaf82b303831af5 | omni-cx2x/src/cx2x/translator/language/Claw.g4 | omni-cx2x/src/cx2x/translator/language/Claw.g4 | /*
* This file is released under terms of BSD license
* See LICENSE file for more information
*/
/**
* ANTLR 4 Grammar file for the CLAW directive language.
*
* @author clementval
*/
grammar Claw;
@header
{
import cx2x.translator.common.ClawConstant;
import cx2x.translator.misc.Utility;
}
/*------------------... | /*
* This file is released under terms of BSD license
* See LICENSE file for more information
*/
/**
* ANTLR 4 Grammar file for the CLAW directive language.
*
* @author clementval
*/
grammar Claw;
@header
{
import cx2x.translator.common.ClawConstant;
import cx2x.translator.misc.Utility;
}
/*------------------... | Add correct grammar for claw ignore and end ignore | Add correct grammar for claw ignore and end ignore
| ANTLR | bsd-2-clause | clementval/claw-compiler,clementval/claw-compiler |
45b028c111014f2f20751d930c6abb6a4baae271 | sharding-core/src/main/antlr4/io/shardingsphere/core/parsing/antlr/autogen/OracleStatement.g4 | sharding-core/src/main/antlr4/io/shardingsphere/core/parsing/antlr/autogen/OracleStatement.g4 | grammar OracleStatement;
import OracleKeyword, Keyword, OracleBase, OracleCreateIndex, OracleAlterIndex
, OracleDropIndex, OracleCreateTable, OracleAlterTable, OracleDropTable, OracleTruncateTable
, OracleTCLStatement, OracleDCLStatement
;
execute
: createIndex
| alterIndex
| dropInde... | grammar OracleStatement;
import OracleKeyword, Keyword, OracleBase, OracleCreateIndex, OracleAlterIndex
, OracleDropIndex, OracleCreateTable, OracleAlterTable, OracleDropTable, OracleTruncateTable
, OracleTCLStatement, OracleDCLStatement
;
execute
: createIndex
| alterIndex
| dropInde... | add create role statement | add create role statement
| ANTLR | apache-2.0 | leeyazhou/sharding-jdbc,leeyazhou/sharding-jdbc,apache/incubator-shardingsphere,apache/incubator-shardingsphere,leeyazhou/sharding-jdbc,apache/incubator-shardingsphere,apache/incubator-shardingsphere,leeyazhou/sharding-jdbc |
b8588d926c695b37dccc4c1e0201c086d98f2f81 | src/main/antlr4/YokohamaUnitLexer.g4 | src/main/antlr4/YokohamaUnitLexer.g4 | lexer grammar YokohamaUnitLexer;
HASH1: '#' ;
HASH2: '##' ;
HASH3: '###' ;
HASH4: '####' ;
HASH5: '#####' ;
HASH6: '######' ;
TEST: 'Test:' [ \t]* -> mode(TEST_NAME);
TABLE_CAPTION: '[' -> skip, mode(TABLE_NAME);
SETUP: 'Setup' -> mode(PHASE_LEADING);
EXERCISE: 'Exercise' -> mode(PHASE_LEADING);
VERIFY:... | lexer grammar YokohamaUnitLexer;
STAR_LBRACKET: '*[' -> skip, mode(ABBREVIATION);
HASH1: '#' ;
HASH2: '##' ;
HASH3: '###' ;
HASH4: '####' ;
HASH5: '#####' ;
HASH6: '######' ;
TEST: 'Test:' [ \t]* -> mode(TEST_NAME);
TABLE_CAPTION: '[' -> skip, mode(TABLE_NAME);
SETUP: 'Setup' -> mode(PHASE_LEADING);
EXE... | Arrange order of rules | Arrange order of rules | ANTLR | mit | tkob/yokohamaunit,tkob/yokohamaunit |
da613bc8244ad90c77a93ac2ea698d50dfeeb428 | sharding-parser/sharding-parser-mysql/src/main/antlr4/imports/mysql/MySQLDMLStatement.g4 | sharding-parser/sharding-parser-mysql/src/main/antlr4/imports/mysql/MySQLDMLStatement.g4 | grammar MySQLDMLStatement;
import MySQLKeyword, Keyword, Symbol, MySQLDQLStatement, MySQLBase, BaseRule, DataType;
insert
: INSERT (LOW_PRIORITY | DELAYED | HIGH_PRIORITY IGNORE)? INTO? tableName (PARTITION ignoredIdentifiers_)? (setClause | columnClause) onDuplicateKeyClause?
;
columnClause
: columnName... | grammar MySQLDMLStatement;
import MySQLKeyword, Keyword, Symbol, MySQLDQLStatement, MySQLBase, BaseRule, DataType;
insert
: INSERT (LOW_PRIORITY | DELAYED | HIGH_PRIORITY)? IGNORE? INTO? tableName (PARTITION ignoredIdentifiers_)? (setClause | columnClause) onDuplicateKeyClause?
;
columnClause
: columnNam... | refactor MySQLDMLStatement.g4 | refactor MySQLDMLStatement.g4
| ANTLR | apache-2.0 | leeyazhou/sharding-jdbc,apache/incubator-shardingsphere,leeyazhou/sharding-jdbc,leeyazhou/sharding-jdbc,apache/incubator-shardingsphere,apache/incubator-shardingsphere,leeyazhou/sharding-jdbc,apache/incubator-shardingsphere |
07ab552eb3a92d88c26b178dd58f45c06a497826 | src/main/antlr/WorkflowCatalogQueryLanguage.g4 | src/main/antlr/WorkflowCatalogQueryLanguage.g4 | grammar WorkflowCatalogQueryLanguage;
@header {
package org.ow2.proactive.workflow_catalog.rest.query;
}
clause: ATTRIBUTE OPERATOR VALUE ;
clauses: clause ( CONJUNCTION clause )* ;
statement: '(' clauses ')' | clauses ;
ATTRIBUTE: ([a-z] | [A-Z])+ ([_.]+ ([a-z] | [A-Z] | [0-9])*)* ;
CONJUNCTION: 'AND' | 'OR' ;
O... | grammar WorkflowCatalogQueryLanguage;
@header {
package org.ow2.proactive.workflow_catalog.rest.query;
}
// PARSER
expression
: and_expression
;
and_expression
: or_expression (AND or_expression)*
;
or_expression
: clause (OR clause)*
;
clause
: (AttributeLiteral COMPARE_OPERATOR St... | Update grammar for our Workflow Catalog Query Language (WCQL) | Update grammar for our Workflow Catalog Query Language (WCQL)
| ANTLR | agpl-3.0 | ow2-proactive/catalog,laurianed/catalog,laurianed/catalog,gparanthoen/workflow-catalog,yinan-liu/workflow-catalog,lpellegr/workflow-catalog,ShatalovYaroslav/catalog,ow2-proactive/catalog,laurianed/workflow-catalog,ow2-proactive/workflow-catalog,laurianed/catalog,ow2-proactive/catalog,paraita/workflow-catalog,ShatalovYa... |
a2ceedcc2d68635f431e5b2b2b2ec30536a9bf11 | sharding-core/sharding-core-parse/sharding-core-parse-oracle/src/main/antlr4/imports/oracle/DDLStatement.g4 | sharding-core/sharding-core-parse/sharding-core-parse-oracle/src/main/antlr4/imports/oracle/DDLStatement.g4 | /*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may ... | /*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may ... | add indexExpressions_ | add indexExpressions_
| ANTLR | apache-2.0 | leeyazhou/sharding-jdbc,leeyazhou/sharding-jdbc,apache/incubator-shardingsphere,apache/incubator-shardingsphere,leeyazhou/sharding-jdbc,apache/incubator-shardingsphere,apache/incubator-shardingsphere,leeyazhou/sharding-jdbc |
0ae6e4fe1de63b85ed382a95c29d7d2f2f419542 | omni-cx2x/src/cx2x/translator/language/Claw.g4 | omni-cx2x/src/cx2x/translator/language/Claw.g4 | /*
* This file is released under terms of BSD license
* See LICENSE file for more information
*/
/**
* ANTLR 4 Grammar file for the CLAW directive language.
*
* @author clementval
*/
grammar Claw;
@header
{
import java.util.List;
import java.util.ArrayList;
}
/*-----------------------------------------------... | /*
* This file is released under terms of BSD license
* See LICENSE file for more information
*/
/**
* ANTLR 4 Grammar file for the CLAW directive language.
*
* @author clementval
*/
grammar Claw;
@header
{
import java.util.List;
import java.util.ArrayList;
}
/*-----------------------------------------------... | Add options lexer rules | Add options lexer rules
| ANTLR | bsd-2-clause | clementval/claw-compiler,clementval/claw-compiler |
1542a2e4ee4822111ecfd1f23b655ebaa3278151 | sharding-core/src/main/antlr4/imports/Symbol.g4 | sharding-core/src/main/antlr4/imports/Symbol.g4 | lexer grammar Symbol;
AND_: '&&';
OR_: '||';
NOT_: '!';
UNARY_BIT_COMPLEMENT: '~';
BIT_INCLUSIVE_OR: '|';
BIT_AND: '&';
SIGNED_LEFT_SHIFT: '<<';
SIGNED_RIGHT_SHIFT: '>>';
BIT_EXCLUSIVE_OR: '^';
MOD_: '%';
COLON:':';
PLUS: '+' ;
MINUS: '-' ;
ASTERISK: '*' ;
SLASH: '/' ;
DOT: '.';
SAFE_EQ: '<=>';
EQ: '==';
EQ_: '... | lexer grammar Symbol;
AND_: '&&';
OR_: '||';
NOT_: '!';
UNARY_BIT_COMPLEMENT: '~';
BIT_INCLUSIVE_OR: '|';
BIT_AND: '&';
SIGNED_LEFT_SHIFT: '<<';
SIGNED_RIGHT_SHIFT: '>>';
BIT_EXCLUSIVE_OR: '^';
MOD_: '%';
COLON:':';
COLONCOLON:'::';
PLUS: '+' ;
MINUS: '-' ;
ASTERISK: '*' ;
SLASH: '/' ;
DOT: '.';
SAFE_EQ: '<=>';... | add COLONCOLON | add COLONCOLON
| ANTLR | apache-2.0 | apache/incubator-shardingsphere,leeyazhou/sharding-jdbc,leeyazhou/sharding-jdbc,apache/incubator-shardingsphere,leeyazhou/sharding-jdbc,apache/incubator-shardingsphere,apache/incubator-shardingsphere,leeyazhou/sharding-jdbc |
e192c8253eaac1cf5ab596305515832690c66efb | src/main/antlr4/org/s1ck/gdl/GDL.g4 | src/main/antlr4/org/s1ck/gdl/GDL.g4 | /*
* Copyright 2017 The GDL Authors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to ... | /*
* Copyright 2017 The GDL Authors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to ... | Allow single EOL in GDL input | Allow single EOL in GDL input
| ANTLR | apache-2.0 | s1ck/gdl |
0d2f8f3a48e0609dd4ae7996237dca056f0944a4 | objc/ObjectiveCParser.g4 | objc/ObjectiveCParser.g4 | /*
Objective-C grammar.
The MIT License (MIT).
Copyright (c) 2016-2017, Alex Petuschak (alex@swiftify.io).
Copyright (c) 2016-2017, Ivan Kochurkin (kvanttt@gmail.com).
Converted to ANTLR 4 by Terence Parr; added @property and a few others.
Updated June 2014, Carlos Mejia. Fix try-catch, add support for @( @{ @[ and bl... | /*
Objective-C grammar.
The MIT License (MIT).
Copyright (c) 2016-2017, Alex Petuschak (alex@swiftify.io).
Copyright (c) 2016-2017, Ivan Kochurkin (kvanttt@gmail.com).
Converted to ANTLR 4 by Terence Parr; added @property and a few others.
Updated June 2014, Carlos Mejia. Fix try-catch, add support for @( @{ @[ and bl... | Add nest generic type support, such as ’NSDictionary<NSNumber *, NSArray<NSString *> *>’. | Add nest generic type support, such as ’NSDictionary<NSNumber *, NSArray<NSString *> *>’.
| ANTLR | mit | antlr/grammars-v4,antlr/grammars-v4,antlr/grammars-v4,antlr/grammars-v4,antlr/grammars-v4,antlr/grammars-v4,antlr/grammars-v4,antlr/grammars-v4,antlr/grammars-v4,antlr/grammars-v4,antlr/grammars-v4,antlr/grammars-v4 |
7232d121c70396086c6d3c9b75dda14c98d7c248 | sharding-core/src/main/antlr4/imports/SQLServerKeyword.g4 | sharding-core/src/main/antlr4/imports/SQLServerKeyword.g4 | lexer grammar SQLServerKeyword;
import Symbol;
ABORT_AFTER_WAIT
: A B O R T UL_ A F T E R UL_ W A I T
;
ACTION
: A C T I O N
;
ALGORITHM
: A L G O R I T H M
;
ALLOW_PAGE_LOCKS
: A L L O W UL_ P A G E UL_ L O C K S
;
ALLOW_ROW_LOCKS
: A L L O W UL_ R O W UL_ L O C K S
;
ALL... | lexer grammar SQLServerKeyword;
import Symbol;
ABORT_AFTER_WAIT
: A B O R T UL_ A F T E R UL_ W A I T
;
ACTION
: A C T I O N
;
ALGORITHM
: A L G O R I T H M
;
ALLOW_PAGE_LOCKS
: A L L O W UL_ P A G E UL_ L O C K S
;
ALLOW_ROW_LOCKS
: A L L O W UL_ R O W UL_ L O C K S
;
ALL... | add keyword | add keyword
| ANTLR | apache-2.0 | apache/incubator-shardingsphere,leeyazhou/sharding-jdbc,apache/incubator-shardingsphere,leeyazhou/sharding-jdbc,leeyazhou/sharding-jdbc,leeyazhou/sharding-jdbc,apache/incubator-shardingsphere,apache/incubator-shardingsphere |
c5b5ec60ca76d3ac7df15118252591f63d36618c | src/main/antlr/com/github/oreissig/footran1/parser/Footran.g4 | src/main/antlr/com/github/oreissig/footran1/parser/Footran.g4 | grammar Footran;
@header {
package com.github.oreissig.footran1.parser;
}
@lexer::members {
/**
* FORTRAN-I encapsulates type information in its identifiers, but
* unfortunately there are cases that require context to be certain:
* IDs with 4 or more characters ending with 'F' may either denote a
* non-subscripte... | /*
* A grammar for the original version of FORTRAN as described
* by IBM's programmer's reference manual from 1956:
* http://www.fortran.com/FortranForTheIBM704.pdf
*
* This grammar tries to keep its wording close to the original
* language reference, e.g. an array is called subscripted
* variable.
*/
grammar... | add description to grammar | add description to grammar
| ANTLR | isc | oreissig/FOOTRAN-I |
5996409186a27badff87fb586039362c03633f12 | sharding-core/sharding-core-parse/sharding-core-parse-mysql/src/main/antlr4/imports/mysql/DDLStatement.g4 | sharding-core/sharding-core-parse/sharding-core-parse-mysql/src/main/antlr4/imports/mysql/DDLStatement.g4 | /*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may ... | /*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may ... | rename to createTableSpecification_ | rename to createTableSpecification_
| ANTLR | apache-2.0 | leeyazhou/sharding-jdbc,leeyazhou/sharding-jdbc,apache/incubator-shardingsphere,apache/incubator-shardingsphere,leeyazhou/sharding-jdbc,apache/incubator-shardingsphere,apache/incubator-shardingsphere,leeyazhou/sharding-jdbc |
987b2ae6cca339a474c6eb50775c4f6969531d4f | omni-cx2x/src/cx2x/translator/language/Claw.g4 | omni-cx2x/src/cx2x/translator/language/Claw.g4 | /*
* This file is released under terms of BSD license
* See LICENSE file for more information
*/
/**
* ANTLR 4 Grammar file for the CLAW directive language.
*
* @author clementval
*/
grammar Claw;
@header
{
import cx2x.translator.common.ClawConstant;
import cx2x.translator.misc.Utility;
}
/*------------------... | /*
* This file is released under terms of BSD license
* See LICENSE file for more information
*/
/**
* ANTLR 4 Grammar file for the CLAW directive language.
*
* @author clementval
*/
grammar Claw;
@header
{
import cx2x.translator.common.ClawConstant;
import cx2x.translator.misc.Utility;
}
/*------------------... | Add EOF add the end of rules | Add EOF add the end of rules
| ANTLR | bsd-2-clause | clementval/claw-compiler,clementval/claw-compiler |
3e881a3d78eee053cebd556e8c375a5fea914b04 | objc/ObjectiveCParser.g4 | objc/ObjectiveCParser.g4 | /*
Objective-C grammar.
The MIT License (MIT).
Copyright (c) 2016-2017, Alex Petuschak (alex@swiftify.io).
Copyright (c) 2016-2017, Ivan Kochurkin (kvanttt@gmail.com).
Converted to ANTLR 4 by Terence Parr; added @property and a few others.
Updated June 2014, Carlos Mejia. Fix try-catch, add support for @( @{ @[ and bl... | /*
Objective-C grammar.
The MIT License (MIT).
Copyright (c) 2016-2017, Alex Petuschak (alex@swiftify.io).
Copyright (c) 2016-2017, Ivan Kochurkin (kvanttt@gmail.com).
Converted to ANTLR 4 by Terence Parr; added @property and a few others.
Updated June 2014, Carlos Mejia. Fix try-catch, add support for @( @{ @[ and bl... | Support nested statement expression for ObjectiveCParser | Support nested statement expression for ObjectiveCParser
like,
self.attr = ({
1 + 1
}); | ANTLR | mit | antlr/grammars-v4,antlr/grammars-v4,antlr/grammars-v4,antlr/grammars-v4,antlr/grammars-v4,antlr/grammars-v4,antlr/grammars-v4,antlr/grammars-v4,antlr/grammars-v4,antlr/grammars-v4,antlr/grammars-v4,antlr/grammars-v4 |
fc580611c3edc6f9ff346d085644f45e0c562a72 | src/main/antlr4/YokohamaUnitLexer.g4 | src/main/antlr4/YokohamaUnitLexer.g4 | lexer grammar YokohamaUnitLexer;
STAR_LBRACKET: '*[' [ \t]* -> mode(ABBREVIATION);
HASHES: Hashes [ \t]* -> mode(UNTIL_EOL) ;
TEST: Hashes [ \t]* 'Test:' [ \t]* -> mode(UNTIL_EOL);
SETUP: Hashes [ \t]* 'Setup:' [ \t]* -> mode(UNTIL_EOL);
EXERCISE: Hashes [ \t]* 'Exercise:' [ \t]* -> mode(UNTIL_EO... | lexer grammar YokohamaUnitLexer;
STAR_LBRACKET: '*[' [ \t]* -> mode(ABBREVIATION);
HASHES: Hashes [ \t]* -> mode(UNTIL_EOL) ;
TEST: Hashes [ \t]* 'Test:' [ \t]* -> mode(UNTIL_EOL);
SETUP: Hashes [ \t]* 'Setup:' [ \t]* -> mode(UNTIL_EOL);
EXERCISE: Hashes [ \t]* 'Exercise:' [ \t]* -> mode(UNTIL_EO... | Add 'any of' and 'or' tokens | Add 'any of' and 'or' tokens | ANTLR | mit | tkob/yokohamaunit,tkob/yokohamaunit |
955dc5eb41bffdd7ab9dcf2230083dfb2da271ed | src/net/hillsdon/reviki/wiki/renderer/creole/parser/Creole.g4 | src/net/hillsdon/reviki/wiki/renderer/creole/parser/Creole.g4 | /* Todo:
* - Inline html [<html>]foo[</html>]
* - Comments justifying and explaining every rule.
* - Allow arbitrarily-nested lists (see actions/attributes)
*/
parser grammar Creole;
options { tokenVocab=CreoleTokens; }
@members {
public boolean nobreaks = false;
}
/* ***** Top level elements ***** */
cre... | /* Todo:
* - Inline html [<html>]foo[</html>]
* - Comments justifying and explaining every rule.
* - Allow arbitrarily-nested lists (see actions/attributes)
*/
parser grammar Creole;
options { tokenVocab=CreoleTokens; }
@members {
public boolean nobreaks = false;
}
/* ***** Top level elements ***** */
cre... | Handle trailing linebreaks after a block | Handle trailing linebreaks after a block
| ANTLR | apache-2.0 | ashirley/reviki,CoreFiling/reviki,CoreFiling/reviki,strr/reviki,ashirley/reviki,ashirley/reviki,strr/reviki,CoreFiling/reviki,CoreFiling/reviki,ashirley/reviki,strr/reviki,strr/reviki,ashirley/reviki,CoreFiling/reviki,strr/reviki |
ea08d9eaad422214e83ddf10db1873faaa577559 | sharding-core/src/main/antlr4/imports/MySQLComments.g4 | sharding-core/src/main/antlr4/imports/MySQLComments.g4 | lexer grammar MySQLComments;
import Symbol;
BLOCK_COMMENT
: SLASH_ ASTERISK_ .*? ASTERISK_ SLASH_ -> channel(HIDDEN)
;
SL_COMMENT
: MINUS_ MINUS_ ~[\r\n]* -> channel(HIDDEN)
;
| lexer grammar MySQLComments;
import Symbol;
BLOCK_COMMENT: SLASH_ ASTERISK_ .*? ASTERISK_ SLASH_ -> channel(HIDDEN);
INLINE_COMMENT: MINUS_ MINUS_ ~[\r\n]* -> channel(HIDDEN);
| update MySQLComments.g4 | update MySQLComments.g4
| ANTLR | apache-2.0 | apache/incubator-shardingsphere,leeyazhou/sharding-jdbc,apache/incubator-shardingsphere,leeyazhou/sharding-jdbc,apache/incubator-shardingsphere,leeyazhou/sharding-jdbc,apache/incubator-shardingsphere,leeyazhou/sharding-jdbc |
cbd8393a4593acf8c6739b8801c81aae230d5e17 | vrj.g4 | vrj.g4 | /**
* MIT License
*
* Copyright (c) 2017 Franco Montenegro
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, cop... | /**
* MIT License
*
* Copyright (c) 2017 Franco Montenegro
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, cop... | Add scope to grammar | Add scope to grammar
| ANTLR | mit | Ruk33/vrJASS2 |
7b2595a389d97b31ac054e962281358a3c3c0d43 | refal/refal.g4 | refal/refal.g4 | /*
BSD License
Copyright (c) 2021, Tom Everett
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and t... | /*
BSD License
Copyright (c) 2021, Tom Everett
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and t... | Update refal/refal.g4 | Update refal/refal.g4
Co-authored-by: Ivan Kochurkin <7704623aa56c2b72c3121ff876cc07e7c36aec52@gmail.com> | ANTLR | mit | antlr/grammars-v4,antlr/grammars-v4,antlr/grammars-v4,antlr/grammars-v4,antlr/grammars-v4,antlr/grammars-v4,antlr/grammars-v4,antlr/grammars-v4,antlr/grammars-v4,antlr/grammars-v4,antlr/grammars-v4,antlr/grammars-v4 |
3a47b466ee59198445eeacd1e107cdfcbbcdc934 | src/net/hillsdon/reviki/wiki/renderer/creole/parser/CreoleTokens.g4 | src/net/hillsdon/reviki/wiki/renderer/creole/parser/CreoleTokens.g4 | /* Todo:
* - Comments justifying and explaining every rule.
*/
lexer grammar CreoleTokens;
options { superClass=ContextSensitiveLexer; }
@members {
Formatting bold;
Formatting italic;
Formatting strike;
public void setupFormatting() {
bold = new Formatting("**");
italic = new Formatting("//");
... | /* Todo:
* - Comments justifying and explaining every rule.
*/
lexer grammar CreoleTokens;
options { superClass=ContextSensitiveLexer; }
@members {
Formatting bold;
Formatting italic;
Formatting strike;
public void setupFormatting() {
bold = new Formatting("**");
italic = new Formatting("//");
... | Allow mailto: to start a raw url | Allow mailto: to start a raw url
| ANTLR | apache-2.0 | ashirley/reviki,CoreFiling/reviki,ashirley/reviki,strr/reviki,strr/reviki,CoreFiling/reviki,CoreFiling/reviki,ashirley/reviki,CoreFiling/reviki,strr/reviki,ashirley/reviki,strr/reviki,strr/reviki,CoreFiling/reviki,ashirley/reviki |
e1961a5e4752d9bab5bc9ad09bda4daa546f675f | sharding-core/src/main/antlr4/imports/PostgreKeyword.g4 | sharding-core/src/main/antlr4/imports/PostgreKeyword.g4 | lexer grammar PostgreKeyword;
import Symbol;
ACTION
: A C T I O N
;
ARRAY
: A R R A Y
;
BIT
: B I T
;
BRIN
: B R I N
;
BTREE
: B T R E E
;
CACHE
: C A C H E
;
CAST
: C A S T
;
CHARACTER
: C H A R A C T E R
;
COLLATE
: C O L L A T E
;
... | lexer grammar PostgreKeyword;
import Symbol;
ACTION
: A C T I O N
;
ARRAY
: A R R A Y
;
BIT
: B I T
;
BRIN
: B R I N
;
BTREE
: B T R E E
;
CACHE
: C A C H E
;
CAST
: C A S T
;
CHARACTER
: C H A R A C T E R
;
CLUSTER
: C L U S T E R
;
... | Add missiong Keyword | Add missiong Keyword
| ANTLR | apache-2.0 | leeyazhou/sharding-jdbc,apache/incubator-shardingsphere,apache/incubator-shardingsphere,leeyazhou/sharding-jdbc,apache/incubator-shardingsphere,leeyazhou/sharding-jdbc,leeyazhou/sharding-jdbc,apache/incubator-shardingsphere |
b10b053d6a1fa11ec3aeac4b3b56e0d4fd32aedb | reo-compiler/src/main/antlr4/nl/cwi/reo/parse/Reo.g4 | reo-compiler/src/main/antlr4/nl/cwi/reo/parse/Reo.g4 | grammar Reo;
/**
* Generic structure
*/
file : (comp | defn)* EOF
;
defn : 'define' ID params? portset '{' atom '}' # defnAtomic
| 'define' ID params? nodeset '{' comp* '}' # defnComposed
;
comp : ID assign? nodeset # compReference
| 'for' ID '='... | grammar Reo;
/**
* Generic structure
*/
file : (comp | defn)* EOF
;
defn : 'define' ID params? portset '{' atom '}' # defnAtomic
| 'define' ID params? nodeset '{' comp* '}' # defnComposed
;
comp : ID assign? nodeset # compReference
| 'for' ID '='... | Update Reo.g4 | Update Reo.g4 | ANTLR | mit | kasperdokter/Reo,kasperdokter/Reo-compiler,kasperdokter/Reo-compiler,kasperdokter/Reo,kasperdokter/Reo-compiler,kasperdokter/Reo-compiler,kasperdokter/Reo,kasperdokter/Reo-compiler,kasperdokter/Reo |
9cd32f36b4ba3c331b3d9d751ac41b46661b5a3b | runtime/Java/src/org/antlr/v4/runtime/tree/xpath/XPathLexer.g4 | runtime/Java/src/org/antlr/v4/runtime/tree/xpath/XPathLexer.g4 | lexer grammar XPathLexer;
@header {package org.antlr.v4.runtime.tree.xpath;}
tokens { TOKEN_REF, RULE_REF }
// "//|/|//[!]|/\\[!]|\\w+|'.+?'|[*]"
// TODO: handle escapes in strings?
/*
path : separator? word (separator word)* EOF ;
separator
: '/' '!'
| '//' '!'
| '/'
| '//'
;
word: TOKEN_REF
| RULE_REF
|... | lexer grammar XPathLexer;
tokens { TOKEN_REF, RULE_REF }
/*
path : separator? word (separator word)* EOF ;
separator
: '/' '!'
| '//' '!'
| '/'
| '//'
;
word: TOKEN_REF
| RULE_REF
| STRING
| '*'
;
*/
ANYWHERE : '//' ;
ROOT : '/' ;
WILDCARD : '*' ;
BANG : '!' ;
ID : NameStartChar NameChar*
{
... | remove comment and package spec from grammar | remove comment and package spec from grammar
| ANTLR | bsd-3-clause | joshids/antlr4,parrt/antlr4,krzkaczor/antlr4,worsht/antlr4,cocosli/antlr4,ericvergnaud/antlr4,supriyantomaftuh/antlr4,sidhart/antlr4,joshids/antlr4,hce/antlr4,chienjchienj/antlr4,hce/antlr4,krzkaczor/antlr4,chandler14362/antlr4,parrt/antlr4,chienjchienj/antlr4,parrt/antlr4,ericvergnaud/antlr4,ericvergnaud/antlr4,Distro... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.