Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

fix some typos #213

Merged
merged 1 commit into from May 27, 2022
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Jump to
Jump to file
Failed to load files.
Diff view
Diff view
2 changes: 1 addition & 1 deletion docs/syntax.md
Expand Up @@ -140,5 +140,5 @@ functor_record_internal ::=

**Comments**: A symbol `#` occurring outside of a string starts a comment that
goes to the end of the line. A combination `/*` occurring anywhere outside a string
starts a comment that goes to the first occurence of `/*`.
starts a comment that goes to the first occurrence of `/*`.

2 changes: 1 addition & 1 deletion examples/Logica_example_Postgres_Quick_Start.ipynb
Expand Up @@ -44,7 +44,7 @@
"\n",
"**Postgres engine is not fully supported** and some functionality can be missing.\n",
"\n",
"Most importantly record composite type and concequently usage of `ArgMax` is limited. However `ArgMax` aggregation should work for predicates defined with\n",
"Most importantly record composite type and consequently usage of `ArgMax` is limited. However `ArgMax` aggregation should work for predicates defined with\n",
"a single rule because Logica in this case gets rid of the record at compile time.\n",
"\n",
"You can also implement `ArgMax` with two steps: picking `Max` value and then joining the argument which produced this value, see example below.\n"
Expand Down
2 changes: 1 addition & 1 deletion lib/closure.l
Expand Up @@ -12,7 +12,7 @@
# Without recursion in the language we have to unfold recursion into a
# series of non-recursive steps.
# TC<N> is running O(2^N) SQL querries and is capturing chains of the
# lenght up to 2^(2^(N - 1)).
# length up to 2^(2^(N - 1)).


TC0(a, b) distinct :- R(a, b);
Expand Down
2 changes: 1 addition & 1 deletion parser_py/parse.py
Expand Up @@ -1083,7 +1083,7 @@ def ParseRule(s: HeritageAwareString) -> Dict:

def SplitImport(import_str):
"""Splitting import statement into (path, predicate, synonym)."""
# TODO: It's not ideal to rely on percise spaces.
# TODO: It's not ideal to rely on precise spaces.
import_path_synonym = Split(import_str, ' as ')
if len(import_path_synonym) > 2:
raise ParsingException('Too many "as":' % import_str,
Expand Down
4 changes: 2 additions & 2 deletions tutorial/Logica_tutorial.ipynb
Expand Up @@ -2073,7 +2073,7 @@
"source": [
"### Expressions\n",
"\n",
"You can use basic operators as in most popular laguages. String concatenation is done via `++`."
"You can use basic operators as in most popular languages. String concatenation is done via `++`."
]
},
{
Expand Down Expand Up @@ -49123,7 +49123,7 @@
"source": [
"### Injectible and Concrete predicates\n",
"\n",
"A predicate denoted with `distinct` keyword is called _aggregating_. Note that `distinct` can be implict if aggregated value.\n",
"A predicate denoted with `distinct` keyword is called _aggregating_. Note that `distinct` can be implicit if aggregated value.\n",
"\n",
"```\n",
"# Example 1 of aggregating predicate.\n",
Expand Down