English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

CPEG is an extended parsing expression grammar with regex-like captureannotation. Two annotations (capture and left-folding) allow a flexibleconstruction of syntax trees from arbitrary parsing patterns. More importantly,CPEG is designed to guarantee structural constraints of syntax trees for anyinput strings. This reduces the amount of user code needed to check whether theintended elements exist.  To represent the structural constraints, we focus on regular expressiontypes, a variant formalism of tree automata, which have been intensivelystudied in the context of XML schemas. Regular expression type is inferred froma given CPEG by the type inference that is formally developed in this paper. Weprove the soundness and the uniqueness of the type inference. The typeinference enables a CPEG to serve both as a syntactic specification of theinput and a schematic specification of the output.

CPEG: A Typed Tree Construction from Parsing Expression Grammars with Regex-Like Captures