Bring repo into compliance with Google open-source policies.

- added AUTHORS, CONTRIBUTORS, and CONTRIBUTING.md files. - removed copyright notices from source files. - rewrote tiny bit of information in BIBLIOGRAPHY that didn't have a CLA. - removed third_party files from repo.
haberman · Jul 8, 2015 · a12a123 · a12a123
1 parent 4e92016
commit a12a123
Show file tree

Hide file tree

Showing 35 changed files with 14 additions and 1,815 deletions.
diff --git a/AUTHORS b/AUTHORS
@@ -0,0 +1,5 @@
+# Copyright Holders.
+
+Google, Inc.
+Joshua Haberman <jhaberman@gmail.com>
+Matt Brubeck <mbrubeck@limpet.net>
diff --git a/CONTRIBUTING.md b/CONTRIBUTING.md
@@ -0,0 +1,7 @@
+## <a name="cla"></a> Signing the CLA
+
+Please sign the [Google Contributor License Agreement
+(CLA)](https://cla.developers.google.com/)
+before sending pull requests. For any code changes to be
+accepted, the CLA must be signed. It's a quick process, I
+promise!
diff --git a/CONTRIBUTORS b/CONTRIBUTORS
@@ -0,0 +1 @@
+# People who have contributed code but are not copyright holders.
diff --git a/LICENSE b/LICENSE
@@ -1,7 +1,4 @@
 
-Copyright (c) 2007-2009, Joshua Haberman
-All rights reserved.
-
 Redistribution and use in source and binary forms, with or without
 modification, are permitted provided that the following conditions are met:
 

diff --git a/compiler/bc.lua b/compiler/bc.lua
@@ -6,8 +6,6 @@
 
   A quick and dirty module for writing files in Bitcode format.
 
-  Copyright (c) 2007 Joshua Haberman.  See LICENSE for details.
-
 --------------------------------------------------------------------]]--
 
 module("bc", package.seeall)

diff --git a/compiler/bootstrap/regex_parser.lua b/compiler/bootstrap/regex_parser.lua
@@ -8,8 +8,6 @@
   Hopefully this could eventually be implemented using the engine itself,
   but even then you need a way to bootstrap.
 
-  Copyright (c) 2007-2008 Joshua Haberman.  See LICENSE for details.
-
 --------------------------------------------------------------------]]--
 
 require "data_structures"

diff --git a/compiler/bootstrap/rtn.lua b/compiler/bootstrap/rtn.lua
@@ -7,8 +7,6 @@
   A parser for our grammar language that builds RTNs representing the
   input grammar.
 
-  Copyright (c) 2007-2008 Joshua Haberman.  See LICENSE for details.
-
 --------------------------------------------------------------------]]--
 
 require "misc"

diff --git a/compiler/bytecode.lua b/compiler/bytecode.lua
@@ -7,8 +7,6 @@
   Code that takes the final optimized parsing structures and emits them
   to bytecode (in Bitcode format).
 
-  Copyright (c) 2007-2008 Joshua Haberman.  See LICENSE for details.
-
 --------------------------------------------------------------------]]--
 
 require "bc"

diff --git a/compiler/data_structures.lua b/compiler/data_structures.lua
@@ -7,8 +7,6 @@
   Implementations of useful data structures that we use often.
   Most of these are just useful interfaces around Lua's tables.
 
-  Copyright (c) 2007-2008 Joshua Haberman.  See LICENSE for details.
-
 --------------------------------------------------------------------]]--
 
 require "misc"

diff --git a/compiler/fa.lua b/compiler/fa.lua
@@ -27,8 +27,6 @@
   of understanding all the different ways NFAs and DFAs are used throughout
   Gazelle.
 
-  Copyright (c) 2007-2008 Joshua Haberman.  See LICENSE for details.
-
 --------------------------------------------------------------------]]--
 
 require "misc"

diff --git a/compiler/fa_algorithms.lua b/compiler/fa_algorithms.lua
@@ -9,8 +9,6 @@
   not interpret the meaning of the edges.  It is nice to keep these
   algorithms separate from the FA data structure in fa.lua.
 
-  Copyright (c) 2008 Joshua Haberman.  See LICENSE for details.
-
 --------------------------------------------------------------------]]--
 
 

diff --git a/compiler/grammar.lua b/compiler/grammar.lua
@@ -21,8 +21,6 @@
 
   Finally, it is written out to bytecode by the bytecode emitting step.
 
-  Copyright (c) 2008 Joshua Haberman.  See LICENSE for details.
-
 --------------------------------------------------------------------]]--
 
 require "data_structures"

diff --git a/compiler/intfa_combine.lua b/compiler/intfa_combine.lua
@@ -11,8 +11,6 @@
   as possible -- only when two terminals conflict is it necessary to
   use different DFAs.
 
-  Copyright (c) 2007 Joshua Haberman.  See LICENSE for details.
-
 --------------------------------------------------------------------]]--
 
 -- Determine what terminals (if any) conflict with each other.

diff --git a/docs/BIBLIOGRAPHY b/docs/BIBLIOGRAPHY
@@ -48,7 +48,7 @@ Parr, Terence.  The Definitive ANTLR Reference, 2007
    and semantic predicates.
 
 
-Parr, Terence.  ANTLR 3.0 Lookahead Analysis (December 06, 2006 entry)
+Parr, Terence.  ANTLR 3.0 Lookahead Analysis (blog entry from 2006-12-06)
    Available online at http://www.antlr.org/blog/antlr3/lookahead.tml
 
    ANTLR's algorithm for calculating LL(*) lookahead turns out to be quite

diff --git a/lang_ext/lua/bc_read_stream.c b/lang_ext/lua/bc_read_stream.c
@@ -6,8 +6,6 @@
 
   These are Lua wrappers for bc_read_stream.
 
-  Copyright (c) 2007 Joshua Haberman.  See LICENSE for details.
-
 *********************************************************************/
 
 #include "bc_read_stream_lua.h"

diff --git a/lang_ext/lua/gazelle.c b/lang_ext/lua/gazelle.c
@@ -6,8 +6,6 @@
 
   These are Lua wrappers for Gazelle.
 
-  Copyright (c) 2007-2008 Joshua Haberman.  See LICENSE for details.
-
 *********************************************************************/
 
 #include <gazelle/parse.h>

diff --git a/runtime/bc_read_stream.c b/runtime/bc_read_stream.c
@@ -9,8 +9,6 @@
   memory at a time, and is designed to have a very small memory
   footprint.
 
-  Copyright (c) 2007 Joshua Haberman.  See LICENSE for details.
-
 *********************************************************************/
 
 #include "gazelle/bc_read_stream.h"

diff --git a/runtime/include/gazelle/bc_read_stream.h b/runtime/include/gazelle/bc_read_stream.h
@@ -8,8 +8,6 @@
   in Bitcode format.  It allows skipping blocks and rewinding to the
   beginning of a block.
 
-  Copyright (c) 2007 Joshua Haberman.  See LICENSE for details.
-
 *********************************************************************/
 
 #ifndef BITCODE_READ_STREAM

diff --git a/runtime/include/gazelle/grammar.h b/runtime/include/gazelle/grammar.h
@@ -12,8 +12,6 @@
   A compiled Gazelle grammar consists of a bunch of state machines of
   various kinds -- see the manual for more details.
 
-  Copyright (c) 2007-2009 Joshua Haberman.  See LICENSE for details.
-
 *********************************************************************/
 
 #ifndef GAZELLE_GRAMMAR

diff --git a/runtime/include/gazelle/parse.h b/runtime/include/gazelle/parse.h
@@ -6,8 +6,6 @@
 
   This file presents the public API for parsing text using Gazelle.
 
-  Copyright (c) 2007-2009 Joshua Haberman.  See LICENSE for details.
-
 *********************************************************************/
 
 #ifndef GAZELLE_PARSE

diff --git a/runtime/load_grammar.c b/runtime/load_grammar.c
@@ -7,8 +7,6 @@
   This file contains the code to load data from a bitcode stream into
   the data structures that the interpreter uses to parse.
 
-  Copyright (c) 2007-2008 Joshua Haberman.  See LICENSE for details.
-
 *********************************************************************/
 
 #include <stdlib.h>

diff --git a/runtime/parse.c b/runtime/parse.c
@@ -14,8 +14,6 @@
   The interpreter primarily consists of maintaining the parse stack
   properly and transitioning the frames in response to the input.
 
-  Copyright (c) 2007-2009 Joshua Haberman.  See LICENSE for details.
-
 *********************************************************************/
 
 #include <stdio.h>