From c2bc3cb9394aefdd714278d6b6414e71be358402 Mon Sep 17 00:00:00 2001 From: Lars Melchior Date: Sun, 14 Apr 2019 15:21:07 +0200 Subject: [PATCH] update cmake (v1.8) (#38) * update cmake (v1.8) * update readme * update cmake --- CMakeLists.txt | 8 ++------ README.md | 4 ++-- 2 files changed, 4 insertions(+), 8 deletions(-) diff --git a/CMakeLists.txt b/CMakeLists.txt index 4e6b70a..fcd200b 100644 --- a/CMakeLists.txt +++ b/CMakeLists.txt @@ -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 ) diff --git a/README.md b/README.md index 76956ec..9674cb7 100644 --- a/README.md +++ b/README.md @@ -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 ) @@ -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 -------