Skip to content

Commit

Permalink
update cmake (v1.8) (#38)
Browse files Browse the repository at this point in the history
* update cmake (v1.8)

* update readme

* update cmake
  • Loading branch information
TheLartians authored Apr 14, 2019
1 parent 522a1bb commit c2bc3cb
Show file tree
Hide file tree
Showing 2 changed files with 4 additions and 8 deletions.
8 changes: 2 additions & 6 deletions CMakeLists.txt
Original file line number Diff line number Diff line change
@@ -1,13 +1,9 @@
cmake_minimum_required(VERSION 3.5 FATAL_ERROR)

if(POLICY CMP0074)
cmake_policy(SET CMP0074 NEW)
endif()
cmake_minimum_required(VERSION 3.14 FATAL_ERROR)

# ---- Project ----

project(LarsParser
VERSION 1.7
VERSION 1.8
LANGUAGES CXX
)

Expand Down
4 changes: 2 additions & 2 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -47,7 +47,7 @@ With [CPM](https://github.com/TheLartians/CPM), lars::parser can be added to you
```cmake
CPMAddPackage(
NAME LarsParser
VERSION 1.7
VERSION 1.8
GIT_REPOSITORY https://github.com/TheLartians/Parser.git
)
Expand All @@ -58,7 +58,7 @@ Alternatively, you can use [FetchContent](https://cmake.org/cmake/help/v3.11/mod

Performance
-----------
lars::parser uses memoization, resulting in linear time complexity (as a function of input string length) for grammars without left-recursion. Left-recursive grammars have squared time complexity in worst case. Memoization can also be disabled on a per-rule basis, reducing the memory footprint.
lars::parser uses memoization, resulting in linear time complexity (as a function of input string length) for grammars without left-recursion. Left-recursive grammars have squared time complexity in worst case. Memoization can also be disabled on a per-rule basis, reducing the memory footprint and allowing context-dependent rules.

License
-------
Expand Down

0 comments on commit c2bc3cb

Please sign in to comment.