jruby-prism-parser 0.23.0.pre.SNAPSHOT-java

data/docs/serialization.md

@@ -0,0 +1,209 @@
+# Serialization
+
+Prism ships with the ability to serialize a syntax tree to a single string.
+The string can then be deserialized back into a syntax tree using a language other than C.
+This is useful for using the parsing logic in other tools without having to write a parser in that language.
+The syntax tree still requires a copy of the original source, as for the most part it just contains byte offsets into the source string.
+
+## Types
+
+Let us define some simple types for readability.
+
+### varuint
+
+A variable-length unsigned integer with the value fitting in `uint32_t` using between 1 and 5 bytes, using the [LEB128](https://en.wikipedia.org/wiki/LEB128) encoding.
+This drastically cuts down on the size of the serialized string, especially when the source file is large.
+
+### varsint
+
+A variable-length signed integer with the value fitting in `int32_t` using between 1 and 5 bytes, using [ZigZag encoding](https://protobuf.dev/programming-guides/encoding/#signed-ints) into [LEB128].
+
+### string
+
+| # bytes | field |
+| --- | --- |
+| varuint | the length of the string in bytes |
+| ... | the string bytes |
+
+### location
+
+| # bytes | field |
+| --- | --- |
+| varuint | byte offset into the source string where this location begins |
+| varuint | length of the location in bytes in the source string |
+
+### comment
+
+The comment type is one of:
+
+* 0=`INLINE` (`# comment`)
+* 1=`EMBEDDED_DOCUMENT` (`=begin`/`=end`)
+
+| # bytes | field |
+| --- | --- |
+| `1` | comment type |
+| location | the location in the source of this comment |
+
+### magic comment
+
+| # bytes | field |
+| --- | --- |
+| location | the location of the key of the magic comment |
+| location | the location of the value of the magic comment |
+
+### error
+
+| # bytes | field |
+| --- | --- |
+| string | error message (ASCII-only characters) |
+| location | the location in the source this error applies to |
+| `1` | the level of the error: `0` for `fatal` |
+
+## warning
+
+| # bytes | field |
+| --- | --- |
+| string | warning message (ASCII-only characters) |
+| location | the location in the source this warning applies to |
+| `1` | the level of the warning: `0` for `default` and `1` for `verbose` |
+
+## Structure
+
+The serialized string representing the syntax tree is composed of three parts: the header, the body, and the constant pool.
+The header contains information like the version of prism that serialized the tree.
+The body contains the actual nodes in the tree.
+The constant pool contains constants that were interned while parsing.
+
+The header is structured like the following table:
+
+| # bytes | field |
+| --- | --- |
+| `5` | "PRISM" |
+| `1` | major version number |
+| `1` | minor version number |
+| `1` | patch version number |
+| `1` | 1 indicates only semantics fields were serialized, 0 indicates all fields were serialized (including location fields) |
+| string | the encoding name |
+| varsint | the start line |
+| varuint | number of newline offsets |
+| varuint* | newline offsets |
+| varuint | number of comments |
+| comment* | comments |
+| varuint | number of magic comments |
+| magic comment* | magic comments |
+| location? | the optional location of the `__END__` keyword and its contents |
+| varuint | number of errors |
+| error* | errors |
+| varuint | number of warnings |
+| warning* | warnings |
+| `4` | content pool offset |
+| varuint | content pool size |
+
+After the header comes the body of the serialized string.
+The body consists of a sequence of nodes that is built using a prefix traversal order of the syntax tree.
+Each node is structured like the following table:
+
+| # bytes | field |
+| --- | --- |
+| `1` | node type |
+| location | node location |
+
+Every field on the node is then appended to the serialized string. The fields can be determined by referencing `config.yml`. Depending on the type of field, it could take a couple of different forms, described below:
+
+* `node` - A field that is a node. This is structured just as like parent node.
+* `node?` - A field that is a node that is optionally present. If the node is not present, then a single `0` byte will be written in its place. If it is present, then it will be structured just as like parent node.
+* `node[]` - A field that is an array of nodes. This is structured as a variable-length integer length, followed by the child nodes themselves.
+* `string` - A field that is a string. For example, this is used as the name of the method in a call node, since it cannot directly reference the source string (as in `@-` or `foo=`). This is structured as a variable-length integer byte length, followed by the string itself (_without_ a trailing null byte).
+* `constant` - A variable-length integer that represents an index in the constant pool.
+* `constant?` - An optional variable-length integer that represents an index in the constant pool. If it's not present, then a single `0` byte will be written in its place.
+* `location` - A field that is a location. This is structured as a variable-length integer start followed by a variable-length integer length.
+* `location?` - A field that is a location that is optionally present. If the location is not present, then a single `0` byte will be written in its place. If it is present, then it will be structured just like the `location` child node.
+* `uint8` - A field that is an 8-bit unsigned integer. This is structured as a single byte.
+* `uint32` - A field that is a 32-bit unsigned integer. This is structured as a variable-length integer.
+
+After the syntax tree, the content pool is serialized. This is a list of constants that were referenced from within the tree. The content pool begins at the offset specified in the header. Constants can be either "owned" (in which case their contents are embedded in the serialization) or "shared" (in which case their contents represent a slice of the source string). The most significant bit of the constant indicates whether it is owned or shared.
+
+In the case that it is owned, the constant is structured as follows:
+
+| # bytes | field |
+| --- | --- |
+| `4` | the byte offset in the serialization for the contents of the constant |
+| `4` | the byte length in the serialization |
+
+Note that you will need to mask off the most significant bit for the byte offset in the serialization. In the case that it is shared, the constant is structured as follows:
+
+| # bytes | field |
+| --- | --- |
+| `4` | the byte offset in the source string for the contents of the constant |
+| `4` | the byte length in the source string |
+
+After the constant pool, the contents of the owned constants are serialized. This is just a sequence of bytes that represent the contents of the constants. At the end of the serialization, the buffer is null terminated.
+
+## APIs
+
+The relevant APIs and struct definitions are listed below:
+
+```c
+// A pm_buffer_t is a simple memory buffer that stores data in a contiguous
+// block of memory. It is used to store the serialized representation of a
+// prism tree.
+typedef struct {
+  char *value;
+  size_t length;
+  size_t capacity;
+} pm_buffer_t;
+
+// Free the memory associated with the buffer.
+void pm_buffer_free(pm_buffer_t *);
+
+// Parse and serialize the AST represented by the given source to the given
+// buffer.
+void pm_serialize_parse(pm_buffer_t *buffer, const uint8_t *source, size_t length, const char *data);
+```
+
+Typically you would use a stack-allocated `pm_buffer_t` and call `pm_serialize_parse`, as in:
+
+```c
+void
+serialize(const uint8_t *source, size_t length) {
+  pm_buffer_t buffer = { 0 };
+  pm_serialize_parse(&buffer, source, length, NULL);
+
+  // Do something with the serialized string.
+
+  pm_buffer_free(&buffer);
+}
+```
+
+The final argument to `pm_serialize_parse` is an optional string that controls the options to the parse function. This includes all of the normal options that could be passed to `pm_parser_init` through a `pm_options_t` struct, but serialized as a string to make it easier for callers through FFI. Note that no `varuint` are used here to make it easier to produce the data for the caller, and also serialized size is less important here. The format of the data is structured as follows:
+
+| # bytes | field                      |
+| ------- | -------------------------- |
+| `4`     | the length of the filepath |
+| ...     | the filepath bytes         |
+| `4`     | the line number            |
+| `4`     | the length the encoding    |
+| ...     | the encoding bytes         |
+| `1`     | frozen string literal      |
+| `1`     | suppress warnings          |
+| `1`     | syntax version, see [pm_options_version_t](https://github.com/ruby/prism/blob/main/include/prism/options.h) for valid values |
+| `4`     | the number of scopes       |
+| ...     | the scopes                 |
+
+Scopes are ordered from the outermost scope to the innermost one.
+
+Each scope is layed out as follows:
+
+| # bytes | field                      |
+| ------- | -------------------------- |
+| `4`     | the number of locals       |
+| ...     | the locals                 |
+
+Each local is layed out as follows:
+
+| # bytes | field                      |
+| ------- | -------------------------- |
+| `4`     | the length of the local    |
+| ...     | the local bytes            |
+
+The data can be `NULL` (as seen in the example above).

data/docs/testing.md

@@ -0,0 +1,55 @@
+# Testing
+
+This document explains how to test prism, both locally, and against existing test suites.
+
+## Test suite
+
+`rake test` will run all of the files in the `test/` directory. This can be conceived of as two parts: unit tests, and snapshot tests.
+
+### Unit tests
+
+These test specific prism implementation details like comments, errors, and regular expressions. There are corresponding files for each thing being tested (like `test/errors_test.rb`).
+
+### Snapshot tests
+
+Snapshot tests ensure that parsed output is equivalent to previous parsed output. There are many categorized examples of valid syntax within the `test/prism/fixtures/` directory. When the test suite runs, it will parse all of this syntax, and compare it against corresponding files in the `test/prism/snapshots/` directory. For example, `test/prism/fixtures/strings.txt` has a corresponding `test/prism/snapshots/strings.txt`.
+
+If the parsed files do not match, it will raise an error. If there is not a corresponding file in the `test/prism/snapshots/` directory, one will be created so that it exists for the next test run.
+
+### Testing against repositories
+
+To test the parser against a repository, you can run `FILEPATHS='/path/to/repository/**/*.rb' rake lex`. This will run the parser against every file matched by the glob pattern and check its generated tokens against those generated by ripper.
+
+## Local testing
+
+As you are working, you will likely want to test your code locally. `test.rb` is ignored by git, so it can be used for local testing. There are also two executables which may help you:
+
+1. **bin/lex** takes a filepath and compares prism's lexed output to Ripper's lexed output. It prints any lexed output that doesn't match. It does some minor transformations to the lexed output in order to compare them, like split prism's heredoc tokens to mirror Ripper's.
+
+```
+$ bin/lex test.rb
+```
+
+If you would like to see the full lexed comparison, and not only the output that doesn't match, you can run with `VERBOSE=1`:
+
+```
+$ VERBOSE=1 bin/lex test.rb
+```
+
+`bin/lex` can also be used with `-e` and then source code, like this:
+
+```
+$ bin/lex -e "1 + 2"
+```
+
+2. **bin/parse** takes a filepath and outputs prism's parsed node structure generated from reading the file.
+
+```
+$ bin/parse test.rb
+```
+
+`bin/parse` can also be used with `-e` and then source code, like this:
+
+```
+$ bin/parse -e "1 + 2"
+```